Re: [PATCH] make radix tree gang lookup faster by using a bitmapsearch

[Andrew Morton]

Nick Piggin <nickpiggin@xxxxxxxxxxxx> wrote:
>
> But of course gang lookup is only useful if a single read() call
>  asks for more than 1 page - is that a performance critical path?

readahead should do gang lookups (or, preferably, find-next, when it's
implemented).  But nobody got around to it.
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/