The LBA tree implementation only requires that the start addr of
a logical extent be contained within the leaf range. It's entirely
possible for the end of a logical extent to extend past the end addr
of the containing leaf node.
Fixes: https://tracker.ceph.com/issues/52709
Signed-off-by: Samuel Just <sjust@redhat.com>
bool is_parent_of(const lba_node_meta_t &other) const {
return (depth == other.depth + 1) &&
(begin <= other.begin) &&
- (end >= other.end);
+ (end > other.begin);
}
std::pair<lba_node_meta_t, lba_node_meta_t> split_into(laddr_t pivot) const {