[Felix von Leitner]
> I don't know how Linux does it, but returning the first free file
> descriptor can be implemented as O(1) operation.

How exactly?  Maybe I'm being dense today.  Having used up the lowest
available fd, how do you find the next-lowest one, the next open()?  I
can't think of anything that isn't O(n).  (Sure you can amortize it
different ways by keeping lists of fds, etc.)

Peter
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to [EMAIL PROTECTED]
Please read the FAQ at http://www.tux.org/lkml/

Reply via email to