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.
19 #include "tree-checker.h"
21 #include "compression.h"
25 * Error message should follow the following format:
26 * corrupt <type>: <identifier>, <reason>[, <bad_value>]
29 * @identifier: the necessary info to locate the leaf/node.
30 * It's recommended to decode key.objecitd/offset if it's
32 * @reason: describe the error
33 * @bad_value: optional, it's recommended to output bad value and its
34 * expected value (range).
36 * Since comma is used to separate the components, only space is allowed
37 * inside each component.
41 * Append generic "corrupt leaf/node root=%llu block=%llu slot=%d: " to @fmt.
42 * Allows callers to customize the output.
46 static void generic_err(const struct extent_buffer *eb, int slot,
49 const struct btrfs_fs_info *fs_info = eb->fs_info;
59 "corrupt %s: root=%llu block=%llu slot=%d, %pV",
60 btrfs_header_level(eb) == 0 ? "leaf" : "node",
61 btrfs_header_owner(eb), btrfs_header_bytenr(eb), slot, &vaf);
66 * Customized reporter for extent data item, since its key objectid and
67 * offset has its own meaning.
71 static void file_extent_err(const struct extent_buffer *eb, int slot,
74 const struct btrfs_fs_info *fs_info = eb->fs_info;
79 btrfs_item_key_to_cpu(eb, &key, slot);
86 "corrupt %s: root=%llu block=%llu slot=%d ino=%llu file_offset=%llu, %pV",
87 btrfs_header_level(eb) == 0 ? "leaf" : "node",
88 btrfs_header_owner(eb), btrfs_header_bytenr(eb), slot,
89 key.objectid, key.offset, &vaf);
94 * Return 0 if the btrfs_file_extent_##name is aligned to @alignment
97 #define CHECK_FE_ALIGNED(fs_info, leaf, slot, fi, name, alignment) \
99 if (!IS_ALIGNED(btrfs_file_extent_##name((leaf), (fi)), (alignment))) \
100 file_extent_err((leaf), (slot), \
101 "invalid %s for file extent, have %llu, should be aligned to %u", \
102 (#name), btrfs_file_extent_##name((leaf), (fi)), \
104 (!IS_ALIGNED(btrfs_file_extent_##name((leaf), (fi)), (alignment))); \
107 static int check_extent_data_item(struct extent_buffer *leaf,
108 struct btrfs_key *key, int slot)
110 struct btrfs_fs_info *fs_info = leaf->fs_info;
111 struct btrfs_file_extent_item *fi;
112 u32 sectorsize = fs_info->sectorsize;
113 u32 item_size = btrfs_item_size_nr(leaf, slot);
115 if (!IS_ALIGNED(key->offset, sectorsize)) {
116 file_extent_err(leaf, slot,
117 "unaligned file_offset for file extent, have %llu should be aligned to %u",
118 key->offset, sectorsize);
122 fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item);
124 if (btrfs_file_extent_type(leaf, fi) > BTRFS_FILE_EXTENT_TYPES) {
125 file_extent_err(leaf, slot,
126 "invalid type for file extent, have %u expect range [0, %u]",
127 btrfs_file_extent_type(leaf, fi),
128 BTRFS_FILE_EXTENT_TYPES);
133 * Support for new compression/encryption must introduce incompat flag,
134 * and must be caught in open_ctree().
136 if (btrfs_file_extent_compression(leaf, fi) > BTRFS_COMPRESS_TYPES) {
137 file_extent_err(leaf, slot,
138 "invalid compression for file extent, have %u expect range [0, %u]",
139 btrfs_file_extent_compression(leaf, fi),
140 BTRFS_COMPRESS_TYPES);
143 if (btrfs_file_extent_encryption(leaf, fi)) {
144 file_extent_err(leaf, slot,
145 "invalid encryption for file extent, have %u expect 0",
146 btrfs_file_extent_encryption(leaf, fi));
149 if (btrfs_file_extent_type(leaf, fi) == BTRFS_FILE_EXTENT_INLINE) {
150 /* Inline extent must have 0 as key offset */
152 file_extent_err(leaf, slot,
153 "invalid file_offset for inline file extent, have %llu expect 0",
158 /* Compressed inline extent has no on-disk size, skip it */
159 if (btrfs_file_extent_compression(leaf, fi) !=
163 /* Uncompressed inline extent size must match item size */
164 if (item_size != BTRFS_FILE_EXTENT_INLINE_DATA_START +
165 btrfs_file_extent_ram_bytes(leaf, fi)) {
166 file_extent_err(leaf, slot,
167 "invalid ram_bytes for uncompressed inline extent, have %u expect %llu",
168 item_size, BTRFS_FILE_EXTENT_INLINE_DATA_START +
169 btrfs_file_extent_ram_bytes(leaf, fi));
175 /* Regular or preallocated extent has fixed item size */
176 if (item_size != sizeof(*fi)) {
177 file_extent_err(leaf, slot,
178 "invalid item size for reg/prealloc file extent, have %u expect %zu",
179 item_size, sizeof(*fi));
182 if (CHECK_FE_ALIGNED(fs_info, leaf, slot, fi, ram_bytes, sectorsize) ||
183 CHECK_FE_ALIGNED(fs_info, leaf, slot, fi, disk_bytenr, sectorsize) ||
184 CHECK_FE_ALIGNED(fs_info, leaf, slot, fi, disk_num_bytes, sectorsize) ||
185 CHECK_FE_ALIGNED(fs_info, leaf, slot, fi, offset, sectorsize) ||
186 CHECK_FE_ALIGNED(fs_info, leaf, slot, fi, num_bytes, sectorsize))
191 static int check_csum_item(struct extent_buffer *leaf, struct btrfs_key *key,
194 struct btrfs_fs_info *fs_info = leaf->fs_info;
195 u32 sectorsize = fs_info->sectorsize;
196 u32 csumsize = btrfs_super_csum_size(fs_info->super_copy);
198 if (key->objectid != BTRFS_EXTENT_CSUM_OBJECTID) {
199 generic_err(leaf, slot,
200 "invalid key objectid for csum item, have %llu expect %llu",
201 key->objectid, BTRFS_EXTENT_CSUM_OBJECTID);
204 if (!IS_ALIGNED(key->offset, sectorsize)) {
205 generic_err(leaf, slot,
206 "unaligned key offset for csum item, have %llu should be aligned to %u",
207 key->offset, sectorsize);
210 if (!IS_ALIGNED(btrfs_item_size_nr(leaf, slot), csumsize)) {
211 generic_err(leaf, slot,
212 "unaligned item size for csum item, have %u should be aligned to %u",
213 btrfs_item_size_nr(leaf, slot), csumsize);
220 * Customized reported for dir_item, only important new info is key->objectid,
221 * which represents inode number
225 static void dir_item_err(const struct extent_buffer *eb, int slot,
226 const char *fmt, ...)
228 const struct btrfs_fs_info *fs_info = eb->fs_info;
229 struct btrfs_key key;
230 struct va_format vaf;
233 btrfs_item_key_to_cpu(eb, &key, slot);
240 "corrupt %s: root=%llu block=%llu slot=%d ino=%llu, %pV",
241 btrfs_header_level(eb) == 0 ? "leaf" : "node",
242 btrfs_header_owner(eb), btrfs_header_bytenr(eb), slot,
247 static int check_dir_item(struct extent_buffer *leaf,
248 struct btrfs_key *key, int slot)
250 struct btrfs_fs_info *fs_info = leaf->fs_info;
251 struct btrfs_dir_item *di;
252 u32 item_size = btrfs_item_size_nr(leaf, slot);
255 di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item);
256 while (cur < item_size) {
264 /* header itself should not cross item boundary */
265 if (cur + sizeof(*di) > item_size) {
266 dir_item_err(leaf, slot,
267 "dir item header crosses item boundary, have %zu boundary %u",
268 cur + sizeof(*di), item_size);
273 dir_type = btrfs_dir_type(leaf, di);
274 if (dir_type >= BTRFS_FT_MAX) {
275 dir_item_err(leaf, slot,
276 "invalid dir item type, have %u expect [0, %u)",
277 dir_type, BTRFS_FT_MAX);
281 if (key->type == BTRFS_XATTR_ITEM_KEY &&
282 dir_type != BTRFS_FT_XATTR) {
283 dir_item_err(leaf, slot,
284 "invalid dir item type for XATTR key, have %u expect %u",
285 dir_type, BTRFS_FT_XATTR);
288 if (dir_type == BTRFS_FT_XATTR &&
289 key->type != BTRFS_XATTR_ITEM_KEY) {
290 dir_item_err(leaf, slot,
291 "xattr dir type found for non-XATTR key");
294 if (dir_type == BTRFS_FT_XATTR)
295 max_name_len = XATTR_NAME_MAX;
297 max_name_len = BTRFS_NAME_LEN;
299 /* Name/data length check */
300 name_len = btrfs_dir_name_len(leaf, di);
301 data_len = btrfs_dir_data_len(leaf, di);
302 if (name_len > max_name_len) {
303 dir_item_err(leaf, slot,
304 "dir item name len too long, have %u max %u",
305 name_len, max_name_len);
308 if (name_len + data_len > BTRFS_MAX_XATTR_SIZE(fs_info)) {
309 dir_item_err(leaf, slot,
310 "dir item name and data len too long, have %u max %u",
312 BTRFS_MAX_XATTR_SIZE(fs_info));
316 if (data_len && dir_type != BTRFS_FT_XATTR) {
317 dir_item_err(leaf, slot,
318 "dir item with invalid data len, have %u expect 0",
323 total_size = sizeof(*di) + name_len + data_len;
325 /* header and name/data should not cross item boundary */
326 if (cur + total_size > item_size) {
327 dir_item_err(leaf, slot,
328 "dir item data crosses item boundary, have %u boundary %u",
329 cur + total_size, item_size);
334 * Special check for XATTR/DIR_ITEM, as key->offset is name
335 * hash, should match its name
337 if (key->type == BTRFS_DIR_ITEM_KEY ||
338 key->type == BTRFS_XATTR_ITEM_KEY) {
339 char namebuf[max(BTRFS_NAME_LEN, XATTR_NAME_MAX)];
341 read_extent_buffer(leaf, namebuf,
342 (unsigned long)(di + 1), name_len);
343 name_hash = btrfs_name_hash(namebuf, name_len);
344 if (key->offset != name_hash) {
345 dir_item_err(leaf, slot,
346 "name hash mismatch with key, have 0x%016x expect 0x%016llx",
347 name_hash, key->offset);
352 di = (struct btrfs_dir_item *)((void *)di + total_size);
359 static void block_group_err(const struct extent_buffer *eb, int slot,
360 const char *fmt, ...)
362 const struct btrfs_fs_info *fs_info = eb->fs_info;
363 struct btrfs_key key;
364 struct va_format vaf;
367 btrfs_item_key_to_cpu(eb, &key, slot);
374 "corrupt %s: root=%llu block=%llu slot=%d bg_start=%llu bg_len=%llu, %pV",
375 btrfs_header_level(eb) == 0 ? "leaf" : "node",
376 btrfs_header_owner(eb), btrfs_header_bytenr(eb), slot,
377 key.objectid, key.offset, &vaf);
381 static int check_block_group_item(struct extent_buffer *leaf,
382 struct btrfs_key *key, int slot)
384 struct btrfs_block_group_item bgi;
385 u32 item_size = btrfs_item_size_nr(leaf, slot);
390 * Here we don't really care about alignment since extent allocator can
391 * handle it. We care more about the size.
393 if (key->offset == 0) {
394 block_group_err(leaf, slot,
395 "invalid block group size 0");
399 if (item_size != sizeof(bgi)) {
400 block_group_err(leaf, slot,
401 "invalid item size, have %u expect %zu",
402 item_size, sizeof(bgi));
406 read_extent_buffer(leaf, &bgi, btrfs_item_ptr_offset(leaf, slot),
408 if (btrfs_block_group_chunk_objectid(&bgi) !=
409 BTRFS_FIRST_CHUNK_TREE_OBJECTID) {
410 block_group_err(leaf, slot,
411 "invalid block group chunk objectid, have %llu expect %llu",
412 btrfs_block_group_chunk_objectid(&bgi),
413 BTRFS_FIRST_CHUNK_TREE_OBJECTID);
417 if (btrfs_block_group_used(&bgi) > key->offset) {
418 block_group_err(leaf, slot,
419 "invalid block group used, have %llu expect [0, %llu)",
420 btrfs_block_group_used(&bgi), key->offset);
424 flags = btrfs_block_group_flags(&bgi);
425 if (hweight64(flags & BTRFS_BLOCK_GROUP_PROFILE_MASK) > 1) {
426 block_group_err(leaf, slot,
427 "invalid profile flags, have 0x%llx (%lu bits set) expect no more than 1 bit set",
428 flags & BTRFS_BLOCK_GROUP_PROFILE_MASK,
429 hweight64(flags & BTRFS_BLOCK_GROUP_PROFILE_MASK));
433 type = flags & BTRFS_BLOCK_GROUP_TYPE_MASK;
434 if (type != BTRFS_BLOCK_GROUP_DATA &&
435 type != BTRFS_BLOCK_GROUP_METADATA &&
436 type != BTRFS_BLOCK_GROUP_SYSTEM &&
437 type != (BTRFS_BLOCK_GROUP_METADATA |
438 BTRFS_BLOCK_GROUP_DATA)) {
439 block_group_err(leaf, slot,
440 "invalid type, have 0x%llx (%lu bits set) expect either 0x%llx, 0x%llx, 0x%llx or 0x%llx",
441 type, hweight64(type),
442 BTRFS_BLOCK_GROUP_DATA, BTRFS_BLOCK_GROUP_METADATA,
443 BTRFS_BLOCK_GROUP_SYSTEM,
444 BTRFS_BLOCK_GROUP_METADATA | BTRFS_BLOCK_GROUP_DATA);
452 static void chunk_err(const struct extent_buffer *leaf,
453 const struct btrfs_chunk *chunk, u64 logical,
454 const char *fmt, ...)
456 const struct btrfs_fs_info *fs_info = leaf->fs_info;
458 struct va_format vaf;
463 /* Only superblock eb is able to have such small offset */
464 is_sb = (leaf->start == BTRFS_SUPER_INFO_OFFSET);
468 * Get the slot number by iterating through all slots, this
469 * would provide better readability.
471 for (i = 0; i < btrfs_header_nritems(leaf); i++) {
472 if (btrfs_item_ptr_offset(leaf, i) ==
473 (unsigned long)chunk) {
485 "corrupt superblock syschunk array: chunk_start=%llu, %pV",
489 "corrupt leaf: root=%llu block=%llu slot=%d chunk_start=%llu, %pV",
490 BTRFS_CHUNK_TREE_OBJECTID, leaf->start, slot,
496 * The common chunk check which could also work on super block sys chunk array.
498 * Return -EUCLEAN if anything is corrupted.
499 * Return 0 if everything is OK.
501 int btrfs_check_chunk_valid(struct btrfs_fs_info *fs_info,
502 struct extent_buffer *leaf,
503 struct btrfs_chunk *chunk, u64 logical)
513 length = btrfs_chunk_length(leaf, chunk);
514 stripe_len = btrfs_chunk_stripe_len(leaf, chunk);
515 num_stripes = btrfs_chunk_num_stripes(leaf, chunk);
516 sub_stripes = btrfs_chunk_sub_stripes(leaf, chunk);
517 type = btrfs_chunk_type(leaf, chunk);
520 chunk_err(leaf, chunk, logical,
521 "invalid chunk num_stripes, have %u", num_stripes);
524 if (!IS_ALIGNED(logical, fs_info->sectorsize)) {
525 chunk_err(leaf, chunk, logical,
526 "invalid chunk logical, have %llu should aligned to %u",
527 logical, fs_info->sectorsize);
530 if (btrfs_chunk_sector_size(leaf, chunk) != fs_info->sectorsize) {
531 chunk_err(leaf, chunk, logical,
532 "invalid chunk sectorsize, have %u expect %u",
533 btrfs_chunk_sector_size(leaf, chunk),
534 fs_info->sectorsize);
537 if (!length || !IS_ALIGNED(length, fs_info->sectorsize)) {
538 chunk_err(leaf, chunk, logical,
539 "invalid chunk length, have %llu", length);
542 if (!is_power_of_2(stripe_len) || stripe_len != BTRFS_STRIPE_LEN) {
543 chunk_err(leaf, chunk, logical,
544 "invalid chunk stripe length: %llu",
548 if (~(BTRFS_BLOCK_GROUP_TYPE_MASK | BTRFS_BLOCK_GROUP_PROFILE_MASK) &
550 chunk_err(leaf, chunk, logical,
551 "unrecognized chunk type: 0x%llx",
552 ~(BTRFS_BLOCK_GROUP_TYPE_MASK |
553 BTRFS_BLOCK_GROUP_PROFILE_MASK) &
554 btrfs_chunk_type(leaf, chunk));
558 if (!is_power_of_2(type & BTRFS_BLOCK_GROUP_PROFILE_MASK) &&
559 (type & BTRFS_BLOCK_GROUP_PROFILE_MASK) != 0) {
560 chunk_err(leaf, chunk, logical,
561 "invalid chunk profile flag: 0x%llx, expect 0 or 1 bit set",
562 type & BTRFS_BLOCK_GROUP_PROFILE_MASK);
565 if ((type & BTRFS_BLOCK_GROUP_TYPE_MASK) == 0) {
566 chunk_err(leaf, chunk, logical,
567 "missing chunk type flag, have 0x%llx one bit must be set in 0x%llx",
568 type, BTRFS_BLOCK_GROUP_TYPE_MASK);
572 if ((type & BTRFS_BLOCK_GROUP_SYSTEM) &&
573 (type & (BTRFS_BLOCK_GROUP_METADATA | BTRFS_BLOCK_GROUP_DATA))) {
574 chunk_err(leaf, chunk, logical,
575 "system chunk with data or metadata type: 0x%llx",
580 features = btrfs_super_incompat_flags(fs_info->super_copy);
581 if (features & BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS)
585 if ((type & BTRFS_BLOCK_GROUP_METADATA) &&
586 (type & BTRFS_BLOCK_GROUP_DATA)) {
587 chunk_err(leaf, chunk, logical,
588 "mixed chunk type in non-mixed mode: 0x%llx", type);
593 if ((type & BTRFS_BLOCK_GROUP_RAID10 && sub_stripes != 2) ||
594 (type & BTRFS_BLOCK_GROUP_RAID1 && num_stripes != 2) ||
595 (type & BTRFS_BLOCK_GROUP_RAID5 && num_stripes < 2) ||
596 (type & BTRFS_BLOCK_GROUP_RAID6 && num_stripes < 3) ||
597 (type & BTRFS_BLOCK_GROUP_DUP && num_stripes != 2) ||
598 ((type & BTRFS_BLOCK_GROUP_PROFILE_MASK) == 0 && num_stripes != 1)) {
599 chunk_err(leaf, chunk, logical,
600 "invalid num_stripes:sub_stripes %u:%u for profile %llu",
601 num_stripes, sub_stripes,
602 type & BTRFS_BLOCK_GROUP_PROFILE_MASK);
611 static void dev_item_err(const struct extent_buffer *eb, int slot,
612 const char *fmt, ...)
614 struct btrfs_key key;
615 struct va_format vaf;
618 btrfs_item_key_to_cpu(eb, &key, slot);
624 btrfs_crit(eb->fs_info,
625 "corrupt %s: root=%llu block=%llu slot=%d devid=%llu %pV",
626 btrfs_header_level(eb) == 0 ? "leaf" : "node",
627 btrfs_header_owner(eb), btrfs_header_bytenr(eb), slot,
632 static int check_dev_item(struct extent_buffer *leaf,
633 struct btrfs_key *key, int slot)
635 struct btrfs_fs_info *fs_info = leaf->fs_info;
636 struct btrfs_dev_item *ditem;
637 u64 max_devid = max(BTRFS_MAX_DEVS(fs_info), BTRFS_MAX_DEVS_SYS_CHUNK);
639 if (key->objectid != BTRFS_DEV_ITEMS_OBJECTID) {
640 dev_item_err(leaf, slot,
641 "invalid objectid: has=%llu expect=%llu",
642 key->objectid, BTRFS_DEV_ITEMS_OBJECTID);
645 if (key->offset > max_devid) {
646 dev_item_err(leaf, slot,
647 "invalid devid: has=%llu expect=[0, %llu]",
648 key->offset, max_devid);
651 ditem = btrfs_item_ptr(leaf, slot, struct btrfs_dev_item);
652 if (btrfs_device_id(leaf, ditem) != key->offset) {
653 dev_item_err(leaf, slot,
654 "devid mismatch: key has=%llu item has=%llu",
655 key->offset, btrfs_device_id(leaf, ditem));
660 * For device total_bytes, we don't have reliable way to check it, as
661 * it can be 0 for device removal. Device size check can only be done
662 * by dev extents check.
664 if (btrfs_device_bytes_used(leaf, ditem) >
665 btrfs_device_total_bytes(leaf, ditem)) {
666 dev_item_err(leaf, slot,
667 "invalid bytes used: have %llu expect [0, %llu]",
668 btrfs_device_bytes_used(leaf, ditem),
669 btrfs_device_total_bytes(leaf, ditem));
673 * Remaining members like io_align/type/gen/dev_group aren't really
674 * utilized. Skip them to make later usage of them easier.
679 /* Inode item error output has the same format as dir_item_err() */
680 #define inode_item_err(fs_info, eb, slot, fmt, ...) \
681 dir_item_err(eb, slot, fmt, __VA_ARGS__)
683 static int check_inode_item(struct btrfs_fs_info *fs_info,
684 struct extent_buffer *leaf,
685 struct btrfs_key *key, int slot)
687 struct btrfs_inode_item *iitem;
688 u64 super_gen = btrfs_super_generation(fs_info->super_copy);
689 u32 valid_mask = (S_IFMT | S_ISUID | S_ISGID | S_ISVTX | 0777);
692 if ((key->objectid < BTRFS_FIRST_FREE_OBJECTID ||
693 key->objectid > BTRFS_LAST_FREE_OBJECTID) &&
694 key->objectid != BTRFS_ROOT_TREE_DIR_OBJECTID &&
695 key->objectid != BTRFS_FREE_INO_OBJECTID) {
696 generic_err(leaf, slot,
697 "invalid key objectid: has %llu expect %llu or [%llu, %llu] or %llu",
698 key->objectid, BTRFS_ROOT_TREE_DIR_OBJECTID,
699 BTRFS_FIRST_FREE_OBJECTID,
700 BTRFS_LAST_FREE_OBJECTID,
701 BTRFS_FREE_INO_OBJECTID);
704 if (key->offset != 0) {
705 inode_item_err(fs_info, leaf, slot,
706 "invalid key offset: has %llu expect 0",
710 iitem = btrfs_item_ptr(leaf, slot, struct btrfs_inode_item);
712 /* Here we use super block generation + 1 to handle log tree */
713 if (btrfs_inode_generation(leaf, iitem) > super_gen + 1) {
714 inode_item_err(fs_info, leaf, slot,
715 "invalid inode generation: has %llu expect (0, %llu]",
716 btrfs_inode_generation(leaf, iitem),
720 /* Note for ROOT_TREE_DIR_ITEM, mkfs could set its transid 0 */
721 if (btrfs_inode_transid(leaf, iitem) > super_gen + 1) {
722 inode_item_err(fs_info, leaf, slot,
723 "invalid inode generation: has %llu expect [0, %llu]",
724 btrfs_inode_transid(leaf, iitem), super_gen + 1);
729 * For size and nbytes it's better not to be too strict, as for dir
730 * item its size/nbytes can easily get wrong, but doesn't affect
731 * anything in the fs. So here we skip the check.
733 mode = btrfs_inode_mode(leaf, iitem);
734 if (mode & ~valid_mask) {
735 inode_item_err(fs_info, leaf, slot,
736 "unknown mode bit detected: 0x%x",
742 * S_IFMT is not bit mapped so we can't completely rely on is_power_of_2,
743 * but is_power_of_2() can save us from checking FIFO/CHR/DIR/REG.
744 * Only needs to check BLK, LNK and SOCKS
746 if (!is_power_of_2(mode & S_IFMT)) {
747 if (!S_ISLNK(mode) && !S_ISBLK(mode) && !S_ISSOCK(mode)) {
748 inode_item_err(fs_info, leaf, slot,
749 "invalid mode: has 0%o expect valid S_IF* bit(s)",
754 if (S_ISDIR(mode) && btrfs_inode_nlink(leaf, iitem) > 1) {
755 inode_item_err(fs_info, leaf, slot,
756 "invalid nlink: has %u expect no more than 1 for dir",
757 btrfs_inode_nlink(leaf, iitem));
760 if (btrfs_inode_flags(leaf, iitem) & ~BTRFS_INODE_FLAG_MASK) {
761 inode_item_err(fs_info, leaf, slot,
762 "unknown flags detected: 0x%llx",
763 btrfs_inode_flags(leaf, iitem) &
764 ~BTRFS_INODE_FLAG_MASK);
771 * Common point to switch the item-specific validation.
773 static int check_leaf_item(struct extent_buffer *leaf,
774 struct btrfs_key *key, int slot)
777 struct btrfs_chunk *chunk;
780 case BTRFS_EXTENT_DATA_KEY:
781 ret = check_extent_data_item(leaf, key, slot);
783 case BTRFS_EXTENT_CSUM_KEY:
784 ret = check_csum_item(leaf, key, slot);
786 case BTRFS_DIR_ITEM_KEY:
787 case BTRFS_DIR_INDEX_KEY:
788 case BTRFS_XATTR_ITEM_KEY:
789 ret = check_dir_item(leaf, key, slot);
791 case BTRFS_BLOCK_GROUP_ITEM_KEY:
792 ret = check_block_group_item(leaf, key, slot);
794 case BTRFS_CHUNK_ITEM_KEY:
795 chunk = btrfs_item_ptr(leaf, slot, struct btrfs_chunk);
796 ret = btrfs_check_chunk_valid(leaf->fs_info, leaf, chunk,
799 case BTRFS_DEV_ITEM_KEY:
800 ret = check_dev_item(leaf, key, slot);
802 case BTRFS_INODE_ITEM_KEY:
803 ret = check_inode_item(leaf->fs_info, leaf, key, slot);
809 static int check_leaf(struct extent_buffer *leaf, bool check_item_data)
811 struct btrfs_fs_info *fs_info = leaf->fs_info;
812 /* No valid key type is 0, so all key should be larger than this key */
813 struct btrfs_key prev_key = {0, 0, 0};
814 struct btrfs_key key;
815 u32 nritems = btrfs_header_nritems(leaf);
818 if (btrfs_header_level(leaf) != 0) {
820 "invalid level for leaf, have %d expect 0",
821 btrfs_header_level(leaf));
826 * Extent buffers from a relocation tree have a owner field that
827 * corresponds to the subvolume tree they are based on. So just from an
828 * extent buffer alone we can not find out what is the id of the
829 * corresponding subvolume tree, so we can not figure out if the extent
830 * buffer corresponds to the root of the relocation tree or not. So
831 * skip this check for relocation trees.
833 if (nritems == 0 && !btrfs_header_flag(leaf, BTRFS_HEADER_FLAG_RELOC)) {
834 u64 owner = btrfs_header_owner(leaf);
835 struct btrfs_root *check_root;
837 /* These trees must never be empty */
838 if (owner == BTRFS_ROOT_TREE_OBJECTID ||
839 owner == BTRFS_CHUNK_TREE_OBJECTID ||
840 owner == BTRFS_EXTENT_TREE_OBJECTID ||
841 owner == BTRFS_DEV_TREE_OBJECTID ||
842 owner == BTRFS_FS_TREE_OBJECTID ||
843 owner == BTRFS_DATA_RELOC_TREE_OBJECTID) {
845 "invalid root, root %llu must never be empty",
849 key.objectid = owner;
850 key.type = BTRFS_ROOT_ITEM_KEY;
851 key.offset = (u64)-1;
853 check_root = btrfs_get_fs_root(fs_info, &key, false);
855 * The only reason we also check NULL here is that during
856 * open_ctree() some roots has not yet been set up.
858 if (!IS_ERR_OR_NULL(check_root)) {
859 struct extent_buffer *eb;
861 eb = btrfs_root_node(check_root);
862 /* if leaf is the root, then it's fine */
865 "invalid nritems, have %u should not be 0 for non-root leaf",
867 free_extent_buffer(eb);
870 free_extent_buffer(eb);
879 * Check the following things to make sure this is a good leaf, and
880 * leaf users won't need to bother with similar sanity checks:
883 * 2) item offset and size
884 * No overlap, no hole, all inside the leaf.
886 * If possible, do comprehensive sanity check.
887 * NOTE: All checks must only rely on the item data itself.
889 for (slot = 0; slot < nritems; slot++) {
890 u32 item_end_expected;
893 btrfs_item_key_to_cpu(leaf, &key, slot);
895 /* Make sure the keys are in the right order */
896 if (btrfs_comp_cpu_keys(&prev_key, &key) >= 0) {
897 generic_err(leaf, slot,
898 "bad key order, prev (%llu %u %llu) current (%llu %u %llu)",
899 prev_key.objectid, prev_key.type,
900 prev_key.offset, key.objectid, key.type,
906 * Make sure the offset and ends are right, remember that the
907 * item data starts at the end of the leaf and grows towards the
911 item_end_expected = BTRFS_LEAF_DATA_SIZE(fs_info);
913 item_end_expected = btrfs_item_offset_nr(leaf,
915 if (btrfs_item_end_nr(leaf, slot) != item_end_expected) {
916 generic_err(leaf, slot,
917 "unexpected item end, have %u expect %u",
918 btrfs_item_end_nr(leaf, slot),
924 * Check to make sure that we don't point outside of the leaf,
925 * just in case all the items are consistent to each other, but
926 * all point outside of the leaf.
928 if (btrfs_item_end_nr(leaf, slot) >
929 BTRFS_LEAF_DATA_SIZE(fs_info)) {
930 generic_err(leaf, slot,
931 "slot end outside of leaf, have %u expect range [0, %u]",
932 btrfs_item_end_nr(leaf, slot),
933 BTRFS_LEAF_DATA_SIZE(fs_info));
937 /* Also check if the item pointer overlaps with btrfs item. */
938 if (btrfs_item_nr_offset(slot) + sizeof(struct btrfs_item) >
939 btrfs_item_ptr_offset(leaf, slot)) {
940 generic_err(leaf, slot,
941 "slot overlaps with its data, item end %lu data start %lu",
942 btrfs_item_nr_offset(slot) +
943 sizeof(struct btrfs_item),
944 btrfs_item_ptr_offset(leaf, slot));
948 if (check_item_data) {
950 * Check if the item size and content meet other
953 ret = check_leaf_item(leaf, &key, slot);
958 prev_key.objectid = key.objectid;
959 prev_key.type = key.type;
960 prev_key.offset = key.offset;
966 int btrfs_check_leaf_full(struct btrfs_fs_info *fs_info,
967 struct extent_buffer *leaf)
969 return check_leaf(leaf, true);
972 int btrfs_check_leaf_relaxed(struct btrfs_fs_info *fs_info,
973 struct extent_buffer *leaf)
975 return check_leaf(leaf, false);
978 int btrfs_check_node(struct btrfs_fs_info *fs_info, struct extent_buffer *node)
980 unsigned long nr = btrfs_header_nritems(node);
981 struct btrfs_key key, next_key;
983 int level = btrfs_header_level(node);
987 if (level <= 0 || level >= BTRFS_MAX_LEVEL) {
989 "invalid level for node, have %d expect [1, %d]",
990 level, BTRFS_MAX_LEVEL - 1);
993 if (nr == 0 || nr > BTRFS_NODEPTRS_PER_BLOCK(fs_info)) {
995 "corrupt node: root=%llu block=%llu, nritems too %s, have %lu expect range [1,%u]",
996 btrfs_header_owner(node), node->start,
997 nr == 0 ? "small" : "large", nr,
998 BTRFS_NODEPTRS_PER_BLOCK(fs_info));
1002 for (slot = 0; slot < nr - 1; slot++) {
1003 bytenr = btrfs_node_blockptr(node, slot);
1004 btrfs_node_key_to_cpu(node, &key, slot);
1005 btrfs_node_key_to_cpu(node, &next_key, slot + 1);
1008 generic_err(node, slot,
1009 "invalid NULL node pointer");
1013 if (!IS_ALIGNED(bytenr, fs_info->sectorsize)) {
1014 generic_err(node, slot,
1015 "unaligned pointer, have %llu should be aligned to %u",
1016 bytenr, fs_info->sectorsize);
1021 if (btrfs_comp_cpu_keys(&key, &next_key) >= 0) {
1022 generic_err(node, slot,
1023 "bad key order, current (%llu %u %llu) next (%llu %u %llu)",
1024 key.objectid, key.type, key.offset,
1025 next_key.objectid, next_key.type,