From: Daniel Barkalow <barkalow@iabervon.org>
Date: Wed, 14 Sep 2005 23:23:21 GMT
Subject: Re: [PATCH 21/22] teach the merge algorithm about cache iterators
Message-ID: <Pine.LNX.4.63.0509141901020.23242@iabervon.org>
In-Reply-To: <Pine.LNX.4.58.0509141549270.26803@g5.osdl.org>

On Wed, 14 Sep 2005, Linus Torvalds wrote:

> On Wed, 14 Sep 2005, Chuck Lever wrote:
> > 
> > oh, i see.  the hash table won't help cache_find_name find an insertion 
> > point quickly if the name isn't already in the cache.
> 
> Note that almost all insertion tends to happen linearly.
> 
> In particular, read-tree always inserts things in order.

read-tree (with Chuck's latest work) should actually only append entries 
to an initially-empty list, which is even easier. Dunno about the other 
stuff, but I'd guess inserting into a cursor would handle a lot of it.

	-Daniel
*This .sig left intentionally blank*