Re: A possible direction for the next LVM driver

[Alan Cox]

> When the logical device is accessed, the make_request function looks
> up the correct target for the given sector, and then asks this target
> to do the remapping.

Interesting.

> A btree structure is used to hold the sector range -> target mapping.
> Since we know all the entries in the btree in advance we can make a
> very compact tree, omitting pointers to child nodes, (child nodes
> locations can be calculated).  Typical users would find they only have
> a handful of targets for each logical volume LV.
> Benchmarking with bonnie++ suggests that this is certainly no slower
> than current LVM.

Will it represent single segment filesystems as one node (ie extremely
efficiently). The reason I ask is that one thing EVMS does that I think is
right is that it lets you throw away the whole partitioning business.
Instead  DOS partition format, BSD disklabel etc are simply very limited
logical volumes