2 * This program is free software; you can redistribute it and/or
3 * modify it under the terms of the GNU General Public
4 * License v2 as published by the Free Software Foundation.
6 * This program is distributed in the hope that it will be useful,
7 * but WITHOUT ANY WARRANTY; without even the implied warranty of
8 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
9 * General Public License for more details.
11 * You should have received a copy of the GNU General Public
12 * License along with this program; if not, write to the
13 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
14 * Boston, MA 021110-1307, USA.
20 #include "transaction.h"
28 #include "check/mode-common.h"
29 #include "check/mode-lowmem.h"
31 static int calc_extent_flag(struct btrfs_root *root, struct extent_buffer *eb,
34 struct btrfs_root *extent_root = root->fs_info->extent_root;
35 struct btrfs_root_item *ri = &root->root_item;
36 struct btrfs_extent_inline_ref *iref;
37 struct btrfs_extent_item *ei;
39 struct btrfs_path *path = NULL;
50 * Except file/reloc tree, we can not have FULL BACKREF MODE
52 if (root->objectid < BTRFS_FIRST_FREE_OBJECTID)
56 if (eb->start == btrfs_root_bytenr(ri))
59 if (btrfs_header_flag(eb, BTRFS_HEADER_FLAG_RELOC))
62 owner = btrfs_header_owner(eb);
63 if (owner == root->objectid)
66 path = btrfs_alloc_path();
70 key.objectid = btrfs_header_bytenr(eb);
74 ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0);
81 ret = btrfs_previous_extent_item(extent_root, path,
87 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
90 slot = path->slots[0];
91 ei = btrfs_item_ptr(eb, slot, struct btrfs_extent_item);
93 flags = btrfs_extent_flags(eb, ei);
94 if (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)
97 ptr = (unsigned long)(ei + 1);
98 end = (unsigned long)ei + btrfs_item_size_nr(eb, slot);
100 if (key.type == BTRFS_EXTENT_ITEM_KEY)
101 ptr += sizeof(struct btrfs_tree_block_info);
104 /* Reached extent item ends normally */
108 /* Beyond extent item end, wrong item size */
110 error("extent item at bytenr %llu slot %d has wrong size",
115 iref = (struct btrfs_extent_inline_ref *)ptr;
116 offset = btrfs_extent_inline_ref_offset(eb, iref);
117 type = btrfs_extent_inline_ref_type(eb, iref);
119 if (type == BTRFS_TREE_BLOCK_REF_KEY && offset == owner)
121 ptr += btrfs_extent_inline_ref_size(type);
125 *flags_ret &= ~BTRFS_BLOCK_FLAG_FULL_BACKREF;
129 *flags_ret |= BTRFS_BLOCK_FLAG_FULL_BACKREF;
131 btrfs_free_path(path);
136 * for a tree node or leaf, if it's shared, indeed we don't need to iterate it
137 * in every fs or file tree check. Here we find its all root ids, and only check
138 * it in the fs or file tree which has the smallest root id.
140 static int need_check(struct btrfs_root *root, struct ulist *roots)
142 struct rb_node *node;
143 struct ulist_node *u;
146 * @roots can be empty if it belongs to tree reloc tree
147 * In that case, we should always check the leaf, as we can't use
148 * the tree owner to ensure some other root will check it.
150 if (roots->nnodes == 1 || roots->nnodes == 0)
153 node = rb_first(&roots->root);
154 u = rb_entry(node, struct ulist_node, rb_node);
156 * current root id is not smallest, we skip it and let it be checked
157 * in the fs or file tree who hash the smallest root id.
159 if (root->objectid != u->val)
166 * for a tree node or leaf, we record its reference count, so later if we still
167 * process this node or leaf, don't need to compute its reference count again.
169 * @bytenr if @bytenr == (u64)-1, only update nrefs->full_backref[level]
171 static int update_nodes_refs(struct btrfs_root *root, u64 bytenr,
172 struct extent_buffer *eb, struct node_refs *nrefs,
173 u64 level, int check_all)
178 int root_level = btrfs_header_level(root->node);
182 if (nrefs->bytenr[level] == bytenr)
185 if (bytenr != (u64)-1) {
186 /* the return value of this function seems a mistake */
187 ret = btrfs_lookup_extent_info(NULL, root, bytenr,
188 level, 1, &refs, &flags);
190 if (ret < 0 && !check_all)
193 nrefs->bytenr[level] = bytenr;
194 nrefs->refs[level] = refs;
195 nrefs->full_backref[level] = 0;
196 nrefs->checked[level] = 0;
199 ret = btrfs_find_all_roots(NULL, root->fs_info, bytenr,
204 check = need_check(root, roots);
206 nrefs->need_check[level] = check;
209 nrefs->need_check[level] = 1;
211 if (level == root_level) {
212 nrefs->need_check[level] = 1;
215 * The node refs may have not been
216 * updated if upper needs checking (the
217 * lowest root_objectid) the node can
220 nrefs->need_check[level] =
221 nrefs->need_check[level + 1];
227 if (check_all && eb) {
228 calc_extent_flag(root, eb, &flags);
229 if (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)
230 nrefs->full_backref[level] = 1;
237 * This function only handles BACKREF_MISSING,
238 * If corresponding extent item exists, increase the ref, else insert an extent
241 * Returns error bits after repair.
243 static int repair_tree_block_ref(struct btrfs_trans_handle *trans,
244 struct btrfs_root *root,
245 struct extent_buffer *node,
246 struct node_refs *nrefs, int level, int err)
248 struct btrfs_fs_info *fs_info = root->fs_info;
249 struct btrfs_root *extent_root = fs_info->extent_root;
250 struct btrfs_path path;
251 struct btrfs_extent_item *ei;
252 struct btrfs_tree_block_info *bi;
253 struct btrfs_key key;
254 struct extent_buffer *eb;
255 u32 size = sizeof(*ei);
256 u32 node_size = root->fs_info->nodesize;
257 int insert_extent = 0;
258 int skinny_metadata = btrfs_fs_incompat(fs_info, SKINNY_METADATA);
259 int root_level = btrfs_header_level(root->node);
264 u64 flags = BTRFS_EXTENT_FLAG_TREE_BLOCK;
267 if ((err & BACKREF_MISSING) == 0)
270 WARN_ON(level > BTRFS_MAX_LEVEL);
273 btrfs_init_path(&path);
274 bytenr = btrfs_header_bytenr(node);
275 owner = btrfs_header_owner(node);
276 generation = btrfs_header_generation(node);
278 key.objectid = bytenr;
280 key.offset = (u64)-1;
282 /* Search for the extent item */
283 ret = btrfs_search_slot(NULL, extent_root, &key, &path, 0, 0);
289 ret = btrfs_previous_extent_item(extent_root, &path, bytenr);
293 /* calculate if the extent item flag is full backref or not */
294 if (nrefs->full_backref[level] != 0)
295 flags |= BTRFS_BLOCK_FLAG_FULL_BACKREF;
297 /* insert an extent item */
299 struct btrfs_disk_key copy_key;
301 generation = btrfs_header_generation(node);
303 if (level < root_level && nrefs->full_backref[level + 1] &&
304 owner != root->objectid) {
305 flags |= BTRFS_BLOCK_FLAG_FULL_BACKREF;
308 key.objectid = bytenr;
309 if (!skinny_metadata) {
310 key.type = BTRFS_EXTENT_ITEM_KEY;
311 key.offset = node_size;
314 key.type = BTRFS_METADATA_ITEM_KEY;
318 btrfs_release_path(&path);
319 ret = btrfs_insert_empty_item(trans, extent_root, &path, &key,
325 ei = btrfs_item_ptr(eb, path.slots[0], struct btrfs_extent_item);
327 btrfs_set_extent_refs(eb, ei, 0);
328 btrfs_set_extent_generation(eb, ei, generation);
329 btrfs_set_extent_flags(eb, ei, flags);
331 if (!skinny_metadata) {
332 bi = (struct btrfs_tree_block_info *)(ei + 1);
333 memset_extent_buffer(eb, 0, (unsigned long)bi,
335 btrfs_set_disk_key_objectid(©_key, root->objectid);
336 btrfs_set_disk_key_type(©_key, 0);
337 btrfs_set_disk_key_offset(©_key, 0);
339 btrfs_set_tree_block_level(eb, bi, level);
340 btrfs_set_tree_block_key(eb, bi, ©_key);
342 btrfs_mark_buffer_dirty(eb);
343 printf("Added an extent item [%llu %u]\n", bytenr, node_size);
344 btrfs_update_block_group(extent_root, bytenr, node_size, 1, 0);
346 nrefs->refs[level] = 0;
347 nrefs->full_backref[level] =
348 flags & BTRFS_BLOCK_FLAG_FULL_BACKREF;
349 btrfs_release_path(&path);
352 if (level < root_level && nrefs->full_backref[level + 1] &&
353 owner != root->objectid)
354 parent = nrefs->bytenr[level + 1];
356 /* increase the ref */
357 ret = btrfs_inc_extent_ref(trans, extent_root, bytenr, node_size,
358 parent, root->objectid, level, 0);
360 nrefs->refs[level]++;
362 btrfs_release_path(&path);
365 "failed to repair tree block ref start %llu root %llu due to %s",
366 bytenr, root->objectid, strerror(-ret));
368 printf("Added one tree block ref start %llu %s %llu\n",
369 bytenr, parent ? "parent" : "root",
370 parent ? parent : root->objectid);
371 err &= ~BACKREF_MISSING;
378 * Update global fs information.
380 static void account_bytes(struct btrfs_root *root, struct btrfs_path *path,
384 struct extent_buffer *eb = path->nodes[level];
386 total_btree_bytes += eb->len;
387 if (fs_root_objectid(root->objectid))
388 total_fs_tree_bytes += eb->len;
389 if (btrfs_header_owner(eb) == BTRFS_EXTENT_TREE_OBJECTID)
390 total_extent_tree_bytes += eb->len;
393 btree_space_waste += btrfs_leaf_free_space(root, eb);
395 free_nrs = (BTRFS_NODEPTRS_PER_BLOCK(root->fs_info) -
396 btrfs_header_nritems(eb));
397 btree_space_waste += free_nrs * sizeof(struct btrfs_key_ptr);
402 * Find the @index according by @ino and name.
403 * Notice:time efficiency is O(N)
405 * @root: the root of the fs/file tree
406 * @index_ret: the index as return value
407 * @namebuf: the name to match
408 * @name_len: the length of name to match
409 * @file_type: the file_type of INODE_ITEM to match
411 * Returns 0 if found and *@index_ret will be modified with right value
412 * Returns< 0 not found and *@index_ret will be (u64)-1
414 static int find_dir_index(struct btrfs_root *root, u64 dirid, u64 location_id,
415 u64 *index_ret, char *namebuf, u32 name_len,
418 struct btrfs_path path;
419 struct extent_buffer *node;
420 struct btrfs_dir_item *di;
421 struct btrfs_key key;
422 struct btrfs_key location;
423 char name[BTRFS_NAME_LEN] = {0};
435 /* search from the last index */
436 key.objectid = dirid;
437 key.offset = (u64)-1;
438 key.type = BTRFS_DIR_INDEX_KEY;
440 btrfs_init_path(&path);
441 ret = btrfs_search_slot(NULL, root, &key, &path, 0, 0);
446 ret = btrfs_previous_item(root, &path, dirid, BTRFS_DIR_INDEX_KEY);
452 /* Check whether inode_id/filetype/name match */
453 node = path.nodes[0];
454 slot = path.slots[0];
455 di = btrfs_item_ptr(node, slot, struct btrfs_dir_item);
456 total = btrfs_item_size_nr(node, slot);
457 while (cur < total) {
459 len = btrfs_dir_name_len(node, di);
460 data_len = btrfs_dir_data_len(node, di);
462 btrfs_dir_item_key_to_cpu(node, di, &location);
463 if (location.objectid != location_id ||
464 location.type != BTRFS_INODE_ITEM_KEY ||
465 location.offset != 0)
468 filetype = btrfs_dir_type(node, di);
469 if (file_type != filetype)
472 if (len > BTRFS_NAME_LEN)
473 len = BTRFS_NAME_LEN;
475 read_extent_buffer(node, name, (unsigned long)(di + 1), len);
476 if (len != name_len || strncmp(namebuf, name, len))
479 btrfs_item_key_to_cpu(path.nodes[0], &key, path.slots[0]);
480 *index_ret = key.offset;
484 len += sizeof(*di) + data_len;
485 di = (struct btrfs_dir_item *)((char *)di + len);
491 btrfs_release_path(&path);
496 * Find DIR_ITEM/DIR_INDEX for the given key and check it with the specified
497 * INODE_REF/INODE_EXTREF match.
499 * @root: the root of the fs/file tree
500 * @key: the key of the DIR_ITEM/DIR_INDEX, key->offset will be right
501 * value while find index
502 * @location_key: location key of the struct btrfs_dir_item to match
503 * @name: the name to match
504 * @namelen: the length of name
505 * @file_type: the type of file to math
507 * Return 0 if no error occurred.
508 * Return DIR_ITEM_MISSING/DIR_INDEX_MISSING if couldn't find
510 * Return DIR_ITEM_MISMATCH/DIR_INDEX_MISMATCH if INODE_REF/INODE_EXTREF
511 * and DIR_ITEM/DIR_INDEX mismatch
513 static int find_dir_item(struct btrfs_root *root, struct btrfs_key *key,
514 struct btrfs_key *location_key, char *name,
515 u32 namelen, u8 file_type)
517 struct btrfs_path path;
518 struct extent_buffer *node;
519 struct btrfs_dir_item *di;
520 struct btrfs_key location;
521 char namebuf[BTRFS_NAME_LEN] = {0};
530 /* get the index by traversing all index */
531 if (key->type == BTRFS_DIR_INDEX_KEY && key->offset == (u64)-1) {
532 ret = find_dir_index(root, key->objectid,
533 location_key->objectid, &key->offset,
534 name, namelen, file_type);
536 ret = DIR_INDEX_MISSING;
540 btrfs_init_path(&path);
541 ret = btrfs_search_slot(NULL, root, key, &path, 0, 0);
543 ret = key->type == BTRFS_DIR_ITEM_KEY ? DIR_ITEM_MISSING :
548 /* Check whether inode_id/filetype/name match */
549 node = path.nodes[0];
550 slot = path.slots[0];
551 di = btrfs_item_ptr(node, slot, struct btrfs_dir_item);
552 total = btrfs_item_size_nr(node, slot);
553 while (cur < total) {
554 ret = key->type == BTRFS_DIR_ITEM_KEY ?
555 DIR_ITEM_MISMATCH : DIR_INDEX_MISMATCH;
557 len = btrfs_dir_name_len(node, di);
558 data_len = btrfs_dir_data_len(node, di);
560 btrfs_dir_item_key_to_cpu(node, di, &location);
561 if (location.objectid != location_key->objectid ||
562 location.type != location_key->type ||
563 location.offset != location_key->offset)
566 filetype = btrfs_dir_type(node, di);
567 if (file_type != filetype)
570 if (len > BTRFS_NAME_LEN) {
571 len = BTRFS_NAME_LEN;
572 warning("root %llu %s[%llu %llu] name too long %u, trimmed",
574 key->type == BTRFS_DIR_ITEM_KEY ?
575 "DIR_ITEM" : "DIR_INDEX",
576 key->objectid, key->offset, len);
578 read_extent_buffer(node, namebuf, (unsigned long)(di + 1),
580 if (len != namelen || strncmp(namebuf, name, len))
586 len += sizeof(*di) + data_len;
587 di = (struct btrfs_dir_item *)((char *)di + len);
592 btrfs_release_path(&path);
597 * The ternary means dir item, dir index and relative inode ref.
598 * The function handles errs: INODE_MISSING, DIR_INDEX_MISSING
599 * DIR_INDEX_MISMATCH, DIR_ITEM_MISSING, DIR_ITEM_MISMATCH by the follow
601 * If two of three is missing or mismatched, delete the existing one.
602 * If one of three is missing or mismatched, add the missing one.
604 * returns 0 means success.
605 * returns not 0 means on error;
607 int repair_ternary_lowmem(struct btrfs_root *root, u64 dir_ino, u64 ino,
608 u64 index, char *name, int name_len, u8 filetype,
611 struct btrfs_trans_handle *trans;
616 * stage shall be one of following valild values:
617 * 0: Fine, nothing to do.
618 * 1: One of three is wrong, so add missing one.
619 * 2: Two of three is wrong, so delete existed one.
621 if (err & (DIR_INDEX_MISMATCH | DIR_INDEX_MISSING))
623 if (err & (DIR_ITEM_MISMATCH | DIR_ITEM_MISSING))
625 if (err & (INODE_REF_MISSING))
628 /* stage must be smllarer than 3 */
631 trans = btrfs_start_transaction(root, 1);
633 ret = btrfs_unlink(trans, root, ino, dir_ino, index, name,
638 ret = btrfs_add_link(trans, root, ino, dir_ino, name, name_len,
639 filetype, &index, 1, 1);
643 btrfs_commit_transaction(trans, root);
646 error("fail to repair inode %llu name %s filetype %u",
647 ino, name, filetype);
649 printf("%s ref/dir_item of inode %llu name %s filetype %u\n",
650 stage == 2 ? "Delete" : "Add",
651 ino, name, filetype);
657 * Prints inode ref error message
659 static void print_inode_ref_err(struct btrfs_root *root, struct btrfs_key *key,
660 u64 index, const char *namebuf, int name_len,
661 u8 filetype, int err)
667 if (key->objectid == BTRFS_FIRST_FREE_OBJECTID) {
669 "root %llu root dir shouldn't have INODE REF[%llu %llu] name %s",
670 root->objectid, key->objectid, key->offset, namebuf);
675 if (err & (DIR_ITEM_MISMATCH | DIR_ITEM_MISSING))
676 error("root %llu DIR ITEM[%llu %llu] %s name %s filetype %u",
677 root->objectid, key->offset,
678 btrfs_name_hash(namebuf, name_len),
679 err & DIR_ITEM_MISMATCH ? "mismatch" : "missing",
681 if (err & (DIR_INDEX_MISMATCH | DIR_INDEX_MISSING))
682 error("root %llu DIR INDEX[%llu %llu] %s name %s filetype %u",
683 root->objectid, key->offset, index,
684 err & DIR_ITEM_MISMATCH ? "mismatch" : "missing",
689 * Traverse the given INODE_REF and call find_dir_item() to find related
690 * DIR_ITEM/DIR_INDEX.
692 * @root: the root of the fs/file tree
693 * @ref_key: the key of the INODE_REF
694 * @path the path provides node and slot
695 * @refs: the count of INODE_REF
696 * @mode: the st_mode of INODE_ITEM
697 * @name_ret: returns with the first ref's name
698 * @name_len_ret: len of the name_ret
700 * Return 0 if no error occurred.
702 static int check_inode_ref(struct btrfs_root *root, struct btrfs_key *ref_key,
703 struct btrfs_path *path, char *name_ret,
704 u32 *namelen_ret, u64 *refs_ret, int mode)
706 struct btrfs_key key;
707 struct btrfs_key location;
708 struct btrfs_inode_ref *ref;
709 struct extent_buffer *node;
710 char namebuf[BTRFS_NAME_LEN] = {0};
720 int need_research = 0;
728 /* since after repair, path and the dir item may be changed */
731 btrfs_release_path(path);
732 ret = btrfs_search_slot(NULL, root, ref_key, path, 0, 0);
734 * The item was deleted, let the path point to the last checked
738 if (path->slots[0] == 0)
739 btrfs_prev_leaf(root, path);
747 location.objectid = ref_key->objectid;
748 location.type = BTRFS_INODE_ITEM_KEY;
750 node = path->nodes[0];
751 slot = path->slots[0];
753 memset(namebuf, 0, sizeof(namebuf) / sizeof(*namebuf));
754 ref = btrfs_item_ptr(node, slot, struct btrfs_inode_ref);
755 total = btrfs_item_size_nr(node, slot);
758 /* Update inode ref count */
761 index = btrfs_inode_ref_index(node, ref);
762 name_len = btrfs_inode_ref_name_len(node, ref);
764 if (name_len <= BTRFS_NAME_LEN) {
767 len = BTRFS_NAME_LEN;
768 warning("root %llu INODE_REF[%llu %llu] name too long",
769 root->objectid, ref_key->objectid, ref_key->offset);
772 read_extent_buffer(node, namebuf, (unsigned long)(ref + 1), len);
774 /* copy the first name found to name_ret */
775 if (refs == 1 && name_ret) {
776 memcpy(name_ret, namebuf, len);
780 /* Check root dir ref */
781 if (ref_key->objectid == BTRFS_FIRST_FREE_OBJECTID) {
782 if (index != 0 || len != strlen("..") ||
783 strncmp("..", namebuf, len) ||
784 ref_key->offset != BTRFS_FIRST_FREE_OBJECTID) {
785 /* set err bits then repair will delete the ref */
786 err |= DIR_INDEX_MISSING;
787 err |= DIR_ITEM_MISSING;
792 /* Find related DIR_INDEX */
793 key.objectid = ref_key->offset;
794 key.type = BTRFS_DIR_INDEX_KEY;
796 tmp_err |= find_dir_item(root, &key, &location, namebuf, len,
797 imode_to_type(mode));
799 /* Find related dir_item */
800 key.objectid = ref_key->offset;
801 key.type = BTRFS_DIR_ITEM_KEY;
802 key.offset = btrfs_name_hash(namebuf, len);
803 tmp_err |= find_dir_item(root, &key, &location, namebuf, len,
804 imode_to_type(mode));
806 if (tmp_err && repair) {
807 ret = repair_ternary_lowmem(root, ref_key->offset,
808 ref_key->objectid, index, namebuf,
809 name_len, imode_to_type(mode),
816 print_inode_ref_err(root, ref_key, index, namebuf, name_len,
817 imode_to_type(mode), tmp_err);
819 len = sizeof(*ref) + name_len;
820 ref = (struct btrfs_inode_ref *)((char *)ref + len);
831 * Traverse the given INODE_EXTREF and call find_dir_item() to find related
832 * DIR_ITEM/DIR_INDEX.
834 * @root: the root of the fs/file tree
835 * @ref_key: the key of the INODE_EXTREF
836 * @refs: the count of INODE_EXTREF
837 * @mode: the st_mode of INODE_ITEM
839 * Return 0 if no error occurred.
841 static int check_inode_extref(struct btrfs_root *root,
842 struct btrfs_key *ref_key,
843 struct extent_buffer *node, int slot, u64 *refs,
846 struct btrfs_key key;
847 struct btrfs_key location;
848 struct btrfs_inode_extref *extref;
849 char namebuf[BTRFS_NAME_LEN] = {0};
859 location.objectid = ref_key->objectid;
860 location.type = BTRFS_INODE_ITEM_KEY;
863 extref = btrfs_item_ptr(node, slot, struct btrfs_inode_extref);
864 total = btrfs_item_size_nr(node, slot);
867 /* update inode ref count */
869 name_len = btrfs_inode_extref_name_len(node, extref);
870 index = btrfs_inode_extref_index(node, extref);
871 parent = btrfs_inode_extref_parent(node, extref);
872 if (name_len <= BTRFS_NAME_LEN) {
875 len = BTRFS_NAME_LEN;
876 warning("root %llu INODE_EXTREF[%llu %llu] name too long",
877 root->objectid, ref_key->objectid, ref_key->offset);
879 read_extent_buffer(node, namebuf, (unsigned long)(extref + 1), len);
881 /* Check root dir ref name */
882 if (index == 0 && strncmp(namebuf, "..", name_len)) {
883 error("root %llu INODE_EXTREF[%llu %llu] ROOT_DIR name shouldn't be %s",
884 root->objectid, ref_key->objectid, ref_key->offset,
886 err |= ROOT_DIR_ERROR;
889 /* find related dir_index */
890 key.objectid = parent;
891 key.type = BTRFS_DIR_INDEX_KEY;
893 ret = find_dir_item(root, &key, &location, namebuf, len, mode);
896 /* find related dir_item */
897 key.objectid = parent;
898 key.type = BTRFS_DIR_ITEM_KEY;
899 key.offset = btrfs_name_hash(namebuf, len);
900 ret = find_dir_item(root, &key, &location, namebuf, len, mode);
903 len = sizeof(*extref) + name_len;
904 extref = (struct btrfs_inode_extref *)((char *)extref + len);
914 * Find INODE_REF/INODE_EXTREF for the given key and check it with the specified
915 * DIR_ITEM/DIR_INDEX match.
916 * Return with @index_ret.
918 * @root: the root of the fs/file tree
919 * @key: the key of the INODE_REF/INODE_EXTREF
920 * @name: the name in the INODE_REF/INODE_EXTREF
921 * @namelen: the length of name in the INODE_REF/INODE_EXTREF
922 * @index_ret: the index in the INODE_REF/INODE_EXTREF,
923 * value (64)-1 means do not check index
924 * @ext_ref: the EXTENDED_IREF feature
926 * Return 0 if no error occurred.
927 * Return >0 for error bitmap
929 static int find_inode_ref(struct btrfs_root *root, struct btrfs_key *key,
930 char *name, int namelen, u64 *index_ret,
931 unsigned int ext_ref)
933 struct btrfs_path path;
934 struct btrfs_inode_ref *ref;
935 struct btrfs_inode_extref *extref;
936 struct extent_buffer *node;
937 char ref_namebuf[BTRFS_NAME_LEN] = {0};
950 btrfs_init_path(&path);
951 ret = btrfs_search_slot(NULL, root, key, &path, 0, 0);
953 ret = INODE_REF_MISSING;
957 node = path.nodes[0];
958 slot = path.slots[0];
960 ref = btrfs_item_ptr(node, slot, struct btrfs_inode_ref);
961 total = btrfs_item_size_nr(node, slot);
963 /* Iterate all entry of INODE_REF */
964 while (cur < total) {
965 ret = INODE_REF_MISSING;
967 ref_namelen = btrfs_inode_ref_name_len(node, ref);
968 ref_index = btrfs_inode_ref_index(node, ref);
969 if (*index_ret != (u64)-1 && *index_ret != ref_index)
972 if (cur + sizeof(*ref) + ref_namelen > total ||
973 ref_namelen > BTRFS_NAME_LEN) {
974 warning("root %llu INODE %s[%llu %llu] name too long",
976 key->type == BTRFS_INODE_REF_KEY ?
978 key->objectid, key->offset);
980 if (cur + sizeof(*ref) > total)
982 len = min_t(u32, total - cur - sizeof(*ref),
988 read_extent_buffer(node, ref_namebuf, (unsigned long)(ref + 1),
991 if (len != namelen || strncmp(ref_namebuf, name, len))
994 *index_ret = ref_index;
998 len = sizeof(*ref) + ref_namelen;
999 ref = (struct btrfs_inode_ref *)((char *)ref + len);
1004 /* Skip if not support EXTENDED_IREF feature */
1008 btrfs_release_path(&path);
1009 btrfs_init_path(&path);
1011 dir_id = key->offset;
1012 key->type = BTRFS_INODE_EXTREF_KEY;
1013 key->offset = btrfs_extref_hash(dir_id, name, namelen);
1015 ret = btrfs_search_slot(NULL, root, key, &path, 0, 0);
1017 ret = INODE_REF_MISSING;
1021 node = path.nodes[0];
1022 slot = path.slots[0];
1024 extref = btrfs_item_ptr(node, slot, struct btrfs_inode_extref);
1026 total = btrfs_item_size_nr(node, slot);
1028 /* Iterate all entry of INODE_EXTREF */
1029 while (cur < total) {
1030 ret = INODE_REF_MISSING;
1032 ref_namelen = btrfs_inode_extref_name_len(node, extref);
1033 ref_index = btrfs_inode_extref_index(node, extref);
1034 parent = btrfs_inode_extref_parent(node, extref);
1035 if (*index_ret != (u64)-1 && *index_ret != ref_index)
1038 if (parent != dir_id)
1041 if (ref_namelen <= BTRFS_NAME_LEN) {
1044 len = BTRFS_NAME_LEN;
1045 warning("root %llu INODE %s[%llu %llu] name too long",
1047 key->type == BTRFS_INODE_REF_KEY ?
1049 key->objectid, key->offset);
1051 read_extent_buffer(node, ref_namebuf,
1052 (unsigned long)(extref + 1), len);
1054 if (len != namelen || strncmp(ref_namebuf, name, len))
1057 *index_ret = ref_index;
1062 len = sizeof(*extref) + ref_namelen;
1063 extref = (struct btrfs_inode_extref *)((char *)extref + len);
1068 btrfs_release_path(&path);
1072 static int create_inode_item_lowmem(struct btrfs_trans_handle *trans,
1073 struct btrfs_root *root, u64 ino,
1076 u32 mode = (filetype == BTRFS_FT_DIR ? S_IFDIR : S_IFREG) | 0755;
1078 return insert_inode_item(trans, root, ino, 0, 0, 0, mode);
1082 * Insert the missing inode item.
1084 * Returns 0 means success.
1085 * Returns <0 means error.
1087 static int repair_inode_item_missing(struct btrfs_root *root, u64 ino,
1090 struct btrfs_key key;
1091 struct btrfs_trans_handle *trans;
1092 struct btrfs_path path;
1096 key.type = BTRFS_INODE_ITEM_KEY;
1099 btrfs_init_path(&path);
1100 trans = btrfs_start_transaction(root, 1);
1101 if (IS_ERR(trans)) {
1106 ret = btrfs_search_slot(trans, root, &key, &path, 1, 1);
1107 if (ret < 0 || !ret)
1110 /* insert inode item */
1111 create_inode_item_lowmem(trans, root, ino, filetype);
1114 btrfs_commit_transaction(trans, root);
1117 error("failed to repair root %llu INODE ITEM[%llu] missing",
1118 root->objectid, ino);
1119 btrfs_release_path(&path);
1124 * Call repair_inode_item_missing and repair_ternary_lowmem to repair
1126 * Returns error after repair
1128 static int repair_dir_item(struct btrfs_root *root, u64 dirid, u64 ino,
1129 u64 index, u8 filetype, char *namebuf, u32 name_len,
1134 if (err & INODE_ITEM_MISSING) {
1135 ret = repair_inode_item_missing(root, ino, filetype);
1137 err &= ~(INODE_ITEM_MISMATCH | INODE_ITEM_MISSING);
1140 if (err & ~(INODE_ITEM_MISMATCH | INODE_ITEM_MISSING)) {
1141 ret = repair_ternary_lowmem(root, dirid, ino, index, namebuf,
1142 name_len, filetype, err);
1144 err &= ~(DIR_INDEX_MISMATCH | DIR_INDEX_MISSING);
1145 err &= ~(DIR_ITEM_MISMATCH | DIR_ITEM_MISSING);
1146 err &= ~(INODE_REF_MISSING);
1152 static void print_dir_item_err(struct btrfs_root *root, struct btrfs_key *key,
1153 u64 ino, u64 index, const char *namebuf,
1154 int name_len, u8 filetype, int err)
1156 if (err & (DIR_ITEM_MISMATCH | DIR_ITEM_MISSING)) {
1157 error("root %llu DIR ITEM[%llu %llu] name %s filetype %d %s",
1158 root->objectid, key->objectid, key->offset, namebuf,
1160 err & DIR_ITEM_MISMATCH ? "mismath" : "missing");
1163 if (err & (DIR_INDEX_MISMATCH | DIR_INDEX_MISSING)) {
1164 error("root %llu DIR INDEX[%llu %llu] name %s filetype %d %s",
1165 root->objectid, key->objectid, index, namebuf, filetype,
1166 err & DIR_ITEM_MISMATCH ? "mismath" : "missing");
1169 if (err & (INODE_ITEM_MISSING | INODE_ITEM_MISMATCH)) {
1171 "root %llu INODE_ITEM[%llu] index %llu name %s filetype %d %s",
1172 root->objectid, ino, index, namebuf, filetype,
1173 err & INODE_ITEM_MISMATCH ? "mismath" : "missing");
1176 if (err & INODE_REF_MISSING)
1178 "root %llu INODE REF[%llu, %llu] name %s filetype %u missing",
1179 root->objectid, ino, key->objectid, namebuf, filetype);
1184 * Traverse the given DIR_ITEM/DIR_INDEX and check related INODE_ITEM and
1185 * call find_inode_ref() to check related INODE_REF/INODE_EXTREF.
1187 * @root: the root of the fs/file tree
1188 * @key: the key of the INODE_REF/INODE_EXTREF
1190 * @size: the st_size of the INODE_ITEM
1191 * @ext_ref: the EXTENDED_IREF feature
1193 * Return 0 if no error occurred.
1194 * Return DIR_COUNT_AGAIN if the isize of the inode should be recalculated.
1196 static int check_dir_item(struct btrfs_root *root, struct btrfs_key *di_key,
1197 struct btrfs_path *path, u64 *size,
1198 unsigned int ext_ref)
1200 struct btrfs_dir_item *di;
1201 struct btrfs_inode_item *ii;
1202 struct btrfs_key key;
1203 struct btrfs_key location;
1204 struct extent_buffer *node;
1206 char namebuf[BTRFS_NAME_LEN] = {0};
1218 int need_research = 0;
1221 * For DIR_ITEM set index to (u64)-1, so that find_inode_ref
1222 * ignore index check.
1224 if (di_key->type == BTRFS_DIR_INDEX_KEY)
1225 index = di_key->offset;
1232 /* since after repair, path and the dir item may be changed */
1233 if (need_research) {
1235 err |= DIR_COUNT_AGAIN;
1236 btrfs_release_path(path);
1237 ret = btrfs_search_slot(NULL, root, di_key, path, 0, 0);
1238 /* the item was deleted, let path point the last checked item */
1240 if (path->slots[0] == 0)
1241 btrfs_prev_leaf(root, path);
1249 node = path->nodes[0];
1250 slot = path->slots[0];
1252 di = btrfs_item_ptr(node, slot, struct btrfs_dir_item);
1253 total = btrfs_item_size_nr(node, slot);
1254 memset(namebuf, 0, sizeof(namebuf) / sizeof(*namebuf));
1256 while (cur < total) {
1257 data_len = btrfs_dir_data_len(node, di);
1260 error("root %llu %s[%llu %llu] data_len shouldn't be %u",
1262 di_key->type == BTRFS_DIR_ITEM_KEY ? "DIR_ITEM" : "DIR_INDEX",
1263 di_key->objectid, di_key->offset, data_len);
1265 name_len = btrfs_dir_name_len(node, di);
1266 if (name_len <= BTRFS_NAME_LEN) {
1269 len = BTRFS_NAME_LEN;
1270 warning("root %llu %s[%llu %llu] name too long",
1272 di_key->type == BTRFS_DIR_ITEM_KEY ? "DIR_ITEM" : "DIR_INDEX",
1273 di_key->objectid, di_key->offset);
1275 (*size) += name_len;
1276 read_extent_buffer(node, namebuf, (unsigned long)(di + 1),
1278 filetype = btrfs_dir_type(node, di);
1280 if (di_key->type == BTRFS_DIR_ITEM_KEY &&
1281 di_key->offset != btrfs_name_hash(namebuf, len)) {
1283 error("root %llu DIR_ITEM[%llu %llu] name %s namelen %u filetype %u mismatch with its hash, wanted %llu have %llu",
1284 root->objectid, di_key->objectid, di_key->offset,
1285 namebuf, len, filetype, di_key->offset,
1286 btrfs_name_hash(namebuf, len));
1289 btrfs_dir_item_key_to_cpu(node, di, &location);
1290 /* Ignore related ROOT_ITEM check */
1291 if (location.type == BTRFS_ROOT_ITEM_KEY)
1294 btrfs_release_path(path);
1295 /* Check relative INODE_ITEM(existence/filetype) */
1296 ret = btrfs_search_slot(NULL, root, &location, path, 0, 0);
1298 tmp_err |= INODE_ITEM_MISSING;
1302 ii = btrfs_item_ptr(path->nodes[0], path->slots[0],
1303 struct btrfs_inode_item);
1304 mode = btrfs_inode_mode(path->nodes[0], ii);
1305 if (imode_to_type(mode) != filetype) {
1306 tmp_err |= INODE_ITEM_MISMATCH;
1310 /* Check relative INODE_REF/INODE_EXTREF */
1311 key.objectid = location.objectid;
1312 key.type = BTRFS_INODE_REF_KEY;
1313 key.offset = di_key->objectid;
1314 tmp_err |= find_inode_ref(root, &key, namebuf, len,
1317 /* check relative INDEX/ITEM */
1318 key.objectid = di_key->objectid;
1319 if (key.type == BTRFS_DIR_ITEM_KEY) {
1320 key.type = BTRFS_DIR_INDEX_KEY;
1323 key.type = BTRFS_DIR_ITEM_KEY;
1324 key.offset = btrfs_name_hash(namebuf, name_len);
1327 tmp_err |= find_dir_item(root, &key, &location, namebuf,
1328 name_len, filetype);
1329 /* find_dir_item may find index */
1330 if (key.type == BTRFS_DIR_INDEX_KEY)
1334 if (tmp_err && repair) {
1335 ret = repair_dir_item(root, di_key->objectid,
1336 location.objectid, index,
1337 imode_to_type(mode), namebuf,
1339 if (ret != tmp_err) {
1344 btrfs_release_path(path);
1345 print_dir_item_err(root, di_key, location.objectid, index,
1346 namebuf, name_len, filetype, tmp_err);
1348 len = sizeof(*di) + name_len + data_len;
1349 di = (struct btrfs_dir_item *)((char *)di + len);
1352 if (di_key->type == BTRFS_DIR_INDEX_KEY && cur < total) {
1353 error("root %llu DIR_INDEX[%llu %llu] should contain only one entry",
1354 root->objectid, di_key->objectid,
1361 btrfs_release_path(path);
1362 ret = btrfs_search_slot(NULL, root, di_key, path, 0, 0);
1364 err |= ret > 0 ? -ENOENT : ret;
1369 * Wrapper function of btrfs_punch_hole.
1371 * Returns 0 means success.
1372 * Returns not 0 means error.
1374 static int punch_extent_hole(struct btrfs_root *root, u64 ino, u64 start,
1377 struct btrfs_trans_handle *trans;
1380 trans = btrfs_start_transaction(root, 1);
1382 return PTR_ERR(trans);
1384 ret = btrfs_punch_hole(trans, root, ino, start, len);
1386 error("failed to add hole [%llu, %llu] in inode [%llu]",
1389 printf("Add a hole [%llu, %llu] in inode [%llu]\n", start, len,
1392 btrfs_commit_transaction(trans, root);
1397 * Check file extent datasum/hole, update the size of the file extents,
1398 * check and update the last offset of the file extent.
1400 * @root: the root of fs/file tree.
1401 * @fkey: the key of the file extent.
1402 * @nodatasum: INODE_NODATASUM feature.
1403 * @size: the sum of all EXTENT_DATA items size for this inode.
1404 * @end: the offset of the last extent.
1406 * Return 0 if no error occurred.
1408 static int check_file_extent(struct btrfs_root *root, struct btrfs_key *fkey,
1409 struct extent_buffer *node, int slot,
1410 unsigned int nodatasum, u64 *size, u64 *end)
1412 struct btrfs_file_extent_item *fi;
1415 u64 extent_num_bytes;
1417 u64 csum_found; /* In byte size, sectorsize aligned */
1418 u64 search_start; /* Logical range start we search for csum */
1419 u64 search_len; /* Logical range len we search for csum */
1420 unsigned int extent_type;
1421 unsigned int is_hole;
1426 fi = btrfs_item_ptr(node, slot, struct btrfs_file_extent_item);
1428 /* Check inline extent */
1429 extent_type = btrfs_file_extent_type(node, fi);
1430 if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
1431 struct btrfs_item *e = btrfs_item_nr(slot);
1432 u32 item_inline_len;
1434 item_inline_len = btrfs_file_extent_inline_item_len(node, e);
1435 extent_num_bytes = btrfs_file_extent_inline_len(node, slot, fi);
1436 compressed = btrfs_file_extent_compression(node, fi);
1437 if (extent_num_bytes == 0) {
1439 "root %llu EXTENT_DATA[%llu %llu] has empty inline extent",
1440 root->objectid, fkey->objectid, fkey->offset);
1441 err |= FILE_EXTENT_ERROR;
1443 if (!compressed && extent_num_bytes != item_inline_len) {
1445 "root %llu EXTENT_DATA[%llu %llu] wrong inline size, have: %llu, expected: %u",
1446 root->objectid, fkey->objectid, fkey->offset,
1447 extent_num_bytes, item_inline_len);
1448 err |= FILE_EXTENT_ERROR;
1450 *end += extent_num_bytes;
1451 *size += extent_num_bytes;
1455 /* Check extent type */
1456 if (extent_type != BTRFS_FILE_EXTENT_REG &&
1457 extent_type != BTRFS_FILE_EXTENT_PREALLOC) {
1458 err |= FILE_EXTENT_ERROR;
1459 error("root %llu EXTENT_DATA[%llu %llu] type bad",
1460 root->objectid, fkey->objectid, fkey->offset);
1464 /* Check REG_EXTENT/PREALLOC_EXTENT */
1465 disk_bytenr = btrfs_file_extent_disk_bytenr(node, fi);
1466 disk_num_bytes = btrfs_file_extent_disk_num_bytes(node, fi);
1467 extent_num_bytes = btrfs_file_extent_num_bytes(node, fi);
1468 extent_offset = btrfs_file_extent_offset(node, fi);
1469 compressed = btrfs_file_extent_compression(node, fi);
1470 is_hole = (disk_bytenr == 0) && (disk_num_bytes == 0);
1473 * Check EXTENT_DATA csum
1475 * For plain (uncompressed) extent, we should only check the range
1476 * we're referring to, as it's possible that part of prealloc extent
1477 * has been written, and has csum:
1479 * |<--- Original large preallocated extent A ---->|
1480 * |<- Prealloc File Extent ->|<- Regular Extent ->|
1483 * For compressed extent, we should check the whole range.
1486 search_start = disk_bytenr + extent_offset;
1487 search_len = extent_num_bytes;
1489 search_start = disk_bytenr;
1490 search_len = disk_num_bytes;
1492 ret = count_csum_range(root->fs_info, search_start, search_len,
1494 if (csum_found > 0 && nodatasum) {
1495 err |= ODD_CSUM_ITEM;
1496 error("root %llu EXTENT_DATA[%llu %llu] nodatasum shouldn't have datasum",
1497 root->objectid, fkey->objectid, fkey->offset);
1498 } else if (extent_type == BTRFS_FILE_EXTENT_REG && !nodatasum &&
1499 !is_hole && (ret < 0 || csum_found < search_len)) {
1500 err |= CSUM_ITEM_MISSING;
1501 error("root %llu EXTENT_DATA[%llu %llu] csum missing, have: %llu, expected: %llu",
1502 root->objectid, fkey->objectid, fkey->offset,
1503 csum_found, search_len);
1504 } else if (extent_type == BTRFS_FILE_EXTENT_PREALLOC &&
1506 err |= ODD_CSUM_ITEM;
1507 error("root %llu EXTENT_DATA[%llu %llu] prealloc shouldn't have csum, but has: %llu",
1508 root->objectid, fkey->objectid, fkey->offset, csum_found);
1511 /* Check EXTENT_DATA hole */
1512 if (!no_holes && *end != fkey->offset) {
1514 ret = punch_extent_hole(root, fkey->objectid,
1515 *end, fkey->offset - *end);
1516 if (!repair || ret) {
1517 err |= FILE_EXTENT_ERROR;
1519 "root %llu EXTENT_DATA[%llu %llu] gap exists, expected: EXTENT_DATA[%llu %llu]",
1520 root->objectid, fkey->objectid, fkey->offset,
1521 fkey->objectid, *end);
1525 *end += extent_num_bytes;
1527 *size += extent_num_bytes;
1532 static int __count_dir_isize(struct btrfs_root *root, u64 ino, int type,
1535 struct btrfs_key key;
1536 struct btrfs_path path;
1538 struct btrfs_dir_item *di;
1548 key.offset = (u64)-1;
1550 btrfs_init_path(&path);
1551 ret = btrfs_search_slot(NULL, root, &key, &path, 0, 0);
1556 /* if found, go to spacial case */
1561 ret = btrfs_previous_item(root, &path, ino, type);
1569 di = btrfs_item_ptr(path.nodes[0], path.slots[0], struct btrfs_dir_item);
1571 total = btrfs_item_size_nr(path.nodes[0], path.slots[0]);
1573 while (cur < total) {
1574 len = btrfs_dir_name_len(path.nodes[0], di);
1575 if (len > BTRFS_NAME_LEN)
1576 len = BTRFS_NAME_LEN;
1579 len += btrfs_dir_data_len(path.nodes[0], di);
1581 di = (struct btrfs_dir_item *)((char *)di + len);
1587 btrfs_release_path(&path);
1591 static int count_dir_isize(struct btrfs_root *root, u64 ino, u64 *size)
1598 ret = __count_dir_isize(root, ino, BTRFS_DIR_ITEM_KEY, &item_size);
1602 ret = __count_dir_isize(root, ino, BTRFS_DIR_INDEX_KEY, &index_size);
1606 *size = item_size + index_size;
1610 error("failed to count root %llu INODE[%llu] root size",
1611 root->objectid, ino);
1616 * Set inode item nbytes to @nbytes
1618 * Returns 0 on success
1619 * Returns != 0 on error
1621 static int repair_inode_nbytes_lowmem(struct btrfs_root *root,
1622 struct btrfs_path *path,
1623 u64 ino, u64 nbytes)
1625 struct btrfs_trans_handle *trans;
1626 struct btrfs_inode_item *ii;
1627 struct btrfs_key key;
1628 struct btrfs_key research_key;
1632 btrfs_item_key_to_cpu(path->nodes[0], &research_key, path->slots[0]);
1635 key.type = BTRFS_INODE_ITEM_KEY;
1638 trans = btrfs_start_transaction(root, 1);
1639 if (IS_ERR(trans)) {
1640 ret = PTR_ERR(trans);
1645 btrfs_release_path(path);
1646 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
1654 ii = btrfs_item_ptr(path->nodes[0], path->slots[0],
1655 struct btrfs_inode_item);
1656 btrfs_set_inode_nbytes(path->nodes[0], ii, nbytes);
1657 btrfs_mark_buffer_dirty(path->nodes[0]);
1659 btrfs_commit_transaction(trans, root);
1662 error("failed to set nbytes in inode %llu root %llu",
1663 ino, root->root_key.objectid);
1665 printf("Set nbytes in inode item %llu root %llu\n to %llu", ino,
1666 root->root_key.objectid, nbytes);
1669 btrfs_release_path(path);
1670 ret = btrfs_search_slot(NULL, root, &research_key, path, 0, 0);
1677 * Set directory inode isize to @isize.
1679 * Returns 0 on success.
1680 * Returns != 0 on error.
1682 static int repair_dir_isize_lowmem(struct btrfs_root *root,
1683 struct btrfs_path *path,
1686 struct btrfs_trans_handle *trans;
1687 struct btrfs_inode_item *ii;
1688 struct btrfs_key key;
1689 struct btrfs_key research_key;
1693 btrfs_item_key_to_cpu(path->nodes[0], &research_key, path->slots[0]);
1696 key.type = BTRFS_INODE_ITEM_KEY;
1699 trans = btrfs_start_transaction(root, 1);
1700 if (IS_ERR(trans)) {
1701 ret = PTR_ERR(trans);
1706 btrfs_release_path(path);
1707 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
1715 ii = btrfs_item_ptr(path->nodes[0], path->slots[0],
1716 struct btrfs_inode_item);
1717 btrfs_set_inode_size(path->nodes[0], ii, isize);
1718 btrfs_mark_buffer_dirty(path->nodes[0]);
1720 btrfs_commit_transaction(trans, root);
1723 error("failed to set isize in inode %llu root %llu",
1724 ino, root->root_key.objectid);
1726 printf("Set isize in inode %llu root %llu to %llu\n",
1727 ino, root->root_key.objectid, isize);
1729 btrfs_release_path(path);
1730 ret = btrfs_search_slot(NULL, root, &research_key, path, 0, 0);
1737 * Wrapper function for btrfs_add_orphan_item().
1739 * Returns 0 on success.
1740 * Returns != 0 on error.
1742 static int repair_inode_orphan_item_lowmem(struct btrfs_root *root,
1743 struct btrfs_path *path, u64 ino)
1745 struct btrfs_trans_handle *trans;
1746 struct btrfs_key research_key;
1750 btrfs_item_key_to_cpu(path->nodes[0], &research_key, path->slots[0]);
1752 trans = btrfs_start_transaction(root, 1);
1753 if (IS_ERR(trans)) {
1754 ret = PTR_ERR(trans);
1759 btrfs_release_path(path);
1760 ret = btrfs_add_orphan_item(trans, root, path, ino);
1762 btrfs_commit_transaction(trans, root);
1765 error("failed to add inode %llu as orphan item root %llu",
1766 ino, root->root_key.objectid);
1768 printf("Added inode %llu as orphan item root %llu\n",
1769 ino, root->root_key.objectid);
1771 btrfs_release_path(path);
1772 ret = btrfs_search_slot(NULL, root, &research_key, path, 0, 0);
1778 /* Set inode_item nlink to @ref_count.
1779 * If @ref_count == 0, move it to "lost+found" and increase @ref_count.
1781 * Returns 0 on success
1783 static int repair_inode_nlinks_lowmem(struct btrfs_root *root,
1784 struct btrfs_path *path, u64 ino,
1785 const char *name, u32 namelen,
1786 u64 ref_count, u8 filetype, u64 *nlink)
1788 struct btrfs_trans_handle *trans;
1789 struct btrfs_inode_item *ii;
1790 struct btrfs_key key;
1791 struct btrfs_key old_key;
1792 char namebuf[BTRFS_NAME_LEN] = {0};
1798 btrfs_item_key_to_cpu(path->nodes[0], &old_key, path->slots[0]);
1800 if (name && namelen) {
1801 ASSERT(namelen <= BTRFS_NAME_LEN);
1802 memcpy(namebuf, name, namelen);
1805 sprintf(namebuf, "%llu", ino);
1806 name_len = count_digits(ino);
1807 printf("Can't find file name for inode %llu, use %s instead\n",
1811 trans = btrfs_start_transaction(root, 1);
1812 if (IS_ERR(trans)) {
1813 ret = PTR_ERR(trans);
1817 btrfs_release_path(path);
1818 /* if refs is 0, put it into lostfound */
1819 if (ref_count == 0) {
1820 ret = link_inode_to_lostfound(trans, root, path, ino, namebuf,
1821 name_len, filetype, &ref_count);
1826 /* reset inode_item's nlink to ref_count */
1828 key.type = BTRFS_INODE_ITEM_KEY;
1831 btrfs_release_path(path);
1832 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
1838 ii = btrfs_item_ptr(path->nodes[0], path->slots[0],
1839 struct btrfs_inode_item);
1840 btrfs_set_inode_nlink(path->nodes[0], ii, ref_count);
1841 btrfs_mark_buffer_dirty(path->nodes[0]);
1846 btrfs_commit_transaction(trans, root);
1850 "fail to repair nlink of inode %llu root %llu name %s filetype %u",
1851 root->objectid, ino, namebuf, filetype);
1853 printf("Fixed nlink of inode %llu root %llu name %s filetype %u\n",
1854 root->objectid, ino, namebuf, filetype);
1857 btrfs_release_path(path);
1858 ret2 = btrfs_search_slot(NULL, root, &old_key, path, 0, 0);
1865 * Check INODE_ITEM and related ITEMs (the same inode number)
1866 * 1. check link count
1867 * 2. check inode ref/extref
1868 * 3. check dir item/index
1870 * @ext_ref: the EXTENDED_IREF feature
1872 * Return 0 if no error occurred.
1873 * Return >0 for error or hit the traversal is done(by error bitmap)
1875 static int check_inode_item(struct btrfs_root *root, struct btrfs_path *path,
1876 unsigned int ext_ref)
1878 struct extent_buffer *node;
1879 struct btrfs_inode_item *ii;
1880 struct btrfs_key key;
1881 struct btrfs_key last_key;
1890 u64 extent_size = 0;
1892 unsigned int nodatasum;
1896 char namebuf[BTRFS_NAME_LEN] = {0};
1899 node = path->nodes[0];
1900 slot = path->slots[0];
1902 btrfs_item_key_to_cpu(node, &key, slot);
1903 inode_id = key.objectid;
1905 if (inode_id == BTRFS_ORPHAN_OBJECTID) {
1906 ret = btrfs_next_item(root, path);
1912 ii = btrfs_item_ptr(node, slot, struct btrfs_inode_item);
1913 isize = btrfs_inode_size(node, ii);
1914 nbytes = btrfs_inode_nbytes(node, ii);
1915 mode = btrfs_inode_mode(node, ii);
1916 dir = imode_to_type(mode) == BTRFS_FT_DIR;
1917 nlink = btrfs_inode_nlink(node, ii);
1918 nodatasum = btrfs_inode_flags(node, ii) & BTRFS_INODE_NODATASUM;
1921 btrfs_item_key_to_cpu(path->nodes[0], &last_key, path->slots[0]);
1922 ret = btrfs_next_item(root, path);
1924 /* out will fill 'err' rusing current statistics */
1926 } else if (ret > 0) {
1931 node = path->nodes[0];
1932 slot = path->slots[0];
1933 btrfs_item_key_to_cpu(node, &key, slot);
1934 if (key.objectid != inode_id)
1938 case BTRFS_INODE_REF_KEY:
1939 ret = check_inode_ref(root, &key, path, namebuf,
1940 &name_len, &refs, mode);
1943 case BTRFS_INODE_EXTREF_KEY:
1944 if (key.type == BTRFS_INODE_EXTREF_KEY && !ext_ref)
1945 warning("root %llu EXTREF[%llu %llu] isn't supported",
1946 root->objectid, key.objectid,
1948 ret = check_inode_extref(root, &key, node, slot, &refs,
1952 case BTRFS_DIR_ITEM_KEY:
1953 case BTRFS_DIR_INDEX_KEY:
1955 warning("root %llu INODE[%llu] mode %u shouldn't have DIR_INDEX[%llu %llu]",
1956 root->objectid, inode_id,
1957 imode_to_type(mode), key.objectid,
1960 ret = check_dir_item(root, &key, path, &size, ext_ref);
1963 case BTRFS_EXTENT_DATA_KEY:
1965 warning("root %llu DIR INODE[%llu] shouldn't EXTENT_DATA[%llu %llu]",
1966 root->objectid, inode_id, key.objectid,
1969 ret = check_file_extent(root, &key, node, slot,
1970 nodatasum, &extent_size,
1974 case BTRFS_XATTR_ITEM_KEY:
1977 error("ITEM[%llu %u %llu] UNKNOWN TYPE",
1978 key.objectid, key.type, key.offset);
1983 if (err & LAST_ITEM) {
1984 btrfs_release_path(path);
1985 ret = btrfs_search_slot(NULL, root, &last_key, path, 0, 0);
1990 /* verify INODE_ITEM nlink/isize/nbytes */
1992 if (repair && (err & DIR_COUNT_AGAIN)) {
1993 err &= ~DIR_COUNT_AGAIN;
1994 count_dir_isize(root, inode_id, &size);
1997 if ((nlink != 1 || refs != 1) && repair) {
1998 ret = repair_inode_nlinks_lowmem(root, path, inode_id,
1999 namebuf, name_len, refs, imode_to_type(mode),
2004 err |= LINK_COUNT_ERROR;
2005 error("root %llu DIR INODE[%llu] shouldn't have more than one link(%llu)",
2006 root->objectid, inode_id, nlink);
2010 * Just a warning, as dir inode nbytes is just an
2011 * instructive value.
2013 if (!IS_ALIGNED(nbytes, root->fs_info->nodesize)) {
2014 warning("root %llu DIR INODE[%llu] nbytes should be aligned to %u",
2015 root->objectid, inode_id,
2016 root->fs_info->nodesize);
2019 if (isize != size) {
2021 ret = repair_dir_isize_lowmem(root, path,
2023 if (!repair || ret) {
2026 "root %llu DIR INODE [%llu] size %llu not equal to %llu",
2027 root->objectid, inode_id, isize, size);
2031 if (nlink != refs) {
2033 ret = repair_inode_nlinks_lowmem(root, path,
2034 inode_id, namebuf, name_len, refs,
2035 imode_to_type(mode), &nlink);
2036 if (!repair || ret) {
2037 err |= LINK_COUNT_ERROR;
2039 "root %llu INODE[%llu] nlink(%llu) not equal to inode_refs(%llu)",
2040 root->objectid, inode_id, nlink, refs);
2042 } else if (!nlink) {
2044 ret = repair_inode_orphan_item_lowmem(root,
2046 if (!repair || ret) {
2048 error("root %llu INODE[%llu] is orphan item",
2049 root->objectid, inode_id);
2053 if (!nbytes && !no_holes && extent_end < isize) {
2055 ret = punch_extent_hole(root, inode_id,
2056 extent_end, isize - extent_end);
2057 if (!repair || ret) {
2058 err |= NBYTES_ERROR;
2060 "root %llu INODE[%llu] size %llu should have a file extent hole",
2061 root->objectid, inode_id, isize);
2065 if (nbytes != extent_size) {
2067 ret = repair_inode_nbytes_lowmem(root, path,
2068 inode_id, extent_size);
2069 if (!repair || ret) {
2070 err |= NBYTES_ERROR;
2072 "root %llu INODE[%llu] nbytes %llu not equal to extent_size %llu",
2073 root->objectid, inode_id, nbytes,
2079 if (err & LAST_ITEM)
2080 btrfs_next_item(root, path);
2085 * Returns >0 Found error, not fatal, should continue
2086 * Returns <0 Fatal error, must exit the whole check
2087 * Returns 0 No errors found
2089 static int process_one_leaf(struct btrfs_root *root, struct btrfs_path *path,
2090 struct node_refs *nrefs, int *level, int ext_ref)
2092 struct extent_buffer *cur = path->nodes[0];
2093 struct btrfs_key key;
2097 int root_level = btrfs_header_level(root->node);
2099 int ret = 0; /* Final return value */
2100 int err = 0; /* Positive error bitmap */
2102 cur_bytenr = cur->start;
2104 /* skip to first inode item or the first inode number change */
2105 nritems = btrfs_header_nritems(cur);
2106 for (i = 0; i < nritems; i++) {
2107 btrfs_item_key_to_cpu(cur, &key, i);
2109 first_ino = key.objectid;
2110 if (key.type == BTRFS_INODE_ITEM_KEY ||
2111 (first_ino && first_ino != key.objectid))
2115 path->slots[0] = nritems;
2121 err |= check_inode_item(root, path, ext_ref);
2123 /* modify cur since check_inode_item may change path */
2124 cur = path->nodes[0];
2126 if (err & LAST_ITEM)
2129 /* still have inode items in thie leaf */
2130 if (cur->start == cur_bytenr)
2134 * we have switched to another leaf, above nodes may
2135 * have changed, here walk down the path, if a node
2136 * or leaf is shared, check whether we can skip this
2139 for (i = root_level; i >= 0; i--) {
2140 if (path->nodes[i]->start == nrefs->bytenr[i])
2143 ret = update_nodes_refs(root, path->nodes[i]->start,
2144 path->nodes[i], nrefs, i, 0);
2148 if (!nrefs->need_check[i]) {
2154 for (i = 0; i < *level; i++) {
2155 free_extent_buffer(path->nodes[i]);
2156 path->nodes[i] = NULL;
2166 * @level if @level == -1 means extent data item
2167 * else normal treeblocl.
2169 static int should_check_extent_strictly(struct btrfs_root *root,
2170 struct node_refs *nrefs, int level)
2172 int root_level = btrfs_header_level(root->node);
2174 if (level > root_level || level < -1)
2176 if (level == root_level)
2179 * if the upper node is marked full backref, it should contain shared
2180 * backref of the parent (except owner == root->objectid).
2182 while (++level <= root_level)
2183 if (nrefs->refs[level] > 1)
2189 static int check_extent_inline_ref(struct extent_buffer *eb,
2190 struct btrfs_key *key, struct btrfs_extent_inline_ref *iref)
2193 u8 type = btrfs_extent_inline_ref_type(eb, iref);
2196 case BTRFS_TREE_BLOCK_REF_KEY:
2197 case BTRFS_EXTENT_DATA_REF_KEY:
2198 case BTRFS_SHARED_BLOCK_REF_KEY:
2199 case BTRFS_SHARED_DATA_REF_KEY:
2203 error("extent[%llu %u %llu] has unknown ref type: %d",
2204 key->objectid, key->type, key->offset, type);
2213 * Check backrefs of a tree block given by @bytenr or @eb.
2215 * @root: the root containing the @bytenr or @eb
2216 * @eb: tree block extent buffer, can be NULL
2217 * @bytenr: bytenr of the tree block to search
2218 * @level: tree level of the tree block
2219 * @owner: owner of the tree block
2221 * Return >0 for any error found and output error message
2222 * Return 0 for no error found
2224 static int check_tree_block_ref(struct btrfs_root *root,
2225 struct extent_buffer *eb, u64 bytenr,
2226 int level, u64 owner, struct node_refs *nrefs)
2228 struct btrfs_key key;
2229 struct btrfs_root *extent_root = root->fs_info->extent_root;
2230 struct btrfs_path path;
2231 struct btrfs_extent_item *ei;
2232 struct btrfs_extent_inline_ref *iref;
2233 struct extent_buffer *leaf;
2238 int root_level = btrfs_header_level(root->node);
2240 u32 nodesize = root->fs_info->nodesize;
2249 btrfs_init_path(&path);
2250 key.objectid = bytenr;
2251 if (btrfs_fs_incompat(root->fs_info, SKINNY_METADATA))
2252 key.type = BTRFS_METADATA_ITEM_KEY;
2254 key.type = BTRFS_EXTENT_ITEM_KEY;
2255 key.offset = (u64)-1;
2257 /* Search for the backref in extent tree */
2258 ret = btrfs_search_slot(NULL, extent_root, &key, &path, 0, 0);
2260 err |= BACKREF_MISSING;
2263 ret = btrfs_previous_extent_item(extent_root, &path, bytenr);
2265 err |= BACKREF_MISSING;
2269 leaf = path.nodes[0];
2270 slot = path.slots[0];
2271 btrfs_item_key_to_cpu(leaf, &key, slot);
2273 ei = btrfs_item_ptr(leaf, slot, struct btrfs_extent_item);
2275 if (key.type == BTRFS_METADATA_ITEM_KEY) {
2276 skinny_level = (int)key.offset;
2277 iref = (struct btrfs_extent_inline_ref *)(ei + 1);
2279 struct btrfs_tree_block_info *info;
2281 info = (struct btrfs_tree_block_info *)(ei + 1);
2282 skinny_level = btrfs_tree_block_level(leaf, info);
2283 iref = (struct btrfs_extent_inline_ref *)(info + 1);
2292 * Due to the feature of shared tree blocks, if the upper node
2293 * is a fs root or shared node, the extent of checked node may
2294 * not be updated until the next CoW.
2297 strict = should_check_extent_strictly(root, nrefs,
2299 if (!(btrfs_extent_flags(leaf, ei) &
2300 BTRFS_EXTENT_FLAG_TREE_BLOCK)) {
2302 "extent[%llu %u] backref type mismatch, missing bit: %llx",
2303 key.objectid, nodesize,
2304 BTRFS_EXTENT_FLAG_TREE_BLOCK);
2305 err = BACKREF_MISMATCH;
2307 header_gen = btrfs_header_generation(eb);
2308 extent_gen = btrfs_extent_generation(leaf, ei);
2309 if (header_gen != extent_gen) {
2311 "extent[%llu %u] backref generation mismatch, wanted: %llu, have: %llu",
2312 key.objectid, nodesize, header_gen,
2314 err = BACKREF_MISMATCH;
2316 if (level != skinny_level) {
2318 "extent[%llu %u] level mismatch, wanted: %u, have: %u",
2319 key.objectid, nodesize, level, skinny_level);
2320 err = BACKREF_MISMATCH;
2322 if (!is_fstree(owner) && btrfs_extent_refs(leaf, ei) != 1) {
2324 "extent[%llu %u] is referred by other roots than %llu",
2325 key.objectid, nodesize, root->objectid);
2326 err = BACKREF_MISMATCH;
2331 * Iterate the extent/metadata item to find the exact backref
2333 item_size = btrfs_item_size_nr(leaf, slot);
2334 ptr = (unsigned long)iref;
2335 end = (unsigned long)ei + item_size;
2338 iref = (struct btrfs_extent_inline_ref *)ptr;
2339 type = btrfs_extent_inline_ref_type(leaf, iref);
2340 offset = btrfs_extent_inline_ref_offset(leaf, iref);
2342 ret = check_extent_inline_ref(leaf, &key, iref);
2347 if (type == BTRFS_TREE_BLOCK_REF_KEY) {
2348 if (offset == root->objectid)
2350 if (!strict && owner == offset)
2352 } else if (type == BTRFS_SHARED_BLOCK_REF_KEY) {
2354 * Backref of tree reloc root points to itself, no need
2355 * to check backref any more.
2357 * This may be an error of loop backref, but extent tree
2358 * checker should have already handled it.
2359 * Here we only need to avoid infinite iteration.
2361 if (offset == bytenr) {
2365 * Check if the backref points to valid
2368 found_ref = !check_tree_block_ref(root, NULL,
2369 offset, level + 1, owner, NULL);
2375 ptr += btrfs_extent_inline_ref_size(type);
2379 * Inlined extent item doesn't have what we need, check
2380 * TREE_BLOCK_REF_KEY
2383 btrfs_release_path(&path);
2384 key.objectid = bytenr;
2385 key.type = BTRFS_TREE_BLOCK_REF_KEY;
2386 key.offset = root->objectid;
2388 ret = btrfs_search_slot(NULL, extent_root, &key, &path, 0, 0);
2393 * Finally check SHARED BLOCK REF, any found will be good
2394 * Here we're not doing comprehensive extent backref checking,
2395 * only need to ensure there is some extent referring to this
2399 btrfs_release_path(&path);
2400 key.objectid = bytenr;
2401 key.type = BTRFS_SHARED_BLOCK_REF_KEY;
2402 key.offset = (u64)-1;
2404 ret = btrfs_search_slot(NULL, extent_root, &key, &path, 0, 0);
2406 err |= BACKREF_MISSING;
2409 ret = btrfs_previous_extent_item(extent_root, &path, bytenr);
2411 err |= BACKREF_MISSING;
2417 err |= BACKREF_MISSING;
2419 btrfs_release_path(&path);
2420 if (nrefs && strict &&
2421 level < root_level && nrefs->full_backref[level + 1])
2422 parent = nrefs->bytenr[level + 1];
2423 if (eb && (err & BACKREF_MISSING))
2425 "extent[%llu %u] backref lost (owner: %llu, level: %u) %s %llu",
2426 bytenr, nodesize, owner, level,
2427 parent ? "parent" : "root",
2428 parent ? parent : root->objectid);
2433 * If @err contains BACKREF_MISSING then add extent of the
2434 * file_extent_data_item.
2436 * Returns error bits after reapir.
2438 static int repair_extent_data_item(struct btrfs_trans_handle *trans,
2439 struct btrfs_root *root,
2440 struct btrfs_path *pathp,
2441 struct node_refs *nrefs,
2444 struct btrfs_file_extent_item *fi;
2445 struct btrfs_key fi_key;
2446 struct btrfs_key key;
2447 struct btrfs_extent_item *ei;
2448 struct btrfs_path path;
2449 struct btrfs_root *extent_root = root->fs_info->extent_root;
2450 struct extent_buffer *eb;
2462 eb = pathp->nodes[0];
2463 slot = pathp->slots[0];
2464 btrfs_item_key_to_cpu(eb, &fi_key, slot);
2465 fi = btrfs_item_ptr(eb, slot, struct btrfs_file_extent_item);
2467 if (btrfs_file_extent_type(eb, fi) == BTRFS_FILE_EXTENT_INLINE ||
2468 btrfs_file_extent_disk_bytenr(eb, fi) == 0)
2471 file_offset = fi_key.offset;
2472 generation = btrfs_file_extent_generation(eb, fi);
2473 disk_bytenr = btrfs_file_extent_disk_bytenr(eb, fi);
2474 num_bytes = btrfs_file_extent_disk_num_bytes(eb, fi);
2475 extent_offset = btrfs_file_extent_offset(eb, fi);
2476 offset = file_offset - extent_offset;
2478 /* now repair only adds backref */
2479 if ((err & BACKREF_MISSING) == 0)
2482 /* search extent item */
2483 key.objectid = disk_bytenr;
2484 key.type = BTRFS_EXTENT_ITEM_KEY;
2485 key.offset = num_bytes;
2487 btrfs_init_path(&path);
2488 ret = btrfs_search_slot(NULL, extent_root, &key, &path, 0, 0);
2494 /* insert an extent item */
2496 key.objectid = disk_bytenr;
2497 key.type = BTRFS_EXTENT_ITEM_KEY;
2498 key.offset = num_bytes;
2501 btrfs_release_path(&path);
2502 ret = btrfs_insert_empty_item(trans, extent_root, &path, &key,
2507 ei = btrfs_item_ptr(eb, path.slots[0], struct btrfs_extent_item);
2509 btrfs_set_extent_refs(eb, ei, 0);
2510 btrfs_set_extent_generation(eb, ei, generation);
2511 btrfs_set_extent_flags(eb, ei, BTRFS_EXTENT_FLAG_DATA);
2513 btrfs_mark_buffer_dirty(eb);
2514 ret = btrfs_update_block_group(extent_root, disk_bytenr,
2516 btrfs_release_path(&path);
2519 if (nrefs->full_backref[0])
2520 parent = btrfs_header_bytenr(eb);
2524 ret = btrfs_inc_extent_ref(trans, root, disk_bytenr, num_bytes, parent,
2526 parent ? BTRFS_FIRST_FREE_OBJECTID : fi_key.objectid,
2530 "failed to increase extent data backref[%llu %llu] root %llu",
2531 disk_bytenr, num_bytes, root->objectid);
2534 printf("Add one extent data backref [%llu %llu]\n",
2535 disk_bytenr, num_bytes);
2538 err &= ~BACKREF_MISSING;
2541 error("can't repair root %llu extent data item[%llu %llu]",
2542 root->objectid, disk_bytenr, num_bytes);
2547 * Check EXTENT_DATA item, mainly for its dbackref in extent tree
2549 * Return >0 any error found and output error message
2550 * Return 0 for no error found
2552 static int check_extent_data_item(struct btrfs_root *root,
2553 struct btrfs_path *pathp,
2554 struct node_refs *nrefs, int account_bytes)
2556 struct btrfs_file_extent_item *fi;
2557 struct extent_buffer *eb = pathp->nodes[0];
2558 struct btrfs_path path;
2559 struct btrfs_root *extent_root = root->fs_info->extent_root;
2560 struct btrfs_key fi_key;
2561 struct btrfs_key dbref_key;
2562 struct extent_buffer *leaf;
2563 struct btrfs_extent_item *ei;
2564 struct btrfs_extent_inline_ref *iref;
2565 struct btrfs_extent_data_ref *dref;
2569 u64 extent_num_bytes;
2576 int found_dbackref = 0;
2577 int slot = pathp->slots[0];
2582 btrfs_item_key_to_cpu(eb, &fi_key, slot);
2583 fi = btrfs_item_ptr(eb, slot, struct btrfs_file_extent_item);
2585 /* Nothing to check for hole and inline data extents */
2586 if (btrfs_file_extent_type(eb, fi) == BTRFS_FILE_EXTENT_INLINE ||
2587 btrfs_file_extent_disk_bytenr(eb, fi) == 0)
2590 disk_bytenr = btrfs_file_extent_disk_bytenr(eb, fi);
2591 disk_num_bytes = btrfs_file_extent_disk_num_bytes(eb, fi);
2592 extent_num_bytes = btrfs_file_extent_num_bytes(eb, fi);
2593 offset = btrfs_file_extent_offset(eb, fi);
2595 /* Check unaligned disk_num_bytes and num_bytes */
2596 if (!IS_ALIGNED(disk_num_bytes, root->fs_info->sectorsize)) {
2598 "file extent [%llu, %llu] has unaligned disk num bytes: %llu, should be aligned to %u",
2599 fi_key.objectid, fi_key.offset, disk_num_bytes,
2600 root->fs_info->sectorsize);
2601 err |= BYTES_UNALIGNED;
2602 } else if (account_bytes) {
2603 data_bytes_allocated += disk_num_bytes;
2605 if (!IS_ALIGNED(extent_num_bytes, root->fs_info->sectorsize)) {
2607 "file extent [%llu, %llu] has unaligned num bytes: %llu, should be aligned to %u",
2608 fi_key.objectid, fi_key.offset, extent_num_bytes,
2609 root->fs_info->sectorsize);
2610 err |= BYTES_UNALIGNED;
2611 } else if (account_bytes) {
2612 data_bytes_referenced += extent_num_bytes;
2614 owner = btrfs_header_owner(eb);
2616 /* Check the extent item of the file extent in extent tree */
2617 btrfs_init_path(&path);
2618 dbref_key.objectid = btrfs_file_extent_disk_bytenr(eb, fi);
2619 dbref_key.type = BTRFS_EXTENT_ITEM_KEY;
2620 dbref_key.offset = btrfs_file_extent_disk_num_bytes(eb, fi);
2622 ret = btrfs_search_slot(NULL, extent_root, &dbref_key, &path, 0, 0);
2626 leaf = path.nodes[0];
2627 slot = path.slots[0];
2628 ei = btrfs_item_ptr(leaf, slot, struct btrfs_extent_item);
2630 extent_flags = btrfs_extent_flags(leaf, ei);
2632 if (!(extent_flags & BTRFS_EXTENT_FLAG_DATA)) {
2634 "extent[%llu %llu] backref type mismatch, wanted bit: %llx",
2635 disk_bytenr, disk_num_bytes,
2636 BTRFS_EXTENT_FLAG_DATA);
2637 err |= BACKREF_MISMATCH;
2640 /* Check data backref inside that extent item */
2641 item_size = btrfs_item_size_nr(leaf, path.slots[0]);
2642 iref = (struct btrfs_extent_inline_ref *)(ei + 1);
2643 ptr = (unsigned long)iref;
2644 end = (unsigned long)ei + item_size;
2645 strict = should_check_extent_strictly(root, nrefs, -1);
2653 iref = (struct btrfs_extent_inline_ref *)ptr;
2654 type = btrfs_extent_inline_ref_type(leaf, iref);
2655 dref = (struct btrfs_extent_data_ref *)(&iref->offset);
2657 ret = check_extent_inline_ref(leaf, &dbref_key, iref);
2662 if (type == BTRFS_EXTENT_DATA_REF_KEY) {
2663 ref_root = btrfs_extent_data_ref_root(leaf, dref);
2664 ref_objectid = btrfs_extent_data_ref_objectid(leaf,
2666 ref_offset = btrfs_extent_data_ref_offset(leaf, dref);
2668 if (ref_objectid == fi_key.objectid &&
2669 ref_offset == fi_key.offset - offset)
2671 if (ref_root == root->objectid && match)
2673 else if (!strict && owner == ref_root && match)
2675 } else if (type == BTRFS_SHARED_DATA_REF_KEY) {
2676 found_dbackref = !check_tree_block_ref(root, NULL,
2677 btrfs_extent_inline_ref_offset(leaf, iref),
2683 ptr += btrfs_extent_inline_ref_size(type);
2686 if (!found_dbackref) {
2687 btrfs_release_path(&path);
2689 /* Didn't find inlined data backref, try EXTENT_DATA_REF_KEY */
2690 dbref_key.objectid = btrfs_file_extent_disk_bytenr(eb, fi);
2691 dbref_key.type = BTRFS_EXTENT_DATA_REF_KEY;
2692 dbref_key.offset = hash_extent_data_ref(root->objectid,
2693 fi_key.objectid, fi_key.offset - offset);
2695 ret = btrfs_search_slot(NULL, root->fs_info->extent_root,
2696 &dbref_key, &path, 0, 0);
2702 btrfs_release_path(&path);
2705 * Neither inlined nor EXTENT_DATA_REF found, try
2706 * SHARED_DATA_REF as last chance.
2708 dbref_key.objectid = disk_bytenr;
2709 dbref_key.type = BTRFS_SHARED_DATA_REF_KEY;
2710 dbref_key.offset = eb->start;
2712 ret = btrfs_search_slot(NULL, root->fs_info->extent_root,
2713 &dbref_key, &path, 0, 0);
2721 if (!found_dbackref)
2722 err |= BACKREF_MISSING;
2723 btrfs_release_path(&path);
2724 if (err & BACKREF_MISSING) {
2725 error("data extent[%llu %llu] backref lost",
2726 disk_bytenr, disk_num_bytes);
2732 * Check a block group item with its referener (chunk) and its used space
2733 * with extent/metadata item
2735 static int check_block_group_item(struct btrfs_fs_info *fs_info,
2736 struct extent_buffer *eb, int slot)
2738 struct btrfs_root *extent_root = fs_info->extent_root;
2739 struct btrfs_root *chunk_root = fs_info->chunk_root;
2740 struct btrfs_block_group_item *bi;
2741 struct btrfs_block_group_item bg_item;
2742 struct btrfs_path path;
2743 struct btrfs_key bg_key;
2744 struct btrfs_key chunk_key;
2745 struct btrfs_key extent_key;
2746 struct btrfs_chunk *chunk;
2747 struct extent_buffer *leaf;
2748 struct btrfs_extent_item *ei;
2749 u32 nodesize = btrfs_super_nodesize(fs_info->super_copy);
2757 btrfs_item_key_to_cpu(eb, &bg_key, slot);
2758 bi = btrfs_item_ptr(eb, slot, struct btrfs_block_group_item);
2759 read_extent_buffer(eb, &bg_item, (unsigned long)bi, sizeof(bg_item));
2760 used = btrfs_block_group_used(&bg_item);
2761 bg_flags = btrfs_block_group_flags(&bg_item);
2763 chunk_key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID;
2764 chunk_key.type = BTRFS_CHUNK_ITEM_KEY;
2765 chunk_key.offset = bg_key.objectid;
2767 btrfs_init_path(&path);
2768 /* Search for the referencer chunk */
2769 ret = btrfs_search_slot(NULL, chunk_root, &chunk_key, &path, 0, 0);
2772 "block group[%llu %llu] did not find the related chunk item",
2773 bg_key.objectid, bg_key.offset);
2774 err |= REFERENCER_MISSING;
2776 chunk = btrfs_item_ptr(path.nodes[0], path.slots[0],
2777 struct btrfs_chunk);
2778 if (btrfs_chunk_length(path.nodes[0], chunk) !=
2781 "block group[%llu %llu] related chunk item length does not match",
2782 bg_key.objectid, bg_key.offset);
2783 err |= REFERENCER_MISMATCH;
2786 btrfs_release_path(&path);
2788 /* Search from the block group bytenr */
2789 extent_key.objectid = bg_key.objectid;
2790 extent_key.type = 0;
2791 extent_key.offset = 0;
2793 btrfs_init_path(&path);
2794 ret = btrfs_search_slot(NULL, extent_root, &extent_key, &path, 0, 0);
2798 /* Iterate extent tree to account used space */
2800 leaf = path.nodes[0];
2802 /* Search slot can point to the last item beyond leaf nritems */
2803 if (path.slots[0] >= btrfs_header_nritems(leaf))
2806 btrfs_item_key_to_cpu(leaf, &extent_key, path.slots[0]);
2807 if (extent_key.objectid >= bg_key.objectid + bg_key.offset)
2810 if (extent_key.type != BTRFS_METADATA_ITEM_KEY &&
2811 extent_key.type != BTRFS_EXTENT_ITEM_KEY)
2813 if (extent_key.objectid < bg_key.objectid)
2816 if (extent_key.type == BTRFS_METADATA_ITEM_KEY)
2819 total += extent_key.offset;
2821 ei = btrfs_item_ptr(leaf, path.slots[0],
2822 struct btrfs_extent_item);
2823 flags = btrfs_extent_flags(leaf, ei);
2824 if (flags & BTRFS_EXTENT_FLAG_DATA) {
2825 if (!(bg_flags & BTRFS_BLOCK_GROUP_DATA)) {
2827 "bad extent[%llu, %llu) type mismatch with chunk",
2828 extent_key.objectid,
2829 extent_key.objectid + extent_key.offset);
2830 err |= CHUNK_TYPE_MISMATCH;
2832 } else if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) {
2833 if (!(bg_flags & (BTRFS_BLOCK_GROUP_SYSTEM |
2834 BTRFS_BLOCK_GROUP_METADATA))) {
2836 "bad extent[%llu, %llu) type mismatch with chunk",
2837 extent_key.objectid,
2838 extent_key.objectid + nodesize);
2839 err |= CHUNK_TYPE_MISMATCH;
2843 ret = btrfs_next_item(extent_root, &path);
2849 btrfs_release_path(&path);
2851 if (total != used) {
2853 "block group[%llu %llu] used %llu but extent items used %llu",
2854 bg_key.objectid, bg_key.offset, used, total);
2855 err |= BG_ACCOUNTING_ERROR;
2861 * Get real tree block level for the case like shared block
2862 * Return >= 0 as tree level
2863 * Return <0 for error
2865 static int query_tree_block_level(struct btrfs_fs_info *fs_info, u64 bytenr)
2867 struct extent_buffer *eb;
2868 struct btrfs_path path;
2869 struct btrfs_key key;
2870 struct btrfs_extent_item *ei;
2877 /* Search extent tree for extent generation and level */
2878 key.objectid = bytenr;
2879 key.type = BTRFS_METADATA_ITEM_KEY;
2880 key.offset = (u64)-1;
2882 btrfs_init_path(&path);
2883 ret = btrfs_search_slot(NULL, fs_info->extent_root, &key, &path, 0, 0);
2886 ret = btrfs_previous_extent_item(fs_info->extent_root, &path, bytenr);
2894 btrfs_item_key_to_cpu(path.nodes[0], &key, path.slots[0]);
2895 ei = btrfs_item_ptr(path.nodes[0], path.slots[0],
2896 struct btrfs_extent_item);
2897 flags = btrfs_extent_flags(path.nodes[0], ei);
2898 if (!(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) {
2903 /* Get transid for later read_tree_block() check */
2904 transid = btrfs_extent_generation(path.nodes[0], ei);
2906 /* Get backref level as one source */
2907 if (key.type == BTRFS_METADATA_ITEM_KEY) {
2908 backref_level = key.offset;
2910 struct btrfs_tree_block_info *info;
2912 info = (struct btrfs_tree_block_info *)(ei + 1);
2913 backref_level = btrfs_tree_block_level(path.nodes[0], info);
2915 btrfs_release_path(&path);
2917 /* Get level from tree block as an alternative source */
2918 eb = read_tree_block(fs_info, bytenr, transid);
2919 if (!extent_buffer_uptodate(eb)) {
2920 free_extent_buffer(eb);
2923 header_level = btrfs_header_level(eb);
2924 free_extent_buffer(eb);
2926 if (header_level != backref_level)
2928 return header_level;
2931 btrfs_release_path(&path);
2936 * Check if a tree block backref is valid (points to a valid tree block)
2937 * if level == -1, level will be resolved
2938 * Return >0 for any error found and print error message
2940 static int check_tree_block_backref(struct btrfs_fs_info *fs_info, u64 root_id,
2941 u64 bytenr, int level)
2943 struct btrfs_root *root;
2944 struct btrfs_key key;
2945 struct btrfs_path path;
2946 struct extent_buffer *eb;
2947 struct extent_buffer *node;
2948 u32 nodesize = btrfs_super_nodesize(fs_info->super_copy);
2952 /* Query level for level == -1 special case */
2954 level = query_tree_block_level(fs_info, bytenr);
2956 err |= REFERENCER_MISSING;
2960 key.objectid = root_id;
2961 key.type = BTRFS_ROOT_ITEM_KEY;
2962 key.offset = (u64)-1;
2964 root = btrfs_read_fs_root(fs_info, &key);
2966 err |= REFERENCER_MISSING;
2970 /* Read out the tree block to get item/node key */
2971 eb = read_tree_block(fs_info, bytenr, 0);
2972 if (!extent_buffer_uptodate(eb)) {
2973 err |= REFERENCER_MISSING;
2974 free_extent_buffer(eb);
2978 /* Empty tree, no need to check key */
2979 if (!btrfs_header_nritems(eb) && !level) {
2980 free_extent_buffer(eb);
2985 btrfs_node_key_to_cpu(eb, &key, 0);
2987 btrfs_item_key_to_cpu(eb, &key, 0);
2989 free_extent_buffer(eb);
2991 btrfs_init_path(&path);
2992 path.lowest_level = level;
2993 /* Search with the first key, to ensure we can reach it */
2994 ret = btrfs_search_slot(NULL, root, &key, &path, 0, 0);
2996 err |= REFERENCER_MISSING;
3000 node = path.nodes[level];
3001 if (btrfs_header_bytenr(node) != bytenr) {
3003 "extent [%llu %d] referencer bytenr mismatch, wanted: %llu, have: %llu",
3004 bytenr, nodesize, bytenr,
3005 btrfs_header_bytenr(node));
3006 err |= REFERENCER_MISMATCH;
3008 if (btrfs_header_level(node) != level) {
3010 "extent [%llu %d] referencer level mismatch, wanted: %d, have: %d",
3011 bytenr, nodesize, level,
3012 btrfs_header_level(node));
3013 err |= REFERENCER_MISMATCH;
3017 btrfs_release_path(&path);
3019 if (err & REFERENCER_MISSING) {
3021 error("extent [%llu %d] lost referencer (owner: %llu)",
3022 bytenr, nodesize, root_id);
3025 "extent [%llu %d] lost referencer (owner: %llu, level: %u)",
3026 bytenr, nodesize, root_id, level);
3033 * Check if tree block @eb is tree reloc root.
3034 * Return 0 if it's not or any problem happens
3035 * Return 1 if it's a tree reloc root
3037 static int is_tree_reloc_root(struct btrfs_fs_info *fs_info,
3038 struct extent_buffer *eb)
3040 struct btrfs_root *tree_reloc_root;
3041 struct btrfs_key key;
3042 u64 bytenr = btrfs_header_bytenr(eb);
3043 u64 owner = btrfs_header_owner(eb);
3046 key.objectid = BTRFS_TREE_RELOC_OBJECTID;
3048 key.type = BTRFS_ROOT_ITEM_KEY;
3050 tree_reloc_root = btrfs_read_fs_root_no_cache(fs_info, &key);
3051 if (IS_ERR(tree_reloc_root))
3054 if (bytenr == btrfs_header_bytenr(tree_reloc_root->node))
3056 btrfs_free_fs_root(tree_reloc_root);
3061 * Check referencer for shared block backref
3062 * If level == -1, this function will resolve the level.
3064 static int check_shared_block_backref(struct btrfs_fs_info *fs_info,
3065 u64 parent, u64 bytenr, int level)
3067 struct extent_buffer *eb;
3069 int found_parent = 0;
3072 eb = read_tree_block(fs_info, parent, 0);
3073 if (!extent_buffer_uptodate(eb))
3077 level = query_tree_block_level(fs_info, bytenr);
3081 /* It's possible it's a tree reloc root */
3082 if (parent == bytenr) {
3083 if (is_tree_reloc_root(fs_info, eb))
3088 if (level + 1 != btrfs_header_level(eb))
3091 nr = btrfs_header_nritems(eb);
3092 for (i = 0; i < nr; i++) {
3093 if (bytenr == btrfs_node_blockptr(eb, i)) {
3099 free_extent_buffer(eb);
3100 if (!found_parent) {
3102 "shared extent[%llu %u] lost its parent (parent: %llu, level: %u)",
3103 bytenr, fs_info->nodesize, parent, level);
3104 return REFERENCER_MISSING;
3110 * Check referencer for normal (inlined) data ref
3111 * If len == 0, it will be resolved by searching in extent tree
3113 static int check_extent_data_backref(struct btrfs_fs_info *fs_info,
3114 u64 root_id, u64 objectid, u64 offset,
3115 u64 bytenr, u64 len, u32 count)
3117 struct btrfs_root *root;
3118 struct btrfs_root *extent_root = fs_info->extent_root;
3119 struct btrfs_key key;
3120 struct btrfs_path path;
3121 struct extent_buffer *leaf;
3122 struct btrfs_file_extent_item *fi;
3123 u32 found_count = 0;
3128 key.objectid = bytenr;
3129 key.type = BTRFS_EXTENT_ITEM_KEY;
3130 key.offset = (u64)-1;
3132 btrfs_init_path(&path);
3133 ret = btrfs_search_slot(NULL, extent_root, &key, &path, 0, 0);
3136 ret = btrfs_previous_extent_item(extent_root, &path, bytenr);
3139 btrfs_item_key_to_cpu(path.nodes[0], &key, path.slots[0]);
3140 if (key.objectid != bytenr ||
3141 key.type != BTRFS_EXTENT_ITEM_KEY)
3144 btrfs_release_path(&path);
3146 key.objectid = root_id;
3147 key.type = BTRFS_ROOT_ITEM_KEY;
3148 key.offset = (u64)-1;
3149 btrfs_init_path(&path);
3151 root = btrfs_read_fs_root(fs_info, &key);
3155 key.objectid = objectid;
3156 key.type = BTRFS_EXTENT_DATA_KEY;
3158 * It can be nasty as data backref offset is
3159 * file offset - file extent offset, which is smaller or
3160 * equal to original backref offset. The only special case is
3161 * overflow. So we need to special check and do further search.
3163 key.offset = offset & (1ULL << 63) ? 0 : offset;
3165 ret = btrfs_search_slot(NULL, root, &key, &path, 0, 0);
3170 * Search afterwards to get correct one
3171 * NOTE: As we must do a comprehensive check on the data backref to
3172 * make sure the dref count also matches, we must iterate all file
3173 * extents for that inode.
3176 leaf = path.nodes[0];
3177 slot = path.slots[0];
3179 if (slot >= btrfs_header_nritems(leaf) ||
3180 btrfs_header_owner(leaf) != root_id)
3182 btrfs_item_key_to_cpu(leaf, &key, slot);
3183 if (key.objectid != objectid ||
3184 key.type != BTRFS_EXTENT_DATA_KEY)
3186 fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item);
3188 * Except normal disk bytenr and disk num bytes, we still
3189 * need to do extra check on dbackref offset as
3190 * dbackref offset = file_offset - file_extent_offset
3192 * Also, we must check the leaf owner.
3193 * In case of shared tree blocks (snapshots) we can inherit
3194 * leaves from source snapshot.
3195 * In that case, reference from source snapshot should not
3198 if (btrfs_file_extent_disk_bytenr(leaf, fi) == bytenr &&
3199 btrfs_file_extent_disk_num_bytes(leaf, fi) == len &&
3200 (u64)(key.offset - btrfs_file_extent_offset(leaf, fi)) ==
3201 offset && btrfs_header_owner(leaf) == root_id)
3205 ret = btrfs_next_item(root, &path);
3210 btrfs_release_path(&path);
3211 if (found_count != count) {
3213 "extent[%llu, %llu] referencer count mismatch (root: %llu, owner: %llu, offset: %llu) wanted: %u, have: %u",
3214 bytenr, len, root_id, objectid, offset, count,
3216 return REFERENCER_MISSING;
3222 * Check if the referencer of a shared data backref exists
3224 static int check_shared_data_backref(struct btrfs_fs_info *fs_info,
3225 u64 parent, u64 bytenr)
3227 struct extent_buffer *eb;
3228 struct btrfs_key key;
3229 struct btrfs_file_extent_item *fi;
3231 int found_parent = 0;
3234 eb = read_tree_block(fs_info, parent, 0);
3235 if (!extent_buffer_uptodate(eb))
3238 nr = btrfs_header_nritems(eb);
3239 for (i = 0; i < nr; i++) {
3240 btrfs_item_key_to_cpu(eb, &key, i);
3241 if (key.type != BTRFS_EXTENT_DATA_KEY)
3244 fi = btrfs_item_ptr(eb, i, struct btrfs_file_extent_item);
3245 if (btrfs_file_extent_type(eb, fi) == BTRFS_FILE_EXTENT_INLINE)
3248 if (btrfs_file_extent_disk_bytenr(eb, fi) == bytenr) {
3255 free_extent_buffer(eb);
3256 if (!found_parent) {
3257 error("shared extent %llu referencer lost (parent: %llu)",
3259 return REFERENCER_MISSING;
3265 * Only delete backref if REFERENCER_MISSING now
3267 * Returns <0 the extent was deleted
3268 * Returns >0 the backref was deleted but extent still exists, returned value
3269 * means error after repair
3270 * Returns 0 nothing happened
3272 static int repair_extent_item(struct btrfs_trans_handle *trans,
3273 struct btrfs_root *root, struct btrfs_path *path,
3274 u64 bytenr, u64 num_bytes, u64 parent, u64 root_objectid,
3275 u64 owner, u64 offset, int err)
3277 struct btrfs_key old_key;
3281 btrfs_item_key_to_cpu(path->nodes[0], &old_key, path->slots[0]);
3283 if (err & (REFERENCER_MISSING | REFERENCER_MISMATCH)) {
3284 /* delete the backref */
3285 ret = btrfs_free_extent(trans, root->fs_info->fs_root, bytenr,
3286 num_bytes, parent, root_objectid, owner, offset);
3289 err &= ~REFERENCER_MISSING;
3290 printf("Delete backref in extent [%llu %llu]\n",
3293 error("fail to delete backref in extent [%llu %llu]",
3298 /* btrfs_free_extent may delete the extent */
3299 btrfs_release_path(path);
3300 ret = btrfs_search_slot(NULL, root, &old_key, path, 0, 0);
3310 * This function will check a given extent item, including its backref and
3311 * itself (like crossing stripe boundary and type)
3313 * Since we don't use extent_record anymore, introduce new error bit
3315 static int check_extent_item(struct btrfs_trans_handle *trans,
3316 struct btrfs_fs_info *fs_info,
3317 struct btrfs_path *path)
3319 struct btrfs_extent_item *ei;
3320 struct btrfs_extent_inline_ref *iref;
3321 struct btrfs_extent_data_ref *dref;
3322 struct extent_buffer *eb = path->nodes[0];
3325 int slot = path->slots[0];
3327 u32 nodesize = btrfs_super_nodesize(fs_info->super_copy);
3328 u32 item_size = btrfs_item_size_nr(eb, slot);
3338 struct btrfs_key key;
3342 btrfs_item_key_to_cpu(eb, &key, slot);
3343 if (key.type == BTRFS_EXTENT_ITEM_KEY) {
3344 bytes_used += key.offset;
3345 num_bytes = key.offset;
3347 bytes_used += nodesize;
3348 num_bytes = nodesize;
3351 if (item_size < sizeof(*ei)) {
3353 * COMPAT_EXTENT_TREE_V0 case, but it's already a super
3354 * old thing when on disk format is still un-determined.
3355 * No need to care about it anymore
3357 error("unsupported COMPAT_EXTENT_TREE_V0 detected");
3361 ei = btrfs_item_ptr(eb, slot, struct btrfs_extent_item);
3362 flags = btrfs_extent_flags(eb, ei);
3364 if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)
3366 if (metadata && check_crossing_stripes(global_info, key.objectid,
3368 error("bad metadata [%llu, %llu) crossing stripe boundary",
3369 key.objectid, key.objectid + nodesize);
3370 err |= CROSSING_STRIPE_BOUNDARY;
3373 ptr = (unsigned long)(ei + 1);
3375 if (metadata && key.type == BTRFS_EXTENT_ITEM_KEY) {
3376 /* Old EXTENT_ITEM metadata */
3377 struct btrfs_tree_block_info *info;
3379 info = (struct btrfs_tree_block_info *)ptr;
3380 level = btrfs_tree_block_level(eb, info);
3381 ptr += sizeof(struct btrfs_tree_block_info);
3383 /* New METADATA_ITEM */
3386 end = (unsigned long)ei + item_size;
3389 /* Reached extent item end normally */
3393 /* Beyond extent item end, wrong item size */
3395 err |= ITEM_SIZE_MISMATCH;
3396 error("extent item at bytenr %llu slot %d has wrong size",
3405 /* Now check every backref in this extent item */
3406 iref = (struct btrfs_extent_inline_ref *)ptr;
3407 type = btrfs_extent_inline_ref_type(eb, iref);
3408 offset = btrfs_extent_inline_ref_offset(eb, iref);
3410 case BTRFS_TREE_BLOCK_REF_KEY:
3411 root_objectid = offset;
3413 ret = check_tree_block_backref(fs_info, offset, key.objectid,
3417 case BTRFS_SHARED_BLOCK_REF_KEY:
3419 ret = check_shared_block_backref(fs_info, offset, key.objectid,
3423 case BTRFS_EXTENT_DATA_REF_KEY:
3424 dref = (struct btrfs_extent_data_ref *)(&iref->offset);
3425 root_objectid = btrfs_extent_data_ref_root(eb, dref);
3426 owner = btrfs_extent_data_ref_objectid(eb, dref);
3427 owner_offset = btrfs_extent_data_ref_offset(eb, dref);
3428 ret = check_extent_data_backref(fs_info, root_objectid, owner,
3429 owner_offset, key.objectid, key.offset,
3430 btrfs_extent_data_ref_count(eb, dref));
3433 case BTRFS_SHARED_DATA_REF_KEY:
3435 ret = check_shared_data_backref(fs_info, offset, key.objectid);
3439 error("extent[%llu %d %llu] has unknown ref type: %d",
3440 key.objectid, key.type, key.offset, type);
3446 if (err && repair) {
3447 ret = repair_extent_item(trans, fs_info->extent_root, path,
3448 key.objectid, num_bytes, parent, root_objectid,
3449 owner, owner_offset, ret);
3458 ptr += btrfs_extent_inline_ref_size(type);
3466 * Check if a dev extent item is referred correctly by its chunk
3468 static int check_dev_extent_item(struct btrfs_fs_info *fs_info,
3469 struct extent_buffer *eb, int slot)
3471 struct btrfs_root *chunk_root = fs_info->chunk_root;
3472 struct btrfs_dev_extent *ptr;
3473 struct btrfs_path path;
3474 struct btrfs_key chunk_key;
3475 struct btrfs_key devext_key;
3476 struct btrfs_chunk *chunk;
3477 struct extent_buffer *l;
3481 int found_chunk = 0;
3484 btrfs_item_key_to_cpu(eb, &devext_key, slot);
3485 ptr = btrfs_item_ptr(eb, slot, struct btrfs_dev_extent);
3486 length = btrfs_dev_extent_length(eb, ptr);
3488 chunk_key.objectid = btrfs_dev_extent_chunk_objectid(eb, ptr);
3489 chunk_key.type = BTRFS_CHUNK_ITEM_KEY;
3490 chunk_key.offset = btrfs_dev_extent_chunk_offset(eb, ptr);
3492 btrfs_init_path(&path);
3493 ret = btrfs_search_slot(NULL, chunk_root, &chunk_key, &path, 0, 0);
3498 chunk = btrfs_item_ptr(l, path.slots[0], struct btrfs_chunk);
3499 ret = btrfs_check_chunk_valid(fs_info, l, chunk, path.slots[0],
3504 if (btrfs_stripe_length(fs_info, l, chunk) != length)
3507 num_stripes = btrfs_chunk_num_stripes(l, chunk);
3508 for (i = 0; i < num_stripes; i++) {
3509 u64 devid = btrfs_stripe_devid_nr(l, chunk, i);
3510 u64 offset = btrfs_stripe_offset_nr(l, chunk, i);
3512 if (devid == devext_key.objectid &&
3513 offset == devext_key.offset) {
3519 btrfs_release_path(&path);
3522 "device extent[%llu, %llu, %llu] did not find the related chunk",
3523 devext_key.objectid, devext_key.offset, length);
3524 return REFERENCER_MISSING;
3530 * Check if the used space is correct with the dev item
3532 static int check_dev_item(struct btrfs_fs_info *fs_info,
3533 struct extent_buffer *eb, int slot)
3535 struct btrfs_root *dev_root = fs_info->dev_root;
3536 struct btrfs_dev_item *dev_item;
3537 struct btrfs_path path;
3538 struct btrfs_key key;
3539 struct btrfs_dev_extent *ptr;
3546 dev_item = btrfs_item_ptr(eb, slot, struct btrfs_dev_item);
3547 dev_id = btrfs_device_id(eb, dev_item);
3548 used = btrfs_device_bytes_used(eb, dev_item);
3549 total_bytes = btrfs_device_total_bytes(eb, dev_item);
3551 key.objectid = dev_id;
3552 key.type = BTRFS_DEV_EXTENT_KEY;
3555 btrfs_init_path(&path);
3556 ret = btrfs_search_slot(NULL, dev_root, &key, &path, 0, 0);
3558 btrfs_item_key_to_cpu(eb, &key, slot);
3559 error("cannot find any related dev extent for dev[%llu, %u, %llu]",
3560 key.objectid, key.type, key.offset);
3561 btrfs_release_path(&path);
3562 return REFERENCER_MISSING;
3565 /* Iterate dev_extents to calculate the used space of a device */
3567 if (path.slots[0] >= btrfs_header_nritems(path.nodes[0]))
3570 btrfs_item_key_to_cpu(path.nodes[0], &key, path.slots[0]);
3571 if (key.objectid > dev_id)
3573 if (key.type != BTRFS_DEV_EXTENT_KEY || key.objectid != dev_id)
3576 ptr = btrfs_item_ptr(path.nodes[0], path.slots[0],
3577 struct btrfs_dev_extent);
3578 total += btrfs_dev_extent_length(path.nodes[0], ptr);
3580 ret = btrfs_next_item(dev_root, &path);
3584 btrfs_release_path(&path);
3586 if (used != total) {
3587 btrfs_item_key_to_cpu(eb, &key, slot);
3589 "Dev extent's total-byte %llu is not equal to bytes-used %llu in dev[%llu, %u, %llu]",
3590 total, used, BTRFS_ROOT_TREE_OBJECTID,
3591 BTRFS_DEV_EXTENT_KEY, dev_id);
3592 return ACCOUNTING_MISMATCH;
3594 check_dev_size_alignment(dev_id, total_bytes, fs_info->sectorsize);
3600 * Check a chunk item.
3601 * Including checking all referred dev_extents and block group
3603 static int check_chunk_item(struct btrfs_fs_info *fs_info,
3604 struct extent_buffer *eb, int slot)
3606 struct btrfs_root *extent_root = fs_info->extent_root;
3607 struct btrfs_root *dev_root = fs_info->dev_root;
3608 struct btrfs_path path;
3609 struct btrfs_key chunk_key;
3610 struct btrfs_key bg_key;
3611 struct btrfs_key devext_key;
3612 struct btrfs_chunk *chunk;
3613 struct extent_buffer *leaf;
3614 struct btrfs_block_group_item *bi;
3615 struct btrfs_block_group_item bg_item;
3616 struct btrfs_dev_extent *ptr;
3628 btrfs_item_key_to_cpu(eb, &chunk_key, slot);
3629 chunk = btrfs_item_ptr(eb, slot, struct btrfs_chunk);
3630 length = btrfs_chunk_length(eb, chunk);
3631 chunk_end = chunk_key.offset + length;
3632 ret = btrfs_check_chunk_valid(fs_info, eb, chunk, slot,
3635 error("chunk[%llu %llu) is invalid", chunk_key.offset,
3637 err |= BYTES_UNALIGNED | UNKNOWN_TYPE;
3640 type = btrfs_chunk_type(eb, chunk);
3642 bg_key.objectid = chunk_key.offset;
3643 bg_key.type = BTRFS_BLOCK_GROUP_ITEM_KEY;
3644 bg_key.offset = length;
3646 btrfs_init_path(&path);
3647 ret = btrfs_search_slot(NULL, extent_root, &bg_key, &path, 0, 0);
3650 "chunk[%llu %llu) did not find the related block group item",
3651 chunk_key.offset, chunk_end);
3652 err |= REFERENCER_MISSING;
3654 leaf = path.nodes[0];
3655 bi = btrfs_item_ptr(leaf, path.slots[0],
3656 struct btrfs_block_group_item);
3657 read_extent_buffer(leaf, &bg_item, (unsigned long)bi,
3659 if (btrfs_block_group_flags(&bg_item) != type) {
3661 "chunk[%llu %llu) related block group item flags mismatch, wanted: %llu, have: %llu",
3662 chunk_key.offset, chunk_end, type,
3663 btrfs_block_group_flags(&bg_item));
3664 err |= REFERENCER_MISSING;
3668 num_stripes = btrfs_chunk_num_stripes(eb, chunk);
3669 stripe_len = btrfs_stripe_length(fs_info, eb, chunk);
3670 for (i = 0; i < num_stripes; i++) {
3671 btrfs_release_path(&path);
3672 btrfs_init_path(&path);
3673 devext_key.objectid = btrfs_stripe_devid_nr(eb, chunk, i);
3674 devext_key.type = BTRFS_DEV_EXTENT_KEY;
3675 devext_key.offset = btrfs_stripe_offset_nr(eb, chunk, i);
3677 ret = btrfs_search_slot(NULL, dev_root, &devext_key, &path,
3682 leaf = path.nodes[0];
3683 ptr = btrfs_item_ptr(leaf, path.slots[0],
3684 struct btrfs_dev_extent);
3685 objectid = btrfs_dev_extent_chunk_objectid(leaf, ptr);
3686 offset = btrfs_dev_extent_chunk_offset(leaf, ptr);
3687 if (objectid != chunk_key.objectid ||
3688 offset != chunk_key.offset ||
3689 btrfs_dev_extent_length(leaf, ptr) != stripe_len)
3693 err |= BACKREF_MISSING;
3695 "chunk[%llu %llu) stripe %d did not find the related dev extent",
3696 chunk_key.objectid, chunk_end, i);
3699 btrfs_release_path(&path);
3705 * Add block group item to the extent tree if @err contains REFERENCER_MISSING.
3706 * FIXME: We still need to repair error of dev_item.
3708 * Returns error after repair.
3710 static int repair_chunk_item(struct btrfs_trans_handle *trans,
3711 struct btrfs_root *chunk_root,
3712 struct btrfs_path *path, int err)
3714 struct btrfs_chunk *chunk;
3715 struct btrfs_key chunk_key;
3716 struct extent_buffer *eb = path->nodes[0];
3718 int slot = path->slots[0];
3722 btrfs_item_key_to_cpu(eb, &chunk_key, slot);
3723 if (chunk_key.type != BTRFS_CHUNK_ITEM_KEY)
3725 chunk = btrfs_item_ptr(eb, slot, struct btrfs_chunk);
3726 type = btrfs_chunk_type(path->nodes[0], chunk);
3727 length = btrfs_chunk_length(eb, chunk);
3729 if (err & REFERENCER_MISSING) {
3730 ret = btrfs_make_block_group(trans, chunk_root->fs_info, 0,
3731 type, chunk_key.offset, length);
3733 error("fail to add block group item[%llu %llu]",
3734 chunk_key.offset, length);
3737 err &= ~REFERENCER_MISSING;
3738 printf("Added block group item[%llu %llu]\n",
3739 chunk_key.offset, length);
3747 static int delete_extent_tree_item(struct btrfs_trans_handle *trans,
3748 struct btrfs_root *root,
3749 struct btrfs_path *path)
3751 struct btrfs_key key;
3754 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
3755 btrfs_release_path(path);
3756 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
3762 ret = btrfs_del_item(trans, root, path);
3766 if (path->slots[0] == 0)
3767 btrfs_prev_leaf(root, path);
3772 error("failed to delete root %llu item[%llu, %u, %llu]",
3773 root->objectid, key.objectid, key.type, key.offset);
3775 printf("Deleted root %llu item[%llu, %u, %llu]\n",
3776 root->objectid, key.objectid, key.type, key.offset);
3781 * Main entry function to check known items and update related accounting info
3783 static int check_leaf_items(struct btrfs_trans_handle *trans,
3784 struct btrfs_root *root, struct btrfs_path *path,
3785 struct node_refs *nrefs, int account_bytes)
3787 struct btrfs_fs_info *fs_info = root->fs_info;
3788 struct btrfs_key key;
3789 struct extent_buffer *eb;
3792 struct btrfs_extent_data_ref *dref;
3797 eb = path->nodes[0];
3798 slot = path->slots[0];
3799 if (slot >= btrfs_header_nritems(eb)) {
3801 error("empty leaf [%llu %u] root %llu", eb->start,
3802 root->fs_info->nodesize, root->objectid);
3808 btrfs_item_key_to_cpu(eb, &key, slot);
3812 case BTRFS_EXTENT_DATA_KEY:
3813 ret = check_extent_data_item(root, path, nrefs, account_bytes);
3815 ret = repair_extent_data_item(trans, root, path, nrefs,
3819 case BTRFS_BLOCK_GROUP_ITEM_KEY:
3820 ret = check_block_group_item(fs_info, eb, slot);
3822 ret & REFERENCER_MISSING)
3823 ret = delete_extent_tree_item(trans, root, path);
3826 case BTRFS_DEV_ITEM_KEY:
3827 ret = check_dev_item(fs_info, eb, slot);
3830 case BTRFS_CHUNK_ITEM_KEY:
3831 ret = check_chunk_item(fs_info, eb, slot);
3833 ret = repair_chunk_item(trans, root, path, ret);
3836 case BTRFS_DEV_EXTENT_KEY:
3837 ret = check_dev_extent_item(fs_info, eb, slot);
3840 case BTRFS_EXTENT_ITEM_KEY:
3841 case BTRFS_METADATA_ITEM_KEY:
3842 ret = check_extent_item(trans, fs_info, path);
3845 case BTRFS_EXTENT_CSUM_KEY:
3846 total_csum_bytes += btrfs_item_size_nr(eb, slot);
3849 case BTRFS_TREE_BLOCK_REF_KEY:
3850 ret = check_tree_block_backref(fs_info, key.offset,
3853 ret & (REFERENCER_MISMATCH | REFERENCER_MISSING))
3854 ret = delete_extent_tree_item(trans, root, path);
3857 case BTRFS_EXTENT_DATA_REF_KEY:
3858 dref = btrfs_item_ptr(eb, slot, struct btrfs_extent_data_ref);
3859 ret = check_extent_data_backref(fs_info,
3860 btrfs_extent_data_ref_root(eb, dref),
3861 btrfs_extent_data_ref_objectid(eb, dref),
3862 btrfs_extent_data_ref_offset(eb, dref),
3864 btrfs_extent_data_ref_count(eb, dref));
3866 ret & (REFERENCER_MISMATCH | REFERENCER_MISSING))
3867 ret = delete_extent_tree_item(trans, root, path);
3870 case BTRFS_SHARED_BLOCK_REF_KEY:
3871 ret = check_shared_block_backref(fs_info, key.offset,
3874 ret & (REFERENCER_MISMATCH | REFERENCER_MISSING))
3875 ret = delete_extent_tree_item(trans, root, path);
3878 case BTRFS_SHARED_DATA_REF_KEY:
3879 ret = check_shared_data_backref(fs_info, key.offset,
3882 ret & (REFERENCER_MISMATCH | REFERENCER_MISSING))
3883 ret = delete_extent_tree_item(trans, root, path);
3897 * @trans just for lowmem repair mode
3898 * @check all if not 0 then check all tree block backrefs and items
3899 * 0 then just check relationship of items in fs tree(s)
3901 * Returns >0 Found error, should continue
3902 * Returns <0 Fatal error, must exit the whole check
3903 * Returns 0 No errors found
3905 static int walk_down_tree(struct btrfs_trans_handle *trans,
3906 struct btrfs_root *root, struct btrfs_path *path,
3907 int *level, struct node_refs *nrefs, int ext_ref,
3910 enum btrfs_tree_block_status status;
3913 struct btrfs_fs_info *fs_info = root->fs_info;
3914 struct extent_buffer *next;
3915 struct extent_buffer *cur;
3919 int account_file_data = 0;
3921 WARN_ON(*level < 0);
3922 WARN_ON(*level >= BTRFS_MAX_LEVEL);
3924 ret = update_nodes_refs(root, btrfs_header_bytenr(path->nodes[*level]),
3925 path->nodes[*level], nrefs, *level, check_all);
3929 while (*level >= 0) {
3930 WARN_ON(*level < 0);
3931 WARN_ON(*level >= BTRFS_MAX_LEVEL);
3932 cur = path->nodes[*level];
3933 bytenr = btrfs_header_bytenr(cur);
3934 check = nrefs->need_check[*level];
3936 if (btrfs_header_level(cur) != *level)
3939 * Update bytes accounting and check tree block ref
3940 * NOTE: Doing accounting and check before checking nritems
3941 * is necessary because of empty node/leaf.
3943 if ((check_all && !nrefs->checked[*level]) ||
3944 (!check_all && nrefs->need_check[*level])) {
3945 ret = check_tree_block_ref(root, cur,
3946 btrfs_header_bytenr(cur), btrfs_header_level(cur),
3947 btrfs_header_owner(cur), nrefs);
3950 ret = repair_tree_block_ref(trans, root,
3951 path->nodes[*level], nrefs, *level, ret);
3954 if (check_all && nrefs->need_check[*level] &&
3955 nrefs->refs[*level]) {
3956 account_bytes(root, path, *level);
3957 account_file_data = 1;
3959 nrefs->checked[*level] = 1;
3962 if (path->slots[*level] >= btrfs_header_nritems(cur))
3965 /* Don't forgot to check leaf/node validation */
3967 /* skip duplicate check */
3968 if (check || !check_all) {
3969 ret = btrfs_check_leaf(root, NULL, cur);
3970 if (ret != BTRFS_TREE_BLOCK_CLEAN) {
3978 ret = process_one_leaf(root, path, nrefs,
3981 ret = check_leaf_items(trans, root, path,
3982 nrefs, account_file_data);
3986 if (check || !check_all) {
3987 ret = btrfs_check_node(root, NULL, cur);
3988 if (ret != BTRFS_TREE_BLOCK_CLEAN) {
3994 bytenr = btrfs_node_blockptr(cur, path->slots[*level]);
3995 ptr_gen = btrfs_node_ptr_generation(cur, path->slots[*level]);
3997 ret = update_nodes_refs(root, bytenr, NULL, nrefs, *level - 1,
4002 * check all trees in check_chunks_and_extent
4003 * check shared node once in check_fs_roots
4005 if (!check_all && !nrefs->need_check[*level - 1]) {
4006 path->slots[*level]++;
4010 next = btrfs_find_tree_block(fs_info, bytenr, fs_info->nodesize);
4011 if (!next || !btrfs_buffer_uptodate(next, ptr_gen)) {
4012 free_extent_buffer(next);
4013 reada_walk_down(root, cur, path->slots[*level]);
4014 next = read_tree_block(fs_info, bytenr, ptr_gen);
4015 if (!extent_buffer_uptodate(next)) {
4016 struct btrfs_key node_key;
4018 btrfs_node_key_to_cpu(path->nodes[*level],
4020 path->slots[*level]);
4021 btrfs_add_corrupt_extent_record(fs_info,
4022 &node_key, path->nodes[*level]->start,
4023 fs_info->nodesize, *level);
4029 ret = check_child_node(cur, path->slots[*level], next);
4034 if (btrfs_is_leaf(next))
4035 status = btrfs_check_leaf(root, NULL, next);
4037 status = btrfs_check_node(root, NULL, next);
4038 if (status != BTRFS_TREE_BLOCK_CLEAN) {
4039 free_extent_buffer(next);
4044 *level = *level - 1;
4045 free_extent_buffer(path->nodes[*level]);
4046 path->nodes[*level] = next;
4047 path->slots[*level] = 0;
4048 account_file_data = 0;
4050 update_nodes_refs(root, (u64)-1, next, nrefs, *level, check_all);
4055 static int walk_up_tree(struct btrfs_root *root, struct btrfs_path *path,
4059 struct extent_buffer *leaf;
4061 for (i = *level; i < BTRFS_MAX_LEVEL - 1 && path->nodes[i]; i++) {
4062 leaf = path->nodes[i];
4063 if (path->slots[i] + 1 < btrfs_header_nritems(leaf)) {
4068 free_extent_buffer(path->nodes[*level]);
4069 path->nodes[*level] = NULL;
4076 * Insert the missing inode item and inode ref.
4078 * Normal INODE_ITEM_MISSING and INODE_REF_MISSING are handled in backref * dir.
4079 * Root dir should be handled specially because root dir is the root of fs.
4081 * returns err (>0 or 0) after repair
4083 static int repair_fs_first_inode(struct btrfs_root *root, int err)
4085 struct btrfs_trans_handle *trans;
4086 struct btrfs_key key;
4087 struct btrfs_path path;
4088 int filetype = BTRFS_FT_DIR;
4091 btrfs_init_path(&path);
4093 if (err & INODE_REF_MISSING) {
4094 key.objectid = BTRFS_FIRST_FREE_OBJECTID;
4095 key.type = BTRFS_INODE_REF_KEY;
4096 key.offset = BTRFS_FIRST_FREE_OBJECTID;
4098 trans = btrfs_start_transaction(root, 1);
4099 if (IS_ERR(trans)) {
4100 ret = PTR_ERR(trans);
4104 btrfs_release_path(&path);
4105 ret = btrfs_search_slot(trans, root, &key, &path, 1, 1);
4109 ret = btrfs_insert_inode_ref(trans, root, "..", 2,
4110 BTRFS_FIRST_FREE_OBJECTID,
4111 BTRFS_FIRST_FREE_OBJECTID, 0);
4115 printf("Add INODE_REF[%llu %llu] name %s\n",
4116 BTRFS_FIRST_FREE_OBJECTID, BTRFS_FIRST_FREE_OBJECTID,
4118 err &= ~INODE_REF_MISSING;
4121 error("fail to insert first inode's ref");
4122 btrfs_commit_transaction(trans, root);
4125 if (err & INODE_ITEM_MISSING) {
4126 ret = repair_inode_item_missing(root,
4127 BTRFS_FIRST_FREE_OBJECTID, filetype);
4130 err &= ~INODE_ITEM_MISSING;
4134 error("fail to repair first inode");
4135 btrfs_release_path(&path);
4140 * check first root dir's inode_item and inode_ref
4142 * returns 0 means no error
4143 * returns >0 means error
4144 * returns <0 means fatal error
4146 static int check_fs_first_inode(struct btrfs_root *root, unsigned int ext_ref)
4148 struct btrfs_path path;
4149 struct btrfs_key key;
4150 struct btrfs_inode_item *ii;
4156 key.objectid = BTRFS_FIRST_FREE_OBJECTID;
4157 key.type = BTRFS_INODE_ITEM_KEY;
4160 /* For root being dropped, we don't need to check first inode */
4161 if (btrfs_root_refs(&root->root_item) == 0 &&
4162 btrfs_disk_key_objectid(&root->root_item.drop_progress) >=
4163 BTRFS_FIRST_FREE_OBJECTID)
4166 btrfs_init_path(&path);
4167 ret = btrfs_search_slot(NULL, root, &key, &path, 0, 0);
4172 err |= INODE_ITEM_MISSING;
4174 ii = btrfs_item_ptr(path.nodes[0], path.slots[0],
4175 struct btrfs_inode_item);
4176 mode = btrfs_inode_mode(path.nodes[0], ii);
4177 if (imode_to_type(mode) != BTRFS_FT_DIR)
4178 err |= INODE_ITEM_MISMATCH;
4181 /* lookup first inode ref */
4182 key.offset = BTRFS_FIRST_FREE_OBJECTID;
4183 key.type = BTRFS_INODE_REF_KEY;
4184 /* special index value */
4187 ret = find_inode_ref(root, &key, "..", strlen(".."), &index, ext_ref);
4193 btrfs_release_path(&path);
4196 err = repair_fs_first_inode(root, err);
4198 if (err & (INODE_ITEM_MISSING | INODE_ITEM_MISMATCH))
4199 error("root dir INODE_ITEM is %s",
4200 err & INODE_ITEM_MISMATCH ? "mismatch" : "missing");
4201 if (err & INODE_REF_MISSING)
4202 error("root dir INODE_REF is missing");
4204 return ret < 0 ? ret : err;
4208 * This function calls walk_down_tree and walk_up_tree to check tree
4209 * blocks and integrity of fs tree items.
4211 * @root: the root of the tree to be checked.
4212 * @ext_ref feature EXTENDED_IREF is enable or not.
4213 * @account if NOT 0 means check the tree (including tree)'s treeblocks.
4214 * otherwise means check fs tree(s) items relationship and
4215 * @root MUST be a fs tree root.
4216 * Returns 0 represents OK.
4217 * Returns not 0 represents error.
4219 static int check_btrfs_root(struct btrfs_trans_handle *trans,
4220 struct btrfs_root *root, unsigned int ext_ref,
4223 struct btrfs_path path;
4224 struct node_refs nrefs;
4225 struct btrfs_root_item *root_item = &root->root_item;
4230 memset(&nrefs, 0, sizeof(nrefs));
4233 * We need to manually check the first inode item (256)
4234 * As the following traversal function will only start from
4235 * the first inode item in the leaf, if inode item (256) is
4236 * missing we will skip it forever.
4238 ret = check_fs_first_inode(root, ext_ref);
4244 level = btrfs_header_level(root->node);
4245 btrfs_init_path(&path);
4247 if (btrfs_root_refs(root_item) > 0 ||
4248 btrfs_disk_key_objectid(&root_item->drop_progress) == 0) {
4249 path.nodes[level] = root->node;
4250 path.slots[level] = 0;
4251 extent_buffer_get(root->node);
4253 struct btrfs_key key;
4255 btrfs_disk_key_to_cpu(&key, &root_item->drop_progress);
4256 level = root_item->drop_level;
4257 path.lowest_level = level;
4258 ret = btrfs_search_slot(NULL, root, &key, &path, 0, 0);
4265 ret = walk_down_tree(trans, root, &path, &level, &nrefs,
4266 ext_ref, check_all);
4270 /* if ret is negative, walk shall stop */
4276 ret = walk_up_tree(root, &path, &level);
4278 /* Normal exit, reset ret to err */
4285 btrfs_release_path(&path);
4290 * Iterate all items in the tree and call check_inode_item() to check.
4292 * @root: the root of the tree to be checked.
4293 * @ext_ref: the EXTENDED_IREF feature
4295 * Return 0 if no error found.
4296 * Return <0 for error.
4298 static int check_fs_root(struct btrfs_root *root, unsigned int ext_ref)
4300 reset_cached_block_groups(root->fs_info);
4301 return check_btrfs_root(NULL, root, ext_ref, 0);
4305 * Find the relative ref for root_ref and root_backref.
4307 * @root: the root of the root tree.
4308 * @ref_key: the key of the root ref.
4310 * Return 0 if no error occurred.
4312 static int check_root_ref(struct btrfs_root *root, struct btrfs_key *ref_key,
4313 struct extent_buffer *node, int slot)
4315 struct btrfs_path path;
4316 struct btrfs_key key;
4317 struct btrfs_root_ref *ref;
4318 struct btrfs_root_ref *backref;
4319 char ref_name[BTRFS_NAME_LEN] = {0};
4320 char backref_name[BTRFS_NAME_LEN] = {0};
4326 u32 backref_namelen;
4331 ref = btrfs_item_ptr(node, slot, struct btrfs_root_ref);
4332 ref_dirid = btrfs_root_ref_dirid(node, ref);
4333 ref_seq = btrfs_root_ref_sequence(node, ref);
4334 ref_namelen = btrfs_root_ref_name_len(node, ref);
4336 if (ref_namelen <= BTRFS_NAME_LEN) {
4339 len = BTRFS_NAME_LEN;
4340 warning("%s[%llu %llu] ref_name too long",
4341 ref_key->type == BTRFS_ROOT_REF_KEY ?
4342 "ROOT_REF" : "ROOT_BACKREF", ref_key->objectid,
4345 read_extent_buffer(node, ref_name, (unsigned long)(ref + 1), len);
4347 /* Find relative root_ref */
4348 key.objectid = ref_key->offset;
4349 key.type = BTRFS_ROOT_BACKREF_KEY + BTRFS_ROOT_REF_KEY - ref_key->type;
4350 key.offset = ref_key->objectid;
4352 btrfs_init_path(&path);
4353 ret = btrfs_search_slot(NULL, root, &key, &path, 0, 0);
4355 err |= ROOT_REF_MISSING;
4356 error("%s[%llu %llu] couldn't find relative ref",
4357 ref_key->type == BTRFS_ROOT_REF_KEY ?
4358 "ROOT_REF" : "ROOT_BACKREF",
4359 ref_key->objectid, ref_key->offset);
4363 backref = btrfs_item_ptr(path.nodes[0], path.slots[0],
4364 struct btrfs_root_ref);
4365 backref_dirid = btrfs_root_ref_dirid(path.nodes[0], backref);
4366 backref_seq = btrfs_root_ref_sequence(path.nodes[0], backref);
4367 backref_namelen = btrfs_root_ref_name_len(path.nodes[0], backref);
4369 if (backref_namelen <= BTRFS_NAME_LEN) {
4370 len = backref_namelen;
4372 len = BTRFS_NAME_LEN;
4373 warning("%s[%llu %llu] ref_name too long",
4374 key.type == BTRFS_ROOT_REF_KEY ?
4375 "ROOT_REF" : "ROOT_BACKREF",
4376 key.objectid, key.offset);
4378 read_extent_buffer(path.nodes[0], backref_name,
4379 (unsigned long)(backref + 1), len);
4381 if (ref_dirid != backref_dirid || ref_seq != backref_seq ||
4382 ref_namelen != backref_namelen ||
4383 strncmp(ref_name, backref_name, len)) {
4384 err |= ROOT_REF_MISMATCH;
4385 error("%s[%llu %llu] mismatch relative ref",
4386 ref_key->type == BTRFS_ROOT_REF_KEY ?
4387 "ROOT_REF" : "ROOT_BACKREF",
4388 ref_key->objectid, ref_key->offset);
4391 btrfs_release_path(&path);
4396 * Check all fs/file tree in low_memory mode.
4398 * 1. for fs tree root item, call check_fs_root()
4399 * 2. for fs tree root ref/backref, call check_root_ref()
4401 * Return 0 if no error occurred.
4403 int check_fs_roots_lowmem(struct btrfs_fs_info *fs_info)
4405 struct btrfs_root *tree_root = fs_info->tree_root;
4406 struct btrfs_root *cur_root = NULL;
4407 struct btrfs_path path;
4408 struct btrfs_key key;
4409 struct extent_buffer *node;
4410 unsigned int ext_ref;
4415 ext_ref = btrfs_fs_incompat(fs_info, EXTENDED_IREF);
4417 btrfs_init_path(&path);
4418 key.objectid = BTRFS_FS_TREE_OBJECTID;
4420 key.type = BTRFS_ROOT_ITEM_KEY;
4422 ret = btrfs_search_slot(NULL, tree_root, &key, &path, 0, 0);
4426 } else if (ret > 0) {
4432 node = path.nodes[0];
4433 slot = path.slots[0];
4434 btrfs_item_key_to_cpu(node, &key, slot);
4435 if (key.objectid > BTRFS_LAST_FREE_OBJECTID)
4437 if (key.type == BTRFS_ROOT_ITEM_KEY &&
4438 fs_root_objectid(key.objectid)) {
4439 if (key.objectid == BTRFS_TREE_RELOC_OBJECTID) {
4440 cur_root = btrfs_read_fs_root_no_cache(fs_info,
4443 key.offset = (u64)-1;
4444 cur_root = btrfs_read_fs_root(fs_info, &key);
4447 if (IS_ERR(cur_root)) {
4448 error("Fail to read fs/subvol tree: %lld",
4454 ret = check_fs_root(cur_root, ext_ref);
4457 if (key.objectid == BTRFS_TREE_RELOC_OBJECTID)
4458 btrfs_free_fs_root(cur_root);
4459 } else if (key.type == BTRFS_ROOT_REF_KEY ||
4460 key.type == BTRFS_ROOT_BACKREF_KEY) {
4461 ret = check_root_ref(tree_root, &key, node, slot);
4465 ret = btrfs_next_item(tree_root, &path);
4475 btrfs_release_path(&path);
4480 * Low memory usage version check_chunks_and_extents.
4482 int check_chunks_and_extents_lowmem(struct btrfs_fs_info *fs_info)
4484 struct btrfs_trans_handle *trans = NULL;
4485 struct btrfs_path path;
4486 struct btrfs_key old_key;
4487 struct btrfs_key key;
4488 struct btrfs_root *root1;
4489 struct btrfs_root *root;
4490 struct btrfs_root *cur_root;
4494 root = fs_info->fs_root;
4497 trans = btrfs_start_transaction(fs_info->extent_root, 1);
4498 if (IS_ERR(trans)) {
4499 error("failed to start transaction before check");
4500 return PTR_ERR(trans);
4504 root1 = root->fs_info->chunk_root;
4505 ret = check_btrfs_root(trans, root1, 0, 1);
4508 root1 = root->fs_info->tree_root;
4509 ret = check_btrfs_root(trans, root1, 0, 1);
4512 btrfs_init_path(&path);
4513 key.objectid = BTRFS_EXTENT_TREE_OBJECTID;
4515 key.type = BTRFS_ROOT_ITEM_KEY;
4517 ret = btrfs_search_slot(NULL, root1, &key, &path, 0, 0);
4519 error("cannot find extent tree in tree_root");
4524 btrfs_item_key_to_cpu(path.nodes[0], &key, path.slots[0]);
4525 if (key.type != BTRFS_ROOT_ITEM_KEY)
4528 key.offset = (u64)-1;
4530 if (key.objectid == BTRFS_TREE_RELOC_OBJECTID)
4531 cur_root = btrfs_read_fs_root_no_cache(root->fs_info,
4534 cur_root = btrfs_read_fs_root(root->fs_info, &key);
4535 if (IS_ERR(cur_root) || !cur_root) {
4536 error("failed to read tree: %lld", key.objectid);
4540 ret = check_btrfs_root(trans, cur_root, 0, 1);
4543 if (key.objectid == BTRFS_TREE_RELOC_OBJECTID)
4544 btrfs_free_fs_root(cur_root);
4546 btrfs_release_path(&path);
4547 ret = btrfs_search_slot(NULL, root->fs_info->tree_root,
4548 &old_key, &path, 0, 0);
4552 ret = btrfs_next_item(root1, &path);
4558 /* if repair, update block accounting */
4560 ret = btrfs_fix_block_accounting(trans, root);
4564 err &= ~BG_ACCOUNTING_ERROR;
4568 btrfs_commit_transaction(trans, root->fs_info->extent_root);
4570 btrfs_release_path(&path);