Re: [patch] radix-tree: use indirect bit

2007-08-06 Thread Nick Piggin
On Mon, Aug 06, 2007 at 11:40:55AM -0700, Andrew Morton wrote: > On Thu, 2 Aug 2007 07:24:46 +0200 Nick Piggin <[EMAIL PROTECTED]> wrote: > > > Rather than sign direct radix-tree pointers with a special bit, sign > > the indirect one that hangs off the root. This means that, given a > > lookup_slo

Re: [patch] radix-tree: use indirect bit

2007-08-06 Thread Andrew Morton
On Thu, 2 Aug 2007 07:24:46 +0200 Nick Piggin <[EMAIL PROTECTED]> wrote: > Rather than sign direct radix-tree pointers with a special bit, sign > the indirect one that hangs off the root. This means that, given a > lookup_slot operation, the invalid result will be differentiated from > the valid (

Re: [patch] radix-tree: use indirect bit

2007-08-02 Thread Peter Zijlstra
On Thu, 2007-08-02 at 07:24 +0200, Nick Piggin wrote: > Rather than sign direct radix-tree pointers with a special bit, sign > the indirect one that hangs off the root. This means that, given a > lookup_slot operation, the invalid result will be differentiated from > the valid (previously, valid re