btrfs: tree-checker: introduce checks for FREE_SPACE_INFO

Introduce checks for FREE_SPACE_INFO item, which include:

- Key alignment check
  The objectid is the logical bytenr of the chunk/bg, and offset is the
  length of the chunk/bg, thus they should all be aligned to the fs
  block size.

- Item size check
  The FREE_SPACE_INFO should a fix size.

- Flags check
  The flags member should have no other flags than
  BTRFS_FREE_SPACE_USING_BITMAPS.

  For future expansion, introduce a new macro
  BTRFS_FREE_SPACE_FLAGS_MASK for such checks.

  And since we're here, the BTRFS_FREE_SPACE_USING_BITMAPS should not
  use unsigned long long, as the flags is only 32 bits wide.
  So fix that to use unsigned long.

- Extent count check
  That member shows how many free space bitmap/extent items there are
  inside the chunk/bg.

  We know the chunk size (from key->offset), thus there should be at
  most (key->offset >> sectorsize_bits) blocks inside the chunk.
  Use that value as the upper limit and if that counter is larger than
  that, there is a high chance it's a bitflip in high bits.

Reviewed-by: Johannes Thumshirn <johannes.thumshirn@wdc.com>
Signed-off-by: Qu Wenruo <wqu@suse.com>
Reviewed-by: David Sterba <dsterba@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
This commit is contained in:
Qu Wenruo
2026-03-10 08:49:25 +10:30
committed by David Sterba
parent ad0c23c97b
commit 52e71eb95c
2 changed files with 52 additions and 1 deletions
+50
View File
@@ -1945,6 +1945,53 @@ static int check_dev_extent_item(const struct extent_buffer *leaf,
return 0;
}
static int check_free_space_info(struct extent_buffer *leaf, struct btrfs_key *key,
int slot)
{
struct btrfs_fs_info *fs_info = leaf->fs_info;
struct btrfs_free_space_info *fsi;
const u32 blocksize = fs_info->sectorsize;
u32 flags;
if (unlikely(!IS_ALIGNED(key->objectid, blocksize))) {
generic_err(leaf, slot,
"free space info key objectid is not aligned to %u, has " BTRFS_KEY_FMT,
blocksize, BTRFS_KEY_FMT_VALUE(key));
return -EUCLEAN;
}
if (unlikely(!IS_ALIGNED(key->offset, blocksize))) {
generic_err(leaf, slot,
"free space info key offset is not aligned to %u, has " BTRFS_KEY_FMT,
blocksize, BTRFS_KEY_FMT_VALUE(key));
return -EUCLEAN;
}
if (unlikely(btrfs_item_size(leaf, slot) !=
sizeof(struct btrfs_free_space_info))) {
generic_err(leaf, slot,
"invalid item size for free space info, has %u expect %zu",
btrfs_item_size(leaf, slot),
sizeof(struct btrfs_free_space_info));
return -EUCLEAN;
}
fsi = btrfs_item_ptr(leaf, slot, struct btrfs_free_space_info);
flags = btrfs_free_space_flags(leaf, fsi);
if (unlikely(flags & ~BTRFS_FREE_SPACE_FLAGS_MASK)) {
generic_err(leaf, slot,
"unknown flags for free space info, has 0x%x valid mask 0x%lx",
flags, BTRFS_FREE_SPACE_FLAGS_MASK);
return -EUCLEAN;
}
if (unlikely(btrfs_free_space_extent_count(leaf, fsi) >
key->offset >> fs_info->sectorsize_bits)) {
generic_err(leaf, slot,
"suspicious extent count, has %u max valid %llu",
btrfs_free_space_extent_count(leaf, fsi),
key->offset >> fs_info->sectorsize_bits);
return -EUCLEAN;
}
return 0;
}
/*
* Common point to switch the item-specific validation.
*/
@@ -2008,6 +2055,9 @@ static enum btrfs_tree_block_status check_leaf_item(struct extent_buffer *leaf,
case BTRFS_RAID_STRIPE_KEY:
ret = check_raid_stripe_extent(leaf, key, slot);
break;
case BTRFS_FREE_SPACE_INFO_KEY:
ret = check_free_space_info(leaf, key, slot);
break;
}
if (unlikely(ret))
+2 -1
View File
@@ -1245,7 +1245,8 @@ struct btrfs_free_space_info {
__le32 flags;
} __attribute__ ((__packed__));
#define BTRFS_FREE_SPACE_USING_BITMAPS (1ULL << 0)
#define BTRFS_FREE_SPACE_USING_BITMAPS (1UL << 0)
#define BTRFS_FREE_SPACE_FLAGS_MASK (BTRFS_FREE_SPACE_USING_BITMAPS)
#define BTRFS_QGROUP_LEVEL_SHIFT 48
static inline __u16 btrfs_qgroup_level(__u64 qgroupid)