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

[Trond Myklebust <trond.myklebust@fys.uio.no>]

må den 29.08.2005 Klokka 13:37 (+1000) skreiv Nick Piggin:
> James Bottomley wrote:
> > On Sun, 2005-08-28 at 18:35 -0700, Andrew Morton wrote:
> 
> >>It does make the tree higher and hence will incur some more cache missing
> >>when descending the tree.
> > 
> > 
> > Actually, I don't think it does:  the common user is the page tree.
> > Obviously, I've changed nothing on 64 bits, so we only need to consider
> > what I've done on 32 bits.  A page size is almost universally 4k on 32
> > bit, so we need 20 bits to store the page tree index.  Regardless of
> > whether the index size is 5 or 6, that gives a radix tree depth of 4.
> > 
> 
> s/common/only ?

grep again... I use it in the NFS client for bookkeeping requests.

Cheers,
  Trond

-
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/