print tree;
eprintf "}\n";
+type owner =
+ [ `Filesystem of filesystem
+ | `Partitions of partitions
+ | `PhysicalVolume of pv ]
+
(* A segment describes the owner of a range of disk addresses. *)
type segment =
int63 * int63 * (* disk offset, size of segment *)
- [ `Filesystem of filesystem
- | `Partitions of partitions
- | `PhysicalVolume of pv ] * (* owner *)
+ owner * (* owner *)
int63 (* owner offset *)
type interval = int63 * int63 (* start point, end point (bytes) *)
(* Return the ownership structure. *)
ownership
+
+let get_owners_lookup machine ownership disk =
+ (* Get the correct tree. *)
+ let tree = List.assoc disk ownership in
+
+ fun offset ->
+ let rec query = function
+ | Leaf (_, segments) -> segments
+ | Node ((Leaf ((_, leftend), _) | Node (_, ((_, leftend), _), _) as left),
+ (_, segments),
+ right) ->
+ let subsegments =
+ if offset < leftend then query left else query right in
+ segments @ subsegments
+ in
+ let owners = query tree in
+
+ List.map (
+ fun (_, _, owner, owner_offset) -> (owner, offset -^ owner_offset)
+ ) owners