return 0;
}
+static int check_remap_key(const struct extent_buffer *leaf,
+ const struct btrfs_key *key, int slot)
+{
+ const u32 item_size = btrfs_item_size(leaf, slot);
+ const u32 sectorsize = leaf->fs_info->sectorsize;
+ u64 end;
+
+ if (unlikely(!btrfs_fs_incompat(leaf->fs_info, REMAP_TREE))) {
+ generic_err(leaf, slot,
+ "remap key type %u present but REMAP_TREE incompat bit unset",
+ key->type);
+ return -EUCLEAN;
+ }
+
+ switch (key->type) {
+ case BTRFS_IDENTITY_REMAP_KEY:
+ if (unlikely(item_size != 0)) {
+ generic_err(leaf, slot,
+ "invalid item size for IDENTITY_REMAP, have %u expect 0",
+ item_size);
+ return -EUCLEAN;
+ }
+ break;
+ case BTRFS_REMAP_KEY:
+ case BTRFS_REMAP_BACKREF_KEY:
+ if (unlikely(item_size != sizeof(struct btrfs_remap_item))) {
+ generic_err(leaf, slot,
+ "invalid item size for remap key type %u, have %u expect %zu",
+ key->type, item_size,
+ sizeof(struct btrfs_remap_item));
+ return -EUCLEAN;
+ }
+ break;
+ }
+
+ if (unlikely(key->offset == 0)) {
+ generic_err(leaf, slot,
+ "invalid remap key length, have 0 expect nonzero");
+ return -EUCLEAN;
+ }
+
+ if (unlikely(!IS_ALIGNED(key->objectid, sectorsize))) {
+ generic_err(leaf, slot,
+ "invalid remap key objectid, have %llu expect aligned to %u",
+ key->objectid, sectorsize);
+ return -EUCLEAN;
+ }
+
+ if (unlikely(!IS_ALIGNED(key->offset, sectorsize))) {
+ generic_err(leaf, slot,
+ "invalid remap key offset (length), have %llu expect aligned to %u",
+ key->offset, sectorsize);
+ return -EUCLEAN;
+ }
+
+ if (unlikely(check_add_overflow(key->objectid, key->offset, &end))) {
+ generic_err(leaf, slot,
+ "remap key overflow, objectid %llu + offset %llu wraps",
+ key->objectid, key->offset);
+ return -EUCLEAN;
+ }
+
+ return 0;
+}
+
static int check_dev_extent_item(const struct extent_buffer *leaf,
const struct btrfs_key *key,
int slot,
case BTRFS_FREE_SPACE_BITMAP_KEY:
ret = check_free_space_bitmap(leaf, key, slot);
break;
+ case BTRFS_IDENTITY_REMAP_KEY:
+ case BTRFS_REMAP_KEY:
+ case BTRFS_REMAP_BACKREF_KEY:
+ ret = check_remap_key(leaf, key, slot);
+ break;
}
if (unlikely(ret))