On Fri, 3 Jul 2009 10:54:48 -0700 Paul Menage <menage@xxxxxxxxxx> wrote: > >__Unfortunately radix-trees are presented as operating on > > void* data, so one would need to do some typecasting when storing > > BITS_PER_LONG-sized bitfields inside them. > > That would mean adding something a bit like the IDA wrapper that > converts IDR to deal with bitfields? I guess so. > Is the benefit of avoiding a vmalloc() at all costs really worth the > additional complexity Well no. But nor was it worth the additional complexity the last twenty times someone resorted to vmalloc to solve a problem of this nature. Taking a kernel-wide perspective here gives a different answer. However I don't think a little scoreboarding thing (what's the correct term) built around radix-trees would suffice to solve many of those past sins. Whereas a general dynamic array thing would be applicable in many cases. _______________________________________________ Containers mailing list Containers@xxxxxxxxxxxxxxxxxxxxxxxxxx https://lists.linux-foundation.org/mailman/listinfo/containers
