[lkml]   [2003]   [Mar]   [17]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: [RFC] O(1) proc_pid_readdir

On Sun, 16 Mar 2003, William Lee Irwin III wrote:

> I'm heavily on the side of deterministic bounds here (these things trip
> the NMI oopser, so if the bounds aren't deterministic, neither is
> stability), so I favor manfred's proc_pid_readdir() algorithm.

no, the code in question here is worst-case O(nr_tasks). It is worst-case
quadratic only if the number of syscalls done during a full 'ps' readdir()
sequence is considered as well. This thing will never trigger the NMI
oopser. And in the common-case it has constant overhead.


To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to
More majordomo info at
Please read the FAQ at

 \ /
  Last update: 2005-03-22 13:34    [W:0.063 / U:1.188 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site