Re: [PATCH] Radix-tree pagecache for 2.5

From: Christoph Hellwig (hch@ns.caldera.de)
Date: Tue Jan 29 2002 - 18:45:35 EST

Next message: Eric S. Raymond: "Re: A modest proposal -- We need a patch penguin"
Previous message: Daniel Phillips: "Re: A modest proposal -- We need a patch penguin"
In reply to: Linus Torvalds: "Re: [PATCH] Radix-tree pagecache for 2.5"
Next in thread: Momchil Velikov: "Re: [PATCH] Radix-tree pagecache for 2.5"
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

In article <Pine.LNX.4.33.0201291515480.1747-100000@penguin.transmeta.com> you wrote:
> it _looks_ like the way the radix_node is done, it will
> basically always be a factor-of-two+1 words, which sounds like the worst
> possible schenario from an allocator standpoint.

One advantage of the slab allocator is that if works efficiently with
odd object sizes..

Christoph

-- 
Of course it doesn't work. We've performed a software upgrade.
-
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/

Next message: Eric S. Raymond: "Re: A modest proposal -- We need a patch penguin"
Previous message: Daniel Phillips: "Re: A modest proposal -- We need a patch penguin"
In reply to: Linus Torvalds: "Re: [PATCH] Radix-tree pagecache for 2.5"
Next in thread: Momchil Velikov: "Re: [PATCH] Radix-tree pagecache for 2.5"
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

This archive was generated by hypermail 2b29 : Thu Jan 31 2002 - 21:01:09 EST