2 * Copyright (C) 2007 Oracle. All rights reserved.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
13 * You should have received a copy of the GNU General Public
14 * License along with this program; if not, write to the
15 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16 * Boston, MA 021110-1307, USA.
19 #define _XOPEN_SOURCE 500
25 #include <sys/types.h>
29 #include <uuid/uuid.h>
34 #include "print-tree.h"
35 #include "transaction.h"
39 #include "free-space-cache.h"
42 static u64 bytes_used = 0;
43 static u64 total_csum_bytes = 0;
44 static u64 total_btree_bytes = 0;
45 static u64 total_fs_tree_bytes = 0;
46 static u64 total_extent_tree_bytes = 0;
47 static u64 btree_space_waste = 0;
48 static u64 data_bytes_allocated = 0;
49 static u64 data_bytes_referenced = 0;
50 static int found_old_backref = 0;
51 static LIST_HEAD(duplicate_extents);
52 static LIST_HEAD(delete_items);
53 static int repair = 0;
54 static int no_holes = 0;
55 static int init_extent_tree = 0;
57 struct extent_backref {
58 struct list_head list;
59 unsigned int is_data:1;
60 unsigned int found_extent_tree:1;
61 unsigned int full_backref:1;
62 unsigned int found_ref:1;
63 unsigned int broken:1;
67 struct extent_backref node;
82 struct extent_backref node;
89 struct extent_record {
90 struct list_head backrefs;
91 struct list_head dups;
92 struct list_head list;
93 struct cache_extent cache;
94 struct btrfs_disk_key parent_key;
95 unsigned int found_rec;
100 u64 extent_item_refs;
102 u64 parent_generation;
106 unsigned int content_checked:1;
107 unsigned int owner_ref_checked:1;
108 unsigned int is_root:1;
109 unsigned int metadata:1;
112 struct inode_backref {
113 struct list_head list;
114 unsigned int found_dir_item:1;
115 unsigned int found_dir_index:1;
116 unsigned int found_inode_ref:1;
117 unsigned int filetype:8;
119 unsigned int ref_type;
126 struct dropping_root_item_record {
127 struct list_head list;
128 struct btrfs_root_item ri;
129 struct btrfs_key found_key;
132 #define REF_ERR_NO_DIR_ITEM (1 << 0)
133 #define REF_ERR_NO_DIR_INDEX (1 << 1)
134 #define REF_ERR_NO_INODE_REF (1 << 2)
135 #define REF_ERR_DUP_DIR_ITEM (1 << 3)
136 #define REF_ERR_DUP_DIR_INDEX (1 << 4)
137 #define REF_ERR_DUP_INODE_REF (1 << 5)
138 #define REF_ERR_INDEX_UNMATCH (1 << 6)
139 #define REF_ERR_FILETYPE_UNMATCH (1 << 7)
140 #define REF_ERR_NAME_TOO_LONG (1 << 8) // 100
141 #define REF_ERR_NO_ROOT_REF (1 << 9)
142 #define REF_ERR_NO_ROOT_BACKREF (1 << 10)
143 #define REF_ERR_DUP_ROOT_REF (1 << 11)
144 #define REF_ERR_DUP_ROOT_BACKREF (1 << 12)
146 struct inode_record {
147 struct list_head backrefs;
148 unsigned int checked:1;
149 unsigned int merging:1;
150 unsigned int found_inode_item:1;
151 unsigned int found_dir_item:1;
152 unsigned int found_file_extent:1;
153 unsigned int found_csum_item:1;
154 unsigned int some_csum_missing:1;
155 unsigned int nodatasum:1;
168 u64 first_extent_gap;
173 #define I_ERR_NO_INODE_ITEM (1 << 0)
174 #define I_ERR_NO_ORPHAN_ITEM (1 << 1)
175 #define I_ERR_DUP_INODE_ITEM (1 << 2)
176 #define I_ERR_DUP_DIR_INDEX (1 << 3)
177 #define I_ERR_ODD_DIR_ITEM (1 << 4)
178 #define I_ERR_ODD_FILE_EXTENT (1 << 5)
179 #define I_ERR_BAD_FILE_EXTENT (1 << 6)
180 #define I_ERR_FILE_EXTENT_OVERLAP (1 << 7)
181 #define I_ERR_FILE_EXTENT_DISCOUNT (1 << 8) // 100
182 #define I_ERR_DIR_ISIZE_WRONG (1 << 9)
183 #define I_ERR_FILE_NBYTES_WRONG (1 << 10) // 400
184 #define I_ERR_ODD_CSUM_ITEM (1 << 11)
185 #define I_ERR_SOME_CSUM_MISSING (1 << 12)
186 #define I_ERR_LINK_COUNT_WRONG (1 << 13)
188 struct root_backref {
189 struct list_head list;
190 unsigned int found_dir_item:1;
191 unsigned int found_dir_index:1;
192 unsigned int found_back_ref:1;
193 unsigned int found_forward_ref:1;
194 unsigned int reachable:1;
204 struct list_head backrefs;
205 struct cache_extent cache;
206 unsigned int found_root_item:1;
212 struct cache_extent cache;
217 struct cache_extent cache;
218 struct cache_tree root_cache;
219 struct cache_tree inode_cache;
220 struct inode_record *current;
229 struct walk_control {
230 struct cache_tree shared;
231 struct shared_node *nodes[BTRFS_MAX_LEVEL];
237 struct btrfs_key key;
239 struct list_head list;
242 static void reset_cached_block_groups(struct btrfs_fs_info *fs_info);
244 static u8 imode_to_type(u32 imode)
247 static unsigned char btrfs_type_by_mode[S_IFMT >> S_SHIFT] = {
248 [S_IFREG >> S_SHIFT] = BTRFS_FT_REG_FILE,
249 [S_IFDIR >> S_SHIFT] = BTRFS_FT_DIR,
250 [S_IFCHR >> S_SHIFT] = BTRFS_FT_CHRDEV,
251 [S_IFBLK >> S_SHIFT] = BTRFS_FT_BLKDEV,
252 [S_IFIFO >> S_SHIFT] = BTRFS_FT_FIFO,
253 [S_IFSOCK >> S_SHIFT] = BTRFS_FT_SOCK,
254 [S_IFLNK >> S_SHIFT] = BTRFS_FT_SYMLINK,
257 return btrfs_type_by_mode[(imode & S_IFMT) >> S_SHIFT];
261 static int device_record_compare(struct rb_node *node1, struct rb_node *node2)
263 struct device_record *rec1;
264 struct device_record *rec2;
266 rec1 = rb_entry(node1, struct device_record, node);
267 rec2 = rb_entry(node2, struct device_record, node);
268 if (rec1->devid > rec2->devid)
270 else if (rec1->devid < rec2->devid)
276 static struct inode_record *clone_inode_rec(struct inode_record *orig_rec)
278 struct inode_record *rec;
279 struct inode_backref *backref;
280 struct inode_backref *orig;
283 rec = malloc(sizeof(*rec));
284 memcpy(rec, orig_rec, sizeof(*rec));
286 INIT_LIST_HEAD(&rec->backrefs);
288 list_for_each_entry(orig, &orig_rec->backrefs, list) {
289 size = sizeof(*orig) + orig->namelen + 1;
290 backref = malloc(size);
291 memcpy(backref, orig, size);
292 list_add_tail(&backref->list, &rec->backrefs);
297 static void print_inode_error(int errors)
299 if (errors & I_ERR_NO_INODE_ITEM)
300 fprintf(stderr, ", no inode item");
301 if (errors & I_ERR_NO_ORPHAN_ITEM)
302 fprintf(stderr, ", no orphan item");
303 if (errors & I_ERR_DUP_INODE_ITEM)
304 fprintf(stderr, ", dup inode item");
305 if (errors & I_ERR_DUP_DIR_INDEX)
306 fprintf(stderr, ", dup dir index");
307 if (errors & I_ERR_ODD_DIR_ITEM)
308 fprintf(stderr, ", odd dir item");
309 if (errors & I_ERR_ODD_FILE_EXTENT)
310 fprintf(stderr, ", odd file extent");
311 if (errors & I_ERR_BAD_FILE_EXTENT)
312 fprintf(stderr, ", bad file extent");
313 if (errors & I_ERR_FILE_EXTENT_OVERLAP)
314 fprintf(stderr, ", file extent overlap");
315 if (errors & I_ERR_FILE_EXTENT_DISCOUNT)
316 fprintf(stderr, ", file extent discount");
317 if (errors & I_ERR_DIR_ISIZE_WRONG)
318 fprintf(stderr, ", dir isize wrong");
319 if (errors & I_ERR_FILE_NBYTES_WRONG)
320 fprintf(stderr, ", nbytes wrong");
321 if (errors & I_ERR_ODD_CSUM_ITEM)
322 fprintf(stderr, ", odd csum item");
323 if (errors & I_ERR_SOME_CSUM_MISSING)
324 fprintf(stderr, ", some csum missing");
325 if (errors & I_ERR_LINK_COUNT_WRONG)
326 fprintf(stderr, ", link count wrong");
327 fprintf(stderr, "\n");
330 static void print_ref_error(int errors)
332 if (errors & REF_ERR_NO_DIR_ITEM)
333 fprintf(stderr, ", no dir item");
334 if (errors & REF_ERR_NO_DIR_INDEX)
335 fprintf(stderr, ", no dir index");
336 if (errors & REF_ERR_NO_INODE_REF)
337 fprintf(stderr, ", no inode ref");
338 if (errors & REF_ERR_DUP_DIR_ITEM)
339 fprintf(stderr, ", dup dir item");
340 if (errors & REF_ERR_DUP_DIR_INDEX)
341 fprintf(stderr, ", dup dir index");
342 if (errors & REF_ERR_DUP_INODE_REF)
343 fprintf(stderr, ", dup inode ref");
344 if (errors & REF_ERR_INDEX_UNMATCH)
345 fprintf(stderr, ", index unmatch");
346 if (errors & REF_ERR_FILETYPE_UNMATCH)
347 fprintf(stderr, ", filetype unmatch");
348 if (errors & REF_ERR_NAME_TOO_LONG)
349 fprintf(stderr, ", name too long");
350 if (errors & REF_ERR_NO_ROOT_REF)
351 fprintf(stderr, ", no root ref");
352 if (errors & REF_ERR_NO_ROOT_BACKREF)
353 fprintf(stderr, ", no root backref");
354 if (errors & REF_ERR_DUP_ROOT_REF)
355 fprintf(stderr, ", dup root ref");
356 if (errors & REF_ERR_DUP_ROOT_BACKREF)
357 fprintf(stderr, ", dup root backref");
358 fprintf(stderr, "\n");
361 static struct inode_record *get_inode_rec(struct cache_tree *inode_cache,
364 struct ptr_node *node;
365 struct cache_extent *cache;
366 struct inode_record *rec = NULL;
369 cache = lookup_cache_extent(inode_cache, ino, 1);
371 node = container_of(cache, struct ptr_node, cache);
373 if (mod && rec->refs > 1) {
374 node->data = clone_inode_rec(rec);
379 rec = calloc(1, sizeof(*rec));
381 rec->extent_start = (u64)-1;
382 rec->first_extent_gap = (u64)-1;
384 INIT_LIST_HEAD(&rec->backrefs);
386 node = malloc(sizeof(*node));
387 node->cache.start = ino;
388 node->cache.size = 1;
391 if (ino == BTRFS_FREE_INO_OBJECTID)
394 ret = insert_cache_extent(inode_cache, &node->cache);
400 static void free_inode_rec(struct inode_record *rec)
402 struct inode_backref *backref;
407 while (!list_empty(&rec->backrefs)) {
408 backref = list_entry(rec->backrefs.next,
409 struct inode_backref, list);
410 list_del(&backref->list);
416 static int can_free_inode_rec(struct inode_record *rec)
418 if (!rec->errors && rec->checked && rec->found_inode_item &&
419 rec->nlink == rec->found_link && list_empty(&rec->backrefs))
424 static void maybe_free_inode_rec(struct cache_tree *inode_cache,
425 struct inode_record *rec)
427 struct cache_extent *cache;
428 struct inode_backref *tmp, *backref;
429 struct ptr_node *node;
430 unsigned char filetype;
432 if (!rec->found_inode_item)
435 filetype = imode_to_type(rec->imode);
436 list_for_each_entry_safe(backref, tmp, &rec->backrefs, list) {
437 if (backref->found_dir_item && backref->found_dir_index) {
438 if (backref->filetype != filetype)
439 backref->errors |= REF_ERR_FILETYPE_UNMATCH;
440 if (!backref->errors && backref->found_inode_ref) {
441 list_del(&backref->list);
447 if (!rec->checked || rec->merging)
450 if (S_ISDIR(rec->imode)) {
451 if (rec->found_size != rec->isize)
452 rec->errors |= I_ERR_DIR_ISIZE_WRONG;
453 if (rec->found_file_extent)
454 rec->errors |= I_ERR_ODD_FILE_EXTENT;
455 } else if (S_ISREG(rec->imode) || S_ISLNK(rec->imode)) {
456 if (rec->found_dir_item)
457 rec->errors |= I_ERR_ODD_DIR_ITEM;
458 if (rec->found_size != rec->nbytes)
459 rec->errors |= I_ERR_FILE_NBYTES_WRONG;
460 if (rec->extent_start == (u64)-1 || rec->extent_start > 0)
461 rec->first_extent_gap = 0;
462 if (rec->nlink > 0 && !no_holes &&
463 (rec->extent_end < rec->isize ||
464 rec->first_extent_gap < rec->isize))
465 rec->errors |= I_ERR_FILE_EXTENT_DISCOUNT;
468 if (S_ISREG(rec->imode) || S_ISLNK(rec->imode)) {
469 if (rec->found_csum_item && rec->nodatasum)
470 rec->errors |= I_ERR_ODD_CSUM_ITEM;
471 if (rec->some_csum_missing && !rec->nodatasum)
472 rec->errors |= I_ERR_SOME_CSUM_MISSING;
475 BUG_ON(rec->refs != 1);
476 if (can_free_inode_rec(rec)) {
477 cache = lookup_cache_extent(inode_cache, rec->ino, 1);
478 node = container_of(cache, struct ptr_node, cache);
479 BUG_ON(node->data != rec);
480 remove_cache_extent(inode_cache, &node->cache);
486 static int check_orphan_item(struct btrfs_root *root, u64 ino)
488 struct btrfs_path path;
489 struct btrfs_key key;
492 key.objectid = BTRFS_ORPHAN_OBJECTID;
493 key.type = BTRFS_ORPHAN_ITEM_KEY;
496 btrfs_init_path(&path);
497 ret = btrfs_search_slot(NULL, root, &key, &path, 0, 0);
498 btrfs_release_path(&path);
504 static int process_inode_item(struct extent_buffer *eb,
505 int slot, struct btrfs_key *key,
506 struct shared_node *active_node)
508 struct inode_record *rec;
509 struct btrfs_inode_item *item;
511 rec = active_node->current;
512 BUG_ON(rec->ino != key->objectid || rec->refs > 1);
513 if (rec->found_inode_item) {
514 rec->errors |= I_ERR_DUP_INODE_ITEM;
517 item = btrfs_item_ptr(eb, slot, struct btrfs_inode_item);
518 rec->nlink = btrfs_inode_nlink(eb, item);
519 rec->isize = btrfs_inode_size(eb, item);
520 rec->nbytes = btrfs_inode_nbytes(eb, item);
521 rec->imode = btrfs_inode_mode(eb, item);
522 if (btrfs_inode_flags(eb, item) & BTRFS_INODE_NODATASUM)
524 rec->found_inode_item = 1;
526 rec->errors |= I_ERR_NO_ORPHAN_ITEM;
527 maybe_free_inode_rec(&active_node->inode_cache, rec);
531 static struct inode_backref *get_inode_backref(struct inode_record *rec,
533 int namelen, u64 dir)
535 struct inode_backref *backref;
537 list_for_each_entry(backref, &rec->backrefs, list) {
538 if (backref->dir != dir || backref->namelen != namelen)
540 if (memcmp(name, backref->name, namelen))
545 backref = malloc(sizeof(*backref) + namelen + 1);
546 memset(backref, 0, sizeof(*backref));
548 backref->namelen = namelen;
549 memcpy(backref->name, name, namelen);
550 backref->name[namelen] = '\0';
551 list_add_tail(&backref->list, &rec->backrefs);
555 static int add_inode_backref(struct cache_tree *inode_cache,
556 u64 ino, u64 dir, u64 index,
557 const char *name, int namelen,
558 int filetype, int itemtype, int errors)
560 struct inode_record *rec;
561 struct inode_backref *backref;
563 rec = get_inode_rec(inode_cache, ino, 1);
564 backref = get_inode_backref(rec, name, namelen, dir);
566 backref->errors |= errors;
567 if (itemtype == BTRFS_DIR_INDEX_KEY) {
568 if (backref->found_dir_index)
569 backref->errors |= REF_ERR_DUP_DIR_INDEX;
570 if (backref->found_inode_ref && backref->index != index)
571 backref->errors |= REF_ERR_INDEX_UNMATCH;
572 if (backref->found_dir_item && backref->filetype != filetype)
573 backref->errors |= REF_ERR_FILETYPE_UNMATCH;
575 backref->index = index;
576 backref->filetype = filetype;
577 backref->found_dir_index = 1;
578 } else if (itemtype == BTRFS_DIR_ITEM_KEY) {
580 if (backref->found_dir_item)
581 backref->errors |= REF_ERR_DUP_DIR_ITEM;
582 if (backref->found_dir_index && backref->filetype != filetype)
583 backref->errors |= REF_ERR_FILETYPE_UNMATCH;
585 backref->filetype = filetype;
586 backref->found_dir_item = 1;
587 } else if ((itemtype == BTRFS_INODE_REF_KEY) ||
588 (itemtype == BTRFS_INODE_EXTREF_KEY)) {
589 if (backref->found_inode_ref)
590 backref->errors |= REF_ERR_DUP_INODE_REF;
591 if (backref->found_dir_index && backref->index != index)
592 backref->errors |= REF_ERR_INDEX_UNMATCH;
594 backref->ref_type = itemtype;
595 backref->index = index;
596 backref->found_inode_ref = 1;
601 maybe_free_inode_rec(inode_cache, rec);
605 static int merge_inode_recs(struct inode_record *src, struct inode_record *dst,
606 struct cache_tree *dst_cache)
608 struct inode_backref *backref;
612 list_for_each_entry(backref, &src->backrefs, list) {
613 if (backref->found_dir_index) {
614 add_inode_backref(dst_cache, dst->ino, backref->dir,
615 backref->index, backref->name,
616 backref->namelen, backref->filetype,
617 BTRFS_DIR_INDEX_KEY, backref->errors);
619 if (backref->found_dir_item) {
621 add_inode_backref(dst_cache, dst->ino,
622 backref->dir, 0, backref->name,
623 backref->namelen, backref->filetype,
624 BTRFS_DIR_ITEM_KEY, backref->errors);
626 if (backref->found_inode_ref) {
627 add_inode_backref(dst_cache, dst->ino,
628 backref->dir, backref->index,
629 backref->name, backref->namelen, 0,
630 backref->ref_type, backref->errors);
634 if (src->found_dir_item)
635 dst->found_dir_item = 1;
636 if (src->found_file_extent)
637 dst->found_file_extent = 1;
638 if (src->found_csum_item)
639 dst->found_csum_item = 1;
640 if (src->some_csum_missing)
641 dst->some_csum_missing = 1;
642 if (dst->first_extent_gap > src->first_extent_gap)
643 dst->first_extent_gap = src->first_extent_gap;
645 BUG_ON(src->found_link < dir_count);
646 dst->found_link += src->found_link - dir_count;
647 dst->found_size += src->found_size;
648 if (src->extent_start != (u64)-1) {
649 if (dst->extent_start == (u64)-1) {
650 dst->extent_start = src->extent_start;
651 dst->extent_end = src->extent_end;
653 if (dst->extent_end > src->extent_start)
654 dst->errors |= I_ERR_FILE_EXTENT_OVERLAP;
655 else if (dst->extent_end < src->extent_start &&
656 dst->extent_end < dst->first_extent_gap)
657 dst->first_extent_gap = dst->extent_end;
658 if (dst->extent_end < src->extent_end)
659 dst->extent_end = src->extent_end;
663 dst->errors |= src->errors;
664 if (src->found_inode_item) {
665 if (!dst->found_inode_item) {
666 dst->nlink = src->nlink;
667 dst->isize = src->isize;
668 dst->nbytes = src->nbytes;
669 dst->imode = src->imode;
670 dst->nodatasum = src->nodatasum;
671 dst->found_inode_item = 1;
673 dst->errors |= I_ERR_DUP_INODE_ITEM;
681 static int splice_shared_node(struct shared_node *src_node,
682 struct shared_node *dst_node)
684 struct cache_extent *cache;
685 struct ptr_node *node, *ins;
686 struct cache_tree *src, *dst;
687 struct inode_record *rec, *conflict;
692 if (--src_node->refs == 0)
694 if (src_node->current)
695 current_ino = src_node->current->ino;
697 src = &src_node->root_cache;
698 dst = &dst_node->root_cache;
700 cache = search_cache_extent(src, 0);
702 node = container_of(cache, struct ptr_node, cache);
704 cache = next_cache_extent(cache);
707 remove_cache_extent(src, &node->cache);
710 ins = malloc(sizeof(*ins));
711 ins->cache.start = node->cache.start;
712 ins->cache.size = node->cache.size;
716 ret = insert_cache_extent(dst, &ins->cache);
717 if (ret == -EEXIST) {
718 conflict = get_inode_rec(dst, rec->ino, 1);
719 merge_inode_recs(rec, conflict, dst);
721 conflict->checked = 1;
722 if (dst_node->current == conflict)
723 dst_node->current = NULL;
725 maybe_free_inode_rec(dst, conflict);
733 if (src == &src_node->root_cache) {
734 src = &src_node->inode_cache;
735 dst = &dst_node->inode_cache;
739 if (current_ino > 0 && (!dst_node->current ||
740 current_ino > dst_node->current->ino)) {
741 if (dst_node->current) {
742 dst_node->current->checked = 1;
743 maybe_free_inode_rec(dst, dst_node->current);
745 dst_node->current = get_inode_rec(dst, current_ino, 1);
750 static void free_inode_ptr(struct cache_extent *cache)
752 struct ptr_node *node;
753 struct inode_record *rec;
755 node = container_of(cache, struct ptr_node, cache);
761 FREE_EXTENT_CACHE_BASED_TREE(inode_recs, free_inode_ptr);
763 static struct shared_node *find_shared_node(struct cache_tree *shared,
766 struct cache_extent *cache;
767 struct shared_node *node;
769 cache = lookup_cache_extent(shared, bytenr, 1);
771 node = container_of(cache, struct shared_node, cache);
777 static int add_shared_node(struct cache_tree *shared, u64 bytenr, u32 refs)
780 struct shared_node *node;
782 node = calloc(1, sizeof(*node));
783 node->cache.start = bytenr;
784 node->cache.size = 1;
785 cache_tree_init(&node->root_cache);
786 cache_tree_init(&node->inode_cache);
789 ret = insert_cache_extent(shared, &node->cache);
794 static int enter_shared_node(struct btrfs_root *root, u64 bytenr, u32 refs,
795 struct walk_control *wc, int level)
797 struct shared_node *node;
798 struct shared_node *dest;
800 if (level == wc->active_node)
803 BUG_ON(wc->active_node <= level);
804 node = find_shared_node(&wc->shared, bytenr);
806 add_shared_node(&wc->shared, bytenr, refs);
807 node = find_shared_node(&wc->shared, bytenr);
808 wc->nodes[level] = node;
809 wc->active_node = level;
813 if (wc->root_level == wc->active_node &&
814 btrfs_root_refs(&root->root_item) == 0) {
815 if (--node->refs == 0) {
816 free_inode_recs_tree(&node->root_cache);
817 free_inode_recs_tree(&node->inode_cache);
818 remove_cache_extent(&wc->shared, &node->cache);
824 dest = wc->nodes[wc->active_node];
825 splice_shared_node(node, dest);
826 if (node->refs == 0) {
827 remove_cache_extent(&wc->shared, &node->cache);
833 static int leave_shared_node(struct btrfs_root *root,
834 struct walk_control *wc, int level)
836 struct shared_node *node;
837 struct shared_node *dest;
840 if (level == wc->root_level)
843 for (i = level + 1; i < BTRFS_MAX_LEVEL; i++) {
847 BUG_ON(i >= BTRFS_MAX_LEVEL);
849 node = wc->nodes[wc->active_node];
850 wc->nodes[wc->active_node] = NULL;
853 dest = wc->nodes[wc->active_node];
854 if (wc->active_node < wc->root_level ||
855 btrfs_root_refs(&root->root_item) > 0) {
856 BUG_ON(node->refs <= 1);
857 splice_shared_node(node, dest);
859 BUG_ON(node->refs < 2);
865 static int is_child_root(struct btrfs_root *root, u64 parent_root_id,
868 struct btrfs_path path;
869 struct btrfs_key key;
870 struct extent_buffer *leaf;
874 btrfs_init_path(&path);
876 key.objectid = parent_root_id;
877 key.type = BTRFS_ROOT_REF_KEY;
878 key.offset = child_root_id;
879 ret = btrfs_search_slot(NULL, root->fs_info->tree_root, &key, &path,
882 btrfs_release_path(&path);
886 key.objectid = child_root_id;
887 key.type = BTRFS_ROOT_BACKREF_KEY;
889 ret = btrfs_search_slot(NULL, root->fs_info->tree_root, &key, &path,
894 leaf = path.nodes[0];
895 if (path.slots[0] >= btrfs_header_nritems(leaf)) {
896 ret = btrfs_next_leaf(root->fs_info->tree_root, &path);
901 leaf = path.nodes[0];
904 btrfs_item_key_to_cpu(leaf, &key, path.slots[0]);
905 if (key.objectid != child_root_id ||
906 key.type != BTRFS_ROOT_BACKREF_KEY)
911 if (key.offset == parent_root_id) {
912 btrfs_release_path(&path);
919 btrfs_release_path(&path);
920 return has_parent? 0 : -1;
923 static int process_dir_item(struct btrfs_root *root,
924 struct extent_buffer *eb,
925 int slot, struct btrfs_key *key,
926 struct shared_node *active_node)
936 struct btrfs_dir_item *di;
937 struct inode_record *rec;
938 struct cache_tree *root_cache;
939 struct cache_tree *inode_cache;
940 struct btrfs_key location;
941 char namebuf[BTRFS_NAME_LEN];
943 root_cache = &active_node->root_cache;
944 inode_cache = &active_node->inode_cache;
945 rec = active_node->current;
946 rec->found_dir_item = 1;
948 di = btrfs_item_ptr(eb, slot, struct btrfs_dir_item);
949 total = btrfs_item_size_nr(eb, slot);
950 while (cur < total) {
952 btrfs_dir_item_key_to_cpu(eb, di, &location);
953 name_len = btrfs_dir_name_len(eb, di);
954 data_len = btrfs_dir_data_len(eb, di);
955 filetype = btrfs_dir_type(eb, di);
957 rec->found_size += name_len;
958 if (name_len <= BTRFS_NAME_LEN) {
962 len = BTRFS_NAME_LEN;
963 error = REF_ERR_NAME_TOO_LONG;
965 read_extent_buffer(eb, namebuf, (unsigned long)(di + 1), len);
967 if (location.type == BTRFS_INODE_ITEM_KEY) {
968 add_inode_backref(inode_cache, location.objectid,
969 key->objectid, key->offset, namebuf,
970 len, filetype, key->type, error);
971 } else if (location.type == BTRFS_ROOT_ITEM_KEY) {
972 add_inode_backref(root_cache, location.objectid,
973 key->objectid, key->offset,
974 namebuf, len, filetype,
977 fprintf(stderr, "warning line %d\n", __LINE__);
980 len = sizeof(*di) + name_len + data_len;
981 di = (struct btrfs_dir_item *)((char *)di + len);
984 if (key->type == BTRFS_DIR_INDEX_KEY && nritems > 1)
985 rec->errors |= I_ERR_DUP_DIR_INDEX;
990 static int process_inode_ref(struct extent_buffer *eb,
991 int slot, struct btrfs_key *key,
992 struct shared_node *active_node)
1000 struct cache_tree *inode_cache;
1001 struct btrfs_inode_ref *ref;
1002 char namebuf[BTRFS_NAME_LEN];
1004 inode_cache = &active_node->inode_cache;
1006 ref = btrfs_item_ptr(eb, slot, struct btrfs_inode_ref);
1007 total = btrfs_item_size_nr(eb, slot);
1008 while (cur < total) {
1009 name_len = btrfs_inode_ref_name_len(eb, ref);
1010 index = btrfs_inode_ref_index(eb, ref);
1011 if (name_len <= BTRFS_NAME_LEN) {
1015 len = BTRFS_NAME_LEN;
1016 error = REF_ERR_NAME_TOO_LONG;
1018 read_extent_buffer(eb, namebuf, (unsigned long)(ref + 1), len);
1019 add_inode_backref(inode_cache, key->objectid, key->offset,
1020 index, namebuf, len, 0, key->type, error);
1022 len = sizeof(*ref) + name_len;
1023 ref = (struct btrfs_inode_ref *)((char *)ref + len);
1029 static int process_inode_extref(struct extent_buffer *eb,
1030 int slot, struct btrfs_key *key,
1031 struct shared_node *active_node)
1040 struct cache_tree *inode_cache;
1041 struct btrfs_inode_extref *extref;
1042 char namebuf[BTRFS_NAME_LEN];
1044 inode_cache = &active_node->inode_cache;
1046 extref = btrfs_item_ptr(eb, slot, struct btrfs_inode_extref);
1047 total = btrfs_item_size_nr(eb, slot);
1048 while (cur < total) {
1049 name_len = btrfs_inode_extref_name_len(eb, extref);
1050 index = btrfs_inode_extref_index(eb, extref);
1051 parent = btrfs_inode_extref_parent(eb, extref);
1052 if (name_len <= BTRFS_NAME_LEN) {
1056 len = BTRFS_NAME_LEN;
1057 error = REF_ERR_NAME_TOO_LONG;
1059 read_extent_buffer(eb, namebuf,
1060 (unsigned long)(extref + 1), len);
1061 add_inode_backref(inode_cache, key->objectid, parent,
1062 index, namebuf, len, 0, key->type, error);
1064 len = sizeof(*extref) + name_len;
1065 extref = (struct btrfs_inode_extref *)((char *)extref + len);
1072 static u64 count_csum_range(struct btrfs_root *root, u64 start, u64 len)
1074 struct btrfs_key key;
1075 struct btrfs_path path;
1076 struct extent_buffer *leaf;
1081 u16 csum_size = btrfs_super_csum_size(root->fs_info->super_copy);
1083 btrfs_init_path(&path);
1085 key.objectid = BTRFS_EXTENT_CSUM_OBJECTID;
1087 key.type = BTRFS_EXTENT_CSUM_KEY;
1089 ret = btrfs_search_slot(NULL, root->fs_info->csum_root,
1092 if (ret > 0 && path.slots[0] > 0) {
1093 leaf = path.nodes[0];
1094 btrfs_item_key_to_cpu(leaf, &key, path.slots[0] - 1);
1095 if (key.objectid == BTRFS_EXTENT_CSUM_OBJECTID &&
1096 key.type == BTRFS_EXTENT_CSUM_KEY)
1101 leaf = path.nodes[0];
1102 if (path.slots[0] >= btrfs_header_nritems(leaf)) {
1103 ret = btrfs_next_leaf(root->fs_info->csum_root, &path);
1107 leaf = path.nodes[0];
1110 btrfs_item_key_to_cpu(leaf, &key, path.slots[0]);
1111 if (key.objectid != BTRFS_EXTENT_CSUM_OBJECTID ||
1112 key.type != BTRFS_EXTENT_CSUM_KEY)
1115 btrfs_item_key_to_cpu(leaf, &key, path.slots[0]);
1116 if (key.offset >= start + len)
1119 if (key.offset > start)
1122 size = btrfs_item_size_nr(leaf, path.slots[0]);
1123 csum_end = key.offset + (size / csum_size) * root->sectorsize;
1124 if (csum_end > start) {
1125 size = min(csum_end - start, len);
1133 btrfs_release_path(&path);
1137 static int process_file_extent(struct btrfs_root *root,
1138 struct extent_buffer *eb,
1139 int slot, struct btrfs_key *key,
1140 struct shared_node *active_node)
1142 struct inode_record *rec;
1143 struct btrfs_file_extent_item *fi;
1145 u64 disk_bytenr = 0;
1146 u64 extent_offset = 0;
1147 u64 mask = root->sectorsize - 1;
1150 rec = active_node->current;
1151 BUG_ON(rec->ino != key->objectid || rec->refs > 1);
1152 rec->found_file_extent = 1;
1154 if (rec->extent_start == (u64)-1) {
1155 rec->extent_start = key->offset;
1156 rec->extent_end = key->offset;
1159 if (rec->extent_end > key->offset)
1160 rec->errors |= I_ERR_FILE_EXTENT_OVERLAP;
1161 else if (rec->extent_end < key->offset &&
1162 rec->extent_end < rec->first_extent_gap)
1163 rec->first_extent_gap = rec->extent_end;
1165 fi = btrfs_item_ptr(eb, slot, struct btrfs_file_extent_item);
1166 extent_type = btrfs_file_extent_type(eb, fi);
1168 if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
1169 num_bytes = btrfs_file_extent_inline_len(eb, fi);
1171 rec->errors |= I_ERR_BAD_FILE_EXTENT;
1172 rec->found_size += num_bytes;
1173 num_bytes = (num_bytes + mask) & ~mask;
1174 } else if (extent_type == BTRFS_FILE_EXTENT_REG ||
1175 extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
1176 num_bytes = btrfs_file_extent_num_bytes(eb, fi);
1177 disk_bytenr = btrfs_file_extent_disk_bytenr(eb, fi);
1178 extent_offset = btrfs_file_extent_offset(eb, fi);
1179 if (num_bytes == 0 || (num_bytes & mask))
1180 rec->errors |= I_ERR_BAD_FILE_EXTENT;
1181 if (num_bytes + extent_offset >
1182 btrfs_file_extent_ram_bytes(eb, fi))
1183 rec->errors |= I_ERR_BAD_FILE_EXTENT;
1184 if (extent_type == BTRFS_FILE_EXTENT_PREALLOC &&
1185 (btrfs_file_extent_compression(eb, fi) ||
1186 btrfs_file_extent_encryption(eb, fi) ||
1187 btrfs_file_extent_other_encoding(eb, fi)))
1188 rec->errors |= I_ERR_BAD_FILE_EXTENT;
1189 if (disk_bytenr > 0)
1190 rec->found_size += num_bytes;
1192 rec->errors |= I_ERR_BAD_FILE_EXTENT;
1194 rec->extent_end = key->offset + num_bytes;
1196 if (disk_bytenr > 0) {
1198 if (btrfs_file_extent_compression(eb, fi))
1199 num_bytes = btrfs_file_extent_disk_num_bytes(eb, fi);
1201 disk_bytenr += extent_offset;
1203 found = count_csum_range(root, disk_bytenr, num_bytes);
1204 if (extent_type == BTRFS_FILE_EXTENT_REG) {
1206 rec->found_csum_item = 1;
1207 if (found < num_bytes)
1208 rec->some_csum_missing = 1;
1209 } else if (extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
1211 rec->errors |= I_ERR_ODD_CSUM_ITEM;
1217 static int process_one_leaf(struct btrfs_root *root, struct extent_buffer *eb,
1218 struct walk_control *wc)
1220 struct btrfs_key key;
1225 struct cache_tree *inode_cache;
1226 struct shared_node *active_node;
1228 if (wc->root_level == wc->active_node &&
1229 btrfs_root_refs(&root->root_item) == 0)
1232 active_node = wc->nodes[wc->active_node];
1233 inode_cache = &active_node->inode_cache;
1234 nritems = btrfs_header_nritems(eb);
1235 for (i = 0; i < nritems; i++) {
1236 btrfs_item_key_to_cpu(eb, &key, i);
1238 if (key.objectid == BTRFS_FREE_SPACE_OBJECTID)
1240 if (key.type == BTRFS_ORPHAN_ITEM_KEY)
1243 if (active_node->current == NULL ||
1244 active_node->current->ino < key.objectid) {
1245 if (active_node->current) {
1246 active_node->current->checked = 1;
1247 maybe_free_inode_rec(inode_cache,
1248 active_node->current);
1250 active_node->current = get_inode_rec(inode_cache,
1254 case BTRFS_DIR_ITEM_KEY:
1255 case BTRFS_DIR_INDEX_KEY:
1256 ret = process_dir_item(root, eb, i, &key, active_node);
1258 case BTRFS_INODE_REF_KEY:
1259 ret = process_inode_ref(eb, i, &key, active_node);
1261 case BTRFS_INODE_EXTREF_KEY:
1262 ret = process_inode_extref(eb, i, &key, active_node);
1264 case BTRFS_INODE_ITEM_KEY:
1265 ret = process_inode_item(eb, i, &key, active_node);
1267 case BTRFS_EXTENT_DATA_KEY:
1268 ret = process_file_extent(root, eb, i, &key,
1280 static void reada_walk_down(struct btrfs_root *root,
1281 struct extent_buffer *node, int slot)
1291 level = btrfs_header_level(node);
1295 nritems = btrfs_header_nritems(node);
1296 blocksize = btrfs_level_size(root, level - 1);
1297 for (i = slot; i < nritems; i++) {
1298 bytenr = btrfs_node_blockptr(node, i);
1299 ptr_gen = btrfs_node_ptr_generation(node, i);
1300 ret = readahead_tree_block(root, bytenr, blocksize, ptr_gen);
1306 static int walk_down_tree(struct btrfs_root *root, struct btrfs_path *path,
1307 struct walk_control *wc, int *level)
1311 struct extent_buffer *next;
1312 struct extent_buffer *cur;
1317 WARN_ON(*level < 0);
1318 WARN_ON(*level >= BTRFS_MAX_LEVEL);
1319 ret = btrfs_lookup_extent_info(NULL, root,
1320 path->nodes[*level]->start,
1321 *level, 1, &refs, NULL);
1328 ret = enter_shared_node(root, path->nodes[*level]->start,
1336 while (*level >= 0) {
1337 WARN_ON(*level < 0);
1338 WARN_ON(*level >= BTRFS_MAX_LEVEL);
1339 cur = path->nodes[*level];
1341 if (btrfs_header_level(cur) != *level)
1344 if (path->slots[*level] >= btrfs_header_nritems(cur))
1347 ret = process_one_leaf(root, cur, wc);
1350 bytenr = btrfs_node_blockptr(cur, path->slots[*level]);
1351 ptr_gen = btrfs_node_ptr_generation(cur, path->slots[*level]);
1352 blocksize = btrfs_level_size(root, *level - 1);
1353 ret = btrfs_lookup_extent_info(NULL, root, bytenr, *level - 1,
1359 ret = enter_shared_node(root, bytenr, refs,
1362 path->slots[*level]++;
1367 next = btrfs_find_tree_block(root, bytenr, blocksize);
1368 if (!next || !btrfs_buffer_uptodate(next, ptr_gen)) {
1369 free_extent_buffer(next);
1370 reada_walk_down(root, cur, path->slots[*level]);
1371 next = read_tree_block(root, bytenr, blocksize,
1379 *level = *level - 1;
1380 free_extent_buffer(path->nodes[*level]);
1381 path->nodes[*level] = next;
1382 path->slots[*level] = 0;
1385 path->slots[*level] = btrfs_header_nritems(path->nodes[*level]);
1389 static int walk_up_tree(struct btrfs_root *root, struct btrfs_path *path,
1390 struct walk_control *wc, int *level)
1393 struct extent_buffer *leaf;
1395 for (i = *level; i < BTRFS_MAX_LEVEL - 1 && path->nodes[i]; i++) {
1396 leaf = path->nodes[i];
1397 if (path->slots[i] + 1 < btrfs_header_nritems(leaf)) {
1402 free_extent_buffer(path->nodes[*level]);
1403 path->nodes[*level] = NULL;
1404 BUG_ON(*level > wc->active_node);
1405 if (*level == wc->active_node)
1406 leave_shared_node(root, wc, *level);
1413 static int check_root_dir(struct inode_record *rec)
1415 struct inode_backref *backref;
1418 if (!rec->found_inode_item || rec->errors)
1420 if (rec->nlink != 1 || rec->found_link != 0)
1422 if (list_empty(&rec->backrefs))
1424 backref = list_entry(rec->backrefs.next, struct inode_backref, list);
1425 if (!backref->found_inode_ref)
1427 if (backref->index != 0 || backref->namelen != 2 ||
1428 memcmp(backref->name, "..", 2))
1430 if (backref->found_dir_index || backref->found_dir_item)
1437 static int repair_inode_isize(struct btrfs_trans_handle *trans,
1438 struct btrfs_root *root, struct btrfs_path *path,
1439 struct inode_record *rec)
1441 struct btrfs_inode_item *ei;
1442 struct btrfs_key key;
1445 key.objectid = rec->ino;
1446 key.type = BTRFS_INODE_ITEM_KEY;
1447 key.offset = (u64)-1;
1449 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
1453 if (!path->slots[0]) {
1460 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
1461 if (key.objectid != rec->ino) {
1466 ei = btrfs_item_ptr(path->nodes[0], path->slots[0],
1467 struct btrfs_inode_item);
1468 btrfs_set_inode_size(path->nodes[0], ei, rec->found_size);
1469 btrfs_mark_buffer_dirty(path->nodes[0]);
1470 rec->errors &= ~I_ERR_DIR_ISIZE_WRONG;
1471 printf("reset isize for dir %Lu root %Lu\n", rec->ino,
1472 root->root_key.objectid);
1474 btrfs_release_path(path);
1478 static int repair_inode_orphan_item(struct btrfs_trans_handle *trans,
1479 struct btrfs_root *root,
1480 struct btrfs_path *path,
1481 struct inode_record *rec)
1483 struct btrfs_key key;
1486 key.objectid = BTRFS_ORPHAN_OBJECTID;
1487 key.type = BTRFS_ORPHAN_ITEM_KEY;
1488 key.offset = rec->ino;
1490 ret = btrfs_insert_empty_item(trans, root, path, &key, 0);
1491 btrfs_release_path(path);
1493 rec->errors &= ~I_ERR_NO_ORPHAN_ITEM;
1497 static int try_repair_inode(struct btrfs_root *root, struct inode_record *rec)
1499 struct btrfs_trans_handle *trans;
1500 struct btrfs_path *path;
1503 /* So far we just fix dir isize wrong */
1504 if (!(rec->errors & (I_ERR_DIR_ISIZE_WRONG | I_ERR_NO_ORPHAN_ITEM)))
1507 path = btrfs_alloc_path();
1511 trans = btrfs_start_transaction(root, 1);
1512 if (IS_ERR(trans)) {
1513 btrfs_free_path(path);
1514 return PTR_ERR(trans);
1517 if (rec->errors & I_ERR_DIR_ISIZE_WRONG)
1518 ret = repair_inode_isize(trans, root, path, rec);
1519 if (!ret && rec->errors & I_ERR_NO_ORPHAN_ITEM)
1520 ret = repair_inode_orphan_item(trans, root, path, rec);
1521 btrfs_commit_transaction(trans, root);
1522 btrfs_free_path(path);
1526 static int check_inode_recs(struct btrfs_root *root,
1527 struct cache_tree *inode_cache)
1529 struct cache_extent *cache;
1530 struct ptr_node *node;
1531 struct inode_record *rec;
1532 struct inode_backref *backref;
1535 u64 root_dirid = btrfs_root_dirid(&root->root_item);
1537 if (btrfs_root_refs(&root->root_item) == 0) {
1538 if (!cache_tree_empty(inode_cache))
1539 fprintf(stderr, "warning line %d\n", __LINE__);
1543 rec = get_inode_rec(inode_cache, root_dirid, 0);
1545 ret = check_root_dir(rec);
1547 fprintf(stderr, "root %llu root dir %llu error\n",
1548 (unsigned long long)root->root_key.objectid,
1549 (unsigned long long)root_dirid);
1553 fprintf(stderr, "root %llu root dir %llu not found\n",
1554 (unsigned long long)root->root_key.objectid,
1555 (unsigned long long)root_dirid);
1559 cache = search_cache_extent(inode_cache, 0);
1562 node = container_of(cache, struct ptr_node, cache);
1564 remove_cache_extent(inode_cache, &node->cache);
1566 if (rec->ino == root_dirid ||
1567 rec->ino == BTRFS_ORPHAN_OBJECTID) {
1568 free_inode_rec(rec);
1572 if (rec->errors & I_ERR_NO_ORPHAN_ITEM) {
1573 ret = check_orphan_item(root, rec->ino);
1575 rec->errors &= ~I_ERR_NO_ORPHAN_ITEM;
1576 if (can_free_inode_rec(rec)) {
1577 free_inode_rec(rec);
1583 ret = try_repair_inode(root, rec);
1584 if (ret == 0 && can_free_inode_rec(rec)) {
1585 free_inode_rec(rec);
1592 if (!rec->found_inode_item)
1593 rec->errors |= I_ERR_NO_INODE_ITEM;
1594 if (rec->found_link != rec->nlink)
1595 rec->errors |= I_ERR_LINK_COUNT_WRONG;
1596 fprintf(stderr, "root %llu inode %llu errors %x",
1597 (unsigned long long) root->root_key.objectid,
1598 (unsigned long long) rec->ino, rec->errors);
1599 print_inode_error(rec->errors);
1600 list_for_each_entry(backref, &rec->backrefs, list) {
1601 if (!backref->found_dir_item)
1602 backref->errors |= REF_ERR_NO_DIR_ITEM;
1603 if (!backref->found_dir_index)
1604 backref->errors |= REF_ERR_NO_DIR_INDEX;
1605 if (!backref->found_inode_ref)
1606 backref->errors |= REF_ERR_NO_INODE_REF;
1607 fprintf(stderr, "\tunresolved ref dir %llu index %llu"
1608 " namelen %u name %s filetype %d error %x",
1609 (unsigned long long)backref->dir,
1610 (unsigned long long)backref->index,
1611 backref->namelen, backref->name,
1612 backref->filetype, backref->errors);
1613 print_ref_error(backref->errors);
1615 free_inode_rec(rec);
1617 return (error > 0) ? -1 : 0;
1620 static struct root_record *get_root_rec(struct cache_tree *root_cache,
1623 struct cache_extent *cache;
1624 struct root_record *rec = NULL;
1627 cache = lookup_cache_extent(root_cache, objectid, 1);
1629 rec = container_of(cache, struct root_record, cache);
1631 rec = calloc(1, sizeof(*rec));
1632 rec->objectid = objectid;
1633 INIT_LIST_HEAD(&rec->backrefs);
1634 rec->cache.start = objectid;
1635 rec->cache.size = 1;
1637 ret = insert_cache_extent(root_cache, &rec->cache);
1643 static struct root_backref *get_root_backref(struct root_record *rec,
1644 u64 ref_root, u64 dir, u64 index,
1645 const char *name, int namelen)
1647 struct root_backref *backref;
1649 list_for_each_entry(backref, &rec->backrefs, list) {
1650 if (backref->ref_root != ref_root || backref->dir != dir ||
1651 backref->namelen != namelen)
1653 if (memcmp(name, backref->name, namelen))
1658 backref = malloc(sizeof(*backref) + namelen + 1);
1659 memset(backref, 0, sizeof(*backref));
1660 backref->ref_root = ref_root;
1662 backref->index = index;
1663 backref->namelen = namelen;
1664 memcpy(backref->name, name, namelen);
1665 backref->name[namelen] = '\0';
1666 list_add_tail(&backref->list, &rec->backrefs);
1670 static void free_root_record(struct cache_extent *cache)
1672 struct root_record *rec;
1673 struct root_backref *backref;
1675 rec = container_of(cache, struct root_record, cache);
1676 while (!list_empty(&rec->backrefs)) {
1677 backref = list_entry(rec->backrefs.next,
1678 struct root_backref, list);
1679 list_del(&backref->list);
1686 FREE_EXTENT_CACHE_BASED_TREE(root_recs, free_root_record);
1688 static int add_root_backref(struct cache_tree *root_cache,
1689 u64 root_id, u64 ref_root, u64 dir, u64 index,
1690 const char *name, int namelen,
1691 int item_type, int errors)
1693 struct root_record *rec;
1694 struct root_backref *backref;
1696 rec = get_root_rec(root_cache, root_id);
1697 backref = get_root_backref(rec, ref_root, dir, index, name, namelen);
1699 backref->errors |= errors;
1701 if (item_type != BTRFS_DIR_ITEM_KEY) {
1702 if (backref->found_dir_index || backref->found_back_ref ||
1703 backref->found_forward_ref) {
1704 if (backref->index != index)
1705 backref->errors |= REF_ERR_INDEX_UNMATCH;
1707 backref->index = index;
1711 if (item_type == BTRFS_DIR_ITEM_KEY) {
1712 if (backref->found_forward_ref)
1714 backref->found_dir_item = 1;
1715 } else if (item_type == BTRFS_DIR_INDEX_KEY) {
1716 backref->found_dir_index = 1;
1717 } else if (item_type == BTRFS_ROOT_REF_KEY) {
1718 if (backref->found_forward_ref)
1719 backref->errors |= REF_ERR_DUP_ROOT_REF;
1720 else if (backref->found_dir_item)
1722 backref->found_forward_ref = 1;
1723 } else if (item_type == BTRFS_ROOT_BACKREF_KEY) {
1724 if (backref->found_back_ref)
1725 backref->errors |= REF_ERR_DUP_ROOT_BACKREF;
1726 backref->found_back_ref = 1;
1731 if (backref->found_forward_ref && backref->found_dir_item)
1732 backref->reachable = 1;
1736 static int merge_root_recs(struct btrfs_root *root,
1737 struct cache_tree *src_cache,
1738 struct cache_tree *dst_cache)
1740 struct cache_extent *cache;
1741 struct ptr_node *node;
1742 struct inode_record *rec;
1743 struct inode_backref *backref;
1745 if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) {
1746 free_inode_recs_tree(src_cache);
1751 cache = search_cache_extent(src_cache, 0);
1754 node = container_of(cache, struct ptr_node, cache);
1756 remove_cache_extent(src_cache, &node->cache);
1759 if (!is_child_root(root, root->objectid, rec->ino))
1762 list_for_each_entry(backref, &rec->backrefs, list) {
1763 BUG_ON(backref->found_inode_ref);
1764 if (backref->found_dir_item)
1765 add_root_backref(dst_cache, rec->ino,
1766 root->root_key.objectid, backref->dir,
1767 backref->index, backref->name,
1768 backref->namelen, BTRFS_DIR_ITEM_KEY,
1770 if (backref->found_dir_index)
1771 add_root_backref(dst_cache, rec->ino,
1772 root->root_key.objectid, backref->dir,
1773 backref->index, backref->name,
1774 backref->namelen, BTRFS_DIR_INDEX_KEY,
1778 free_inode_rec(rec);
1783 static int check_root_refs(struct btrfs_root *root,
1784 struct cache_tree *root_cache)
1786 struct root_record *rec;
1787 struct root_record *ref_root;
1788 struct root_backref *backref;
1789 struct cache_extent *cache;
1795 rec = get_root_rec(root_cache, BTRFS_FS_TREE_OBJECTID);
1798 /* fixme: this can not detect circular references */
1801 cache = search_cache_extent(root_cache, 0);
1805 rec = container_of(cache, struct root_record, cache);
1806 cache = next_cache_extent(cache);
1808 if (rec->found_ref == 0)
1811 list_for_each_entry(backref, &rec->backrefs, list) {
1812 if (!backref->reachable)
1815 ref_root = get_root_rec(root_cache,
1817 if (ref_root->found_ref > 0)
1820 backref->reachable = 0;
1822 if (rec->found_ref == 0)
1828 cache = search_cache_extent(root_cache, 0);
1832 rec = container_of(cache, struct root_record, cache);
1833 cache = next_cache_extent(cache);
1835 if (rec->found_ref == 0 &&
1836 rec->objectid >= BTRFS_FIRST_FREE_OBJECTID &&
1837 rec->objectid <= BTRFS_LAST_FREE_OBJECTID) {
1838 ret = check_orphan_item(root->fs_info->tree_root,
1844 * If we don't have a root item then we likely just have
1845 * a dir item in a snapshot for this root but no actual
1846 * ref key or anything so it's meaningless.
1848 if (!rec->found_root_item)
1851 fprintf(stderr, "fs tree %llu not referenced\n",
1852 (unsigned long long)rec->objectid);
1856 if (rec->found_ref > 0 && !rec->found_root_item)
1858 list_for_each_entry(backref, &rec->backrefs, list) {
1859 if (!backref->found_dir_item)
1860 backref->errors |= REF_ERR_NO_DIR_ITEM;
1861 if (!backref->found_dir_index)
1862 backref->errors |= REF_ERR_NO_DIR_INDEX;
1863 if (!backref->found_back_ref)
1864 backref->errors |= REF_ERR_NO_ROOT_BACKREF;
1865 if (!backref->found_forward_ref)
1866 backref->errors |= REF_ERR_NO_ROOT_REF;
1867 if (backref->reachable && backref->errors)
1874 fprintf(stderr, "fs tree %llu refs %u %s\n",
1875 (unsigned long long)rec->objectid, rec->found_ref,
1876 rec->found_root_item ? "" : "not found");
1878 list_for_each_entry(backref, &rec->backrefs, list) {
1879 if (!backref->reachable)
1881 if (!backref->errors && rec->found_root_item)
1883 fprintf(stderr, "\tunresolved ref root %llu dir %llu"
1884 " index %llu namelen %u name %s error %x\n",
1885 (unsigned long long)backref->ref_root,
1886 (unsigned long long)backref->dir,
1887 (unsigned long long)backref->index,
1888 backref->namelen, backref->name,
1892 return errors > 0 ? 1 : 0;
1895 static int process_root_ref(struct extent_buffer *eb, int slot,
1896 struct btrfs_key *key,
1897 struct cache_tree *root_cache)
1903 struct btrfs_root_ref *ref;
1904 char namebuf[BTRFS_NAME_LEN];
1907 ref = btrfs_item_ptr(eb, slot, struct btrfs_root_ref);
1909 dirid = btrfs_root_ref_dirid(eb, ref);
1910 index = btrfs_root_ref_sequence(eb, ref);
1911 name_len = btrfs_root_ref_name_len(eb, ref);
1913 if (name_len <= BTRFS_NAME_LEN) {
1917 len = BTRFS_NAME_LEN;
1918 error = REF_ERR_NAME_TOO_LONG;
1920 read_extent_buffer(eb, namebuf, (unsigned long)(ref + 1), len);
1922 if (key->type == BTRFS_ROOT_REF_KEY) {
1923 add_root_backref(root_cache, key->offset, key->objectid, dirid,
1924 index, namebuf, len, key->type, error);
1926 add_root_backref(root_cache, key->objectid, key->offset, dirid,
1927 index, namebuf, len, key->type, error);
1932 static int check_fs_root(struct btrfs_root *root,
1933 struct cache_tree *root_cache,
1934 struct walk_control *wc)
1939 struct btrfs_path path;
1940 struct shared_node root_node;
1941 struct root_record *rec;
1942 struct btrfs_root_item *root_item = &root->root_item;
1944 if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) {
1945 rec = get_root_rec(root_cache, root->root_key.objectid);
1946 if (btrfs_root_refs(root_item) > 0)
1947 rec->found_root_item = 1;
1950 btrfs_init_path(&path);
1951 memset(&root_node, 0, sizeof(root_node));
1952 cache_tree_init(&root_node.root_cache);
1953 cache_tree_init(&root_node.inode_cache);
1955 level = btrfs_header_level(root->node);
1956 memset(wc->nodes, 0, sizeof(wc->nodes));
1957 wc->nodes[level] = &root_node;
1958 wc->active_node = level;
1959 wc->root_level = level;
1961 if (btrfs_root_refs(root_item) > 0 ||
1962 btrfs_disk_key_objectid(&root_item->drop_progress) == 0) {
1963 path.nodes[level] = root->node;
1964 extent_buffer_get(root->node);
1965 path.slots[level] = 0;
1967 struct btrfs_key key;
1968 struct btrfs_disk_key found_key;
1970 btrfs_disk_key_to_cpu(&key, &root_item->drop_progress);
1971 level = root_item->drop_level;
1972 path.lowest_level = level;
1973 wret = btrfs_search_slot(NULL, root, &key, &path, 0, 0);
1975 btrfs_node_key(path.nodes[level], &found_key,
1977 WARN_ON(memcmp(&found_key, &root_item->drop_progress,
1978 sizeof(found_key)));
1982 wret = walk_down_tree(root, &path, wc, &level);
1988 wret = walk_up_tree(root, &path, wc, &level);
1994 btrfs_release_path(&path);
1996 merge_root_recs(root, &root_node.root_cache, root_cache);
1998 if (root_node.current) {
1999 root_node.current->checked = 1;
2000 maybe_free_inode_rec(&root_node.inode_cache,
2004 ret = check_inode_recs(root, &root_node.inode_cache);
2008 static int fs_root_objectid(u64 objectid)
2010 if (objectid == BTRFS_FS_TREE_OBJECTID ||
2011 objectid == BTRFS_TREE_RELOC_OBJECTID ||
2012 objectid == BTRFS_DATA_RELOC_TREE_OBJECTID ||
2013 (objectid >= BTRFS_FIRST_FREE_OBJECTID &&
2014 objectid <= BTRFS_LAST_FREE_OBJECTID))
2019 static int check_fs_roots(struct btrfs_root *root,
2020 struct cache_tree *root_cache)
2022 struct btrfs_path path;
2023 struct btrfs_key key;
2024 struct walk_control wc;
2025 struct extent_buffer *leaf;
2026 struct btrfs_root *tmp_root;
2027 struct btrfs_root *tree_root = root->fs_info->tree_root;
2032 * Just in case we made any changes to the extent tree that weren't
2033 * reflected into the free space cache yet.
2036 reset_cached_block_groups(root->fs_info);
2037 memset(&wc, 0, sizeof(wc));
2038 cache_tree_init(&wc.shared);
2039 btrfs_init_path(&path);
2043 key.type = BTRFS_ROOT_ITEM_KEY;
2044 ret = btrfs_search_slot(NULL, tree_root, &key, &path, 0, 0);
2047 leaf = path.nodes[0];
2048 if (path.slots[0] >= btrfs_header_nritems(leaf)) {
2049 ret = btrfs_next_leaf(tree_root, &path);
2052 leaf = path.nodes[0];
2054 btrfs_item_key_to_cpu(leaf, &key, path.slots[0]);
2055 if (key.type == BTRFS_ROOT_ITEM_KEY &&
2056 fs_root_objectid(key.objectid)) {
2057 key.offset = (u64)-1;
2058 tmp_root = btrfs_read_fs_root(root->fs_info, &key);
2059 if (IS_ERR(tmp_root)) {
2063 ret = check_fs_root(tmp_root, root_cache, &wc);
2066 } else if (key.type == BTRFS_ROOT_REF_KEY ||
2067 key.type == BTRFS_ROOT_BACKREF_KEY) {
2068 process_root_ref(leaf, path.slots[0], &key,
2074 btrfs_release_path(&path);
2076 if (!cache_tree_empty(&wc.shared))
2077 fprintf(stderr, "warning line %d\n", __LINE__);
2082 static int all_backpointers_checked(struct extent_record *rec, int print_errs)
2084 struct list_head *cur = rec->backrefs.next;
2085 struct extent_backref *back;
2086 struct tree_backref *tback;
2087 struct data_backref *dback;
2091 while(cur != &rec->backrefs) {
2092 back = list_entry(cur, struct extent_backref, list);
2094 if (!back->found_extent_tree) {
2098 if (back->is_data) {
2099 dback = (struct data_backref *)back;
2100 fprintf(stderr, "Backref %llu %s %llu"
2101 " owner %llu offset %llu num_refs %lu"
2102 " not found in extent tree\n",
2103 (unsigned long long)rec->start,
2104 back->full_backref ?
2106 back->full_backref ?
2107 (unsigned long long)dback->parent:
2108 (unsigned long long)dback->root,
2109 (unsigned long long)dback->owner,
2110 (unsigned long long)dback->offset,
2111 (unsigned long)dback->num_refs);
2113 tback = (struct tree_backref *)back;
2114 fprintf(stderr, "Backref %llu parent %llu"
2115 " root %llu not found in extent tree\n",
2116 (unsigned long long)rec->start,
2117 (unsigned long long)tback->parent,
2118 (unsigned long long)tback->root);
2121 if (!back->is_data && !back->found_ref) {
2125 tback = (struct tree_backref *)back;
2126 fprintf(stderr, "Backref %llu %s %llu not referenced back %p\n",
2127 (unsigned long long)rec->start,
2128 back->full_backref ? "parent" : "root",
2129 back->full_backref ?
2130 (unsigned long long)tback->parent :
2131 (unsigned long long)tback->root, back);
2133 if (back->is_data) {
2134 dback = (struct data_backref *)back;
2135 if (dback->found_ref != dback->num_refs) {
2139 fprintf(stderr, "Incorrect local backref count"
2140 " on %llu %s %llu owner %llu"
2141 " offset %llu found %u wanted %u back %p\n",
2142 (unsigned long long)rec->start,
2143 back->full_backref ?
2145 back->full_backref ?
2146 (unsigned long long)dback->parent:
2147 (unsigned long long)dback->root,
2148 (unsigned long long)dback->owner,
2149 (unsigned long long)dback->offset,
2150 dback->found_ref, dback->num_refs, back);
2152 if (dback->disk_bytenr != rec->start) {
2156 fprintf(stderr, "Backref disk bytenr does not"
2157 " match extent record, bytenr=%llu, "
2158 "ref bytenr=%llu\n",
2159 (unsigned long long)rec->start,
2160 (unsigned long long)dback->disk_bytenr);
2163 if (dback->bytes != rec->nr) {
2167 fprintf(stderr, "Backref bytes do not match "
2168 "extent backref, bytenr=%llu, ref "
2169 "bytes=%llu, backref bytes=%llu\n",
2170 (unsigned long long)rec->start,
2171 (unsigned long long)rec->nr,
2172 (unsigned long long)dback->bytes);
2175 if (!back->is_data) {
2178 dback = (struct data_backref *)back;
2179 found += dback->found_ref;
2182 if (found != rec->refs) {
2186 fprintf(stderr, "Incorrect global backref count "
2187 "on %llu found %llu wanted %llu\n",
2188 (unsigned long long)rec->start,
2189 (unsigned long long)found,
2190 (unsigned long long)rec->refs);
2196 static int free_all_extent_backrefs(struct extent_record *rec)
2198 struct extent_backref *back;
2199 struct list_head *cur;
2200 while (!list_empty(&rec->backrefs)) {
2201 cur = rec->backrefs.next;
2202 back = list_entry(cur, struct extent_backref, list);
2209 static void free_extent_record_cache(struct btrfs_fs_info *fs_info,
2210 struct cache_tree *extent_cache)
2212 struct cache_extent *cache;
2213 struct extent_record *rec;
2216 cache = first_cache_extent(extent_cache);
2219 rec = container_of(cache, struct extent_record, cache);
2220 btrfs_unpin_extent(fs_info, rec->start, rec->max_size);
2221 remove_cache_extent(extent_cache, cache);
2222 free_all_extent_backrefs(rec);
2227 static int maybe_free_extent_rec(struct cache_tree *extent_cache,
2228 struct extent_record *rec)
2230 if (rec->content_checked && rec->owner_ref_checked &&
2231 rec->extent_item_refs == rec->refs && rec->refs > 0 &&
2232 rec->num_duplicates == 0 && !all_backpointers_checked(rec, 0)) {
2233 remove_cache_extent(extent_cache, &rec->cache);
2234 free_all_extent_backrefs(rec);
2235 list_del_init(&rec->list);
2241 static int check_owner_ref(struct btrfs_root *root,
2242 struct extent_record *rec,
2243 struct extent_buffer *buf)
2245 struct extent_backref *node;
2246 struct tree_backref *back;
2247 struct btrfs_root *ref_root;
2248 struct btrfs_key key;
2249 struct btrfs_path path;
2250 struct extent_buffer *parent;
2255 list_for_each_entry(node, &rec->backrefs, list) {
2258 if (!node->found_ref)
2260 if (node->full_backref)
2262 back = (struct tree_backref *)node;
2263 if (btrfs_header_owner(buf) == back->root)
2266 BUG_ON(rec->is_root);
2268 /* try to find the block by search corresponding fs tree */
2269 key.objectid = btrfs_header_owner(buf);
2270 key.type = BTRFS_ROOT_ITEM_KEY;
2271 key.offset = (u64)-1;
2273 ref_root = btrfs_read_fs_root(root->fs_info, &key);
2274 if (IS_ERR(ref_root))
2277 level = btrfs_header_level(buf);
2279 btrfs_item_key_to_cpu(buf, &key, 0);
2281 btrfs_node_key_to_cpu(buf, &key, 0);
2283 btrfs_init_path(&path);
2284 path.lowest_level = level + 1;
2285 ret = btrfs_search_slot(NULL, ref_root, &key, &path, 0, 0);
2289 parent = path.nodes[level + 1];
2290 if (parent && buf->start == btrfs_node_blockptr(parent,
2291 path.slots[level + 1]))
2294 btrfs_release_path(&path);
2295 return found ? 0 : 1;
2298 static int is_extent_tree_record(struct extent_record *rec)
2300 struct list_head *cur = rec->backrefs.next;
2301 struct extent_backref *node;
2302 struct tree_backref *back;
2305 while(cur != &rec->backrefs) {
2306 node = list_entry(cur, struct extent_backref, list);
2310 back = (struct tree_backref *)node;
2311 if (node->full_backref)
2313 if (back->root == BTRFS_EXTENT_TREE_OBJECTID)
2320 static int record_bad_block_io(struct btrfs_fs_info *info,
2321 struct cache_tree *extent_cache,
2324 struct extent_record *rec;
2325 struct cache_extent *cache;
2326 struct btrfs_key key;
2328 cache = lookup_cache_extent(extent_cache, start, len);
2332 rec = container_of(cache, struct extent_record, cache);
2333 if (!is_extent_tree_record(rec))
2336 btrfs_disk_key_to_cpu(&key, &rec->parent_key);
2337 return btrfs_add_corrupt_extent_record(info, &key, start, len, 0);
2340 static int swap_values(struct btrfs_root *root, struct btrfs_path *path,
2341 struct extent_buffer *buf, int slot)
2343 if (btrfs_header_level(buf)) {
2344 struct btrfs_key_ptr ptr1, ptr2;
2346 read_extent_buffer(buf, &ptr1, btrfs_node_key_ptr_offset(slot),
2347 sizeof(struct btrfs_key_ptr));
2348 read_extent_buffer(buf, &ptr2,
2349 btrfs_node_key_ptr_offset(slot + 1),
2350 sizeof(struct btrfs_key_ptr));
2351 write_extent_buffer(buf, &ptr1,
2352 btrfs_node_key_ptr_offset(slot + 1),
2353 sizeof(struct btrfs_key_ptr));
2354 write_extent_buffer(buf, &ptr2,
2355 btrfs_node_key_ptr_offset(slot),
2356 sizeof(struct btrfs_key_ptr));
2358 struct btrfs_disk_key key;
2359 btrfs_node_key(buf, &key, 0);
2360 btrfs_fixup_low_keys(root, path, &key,
2361 btrfs_header_level(buf) + 1);
2364 struct btrfs_item *item1, *item2;
2365 struct btrfs_key k1, k2;
2366 char *item1_data, *item2_data;
2367 u32 item1_offset, item2_offset, item1_size, item2_size;
2369 item1 = btrfs_item_nr(slot);
2370 item2 = btrfs_item_nr(slot + 1);
2371 btrfs_item_key_to_cpu(buf, &k1, slot);
2372 btrfs_item_key_to_cpu(buf, &k2, slot + 1);
2373 item1_offset = btrfs_item_offset(buf, item1);
2374 item2_offset = btrfs_item_offset(buf, item2);
2375 item1_size = btrfs_item_size(buf, item1);
2376 item2_size = btrfs_item_size(buf, item2);
2378 item1_data = malloc(item1_size);
2381 item2_data = malloc(item2_size);
2387 read_extent_buffer(buf, item1_data, item1_offset, item1_size);
2388 read_extent_buffer(buf, item2_data, item2_offset, item2_size);
2390 write_extent_buffer(buf, item1_data, item2_offset, item2_size);
2391 write_extent_buffer(buf, item2_data, item1_offset, item1_size);
2395 btrfs_set_item_offset(buf, item1, item2_offset);
2396 btrfs_set_item_offset(buf, item2, item1_offset);
2397 btrfs_set_item_size(buf, item1, item2_size);
2398 btrfs_set_item_size(buf, item2, item1_size);
2400 path->slots[0] = slot;
2401 btrfs_set_item_key_unsafe(root, path, &k2);
2402 path->slots[0] = slot + 1;
2403 btrfs_set_item_key_unsafe(root, path, &k1);
2409 * Attempt to fix basic block failures. Currently we only handle bad key
2410 * orders, we will cycle through the keys and swap them if necessary.
2412 static int try_to_fix_bad_block(struct btrfs_trans_handle *trans,
2413 struct btrfs_root *root,
2414 struct extent_buffer *buf,
2415 struct btrfs_disk_key *parent_key,
2416 enum btrfs_tree_block_status status)
2418 struct btrfs_path *path;
2419 struct btrfs_key k1, k2;
2423 if (status != BTRFS_TREE_BLOCK_BAD_KEY_ORDER)
2426 k1.objectid = btrfs_header_owner(buf);
2427 k1.type = BTRFS_ROOT_ITEM_KEY;
2428 k1.offset = (u64)-1;
2430 root = btrfs_read_fs_root(root->fs_info, &k1);
2434 path = btrfs_alloc_path();
2438 path->lowest_level = btrfs_header_level(buf);
2439 path->skip_check_block = 1;
2440 if (btrfs_header_level(buf))
2441 btrfs_node_key_to_cpu(buf, &k1, 0);
2443 btrfs_item_key_to_cpu(buf, &k1, 0);
2445 ret = btrfs_search_slot(trans, root, &k1, path, 0, 1);
2447 btrfs_free_path(path);
2451 buf = path->nodes[0];
2452 for (i = 0; i < btrfs_header_nritems(buf) - 1; i++) {
2453 if (btrfs_header_level(buf)) {
2454 btrfs_node_key_to_cpu(buf, &k1, i);
2455 btrfs_node_key_to_cpu(buf, &k2, i + 1);
2457 btrfs_item_key_to_cpu(buf, &k1, i);
2458 btrfs_item_key_to_cpu(buf, &k2, i + 1);
2460 if (btrfs_comp_cpu_keys(&k1, &k2) < 0)
2462 ret = swap_values(root, path, buf, i);
2465 btrfs_mark_buffer_dirty(buf);
2469 btrfs_free_path(path);
2473 static int check_block(struct btrfs_trans_handle *trans,
2474 struct btrfs_root *root,
2475 struct cache_tree *extent_cache,
2476 struct extent_buffer *buf, u64 flags)
2478 struct extent_record *rec;
2479 struct cache_extent *cache;
2480 struct btrfs_key key;
2481 enum btrfs_tree_block_status status;
2485 cache = lookup_cache_extent(extent_cache, buf->start, buf->len);
2488 rec = container_of(cache, struct extent_record, cache);
2489 rec->generation = btrfs_header_generation(buf);
2491 level = btrfs_header_level(buf);
2492 if (btrfs_header_nritems(buf) > 0) {
2495 btrfs_item_key_to_cpu(buf, &key, 0);
2497 btrfs_node_key_to_cpu(buf, &key, 0);
2499 rec->info_objectid = key.objectid;
2501 rec->info_level = level;
2503 if (btrfs_is_leaf(buf))
2504 status = btrfs_check_leaf(root, &rec->parent_key, buf);
2506 status = btrfs_check_node(root, &rec->parent_key, buf);
2508 if (status != BTRFS_TREE_BLOCK_CLEAN) {
2510 status = try_to_fix_bad_block(trans, root, buf,
2513 if (status != BTRFS_TREE_BLOCK_CLEAN) {
2515 fprintf(stderr, "bad block %llu\n",
2516 (unsigned long long)buf->start);
2519 * Signal to callers we need to start the scan over
2520 * again since we'll have cow'ed blocks.
2525 rec->content_checked = 1;
2526 if (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)
2527 rec->owner_ref_checked = 1;
2529 ret = check_owner_ref(root, rec, buf);
2531 rec->owner_ref_checked = 1;
2535 maybe_free_extent_rec(extent_cache, rec);
2539 static struct tree_backref *find_tree_backref(struct extent_record *rec,
2540 u64 parent, u64 root)
2542 struct list_head *cur = rec->backrefs.next;
2543 struct extent_backref *node;
2544 struct tree_backref *back;
2546 while(cur != &rec->backrefs) {
2547 node = list_entry(cur, struct extent_backref, list);
2551 back = (struct tree_backref *)node;
2553 if (!node->full_backref)
2555 if (parent == back->parent)
2558 if (node->full_backref)
2560 if (back->root == root)
2567 static struct tree_backref *alloc_tree_backref(struct extent_record *rec,
2568 u64 parent, u64 root)
2570 struct tree_backref *ref = malloc(sizeof(*ref));
2571 memset(&ref->node, 0, sizeof(ref->node));
2573 ref->parent = parent;
2574 ref->node.full_backref = 1;
2577 ref->node.full_backref = 0;
2579 list_add_tail(&ref->node.list, &rec->backrefs);
2584 static struct data_backref *find_data_backref(struct extent_record *rec,
2585 u64 parent, u64 root,
2586 u64 owner, u64 offset,
2588 u64 disk_bytenr, u64 bytes)
2590 struct list_head *cur = rec->backrefs.next;
2591 struct extent_backref *node;
2592 struct data_backref *back;
2594 while(cur != &rec->backrefs) {
2595 node = list_entry(cur, struct extent_backref, list);
2599 back = (struct data_backref *)node;
2601 if (!node->full_backref)
2603 if (parent == back->parent)
2606 if (node->full_backref)
2608 if (back->root == root && back->owner == owner &&
2609 back->offset == offset) {
2610 if (found_ref && node->found_ref &&
2611 (back->bytes != bytes ||
2612 back->disk_bytenr != disk_bytenr))
2621 static struct data_backref *alloc_data_backref(struct extent_record *rec,
2622 u64 parent, u64 root,
2623 u64 owner, u64 offset,
2626 struct data_backref *ref = malloc(sizeof(*ref));
2627 memset(&ref->node, 0, sizeof(ref->node));
2628 ref->node.is_data = 1;
2631 ref->parent = parent;
2634 ref->node.full_backref = 1;
2638 ref->offset = offset;
2639 ref->node.full_backref = 0;
2641 ref->bytes = max_size;
2644 list_add_tail(&ref->node.list, &rec->backrefs);
2645 if (max_size > rec->max_size)
2646 rec->max_size = max_size;
2650 static int add_extent_rec(struct cache_tree *extent_cache,
2651 struct btrfs_key *parent_key, u64 parent_gen,
2652 u64 start, u64 nr, u64 extent_item_refs,
2653 int is_root, int inc_ref, int set_checked,
2654 int metadata, int extent_rec, u64 max_size)
2656 struct extent_record *rec;
2657 struct cache_extent *cache;
2661 cache = lookup_cache_extent(extent_cache, start, nr);
2663 rec = container_of(cache, struct extent_record, cache);
2667 rec->nr = max(nr, max_size);
2670 * We need to make sure to reset nr to whatever the extent
2671 * record says was the real size, this way we can compare it to
2675 if (start != rec->start || rec->found_rec) {
2676 struct extent_record *tmp;
2679 if (list_empty(&rec->list))
2680 list_add_tail(&rec->list,
2681 &duplicate_extents);
2684 * We have to do this song and dance in case we
2685 * find an extent record that falls inside of
2686 * our current extent record but does not have
2687 * the same objectid.
2689 tmp = malloc(sizeof(*tmp));
2693 tmp->max_size = max_size;
2696 tmp->metadata = metadata;
2697 tmp->extent_item_refs = extent_item_refs;
2698 INIT_LIST_HEAD(&tmp->list);
2699 list_add_tail(&tmp->list, &rec->dups);
2700 rec->num_duplicates++;
2707 if (extent_item_refs && !dup) {
2708 if (rec->extent_item_refs) {
2709 fprintf(stderr, "block %llu rec "
2710 "extent_item_refs %llu, passed %llu\n",
2711 (unsigned long long)start,
2712 (unsigned long long)
2713 rec->extent_item_refs,
2714 (unsigned long long)extent_item_refs);
2716 rec->extent_item_refs = extent_item_refs;
2721 rec->content_checked = 1;
2722 rec->owner_ref_checked = 1;
2726 btrfs_cpu_key_to_disk(&rec->parent_key, parent_key);
2728 rec->parent_generation = parent_gen;
2730 if (rec->max_size < max_size)
2731 rec->max_size = max_size;
2733 maybe_free_extent_rec(extent_cache, rec);
2736 rec = malloc(sizeof(*rec));
2738 rec->max_size = max_size;
2739 rec->nr = max(nr, max_size);
2740 rec->found_rec = extent_rec;
2741 rec->content_checked = 0;
2742 rec->owner_ref_checked = 0;
2743 rec->num_duplicates = 0;
2744 rec->metadata = metadata;
2745 INIT_LIST_HEAD(&rec->backrefs);
2746 INIT_LIST_HEAD(&rec->dups);
2747 INIT_LIST_HEAD(&rec->list);
2759 if (extent_item_refs)
2760 rec->extent_item_refs = extent_item_refs;
2762 rec->extent_item_refs = 0;
2765 btrfs_cpu_key_to_disk(&rec->parent_key, parent_key);
2767 memset(&rec->parent_key, 0, sizeof(*parent_key));
2770 rec->parent_generation = parent_gen;
2772 rec->parent_generation = 0;
2774 rec->cache.start = start;
2775 rec->cache.size = nr;
2776 ret = insert_cache_extent(extent_cache, &rec->cache);
2780 rec->content_checked = 1;
2781 rec->owner_ref_checked = 1;
2786 static int add_tree_backref(struct cache_tree *extent_cache, u64 bytenr,
2787 u64 parent, u64 root, int found_ref)
2789 struct extent_record *rec;
2790 struct tree_backref *back;
2791 struct cache_extent *cache;
2793 cache = lookup_cache_extent(extent_cache, bytenr, 1);
2795 add_extent_rec(extent_cache, NULL, 0, bytenr,
2796 1, 0, 0, 0, 0, 1, 0, 0);
2797 cache = lookup_cache_extent(extent_cache, bytenr, 1);
2802 rec = container_of(cache, struct extent_record, cache);
2803 if (rec->start != bytenr) {
2807 back = find_tree_backref(rec, parent, root);
2809 back = alloc_tree_backref(rec, parent, root);
2812 if (back->node.found_ref) {
2813 fprintf(stderr, "Extent back ref already exists "
2814 "for %llu parent %llu root %llu \n",
2815 (unsigned long long)bytenr,
2816 (unsigned long long)parent,
2817 (unsigned long long)root);
2819 back->node.found_ref = 1;
2821 if (back->node.found_extent_tree) {
2822 fprintf(stderr, "Extent back ref already exists "
2823 "for %llu parent %llu root %llu \n",
2824 (unsigned long long)bytenr,
2825 (unsigned long long)parent,
2826 (unsigned long long)root);
2828 back->node.found_extent_tree = 1;
2833 static int add_data_backref(struct cache_tree *extent_cache, u64 bytenr,
2834 u64 parent, u64 root, u64 owner, u64 offset,
2835 u32 num_refs, int found_ref, u64 max_size)
2837 struct extent_record *rec;
2838 struct data_backref *back;
2839 struct cache_extent *cache;
2841 cache = lookup_cache_extent(extent_cache, bytenr, 1);
2843 add_extent_rec(extent_cache, NULL, 0, bytenr, 1, 0, 0, 0, 0,
2845 cache = lookup_cache_extent(extent_cache, bytenr, 1);
2850 rec = container_of(cache, struct extent_record, cache);
2851 if (rec->max_size < max_size)
2852 rec->max_size = max_size;
2855 * If found_ref is set then max_size is the real size and must match the
2856 * existing refs. So if we have already found a ref then we need to
2857 * make sure that this ref matches the existing one, otherwise we need
2858 * to add a new backref so we can notice that the backrefs don't match
2859 * and we need to figure out who is telling the truth. This is to
2860 * account for that awful fsync bug I introduced where we'd end up with
2861 * a btrfs_file_extent_item that would have its length include multiple
2862 * prealloc extents or point inside of a prealloc extent.
2864 back = find_data_backref(rec, parent, root, owner, offset, found_ref,
2867 back = alloc_data_backref(rec, parent, root, owner, offset,
2871 BUG_ON(num_refs != 1);
2872 if (back->node.found_ref)
2873 BUG_ON(back->bytes != max_size);
2874 back->node.found_ref = 1;
2875 back->found_ref += 1;
2876 back->bytes = max_size;
2877 back->disk_bytenr = bytenr;
2879 rec->content_checked = 1;
2880 rec->owner_ref_checked = 1;
2882 if (back->node.found_extent_tree) {
2883 fprintf(stderr, "Extent back ref already exists "
2884 "for %llu parent %llu root %llu"
2885 "owner %llu offset %llu num_refs %lu\n",
2886 (unsigned long long)bytenr,
2887 (unsigned long long)parent,
2888 (unsigned long long)root,
2889 (unsigned long long)owner,
2890 (unsigned long long)offset,
2891 (unsigned long)num_refs);
2893 back->num_refs = num_refs;
2894 back->node.found_extent_tree = 1;
2899 static int add_pending(struct cache_tree *pending,
2900 struct cache_tree *seen, u64 bytenr, u32 size)
2903 ret = add_cache_extent(seen, bytenr, size);
2906 add_cache_extent(pending, bytenr, size);
2910 static int pick_next_pending(struct cache_tree *pending,
2911 struct cache_tree *reada,
2912 struct cache_tree *nodes,
2913 u64 last, struct block_info *bits, int bits_nr,
2916 unsigned long node_start = last;
2917 struct cache_extent *cache;
2920 cache = search_cache_extent(reada, 0);
2922 bits[0].start = cache->start;
2923 bits[1].size = cache->size;
2928 if (node_start > 32768)
2929 node_start -= 32768;
2931 cache = search_cache_extent(nodes, node_start);
2933 cache = search_cache_extent(nodes, 0);
2936 cache = search_cache_extent(pending, 0);
2941 bits[ret].start = cache->start;
2942 bits[ret].size = cache->size;
2943 cache = next_cache_extent(cache);
2945 } while (cache && ret < bits_nr);
2951 bits[ret].start = cache->start;
2952 bits[ret].size = cache->size;
2953 cache = next_cache_extent(cache);
2955 } while (cache && ret < bits_nr);
2957 if (bits_nr - ret > 8) {
2958 u64 lookup = bits[0].start + bits[0].size;
2959 struct cache_extent *next;
2960 next = search_cache_extent(pending, lookup);
2962 if (next->start - lookup > 32768)
2964 bits[ret].start = next->start;
2965 bits[ret].size = next->size;
2966 lookup = next->start + next->size;
2970 next = next_cache_extent(next);
2978 static void free_chunk_record(struct cache_extent *cache)
2980 struct chunk_record *rec;
2982 rec = container_of(cache, struct chunk_record, cache);
2986 void free_chunk_cache_tree(struct cache_tree *chunk_cache)
2988 cache_tree_free_extents(chunk_cache, free_chunk_record);
2991 static void free_device_record(struct rb_node *node)
2993 struct device_record *rec;
2995 rec = container_of(node, struct device_record, node);
2999 FREE_RB_BASED_TREE(device_cache, free_device_record);
3001 int insert_block_group_record(struct block_group_tree *tree,
3002 struct block_group_record *bg_rec)
3006 ret = insert_cache_extent(&tree->tree, &bg_rec->cache);
3010 list_add_tail(&bg_rec->list, &tree->block_groups);
3014 static void free_block_group_record(struct cache_extent *cache)
3016 struct block_group_record *rec;
3018 rec = container_of(cache, struct block_group_record, cache);
3022 void free_block_group_tree(struct block_group_tree *tree)
3024 cache_tree_free_extents(&tree->tree, free_block_group_record);
3027 int insert_device_extent_record(struct device_extent_tree *tree,
3028 struct device_extent_record *de_rec)
3033 * Device extent is a bit different from the other extents, because
3034 * the extents which belong to the different devices may have the
3035 * same start and size, so we need use the special extent cache
3036 * search/insert functions.
3038 ret = insert_cache_extent2(&tree->tree, &de_rec->cache);
3042 list_add_tail(&de_rec->chunk_list, &tree->no_chunk_orphans);
3043 list_add_tail(&de_rec->device_list, &tree->no_device_orphans);
3047 static void free_device_extent_record(struct cache_extent *cache)
3049 struct device_extent_record *rec;
3051 rec = container_of(cache, struct device_extent_record, cache);
3055 void free_device_extent_tree(struct device_extent_tree *tree)
3057 cache_tree_free_extents(&tree->tree, free_device_extent_record);
3060 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
3061 static int process_extent_ref_v0(struct cache_tree *extent_cache,
3062 struct extent_buffer *leaf, int slot)
3064 struct btrfs_extent_ref_v0 *ref0;
3065 struct btrfs_key key;
3067 btrfs_item_key_to_cpu(leaf, &key, slot);
3068 ref0 = btrfs_item_ptr(leaf, slot, struct btrfs_extent_ref_v0);
3069 if (btrfs_ref_objectid_v0(leaf, ref0) < BTRFS_FIRST_FREE_OBJECTID) {
3070 add_tree_backref(extent_cache, key.objectid, key.offset, 0, 0);
3072 add_data_backref(extent_cache, key.objectid, key.offset, 0,
3073 0, 0, btrfs_ref_count_v0(leaf, ref0), 0, 0);
3079 struct chunk_record *btrfs_new_chunk_record(struct extent_buffer *leaf,
3080 struct btrfs_key *key,
3083 struct btrfs_chunk *ptr;
3084 struct chunk_record *rec;
3087 ptr = btrfs_item_ptr(leaf, slot, struct btrfs_chunk);
3088 num_stripes = btrfs_chunk_num_stripes(leaf, ptr);
3090 rec = malloc(btrfs_chunk_record_size(num_stripes));
3092 fprintf(stderr, "memory allocation failed\n");
3096 memset(rec, 0, btrfs_chunk_record_size(num_stripes));
3098 INIT_LIST_HEAD(&rec->list);
3099 INIT_LIST_HEAD(&rec->dextents);
3102 rec->cache.start = key->offset;
3103 rec->cache.size = btrfs_chunk_length(leaf, ptr);
3105 rec->generation = btrfs_header_generation(leaf);
3107 rec->objectid = key->objectid;
3108 rec->type = key->type;
3109 rec->offset = key->offset;
3111 rec->length = rec->cache.size;
3112 rec->owner = btrfs_chunk_owner(leaf, ptr);
3113 rec->stripe_len = btrfs_chunk_stripe_len(leaf, ptr);
3114 rec->type_flags = btrfs_chunk_type(leaf, ptr);
3115 rec->io_width = btrfs_chunk_io_width(leaf, ptr);
3116 rec->io_align = btrfs_chunk_io_align(leaf, ptr);
3117 rec->sector_size = btrfs_chunk_sector_size(leaf, ptr);
3118 rec->num_stripes = num_stripes;
3119 rec->sub_stripes = btrfs_chunk_sub_stripes(leaf, ptr);
3121 for (i = 0; i < rec->num_stripes; ++i) {
3122 rec->stripes[i].devid =
3123 btrfs_stripe_devid_nr(leaf, ptr, i);
3124 rec->stripes[i].offset =
3125 btrfs_stripe_offset_nr(leaf, ptr, i);
3126 read_extent_buffer(leaf, rec->stripes[i].dev_uuid,
3127 (unsigned long)btrfs_stripe_dev_uuid_nr(ptr, i),
3134 static int process_chunk_item(struct cache_tree *chunk_cache,
3135 struct btrfs_key *key, struct extent_buffer *eb,
3138 struct chunk_record *rec;
3141 rec = btrfs_new_chunk_record(eb, key, slot);
3142 ret = insert_cache_extent(chunk_cache, &rec->cache);
3144 fprintf(stderr, "Chunk[%llu, %llu] existed.\n",
3145 rec->offset, rec->length);
3152 static int process_device_item(struct rb_root *dev_cache,
3153 struct btrfs_key *key, struct extent_buffer *eb, int slot)
3155 struct btrfs_dev_item *ptr;
3156 struct device_record *rec;
3159 ptr = btrfs_item_ptr(eb,
3160 slot, struct btrfs_dev_item);
3162 rec = malloc(sizeof(*rec));
3164 fprintf(stderr, "memory allocation failed\n");
3168 rec->devid = key->offset;
3169 rec->generation = btrfs_header_generation(eb);
3171 rec->objectid = key->objectid;
3172 rec->type = key->type;
3173 rec->offset = key->offset;
3175 rec->devid = btrfs_device_id(eb, ptr);
3176 rec->total_byte = btrfs_device_total_bytes(eb, ptr);
3177 rec->byte_used = btrfs_device_bytes_used(eb, ptr);
3179 ret = rb_insert(dev_cache, &rec->node, device_record_compare);
3181 fprintf(stderr, "Device[%llu] existed.\n", rec->devid);
3188 struct block_group_record *
3189 btrfs_new_block_group_record(struct extent_buffer *leaf, struct btrfs_key *key,
3192 struct btrfs_block_group_item *ptr;
3193 struct block_group_record *rec;
3195 rec = malloc(sizeof(*rec));
3197 fprintf(stderr, "memory allocation failed\n");
3200 memset(rec, 0, sizeof(*rec));
3202 rec->cache.start = key->objectid;
3203 rec->cache.size = key->offset;
3205 rec->generation = btrfs_header_generation(leaf);
3207 rec->objectid = key->objectid;
3208 rec->type = key->type;
3209 rec->offset = key->offset;
3211 ptr = btrfs_item_ptr(leaf, slot, struct btrfs_block_group_item);
3212 rec->flags = btrfs_disk_block_group_flags(leaf, ptr);
3214 INIT_LIST_HEAD(&rec->list);
3219 static int process_block_group_item(struct block_group_tree *block_group_cache,
3220 struct btrfs_key *key,
3221 struct extent_buffer *eb, int slot)
3223 struct block_group_record *rec;
3226 rec = btrfs_new_block_group_record(eb, key, slot);
3227 ret = insert_block_group_record(block_group_cache, rec);
3229 fprintf(stderr, "Block Group[%llu, %llu] existed.\n",
3230 rec->objectid, rec->offset);
3237 struct device_extent_record *
3238 btrfs_new_device_extent_record(struct extent_buffer *leaf,
3239 struct btrfs_key *key, int slot)
3241 struct device_extent_record *rec;
3242 struct btrfs_dev_extent *ptr;
3244 rec = malloc(sizeof(*rec));
3246 fprintf(stderr, "memory allocation failed\n");
3249 memset(rec, 0, sizeof(*rec));
3251 rec->cache.objectid = key->objectid;
3252 rec->cache.start = key->offset;
3254 rec->generation = btrfs_header_generation(leaf);
3256 rec->objectid = key->objectid;
3257 rec->type = key->type;
3258 rec->offset = key->offset;
3260 ptr = btrfs_item_ptr(leaf, slot, struct btrfs_dev_extent);
3261 rec->chunk_objecteid =
3262 btrfs_dev_extent_chunk_objectid(leaf, ptr);
3264 btrfs_dev_extent_chunk_offset(leaf, ptr);
3265 rec->length = btrfs_dev_extent_length(leaf, ptr);
3266 rec->cache.size = rec->length;
3268 INIT_LIST_HEAD(&rec->chunk_list);
3269 INIT_LIST_HEAD(&rec->device_list);
3275 process_device_extent_item(struct device_extent_tree *dev_extent_cache,
3276 struct btrfs_key *key, struct extent_buffer *eb,
3279 struct device_extent_record *rec;
3282 rec = btrfs_new_device_extent_record(eb, key, slot);
3283 ret = insert_device_extent_record(dev_extent_cache, rec);
3286 "Device extent[%llu, %llu, %llu] existed.\n",
3287 rec->objectid, rec->offset, rec->length);
3294 static int process_extent_item(struct btrfs_root *root,
3295 struct cache_tree *extent_cache,
3296 struct extent_buffer *eb, int slot)
3298 struct btrfs_extent_item *ei;
3299 struct btrfs_extent_inline_ref *iref;
3300 struct btrfs_extent_data_ref *dref;
3301 struct btrfs_shared_data_ref *sref;
3302 struct btrfs_key key;
3306 u32 item_size = btrfs_item_size_nr(eb, slot);
3312 btrfs_item_key_to_cpu(eb, &key, slot);
3314 if (key.type == BTRFS_METADATA_ITEM_KEY) {
3316 num_bytes = root->leafsize;
3318 num_bytes = key.offset;
3321 if (item_size < sizeof(*ei)) {
3322 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
3323 struct btrfs_extent_item_v0 *ei0;
3324 BUG_ON(item_size != sizeof(*ei0));
3325 ei0 = btrfs_item_ptr(eb, slot, struct btrfs_extent_item_v0);
3326 refs = btrfs_extent_refs_v0(eb, ei0);
3330 return add_extent_rec(extent_cache, NULL, 0, key.objectid,
3331 num_bytes, refs, 0, 0, 0, metadata, 1,
3335 ei = btrfs_item_ptr(eb, slot, struct btrfs_extent_item);
3336 refs = btrfs_extent_refs(eb, ei);
3338 add_extent_rec(extent_cache, NULL, 0, key.objectid, num_bytes,
3339 refs, 0, 0, 0, metadata, 1, num_bytes);
3341 ptr = (unsigned long)(ei + 1);
3342 if (btrfs_extent_flags(eb, ei) & BTRFS_EXTENT_FLAG_TREE_BLOCK &&
3343 key.type == BTRFS_EXTENT_ITEM_KEY)
3344 ptr += sizeof(struct btrfs_tree_block_info);
3346 end = (unsigned long)ei + item_size;
3348 iref = (struct btrfs_extent_inline_ref *)ptr;
3349 type = btrfs_extent_inline_ref_type(eb, iref);
3350 offset = btrfs_extent_inline_ref_offset(eb, iref);
3352 case BTRFS_TREE_BLOCK_REF_KEY:
3353 add_tree_backref(extent_cache, key.objectid,
3356 case BTRFS_SHARED_BLOCK_REF_KEY:
3357 add_tree_backref(extent_cache, key.objectid,
3360 case BTRFS_EXTENT_DATA_REF_KEY:
3361 dref = (struct btrfs_extent_data_ref *)(&iref->offset);
3362 add_data_backref(extent_cache, key.objectid, 0,
3363 btrfs_extent_data_ref_root(eb, dref),
3364 btrfs_extent_data_ref_objectid(eb,
3366 btrfs_extent_data_ref_offset(eb, dref),
3367 btrfs_extent_data_ref_count(eb, dref),
3370 case BTRFS_SHARED_DATA_REF_KEY:
3371 sref = (struct btrfs_shared_data_ref *)(iref + 1);
3372 add_data_backref(extent_cache, key.objectid, offset,
3374 btrfs_shared_data_ref_count(eb, sref),
3378 fprintf(stderr, "corrupt extent record: key %Lu %u %Lu\n",
3379 key.objectid, key.type, num_bytes);
3382 ptr += btrfs_extent_inline_ref_size(type);
3389 static int check_cache_range(struct btrfs_root *root,
3390 struct btrfs_block_group_cache *cache,
3391 u64 offset, u64 bytes)
3393 struct btrfs_free_space *entry;
3399 for (i = 0; i < BTRFS_SUPER_MIRROR_MAX; i++) {
3400 bytenr = btrfs_sb_offset(i);
3401 ret = btrfs_rmap_block(&root->fs_info->mapping_tree,
3402 cache->key.objectid, bytenr, 0,
3403 &logical, &nr, &stripe_len);
3408 if (logical[nr] + stripe_len <= offset)
3410 if (offset + bytes <= logical[nr])
3412 if (logical[nr] == offset) {
3413 if (stripe_len >= bytes) {
3417 bytes -= stripe_len;
3418 offset += stripe_len;
3419 } else if (logical[nr] < offset) {
3420 if (logical[nr] + stripe_len >=
3425 bytes = (offset + bytes) -
3426 (logical[nr] + stripe_len);
3427 offset = logical[nr] + stripe_len;
3430 * Could be tricky, the super may land in the
3431 * middle of the area we're checking. First
3432 * check the easiest case, it's at the end.
3434 if (logical[nr] + stripe_len >=
3436 bytes = logical[nr] - offset;
3440 /* Check the left side */
3441 ret = check_cache_range(root, cache,
3443 logical[nr] - offset);
3449 /* Now we continue with the right side */
3450 bytes = (offset + bytes) -
3451 (logical[nr] + stripe_len);
3452 offset = logical[nr] + stripe_len;
3459 entry = btrfs_find_free_space(cache->free_space_ctl, offset, bytes);
3461 fprintf(stderr, "There is no free space entry for %Lu-%Lu\n",
3462 offset, offset+bytes);
3466 if (entry->offset != offset) {
3467 fprintf(stderr, "Wanted offset %Lu, found %Lu\n", offset,
3472 if (entry->bytes != bytes) {
3473 fprintf(stderr, "Wanted bytes %Lu, found %Lu for off %Lu\n",
3474 bytes, entry->bytes, offset);
3478 unlink_free_space(cache->free_space_ctl, entry);
3483 static int verify_space_cache(struct btrfs_root *root,
3484 struct btrfs_block_group_cache *cache)
3486 struct btrfs_path *path;
3487 struct extent_buffer *leaf;
3488 struct btrfs_key key;
3492 path = btrfs_alloc_path();
3496 root = root->fs_info->extent_root;
3498 last = max_t(u64, cache->key.objectid, BTRFS_SUPER_INFO_OFFSET);
3500 key.objectid = last;
3502 key.type = BTRFS_EXTENT_ITEM_KEY;
3504 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
3509 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) {
3510 ret = btrfs_next_leaf(root, path);
3518 leaf = path->nodes[0];
3519 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
3520 if (key.objectid >= cache->key.offset + cache->key.objectid)
3522 if (key.type != BTRFS_EXTENT_ITEM_KEY &&
3523 key.type != BTRFS_METADATA_ITEM_KEY) {
3528 if (last == key.objectid) {
3529 if (key.type == BTRFS_EXTENT_ITEM_KEY)
3530 last = key.objectid + key.offset;
3532 last = key.objectid + root->leafsize;
3537 ret = check_cache_range(root, cache, last,
3538 key.objectid - last);
3541 if (key.type == BTRFS_EXTENT_ITEM_KEY)
3542 last = key.objectid + key.offset;
3544 last = key.objectid + root->leafsize;
3548 if (last < cache->key.objectid + cache->key.offset)
3549 ret = check_cache_range(root, cache, last,
3550 cache->key.objectid +
3551 cache->key.offset - last);
3554 btrfs_free_path(path);
3557 !RB_EMPTY_ROOT(&cache->free_space_ctl->free_space_offset)) {
3558 fprintf(stderr, "There are still entries left in the space "
3566 static int check_space_cache(struct btrfs_root *root)
3568 struct btrfs_block_group_cache *cache;
3569 u64 start = BTRFS_SUPER_INFO_OFFSET + BTRFS_SUPER_INFO_SIZE;
3573 if (btrfs_super_cache_generation(root->fs_info->super_copy) != -1ULL &&
3574 btrfs_super_generation(root->fs_info->super_copy) !=
3575 btrfs_super_cache_generation(root->fs_info->super_copy)) {
3576 printf("cache and super generation don't match, space cache "
3577 "will be invalidated\n");
3582 cache = btrfs_lookup_first_block_group(root->fs_info, start);
3586 start = cache->key.objectid + cache->key.offset;
3587 if (!cache->free_space_ctl) {
3588 if (btrfs_init_free_space_ctl(cache,
3589 root->sectorsize)) {
3594 btrfs_remove_free_space_cache(cache);
3597 ret = load_free_space_cache(root->fs_info, cache);
3601 ret = verify_space_cache(root, cache);
3603 fprintf(stderr, "cache appears valid but isnt %Lu\n",
3604 cache->key.objectid);
3609 return error ? -EINVAL : 0;
3612 static int check_extent_exists(struct btrfs_root *root, u64 bytenr,
3615 struct btrfs_path *path;
3616 struct extent_buffer *leaf;
3617 struct btrfs_key key;
3620 path = btrfs_alloc_path();
3622 fprintf(stderr, "Error allocing path\n");
3626 key.objectid = bytenr;
3627 key.type = BTRFS_EXTENT_ITEM_KEY;
3632 ret = btrfs_search_slot(NULL, root->fs_info->extent_root, &key, path,
3635 fprintf(stderr, "Error looking up extent record %d\n", ret);
3636 btrfs_free_path(path);
3642 btrfs_prev_leaf(root, path);
3645 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
3648 * Block group items come before extent items if they have the same
3649 * bytenr, so walk back one more just in case. Dear future traveler,
3650 * first congrats on mastering time travel. Now if it's not too much
3651 * trouble could you go back to 2006 and tell Chris to make the
3652 * BLOCK_GROUP_ITEM_KEY lower than the EXTENT_ITEM_KEY please?
3654 if (key.type == BTRFS_BLOCK_GROUP_ITEM_KEY) {
3658 btrfs_prev_leaf(root, path);
3662 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) {
3663 ret = btrfs_next_leaf(root, path);
3665 fprintf(stderr, "Error going to next leaf "
3667 btrfs_free_path(path);
3673 leaf = path->nodes[0];
3674 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
3675 if (key.type != BTRFS_EXTENT_ITEM_KEY) {
3679 if (key.objectid + key.offset < bytenr) {
3683 if (key.objectid > bytenr + num_bytes)
3686 if (key.objectid == bytenr) {
3687 if (key.offset >= num_bytes) {
3691 num_bytes -= key.offset;
3692 bytenr += key.offset;
3693 } else if (key.objectid < bytenr) {
3694 if (key.objectid + key.offset >= bytenr + num_bytes) {
3698 num_bytes = (bytenr + num_bytes) -
3699 (key.objectid + key.offset);
3700 bytenr = key.objectid + key.offset;
3702 if (key.objectid + key.offset < bytenr + num_bytes) {
3703 u64 new_start = key.objectid + key.offset;
3704 u64 new_bytes = bytenr + num_bytes - new_start;
3707 * Weird case, the extent is in the middle of
3708 * our range, we'll have to search one side
3709 * and then the other. Not sure if this happens
3710 * in real life, but no harm in coding it up
3711 * anyway just in case.
3713 btrfs_release_path(path);
3714 ret = check_extent_exists(root, new_start,
3717 fprintf(stderr, "Right section didn't "
3721 num_bytes = key.objectid - bytenr;
3724 num_bytes = key.objectid - bytenr;
3731 fprintf(stderr, "There are no extents for csum range "
3732 "%Lu-%Lu\n", bytenr, bytenr+num_bytes);
3736 btrfs_free_path(path);
3740 static int check_csums(struct btrfs_root *root)
3742 struct btrfs_path *path;
3743 struct extent_buffer *leaf;
3744 struct btrfs_key key;
3745 u64 offset = 0, num_bytes = 0;
3746 u16 csum_size = btrfs_super_csum_size(root->fs_info->super_copy);
3750 root = root->fs_info->csum_root;
3752 key.objectid = BTRFS_EXTENT_CSUM_OBJECTID;
3753 key.type = BTRFS_EXTENT_CSUM_KEY;
3756 path = btrfs_alloc_path();
3760 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
3762 fprintf(stderr, "Error searching csum tree %d\n", ret);
3763 btrfs_free_path(path);
3767 if (ret > 0 && path->slots[0])
3772 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) {
3773 ret = btrfs_next_leaf(root, path);
3775 fprintf(stderr, "Error going to next leaf "
3782 leaf = path->nodes[0];
3784 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
3785 if (key.type != BTRFS_EXTENT_CSUM_KEY) {
3791 offset = key.offset;
3792 } else if (key.offset != offset + num_bytes) {
3793 ret = check_extent_exists(root, offset, num_bytes);
3795 fprintf(stderr, "Csum exists for %Lu-%Lu but "
3796 "there is no extent record\n",
3797 offset, offset+num_bytes);
3800 offset = key.offset;
3804 num_bytes += (btrfs_item_size_nr(leaf, path->slots[0]) /
3805 csum_size) * root->sectorsize;
3809 btrfs_free_path(path);
3813 static int is_dropped_key(struct btrfs_key *key,
3814 struct btrfs_key *drop_key) {
3815 if (key->objectid < drop_key->objectid)
3817 else if (key->objectid == drop_key->objectid) {
3818 if (key->type < drop_key->type)
3820 else if (key->type == drop_key->type) {
3821 if (key->offset < drop_key->offset)
3828 static int run_next_block(struct btrfs_trans_handle *trans,
3829 struct btrfs_root *root,
3830 struct block_info *bits,
3833 struct cache_tree *pending,
3834 struct cache_tree *seen,
3835 struct cache_tree *reada,
3836 struct cache_tree *nodes,
3837 struct cache_tree *extent_cache,
3838 struct cache_tree *chunk_cache,
3839 struct rb_root *dev_cache,
3840 struct block_group_tree *block_group_cache,
3841 struct device_extent_tree *dev_extent_cache,
3842 struct btrfs_root_item *ri)
3844 struct extent_buffer *buf;
3855 struct btrfs_key key;
3856 struct cache_extent *cache;
3859 nritems = pick_next_pending(pending, reada, nodes, *last, bits,
3860 bits_nr, &reada_bits);
3865 for(i = 0; i < nritems; i++) {
3866 ret = add_cache_extent(reada, bits[i].start,
3871 /* fixme, get the parent transid */
3872 readahead_tree_block(root, bits[i].start,
3876 *last = bits[0].start;
3877 bytenr = bits[0].start;
3878 size = bits[0].size;
3880 cache = lookup_cache_extent(pending, bytenr, size);
3882 remove_cache_extent(pending, cache);
3885 cache = lookup_cache_extent(reada, bytenr, size);
3887 remove_cache_extent(reada, cache);
3890 cache = lookup_cache_extent(nodes, bytenr, size);
3892 remove_cache_extent(nodes, cache);
3895 cache = lookup_cache_extent(seen, bytenr, size);
3897 remove_cache_extent(seen, cache);
3901 cache = lookup_cache_extent(extent_cache, bytenr, size);
3903 struct extent_record *rec;
3905 rec = container_of(cache, struct extent_record, cache);
3906 gen = rec->parent_generation;
3909 /* fixme, get the real parent transid */
3910 buf = read_tree_block(root, bytenr, size, gen);
3911 if (!extent_buffer_uptodate(buf)) {
3912 record_bad_block_io(root->fs_info,
3913 extent_cache, bytenr, size);
3917 nritems = btrfs_header_nritems(buf);
3920 * FIXME, this only works only if we don't have any full
3923 if (!init_extent_tree) {
3924 ret = btrfs_lookup_extent_info(NULL, root, bytenr,
3925 btrfs_header_level(buf), 1, NULL,
3933 if (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF) {
3938 owner = btrfs_header_owner(buf);
3941 ret = check_block(trans, root, extent_cache, buf, flags);
3945 if (btrfs_is_leaf(buf)) {
3946 btree_space_waste += btrfs_leaf_free_space(root, buf);
3947 for (i = 0; i < nritems; i++) {
3948 struct btrfs_file_extent_item *fi;
3949 btrfs_item_key_to_cpu(buf, &key, i);
3950 if (key.type == BTRFS_EXTENT_ITEM_KEY) {
3951 process_extent_item(root, extent_cache, buf,
3955 if (key.type == BTRFS_METADATA_ITEM_KEY) {
3956 process_extent_item(root, extent_cache, buf,
3960 if (key.type == BTRFS_EXTENT_CSUM_KEY) {
3962 btrfs_item_size_nr(buf, i);
3965 if (key.type == BTRFS_CHUNK_ITEM_KEY) {
3966 process_chunk_item(chunk_cache, &key, buf, i);
3969 if (key.type == BTRFS_DEV_ITEM_KEY) {
3970 process_device_item(dev_cache, &key, buf, i);
3973 if (key.type == BTRFS_BLOCK_GROUP_ITEM_KEY) {
3974 process_block_group_item(block_group_cache,
3978 if (key.type == BTRFS_DEV_EXTENT_KEY) {
3979 process_device_extent_item(dev_extent_cache,
3984 if (key.type == BTRFS_EXTENT_REF_V0_KEY) {
3985 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
3986 process_extent_ref_v0(extent_cache, buf, i);
3993 if (key.type == BTRFS_TREE_BLOCK_REF_KEY) {
3994 add_tree_backref(extent_cache, key.objectid, 0,
3998 if (key.type == BTRFS_SHARED_BLOCK_REF_KEY) {
3999 add_tree_backref(extent_cache, key.objectid,
4003 if (key.type == BTRFS_EXTENT_DATA_REF_KEY) {
4004 struct btrfs_extent_data_ref *ref;
4005 ref = btrfs_item_ptr(buf, i,
4006 struct btrfs_extent_data_ref);
4007 add_data_backref(extent_cache,
4009 btrfs_extent_data_ref_root(buf, ref),
4010 btrfs_extent_data_ref_objectid(buf,
4012 btrfs_extent_data_ref_offset(buf, ref),
4013 btrfs_extent_data_ref_count(buf, ref),
4014 0, root->sectorsize);
4017 if (key.type == BTRFS_SHARED_DATA_REF_KEY) {
4018 struct btrfs_shared_data_ref *ref;
4019 ref = btrfs_item_ptr(buf, i,
4020 struct btrfs_shared_data_ref);
4021 add_data_backref(extent_cache,
4022 key.objectid, key.offset, 0, 0, 0,
4023 btrfs_shared_data_ref_count(buf, ref),
4024 0, root->sectorsize);
4027 if (key.type == BTRFS_ORPHAN_ITEM_KEY) {
4028 struct bad_item *bad;
4030 if (key.objectid == BTRFS_ORPHAN_OBJECTID)
4034 bad = malloc(sizeof(struct bad_item));
4037 INIT_LIST_HEAD(&bad->list);
4038 memcpy(&bad->key, &key,
4039 sizeof(struct btrfs_key));
4040 bad->root_id = owner;
4041 list_add_tail(&bad->list, &delete_items);
4044 if (key.type != BTRFS_EXTENT_DATA_KEY)
4046 fi = btrfs_item_ptr(buf, i,
4047 struct btrfs_file_extent_item);
4048 if (btrfs_file_extent_type(buf, fi) ==
4049 BTRFS_FILE_EXTENT_INLINE)
4051 if (btrfs_file_extent_disk_bytenr(buf, fi) == 0)
4054 data_bytes_allocated +=
4055 btrfs_file_extent_disk_num_bytes(buf, fi);
4056 if (data_bytes_allocated < root->sectorsize) {
4059 data_bytes_referenced +=
4060 btrfs_file_extent_num_bytes(buf, fi);
4061 add_data_backref(extent_cache,
4062 btrfs_file_extent_disk_bytenr(buf, fi),
4063 parent, owner, key.objectid, key.offset -
4064 btrfs_file_extent_offset(buf, fi), 1, 1,
4065 btrfs_file_extent_disk_num_bytes(buf, fi));
4069 struct btrfs_key first_key;
4071 first_key.objectid = 0;
4074 btrfs_item_key_to_cpu(buf, &first_key, 0);
4075 level = btrfs_header_level(buf);
4076 for (i = 0; i < nritems; i++) {
4077 ptr = btrfs_node_blockptr(buf, i);
4078 size = btrfs_level_size(root, level - 1);
4079 btrfs_node_key_to_cpu(buf, &key, i);
4081 struct btrfs_key drop_key;
4082 btrfs_disk_key_to_cpu(&drop_key,
4083 &ri->drop_progress);
4084 if ((level == ri->drop_level)
4085 && is_dropped_key(&key, &drop_key)) {
4089 ret = add_extent_rec(extent_cache, &key,
4090 btrfs_node_ptr_generation(buf, i),
4091 ptr, size, 0, 0, 1, 0, 1, 0,
4095 add_tree_backref(extent_cache, ptr, parent, owner, 1);
4098 add_pending(nodes, seen, ptr, size);
4100 add_pending(pending, seen, ptr, size);
4103 btree_space_waste += (BTRFS_NODEPTRS_PER_BLOCK(root) -
4104 nritems) * sizeof(struct btrfs_key_ptr);
4106 total_btree_bytes += buf->len;
4107 if (fs_root_objectid(btrfs_header_owner(buf)))
4108 total_fs_tree_bytes += buf->len;
4109 if (btrfs_header_owner(buf) == BTRFS_EXTENT_TREE_OBJECTID)
4110 total_extent_tree_bytes += buf->len;
4111 if (!found_old_backref &&
4112 btrfs_header_owner(buf) == BTRFS_TREE_RELOC_OBJECTID &&
4113 btrfs_header_backref_rev(buf) == BTRFS_MIXED_BACKREF_REV &&
4114 !btrfs_header_flag(buf, BTRFS_HEADER_FLAG_RELOC))
4115 found_old_backref = 1;
4117 free_extent_buffer(buf);
4121 static int add_root_to_pending(struct extent_buffer *buf,
4122 struct cache_tree *extent_cache,
4123 struct cache_tree *pending,
4124 struct cache_tree *seen,
4125 struct cache_tree *nodes,
4126 struct btrfs_key *root_key)
4128 if (btrfs_header_level(buf) > 0)
4129 add_pending(nodes, seen, buf->start, buf->len);
4131 add_pending(pending, seen, buf->start, buf->len);
4132 add_extent_rec(extent_cache, NULL, 0, buf->start, buf->len,
4133 0, 1, 1, 0, 1, 0, buf->len);
4135 if (root_key->objectid == BTRFS_TREE_RELOC_OBJECTID ||
4136 btrfs_header_backref_rev(buf) < BTRFS_MIXED_BACKREF_REV)
4137 add_tree_backref(extent_cache, buf->start, buf->start,
4140 add_tree_backref(extent_cache, buf->start, 0,
4141 root_key->objectid, 1);
4145 /* as we fix the tree, we might be deleting blocks that
4146 * we're tracking for repair. This hook makes sure we
4147 * remove any backrefs for blocks as we are fixing them.
4149 static int free_extent_hook(struct btrfs_trans_handle *trans,
4150 struct btrfs_root *root,
4151 u64 bytenr, u64 num_bytes, u64 parent,
4152 u64 root_objectid, u64 owner, u64 offset,
4155 struct extent_record *rec;
4156 struct cache_extent *cache;
4158 struct cache_tree *extent_cache = root->fs_info->fsck_extent_cache;
4160 is_data = owner >= BTRFS_FIRST_FREE_OBJECTID;
4161 cache = lookup_cache_extent(extent_cache, bytenr, num_bytes);
4165 rec = container_of(cache, struct extent_record, cache);
4167 struct data_backref *back;
4168 back = find_data_backref(rec, parent, root_objectid, owner,
4169 offset, 1, bytenr, num_bytes);
4172 if (back->node.found_ref) {
4173 back->found_ref -= refs_to_drop;
4175 rec->refs -= refs_to_drop;
4177 if (back->node.found_extent_tree) {
4178 back->num_refs -= refs_to_drop;
4179 if (rec->extent_item_refs)
4180 rec->extent_item_refs -= refs_to_drop;
4182 if (back->found_ref == 0)
4183 back->node.found_ref = 0;
4184 if (back->num_refs == 0)
4185 back->node.found_extent_tree = 0;
4187 if (!back->node.found_extent_tree && back->node.found_ref) {
4188 list_del(&back->node.list);
4192 struct tree_backref *back;
4193 back = find_tree_backref(rec, parent, root_objectid);
4196 if (back->node.found_ref) {
4199 back->node.found_ref = 0;
4201 if (back->node.found_extent_tree) {
4202 if (rec->extent_item_refs)
4203 rec->extent_item_refs--;
4204 back->node.found_extent_tree = 0;
4206 if (!back->node.found_extent_tree && back->node.found_ref) {
4207 list_del(&back->node.list);
4211 maybe_free_extent_rec(extent_cache, rec);
4216 static int delete_extent_records(struct btrfs_trans_handle *trans,
4217 struct btrfs_root *root,
4218 struct btrfs_path *path,
4219 u64 bytenr, u64 new_len)
4221 struct btrfs_key key;
4222 struct btrfs_key found_key;
4223 struct extent_buffer *leaf;
4228 key.objectid = bytenr;
4230 key.offset = (u64)-1;
4233 ret = btrfs_search_slot(trans, root->fs_info->extent_root,
4240 if (path->slots[0] == 0)
4246 leaf = path->nodes[0];
4247 slot = path->slots[0];
4249 btrfs_item_key_to_cpu(leaf, &found_key, slot);
4250 if (found_key.objectid != bytenr)
4253 if (found_key.type != BTRFS_EXTENT_ITEM_KEY &&
4254 found_key.type != BTRFS_METADATA_ITEM_KEY &&
4255 found_key.type != BTRFS_TREE_BLOCK_REF_KEY &&
4256 found_key.type != BTRFS_EXTENT_DATA_REF_KEY &&
4257 found_key.type != BTRFS_EXTENT_REF_V0_KEY &&
4258 found_key.type != BTRFS_SHARED_BLOCK_REF_KEY &&
4259 found_key.type != BTRFS_SHARED_DATA_REF_KEY) {
4260 btrfs_release_path(path);
4261 if (found_key.type == 0) {
4262 if (found_key.offset == 0)
4264 key.offset = found_key.offset - 1;
4265 key.type = found_key.type;
4267 key.type = found_key.type - 1;
4268 key.offset = (u64)-1;
4272 fprintf(stderr, "repair deleting extent record: key %Lu %u %Lu\n",
4273 found_key.objectid, found_key.type, found_key.offset);
4275 ret = btrfs_del_item(trans, root->fs_info->extent_root, path);
4278 btrfs_release_path(path);
4280 if (found_key.type == BTRFS_EXTENT_ITEM_KEY ||
4281 found_key.type == BTRFS_METADATA_ITEM_KEY) {
4282 u64 bytes = (found_key.type == BTRFS_EXTENT_ITEM_KEY) ?
4283 found_key.offset : root->leafsize;
4285 ret = btrfs_update_block_group(trans, root, bytenr,
4292 btrfs_release_path(path);
4297 * for a single backref, this will allocate a new extent
4298 * and add the backref to it.
4300 static int record_extent(struct btrfs_trans_handle *trans,
4301 struct btrfs_fs_info *info,
4302 struct btrfs_path *path,
4303 struct extent_record *rec,
4304 struct extent_backref *back,
4305 int allocated, u64 flags)
4308 struct btrfs_root *extent_root = info->extent_root;
4309 struct extent_buffer *leaf;
4310 struct btrfs_key ins_key;
4311 struct btrfs_extent_item *ei;
4312 struct tree_backref *tback;
4313 struct data_backref *dback;
4314 struct btrfs_tree_block_info *bi;
4317 rec->max_size = max_t(u64, rec->max_size,
4318 info->extent_root->leafsize);
4321 u32 item_size = sizeof(*ei);
4324 item_size += sizeof(*bi);
4326 ins_key.objectid = rec->start;
4327 ins_key.offset = rec->max_size;
4328 ins_key.type = BTRFS_EXTENT_ITEM_KEY;
4330 ret = btrfs_insert_empty_item(trans, extent_root, path,
4331 &ins_key, item_size);
4335 leaf = path->nodes[0];
4336 ei = btrfs_item_ptr(leaf, path->slots[0],
4337 struct btrfs_extent_item);
4339 btrfs_set_extent_refs(leaf, ei, 0);
4340 btrfs_set_extent_generation(leaf, ei, rec->generation);
4342 if (back->is_data) {
4343 btrfs_set_extent_flags(leaf, ei,
4344 BTRFS_EXTENT_FLAG_DATA);
4346 struct btrfs_disk_key copy_key;;
4348 tback = (struct tree_backref *)back;
4349 bi = (struct btrfs_tree_block_info *)(ei + 1);
4350 memset_extent_buffer(leaf, 0, (unsigned long)bi,
4353 btrfs_set_disk_key_objectid(©_key,
4354 rec->info_objectid);
4355 btrfs_set_disk_key_type(©_key, 0);
4356 btrfs_set_disk_key_offset(©_key, 0);
4358 btrfs_set_tree_block_level(leaf, bi, rec->info_level);
4359 btrfs_set_tree_block_key(leaf, bi, ©_key);
4361 btrfs_set_extent_flags(leaf, ei,
4362 BTRFS_EXTENT_FLAG_TREE_BLOCK | flags);
4365 btrfs_mark_buffer_dirty(leaf);
4366 ret = btrfs_update_block_group(trans, extent_root, rec->start,
4367 rec->max_size, 1, 0);
4370 btrfs_release_path(path);
4373 if (back->is_data) {
4377 dback = (struct data_backref *)back;
4378 if (back->full_backref)
4379 parent = dback->parent;
4383 for (i = 0; i < dback->found_ref; i++) {
4384 /* if parent != 0, we're doing a full backref
4385 * passing BTRFS_FIRST_FREE_OBJECTID as the owner
4386 * just makes the backref allocator create a data
4389 ret = btrfs_inc_extent_ref(trans, info->extent_root,
4390 rec->start, rec->max_size,
4394 BTRFS_FIRST_FREE_OBJECTID :
4400 fprintf(stderr, "adding new data backref"
4401 " on %llu %s %llu owner %llu"
4402 " offset %llu found %d\n",
4403 (unsigned long long)rec->start,
4404 back->full_backref ?
4406 back->full_backref ?
4407 (unsigned long long)parent :
4408 (unsigned long long)dback->root,
4409 (unsigned long long)dback->owner,
4410 (unsigned long long)dback->offset,
4415 tback = (struct tree_backref *)back;
4416 if (back->full_backref)
4417 parent = tback->parent;
4421 ret = btrfs_inc_extent_ref(trans, info->extent_root,
4422 rec->start, rec->max_size,
4423 parent, tback->root, 0, 0);
4424 fprintf(stderr, "adding new tree backref on "
4425 "start %llu len %llu parent %llu root %llu\n",
4426 rec->start, rec->max_size, tback->parent, tback->root);
4431 btrfs_release_path(path);
4435 struct extent_entry {
4440 struct list_head list;
4443 static struct extent_entry *find_entry(struct list_head *entries,
4444 u64 bytenr, u64 bytes)
4446 struct extent_entry *entry = NULL;
4448 list_for_each_entry(entry, entries, list) {
4449 if (entry->bytenr == bytenr && entry->bytes == bytes)
4456 static struct extent_entry *find_most_right_entry(struct list_head *entries)
4458 struct extent_entry *entry, *best = NULL, *prev = NULL;
4460 list_for_each_entry(entry, entries, list) {
4467 * If there are as many broken entries as entries then we know
4468 * not to trust this particular entry.
4470 if (entry->broken == entry->count)
4474 * If our current entry == best then we can't be sure our best
4475 * is really the best, so we need to keep searching.
4477 if (best && best->count == entry->count) {
4483 /* Prev == entry, not good enough, have to keep searching */
4484 if (!prev->broken && prev->count == entry->count)
4488 best = (prev->count > entry->count) ? prev : entry;
4489 else if (best->count < entry->count)
4497 static int repair_ref(struct btrfs_trans_handle *trans,
4498 struct btrfs_fs_info *info, struct btrfs_path *path,
4499 struct data_backref *dback, struct extent_entry *entry)
4501 struct btrfs_root *root;
4502 struct btrfs_file_extent_item *fi;
4503 struct extent_buffer *leaf;
4504 struct btrfs_key key;
4508 key.objectid = dback->root;
4509 key.type = BTRFS_ROOT_ITEM_KEY;
4510 key.offset = (u64)-1;
4511 root = btrfs_read_fs_root(info, &key);
4513 fprintf(stderr, "Couldn't find root for our ref\n");
4518 * The backref points to the original offset of the extent if it was
4519 * split, so we need to search down to the offset we have and then walk
4520 * forward until we find the backref we're looking for.
4522 key.objectid = dback->owner;
4523 key.type = BTRFS_EXTENT_DATA_KEY;
4524 key.offset = dback->offset;
4525 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
4527 fprintf(stderr, "Error looking up ref %d\n", ret);
4532 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) {
4533 ret = btrfs_next_leaf(root, path);
4535 fprintf(stderr, "Couldn't find our ref, next\n");
4539 leaf = path->nodes[0];
4540 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
4541 if (key.objectid != dback->owner ||
4542 key.type != BTRFS_EXTENT_DATA_KEY) {
4543 fprintf(stderr, "Couldn't find our ref, search\n");
4546 fi = btrfs_item_ptr(leaf, path->slots[0],
4547 struct btrfs_file_extent_item);
4548 bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
4549 bytes = btrfs_file_extent_disk_num_bytes(leaf, fi);
4551 if (bytenr == dback->disk_bytenr && bytes == dback->bytes)
4556 btrfs_release_path(path);
4559 * Have to make sure that this root gets updated when we commit the
4562 root->track_dirty = 1;
4563 if (root->last_trans != trans->transid) {
4564 root->last_trans = trans->transid;
4565 root->commit_root = root->node;
4566 extent_buffer_get(root->node);
4570 * Ok we have the key of the file extent we want to fix, now we can cow
4571 * down to the thing and fix it.
4573 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
4575 fprintf(stderr, "Error cowing down to ref [%Lu, %u, %Lu]: %d\n",
4576 key.objectid, key.type, key.offset, ret);
4580 fprintf(stderr, "Well that's odd, we just found this key "
4581 "[%Lu, %u, %Lu]\n", key.objectid, key.type,
4585 leaf = path->nodes[0];
4586 fi = btrfs_item_ptr(leaf, path->slots[0],
4587 struct btrfs_file_extent_item);
4589 if (btrfs_file_extent_compression(leaf, fi) &&
4590 dback->disk_bytenr != entry->bytenr) {
4591 fprintf(stderr, "Ref doesn't match the record start and is "
4592 "compressed, please take a btrfs-image of this file "
4593 "system and send it to a btrfs developer so they can "
4594 "complete this functionality for bytenr %Lu\n",
4595 dback->disk_bytenr);
4599 if (dback->node.broken && dback->disk_bytenr != entry->bytenr) {
4600 btrfs_set_file_extent_disk_bytenr(leaf, fi, entry->bytenr);
4601 } else if (dback->disk_bytenr > entry->bytenr) {
4602 u64 off_diff, offset;
4604 off_diff = dback->disk_bytenr - entry->bytenr;
4605 offset = btrfs_file_extent_offset(leaf, fi);
4606 if (dback->disk_bytenr + offset +
4607 btrfs_file_extent_num_bytes(leaf, fi) >
4608 entry->bytenr + entry->bytes) {
4609 fprintf(stderr, "Ref is past the entry end, please "
4610 "take a btrfs-image of this file system and "
4611 "send it to a btrfs developer, ref %Lu\n",
4612 dback->disk_bytenr);
4616 btrfs_set_file_extent_disk_bytenr(leaf, fi, entry->bytenr);
4617 btrfs_set_file_extent_offset(leaf, fi, offset);
4618 } else if (dback->disk_bytenr < entry->bytenr) {
4621 offset = btrfs_file_extent_offset(leaf, fi);
4622 if (dback->disk_bytenr + offset < entry->bytenr) {
4623 fprintf(stderr, "Ref is before the entry start, please"
4624 " take a btrfs-image of this file system and "
4625 "send it to a btrfs developer, ref %Lu\n",
4626 dback->disk_bytenr);
4630 offset += dback->disk_bytenr;
4631 offset -= entry->bytenr;
4632 btrfs_set_file_extent_disk_bytenr(leaf, fi, entry->bytenr);
4633 btrfs_set_file_extent_offset(leaf, fi, offset);
4636 btrfs_set_file_extent_disk_num_bytes(leaf, fi, entry->bytes);
4639 * Chances are if disk_num_bytes were wrong then so is ram_bytes, but
4640 * only do this if we aren't using compression, otherwise it's a
4643 if (!btrfs_file_extent_compression(leaf, fi))
4644 btrfs_set_file_extent_ram_bytes(leaf, fi, entry->bytes);
4646 printf("ram bytes may be wrong?\n");
4647 btrfs_mark_buffer_dirty(leaf);
4648 btrfs_release_path(path);
4652 static int verify_backrefs(struct btrfs_trans_handle *trans,
4653 struct btrfs_fs_info *info, struct btrfs_path *path,
4654 struct extent_record *rec)
4656 struct extent_backref *back;
4657 struct data_backref *dback;
4658 struct extent_entry *entry, *best = NULL;
4661 int broken_entries = 0;
4666 * Metadata is easy and the backrefs should always agree on bytenr and
4667 * size, if not we've got bigger issues.
4672 list_for_each_entry(back, &rec->backrefs, list) {
4673 dback = (struct data_backref *)back;
4675 * We only pay attention to backrefs that we found a real
4678 if (dback->found_ref == 0)
4680 if (back->full_backref)
4684 * For now we only catch when the bytes don't match, not the
4685 * bytenr. We can easily do this at the same time, but I want
4686 * to have a fs image to test on before we just add repair
4687 * functionality willy-nilly so we know we won't screw up the
4691 entry = find_entry(&entries, dback->disk_bytenr,
4694 entry = malloc(sizeof(struct extent_entry));
4699 memset(entry, 0, sizeof(*entry));
4700 entry->bytenr = dback->disk_bytenr;
4701 entry->bytes = dback->bytes;
4702 list_add_tail(&entry->list, &entries);
4707 * If we only have on entry we may think the entries agree when
4708 * in reality they don't so we have to do some extra checking.
4710 if (dback->disk_bytenr != rec->start ||
4711 dback->bytes != rec->nr || back->broken)
4722 /* Yay all the backrefs agree, carry on good sir */
4723 if (nr_entries <= 1 && !mismatch)
4726 fprintf(stderr, "attempting to repair backref discrepency for bytenr "
4727 "%Lu\n", rec->start);
4730 * First we want to see if the backrefs can agree amongst themselves who
4731 * is right, so figure out which one of the entries has the highest
4734 best = find_most_right_entry(&entries);
4737 * Ok so we may have an even split between what the backrefs think, so
4738 * this is where we use the extent ref to see what it thinks.
4741 entry = find_entry(&entries, rec->start, rec->nr);
4742 if (!entry && (!broken_entries || !rec->found_rec)) {
4743 fprintf(stderr, "Backrefs don't agree with eachother "
4744 "and extent record doesn't agree with anybody,"
4745 " so we can't fix bytenr %Lu bytes %Lu\n",
4746 rec->start, rec->nr);
4749 } else if (!entry) {
4751 * Ok our backrefs were broken, we'll assume this is the
4752 * correct value and add an entry for this range.
4754 entry = malloc(sizeof(struct extent_entry));
4759 memset(entry, 0, sizeof(*entry));
4760 entry->bytenr = rec->start;
4761 entry->bytes = rec->nr;
4762 list_add_tail(&entry->list, &entries);
4766 best = find_most_right_entry(&entries);
4768 fprintf(stderr, "Backrefs and extent record evenly "
4769 "split on who is right, this is going to "
4770 "require user input to fix bytenr %Lu bytes "
4771 "%Lu\n", rec->start, rec->nr);
4778 * I don't think this can happen currently as we'll abort() if we catch
4779 * this case higher up, but in case somebody removes that we still can't
4780 * deal with it properly here yet, so just bail out of that's the case.
4782 if (best->bytenr != rec->start) {
4783 fprintf(stderr, "Extent start and backref starts don't match, "
4784 "please use btrfs-image on this file system and send "
4785 "it to a btrfs developer so they can make fsck fix "
4786 "this particular case. bytenr is %Lu, bytes is %Lu\n",
4787 rec->start, rec->nr);
4793 * Ok great we all agreed on an extent record, let's go find the real
4794 * references and fix up the ones that don't match.
4796 list_for_each_entry(back, &rec->backrefs, list) {
4797 dback = (struct data_backref *)back;
4800 * Still ignoring backrefs that don't have a real ref attached
4803 if (dback->found_ref == 0)
4805 if (back->full_backref)
4808 if (dback->bytes == best->bytes &&
4809 dback->disk_bytenr == best->bytenr)
4812 ret = repair_ref(trans, info, path, dback, best);
4818 * Ok we messed with the actual refs, which means we need to drop our
4819 * entire cache and go back and rescan. I know this is a huge pain and
4820 * adds a lot of extra work, but it's the only way to be safe. Once all
4821 * the backrefs agree we may not need to do anything to the extent
4826 while (!list_empty(&entries)) {
4827 entry = list_entry(entries.next, struct extent_entry, list);
4828 list_del_init(&entry->list);
4834 static int process_duplicates(struct btrfs_root *root,
4835 struct cache_tree *extent_cache,
4836 struct extent_record *rec)
4838 struct extent_record *good, *tmp;
4839 struct cache_extent *cache;
4843 * If we found a extent record for this extent then return, or if we
4844 * have more than one duplicate we are likely going to need to delete
4847 if (rec->found_rec || rec->num_duplicates > 1)
4850 /* Shouldn't happen but just in case */
4851 BUG_ON(!rec->num_duplicates);
4854 * So this happens if we end up with a backref that doesn't match the
4855 * actual extent entry. So either the backref is bad or the extent
4856 * entry is bad. Either way we want to have the extent_record actually
4857 * reflect what we found in the extent_tree, so we need to take the
4858 * duplicate out and use that as the extent_record since the only way we
4859 * get a duplicate is if we find a real life BTRFS_EXTENT_ITEM_KEY.
4861 remove_cache_extent(extent_cache, &rec->cache);
4863 good = list_entry(rec->dups.next, struct extent_record, list);
4864 list_del_init(&good->list);
4865 INIT_LIST_HEAD(&good->backrefs);
4866 INIT_LIST_HEAD(&good->dups);
4867 good->cache.start = good->start;
4868 good->cache.size = good->nr;
4869 good->content_checked = 0;
4870 good->owner_ref_checked = 0;
4871 good->num_duplicates = 0;
4872 good->refs = rec->refs;
4873 list_splice_init(&rec->backrefs, &good->backrefs);
4875 cache = lookup_cache_extent(extent_cache, good->start,
4879 tmp = container_of(cache, struct extent_record, cache);
4882 * If we find another overlapping extent and it's found_rec is
4883 * set then it's a duplicate and we need to try and delete
4886 if (tmp->found_rec || tmp->num_duplicates > 0) {
4887 if (list_empty(&good->list))
4888 list_add_tail(&good->list,
4889 &duplicate_extents);
4890 good->num_duplicates += tmp->num_duplicates + 1;
4891 list_splice_init(&tmp->dups, &good->dups);
4892 list_del_init(&tmp->list);
4893 list_add_tail(&tmp->list, &good->dups);
4894 remove_cache_extent(extent_cache, &tmp->cache);
4899 * Ok we have another non extent item backed extent rec, so lets
4900 * just add it to this extent and carry on like we did above.
4902 good->refs += tmp->refs;
4903 list_splice_init(&tmp->backrefs, &good->backrefs);
4904 remove_cache_extent(extent_cache, &tmp->cache);
4907 ret = insert_cache_extent(extent_cache, &good->cache);
4910 return good->num_duplicates ? 0 : 1;
4913 static int delete_duplicate_records(struct btrfs_trans_handle *trans,
4914 struct btrfs_root *root,
4915 struct extent_record *rec)
4917 LIST_HEAD(delete_list);
4918 struct btrfs_path *path;
4919 struct extent_record *tmp, *good, *n;
4922 struct btrfs_key key;
4924 path = btrfs_alloc_path();
4931 /* Find the record that covers all of the duplicates. */
4932 list_for_each_entry(tmp, &rec->dups, list) {
4933 if (good->start < tmp->start)
4935 if (good->nr > tmp->nr)
4938 if (tmp->start + tmp->nr < good->start + good->nr) {
4939 fprintf(stderr, "Ok we have overlapping extents that "
4940 "aren't completely covered by eachother, this "
4941 "is going to require more careful thought. "
4942 "The extents are [%Lu-%Lu] and [%Lu-%Lu]\n",
4943 tmp->start, tmp->nr, good->start, good->nr);
4950 list_add_tail(&rec->list, &delete_list);
4952 list_for_each_entry_safe(tmp, n, &rec->dups, list) {
4955 list_move_tail(&tmp->list, &delete_list);
4958 root = root->fs_info->extent_root;
4959 list_for_each_entry(tmp, &delete_list, list) {
4960 if (tmp->found_rec == 0)
4962 key.objectid = tmp->start;
4963 key.type = BTRFS_EXTENT_ITEM_KEY;
4964 key.offset = tmp->nr;
4966 /* Shouldn't happen but just in case */
4967 if (tmp->metadata) {
4968 fprintf(stderr, "Well this shouldn't happen, extent "
4969 "record overlaps but is metadata? "
4970 "[%Lu, %Lu]\n", tmp->start, tmp->nr);
4974 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
4980 ret = btrfs_del_item(trans, root, path);
4983 btrfs_release_path(path);
4988 while (!list_empty(&delete_list)) {
4989 tmp = list_entry(delete_list.next, struct extent_record, list);
4990 list_del_init(&tmp->list);
4996 while (!list_empty(&rec->dups)) {
4997 tmp = list_entry(rec->dups.next, struct extent_record, list);
4998 list_del_init(&tmp->list);
5002 btrfs_free_path(path);
5004 if (!ret && !nr_del)
5005 rec->num_duplicates = 0;
5007 return ret ? ret : nr_del;
5010 static int find_possible_backrefs(struct btrfs_trans_handle *trans,
5011 struct btrfs_fs_info *info,
5012 struct btrfs_path *path,
5013 struct cache_tree *extent_cache,
5014 struct extent_record *rec)
5016 struct btrfs_root *root;
5017 struct extent_backref *back;
5018 struct data_backref *dback;
5019 struct cache_extent *cache;
5020 struct btrfs_file_extent_item *fi;
5021 struct btrfs_key key;
5025 list_for_each_entry(back, &rec->backrefs, list) {
5026 dback = (struct data_backref *)back;
5028 /* We found this one, we don't need to do a lookup */
5029 if (dback->found_ref)
5031 /* Don't care about full backrefs (poor unloved backrefs) */
5032 if (back->full_backref)
5034 key.objectid = dback->root;
5035 key.type = BTRFS_ROOT_ITEM_KEY;
5036 key.offset = (u64)-1;
5038 root = btrfs_read_fs_root(info, &key);
5040 /* No root, definitely a bad ref, skip */
5041 if (IS_ERR(root) && PTR_ERR(root) == -ENOENT)
5043 /* Other err, exit */
5045 return PTR_ERR(root);
5047 key.objectid = dback->owner;
5048 key.type = BTRFS_EXTENT_DATA_KEY;
5049 key.offset = dback->offset;
5050 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
5052 btrfs_release_path(path);
5055 /* Didn't find it, we can carry on */
5060 fi = btrfs_item_ptr(path->nodes[0], path->slots[0],
5061 struct btrfs_file_extent_item);
5062 bytenr = btrfs_file_extent_disk_bytenr(path->nodes[0], fi);
5063 bytes = btrfs_file_extent_disk_num_bytes(path->nodes[0], fi);
5064 btrfs_release_path(path);
5065 cache = lookup_cache_extent(extent_cache, bytenr, 1);
5067 struct extent_record *tmp;
5068 tmp = container_of(cache, struct extent_record, cache);
5071 * If we found an extent record for the bytenr for this
5072 * particular backref then we can't add it to our
5073 * current extent record. We only want to add backrefs
5074 * that don't have a corresponding extent item in the
5075 * extent tree since they likely belong to this record
5076 * and we need to fix it if it doesn't match bytenrs.
5082 dback->found_ref += 1;
5083 dback->disk_bytenr = bytenr;
5084 dback->bytes = bytes;
5087 * Set this so the verify backref code knows not to trust the
5088 * values in this backref.
5097 * when an incorrect extent item is found, this will delete
5098 * all of the existing entries for it and recreate them
5099 * based on what the tree scan found.
5101 static int fixup_extent_refs(struct btrfs_trans_handle *trans,
5102 struct btrfs_fs_info *info,
5103 struct cache_tree *extent_cache,
5104 struct extent_record *rec)
5107 struct btrfs_path *path;
5108 struct list_head *cur = rec->backrefs.next;
5109 struct cache_extent *cache;
5110 struct extent_backref *back;
5115 * remember our flags for recreating the extent.
5116 * FIXME, if we have cleared extent tree, we can not
5117 * lookup extent info in extent tree.
5119 if (!init_extent_tree) {
5120 ret = btrfs_lookup_extent_info(NULL, info->extent_root,
5121 rec->start, rec->max_size,
5122 rec->metadata, NULL, &flags);
5129 path = btrfs_alloc_path();
5133 if (rec->refs != rec->extent_item_refs && !rec->metadata) {
5135 * Sometimes the backrefs themselves are so broken they don't
5136 * get attached to any meaningful rec, so first go back and
5137 * check any of our backrefs that we couldn't find and throw
5138 * them into the list if we find the backref so that
5139 * verify_backrefs can figure out what to do.
5141 ret = find_possible_backrefs(trans, info, path, extent_cache,
5147 /* step one, make sure all of the backrefs agree */
5148 ret = verify_backrefs(trans, info, path, rec);
5152 /* step two, delete all the existing records */
5153 ret = delete_extent_records(trans, info->extent_root, path,
5154 rec->start, rec->max_size);
5159 /* was this block corrupt? If so, don't add references to it */
5160 cache = lookup_cache_extent(info->corrupt_blocks,
5161 rec->start, rec->max_size);
5167 /* step three, recreate all the refs we did find */
5168 while(cur != &rec->backrefs) {
5169 back = list_entry(cur, struct extent_backref, list);
5173 * if we didn't find any references, don't create a
5176 if (!back->found_ref)
5179 ret = record_extent(trans, info, path, rec, back, allocated, flags);
5186 btrfs_free_path(path);
5190 /* right now we only prune from the extent allocation tree */
5191 static int prune_one_block(struct btrfs_trans_handle *trans,
5192 struct btrfs_fs_info *info,
5193 struct btrfs_corrupt_block *corrupt)
5196 struct btrfs_path path;
5197 struct extent_buffer *eb;
5201 int level = corrupt->level + 1;
5203 btrfs_init_path(&path);
5205 /* we want to stop at the parent to our busted block */
5206 path.lowest_level = level;
5208 ret = btrfs_search_slot(trans, info->extent_root,
5209 &corrupt->key, &path, -1, 1);
5214 eb = path.nodes[level];
5221 * hopefully the search gave us the block we want to prune,
5222 * lets try that first
5224 slot = path.slots[level];
5225 found = btrfs_node_blockptr(eb, slot);
5226 if (found == corrupt->cache.start)
5229 nritems = btrfs_header_nritems(eb);
5231 /* the search failed, lets scan this node and hope we find it */
5232 for (slot = 0; slot < nritems; slot++) {
5233 found = btrfs_node_blockptr(eb, slot);
5234 if (found == corrupt->cache.start)
5238 * we couldn't find the bad block. TODO, search all the nodes for pointers
5241 if (eb == info->extent_root->node) {
5246 btrfs_release_path(&path);
5251 printk("deleting pointer to block %Lu\n", corrupt->cache.start);
5252 ret = btrfs_del_ptr(trans, info->extent_root, &path, level, slot);
5255 btrfs_release_path(&path);
5259 static int prune_corrupt_blocks(struct btrfs_trans_handle *trans,
5260 struct btrfs_fs_info *info)
5262 struct cache_extent *cache;
5263 struct btrfs_corrupt_block *corrupt;
5265 cache = search_cache_extent(info->corrupt_blocks, 0);
5269 corrupt = container_of(cache, struct btrfs_corrupt_block, cache);
5270 prune_one_block(trans, info, corrupt);
5271 cache = next_cache_extent(cache);
5276 static void free_corrupt_block(struct cache_extent *cache)
5278 struct btrfs_corrupt_block *corrupt;
5280 corrupt = container_of(cache, struct btrfs_corrupt_block, cache);
5284 FREE_EXTENT_CACHE_BASED_TREE(corrupt_blocks, free_corrupt_block);
5286 static void reset_cached_block_groups(struct btrfs_fs_info *fs_info)
5288 struct btrfs_block_group_cache *cache;
5293 ret = find_first_extent_bit(&fs_info->free_space_cache, 0,
5294 &start, &end, EXTENT_DIRTY);
5297 clear_extent_dirty(&fs_info->free_space_cache, start, end,
5303 cache = btrfs_lookup_first_block_group(fs_info, start);
5308 start = cache->key.objectid + cache->key.offset;
5312 static int check_extent_refs(struct btrfs_trans_handle *trans,
5313 struct btrfs_root *root,
5314 struct cache_tree *extent_cache)
5316 struct extent_record *rec;
5317 struct cache_extent *cache;
5325 * if we're doing a repair, we have to make sure
5326 * we don't allocate from the problem extents.
5327 * In the worst case, this will be all the
5330 cache = search_cache_extent(extent_cache, 0);
5332 rec = container_of(cache, struct extent_record, cache);
5333 btrfs_pin_extent(root->fs_info,
5334 rec->start, rec->max_size);
5335 cache = next_cache_extent(cache);
5338 /* pin down all the corrupted blocks too */
5339 cache = search_cache_extent(root->fs_info->corrupt_blocks, 0);
5341 btrfs_pin_extent(root->fs_info,
5342 cache->start, cache->size);
5343 cache = next_cache_extent(cache);
5345 prune_corrupt_blocks(trans, root->fs_info);
5346 reset_cached_block_groups(root->fs_info);
5350 * We need to delete any duplicate entries we find first otherwise we
5351 * could mess up the extent tree when we have backrefs that actually
5352 * belong to a different extent item and not the weird duplicate one.
5354 while (repair && !list_empty(&duplicate_extents)) {
5355 rec = list_entry(duplicate_extents.next, struct extent_record,
5357 list_del_init(&rec->list);
5359 /* Sometimes we can find a backref before we find an actual
5360 * extent, so we need to process it a little bit to see if there
5361 * truly are multiple EXTENT_ITEM_KEY's for the same range, or
5362 * if this is a backref screwup. If we need to delete stuff
5363 * process_duplicates() will return 0, otherwise it will return
5366 if (process_duplicates(root, extent_cache, rec))
5368 ret = delete_duplicate_records(trans, root, rec);
5372 * delete_duplicate_records will return the number of entries
5373 * deleted, so if it's greater than 0 then we know we actually
5374 * did something and we need to remove.
5385 cache = search_cache_extent(extent_cache, 0);
5388 rec = container_of(cache, struct extent_record, cache);
5389 if (rec->num_duplicates) {
5390 fprintf(stderr, "extent item %llu has multiple extent "
5391 "items\n", (unsigned long long)rec->start);
5395 if (rec->refs != rec->extent_item_refs) {
5396 fprintf(stderr, "ref mismatch on [%llu %llu] ",
5397 (unsigned long long)rec->start,
5398 (unsigned long long)rec->nr);
5399 fprintf(stderr, "extent item %llu, found %llu\n",
5400 (unsigned long long)rec->extent_item_refs,
5401 (unsigned long long)rec->refs);
5402 if (!fixed && repair) {
5403 ret = fixup_extent_refs(trans, root->fs_info,
5412 if (all_backpointers_checked(rec, 1)) {
5413 fprintf(stderr, "backpointer mismatch on [%llu %llu]\n",
5414 (unsigned long long)rec->start,
5415 (unsigned long long)rec->nr);
5417 if (!fixed && repair) {
5418 ret = fixup_extent_refs(trans, root->fs_info,
5427 if (!rec->owner_ref_checked) {
5428 fprintf(stderr, "owner ref check failed [%llu %llu]\n",
5429 (unsigned long long)rec->start,
5430 (unsigned long long)rec->nr);
5431 if (!fixed && repair) {
5432 ret = fixup_extent_refs(trans, root->fs_info,
5441 remove_cache_extent(extent_cache, cache);
5442 free_all_extent_backrefs(rec);
5447 if (ret && ret != -EAGAIN) {
5448 fprintf(stderr, "failed to repair damaged filesystem, aborting\n");
5451 btrfs_fix_block_accounting(trans, root);
5454 fprintf(stderr, "repaired damaged extent references\n");
5460 u64 calc_stripe_length(u64 type, u64 length, int num_stripes)
5464 if (type & BTRFS_BLOCK_GROUP_RAID0) {
5465 stripe_size = length;
5466 stripe_size /= num_stripes;
5467 } else if (type & BTRFS_BLOCK_GROUP_RAID10) {
5468 stripe_size = length * 2;
5469 stripe_size /= num_stripes;
5470 } else if (type & BTRFS_BLOCK_GROUP_RAID5) {
5471 stripe_size = length;
5472 stripe_size /= (num_stripes - 1);
5473 } else if (type & BTRFS_BLOCK_GROUP_RAID6) {
5474 stripe_size = length;
5475 stripe_size /= (num_stripes - 2);
5477 stripe_size = length;
5482 static int check_chunk_refs(struct chunk_record *chunk_rec,
5483 struct block_group_tree *block_group_cache,
5484 struct device_extent_tree *dev_extent_cache,
5487 struct cache_extent *block_group_item;
5488 struct block_group_record *block_group_rec;
5489 struct cache_extent *dev_extent_item;
5490 struct device_extent_record *dev_extent_rec;
5497 block_group_item = lookup_cache_extent(&block_group_cache->tree,
5500 if (block_group_item) {
5501 block_group_rec = container_of(block_group_item,
5502 struct block_group_record,
5504 if (chunk_rec->length != block_group_rec->offset ||
5505 chunk_rec->offset != block_group_rec->objectid ||
5506 chunk_rec->type_flags != block_group_rec->flags) {
5509 "Chunk[%llu, %u, %llu]: length(%llu), offset(%llu), type(%llu) mismatch with block group[%llu, %u, %llu]: offset(%llu), objectid(%llu), flags(%llu)\n",
5510 chunk_rec->objectid,
5515 chunk_rec->type_flags,
5516 block_group_rec->objectid,
5517 block_group_rec->type,
5518 block_group_rec->offset,
5519 block_group_rec->offset,
5520 block_group_rec->objectid,
5521 block_group_rec->flags);
5524 list_del_init(&block_group_rec->list);
5525 chunk_rec->bg_rec = block_group_rec;
5530 "Chunk[%llu, %u, %llu]: length(%llu), offset(%llu), type(%llu) is not found in block group\n",
5531 chunk_rec->objectid,
5536 chunk_rec->type_flags);
5540 length = calc_stripe_length(chunk_rec->type_flags, chunk_rec->length,
5541 chunk_rec->num_stripes);
5542 for (i = 0; i < chunk_rec->num_stripes; ++i) {
5543 devid = chunk_rec->stripes[i].devid;
5544 offset = chunk_rec->stripes[i].offset;
5545 dev_extent_item = lookup_cache_extent2(&dev_extent_cache->tree,
5546 devid, offset, length);
5547 if (dev_extent_item) {
5548 dev_extent_rec = container_of(dev_extent_item,
5549 struct device_extent_record,
5551 if (dev_extent_rec->objectid != devid ||
5552 dev_extent_rec->offset != offset ||
5553 dev_extent_rec->chunk_offset != chunk_rec->offset ||
5554 dev_extent_rec->length != length) {
5557 "Chunk[%llu, %u, %llu] stripe[%llu, %llu] dismatch dev extent[%llu, %llu, %llu]\n",
5558 chunk_rec->objectid,
5561 chunk_rec->stripes[i].devid,
5562 chunk_rec->stripes[i].offset,
5563 dev_extent_rec->objectid,
5564 dev_extent_rec->offset,
5565 dev_extent_rec->length);
5568 list_move(&dev_extent_rec->chunk_list,
5569 &chunk_rec->dextents);
5574 "Chunk[%llu, %u, %llu] stripe[%llu, %llu] is not found in dev extent\n",
5575 chunk_rec->objectid,
5578 chunk_rec->stripes[i].devid,
5579 chunk_rec->stripes[i].offset);
5586 /* check btrfs_chunk -> btrfs_dev_extent / btrfs_block_group_item */
5587 int check_chunks(struct cache_tree *chunk_cache,
5588 struct block_group_tree *block_group_cache,
5589 struct device_extent_tree *dev_extent_cache,
5590 struct list_head *good, struct list_head *bad, int silent)
5592 struct cache_extent *chunk_item;
5593 struct chunk_record *chunk_rec;
5594 struct block_group_record *bg_rec;
5595 struct device_extent_record *dext_rec;
5599 chunk_item = first_cache_extent(chunk_cache);
5600 while (chunk_item) {
5601 chunk_rec = container_of(chunk_item, struct chunk_record,
5603 err = check_chunk_refs(chunk_rec, block_group_cache,
5604 dev_extent_cache, silent);
5608 list_add_tail(&chunk_rec->list, bad);
5611 list_add_tail(&chunk_rec->list, good);
5614 chunk_item = next_cache_extent(chunk_item);
5617 list_for_each_entry(bg_rec, &block_group_cache->block_groups, list) {
5620 "Block group[%llu, %llu] (flags = %llu) didn't find the relative chunk.\n",
5628 list_for_each_entry(dext_rec, &dev_extent_cache->no_chunk_orphans,
5632 "Device extent[%llu, %llu, %llu] didn't find the relative chunk.\n",
5643 static int check_device_used(struct device_record *dev_rec,
5644 struct device_extent_tree *dext_cache)
5646 struct cache_extent *cache;
5647 struct device_extent_record *dev_extent_rec;
5650 cache = search_cache_extent2(&dext_cache->tree, dev_rec->devid, 0);
5652 dev_extent_rec = container_of(cache,
5653 struct device_extent_record,
5655 if (dev_extent_rec->objectid != dev_rec->devid)
5658 list_del(&dev_extent_rec->device_list);
5659 total_byte += dev_extent_rec->length;
5660 cache = next_cache_extent(cache);
5663 if (total_byte != dev_rec->byte_used) {
5665 "Dev extent's total-byte(%llu) is not equal to byte-used(%llu) in dev[%llu, %u, %llu]\n",
5666 total_byte, dev_rec->byte_used, dev_rec->objectid,
5667 dev_rec->type, dev_rec->offset);
5674 /* check btrfs_dev_item -> btrfs_dev_extent */
5675 static int check_devices(struct rb_root *dev_cache,
5676 struct device_extent_tree *dev_extent_cache)
5678 struct rb_node *dev_node;
5679 struct device_record *dev_rec;
5680 struct device_extent_record *dext_rec;
5684 dev_node = rb_first(dev_cache);
5686 dev_rec = container_of(dev_node, struct device_record, node);
5687 err = check_device_used(dev_rec, dev_extent_cache);
5691 dev_node = rb_next(dev_node);
5693 list_for_each_entry(dext_rec, &dev_extent_cache->no_device_orphans,
5696 "Device extent[%llu, %llu, %llu] didn't find its device.\n",
5697 dext_rec->objectid, dext_rec->offset, dext_rec->length);
5704 static int check_chunks_and_extents(struct btrfs_root *root)
5706 struct rb_root dev_cache;
5707 struct cache_tree chunk_cache;
5708 struct block_group_tree block_group_cache;
5709 struct device_extent_tree dev_extent_cache;
5710 struct cache_tree extent_cache;
5711 struct cache_tree seen;
5712 struct cache_tree pending;
5713 struct cache_tree reada;
5714 struct cache_tree nodes;
5715 struct cache_tree corrupt_blocks;
5716 struct btrfs_path path;
5717 struct btrfs_key key;
5718 struct btrfs_key found_key;
5721 struct block_info *bits;
5723 struct extent_buffer *leaf;
5724 struct btrfs_trans_handle *trans = NULL;
5726 struct btrfs_root_item ri;
5727 struct list_head dropping_trees;
5729 dev_cache = RB_ROOT;
5730 cache_tree_init(&chunk_cache);
5731 block_group_tree_init(&block_group_cache);
5732 device_extent_tree_init(&dev_extent_cache);
5734 cache_tree_init(&extent_cache);
5735 cache_tree_init(&seen);
5736 cache_tree_init(&pending);
5737 cache_tree_init(&nodes);
5738 cache_tree_init(&reada);
5739 cache_tree_init(&corrupt_blocks);
5740 INIT_LIST_HEAD(&dropping_trees);
5743 trans = btrfs_start_transaction(root, 1);
5744 if (IS_ERR(trans)) {
5745 fprintf(stderr, "Error starting transaction\n");
5746 return PTR_ERR(trans);
5748 root->fs_info->fsck_extent_cache = &extent_cache;
5749 root->fs_info->free_extent_hook = free_extent_hook;
5750 root->fs_info->corrupt_blocks = &corrupt_blocks;
5754 bits = malloc(bits_nr * sizeof(struct block_info));
5761 add_root_to_pending(root->fs_info->tree_root->node,
5762 &extent_cache, &pending, &seen, &nodes,
5763 &root->fs_info->tree_root->root_key);
5765 add_root_to_pending(root->fs_info->chunk_root->node,
5766 &extent_cache, &pending, &seen, &nodes,
5767 &root->fs_info->chunk_root->root_key);
5769 btrfs_init_path(&path);
5772 btrfs_set_key_type(&key, BTRFS_ROOT_ITEM_KEY);
5773 ret = btrfs_search_slot(NULL, root->fs_info->tree_root,
5777 leaf = path.nodes[0];
5778 slot = path.slots[0];
5779 if (slot >= btrfs_header_nritems(path.nodes[0])) {
5780 ret = btrfs_next_leaf(root, &path);
5783 leaf = path.nodes[0];
5784 slot = path.slots[0];
5786 btrfs_item_key_to_cpu(leaf, &found_key, path.slots[0]);
5787 if (btrfs_key_type(&found_key) == BTRFS_ROOT_ITEM_KEY) {
5788 unsigned long offset;
5789 struct extent_buffer *buf;
5791 offset = btrfs_item_ptr_offset(leaf, path.slots[0]);
5792 read_extent_buffer(leaf, &ri, offset, sizeof(ri));
5793 if (btrfs_disk_key_objectid(&ri.drop_progress) == 0) {
5794 buf = read_tree_block(root->fs_info->tree_root,
5795 btrfs_root_bytenr(&ri),
5796 btrfs_level_size(root,
5797 btrfs_root_level(&ri)),
5803 add_root_to_pending(buf, &extent_cache,
5804 &pending, &seen, &nodes,
5806 free_extent_buffer(buf);
5808 struct dropping_root_item_record *dri_rec;
5809 dri_rec = malloc(sizeof(*dri_rec));
5814 memcpy(&dri_rec->ri, &ri, sizeof(ri));
5815 memcpy(&dri_rec->found_key, &found_key,
5817 list_add_tail(&dri_rec->list, &dropping_trees);
5822 btrfs_release_path(&path);
5824 ret = run_next_block(trans, root, bits, bits_nr, &last,
5825 &pending, &seen, &reada, &nodes,
5826 &extent_cache, &chunk_cache, &dev_cache,
5827 &block_group_cache, &dev_extent_cache,
5833 while (!list_empty(&dropping_trees)) {
5834 struct dropping_root_item_record *rec;
5835 struct extent_buffer *buf;
5836 rec = list_entry(dropping_trees.next,
5837 struct dropping_root_item_record, list);
5843 buf = read_tree_block(root->fs_info->tree_root,
5844 btrfs_root_bytenr(&rec->ri),
5845 btrfs_level_size(root,
5846 btrfs_root_level(&rec->ri)), 0);
5851 add_root_to_pending(buf, &extent_cache, &pending,
5852 &seen, &nodes, &rec->found_key);
5854 ret = run_next_block(trans, root, bits, bits_nr, &last,
5855 &pending, &seen, &reada,
5856 &nodes, &extent_cache,
5857 &chunk_cache, &dev_cache,
5864 free_extent_buffer(buf);
5865 list_del(&rec->list);
5870 ret = check_extent_refs(trans, root, &extent_cache);
5871 if (ret == -EAGAIN) {
5872 ret = btrfs_commit_transaction(trans, root);
5876 trans = btrfs_start_transaction(root, 1);
5877 if (IS_ERR(trans)) {
5878 ret = PTR_ERR(trans);
5882 free_corrupt_blocks_tree(root->fs_info->corrupt_blocks);
5883 free_extent_cache_tree(&seen);
5884 free_extent_cache_tree(&pending);
5885 free_extent_cache_tree(&reada);
5886 free_extent_cache_tree(&nodes);
5887 free_extent_record_cache(root->fs_info, &extent_cache);
5891 err = check_chunks(&chunk_cache, &block_group_cache,
5892 &dev_extent_cache, NULL, NULL, 0);
5896 err = check_devices(&dev_cache, &dev_extent_cache);
5901 err = btrfs_commit_transaction(trans, root);
5907 free_corrupt_blocks_tree(root->fs_info->corrupt_blocks);
5908 root->fs_info->fsck_extent_cache = NULL;
5909 root->fs_info->free_extent_hook = NULL;
5910 root->fs_info->corrupt_blocks = NULL;
5913 free_chunk_cache_tree(&chunk_cache);
5914 free_device_cache_tree(&dev_cache);
5915 free_block_group_tree(&block_group_cache);
5916 free_device_extent_tree(&dev_extent_cache);
5920 static int btrfs_fsck_reinit_root(struct btrfs_trans_handle *trans,
5921 struct btrfs_root *root, int overwrite)
5923 struct extent_buffer *c;
5924 struct extent_buffer *old = root->node;
5927 struct btrfs_disk_key disk_key = {0,0,0};
5933 extent_buffer_get(c);
5936 c = btrfs_alloc_free_block(trans, root,
5937 btrfs_level_size(root, 0),
5938 root->root_key.objectid,
5939 &disk_key, level, 0, 0);
5942 extent_buffer_get(c);
5946 memset_extent_buffer(c, 0, 0, sizeof(struct btrfs_header));
5947 btrfs_set_header_level(c, level);
5948 btrfs_set_header_bytenr(c, c->start);
5949 btrfs_set_header_generation(c, trans->transid);
5950 btrfs_set_header_backref_rev(c, BTRFS_MIXED_BACKREF_REV);
5951 btrfs_set_header_owner(c, root->root_key.objectid);
5953 write_extent_buffer(c, root->fs_info->fsid,
5954 btrfs_header_fsid(), BTRFS_FSID_SIZE);
5956 write_extent_buffer(c, root->fs_info->chunk_tree_uuid,
5957 btrfs_header_chunk_tree_uuid(c),
5960 btrfs_mark_buffer_dirty(c);
5962 * this case can happen in the following case:
5964 * 1.overwrite previous root.
5966 * 2.reinit reloc data root, this is because we skip pin
5967 * down reloc data tree before which means we can allocate
5968 * same block bytenr here.
5970 if (old->start == c->start) {
5971 btrfs_set_root_generation(&root->root_item,
5973 root->root_item.level = btrfs_header_level(root->node);
5974 ret = btrfs_update_root(trans, root->fs_info->tree_root,
5975 &root->root_key, &root->root_item);
5977 free_extent_buffer(c);
5981 free_extent_buffer(old);
5983 add_root_to_dirty_list(root);
5987 static int pin_down_tree_blocks(struct btrfs_fs_info *fs_info,
5988 struct extent_buffer *eb, int tree_root)
5990 struct extent_buffer *tmp;
5991 struct btrfs_root_item *ri;
5992 struct btrfs_key key;
5995 int level = btrfs_header_level(eb);
6000 btrfs_pin_extent(fs_info, eb->start, eb->len);
6002 leafsize = btrfs_super_leafsize(fs_info->super_copy);
6003 nritems = btrfs_header_nritems(eb);
6004 for (i = 0; i < nritems; i++) {
6006 btrfs_item_key_to_cpu(eb, &key, i);
6007 if (key.type != BTRFS_ROOT_ITEM_KEY)
6009 /* Skip the extent root and reloc roots */
6010 if (key.objectid == BTRFS_EXTENT_TREE_OBJECTID ||
6011 key.objectid == BTRFS_TREE_RELOC_OBJECTID ||
6012 key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID)
6014 ri = btrfs_item_ptr(eb, i, struct btrfs_root_item);
6015 bytenr = btrfs_disk_root_bytenr(eb, ri);
6018 * If at any point we start needing the real root we
6019 * will have to build a stump root for the root we are
6020 * in, but for now this doesn't actually use the root so
6021 * just pass in extent_root.
6023 tmp = read_tree_block(fs_info->extent_root, bytenr,
6026 fprintf(stderr, "Error reading root block\n");
6029 ret = pin_down_tree_blocks(fs_info, tmp, 0);
6030 free_extent_buffer(tmp);
6034 bytenr = btrfs_node_blockptr(eb, i);
6036 /* If we aren't the tree root don't read the block */
6037 if (level == 1 && !tree_root) {
6038 btrfs_pin_extent(fs_info, bytenr, leafsize);
6042 tmp = read_tree_block(fs_info->extent_root, bytenr,
6045 fprintf(stderr, "Error reading tree block\n");
6048 ret = pin_down_tree_blocks(fs_info, tmp, tree_root);
6049 free_extent_buffer(tmp);
6058 static int pin_metadata_blocks(struct btrfs_fs_info *fs_info)
6062 ret = pin_down_tree_blocks(fs_info, fs_info->chunk_root->node, 0);
6066 return pin_down_tree_blocks(fs_info, fs_info->tree_root->node, 1);
6069 static int reset_block_groups(struct btrfs_fs_info *fs_info)
6071 struct btrfs_block_group_cache *cache;
6072 struct btrfs_path *path;
6073 struct extent_buffer *leaf;
6074 struct btrfs_chunk *chunk;
6075 struct btrfs_key key;
6079 path = btrfs_alloc_path();
6084 key.type = BTRFS_CHUNK_ITEM_KEY;
6087 ret = btrfs_search_slot(NULL, fs_info->chunk_root, &key, path, 0, 0);
6089 btrfs_free_path(path);
6094 * We do this in case the block groups were screwed up and had alloc
6095 * bits that aren't actually set on the chunks. This happens with
6096 * restored images every time and could happen in real life I guess.
6098 fs_info->avail_data_alloc_bits = 0;
6099 fs_info->avail_metadata_alloc_bits = 0;
6100 fs_info->avail_system_alloc_bits = 0;
6102 /* First we need to create the in-memory block groups */
6104 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) {
6105 ret = btrfs_next_leaf(fs_info->chunk_root, path);
6107 btrfs_free_path(path);
6115 leaf = path->nodes[0];
6116 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
6117 if (key.type != BTRFS_CHUNK_ITEM_KEY) {
6122 chunk = btrfs_item_ptr(leaf, path->slots[0],
6123 struct btrfs_chunk);
6124 btrfs_add_block_group(fs_info, 0,
6125 btrfs_chunk_type(leaf, chunk),
6126 key.objectid, key.offset,
6127 btrfs_chunk_length(leaf, chunk));
6128 set_extent_dirty(&fs_info->free_space_cache, key.offset,
6129 key.offset + btrfs_chunk_length(leaf, chunk),
6135 cache = btrfs_lookup_first_block_group(fs_info, start);
6139 start = cache->key.objectid + cache->key.offset;
6142 btrfs_free_path(path);
6146 static int reset_balance(struct btrfs_trans_handle *trans,
6147 struct btrfs_fs_info *fs_info)
6149 struct btrfs_root *root = fs_info->tree_root;
6150 struct btrfs_path *path;
6151 struct extent_buffer *leaf;
6152 struct btrfs_key key;
6153 int del_slot, del_nr = 0;
6157 path = btrfs_alloc_path();
6161 key.objectid = BTRFS_BALANCE_OBJECTID;
6162 key.type = BTRFS_BALANCE_ITEM_KEY;
6165 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
6170 goto reinit_data_reloc;
6175 ret = btrfs_del_item(trans, root, path);
6178 btrfs_release_path(path);
6180 key.objectid = BTRFS_TREE_RELOC_OBJECTID;
6181 key.type = BTRFS_ROOT_ITEM_KEY;
6184 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
6188 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) {
6193 ret = btrfs_del_items(trans, root, path,
6200 btrfs_release_path(path);
6203 ret = btrfs_search_slot(trans, root, &key, path,
6210 leaf = path->nodes[0];
6211 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
6212 if (key.objectid > BTRFS_TREE_RELOC_OBJECTID)
6214 if (key.objectid != BTRFS_TREE_RELOC_OBJECTID) {
6219 del_slot = path->slots[0];
6228 ret = btrfs_del_items(trans, root, path, del_slot, del_nr);
6232 btrfs_release_path(path);
6235 key.objectid = BTRFS_DATA_RELOC_TREE_OBJECTID;
6236 key.type = BTRFS_ROOT_ITEM_KEY;
6237 key.offset = (u64)-1;
6238 root = btrfs_read_fs_root(fs_info, &key);
6240 fprintf(stderr, "Error reading data reloc tree\n");
6241 return PTR_ERR(root);
6243 root->track_dirty = 1;
6244 if (root->last_trans != trans->transid) {
6245 root->last_trans = trans->transid;
6246 root->commit_root = root->node;
6247 extent_buffer_get(root->node);
6249 ret = btrfs_fsck_reinit_root(trans, root, 0);
6252 ret = btrfs_make_root_dir(trans, root, BTRFS_FIRST_FREE_OBJECTID);
6254 btrfs_free_path(path);
6258 static int reinit_extent_tree(struct btrfs_trans_handle *trans,
6259 struct btrfs_fs_info *fs_info)
6265 * The only reason we don't do this is because right now we're just
6266 * walking the trees we find and pinning down their bytes, we don't look
6267 * at any of the leaves. In order to do mixed groups we'd have to check
6268 * the leaves of any fs roots and pin down the bytes for any file
6269 * extents we find. Not hard but why do it if we don't have to?
6271 if (btrfs_fs_incompat(fs_info, BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS)) {
6272 fprintf(stderr, "We don't support re-initing the extent tree "
6273 "for mixed block groups yet, please notify a btrfs "
6274 "developer you want to do this so they can add this "
6275 "functionality.\n");
6280 * first we need to walk all of the trees except the extent tree and pin
6281 * down the bytes that are in use so we don't overwrite any existing
6284 ret = pin_metadata_blocks(fs_info);
6286 fprintf(stderr, "error pinning down used bytes\n");
6291 * Need to drop all the block groups since we're going to recreate all
6294 btrfs_free_block_groups(fs_info);
6295 ret = reset_block_groups(fs_info);
6297 fprintf(stderr, "error resetting the block groups\n");
6301 /* Ok we can allocate now, reinit the extent root */
6302 ret = btrfs_fsck_reinit_root(trans, fs_info->extent_root, 0);
6304 fprintf(stderr, "extent root initialization failed\n");
6306 * When the transaction code is updated we should end the
6307 * transaction, but for now progs only knows about commit so
6308 * just return an error.
6314 * Now we have all the in-memory block groups setup so we can make
6315 * allocations properly, and the metadata we care about is safe since we
6316 * pinned all of it above.
6319 struct btrfs_block_group_cache *cache;
6321 cache = btrfs_lookup_first_block_group(fs_info, start);
6324 start = cache->key.objectid + cache->key.offset;
6325 ret = btrfs_insert_item(trans, fs_info->extent_root,
6326 &cache->key, &cache->item,
6327 sizeof(cache->item));
6329 fprintf(stderr, "Error adding block group\n");
6332 btrfs_extent_post_op(trans, fs_info->extent_root);
6335 ret = reset_balance(trans, fs_info);
6337 fprintf(stderr, "error reseting the pending balance\n");
6342 static int recow_extent_buffer(struct btrfs_root *root, struct extent_buffer *eb)
6344 struct btrfs_path *path;
6345 struct btrfs_trans_handle *trans;
6346 struct btrfs_key key;
6349 printf("Recowing metadata block %llu\n", eb->start);
6350 key.objectid = btrfs_header_owner(eb);
6351 key.type = BTRFS_ROOT_ITEM_KEY;
6352 key.offset = (u64)-1;
6354 root = btrfs_read_fs_root(root->fs_info, &key);
6356 fprintf(stderr, "Couldn't find owner root %llu\n",
6358 return PTR_ERR(root);
6361 path = btrfs_alloc_path();
6365 trans = btrfs_start_transaction(root, 1);
6366 if (IS_ERR(trans)) {
6367 btrfs_free_path(path);
6368 return PTR_ERR(trans);
6371 path->lowest_level = btrfs_header_level(eb);
6372 if (path->lowest_level)
6373 btrfs_node_key_to_cpu(eb, &key, 0);
6375 btrfs_item_key_to_cpu(eb, &key, 0);
6377 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
6378 btrfs_commit_transaction(trans, root);
6379 btrfs_free_path(path);
6383 static int delete_bad_item(struct btrfs_root *root, struct bad_item *bad)
6385 struct btrfs_path *path;
6386 struct btrfs_trans_handle *trans;
6387 struct btrfs_key key;
6390 printf("Deleting bad item [%llu,%u,%llu]\n", bad->key.objectid,
6391 bad->key.type, bad->key.offset);
6392 key.objectid = bad->root_id;
6393 key.type = BTRFS_ROOT_ITEM_KEY;
6394 key.offset = (u64)-1;
6396 root = btrfs_read_fs_root(root->fs_info, &key);
6398 fprintf(stderr, "Couldn't find owner root %llu\n",
6400 return PTR_ERR(root);
6403 path = btrfs_alloc_path();
6407 trans = btrfs_start_transaction(root, 1);
6408 if (IS_ERR(trans)) {
6409 btrfs_free_path(path);
6410 return PTR_ERR(trans);
6413 ret = btrfs_search_slot(trans, root, &bad->key, path, -1, 1);
6419 ret = btrfs_del_item(trans, root, path);
6421 btrfs_commit_transaction(trans, root);
6422 btrfs_free_path(path);
6426 static struct option long_options[] = {
6427 { "super", 1, NULL, 's' },
6428 { "repair", 0, NULL, 0 },
6429 { "init-csum-tree", 0, NULL, 0 },
6430 { "init-extent-tree", 0, NULL, 0 },
6431 { "backup", 0, NULL, 0 },
6435 const char * const cmd_check_usage[] = {
6436 "btrfs check [options] <device>",
6437 "Check an unmounted btrfs filesystem.",
6439 "-s|--super <superblock> use this superblock copy",
6440 "-b|--backup use the backup root copy",
6441 "--repair try to repair the filesystem",
6442 "--init-csum-tree create a new CRC tree",
6443 "--init-extent-tree create a new extent tree",
6447 int cmd_check(int argc, char **argv)
6449 struct cache_tree root_cache;
6450 struct btrfs_root *root;
6451 struct btrfs_fs_info *info;
6453 char uuidbuf[BTRFS_UUID_UNPARSED_SIZE];
6456 int option_index = 0;
6457 int init_csum_tree = 0;
6458 enum btrfs_open_ctree_flags ctree_flags =
6459 OPEN_CTREE_PARTIAL | OPEN_CTREE_EXCLUSIVE;
6463 c = getopt_long(argc, argv, "as:b", long_options,
6468 case 'a': /* ignored */ break;
6470 ctree_flags |= OPEN_CTREE_BACKUP_ROOT;
6473 num = arg_strtou64(optarg);
6474 if (num >= BTRFS_SUPER_MIRROR_MAX) {
6476 "ERROR: super mirror should be less than: %d\n",
6477 BTRFS_SUPER_MIRROR_MAX);
6480 bytenr = btrfs_sb_offset(((int)num));
6481 printf("using SB copy %llu, bytenr %llu\n", num,
6482 (unsigned long long)bytenr);
6486 usage(cmd_check_usage);
6488 if (option_index == 1) {
6489 printf("enabling repair mode\n");
6491 ctree_flags |= OPEN_CTREE_WRITES;
6492 } else if (option_index == 2) {
6493 printf("Creating a new CRC tree\n");
6496 ctree_flags |= OPEN_CTREE_WRITES;
6497 } else if (option_index == 3) {
6498 init_extent_tree = 1;
6499 ctree_flags |= (OPEN_CTREE_WRITES |
6500 OPEN_CTREE_NO_BLOCK_GROUPS);
6505 argc = argc - optind;
6508 usage(cmd_check_usage);
6511 cache_tree_init(&root_cache);
6513 if((ret = check_mounted(argv[optind])) < 0) {
6514 fprintf(stderr, "Could not check mount status: %s\n", strerror(-ret));
6517 fprintf(stderr, "%s is currently mounted. Aborting.\n", argv[optind]);
6522 info = open_ctree_fs_info(argv[optind], bytenr, 0, ctree_flags);
6524 fprintf(stderr, "Couldn't open file system\n");
6529 root = info->fs_root;
6530 uuid_unparse(info->super_copy->fsid, uuidbuf);
6531 printf("Checking filesystem on %s\nUUID: %s\n", argv[optind], uuidbuf);
6533 if (!extent_buffer_uptodate(info->tree_root->node) ||
6534 !extent_buffer_uptodate(info->dev_root->node) ||
6535 !extent_buffer_uptodate(info->chunk_root->node)) {
6536 fprintf(stderr, "Critical roots corrupted, unable to fsck the FS\n");
6541 if (init_extent_tree || init_csum_tree) {
6542 struct btrfs_trans_handle *trans;
6544 trans = btrfs_start_transaction(info->extent_root, 0);
6545 if (IS_ERR(trans)) {
6546 fprintf(stderr, "Error starting transaction\n");
6547 ret = PTR_ERR(trans);
6551 if (init_extent_tree) {
6552 printf("Creating a new extent tree\n");
6553 ret = reinit_extent_tree(trans, info);
6558 if (init_csum_tree) {
6559 fprintf(stderr, "Reinit crc root\n");
6560 ret = btrfs_fsck_reinit_root(trans, info->csum_root, 0);
6562 fprintf(stderr, "crc root initialization failed\n");
6568 * Ok now we commit and run the normal fsck, which will add
6569 * extent entries for all of the items it finds.
6571 ret = btrfs_commit_transaction(trans, info->extent_root);
6575 if (!extent_buffer_uptodate(info->extent_root->node)) {
6576 fprintf(stderr, "Critical roots corrupted, unable to fsck the FS\n");
6581 fprintf(stderr, "checking extents\n");
6582 ret = check_chunks_and_extents(root);
6584 fprintf(stderr, "Errors found in extent allocation tree or chunk allocation\n");
6586 fprintf(stderr, "checking free space cache\n");
6587 ret = check_space_cache(root);
6592 * We used to have to have these hole extents in between our real
6593 * extents so if we don't have this flag set we need to make sure there
6594 * are no gaps in the file extents for inodes, otherwise we can just
6595 * ignore it when this happens.
6597 no_holes = btrfs_fs_incompat(root->fs_info,
6598 BTRFS_FEATURE_INCOMPAT_NO_HOLES);
6599 fprintf(stderr, "checking fs roots\n");
6600 ret = check_fs_roots(root, &root_cache);
6604 fprintf(stderr, "checking csums\n");
6605 ret = check_csums(root);
6609 fprintf(stderr, "checking root refs\n");
6610 ret = check_root_refs(root, &root_cache);
6614 while (repair && !list_empty(&root->fs_info->recow_ebs)) {
6615 struct extent_buffer *eb;
6617 eb = list_first_entry(&root->fs_info->recow_ebs,
6618 struct extent_buffer, recow);
6619 ret = recow_extent_buffer(root, eb);
6624 while (!list_empty(&delete_items)) {
6625 struct bad_item *bad;
6627 bad = list_first_entry(&delete_items, struct bad_item, list);
6628 list_del_init(&bad->list);
6630 ret = delete_bad_item(root, bad);
6634 if (!list_empty(&root->fs_info->recow_ebs)) {
6635 fprintf(stderr, "Transid errors in file system\n");
6639 if (found_old_backref) { /*
6640 * there was a disk format change when mixed
6641 * backref was in testing tree. The old format
6642 * existed about one week.
6644 printf("\n * Found old mixed backref format. "
6645 "The old format is not supported! *"
6646 "\n * Please mount the FS in readonly mode, "
6647 "backup data and re-format the FS. *\n\n");
6650 printf("found %llu bytes used err is %d\n",
6651 (unsigned long long)bytes_used, ret);
6652 printf("total csum bytes: %llu\n",(unsigned long long)total_csum_bytes);
6653 printf("total tree bytes: %llu\n",
6654 (unsigned long long)total_btree_bytes);
6655 printf("total fs tree bytes: %llu\n",
6656 (unsigned long long)total_fs_tree_bytes);
6657 printf("total extent tree bytes: %llu\n",
6658 (unsigned long long)total_extent_tree_bytes);
6659 printf("btree space waste bytes: %llu\n",
6660 (unsigned long long)btree_space_waste);
6661 printf("file data blocks allocated: %llu\n referenced %llu\n",
6662 (unsigned long long)data_bytes_allocated,
6663 (unsigned long long)data_bytes_referenced);
6664 printf("%s\n", BTRFS_BUILD_VERSION);
6666 free_root_recs_tree(&root_cache);