lkml.org 
[lkml]   [2002]   [May]   [1]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: 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/

\
 
 \ /
  Last update: 2005-03-22 13:25    [W:0.262 / U:1.896 seconds]
©2003-2017 Jasper Spaans. hosted at Digital OceanAdvertise on this site