> It's not O(N) with 'poll' and 'select'. Twice as many file descriptors
> means twice as many active file descriptors which means twice as many
> discovered per call to 'poll'. If the calls to 'poll' are further apart
It is O(N), if N if the number of fds queried. The poll code does "at least"
2 * N loops among the set (plus other stuff), and hence it is O(N). Even
if you do N "nop" in your implementation, this becomes O(N) from a
mathematical point of view.
- Davide
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/