Messages in this thread |  | | From | Daniel Phillips <> | Subject | Re: Bug: Discontigmem virt_to_page() [Alpha,ARM,Mips64?] | Date | Wed, 1 May 2002 04:02:33 +0200 |
| |
On Thursday 02 May 2002 03:45, William Lee Irwin III wrote: > On Wed, May 01, 2002 at 03:35:20AM +0200, Daniel Phillips wrote: > > to use a hash table instead of a table lookup. Bill Irwin suggested a btree > > would work here as well. > > I remember suggesting a sorted array of extents on which binary > search could be performed. A B-tree seems unlikely but perhaps if > it were contiguously allocated and some other tricks done it might > do, maybe I don't remember the special sauce used for the occasion.
Thanks for the correction. When you said 'extents' I automatically thought 'btree of extents'. I'd tend to go for the hash table anyway - your binary search is going to take quite a few more steps to terminate than the bucket search, given some reasonable choice of hash table size.
-- Daniel - 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/
|  |