Messages in this thread | | | Date | Wed, 1 May 2002 18:45:04 -0700 | From | William Lee Irwin III <> | Subject | Re: Bug: Discontigmem virt_to_page() [Alpha,ARM,Mips64?] |
| |
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.
Cheers, Bill - 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/
| |