James Bottomley <[email protected]> wrote:
>
> Of course, if we're going to go to all this trouble, the next question
> that arises naturally is why not just reuse the radix-tree code to
> implement idr anyway ... ?
Yes, we could probably have gone that way. radix-tree would need some
enhancements for the find-next-above thing.
radix-tree has some features (tags, gang-lookup, gang-lookup-by-tag) which
idr doesn't. Fitting them all into the one storage API would be nice, I
guess. radix-tree does potentially use more memory, although that'll only
be significant for collections which are both large and sparse.
Still, people can use either facility at present. The person who does any
such consolidation would do the kernel-wide migration at the same time.
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to [email protected]
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
[Index of Archives]
[Kernel Newbies]
[Netfilter]
[Bugtraq]
[Photo]
[Gimp]
[Yosemite News]
[MIPS Linux]
[ARM Linux]
[Linux Security]
[Linux RAID]
[Video 4 Linux]
[Linux for the blind]
| |
 |