1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (C) Qu Wenruo 2017. All rights reserved.
7 * The module is used to catch unexpected/corrupted tree block data.
8 * Such behavior can be caused either by a fuzzed image or bugs.
10 * The objective is to do leaf/node validation checks when tree block is read
11 * from disk, and check *every* possible member, so other code won't
12 * need to checking them again.
14 * Due to the potential and unwanted damage, every checker needs to be
15 * carefully reviewed otherwise so it does not prevent mount of valid images.
18 #include <linux/types.h>
19 #include <linux/stddef.h>
20 #include <linux/error-injection.h>
22 #include "tree-checker.h"
24 #include "compression.h"
29 * Error message should follow the following format:
30 * corrupt <type>: <identifier>, <reason>[, <bad_value>]
33 * @identifier: the necessary info to locate the leaf/node.
34 * It's recommended to decode key.objecitd/offset if it's
36 * @reason: describe the error
37 * @bad_value: optional, it's recommended to output bad value and its
38 * expected value (range).
40 * Since comma is used to separate the components, only space is allowed
41 * inside each component.
45 * Append generic "corrupt leaf/node root=%llu block=%llu slot=%d: " to @fmt.
46 * Allows callers to customize the output.
50 static void generic_err(const struct extent_buffer *eb, int slot,
53 const struct btrfs_fs_info *fs_info = eb->fs_info;
63 "corrupt %s: root=%llu block=%llu slot=%d, %pV",
64 btrfs_header_level(eb) == 0 ? "leaf" : "node",
65 btrfs_header_owner(eb), btrfs_header_bytenr(eb), slot, &vaf);
70 * Customized reporter for extent data item, since its key objectid and
71 * offset has its own meaning.
75 static void file_extent_err(const struct extent_buffer *eb, int slot,
78 const struct btrfs_fs_info *fs_info = eb->fs_info;
83 btrfs_item_key_to_cpu(eb, &key, slot);
90 "corrupt %s: root=%llu block=%llu slot=%d ino=%llu file_offset=%llu, %pV",
91 btrfs_header_level(eb) == 0 ? "leaf" : "node",
92 btrfs_header_owner(eb), btrfs_header_bytenr(eb), slot,
93 key.objectid, key.offset, &vaf);
98 * Return 0 if the btrfs_file_extent_##name is aligned to @alignment
101 #define CHECK_FE_ALIGNED(leaf, slot, fi, name, alignment) \
103 if (!IS_ALIGNED(btrfs_file_extent_##name((leaf), (fi)), (alignment))) \
104 file_extent_err((leaf), (slot), \
105 "invalid %s for file extent, have %llu, should be aligned to %u", \
106 (#name), btrfs_file_extent_##name((leaf), (fi)), \
108 (!IS_ALIGNED(btrfs_file_extent_##name((leaf), (fi)), (alignment))); \
111 static u64 file_extent_end(struct extent_buffer *leaf,
112 struct btrfs_key *key,
113 struct btrfs_file_extent_item *extent)
118 if (btrfs_file_extent_type(leaf, extent) == BTRFS_FILE_EXTENT_INLINE) {
119 len = btrfs_file_extent_ram_bytes(leaf, extent);
120 end = ALIGN(key->offset + len, leaf->fs_info->sectorsize);
122 len = btrfs_file_extent_num_bytes(leaf, extent);
123 end = key->offset + len;
129 * Customized report for dir_item, the only new important information is
130 * key->objectid, which represents inode number
134 static void dir_item_err(const struct extent_buffer *eb, int slot,
135 const char *fmt, ...)
137 const struct btrfs_fs_info *fs_info = eb->fs_info;
138 struct btrfs_key key;
139 struct va_format vaf;
142 btrfs_item_key_to_cpu(eb, &key, slot);
149 "corrupt %s: root=%llu block=%llu slot=%d ino=%llu, %pV",
150 btrfs_header_level(eb) == 0 ? "leaf" : "node",
151 btrfs_header_owner(eb), btrfs_header_bytenr(eb), slot,
157 * This functions checks prev_key->objectid, to ensure current key and prev_key
158 * share the same objectid as inode number.
160 * This is to detect missing INODE_ITEM in subvolume trees.
162 * Return true if everything is OK or we don't need to check.
163 * Return false if anything is wrong.
165 static bool check_prev_ino(struct extent_buffer *leaf,
166 struct btrfs_key *key, int slot,
167 struct btrfs_key *prev_key)
169 /* No prev key, skip check */
173 /* Only these key->types needs to be checked */
174 ASSERT(key->type == BTRFS_XATTR_ITEM_KEY ||
175 key->type == BTRFS_INODE_REF_KEY ||
176 key->type == BTRFS_DIR_INDEX_KEY ||
177 key->type == BTRFS_DIR_ITEM_KEY ||
178 key->type == BTRFS_EXTENT_DATA_KEY);
181 * Only subvolume trees along with their reloc trees need this check.
182 * Things like log tree doesn't follow this ino requirement.
184 if (!is_fstree(btrfs_header_owner(leaf)))
187 if (key->objectid == prev_key->objectid)
191 dir_item_err(leaf, slot,
192 "invalid previous key objectid, have %llu expect %llu",
193 prev_key->objectid, key->objectid);
196 static int check_extent_data_item(struct extent_buffer *leaf,
197 struct btrfs_key *key, int slot,
198 struct btrfs_key *prev_key)
200 struct btrfs_fs_info *fs_info = leaf->fs_info;
201 struct btrfs_file_extent_item *fi;
202 u32 sectorsize = fs_info->sectorsize;
203 u32 item_size = btrfs_item_size_nr(leaf, slot);
206 if (!IS_ALIGNED(key->offset, sectorsize)) {
207 file_extent_err(leaf, slot,
208 "unaligned file_offset for file extent, have %llu should be aligned to %u",
209 key->offset, sectorsize);
214 * Previous key must have the same key->objectid (ino).
215 * It can be XATTR_ITEM, INODE_ITEM or just another EXTENT_DATA.
216 * But if objectids mismatch, it means we have a missing
219 if (!check_prev_ino(leaf, key, slot, prev_key))
222 fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item);
225 * Make sure the item contains at least inline header, so the file
226 * extent type is not some garbage.
228 if (item_size < BTRFS_FILE_EXTENT_INLINE_DATA_START) {
229 file_extent_err(leaf, slot,
230 "invalid item size, have %u expect [%zu, %u)",
231 item_size, BTRFS_FILE_EXTENT_INLINE_DATA_START,
235 if (btrfs_file_extent_type(leaf, fi) >= BTRFS_NR_FILE_EXTENT_TYPES) {
236 file_extent_err(leaf, slot,
237 "invalid type for file extent, have %u expect range [0, %u]",
238 btrfs_file_extent_type(leaf, fi),
239 BTRFS_NR_FILE_EXTENT_TYPES - 1);
244 * Support for new compression/encryption must introduce incompat flag,
245 * and must be caught in open_ctree().
247 if (btrfs_file_extent_compression(leaf, fi) >= BTRFS_NR_COMPRESS_TYPES) {
248 file_extent_err(leaf, slot,
249 "invalid compression for file extent, have %u expect range [0, %u]",
250 btrfs_file_extent_compression(leaf, fi),
251 BTRFS_NR_COMPRESS_TYPES - 1);
254 if (btrfs_file_extent_encryption(leaf, fi)) {
255 file_extent_err(leaf, slot,
256 "invalid encryption for file extent, have %u expect 0",
257 btrfs_file_extent_encryption(leaf, fi));
260 if (btrfs_file_extent_type(leaf, fi) == BTRFS_FILE_EXTENT_INLINE) {
261 /* Inline extent must have 0 as key offset */
263 file_extent_err(leaf, slot,
264 "invalid file_offset for inline file extent, have %llu expect 0",
269 /* Compressed inline extent has no on-disk size, skip it */
270 if (btrfs_file_extent_compression(leaf, fi) !=
274 /* Uncompressed inline extent size must match item size */
275 if (item_size != BTRFS_FILE_EXTENT_INLINE_DATA_START +
276 btrfs_file_extent_ram_bytes(leaf, fi)) {
277 file_extent_err(leaf, slot,
278 "invalid ram_bytes for uncompressed inline extent, have %u expect %llu",
279 item_size, BTRFS_FILE_EXTENT_INLINE_DATA_START +
280 btrfs_file_extent_ram_bytes(leaf, fi));
286 /* Regular or preallocated extent has fixed item size */
287 if (item_size != sizeof(*fi)) {
288 file_extent_err(leaf, slot,
289 "invalid item size for reg/prealloc file extent, have %u expect %zu",
290 item_size, sizeof(*fi));
293 if (CHECK_FE_ALIGNED(leaf, slot, fi, ram_bytes, sectorsize) ||
294 CHECK_FE_ALIGNED(leaf, slot, fi, disk_bytenr, sectorsize) ||
295 CHECK_FE_ALIGNED(leaf, slot, fi, disk_num_bytes, sectorsize) ||
296 CHECK_FE_ALIGNED(leaf, slot, fi, offset, sectorsize) ||
297 CHECK_FE_ALIGNED(leaf, slot, fi, num_bytes, sectorsize))
300 /* Catch extent end overflow */
301 if (check_add_overflow(btrfs_file_extent_num_bytes(leaf, fi),
302 key->offset, &extent_end)) {
303 file_extent_err(leaf, slot,
304 "extent end overflow, have file offset %llu extent num bytes %llu",
306 btrfs_file_extent_num_bytes(leaf, fi));
311 * Check that no two consecutive file extent items, in the same leaf,
312 * present ranges that overlap each other.
315 prev_key->objectid == key->objectid &&
316 prev_key->type == BTRFS_EXTENT_DATA_KEY) {
317 struct btrfs_file_extent_item *prev_fi;
320 prev_fi = btrfs_item_ptr(leaf, slot - 1,
321 struct btrfs_file_extent_item);
322 prev_end = file_extent_end(leaf, prev_key, prev_fi);
323 if (prev_end > key->offset) {
324 file_extent_err(leaf, slot - 1,
325 "file extent end range (%llu) goes beyond start offset (%llu) of the next file extent",
326 prev_end, key->offset);
334 static int check_csum_item(struct extent_buffer *leaf, struct btrfs_key *key,
335 int slot, struct btrfs_key *prev_key)
337 struct btrfs_fs_info *fs_info = leaf->fs_info;
338 u32 sectorsize = fs_info->sectorsize;
339 u32 csumsize = btrfs_super_csum_size(fs_info->super_copy);
341 if (key->objectid != BTRFS_EXTENT_CSUM_OBJECTID) {
342 generic_err(leaf, slot,
343 "invalid key objectid for csum item, have %llu expect %llu",
344 key->objectid, BTRFS_EXTENT_CSUM_OBJECTID);
347 if (!IS_ALIGNED(key->offset, sectorsize)) {
348 generic_err(leaf, slot,
349 "unaligned key offset for csum item, have %llu should be aligned to %u",
350 key->offset, sectorsize);
353 if (!IS_ALIGNED(btrfs_item_size_nr(leaf, slot), csumsize)) {
354 generic_err(leaf, slot,
355 "unaligned item size for csum item, have %u should be aligned to %u",
356 btrfs_item_size_nr(leaf, slot), csumsize);
359 if (slot > 0 && prev_key->type == BTRFS_EXTENT_CSUM_KEY) {
363 prev_item_size = btrfs_item_size_nr(leaf, slot - 1);
364 prev_csum_end = (prev_item_size / csumsize) * sectorsize;
365 prev_csum_end += prev_key->offset;
366 if (prev_csum_end > key->offset) {
367 generic_err(leaf, slot - 1,
368 "csum end range (%llu) goes beyond the start range (%llu) of the next csum item",
369 prev_csum_end, key->offset);
376 /* Inode item error output has the same format as dir_item_err() */
377 #define inode_item_err(eb, slot, fmt, ...) \
378 dir_item_err(eb, slot, fmt, __VA_ARGS__)
380 static int check_inode_key(struct extent_buffer *leaf, struct btrfs_key *key,
383 struct btrfs_key item_key;
386 btrfs_item_key_to_cpu(leaf, &item_key, slot);
387 is_inode_item = (item_key.type == BTRFS_INODE_ITEM_KEY);
389 /* For XATTR_ITEM, location key should be all 0 */
390 if (item_key.type == BTRFS_XATTR_ITEM_KEY) {
391 if (key->type != 0 || key->objectid != 0 || key->offset != 0)
396 if ((key->objectid < BTRFS_FIRST_FREE_OBJECTID ||
397 key->objectid > BTRFS_LAST_FREE_OBJECTID) &&
398 key->objectid != BTRFS_ROOT_TREE_DIR_OBJECTID &&
399 key->objectid != BTRFS_FREE_INO_OBJECTID) {
401 generic_err(leaf, slot,
402 "invalid key objectid: has %llu expect %llu or [%llu, %llu] or %llu",
403 key->objectid, BTRFS_ROOT_TREE_DIR_OBJECTID,
404 BTRFS_FIRST_FREE_OBJECTID,
405 BTRFS_LAST_FREE_OBJECTID,
406 BTRFS_FREE_INO_OBJECTID);
408 dir_item_err(leaf, slot,
409 "invalid location key objectid: has %llu expect %llu or [%llu, %llu] or %llu",
410 key->objectid, BTRFS_ROOT_TREE_DIR_OBJECTID,
411 BTRFS_FIRST_FREE_OBJECTID,
412 BTRFS_LAST_FREE_OBJECTID,
413 BTRFS_FREE_INO_OBJECTID);
417 if (key->offset != 0) {
419 inode_item_err(leaf, slot,
420 "invalid key offset: has %llu expect 0",
423 dir_item_err(leaf, slot,
424 "invalid location key offset:has %llu expect 0",
431 static int check_root_key(struct extent_buffer *leaf, struct btrfs_key *key,
434 struct btrfs_key item_key;
437 btrfs_item_key_to_cpu(leaf, &item_key, slot);
438 is_root_item = (item_key.type == BTRFS_ROOT_ITEM_KEY);
440 /* No such tree id */
441 if (key->objectid == 0) {
443 generic_err(leaf, slot, "invalid root id 0");
445 dir_item_err(leaf, slot,
446 "invalid location key root id 0");
450 /* DIR_ITEM/INDEX/INODE_REF is not allowed to point to non-fs trees */
451 if (!is_fstree(key->objectid) && !is_root_item) {
452 dir_item_err(leaf, slot,
453 "invalid location key objectid, have %llu expect [%llu, %llu]",
454 key->objectid, BTRFS_FIRST_FREE_OBJECTID,
455 BTRFS_LAST_FREE_OBJECTID);
460 * ROOT_ITEM with non-zero offset means this is a snapshot, created at
462 * Furthermore, for location key in DIR_ITEM, its offset is always -1.
464 * So here we only check offset for reloc tree whose key->offset must
467 if (key->objectid == BTRFS_TREE_RELOC_OBJECTID && key->offset == 0) {
468 generic_err(leaf, slot, "invalid root id 0 for reloc tree");
474 static int check_dir_item(struct extent_buffer *leaf,
475 struct btrfs_key *key, struct btrfs_key *prev_key,
478 struct btrfs_fs_info *fs_info = leaf->fs_info;
479 struct btrfs_dir_item *di;
480 u32 item_size = btrfs_item_size_nr(leaf, slot);
483 if (!check_prev_ino(leaf, key, slot, prev_key))
485 di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item);
486 while (cur < item_size) {
494 /* header itself should not cross item boundary */
495 if (cur + sizeof(*di) > item_size) {
496 dir_item_err(leaf, slot,
497 "dir item header crosses item boundary, have %zu boundary %u",
498 cur + sizeof(*di), item_size);
503 dir_type = btrfs_dir_type(leaf, di);
504 if (dir_type >= BTRFS_FT_MAX) {
505 dir_item_err(leaf, slot,
506 "invalid dir item type, have %u expect [0, %u)",
507 dir_type, BTRFS_FT_MAX);
511 if (key->type == BTRFS_XATTR_ITEM_KEY &&
512 dir_type != BTRFS_FT_XATTR) {
513 dir_item_err(leaf, slot,
514 "invalid dir item type for XATTR key, have %u expect %u",
515 dir_type, BTRFS_FT_XATTR);
518 if (dir_type == BTRFS_FT_XATTR &&
519 key->type != BTRFS_XATTR_ITEM_KEY) {
520 dir_item_err(leaf, slot,
521 "xattr dir type found for non-XATTR key");
524 if (dir_type == BTRFS_FT_XATTR)
525 max_name_len = XATTR_NAME_MAX;
527 max_name_len = BTRFS_NAME_LEN;
529 /* Name/data length check */
530 name_len = btrfs_dir_name_len(leaf, di);
531 data_len = btrfs_dir_data_len(leaf, di);
532 if (name_len > max_name_len) {
533 dir_item_err(leaf, slot,
534 "dir item name len too long, have %u max %u",
535 name_len, max_name_len);
538 if (name_len + data_len > BTRFS_MAX_XATTR_SIZE(fs_info)) {
539 dir_item_err(leaf, slot,
540 "dir item name and data len too long, have %u max %u",
542 BTRFS_MAX_XATTR_SIZE(fs_info));
546 if (data_len && dir_type != BTRFS_FT_XATTR) {
547 dir_item_err(leaf, slot,
548 "dir item with invalid data len, have %u expect 0",
553 total_size = sizeof(*di) + name_len + data_len;
555 /* header and name/data should not cross item boundary */
556 if (cur + total_size > item_size) {
557 dir_item_err(leaf, slot,
558 "dir item data crosses item boundary, have %u boundary %u",
559 cur + total_size, item_size);
564 * Special check for XATTR/DIR_ITEM, as key->offset is name
565 * hash, should match its name
567 if (key->type == BTRFS_DIR_ITEM_KEY ||
568 key->type == BTRFS_XATTR_ITEM_KEY) {
569 char namebuf[max(BTRFS_NAME_LEN, XATTR_NAME_MAX)];
571 read_extent_buffer(leaf, namebuf,
572 (unsigned long)(di + 1), name_len);
573 name_hash = btrfs_name_hash(namebuf, name_len);
574 if (key->offset != name_hash) {
575 dir_item_err(leaf, slot,
576 "name hash mismatch with key, have 0x%016x expect 0x%016llx",
577 name_hash, key->offset);
582 di = (struct btrfs_dir_item *)((void *)di + total_size);
589 static void block_group_err(const struct extent_buffer *eb, int slot,
590 const char *fmt, ...)
592 const struct btrfs_fs_info *fs_info = eb->fs_info;
593 struct btrfs_key key;
594 struct va_format vaf;
597 btrfs_item_key_to_cpu(eb, &key, slot);
604 "corrupt %s: root=%llu block=%llu slot=%d bg_start=%llu bg_len=%llu, %pV",
605 btrfs_header_level(eb) == 0 ? "leaf" : "node",
606 btrfs_header_owner(eb), btrfs_header_bytenr(eb), slot,
607 key.objectid, key.offset, &vaf);
611 static int check_block_group_item(struct extent_buffer *leaf,
612 struct btrfs_key *key, int slot)
614 struct btrfs_block_group_item bgi;
615 u32 item_size = btrfs_item_size_nr(leaf, slot);
620 * Here we don't really care about alignment since extent allocator can
621 * handle it. We care more about the size.
623 if (key->offset == 0) {
624 block_group_err(leaf, slot,
625 "invalid block group size 0");
629 if (item_size != sizeof(bgi)) {
630 block_group_err(leaf, slot,
631 "invalid item size, have %u expect %zu",
632 item_size, sizeof(bgi));
636 read_extent_buffer(leaf, &bgi, btrfs_item_ptr_offset(leaf, slot),
638 if (btrfs_stack_block_group_chunk_objectid(&bgi) !=
639 BTRFS_FIRST_CHUNK_TREE_OBJECTID) {
640 block_group_err(leaf, slot,
641 "invalid block group chunk objectid, have %llu expect %llu",
642 btrfs_stack_block_group_chunk_objectid(&bgi),
643 BTRFS_FIRST_CHUNK_TREE_OBJECTID);
647 if (btrfs_stack_block_group_used(&bgi) > key->offset) {
648 block_group_err(leaf, slot,
649 "invalid block group used, have %llu expect [0, %llu)",
650 btrfs_stack_block_group_used(&bgi), key->offset);
654 flags = btrfs_stack_block_group_flags(&bgi);
655 if (hweight64(flags & BTRFS_BLOCK_GROUP_PROFILE_MASK) > 1) {
656 block_group_err(leaf, slot,
657 "invalid profile flags, have 0x%llx (%lu bits set) expect no more than 1 bit set",
658 flags & BTRFS_BLOCK_GROUP_PROFILE_MASK,
659 hweight64(flags & BTRFS_BLOCK_GROUP_PROFILE_MASK));
663 type = flags & BTRFS_BLOCK_GROUP_TYPE_MASK;
664 if (type != BTRFS_BLOCK_GROUP_DATA &&
665 type != BTRFS_BLOCK_GROUP_METADATA &&
666 type != BTRFS_BLOCK_GROUP_SYSTEM &&
667 type != (BTRFS_BLOCK_GROUP_METADATA |
668 BTRFS_BLOCK_GROUP_DATA)) {
669 block_group_err(leaf, slot,
670 "invalid type, have 0x%llx (%lu bits set) expect either 0x%llx, 0x%llx, 0x%llx or 0x%llx",
671 type, hweight64(type),
672 BTRFS_BLOCK_GROUP_DATA, BTRFS_BLOCK_GROUP_METADATA,
673 BTRFS_BLOCK_GROUP_SYSTEM,
674 BTRFS_BLOCK_GROUP_METADATA | BTRFS_BLOCK_GROUP_DATA);
682 static void chunk_err(const struct extent_buffer *leaf,
683 const struct btrfs_chunk *chunk, u64 logical,
684 const char *fmt, ...)
686 const struct btrfs_fs_info *fs_info = leaf->fs_info;
688 struct va_format vaf;
693 /* Only superblock eb is able to have such small offset */
694 is_sb = (leaf->start == BTRFS_SUPER_INFO_OFFSET);
698 * Get the slot number by iterating through all slots, this
699 * would provide better readability.
701 for (i = 0; i < btrfs_header_nritems(leaf); i++) {
702 if (btrfs_item_ptr_offset(leaf, i) ==
703 (unsigned long)chunk) {
715 "corrupt superblock syschunk array: chunk_start=%llu, %pV",
719 "corrupt leaf: root=%llu block=%llu slot=%d chunk_start=%llu, %pV",
720 BTRFS_CHUNK_TREE_OBJECTID, leaf->start, slot,
726 * The common chunk check which could also work on super block sys chunk array.
728 * Return -EUCLEAN if anything is corrupted.
729 * Return 0 if everything is OK.
731 int btrfs_check_chunk_valid(struct extent_buffer *leaf,
732 struct btrfs_chunk *chunk, u64 logical)
734 struct btrfs_fs_info *fs_info = leaf->fs_info;
743 length = btrfs_chunk_length(leaf, chunk);
744 stripe_len = btrfs_chunk_stripe_len(leaf, chunk);
745 num_stripes = btrfs_chunk_num_stripes(leaf, chunk);
746 sub_stripes = btrfs_chunk_sub_stripes(leaf, chunk);
747 type = btrfs_chunk_type(leaf, chunk);
750 chunk_err(leaf, chunk, logical,
751 "invalid chunk num_stripes, have %u", num_stripes);
754 if (!IS_ALIGNED(logical, fs_info->sectorsize)) {
755 chunk_err(leaf, chunk, logical,
756 "invalid chunk logical, have %llu should aligned to %u",
757 logical, fs_info->sectorsize);
760 if (btrfs_chunk_sector_size(leaf, chunk) != fs_info->sectorsize) {
761 chunk_err(leaf, chunk, logical,
762 "invalid chunk sectorsize, have %u expect %u",
763 btrfs_chunk_sector_size(leaf, chunk),
764 fs_info->sectorsize);
767 if (!length || !IS_ALIGNED(length, fs_info->sectorsize)) {
768 chunk_err(leaf, chunk, logical,
769 "invalid chunk length, have %llu", length);
772 if (!is_power_of_2(stripe_len) || stripe_len != BTRFS_STRIPE_LEN) {
773 chunk_err(leaf, chunk, logical,
774 "invalid chunk stripe length: %llu",
778 if (~(BTRFS_BLOCK_GROUP_TYPE_MASK | BTRFS_BLOCK_GROUP_PROFILE_MASK) &
780 chunk_err(leaf, chunk, logical,
781 "unrecognized chunk type: 0x%llx",
782 ~(BTRFS_BLOCK_GROUP_TYPE_MASK |
783 BTRFS_BLOCK_GROUP_PROFILE_MASK) &
784 btrfs_chunk_type(leaf, chunk));
788 if (!has_single_bit_set(type & BTRFS_BLOCK_GROUP_PROFILE_MASK) &&
789 (type & BTRFS_BLOCK_GROUP_PROFILE_MASK) != 0) {
790 chunk_err(leaf, chunk, logical,
791 "invalid chunk profile flag: 0x%llx, expect 0 or 1 bit set",
792 type & BTRFS_BLOCK_GROUP_PROFILE_MASK);
795 if ((type & BTRFS_BLOCK_GROUP_TYPE_MASK) == 0) {
796 chunk_err(leaf, chunk, logical,
797 "missing chunk type flag, have 0x%llx one bit must be set in 0x%llx",
798 type, BTRFS_BLOCK_GROUP_TYPE_MASK);
802 if ((type & BTRFS_BLOCK_GROUP_SYSTEM) &&
803 (type & (BTRFS_BLOCK_GROUP_METADATA | BTRFS_BLOCK_GROUP_DATA))) {
804 chunk_err(leaf, chunk, logical,
805 "system chunk with data or metadata type: 0x%llx",
810 features = btrfs_super_incompat_flags(fs_info->super_copy);
811 if (features & BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS)
815 if ((type & BTRFS_BLOCK_GROUP_METADATA) &&
816 (type & BTRFS_BLOCK_GROUP_DATA)) {
817 chunk_err(leaf, chunk, logical,
818 "mixed chunk type in non-mixed mode: 0x%llx", type);
823 if ((type & BTRFS_BLOCK_GROUP_RAID10 && sub_stripes != 2) ||
824 (type & BTRFS_BLOCK_GROUP_RAID1 && num_stripes != 2) ||
825 (type & BTRFS_BLOCK_GROUP_RAID5 && num_stripes < 2) ||
826 (type & BTRFS_BLOCK_GROUP_RAID6 && num_stripes < 3) ||
827 (type & BTRFS_BLOCK_GROUP_DUP && num_stripes != 2) ||
828 ((type & BTRFS_BLOCK_GROUP_PROFILE_MASK) == 0 && num_stripes != 1)) {
829 chunk_err(leaf, chunk, logical,
830 "invalid num_stripes:sub_stripes %u:%u for profile %llu",
831 num_stripes, sub_stripes,
832 type & BTRFS_BLOCK_GROUP_PROFILE_MASK);
840 * Enhanced version of chunk item checker.
842 * The common btrfs_check_chunk_valid() doesn't check item size since it needs
843 * to work on super block sys_chunk_array which doesn't have full item ptr.
845 static int check_leaf_chunk_item(struct extent_buffer *leaf,
846 struct btrfs_chunk *chunk,
847 struct btrfs_key *key, int slot)
851 if (btrfs_item_size_nr(leaf, slot) < sizeof(struct btrfs_chunk)) {
852 chunk_err(leaf, chunk, key->offset,
853 "invalid chunk item size: have %u expect [%zu, %u)",
854 btrfs_item_size_nr(leaf, slot),
855 sizeof(struct btrfs_chunk),
856 BTRFS_LEAF_DATA_SIZE(leaf->fs_info));
860 num_stripes = btrfs_chunk_num_stripes(leaf, chunk);
861 /* Let btrfs_check_chunk_valid() handle this error type */
862 if (num_stripes == 0)
865 if (btrfs_chunk_item_size(num_stripes) !=
866 btrfs_item_size_nr(leaf, slot)) {
867 chunk_err(leaf, chunk, key->offset,
868 "invalid chunk item size: have %u expect %lu",
869 btrfs_item_size_nr(leaf, slot),
870 btrfs_chunk_item_size(num_stripes));
874 return btrfs_check_chunk_valid(leaf, chunk, key->offset);
879 static void dev_item_err(const struct extent_buffer *eb, int slot,
880 const char *fmt, ...)
882 struct btrfs_key key;
883 struct va_format vaf;
886 btrfs_item_key_to_cpu(eb, &key, slot);
892 btrfs_crit(eb->fs_info,
893 "corrupt %s: root=%llu block=%llu slot=%d devid=%llu %pV",
894 btrfs_header_level(eb) == 0 ? "leaf" : "node",
895 btrfs_header_owner(eb), btrfs_header_bytenr(eb), slot,
900 static int check_dev_item(struct extent_buffer *leaf,
901 struct btrfs_key *key, int slot)
903 struct btrfs_dev_item *ditem;
905 if (key->objectid != BTRFS_DEV_ITEMS_OBJECTID) {
906 dev_item_err(leaf, slot,
907 "invalid objectid: has=%llu expect=%llu",
908 key->objectid, BTRFS_DEV_ITEMS_OBJECTID);
911 ditem = btrfs_item_ptr(leaf, slot, struct btrfs_dev_item);
912 if (btrfs_device_id(leaf, ditem) != key->offset) {
913 dev_item_err(leaf, slot,
914 "devid mismatch: key has=%llu item has=%llu",
915 key->offset, btrfs_device_id(leaf, ditem));
920 * For device total_bytes, we don't have reliable way to check it, as
921 * it can be 0 for device removal. Device size check can only be done
922 * by dev extents check.
924 if (btrfs_device_bytes_used(leaf, ditem) >
925 btrfs_device_total_bytes(leaf, ditem)) {
926 dev_item_err(leaf, slot,
927 "invalid bytes used: have %llu expect [0, %llu]",
928 btrfs_device_bytes_used(leaf, ditem),
929 btrfs_device_total_bytes(leaf, ditem));
933 * Remaining members like io_align/type/gen/dev_group aren't really
934 * utilized. Skip them to make later usage of them easier.
939 /* Inode item error output has the same format as dir_item_err() */
940 #define inode_item_err(eb, slot, fmt, ...) \
941 dir_item_err(eb, slot, fmt, __VA_ARGS__)
943 static int check_inode_item(struct extent_buffer *leaf,
944 struct btrfs_key *key, int slot)
946 struct btrfs_fs_info *fs_info = leaf->fs_info;
947 struct btrfs_inode_item *iitem;
948 u64 super_gen = btrfs_super_generation(fs_info->super_copy);
949 u32 valid_mask = (S_IFMT | S_ISUID | S_ISGID | S_ISVTX | 0777);
953 ret = check_inode_key(leaf, key, slot);
957 iitem = btrfs_item_ptr(leaf, slot, struct btrfs_inode_item);
959 /* Here we use super block generation + 1 to handle log tree */
960 if (btrfs_inode_generation(leaf, iitem) > super_gen + 1) {
961 inode_item_err(leaf, slot,
962 "invalid inode generation: has %llu expect (0, %llu]",
963 btrfs_inode_generation(leaf, iitem),
967 /* Note for ROOT_TREE_DIR_ITEM, mkfs could set its transid 0 */
968 if (btrfs_inode_transid(leaf, iitem) > super_gen + 1) {
969 inode_item_err(leaf, slot,
970 "invalid inode generation: has %llu expect [0, %llu]",
971 btrfs_inode_transid(leaf, iitem), super_gen + 1);
976 * For size and nbytes it's better not to be too strict, as for dir
977 * item its size/nbytes can easily get wrong, but doesn't affect
978 * anything in the fs. So here we skip the check.
980 mode = btrfs_inode_mode(leaf, iitem);
981 if (mode & ~valid_mask) {
982 inode_item_err(leaf, slot,
983 "unknown mode bit detected: 0x%x",
989 * S_IFMT is not bit mapped so we can't completely rely on
990 * is_power_of_2/has_single_bit_set, but it can save us from checking
991 * FIFO/CHR/DIR/REG. Only needs to check BLK, LNK and SOCKS
993 if (!has_single_bit_set(mode & S_IFMT)) {
994 if (!S_ISLNK(mode) && !S_ISBLK(mode) && !S_ISSOCK(mode)) {
995 inode_item_err(leaf, slot,
996 "invalid mode: has 0%o expect valid S_IF* bit(s)",
1001 if (S_ISDIR(mode) && btrfs_inode_nlink(leaf, iitem) > 1) {
1002 inode_item_err(leaf, slot,
1003 "invalid nlink: has %u expect no more than 1 for dir",
1004 btrfs_inode_nlink(leaf, iitem));
1007 if (btrfs_inode_flags(leaf, iitem) & ~BTRFS_INODE_FLAG_MASK) {
1008 inode_item_err(leaf, slot,
1009 "unknown flags detected: 0x%llx",
1010 btrfs_inode_flags(leaf, iitem) &
1011 ~BTRFS_INODE_FLAG_MASK);
1017 static int check_root_item(struct extent_buffer *leaf, struct btrfs_key *key,
1020 struct btrfs_fs_info *fs_info = leaf->fs_info;
1021 struct btrfs_root_item ri;
1022 const u64 valid_root_flags = BTRFS_ROOT_SUBVOL_RDONLY |
1023 BTRFS_ROOT_SUBVOL_DEAD;
1026 ret = check_root_key(leaf, key, slot);
1030 if (btrfs_item_size_nr(leaf, slot) != sizeof(ri)) {
1031 generic_err(leaf, slot,
1032 "invalid root item size, have %u expect %zu",
1033 btrfs_item_size_nr(leaf, slot), sizeof(ri));
1036 read_extent_buffer(leaf, &ri, btrfs_item_ptr_offset(leaf, slot),
1039 /* Generation related */
1040 if (btrfs_root_generation(&ri) >
1041 btrfs_super_generation(fs_info->super_copy) + 1) {
1042 generic_err(leaf, slot,
1043 "invalid root generation, have %llu expect (0, %llu]",
1044 btrfs_root_generation(&ri),
1045 btrfs_super_generation(fs_info->super_copy) + 1);
1048 if (btrfs_root_generation_v2(&ri) >
1049 btrfs_super_generation(fs_info->super_copy) + 1) {
1050 generic_err(leaf, slot,
1051 "invalid root v2 generation, have %llu expect (0, %llu]",
1052 btrfs_root_generation_v2(&ri),
1053 btrfs_super_generation(fs_info->super_copy) + 1);
1056 if (btrfs_root_last_snapshot(&ri) >
1057 btrfs_super_generation(fs_info->super_copy) + 1) {
1058 generic_err(leaf, slot,
1059 "invalid root last_snapshot, have %llu expect (0, %llu]",
1060 btrfs_root_last_snapshot(&ri),
1061 btrfs_super_generation(fs_info->super_copy) + 1);
1065 /* Alignment and level check */
1066 if (!IS_ALIGNED(btrfs_root_bytenr(&ri), fs_info->sectorsize)) {
1067 generic_err(leaf, slot,
1068 "invalid root bytenr, have %llu expect to be aligned to %u",
1069 btrfs_root_bytenr(&ri), fs_info->sectorsize);
1072 if (btrfs_root_level(&ri) >= BTRFS_MAX_LEVEL) {
1073 generic_err(leaf, slot,
1074 "invalid root level, have %u expect [0, %u]",
1075 btrfs_root_level(&ri), BTRFS_MAX_LEVEL - 1);
1078 if (ri.drop_level >= BTRFS_MAX_LEVEL) {
1079 generic_err(leaf, slot,
1080 "invalid root level, have %u expect [0, %u]",
1081 ri.drop_level, BTRFS_MAX_LEVEL - 1);
1086 if (btrfs_root_flags(&ri) & ~valid_root_flags) {
1087 generic_err(leaf, slot,
1088 "invalid root flags, have 0x%llx expect mask 0x%llx",
1089 btrfs_root_flags(&ri), valid_root_flags);
1097 static void extent_err(const struct extent_buffer *eb, int slot,
1098 const char *fmt, ...)
1100 struct btrfs_key key;
1101 struct va_format vaf;
1106 btrfs_item_key_to_cpu(eb, &key, slot);
1107 bytenr = key.objectid;
1108 if (key.type == BTRFS_METADATA_ITEM_KEY ||
1109 key.type == BTRFS_TREE_BLOCK_REF_KEY ||
1110 key.type == BTRFS_SHARED_BLOCK_REF_KEY)
1111 len = eb->fs_info->nodesize;
1114 va_start(args, fmt);
1119 btrfs_crit(eb->fs_info,
1120 "corrupt %s: block=%llu slot=%d extent bytenr=%llu len=%llu %pV",
1121 btrfs_header_level(eb) == 0 ? "leaf" : "node",
1122 eb->start, slot, bytenr, len, &vaf);
1126 static int check_extent_item(struct extent_buffer *leaf,
1127 struct btrfs_key *key, int slot)
1129 struct btrfs_fs_info *fs_info = leaf->fs_info;
1130 struct btrfs_extent_item *ei;
1131 bool is_tree_block = false;
1132 unsigned long ptr; /* Current pointer inside inline refs */
1133 unsigned long end; /* Extent item end */
1134 const u32 item_size = btrfs_item_size_nr(leaf, slot);
1137 u64 total_refs; /* Total refs in btrfs_extent_item */
1138 u64 inline_refs = 0; /* found total inline refs */
1140 if (key->type == BTRFS_METADATA_ITEM_KEY &&
1141 !btrfs_fs_incompat(fs_info, SKINNY_METADATA)) {
1142 generic_err(leaf, slot,
1143 "invalid key type, METADATA_ITEM type invalid when SKINNY_METADATA feature disabled");
1146 /* key->objectid is the bytenr for both key types */
1147 if (!IS_ALIGNED(key->objectid, fs_info->sectorsize)) {
1148 generic_err(leaf, slot,
1149 "invalid key objectid, have %llu expect to be aligned to %u",
1150 key->objectid, fs_info->sectorsize);
1154 /* key->offset is tree level for METADATA_ITEM_KEY */
1155 if (key->type == BTRFS_METADATA_ITEM_KEY &&
1156 key->offset >= BTRFS_MAX_LEVEL) {
1157 extent_err(leaf, slot,
1158 "invalid tree level, have %llu expect [0, %u]",
1159 key->offset, BTRFS_MAX_LEVEL - 1);
1164 * EXTENT/METADATA_ITEM consists of:
1165 * 1) One btrfs_extent_item
1166 * Records the total refs, type and generation of the extent.
1168 * 2) One btrfs_tree_block_info (for EXTENT_ITEM and tree backref only)
1169 * Records the first key and level of the tree block.
1171 * 2) Zero or more btrfs_extent_inline_ref(s)
1172 * Each inline ref has one btrfs_extent_inline_ref shows:
1173 * 2.1) The ref type, one of the 4
1174 * TREE_BLOCK_REF Tree block only
1175 * SHARED_BLOCK_REF Tree block only
1176 * EXTENT_DATA_REF Data only
1177 * SHARED_DATA_REF Data only
1178 * 2.2) Ref type specific data
1179 * Either using btrfs_extent_inline_ref::offset, or specific
1182 if (item_size < sizeof(*ei)) {
1183 extent_err(leaf, slot,
1184 "invalid item size, have %u expect [%zu, %u)",
1185 item_size, sizeof(*ei),
1186 BTRFS_LEAF_DATA_SIZE(fs_info));
1189 end = item_size + btrfs_item_ptr_offset(leaf, slot);
1191 /* Checks against extent_item */
1192 ei = btrfs_item_ptr(leaf, slot, struct btrfs_extent_item);
1193 flags = btrfs_extent_flags(leaf, ei);
1194 total_refs = btrfs_extent_refs(leaf, ei);
1195 generation = btrfs_extent_generation(leaf, ei);
1196 if (generation > btrfs_super_generation(fs_info->super_copy) + 1) {
1197 extent_err(leaf, slot,
1198 "invalid generation, have %llu expect (0, %llu]",
1200 btrfs_super_generation(fs_info->super_copy) + 1);
1203 if (!has_single_bit_set(flags & (BTRFS_EXTENT_FLAG_DATA |
1204 BTRFS_EXTENT_FLAG_TREE_BLOCK))) {
1205 extent_err(leaf, slot,
1206 "invalid extent flag, have 0x%llx expect 1 bit set in 0x%llx",
1207 flags, BTRFS_EXTENT_FLAG_DATA |
1208 BTRFS_EXTENT_FLAG_TREE_BLOCK);
1211 is_tree_block = !!(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK);
1212 if (is_tree_block) {
1213 if (key->type == BTRFS_EXTENT_ITEM_KEY &&
1214 key->offset != fs_info->nodesize) {
1215 extent_err(leaf, slot,
1216 "invalid extent length, have %llu expect %u",
1217 key->offset, fs_info->nodesize);
1221 if (key->type != BTRFS_EXTENT_ITEM_KEY) {
1222 extent_err(leaf, slot,
1223 "invalid key type, have %u expect %u for data backref",
1224 key->type, BTRFS_EXTENT_ITEM_KEY);
1227 if (!IS_ALIGNED(key->offset, fs_info->sectorsize)) {
1228 extent_err(leaf, slot,
1229 "invalid extent length, have %llu expect aligned to %u",
1230 key->offset, fs_info->sectorsize);
1234 ptr = (unsigned long)(struct btrfs_extent_item *)(ei + 1);
1236 /* Check the special case of btrfs_tree_block_info */
1237 if (is_tree_block && key->type != BTRFS_METADATA_ITEM_KEY) {
1238 struct btrfs_tree_block_info *info;
1240 info = (struct btrfs_tree_block_info *)ptr;
1241 if (btrfs_tree_block_level(leaf, info) >= BTRFS_MAX_LEVEL) {
1242 extent_err(leaf, slot,
1243 "invalid tree block info level, have %u expect [0, %u]",
1244 btrfs_tree_block_level(leaf, info),
1245 BTRFS_MAX_LEVEL - 1);
1248 ptr = (unsigned long)(struct btrfs_tree_block_info *)(info + 1);
1251 /* Check inline refs */
1253 struct btrfs_extent_inline_ref *iref;
1254 struct btrfs_extent_data_ref *dref;
1255 struct btrfs_shared_data_ref *sref;
1260 if (ptr + sizeof(*iref) > end) {
1261 extent_err(leaf, slot,
1262 "inline ref item overflows extent item, ptr %lu iref size %zu end %lu",
1263 ptr, sizeof(*iref), end);
1266 iref = (struct btrfs_extent_inline_ref *)ptr;
1267 inline_type = btrfs_extent_inline_ref_type(leaf, iref);
1268 inline_offset = btrfs_extent_inline_ref_offset(leaf, iref);
1269 if (ptr + btrfs_extent_inline_ref_size(inline_type) > end) {
1270 extent_err(leaf, slot,
1271 "inline ref item overflows extent item, ptr %lu iref size %u end %lu",
1272 ptr, inline_type, end);
1276 switch (inline_type) {
1277 /* inline_offset is subvolid of the owner, no need to check */
1278 case BTRFS_TREE_BLOCK_REF_KEY:
1281 /* Contains parent bytenr */
1282 case BTRFS_SHARED_BLOCK_REF_KEY:
1283 if (!IS_ALIGNED(inline_offset, fs_info->sectorsize)) {
1284 extent_err(leaf, slot,
1285 "invalid tree parent bytenr, have %llu expect aligned to %u",
1286 inline_offset, fs_info->sectorsize);
1292 * Contains owner subvolid, owner key objectid, adjusted offset.
1293 * The only obvious corruption can happen in that offset.
1295 case BTRFS_EXTENT_DATA_REF_KEY:
1296 dref = (struct btrfs_extent_data_ref *)(&iref->offset);
1297 dref_offset = btrfs_extent_data_ref_offset(leaf, dref);
1298 if (!IS_ALIGNED(dref_offset, fs_info->sectorsize)) {
1299 extent_err(leaf, slot,
1300 "invalid data ref offset, have %llu expect aligned to %u",
1301 dref_offset, fs_info->sectorsize);
1304 inline_refs += btrfs_extent_data_ref_count(leaf, dref);
1306 /* Contains parent bytenr and ref count */
1307 case BTRFS_SHARED_DATA_REF_KEY:
1308 sref = (struct btrfs_shared_data_ref *)(iref + 1);
1309 if (!IS_ALIGNED(inline_offset, fs_info->sectorsize)) {
1310 extent_err(leaf, slot,
1311 "invalid data parent bytenr, have %llu expect aligned to %u",
1312 inline_offset, fs_info->sectorsize);
1315 inline_refs += btrfs_shared_data_ref_count(leaf, sref);
1318 extent_err(leaf, slot, "unknown inline ref type: %u",
1322 ptr += btrfs_extent_inline_ref_size(inline_type);
1324 /* No padding is allowed */
1326 extent_err(leaf, slot,
1327 "invalid extent item size, padding bytes found");
1331 /* Finally, check the inline refs against total refs */
1332 if (inline_refs > total_refs) {
1333 extent_err(leaf, slot,
1334 "invalid extent refs, have %llu expect >= inline %llu",
1335 total_refs, inline_refs);
1341 static int check_simple_keyed_refs(struct extent_buffer *leaf,
1342 struct btrfs_key *key, int slot)
1344 u32 expect_item_size = 0;
1346 if (key->type == BTRFS_SHARED_DATA_REF_KEY)
1347 expect_item_size = sizeof(struct btrfs_shared_data_ref);
1349 if (btrfs_item_size_nr(leaf, slot) != expect_item_size) {
1350 generic_err(leaf, slot,
1351 "invalid item size, have %u expect %u for key type %u",
1352 btrfs_item_size_nr(leaf, slot),
1353 expect_item_size, key->type);
1356 if (!IS_ALIGNED(key->objectid, leaf->fs_info->sectorsize)) {
1357 generic_err(leaf, slot,
1358 "invalid key objectid for shared block ref, have %llu expect aligned to %u",
1359 key->objectid, leaf->fs_info->sectorsize);
1362 if (key->type != BTRFS_TREE_BLOCK_REF_KEY &&
1363 !IS_ALIGNED(key->offset, leaf->fs_info->sectorsize)) {
1364 extent_err(leaf, slot,
1365 "invalid tree parent bytenr, have %llu expect aligned to %u",
1366 key->offset, leaf->fs_info->sectorsize);
1372 static int check_extent_data_ref(struct extent_buffer *leaf,
1373 struct btrfs_key *key, int slot)
1375 struct btrfs_extent_data_ref *dref;
1376 unsigned long ptr = btrfs_item_ptr_offset(leaf, slot);
1377 const unsigned long end = ptr + btrfs_item_size_nr(leaf, slot);
1379 if (btrfs_item_size_nr(leaf, slot) % sizeof(*dref) != 0) {
1380 generic_err(leaf, slot,
1381 "invalid item size, have %u expect aligned to %zu for key type %u",
1382 btrfs_item_size_nr(leaf, slot),
1383 sizeof(*dref), key->type);
1385 if (!IS_ALIGNED(key->objectid, leaf->fs_info->sectorsize)) {
1386 generic_err(leaf, slot,
1387 "invalid key objectid for shared block ref, have %llu expect aligned to %u",
1388 key->objectid, leaf->fs_info->sectorsize);
1391 for (; ptr < end; ptr += sizeof(*dref)) {
1397 dref = (struct btrfs_extent_data_ref *)ptr;
1398 root_objectid = btrfs_extent_data_ref_root(leaf, dref);
1399 owner = btrfs_extent_data_ref_objectid(leaf, dref);
1400 offset = btrfs_extent_data_ref_offset(leaf, dref);
1401 hash = hash_extent_data_ref(root_objectid, owner, offset);
1402 if (hash != key->offset) {
1403 extent_err(leaf, slot,
1404 "invalid extent data ref hash, item has 0x%016llx key has 0x%016llx",
1408 if (!IS_ALIGNED(offset, leaf->fs_info->sectorsize)) {
1409 extent_err(leaf, slot,
1410 "invalid extent data backref offset, have %llu expect aligned to %u",
1411 offset, leaf->fs_info->sectorsize);
1417 #define inode_ref_err(eb, slot, fmt, args...) \
1418 inode_item_err(eb, slot, fmt, ##args)
1419 static int check_inode_ref(struct extent_buffer *leaf,
1420 struct btrfs_key *key, struct btrfs_key *prev_key,
1423 struct btrfs_inode_ref *iref;
1427 if (!check_prev_ino(leaf, key, slot, prev_key))
1429 /* namelen can't be 0, so item_size == sizeof() is also invalid */
1430 if (btrfs_item_size_nr(leaf, slot) <= sizeof(*iref)) {
1431 inode_ref_err(leaf, slot,
1432 "invalid item size, have %u expect (%zu, %u)",
1433 btrfs_item_size_nr(leaf, slot),
1434 sizeof(*iref), BTRFS_LEAF_DATA_SIZE(leaf->fs_info));
1438 ptr = btrfs_item_ptr_offset(leaf, slot);
1439 end = ptr + btrfs_item_size_nr(leaf, slot);
1443 if (ptr + sizeof(iref) > end) {
1444 inode_ref_err(leaf, slot,
1445 "inode ref overflow, ptr %lu end %lu inode_ref_size %zu",
1446 ptr, end, sizeof(iref));
1450 iref = (struct btrfs_inode_ref *)ptr;
1451 namelen = btrfs_inode_ref_name_len(leaf, iref);
1452 if (ptr + sizeof(*iref) + namelen > end) {
1453 inode_ref_err(leaf, slot,
1454 "inode ref overflow, ptr %lu end %lu namelen %u",
1460 * NOTE: In theory we should record all found index numbers
1461 * to find any duplicated indexes, but that will be too time
1462 * consuming for inodes with too many hard links.
1464 ptr += sizeof(*iref) + namelen;
1470 * Common point to switch the item-specific validation.
1472 static int check_leaf_item(struct extent_buffer *leaf,
1473 struct btrfs_key *key, int slot,
1474 struct btrfs_key *prev_key)
1477 struct btrfs_chunk *chunk;
1479 switch (key->type) {
1480 case BTRFS_EXTENT_DATA_KEY:
1481 ret = check_extent_data_item(leaf, key, slot, prev_key);
1483 case BTRFS_EXTENT_CSUM_KEY:
1484 ret = check_csum_item(leaf, key, slot, prev_key);
1486 case BTRFS_DIR_ITEM_KEY:
1487 case BTRFS_DIR_INDEX_KEY:
1488 case BTRFS_XATTR_ITEM_KEY:
1489 ret = check_dir_item(leaf, key, prev_key, slot);
1491 case BTRFS_INODE_REF_KEY:
1492 ret = check_inode_ref(leaf, key, prev_key, slot);
1494 case BTRFS_BLOCK_GROUP_ITEM_KEY:
1495 ret = check_block_group_item(leaf, key, slot);
1497 case BTRFS_CHUNK_ITEM_KEY:
1498 chunk = btrfs_item_ptr(leaf, slot, struct btrfs_chunk);
1499 ret = check_leaf_chunk_item(leaf, chunk, key, slot);
1501 case BTRFS_DEV_ITEM_KEY:
1502 ret = check_dev_item(leaf, key, slot);
1504 case BTRFS_INODE_ITEM_KEY:
1505 ret = check_inode_item(leaf, key, slot);
1507 case BTRFS_ROOT_ITEM_KEY:
1508 ret = check_root_item(leaf, key, slot);
1510 case BTRFS_EXTENT_ITEM_KEY:
1511 case BTRFS_METADATA_ITEM_KEY:
1512 ret = check_extent_item(leaf, key, slot);
1514 case BTRFS_TREE_BLOCK_REF_KEY:
1515 case BTRFS_SHARED_DATA_REF_KEY:
1516 case BTRFS_SHARED_BLOCK_REF_KEY:
1517 ret = check_simple_keyed_refs(leaf, key, slot);
1519 case BTRFS_EXTENT_DATA_REF_KEY:
1520 ret = check_extent_data_ref(leaf, key, slot);
1526 static int check_leaf(struct extent_buffer *leaf, bool check_item_data)
1528 struct btrfs_fs_info *fs_info = leaf->fs_info;
1529 /* No valid key type is 0, so all key should be larger than this key */
1530 struct btrfs_key prev_key = {0, 0, 0};
1531 struct btrfs_key key;
1532 u32 nritems = btrfs_header_nritems(leaf);
1535 if (btrfs_header_level(leaf) != 0) {
1536 generic_err(leaf, 0,
1537 "invalid level for leaf, have %d expect 0",
1538 btrfs_header_level(leaf));
1543 * Extent buffers from a relocation tree have a owner field that
1544 * corresponds to the subvolume tree they are based on. So just from an
1545 * extent buffer alone we can not find out what is the id of the
1546 * corresponding subvolume tree, so we can not figure out if the extent
1547 * buffer corresponds to the root of the relocation tree or not. So
1548 * skip this check for relocation trees.
1550 if (nritems == 0 && !btrfs_header_flag(leaf, BTRFS_HEADER_FLAG_RELOC)) {
1551 u64 owner = btrfs_header_owner(leaf);
1553 /* These trees must never be empty */
1554 if (owner == BTRFS_ROOT_TREE_OBJECTID ||
1555 owner == BTRFS_CHUNK_TREE_OBJECTID ||
1556 owner == BTRFS_EXTENT_TREE_OBJECTID ||
1557 owner == BTRFS_DEV_TREE_OBJECTID ||
1558 owner == BTRFS_FS_TREE_OBJECTID ||
1559 owner == BTRFS_DATA_RELOC_TREE_OBJECTID) {
1560 generic_err(leaf, 0,
1561 "invalid root, root %llu must never be empty",
1567 generic_err(leaf, 0,
1568 "invalid owner, root 0 is not defined");
1578 * Check the following things to make sure this is a good leaf, and
1579 * leaf users won't need to bother with similar sanity checks:
1582 * 2) item offset and size
1583 * No overlap, no hole, all inside the leaf.
1585 * If possible, do comprehensive sanity check.
1586 * NOTE: All checks must only rely on the item data itself.
1588 for (slot = 0; slot < nritems; slot++) {
1589 u32 item_end_expected;
1592 btrfs_item_key_to_cpu(leaf, &key, slot);
1594 /* Make sure the keys are in the right order */
1595 if (btrfs_comp_cpu_keys(&prev_key, &key) >= 0) {
1596 generic_err(leaf, slot,
1597 "bad key order, prev (%llu %u %llu) current (%llu %u %llu)",
1598 prev_key.objectid, prev_key.type,
1599 prev_key.offset, key.objectid, key.type,
1605 * Make sure the offset and ends are right, remember that the
1606 * item data starts at the end of the leaf and grows towards the
1610 item_end_expected = BTRFS_LEAF_DATA_SIZE(fs_info);
1612 item_end_expected = btrfs_item_offset_nr(leaf,
1614 if (btrfs_item_end_nr(leaf, slot) != item_end_expected) {
1615 generic_err(leaf, slot,
1616 "unexpected item end, have %u expect %u",
1617 btrfs_item_end_nr(leaf, slot),
1623 * Check to make sure that we don't point outside of the leaf,
1624 * just in case all the items are consistent to each other, but
1625 * all point outside of the leaf.
1627 if (btrfs_item_end_nr(leaf, slot) >
1628 BTRFS_LEAF_DATA_SIZE(fs_info)) {
1629 generic_err(leaf, slot,
1630 "slot end outside of leaf, have %u expect range [0, %u]",
1631 btrfs_item_end_nr(leaf, slot),
1632 BTRFS_LEAF_DATA_SIZE(fs_info));
1636 /* Also check if the item pointer overlaps with btrfs item. */
1637 if (btrfs_item_nr_offset(slot) + sizeof(struct btrfs_item) >
1638 btrfs_item_ptr_offset(leaf, slot)) {
1639 generic_err(leaf, slot,
1640 "slot overlaps with its data, item end %lu data start %lu",
1641 btrfs_item_nr_offset(slot) +
1642 sizeof(struct btrfs_item),
1643 btrfs_item_ptr_offset(leaf, slot));
1647 if (check_item_data) {
1649 * Check if the item size and content meet other
1652 ret = check_leaf_item(leaf, &key, slot, &prev_key);
1657 prev_key.objectid = key.objectid;
1658 prev_key.type = key.type;
1659 prev_key.offset = key.offset;
1665 int btrfs_check_leaf_full(struct extent_buffer *leaf)
1667 return check_leaf(leaf, true);
1669 ALLOW_ERROR_INJECTION(btrfs_check_leaf_full, ERRNO);
1671 int btrfs_check_leaf_relaxed(struct extent_buffer *leaf)
1673 return check_leaf(leaf, false);
1676 int btrfs_check_node(struct extent_buffer *node)
1678 struct btrfs_fs_info *fs_info = node->fs_info;
1679 unsigned long nr = btrfs_header_nritems(node);
1680 struct btrfs_key key, next_key;
1682 int level = btrfs_header_level(node);
1686 if (level <= 0 || level >= BTRFS_MAX_LEVEL) {
1687 generic_err(node, 0,
1688 "invalid level for node, have %d expect [1, %d]",
1689 level, BTRFS_MAX_LEVEL - 1);
1692 if (nr == 0 || nr > BTRFS_NODEPTRS_PER_BLOCK(fs_info)) {
1694 "corrupt node: root=%llu block=%llu, nritems too %s, have %lu expect range [1,%u]",
1695 btrfs_header_owner(node), node->start,
1696 nr == 0 ? "small" : "large", nr,
1697 BTRFS_NODEPTRS_PER_BLOCK(fs_info));
1701 for (slot = 0; slot < nr - 1; slot++) {
1702 bytenr = btrfs_node_blockptr(node, slot);
1703 btrfs_node_key_to_cpu(node, &key, slot);
1704 btrfs_node_key_to_cpu(node, &next_key, slot + 1);
1707 generic_err(node, slot,
1708 "invalid NULL node pointer");
1712 if (!IS_ALIGNED(bytenr, fs_info->sectorsize)) {
1713 generic_err(node, slot,
1714 "unaligned pointer, have %llu should be aligned to %u",
1715 bytenr, fs_info->sectorsize);
1720 if (btrfs_comp_cpu_keys(&key, &next_key) >= 0) {
1721 generic_err(node, slot,
1722 "bad key order, current (%llu %u %llu) next (%llu %u %llu)",
1723 key.objectid, key.type, key.offset,
1724 next_key.objectid, next_key.type,
1733 ALLOW_ERROR_INJECTION(btrfs_check_node, ERRNO);