Messages in this thread | | | Date | Thu, 16 Oct 2003 21:56:15 -0700 | From | William Lee Irwin III <> | Subject | Re: /proc reliability & performance |
| |
On Fri, Oct 17, 2003 at 12:31:14AM -0400, Albert Cahalan wrote: > Count tasks as you read them. The number is > your directory offset. Return a few dozen entries > at a time. For each read, you'll need to find > back your place. You do this by counting tasks > until you reach your offset. Of course, tasks > will have been created and destroyed between > reads, so who knows where you'll continue from? > That's simply not reliable.
That's part of what the rbtree algorithm was meant to address. It does find_tgids_after(tgids, tgid_array), filling a buffer with the tgids starting at the first one higher than its first argument. This way there is no possibility whatsoever of duplicates or deviation from sorted order.
-- wli - 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/
| |