lkml.org 
[lkml]   [2007]   [Jun]   [4]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [patch 1/2] ufd v1 - unsequential O(1) fdmap core
On Sun, 3 Jun 2007 15:51:13 -0700 (PDT) Davide Libenzi <davidel@xmailserver.org> wrote:

> A bitmap allocator made sense because it has the property of making
> allocations compact. Once that requirement is relaxed, it does not make
> any sense to use it (and you have still to modify it in any case).
> I generally agree on code re-use, but that just not the right structure.
> You can tweak it how much you like, but you're still doing a search inside
> an N-sized bitmap. It's just the *wrong* structure.

I must say that it's not really clear to me why this fdmap thing was
created. Exactly what problem is it solving, and what properties is it
designed to have?

Could not a (prehaps suitably modified) IDR tree have adequately provided
those properties?

I'm sure it's good stuff, but the patches were presented as if we all know
what they're for. But I don't. Maybe I was asleep at the time.

-
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: 2007-06-04 08:13    [W:0.045 / U:0.912 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site