tree 8a926518f4fc061f536eedc9d27383d794cc9501
parent f85108f6ad86b1ac3a49f3717367e4524e14f142
author Darrick J. Wong <djwong@kernel.org> 1641507205 -0800
committer Darrick J. Wong <djwong@kernel.org> 1647553229 -0700

xfs: teach xfs_btree_has_record to return false if there are gaps

The current implementation of xfs_btree_has_record returns true if it
finds /any/ record within the given range.  Unfortunately, that's not
what the predicate is supposed to do -- it's supposed to test if the
/entire/ range is covered by records.

Therefore, enhance the routine to check that the first record it
encounters starts earlier or at the same point as the low key, the last
record ends at or after the same point as the high key, and that there
aren't any gaps in the records.

Signed-off-by: Darrick J. Wong <djwong@kernel.org>