?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
Fix use after free in close_ctree
[btrfs-progs-unstable.git] / btrfsck.c
blobaf5746f758d491a37d160c55bff3028063833312
1 /*
2 * Copyright (C) 2007 Oracle. All rights reserved.
3 *
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.
7 *
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.
12 *
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.
17 */
18
19 #define _XOPEN_SOURCE 500
20 #define _GNU_SOURCE 1
21 #include <stdio.h>
22 #include <stdlib.h>
23 #include <fcntl.h>
24 #include <sys/stat.h>
25 #include "kerncompat.h"
26 #include "ctree.h"
27 #include "disk-io.h"
28 #include "print-tree.h"
29 #include "transaction.h"
30 #include "list.h"
31 #include "version.h"
32 #include "utils.h"
33
34 static u64 bytes_used = 0;
35 static u64 total_csum_bytes = 0;
36 static u64 total_btree_bytes = 0;
37 static u64 total_fs_tree_bytes = 0;
38 static u64 btree_space_waste = 0;
39 static u64 data_bytes_allocated = 0;
40 static u64 data_bytes_referenced = 0;
41 static int found_old_backref = 0;
42
43 struct extent_backref {
44 struct list_head list;
45 unsigned int is_data:1;
46 unsigned int found_extent_tree:1;
47 unsigned int full_backref:1;
48 unsigned int found_ref:1;
49 };
50
51 struct data_backref {
52 struct extent_backref node;
53 union {
54 u64 parent;
55 u64 root;
56 };
57 u64 owner;
58 u64 offset;
59 u32 num_refs;
60 u32 found_ref;
61 };
62
63 struct tree_backref {
64 struct extent_backref node;
65 union {
66 u64 parent;
67 u64 root;
68 };
69 };
70
71 struct extent_record {
72 struct list_head backrefs;
73 struct cache_extent cache;
74 struct btrfs_disk_key parent_key;
75 u64 start;
76 u64 nr;
77 u64 refs;
78 u64 extent_item_refs;
79 unsigned int content_checked:1;
80 unsigned int owner_ref_checked:1;
81 unsigned int is_root:1;
82 };
83
84 struct inode_backref {
85 struct list_head list;
86 unsigned int found_dir_item:1;
87 unsigned int found_dir_index:1;
88 unsigned int found_inode_ref:1;
89 unsigned int filetype:8;
90 int errors;
91 u64 dir;
92 u64 index;
93 u16 namelen;
94 char name[0];
95 };
96
97 #define REF_ERR_NO_DIR_ITEM (1 << 0)
98 #define REF_ERR_NO_DIR_INDEX (1 << 1)
99 #define REF_ERR_NO_INODE_REF (1 << 2)
100 #define REF_ERR_DUP_DIR_ITEM (1 << 3)
101 #define REF_ERR_DUP_DIR_INDEX (1 << 4)
102 #define REF_ERR_DUP_INODE_REF (1 << 5)
103 #define REF_ERR_INDEX_UNMATCH (1 << 6)
104 #define REF_ERR_FILETYPE_UNMATCH (1 << 7)
105 #define REF_ERR_NAME_TOO_LONG (1 << 8) // 100
106 #define REF_ERR_NO_ROOT_REF (1 << 9)
107 #define REF_ERR_NO_ROOT_BACKREF (1 << 10)
108 #define REF_ERR_DUP_ROOT_REF (1 << 11)
109 #define REF_ERR_DUP_ROOT_BACKREF (1 << 12)
110
111 struct inode_record {
112 struct list_head backrefs;
113 unsigned int checked:1;
114 unsigned int merging:1;
115 unsigned int found_inode_item:1;
116 unsigned int found_dir_item:1;
117 unsigned int found_file_extent:1;
118 unsigned int found_csum_item:1;
119 unsigned int some_csum_missing:1;
120 unsigned int nodatasum:1;
121 int errors;
122
123 u64 ino;
124 u32 nlink;
125 u32 imode;
126 u64 isize;
127 u64 nbytes;
128
129 u32 found_link;
130 u64 found_size;
131 u64 extent_start;
132 u64 extent_end;
133 u64 first_extent_gap;
134
135 u32 refs;
136 };
137
138 #define I_ERR_NO_INODE_ITEM (1 << 0)
139 #define I_ERR_NO_ORPHAN_ITEM (1 << 1)
140 #define I_ERR_DUP_INODE_ITEM (1 << 2)
141 #define I_ERR_DUP_DIR_INDEX (1 << 3)
142 #define I_ERR_ODD_DIR_ITEM (1 << 4)
143 #define I_ERR_ODD_FILE_EXTENT (1 << 5)
144 #define I_ERR_BAD_FILE_EXTENT (1 << 6)
145 #define I_ERR_FILE_EXTENT_OVERLAP (1 << 7)
146 #define I_ERR_FILE_EXTENT_DISCOUNT (1 << 8) // 100
147 #define I_ERR_DIR_ISIZE_WRONG (1 << 9)
148 #define I_ERR_FILE_NBYTES_WRONG (1 << 10) // 400
149 #define I_ERR_ODD_CSUM_ITEM (1 << 11)
150 #define I_ERR_SOME_CSUM_MISSING (1 << 12)
151 #define I_ERR_LINK_COUNT_WRONG (1 << 13)
152
153 struct root_backref {
154 struct list_head list;
155 unsigned int found_dir_item:1;
156 unsigned int found_dir_index:1;
157 unsigned int found_back_ref:1;
158 unsigned int found_forward_ref:1;
159 unsigned int reachable:1;
160 int errors;
161 u64 ref_root;
162 u64 dir;
163 u64 index;
164 u16 namelen;
165 char name[0];
166 };
167
168 struct root_record {
169 struct list_head backrefs;
170 struct cache_extent cache;
171 unsigned int found_root_item:1;
172 u64 objectid;
173 u32 found_ref;
174 };
175
176 struct ptr_node {
177 struct cache_extent cache;
178 void *data;
179 };
180
181 struct shared_node {
182 struct cache_extent cache;
183 struct cache_tree root_cache;
184 struct cache_tree inode_cache;
185 struct inode_record *current;
186 u32 refs;
187 };
188
189 struct block_info {
190 u64 start;
191 u32 size;
192 };
193
194 struct walk_control {
195 struct cache_tree shared;
196 struct shared_node *nodes[BTRFS_MAX_LEVEL];
197 int active_node;
198 int root_level;
199 };
200
201 static u8 imode_to_type(u32 imode)
202 {
203 #define S_SHIFT 12
204 static unsigned char btrfs_type_by_mode[S_IFMT >> S_SHIFT] = {
205 [S_IFREG >> S_SHIFT] = BTRFS_FT_REG_FILE,
206 [S_IFDIR >> S_SHIFT] = BTRFS_FT_DIR,
207 [S_IFCHR >> S_SHIFT] = BTRFS_FT_CHRDEV,
208 [S_IFBLK >> S_SHIFT] = BTRFS_FT_BLKDEV,
209 [S_IFIFO >> S_SHIFT] = BTRFS_FT_FIFO,
210 [S_IFSOCK >> S_SHIFT] = BTRFS_FT_SOCK,
211 [S_IFLNK >> S_SHIFT] = BTRFS_FT_SYMLINK,
212 };
213
214 return btrfs_type_by_mode[(imode & S_IFMT) >> S_SHIFT];
215 #undef S_SHIFT
216 }
217
218 static struct inode_record *clone_inode_rec(struct inode_record *orig_rec)
219 {
220 struct inode_record *rec;
221 struct inode_backref *backref;
222 struct inode_backref *orig;
223 size_t size;
224
225 rec = malloc(sizeof(*rec));
226 memcpy(rec, orig_rec, sizeof(*rec));
227 rec->refs = 1;
228 INIT_LIST_HEAD(&rec->backrefs);
229
230 list_for_each_entry(orig, &orig_rec->backrefs, list) {
231 size = sizeof(*orig) + orig->namelen + 1;
232 backref = malloc(size);
233 memcpy(backref, orig, size);
234 list_add_tail(&backref->list, &rec->backrefs);
235 }
236 return rec;
237 }
238
239 static struct inode_record *get_inode_rec(struct cache_tree *inode_cache,
240 u64 ino, int mod)
241 {
242 struct ptr_node *node;
243 struct cache_extent *cache;
244 struct inode_record *rec = NULL;
245 int ret;
246
247 cache = find_cache_extent(inode_cache, ino, 1);
248 if (cache) {
249 node = container_of(cache, struct ptr_node, cache);
250 rec = node->data;
251 if (mod && rec->refs > 1) {
252 node->data = clone_inode_rec(rec);
253 rec->refs--;
254 rec = node->data;
255 }
256 } else if (mod) {
257 rec = calloc(1, sizeof(*rec));
258 rec->ino = ino;
259 rec->extent_start = (u64)-1;
260 rec->first_extent_gap = (u64)-1;
261 rec->refs = 1;
262 INIT_LIST_HEAD(&rec->backrefs);
263
264 node = malloc(sizeof(*node));
265 node->cache.start = ino;
266 node->cache.size = 1;
267 node->data = rec;
268
269 ret = insert_existing_cache_extent(inode_cache, &node->cache);
270 BUG_ON(ret);
271 }
272 return rec;
273 }
274
275 static void free_inode_rec(struct inode_record *rec)
276 {
277 struct inode_backref *backref;
278
279 if (--rec->refs > 0)
280 return;
281
282 while (!list_empty(&rec->backrefs)) {
283 backref = list_entry(rec->backrefs.next,
284 struct inode_backref, list);
285 list_del(&backref->list);
286 free(backref);
287 }
288 free(rec);
289 }
290
291 static int can_free_inode_rec(struct inode_record *rec)
292 {
293 if (!rec->errors && rec->checked && rec->found_inode_item &&
294 rec->nlink == rec->found_link && list_empty(&rec->backrefs))
295 return 1;
296 return 0;
297 }
298
299 static void maybe_free_inode_rec(struct cache_tree *inode_cache,
300 struct inode_record *rec)
301 {
302 struct cache_extent *cache;
303 struct inode_backref *tmp, *backref;
304 struct ptr_node *node;
305 unsigned char filetype;
306
307 if (!rec->found_inode_item)
308 return;
309
310 filetype = imode_to_type(rec->imode);
311 list_for_each_entry_safe(backref, tmp, &rec->backrefs, list) {
312 if (backref->found_dir_item && backref->found_dir_index) {
313 if (backref->filetype != filetype)
314 backref->errors |= REF_ERR_FILETYPE_UNMATCH;
315 if (!backref->errors && backref->found_inode_ref) {
316 list_del(&backref->list);
317 free(backref);
318 }
319 }
320 }
321
322 if (!rec->checked || rec->merging)
323 return;
324
325 if (S_ISDIR(rec->imode)) {
326 if (rec->found_size != rec->isize)
327 rec->errors |= I_ERR_DIR_ISIZE_WRONG;
328 if (rec->found_file_extent)
329 rec->errors |= I_ERR_ODD_FILE_EXTENT;
330 } else if (S_ISREG(rec->imode) || S_ISLNK(rec->imode)) {
331 if (rec->found_dir_item)
332 rec->errors |= I_ERR_ODD_DIR_ITEM;
333 if (rec->found_size != rec->nbytes)
334 rec->errors |= I_ERR_FILE_NBYTES_WRONG;
335 if (rec->extent_start == (u64)-1 || rec->extent_start > 0)
336 rec->first_extent_gap = 0;
337 if (rec->nlink > 0 && (rec->extent_end < rec->isize ||
338 rec->first_extent_gap < rec->isize))
339 rec->errors |= I_ERR_FILE_EXTENT_DISCOUNT;
340 }
341
342 if (S_ISREG(rec->imode) || S_ISLNK(rec->imode)) {
343 if (rec->found_csum_item && rec->nodatasum)
344 rec->errors |= I_ERR_ODD_CSUM_ITEM;
345 if (rec->some_csum_missing && !rec->nodatasum)
346 rec->errors |= I_ERR_SOME_CSUM_MISSING;
347 }
348
349 BUG_ON(rec->refs != 1);
350 if (can_free_inode_rec(rec)) {
351 cache = find_cache_extent(inode_cache, rec->ino, 1);
352 node = container_of(cache, struct ptr_node, cache);
353 BUG_ON(node->data != rec);
354 remove_cache_extent(inode_cache, &node->cache);
355 free(node);
356 free_inode_rec(rec);
357 }
358 }
359
360 static int check_orphan_item(struct btrfs_root *root, u64 ino)
361 {
362 struct btrfs_path path;
363 struct btrfs_key key;
364 int ret;
365
366 key.objectid = BTRFS_ORPHAN_OBJECTID;
367 key.type = BTRFS_ORPHAN_ITEM_KEY;
368 key.offset = ino;
369
370 btrfs_init_path(&path);
371 ret = btrfs_search_slot(NULL, root, &key, &path, 0, 0);
372 btrfs_release_path(root, &path);
373 if (ret > 0)
374 ret = -ENOENT;
375 return ret;
376 }
377
378 static int process_inode_item(struct extent_buffer *eb,
379 int slot, struct btrfs_key *key,
380 struct shared_node *active_node)
381 {
382 struct inode_record *rec;
383 struct btrfs_inode_item *item;
384
385 rec = active_node->current;
386 BUG_ON(rec->ino != key->objectid || rec->refs > 1);
387 if (rec->found_inode_item) {
388 rec->errors |= I_ERR_DUP_INODE_ITEM;
389 return 1;
390 }
391 item = btrfs_item_ptr(eb, slot, struct btrfs_inode_item);
392 rec->nlink = btrfs_inode_nlink(eb, item);
393 rec->isize = btrfs_inode_size(eb, item);
394 rec->nbytes = btrfs_inode_nbytes(eb, item);
395 rec->imode = btrfs_inode_mode(eb, item);
396 if (btrfs_inode_flags(eb, item) & BTRFS_INODE_NODATASUM)
397 rec->nodatasum = 1;
398 rec->found_inode_item = 1;
399 if (rec->nlink == 0)
400 rec->errors |= I_ERR_NO_ORPHAN_ITEM;
401 maybe_free_inode_rec(&active_node->inode_cache, rec);
402 return 0;
403 }
404
405 static struct inode_backref *get_inode_backref(struct inode_record *rec,
406 const char *name,
407 int namelen, u64 dir)
408 {
409 struct inode_backref *backref;
410
411 list_for_each_entry(backref, &rec->backrefs, list) {
412 if (backref->dir != dir || backref->namelen != namelen)
413 continue;
414 if (memcmp(name, backref->name, namelen))
415 continue;
416 return backref;
417 }
418
419 backref = malloc(sizeof(*backref) + namelen + 1);
420 memset(backref, 0, sizeof(*backref));
421 backref->dir = dir;
422 backref->namelen = namelen;
423 memcpy(backref->name, name, namelen);
424 backref->name[namelen] = '\0';
425 list_add_tail(&backref->list, &rec->backrefs);
426 rec->found_link++;
427 return backref;
428 }
429
430 static int add_inode_backref(struct cache_tree *inode_cache,
431 u64 ino, u64 dir, u64 index,
432 const char *name, int namelen,
433 int filetype, int itemtype, int errors)
434 {
435 struct inode_record *rec;
436 struct inode_backref *backref;
437
438 rec = get_inode_rec(inode_cache, ino, 1);
439 backref = get_inode_backref(rec, name, namelen, dir);
440 if (errors)
441 backref->errors |= errors;
442 if (itemtype == BTRFS_DIR_INDEX_KEY) {
443 if (backref->found_dir_index)
444 backref->errors |= REF_ERR_DUP_DIR_INDEX;
445 if (backref->found_inode_ref && backref->index != index)
446 backref->errors |= REF_ERR_INDEX_UNMATCH;
447 if (backref->found_dir_item && backref->filetype != filetype)
448 backref->errors |= REF_ERR_FILETYPE_UNMATCH;
449
450 backref->index = index;
451 backref->filetype = filetype;
452 backref->found_dir_index = 1;
453 } else if (itemtype == BTRFS_DIR_ITEM_KEY) {
454 if (backref->found_dir_item)
455 backref->errors |= REF_ERR_DUP_DIR_ITEM;
456 if (backref->found_dir_index && backref->filetype != filetype)
457 backref->errors |= REF_ERR_FILETYPE_UNMATCH;
458
459 backref->filetype = filetype;
460 backref->found_dir_item = 1;
461 } else if (itemtype == BTRFS_INODE_REF_KEY) {
462 if (backref->found_inode_ref)
463 backref->errors |= REF_ERR_DUP_INODE_REF;
464 if (backref->found_dir_index && backref->index != index)
465 backref->errors |= REF_ERR_INDEX_UNMATCH;
466
467 backref->index = index;
468 backref->found_inode_ref = 1;
469 } else {
470 BUG_ON(1);
471 }
472
473 maybe_free_inode_rec(inode_cache, rec);
474 return 0;
475 }
476
477 static int merge_inode_recs(struct inode_record *src, struct inode_record *dst,
478 struct cache_tree *dst_cache)
479 {
480 struct inode_backref *backref;
481
482 dst->merging = 1;
483 list_for_each_entry(backref, &src->backrefs, list) {
484 if (backref->found_dir_index) {
485 add_inode_backref(dst_cache, dst->ino, backref->dir,
486 backref->index, backref->name,
487 backref->namelen, backref->filetype,
488 BTRFS_DIR_INDEX_KEY, backref->errors);
489 }
490 if (backref->found_dir_item) {
491 add_inode_backref(dst_cache, dst->ino,
492 backref->dir, 0, backref->name,
493 backref->namelen, backref->filetype,
494 BTRFS_DIR_ITEM_KEY, backref->errors);
495 }
496 if (backref->found_inode_ref) {
497 add_inode_backref(dst_cache, dst->ino,
498 backref->dir, backref->index,
499 backref->name, backref->namelen, 0,
500 BTRFS_INODE_REF_KEY, backref->errors);
501 }
502 }
503
504 if (src->found_dir_item)
505 dst->found_dir_item = 1;
506 if (src->found_file_extent)
507 dst->found_file_extent = 1;
508 if (src->found_csum_item)
509 dst->found_csum_item = 1;
510 if (src->some_csum_missing)
511 dst->some_csum_missing = 1;
512 if (dst->first_extent_gap > src->first_extent_gap)
513 dst->first_extent_gap = src->first_extent_gap;
514
515 dst->found_size += src->found_size;
516 if (src->extent_start != (u64)-1) {
517 if (dst->extent_start == (u64)-1) {
518 dst->extent_start = src->extent_start;
519 dst->extent_end = src->extent_end;
520 } else {
521 if (dst->extent_end > src->extent_start)
522 dst->errors |= I_ERR_FILE_EXTENT_OVERLAP;
523 else if (dst->extent_end < src->extent_start &&
524 dst->extent_end < dst->first_extent_gap)
525 dst->first_extent_gap = dst->extent_end;
526 if (dst->extent_end < src->extent_end)
527 dst->extent_end = src->extent_end;
528 }
529 }
530
531 dst->errors |= src->errors;
532 if (src->found_inode_item) {
533 if (!dst->found_inode_item) {
534 dst->nlink = src->nlink;
535 dst->isize = src->isize;
536 dst->nbytes = src->nbytes;
537 dst->imode = src->imode;
538 dst->nodatasum = src->nodatasum;
539 dst->found_inode_item = 1;
540 } else {
541 dst->errors |= I_ERR_DUP_INODE_ITEM;
542 }
543 }
544 dst->merging = 0;
545
546 return 0;
547 }
548
549 static int splice_shared_node(struct shared_node *src_node,
550 struct shared_node *dst_node)
551 {
552 struct cache_extent *cache;
553 struct ptr_node *node, *ins;
554 struct cache_tree *src, *dst;
555 struct inode_record *rec, *conflict;
556 u64 current_ino = 0;
557 int splice = 0;
558 int ret;
559
560 if (--src_node->refs == 0)
561 splice = 1;
562 if (src_node->current)
563 current_ino = src_node->current->ino;
564
565 src = &src_node->root_cache;
566 dst = &dst_node->root_cache;
567 again:
568 cache = find_first_cache_extent(src, 0);
569 while (cache) {
570 node = container_of(cache, struct ptr_node, cache);
571 rec = node->data;
572 cache = next_cache_extent(cache);
573
574 if (splice) {
575 remove_cache_extent(src, &node->cache);
576 ins = node;
577 } else {
578 ins = malloc(sizeof(*ins));
579 ins->cache.start = node->cache.start;
580 ins->cache.size = node->cache.size;
581 ins->data = rec;
582 rec->refs++;
583 }
584 ret = insert_existing_cache_extent(dst, &ins->cache);
585 if (ret == -EEXIST) {
586 conflict = get_inode_rec(dst, rec->ino, 1);
587 merge_inode_recs(rec, conflict, dst);
588 if (rec->checked) {
589 conflict->checked = 1;
590 if (dst_node->current == conflict)
591 dst_node->current = NULL;
592 }
593 maybe_free_inode_rec(dst, conflict);
594 free_inode_rec(rec);
595 free(ins);
596 } else {
597 BUG_ON(ret);
598 }
599 }
600
601 if (src == &src_node->root_cache) {
602 src = &src_node->inode_cache;
603 dst = &dst_node->inode_cache;
604 goto again;
605 }
606
607 if (current_ino > 0 && (!dst_node->current ||
608 current_ino > dst_node->current->ino)) {
609 if (dst_node->current) {
610 dst_node->current->checked = 1;
611 maybe_free_inode_rec(dst, dst_node->current);
612 }
613 dst_node->current = get_inode_rec(dst, current_ino, 1);
614 }
615 return 0;
616 }
617
618 static void free_inode_recs(struct cache_tree *inode_cache)
619 {
620 struct cache_extent *cache;
621 struct ptr_node *node;
622 struct inode_record *rec;
623
624 while (1) {
625 cache = find_first_cache_extent(inode_cache, 0);
626 if (!cache)
627 break;
628 node = container_of(cache, struct ptr_node, cache);
629 rec = node->data;
630 remove_cache_extent(inode_cache, &node->cache);
631 free(node);
632 free_inode_rec(rec);
633 }
634 }
635
636 static struct shared_node *find_shared_node(struct cache_tree *shared,
637 u64 bytenr)
638 {
639 struct cache_extent *cache;
640 struct shared_node *node;
641
642 cache = find_cache_extent(shared, bytenr, 1);
643 if (cache) {
644 node = container_of(cache, struct shared_node, cache);
645 return node;
646 }
647 return NULL;
648 }
649
650 static int add_shared_node(struct cache_tree *shared, u64 bytenr, u32 refs)
651 {
652 int ret;
653 struct shared_node *node;
654
655 node = calloc(1, sizeof(*node));
656 node->cache.start = bytenr;
657 node->cache.size = 1;
658 cache_tree_init(&node->root_cache);
659 cache_tree_init(&node->inode_cache);
660 node->refs = refs;
661
662 ret = insert_existing_cache_extent(shared, &node->cache);
663 BUG_ON(ret);
664 return 0;
665 }
666
667 static int enter_shared_node(struct btrfs_root *root, u64 bytenr, u32 refs,
668 struct walk_control *wc, int level)
669 {
670 struct shared_node *node;
671 struct shared_node *dest;
672
673 if (level == wc->active_node)
674 return 0;
675
676 BUG_ON(wc->active_node <= level);
677 node = find_shared_node(&wc->shared, bytenr);
678 if (!node) {
679 add_shared_node(&wc->shared, bytenr, refs);
680 node = find_shared_node(&wc->shared, bytenr);
681 wc->nodes[level] = node;
682 wc->active_node = level;
683 return 0;
684 }
685
686 if (wc->root_level == wc->active_node &&
687 btrfs_root_refs(&root->root_item) == 0) {
688 if (--node->refs == 0) {
689 free_inode_recs(&node->root_cache);
690 free_inode_recs(&node->inode_cache);
691 remove_cache_extent(&wc->shared, &node->cache);
692 free(node);
693 }
694 return 1;
695 }
696
697 dest = wc->nodes[wc->active_node];
698 splice_shared_node(node, dest);
699 if (node->refs == 0) {
700 remove_cache_extent(&wc->shared, &node->cache);
701 free(node);
702 }
703 return 1;
704 }
705
706 static int leave_shared_node(struct btrfs_root *root,
707 struct walk_control *wc, int level)
708 {
709 struct shared_node *node;
710 struct shared_node *dest;
711 int i;
712
713 if (level == wc->root_level)
714 return 0;
715
716 for (i = level + 1; i < BTRFS_MAX_LEVEL; i++) {
717 if (wc->nodes[i])
718 break;
719 }
720 BUG_ON(i >= BTRFS_MAX_LEVEL);
721
722 node = wc->nodes[wc->active_node];
723 wc->nodes[wc->active_node] = NULL;
724 wc->active_node = i;
725
726 dest = wc->nodes[wc->active_node];
727 if (wc->active_node < wc->root_level ||
728 btrfs_root_refs(&root->root_item) > 0) {
729 BUG_ON(node->refs <= 1);
730 splice_shared_node(node, dest);
731 } else {
732 BUG_ON(node->refs < 2);
733 node->refs--;
734 }
735 return 0;
736 }
737
738 static int process_dir_item(struct extent_buffer *eb,
739 int slot, struct btrfs_key *key,
740 struct shared_node *active_node)
741 {
742 u32 total;
743 u32 cur = 0;
744 u32 len;
745 u32 name_len;
746 u32 data_len;
747 int error;
748 int nritems = 0;
749 int filetype;
750 struct btrfs_dir_item *di;
751 struct inode_record *rec;
752 struct cache_tree *root_cache;
753 struct cache_tree *inode_cache;
754 struct btrfs_key location;
755 char namebuf[BTRFS_NAME_LEN];
756
757 root_cache = &active_node->root_cache;
758 inode_cache = &active_node->inode_cache;
759 rec = active_node->current;
760 rec->found_dir_item = 1;
761
762 di = btrfs_item_ptr(eb, slot, struct btrfs_dir_item);
763 total = btrfs_item_size_nr(eb, slot);
764 while (cur < total) {
765 nritems++;
766 btrfs_dir_item_key_to_cpu(eb, di, &location);
767 name_len = btrfs_dir_name_len(eb, di);
768 data_len = btrfs_dir_data_len(eb, di);
769 filetype = btrfs_dir_type(eb, di);
770
771 rec->found_size += name_len;
772 if (name_len <= BTRFS_NAME_LEN) {
773 len = name_len;
774 error = 0;
775 } else {
776 len = BTRFS_NAME_LEN;
777 error = REF_ERR_NAME_TOO_LONG;
778 }
779 read_extent_buffer(eb, namebuf, (unsigned long)(di + 1), len);
780
781 if (location.type == BTRFS_INODE_ITEM_KEY) {
782 add_inode_backref(inode_cache, location.objectid,
783 key->objectid, key->offset, namebuf,
784 len, filetype, key->type, error);
785 } else if (location.type == BTRFS_ROOT_ITEM_KEY) {
786 add_inode_backref(root_cache, location.objectid,
787 key->objectid, key->offset, namebuf,
788 len, filetype, key->type, error);
789 } else {
790 fprintf(stderr, "warning line %d\n", __LINE__);
791 }
792
793 len = sizeof(*di) + name_len + data_len;
794 di = (struct btrfs_dir_item *)((char *)di + len);
795 cur += len;
796 }
797 if (key->type == BTRFS_DIR_INDEX_KEY && nritems > 1)
798 rec->errors |= I_ERR_DUP_DIR_INDEX;
799
800 return 0;
801 }
802
803 static int process_inode_ref(struct extent_buffer *eb,
804 int slot, struct btrfs_key *key,
805 struct shared_node *active_node)
806 {
807 u32 total;
808 u32 cur = 0;
809 u32 len;
810 u32 name_len;
811 u64 index;
812 int error;
813 struct cache_tree *inode_cache;
814 struct btrfs_inode_ref *ref;
815 char namebuf[BTRFS_NAME_LEN];
816
817 inode_cache = &active_node->inode_cache;
818
819 ref = btrfs_item_ptr(eb, slot, struct btrfs_inode_ref);
820 total = btrfs_item_size_nr(eb, slot);
821 while (cur < total) {
822 name_len = btrfs_inode_ref_name_len(eb, ref);
823 index = btrfs_inode_ref_index(eb, ref);
824 if (name_len <= BTRFS_NAME_LEN) {
825 len = name_len;
826 error = 0;
827 } else {
828 len = BTRFS_NAME_LEN;
829 error = REF_ERR_NAME_TOO_LONG;
830 }
831 read_extent_buffer(eb, namebuf, (unsigned long)(ref + 1), len);
832 add_inode_backref(inode_cache, key->objectid, key->offset,
833 index, namebuf, len, 0, key->type, error);
834
835 len = sizeof(*ref) + name_len;
836 ref = (struct btrfs_inode_ref *)((char *)ref + len);
837 cur += len;
838 }
839 return 0;
840 }
841
842 static u64 count_csum_range(struct btrfs_root *root, u64 start, u64 len)
843 {
844 struct btrfs_key key;
845 struct btrfs_path path;
846 struct extent_buffer *leaf;
847 int ret ;
848 size_t size;
849 u64 found = 0;
850 u64 csum_end;
851 u16 csum_size = btrfs_super_csum_size(&root->fs_info->super_copy);
852
853 btrfs_init_path(&path);
854
855 key.objectid = BTRFS_EXTENT_CSUM_OBJECTID;
856 key.offset = start;
857 key.type = BTRFS_EXTENT_CSUM_KEY;
858
859 ret = btrfs_search_slot(NULL, root->fs_info->csum_root,
860 &key, &path, 0, 0);
861 BUG_ON(ret < 0);
862 if (ret > 0 && path.slots[0] > 0) {
863 leaf = path.nodes[0];
864 btrfs_item_key_to_cpu(leaf, &key, path.slots[0] - 1);
865 if (key.objectid == BTRFS_EXTENT_CSUM_OBJECTID &&
866 key.type == BTRFS_EXTENT_CSUM_KEY)
867 path.slots[0]--;
868 }
869
870 while (len > 0) {
871 leaf = path.nodes[0];
872 if (path.slots[0] >= btrfs_header_nritems(leaf)) {
873 ret = btrfs_next_leaf(root->fs_info->csum_root, &path);
874 BUG_ON(ret < 0);
875 if (ret > 0)
876 break;
877 leaf = path.nodes[0];
878 }
879
880 btrfs_item_key_to_cpu(leaf, &key, path.slots[0]);
881 if (key.objectid != BTRFS_EXTENT_CSUM_OBJECTID ||
882 key.type != BTRFS_EXTENT_CSUM_KEY)
883 break;
884
885 btrfs_item_key_to_cpu(leaf, &key, path.slots[0]);
886 if (key.offset >= start + len)
887 break;
888
889 if (key.offset > start)
890 start = key.offset;
891
892 size = btrfs_item_size_nr(leaf, path.slots[0]);
893 csum_end = key.offset + (size / csum_size) * root->sectorsize;
894 if (csum_end > start) {
895 size = min(csum_end - start, len);
896 len -= size;
897 start += size;
898 found += size;
899 }
900
901 path.slots[0]++;
902 }
903 btrfs_release_path(root->fs_info->csum_root, &path);
904 return found;
905 }
906
907 static int process_file_extent(struct btrfs_root *root,
908 struct extent_buffer *eb,
909 int slot, struct btrfs_key *key,
910 struct shared_node *active_node)
911 {
912 struct inode_record *rec;
913 struct btrfs_file_extent_item *fi;
914 u64 num_bytes = 0;
915 u64 disk_bytenr = 0;
916 u64 extent_offset = 0;
917 u64 mask = root->sectorsize - 1;
918 int extent_type;
919
920 rec = active_node->current;
921 BUG_ON(rec->ino != key->objectid || rec->refs > 1);
922 rec->found_file_extent = 1;
923
924 if (rec->extent_start == (u64)-1) {
925 rec->extent_start = key->offset;
926 rec->extent_end = key->offset;
927 }
928
929 if (rec->extent_end > key->offset)
930 rec->errors |= I_ERR_FILE_EXTENT_OVERLAP;
931 else if (rec->extent_end < key->offset &&
932 rec->extent_end < rec->first_extent_gap)
933 rec->first_extent_gap = rec->extent_end;
934
935 fi = btrfs_item_ptr(eb, slot, struct btrfs_file_extent_item);
936 extent_type = btrfs_file_extent_type(eb, fi);
937
938 if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
939 num_bytes = btrfs_file_extent_inline_len(eb, fi);
940 if (num_bytes == 0)
941 rec->errors |= I_ERR_BAD_FILE_EXTENT;
942 rec->found_size += num_bytes;
943 num_bytes = (num_bytes + mask) & ~mask;
944 } else if (extent_type == BTRFS_FILE_EXTENT_REG ||
945 extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
946 num_bytes = btrfs_file_extent_num_bytes(eb, fi);
947 disk_bytenr = btrfs_file_extent_disk_bytenr(eb, fi);
948 extent_offset = btrfs_file_extent_offset(eb, fi);
949 if (num_bytes == 0 || (num_bytes & mask))
950 rec->errors |= I_ERR_BAD_FILE_EXTENT;
951 if (num_bytes + extent_offset >
952 btrfs_file_extent_ram_bytes(eb, fi))
953 rec->errors |= I_ERR_BAD_FILE_EXTENT;
954 if (extent_type == BTRFS_FILE_EXTENT_PREALLOC &&
955 (btrfs_file_extent_compression(eb, fi) ||
956 btrfs_file_extent_encryption(eb, fi) ||
957 btrfs_file_extent_other_encoding(eb, fi)))
958 rec->errors |= I_ERR_BAD_FILE_EXTENT;
959 if (disk_bytenr > 0)
960 rec->found_size += num_bytes;
961 } else {
962 rec->errors |= I_ERR_BAD_FILE_EXTENT;
963 }
964 rec->extent_end = key->offset + num_bytes;
965
966 if (disk_bytenr > 0) {
967 u64 found;
968 if (btrfs_file_extent_compression(eb, fi))
969 num_bytes = btrfs_file_extent_disk_num_bytes(eb, fi);
970 else
971 disk_bytenr += extent_offset;
972
973 found = count_csum_range(root, disk_bytenr, num_bytes);
974 if (extent_type == BTRFS_FILE_EXTENT_REG) {
975 if (found > 0)
976 rec->found_csum_item = 1;
977 if (found < num_bytes)
978 rec->some_csum_missing = 1;
979 } else if (extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
980 if (found > 0)
981 rec->errors |= I_ERR_ODD_CSUM_ITEM;
982 }
983 }
984 return 0;
985 }
986
987 static int process_one_leaf(struct btrfs_root *root, struct extent_buffer *eb,
988 struct walk_control *wc)
989 {
990 struct btrfs_key key;
991 u32 nritems;
992 int i;
993 int ret;
994 struct cache_tree *inode_cache;
995 struct shared_node *active_node;
996
997 if (wc->root_level == wc->active_node &&
998 btrfs_root_refs(&root->root_item) == 0)
999 return 0;
1000
1001 active_node = wc->nodes[wc->active_node];
1002 inode_cache = &active_node->inode_cache;
1003 nritems = btrfs_header_nritems(eb);
1004 for (i = 0; i < nritems; i++) {
1005 btrfs_item_key_to_cpu(eb, &key, i);
1006 if (active_node->current == NULL ||
1007 active_node->current->ino < key.objectid) {
1008 if (active_node->current) {
1009 active_node->current->checked = 1;
1010 maybe_free_inode_rec(inode_cache,
1011 active_node->current);
1012 }
1013 active_node->current = get_inode_rec(inode_cache,
1014 key.objectid, 1);
1015 }
1016 switch (key.type) {
1017 case BTRFS_DIR_ITEM_KEY:
1018 case BTRFS_DIR_INDEX_KEY:
1019 ret = process_dir_item(eb, i, &key, active_node);
1020 break;
1021 case BTRFS_INODE_REF_KEY:
1022 ret = process_inode_ref(eb, i, &key, active_node);
1023 break;
1024 case BTRFS_INODE_ITEM_KEY:
1025 ret = process_inode_item(eb, i, &key, active_node);
1026 break;
1027 case BTRFS_EXTENT_DATA_KEY:
1028 ret = process_file_extent(root, eb, i, &key,
1029 active_node);
1030 break;
1031 default:
1032 break;
1033 };
1034 }
1035 return 0;
1036 }
1037
1038 static void reada_walk_down(struct btrfs_root *root,
1039 struct extent_buffer *node, int slot)
1040 {
1041 u64 bytenr;
1042 u64 ptr_gen;
1043 u32 nritems;
1044 u32 blocksize;
1045 int i;
1046 int ret;
1047 int level;
1048
1049 level = btrfs_header_level(node);
1050 if (level != 1)
1051 return;
1052
1053 nritems = btrfs_header_nritems(node);
1054 blocksize = btrfs_level_size(root, level - 1);
1055 for (i = slot; i < nritems; i++) {
1056 bytenr = btrfs_node_blockptr(node, i);
1057 ptr_gen = btrfs_node_ptr_generation(node, i);
1058 ret = readahead_tree_block(root, bytenr, blocksize, ptr_gen);
1059 if (ret)
1060 break;
1061 }
1062 }
1063
1064 static int walk_down_tree(struct btrfs_root *root, struct btrfs_path *path,
1065 struct walk_control *wc, int *level)
1066 {
1067 u64 bytenr;
1068 u64 ptr_gen;
1069 struct extent_buffer *next;
1070 struct extent_buffer *cur;
1071 u32 blocksize;
1072 int ret;
1073 u64 refs;
1074
1075 WARN_ON(*level < 0);
1076 WARN_ON(*level >= BTRFS_MAX_LEVEL);
1077 ret = btrfs_lookup_extent_info(NULL, root,
1078 path->nodes[*level]->start,
1079 path->nodes[*level]->len, &refs, NULL);
1080 BUG_ON(ret);
1081 if (refs > 1) {
1082 ret = enter_shared_node(root, path->nodes[*level]->start,
1083 refs, wc, *level);
1084 if (ret > 0)
1085 goto out;
1086 }
1087
1088 while (*level >= 0) {
1089 WARN_ON(*level < 0);
1090 WARN_ON(*level >= BTRFS_MAX_LEVEL);
1091 cur = path->nodes[*level];
1092
1093 if (btrfs_header_level(cur) != *level)
1094 WARN_ON(1);
1095
1096 if (path->slots[*level] >= btrfs_header_nritems(cur))
1097 break;
1098 if (*level == 0) {
1099 ret = process_one_leaf(root, cur, wc);
1100 break;
1101 }
1102 bytenr = btrfs_node_blockptr(cur, path->slots[*level]);
1103 ptr_gen = btrfs_node_ptr_generation(cur, path->slots[*level]);
1104 blocksize = btrfs_level_size(root, *level - 1);
1105 ret = btrfs_lookup_extent_info(NULL, root, bytenr, blocksize,
1106 &refs, NULL);
1107 BUG_ON(ret);
1108
1109 if (refs > 1) {
1110 ret = enter_shared_node(root, bytenr, refs,
1111 wc, *level - 1);
1112 if (ret > 0) {
1113 path->slots[*level]++;
1114 continue;
1115 }
1116 }
1117
1118 next = btrfs_find_tree_block(root, bytenr, blocksize);
1119 if (!next || !btrfs_buffer_uptodate(next, ptr_gen)) {
1120 free_extent_buffer(next);
1121 reada_walk_down(root, cur, path->slots[*level]);
1122 next = read_tree_block(root, bytenr, blocksize,
1123 ptr_gen);
1124 }
1125
1126 *level = *level - 1;
1127 free_extent_buffer(path->nodes[*level]);
1128 path->nodes[*level] = next;
1129 path->slots[*level] = 0;
1130 }
1131 out:
1132 path->slots[*level] = btrfs_header_nritems(path->nodes[*level]);
1133 return 0;
1134 }
1135
1136 static int walk_up_tree(struct btrfs_root *root, struct btrfs_path *path,
1137 struct walk_control *wc, int *level)
1138 {
1139 int i;
1140 struct extent_buffer *leaf;
1141
1142 for (i = *level; i < BTRFS_MAX_LEVEL - 1 && path->nodes[i]; i++) {
1143 leaf = path->nodes[i];
1144 if (path->slots[i] + 1 < btrfs_header_nritems(leaf)) {
1145 path->slots[i]++;
1146 *level = i;
1147 return 0;
1148 } else {
1149 free_extent_buffer(path->nodes[*level]);
1150 path->nodes[*level] = NULL;
1151 BUG_ON(*level > wc->active_node);
1152 if (*level == wc->active_node)
1153 leave_shared_node(root, wc, *level);
1154 *level = i + 1;
1155 }
1156 }
1157 return 1;
1158 }
1159
1160 static int check_root_dir(struct inode_record *rec)
1161 {
1162 struct inode_backref *backref;
1163 int ret = -1;
1164
1165 if (!rec->found_inode_item || rec->errors)
1166 goto out;
1167 if (rec->nlink != 1 || rec->found_link != 1)
1168 goto out;
1169 if (list_empty(&rec->backrefs))
1170 goto out;
1171 backref = list_entry(rec->backrefs.next, struct inode_backref, list);
1172 if (!backref->found_inode_ref)
1173 goto out;
1174 if (backref->index != 0 || backref->namelen != 2 ||
1175 memcmp(backref->name, "..", 2))
1176 goto out;
1177 if (backref->found_dir_index || backref->found_dir_item)
1178 goto out;
1179 ret = 0;
1180 out:
1181 return ret;
1182 }
1183
1184 static int check_inode_recs(struct btrfs_root *root,
1185 struct cache_tree *inode_cache)
1186 {
1187 struct cache_extent *cache;
1188 struct ptr_node *node;
1189 struct inode_record *rec;
1190 struct inode_backref *backref;
1191 int ret;
1192 u64 error = 0;
1193 u64 root_dirid = btrfs_root_dirid(&root->root_item);
1194
1195 if (btrfs_root_refs(&root->root_item) == 0) {
1196 if (!cache_tree_empty(inode_cache))
1197 fprintf(stderr, "warning line %d\n", __LINE__);
1198 return 0;
1199 }
1200
1201 rec = get_inode_rec(inode_cache, root_dirid, 0);
1202 if (rec) {
1203 ret = check_root_dir(rec);
1204 if (ret) {
1205 fprintf(stderr, "root %llu root dir %llu error\n",
1206 (unsigned long long)root->root_key.objectid,
1207 (unsigned long long)root_dirid);
1208 error++;
1209 }
1210 } else {
1211 fprintf(stderr, "root %llu root dir %llu not found\n",
1212 (unsigned long long)root->root_key.objectid,
1213 (unsigned long long)root_dirid);
1214 }
1215
1216 while (1) {
1217 cache = find_first_cache_extent(inode_cache, 0);
1218 if (!cache)
1219 break;
1220 node = container_of(cache, struct ptr_node, cache);
1221 rec = node->data;
1222 remove_cache_extent(inode_cache, &node->cache);
1223 free(node);
1224 if (rec->ino == root_dirid ||
1225 rec->ino == BTRFS_ORPHAN_OBJECTID) {
1226 free_inode_rec(rec);
1227 continue;
1228 }
1229
1230 if (rec->errors & I_ERR_NO_ORPHAN_ITEM) {
1231 ret = check_orphan_item(root, rec->ino);
1232 if (ret == 0)
1233 rec->errors &= ~I_ERR_NO_ORPHAN_ITEM;
1234 if (can_free_inode_rec(rec)) {
1235 free_inode_rec(rec);
1236 continue;
1237 }
1238 }
1239
1240 error++;
1241 if (!rec->found_inode_item)
1242 rec->errors |= I_ERR_NO_INODE_ITEM;
1243 if (rec->found_link != rec->nlink)
1244 rec->errors |= I_ERR_LINK_COUNT_WRONG;
1245 fprintf(stderr, "root %llu inode %llu errors %x\n",
1246 (unsigned long long) root->root_key.objectid,
1247 (unsigned long long) rec->ino, rec->errors);
1248 list_for_each_entry(backref, &rec->backrefs, list) {
1249 if (!backref->found_dir_item)
1250 backref->errors |= REF_ERR_NO_DIR_ITEM;
1251 if (!backref->found_dir_index)
1252 backref->errors |= REF_ERR_NO_DIR_INDEX;
1253 if (!backref->found_inode_ref)
1254 backref->errors |= REF_ERR_NO_INODE_REF;
1255 fprintf(stderr, "\tunresolved ref dir %llu index %llu"
1256 " namelen %u name %s filetype %d error %x\n",
1257 (unsigned long long)backref->dir,
1258 (unsigned long long)backref->index,
1259 backref->namelen, backref->name,
1260 backref->filetype, backref->errors);
1261 }
1262 free_inode_rec(rec);
1263 }
1264 return (error > 0) ? -1 : 0;
1265 }
1266
1267 static struct root_record *get_root_rec(struct cache_tree *root_cache,
1268 u64 objectid)
1269 {
1270 struct cache_extent *cache;
1271 struct root_record *rec = NULL;
1272 int ret;
1273
1274 cache = find_cache_extent(root_cache, objectid, 1);
1275 if (cache) {
1276 rec = container_of(cache, struct root_record, cache);
1277 } else {
1278 rec = calloc(1, sizeof(*rec));
1279 rec->objectid = objectid;
1280 INIT_LIST_HEAD(&rec->backrefs);
1281 rec->cache.start = objectid;
1282 rec->cache.size = 1;
1283
1284 ret = insert_existing_cache_extent(root_cache, &rec->cache);
1285 BUG_ON(ret);
1286 }
1287 return rec;
1288 }
1289
1290 static struct root_backref *get_root_backref(struct root_record *rec,
1291 u64 ref_root, u64 dir, u64 index,
1292 const char *name, int namelen)
1293 {
1294 struct root_backref *backref;
1295
1296 list_for_each_entry(backref, &rec->backrefs, list) {
1297 if (backref->ref_root != ref_root || backref->dir != dir ||
1298 backref->namelen != namelen)
1299 continue;
1300 if (memcmp(name, backref->name, namelen))
1301 continue;
1302 return backref;
1303 }
1304
1305 backref = malloc(sizeof(*backref) + namelen + 1);
1306 memset(backref, 0, sizeof(*backref));
1307 backref->ref_root = ref_root;
1308 backref->dir = dir;
1309 backref->index = index;
1310 backref->namelen = namelen;
1311 memcpy(backref->name, name, namelen);
1312 backref->name[namelen] = '\0';
1313 list_add_tail(&backref->list, &rec->backrefs);
1314 return backref;
1315 }
1316
1317 static void free_root_recs(struct cache_tree *root_cache)
1318 {
1319 struct cache_extent *cache;
1320 struct root_record *rec;
1321 struct root_backref *backref;
1322
1323 while (1) {
1324 cache = find_first_cache_extent(root_cache, 0);
1325 if (!cache)
1326 break;
1327 rec = container_of(cache, struct root_record, cache);
1328 remove_cache_extent(root_cache, &rec->cache);
1329
1330 while (!list_empty(&rec->backrefs)) {
1331 backref = list_entry(rec->backrefs.next,
1332 struct root_backref, list);
1333 list_del(&backref->list);
1334 free(backref);
1335 }
1336 kfree(rec);
1337 }
1338 }
1339
1340 static int add_root_backref(struct cache_tree *root_cache,
1341 u64 root_id, u64 ref_root, u64 dir, u64 index,
1342 const char *name, int namelen,
1343 int item_type, int errors)
1344 {
1345 struct root_record *rec;
1346 struct root_backref *backref;
1347
1348 rec = get_root_rec(root_cache, root_id);
1349 backref = get_root_backref(rec, ref_root, dir, index, name, namelen);
1350
1351 backref->errors |= errors;
1352
1353 if (item_type != BTRFS_DIR_ITEM_KEY) {
1354 if (backref->found_dir_index || backref->found_back_ref ||
1355 backref->found_forward_ref) {
1356 if (backref->index != index)
1357 backref->errors |= REF_ERR_INDEX_UNMATCH;
1358 } else {
1359 backref->index = index;
1360 }
1361 }
1362
1363 if (item_type == BTRFS_DIR_ITEM_KEY) {
1364 backref->found_dir_item = 1;
1365 backref->reachable = 1;
1366 rec->found_ref++;
1367 } else if (item_type == BTRFS_DIR_INDEX_KEY) {
1368 backref->found_dir_index = 1;
1369 } else if (item_type == BTRFS_ROOT_REF_KEY) {
1370 if (backref->found_forward_ref)
1371 backref->errors |= REF_ERR_DUP_ROOT_REF;
1372 backref->found_forward_ref = 1;
1373 } else if (item_type == BTRFS_ROOT_BACKREF_KEY) {
1374 if (backref->found_back_ref)
1375 backref->errors |= REF_ERR_DUP_ROOT_BACKREF;
1376 backref->found_back_ref = 1;
1377 } else {
1378 BUG_ON(1);
1379 }
1380
1381 return 0;
1382 }
1383
1384 static int merge_root_recs(struct btrfs_root *root,
1385 struct cache_tree *src_cache,
1386 struct cache_tree *dst_cache)
1387 {
1388 struct cache_extent *cache;
1389 struct ptr_node *node;
1390 struct inode_record *rec;
1391 struct inode_backref *backref;
1392
1393 if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) {
1394 free_inode_recs(src_cache);
1395 return 0;
1396 }
1397
1398 while (1) {
1399 cache = find_first_cache_extent(src_cache, 0);
1400 if (!cache)
1401 break;
1402 node = container_of(cache, struct ptr_node, cache);
1403 rec = node->data;
1404 remove_cache_extent(src_cache, &node->cache);
1405 free(node);
1406
1407 list_for_each_entry(backref, &rec->backrefs, list) {
1408 BUG_ON(backref->found_inode_ref);
1409 if (backref->found_dir_item)
1410 add_root_backref(dst_cache, rec->ino,
1411 root->root_key.objectid, backref->dir,
1412 backref->index, backref->name,
1413 backref->namelen, BTRFS_DIR_ITEM_KEY,
1414 backref->errors);
1415 if (backref->found_dir_index)
1416 add_root_backref(dst_cache, rec->ino,
1417 root->root_key.objectid, backref->dir,
1418 backref->index, backref->name,
1419 backref->namelen, BTRFS_DIR_INDEX_KEY,
1420 backref->errors);
1421 }
1422 free_inode_rec(rec);
1423 }
1424 return 0;
1425 }
1426
1427 static int check_root_refs(struct btrfs_root *root,
1428 struct cache_tree *root_cache)
1429 {
1430 struct root_record *rec;
1431 struct root_record *ref_root;
1432 struct root_backref *backref;
1433 struct cache_extent *cache;
1434 int loop = 1;
1435 int ret;
1436 int error;
1437 int errors = 0;
1438
1439 rec = get_root_rec(root_cache, BTRFS_FS_TREE_OBJECTID);
1440 rec->found_ref = 1;
1441
1442 /* fixme: this can not detect circular references */
1443 while (loop) {
1444 loop = 0;
1445 cache = find_first_cache_extent(root_cache, 0);
1446 while (1) {
1447 if (!cache)
1448 break;
1449 rec = container_of(cache, struct root_record, cache);
1450 cache = next_cache_extent(cache);
1451
1452 if (rec->found_ref == 0)
1453 continue;
1454
1455 list_for_each_entry(backref, &rec->backrefs, list) {
1456 if (!backref->reachable)
1457 continue;
1458
1459 ref_root = get_root_rec(root_cache,
1460 backref->ref_root);
1461 if (ref_root->found_ref > 0)
1462 continue;
1463
1464 backref->reachable = 0;
1465 rec->found_ref--;
1466 if (rec->found_ref == 0)
1467 loop = 1;
1468 }
1469 }
1470 }
1471
1472 cache = find_first_cache_extent(root_cache, 0);
1473 while (1) {
1474 if (!cache)
1475 break;
1476 rec = container_of(cache, struct root_record, cache);
1477 cache = next_cache_extent(cache);
1478
1479 if (rec->found_ref == 0 &&
1480 rec->objectid >= BTRFS_FIRST_FREE_OBJECTID &&
1481 rec->objectid <= BTRFS_LAST_FREE_OBJECTID) {
1482 ret = check_orphan_item(root->fs_info->tree_root,
1483 rec->objectid);
1484 if (ret == 0)
1485 continue;
1486 errors++;
1487 fprintf(stderr, "fs tree %llu not referenced\n",
1488 (unsigned long long)rec->objectid);
1489 }
1490
1491 error = 0;
1492 if (rec->found_ref > 0 && !rec->found_root_item)
1493 error = 1;
1494 list_for_each_entry(backref, &rec->backrefs, list) {
1495 if (!backref->found_dir_item)
1496 backref->errors |= REF_ERR_NO_DIR_ITEM;
1497 if (!backref->found_dir_index)
1498 backref->errors |= REF_ERR_NO_DIR_INDEX;
1499 if (!backref->found_back_ref)
1500 backref->errors |= REF_ERR_NO_ROOT_BACKREF;
1501 if (!backref->found_forward_ref)
1502 backref->errors |= REF_ERR_NO_ROOT_REF;
1503 if (backref->reachable && backref->errors)
1504 error = 1;
1505 }
1506 if (!error)
1507 continue;
1508
1509 errors++;
1510 fprintf(stderr, "fs tree %llu refs %u %s\n",
1511 (unsigned long long)rec->objectid, rec->found_ref,
1512 rec->found_root_item ? "" : "not found");
1513
1514 list_for_each_entry(backref, &rec->backrefs, list) {
1515 if (!backref->reachable)
1516 continue;
1517 if (!backref->errors && rec->found_root_item)
1518 continue;
1519 fprintf(stderr, "\tunresolved ref root %llu dir %llu"
1520 " index %llu namelen %u name %s error %x\n",
1521 (unsigned long long)backref->ref_root,
1522 (unsigned long long)backref->dir,
1523 (unsigned long long)backref->index,
1524 backref->namelen, backref->name,
1525 backref->errors);
1526 }
1527 }
1528 return errors > 0 ? 1 : 0;
1529 }
1530
1531 static int process_root_ref(struct extent_buffer *eb, int slot,
1532 struct btrfs_key *key,
1533 struct cache_tree *root_cache)
1534 {
1535 u64 dirid;
1536 u64 index;
1537 u32 len;
1538 u32 name_len;
1539 struct btrfs_root_ref *ref;
1540 char namebuf[BTRFS_NAME_LEN];
1541 int error;
1542
1543 ref = btrfs_item_ptr(eb, slot, struct btrfs_root_ref);
1544
1545 dirid = btrfs_root_ref_dirid(eb, ref);
1546 index = btrfs_root_ref_sequence(eb, ref);
1547 name_len = btrfs_root_ref_name_len(eb, ref);
1548
1549 if (name_len <= BTRFS_NAME_LEN) {
1550 len = name_len;
1551 error = 0;
1552 } else {
1553 len = BTRFS_NAME_LEN;
1554 error = REF_ERR_NAME_TOO_LONG;
1555 }
1556 read_extent_buffer(eb, namebuf, (unsigned long)(ref + 1), len);
1557
1558 if (key->type == BTRFS_ROOT_REF_KEY) {
1559 add_root_backref(root_cache, key->offset, key->objectid, dirid,
1560 index, namebuf, len, key->type, error);
1561 } else {
1562 add_root_backref(root_cache, key->objectid, key->offset, dirid,
1563 index, namebuf, len, key->type, error);
1564 }
1565 return 0;
1566 }
1567
1568 static int check_fs_root(struct btrfs_root *root,
1569 struct cache_tree *root_cache,
1570 struct walk_control *wc)
1571 {
1572 int ret = 0;
1573 int wret;
1574 int level;
1575 struct btrfs_path path;
1576 struct shared_node root_node;
1577 struct root_record *rec;
1578 struct btrfs_root_item *root_item = &root->root_item;
1579
1580 if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) {
1581 rec = get_root_rec(root_cache, root->root_key.objectid);
1582 if (btrfs_root_refs(root_item) > 0)
1583 rec->found_root_item = 1;
1584 }
1585
1586 btrfs_init_path(&path);
1587 memset(&root_node, 0, sizeof(root_node));
1588 cache_tree_init(&root_node.root_cache);
1589 cache_tree_init(&root_node.inode_cache);
1590
1591 level = btrfs_header_level(root->node);
1592 memset(wc->nodes, 0, sizeof(wc->nodes));
1593 wc->nodes[level] = &root_node;
1594 wc->active_node = level;
1595 wc->root_level = level;
1596
1597 if (btrfs_root_refs(root_item) > 0 ||
1598 btrfs_disk_key_objectid(&root_item->drop_progress) == 0) {
1599 path.nodes[level] = root->node;
1600 extent_buffer_get(root->node);
1601 path.slots[level] = 0;
1602 } else {
1603 struct btrfs_key key;
1604 struct btrfs_disk_key found_key;
1605
1606 btrfs_disk_key_to_cpu(&key, &root_item->drop_progress);
1607 level = root_item->drop_level;
1608 path.lowest_level = level;
1609 wret = btrfs_search_slot(NULL, root, &key, &path, 0, 0);
1610 BUG_ON(wret < 0);
1611 btrfs_node_key(path.nodes[level], &found_key,
1612 path.slots[level]);
1613 WARN_ON(memcmp(&found_key, &root_item->drop_progress,
1614 sizeof(found_key)));
1615 }
1616
1617 while (1) {
1618 wret = walk_down_tree(root, &path, wc, &level);
1619 if (wret < 0)
1620 ret = wret;
1621 if (wret != 0)
1622 break;
1623
1624 wret = walk_up_tree(root, &path, wc, &level);
1625 if (wret < 0)
1626 ret = wret;
1627 if (wret != 0)
1628 break;
1629 }
1630 btrfs_release_path(root, &path);
1631
1632 merge_root_recs(root, &root_node.root_cache, root_cache);
1633
1634 if (root_node.current) {
1635 root_node.current->checked = 1;
1636 maybe_free_inode_rec(&root_node.inode_cache,
1637 root_node.current);
1638 }
1639
1640 ret = check_inode_recs(root, &root_node.inode_cache);
1641 return ret;
1642 }
1643
1644 static int fs_root_objectid(u64 objectid)
1645 {
1646 if (objectid == BTRFS_FS_TREE_OBJECTID ||
1647 objectid == BTRFS_TREE_RELOC_OBJECTID ||
1648 objectid == BTRFS_DATA_RELOC_TREE_OBJECTID ||
1649 (objectid >= BTRFS_FIRST_FREE_OBJECTID &&
1650 objectid <= BTRFS_LAST_FREE_OBJECTID))
1651 return 1;
1652 return 0;
1653 }
1654
1655 static int check_fs_roots(struct btrfs_root *root,
1656 struct cache_tree *root_cache)
1657 {
1658 struct btrfs_path path;
1659 struct btrfs_key key;
1660 struct walk_control wc;
1661 struct extent_buffer *leaf;
1662 struct btrfs_root *tmp_root;
1663 struct btrfs_root *tree_root = root->fs_info->tree_root;
1664 int ret;
1665 int err = 0;
1666
1667 memset(&wc, 0, sizeof(wc));
1668 cache_tree_init(&wc.shared);
1669 btrfs_init_path(&path);
1670
1671 key.offset = 0;
1672 key.objectid = 0;
1673 key.type = BTRFS_ROOT_ITEM_KEY;
1674 ret = btrfs_search_slot(NULL, tree_root, &key, &path, 0, 0);
1675 BUG_ON(ret < 0);
1676 while (1) {
1677 leaf = path.nodes[0];
1678 if (path.slots[0] >= btrfs_header_nritems(leaf)) {
1679 ret = btrfs_next_leaf(tree_root, &path);
1680 if (ret != 0)
1681 break;
1682 leaf = path.nodes[0];
1683 }
1684 btrfs_item_key_to_cpu(leaf, &key, path.slots[0]);
1685 if (key.type == BTRFS_ROOT_ITEM_KEY &&
1686 fs_root_objectid(key.objectid)) {
1687 tmp_root = btrfs_read_fs_root_no_cache(root->fs_info,
1688 &key);
1689 ret = check_fs_root(tmp_root, root_cache, &wc);
1690 if (ret)
1691 err = 1;
1692 btrfs_free_fs_root(root->fs_info, tmp_root);
1693 } else if (key.type == BTRFS_ROOT_REF_KEY ||
1694 key.type == BTRFS_ROOT_BACKREF_KEY) {
1695 process_root_ref(leaf, path.slots[0], &key,
1696 root_cache);
1697 }
1698 path.slots[0]++;
1699 }
1700 btrfs_release_path(tree_root, &path);
1701
1702 if (!cache_tree_empty(&wc.shared))
1703 fprintf(stderr, "warning line %d\n", __LINE__);
1704
1705 return err;
1706 }
1707
1708 static int check_node(struct btrfs_root *root,
1709 struct btrfs_disk_key *parent_key,
1710 struct extent_buffer *buf)
1711 {
1712 int i;
1713 struct btrfs_key cpukey;
1714 struct btrfs_disk_key key;
1715 u32 nritems = btrfs_header_nritems(buf);
1716
1717 if (nritems == 0 || nritems > BTRFS_NODEPTRS_PER_BLOCK(root))
1718 return 1;
1719 if (parent_key->type) {
1720 btrfs_node_key(buf, &key, 0);
1721 if (memcmp(parent_key, &key, sizeof(key)))
1722 return 1;
1723 }
1724 for (i = 0; nritems > 1 && i < nritems - 2; i++) {
1725 btrfs_node_key(buf, &key, i);
1726 btrfs_node_key_to_cpu(buf, &cpukey, i + 1);
1727 if (btrfs_comp_keys(&key, &cpukey) >= 0)
1728 return 1;
1729 }
1730 return 0;
1731 }
1732
1733 static int check_leaf(struct btrfs_root *root,
1734 struct btrfs_disk_key *parent_key,
1735 struct extent_buffer *buf)
1736 {
1737 int i;
1738 struct btrfs_key cpukey;
1739 struct btrfs_disk_key key;
1740 u32 nritems = btrfs_header_nritems(buf);
1741
1742 if (btrfs_header_level(buf) != 0) {
1743 fprintf(stderr, "leaf is not a leaf %llu\n",
1744 (unsigned long long)btrfs_header_bytenr(buf));
1745 return 1;
1746 }
1747 if (btrfs_leaf_free_space(root, buf) < 0) {
1748 fprintf(stderr, "leaf free space incorrect %llu %d\n",
1749 (unsigned long long)btrfs_header_bytenr(buf),
1750 btrfs_leaf_free_space(root, buf));
1751 return 1;
1752 }
1753
1754 if (nritems == 0)
1755 return 0;
1756
1757 btrfs_item_key(buf, &key, 0);
1758 if (parent_key->type && memcmp(parent_key, &key, sizeof(key))) {
1759 fprintf(stderr, "leaf parent key incorrect %llu\n",
1760 (unsigned long long)btrfs_header_bytenr(buf));
1761 return 1;
1762 }
1763 for (i = 0; nritems > 1 && i < nritems - 2; i++) {
1764 btrfs_item_key(buf, &key, i);
1765 btrfs_item_key_to_cpu(buf, &cpukey, i + 1);
1766 if (btrfs_comp_keys(&key, &cpukey) >= 0) {
1767 fprintf(stderr, "bad key ordering %d %d\n", i, i+1);
1768 return 1;
1769 }
1770 if (btrfs_item_offset_nr(buf, i) !=
1771 btrfs_item_end_nr(buf, i + 1)) {
1772 fprintf(stderr, "incorrect offsets %u %u\n",
1773 btrfs_item_offset_nr(buf, i),
1774 btrfs_item_end_nr(buf, i + 1));
1775 return 1;
1776 }
1777 if (i == 0 && btrfs_item_end_nr(buf, i) !=
1778 BTRFS_LEAF_DATA_SIZE(root)) {
1779 fprintf(stderr, "bad item end %u wanted %u\n",
1780 btrfs_item_end_nr(buf, i),
1781 (unsigned)BTRFS_LEAF_DATA_SIZE(root));
1782 return 1;
1783 }
1784 }
1785 return 0;
1786 }
1787
1788 static int all_backpointers_checked(struct extent_record *rec, int print_errs)
1789 {
1790 struct list_head *cur = rec->backrefs.next;
1791 struct extent_backref *back;
1792 struct tree_backref *tback;
1793 struct data_backref *dback;
1794 u64 found = 0;
1795 int err = 0;
1796
1797 while(cur != &rec->backrefs) {
1798 back = list_entry(cur, struct extent_backref, list);
1799 cur = cur->next;
1800 if (!back->found_extent_tree) {
1801 err = 1;
1802 if (!print_errs)
1803 goto out;
1804 if (back->is_data) {
1805 dback = (struct data_backref *)back;
1806 fprintf(stderr, "Backref %llu %s %llu"
1807 " owner %llu offset %llu num_refs %lu"
1808 " not found in extent tree\n",
1809 (unsigned long long)rec->start,
1810 back->full_backref ?
1811 "parent" : "root",
1812 back->full_backref ?
1813 (unsigned long long)dback->parent:
1814 (unsigned long long)dback->root,
1815 (unsigned long long)dback->owner,
1816 (unsigned long long)dback->offset,
1817 (unsigned long)dback->num_refs);
1818 } else {
1819 tback = (struct tree_backref *)back;
1820 fprintf(stderr, "Backref %llu parent %llu"
1821 " root %llu not found in extent tree\n",
1822 (unsigned long long)rec->start,
1823 (unsigned long long)tback->parent,
1824 (unsigned long long)tback->root);
1825 }
1826 }
1827 if (!back->is_data && !back->found_ref) {
1828 err = 1;
1829 if (!print_errs)
1830 goto out;
1831 tback = (struct tree_backref *)back;
1832 fprintf(stderr, "Backref %llu %s %llu not referenced\n",
1833 (unsigned long long)rec->start,
1834 back->full_backref ? "parent" : "root",
1835 back->full_backref ?
1836 (unsigned long long)tback->parent :
1837 (unsigned long long)tback->root);
1838 }
1839 if (back->is_data) {
1840 dback = (struct data_backref *)back;
1841 if (dback->found_ref != dback->num_refs) {
1842 err = 1;
1843 if (!print_errs)
1844 goto out;
1845 fprintf(stderr, "Incorrect local backref count"
1846 " on %llu %s %llu owner %llu"
1847 " offset %llu found %u wanted %u\n",
1848 (unsigned long long)rec->start,
1849 back->full_backref ?
1850 "parent" : "root",
1851 back->full_backref ?
1852 (unsigned long long)dback->parent:
1853 (unsigned long long)dback->root,
1854 (unsigned long long)dback->owner,
1855 (unsigned long long)dback->offset,
1856 dback->found_ref, dback->num_refs);
1857 }
1858 }
1859 if (!back->is_data) {
1860 found += 1;
1861 } else {
1862 dback = (struct data_backref *)back;
1863 found += dback->found_ref;
1864 }
1865 }
1866 if (found != rec->refs) {
1867 err = 1;
1868 if (!print_errs)
1869 goto out;
1870 fprintf(stderr, "Incorrect global backref count "
1871 "on %llu found %llu wanted %llu\n",
1872 (unsigned long long)rec->start,
1873 (unsigned long long)found,
1874 (unsigned long long)rec->refs);
1875 }
1876 out:
1877 return err;
1878 }
1879
1880 static int free_all_extent_backrefs(struct extent_record *rec)
1881 {
1882 struct extent_backref *back;
1883 struct list_head *cur;
1884 while (!list_empty(&rec->backrefs)) {
1885 cur = rec->backrefs.next;
1886 back = list_entry(cur, struct extent_backref, list);
1887 list_del(cur);
1888 free(back);
1889 }
1890 return 0;
1891 }
1892
1893 static int maybe_free_extent_rec(struct cache_tree *extent_cache,
1894 struct extent_record *rec)
1895 {
1896 if (rec->content_checked && rec->owner_ref_checked &&
1897 rec->extent_item_refs == rec->refs && rec->refs > 0 &&
1898 !all_backpointers_checked(rec, 0)) {
1899 remove_cache_extent(extent_cache, &rec->cache);
1900 free_all_extent_backrefs(rec);
1901 free(rec);
1902 }
1903 return 0;
1904 }
1905
1906 static int check_owner_ref(struct btrfs_root *root,
1907 struct extent_record *rec,
1908 struct extent_buffer *buf)
1909 {
1910 struct extent_backref *node;
1911 struct tree_backref *back;
1912 struct btrfs_root *ref_root;
1913 struct btrfs_key key;
1914 struct btrfs_path path;
1915 int ret;
1916 int level;
1917 int found = 0;
1918
1919 list_for_each_entry(node, &rec->backrefs, list) {
1920 if (node->is_data)
1921 continue;
1922 if (!node->found_ref)
1923 continue;
1924 if (node->full_backref)
1925 continue;
1926 back = (struct tree_backref *)node;
1927 if (btrfs_header_owner(buf) == back->root)
1928 return 0;
1929 }
1930 BUG_ON(rec->is_root);
1931
1932 /* try to find the block by search corresponding fs tree */
1933 key.objectid = btrfs_header_owner(buf);
1934 key.type = BTRFS_ROOT_ITEM_KEY;
1935 key.offset = (u64)-1;
1936
1937 ref_root = btrfs_read_fs_root(root->fs_info, &key);
1938 BUG_ON(IS_ERR(ref_root));
1939
1940 level = btrfs_header_level(buf);
1941 if (level == 0)
1942 btrfs_item_key_to_cpu(buf, &key, 0);
1943 else
1944 btrfs_node_key_to_cpu(buf, &key, 0);
1945
1946 btrfs_init_path(&path);
1947 path.lowest_level = level + 1;
1948 ret = btrfs_search_slot(NULL, ref_root, &key, &path, 0, 0);
1949
1950 if (buf->start == btrfs_node_blockptr(path.nodes[level + 1],
1951 path.slots[level + 1]))
1952 rec->owner_ref_checked = 1;
1953
1954 btrfs_release_path(ref_root, &path);
1955 return found ? 0 : 1;
1956 }
1957
1958 static int check_block(struct btrfs_root *root,
1959 struct cache_tree *extent_cache,
1960 struct extent_buffer *buf, u64 flags)
1961 {
1962 struct extent_record *rec;
1963 struct cache_extent *cache;
1964 int ret = 1;
1965
1966 cache = find_cache_extent(extent_cache, buf->start, buf->len);
1967 if (!cache)
1968 return 1;
1969 rec = container_of(cache, struct extent_record, cache);
1970 if (btrfs_is_leaf(buf)) {
1971 ret = check_leaf(root, &rec->parent_key, buf);
1972 } else {
1973 ret = check_node(root, &rec->parent_key, buf);
1974 }
1975 if (ret) {
1976 fprintf(stderr, "bad block %llu\n",
1977 (unsigned long long)buf->start);
1978 } else {
1979 rec->content_checked = 1;
1980 if (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)
1981 rec->owner_ref_checked = 1;
1982 else {
1983 ret = check_owner_ref(root, rec, buf);
1984 if (!ret)
1985 rec->owner_ref_checked = 1;
1986 }
1987 }
1988 if (!ret)
1989 maybe_free_extent_rec(extent_cache, rec);
1990 return ret;
1991 }
1992
1993 static struct tree_backref *find_tree_backref(struct extent_record *rec,
1994 u64 parent, u64 root)
1995 {
1996 struct list_head *cur = rec->backrefs.next;
1997 struct extent_backref *node;
1998 struct tree_backref *back;
1999
2000 while(cur != &rec->backrefs) {
2001 node = list_entry(cur, struct extent_backref, list);
2002 cur = cur->next;
2003 if (node->is_data)
2004 continue;
2005 back = (struct tree_backref *)node;
2006 if (parent > 0) {
2007 if (!node->full_backref)
2008 continue;
2009 if (parent == back->parent)
2010 return back;
2011 } else {
2012 if (node->full_backref)
2013 continue;
2014 if (back->root == root)
2015 return back;
2016 }
2017 }
2018 return NULL;
2019 }
2020
2021 static struct tree_backref *alloc_tree_backref(struct extent_record *rec,
2022 u64 parent, u64 root)
2023 {
2024 struct tree_backref *ref = malloc(sizeof(*ref));
2025 memset(&ref->node, 0, sizeof(ref->node));
2026 if (parent > 0) {
2027 ref->parent = parent;
2028 ref->node.full_backref = 1;
2029 } else {
2030 ref->root = root;
2031 ref->node.full_backref = 0;
2032 }
2033 list_add_tail(&ref->node.list, &rec->backrefs);
2034 return ref;
2035 }
2036
2037 static struct data_backref *find_data_backref(struct extent_record *rec,
2038 u64 parent, u64 root,
2039 u64 owner, u64 offset)
2040 {
2041 struct list_head *cur = rec->backrefs.next;
2042 struct extent_backref *node;
2043 struct data_backref *back;
2044
2045 while(cur != &rec->backrefs) {
2046 node = list_entry(cur, struct extent_backref, list);
2047 cur = cur->next;
2048 if (!node->is_data)
2049 continue;
2050 back = (struct data_backref *)node;
2051 if (parent > 0) {
2052 if (!node->full_backref)
2053 continue;
2054 if (parent == back->parent)
2055 return back;
2056 } else {
2057 if (node->full_backref)
2058 continue;
2059 if (back->root == root && back->owner == owner &&
2060 back->offset == offset)
2061 return back;
2062 }
2063 }
2064 return NULL;
2065 }
2066
2067 static struct data_backref *alloc_data_backref(struct extent_record *rec,
2068 u64 parent, u64 root,
2069 u64 owner, u64 offset)
2070 {
2071 struct data_backref *ref = malloc(sizeof(*ref));
2072 memset(&ref->node, 0, sizeof(ref->node));
2073 ref->node.is_data = 1;
2074 if (parent > 0) {
2075 ref->parent = parent;
2076 ref->owner = 0;
2077 ref->offset = 0;
2078 ref->node.full_backref = 1;
2079 } else {
2080 ref->root = root;
2081 ref->owner = owner;
2082 ref->offset = offset;
2083 ref->node.full_backref = 0;
2084 }
2085 ref->found_ref = 0;
2086 ref->num_refs = 0;
2087 list_add_tail(&ref->node.list, &rec->backrefs);
2088 return ref;
2089 }
2090
2091 static int add_extent_rec(struct cache_tree *extent_cache,
2092 struct btrfs_key *parent_key,
2093 u64 start, u64 nr, u64 extent_item_refs,
2094 int is_root, int inc_ref, int set_checked)
2095 {
2096 struct extent_record *rec;
2097 struct cache_extent *cache;
2098 int ret = 0;
2099
2100 cache = find_cache_extent(extent_cache, start, nr);
2101 if (cache) {
2102 rec = container_of(cache, struct extent_record, cache);
2103 if (inc_ref)
2104 rec->refs++;
2105 if (rec->nr == 1)
2106 rec->nr = nr;
2107
2108 if (start != rec->start) {
2109 fprintf(stderr, "warning, start mismatch %llu %llu\n",
2110 (unsigned long long)rec->start,
2111 (unsigned long long)start);
2112 ret = 1;
2113 }
2114 if (extent_item_refs) {
2115 if (rec->extent_item_refs) {
2116 fprintf(stderr, "block %llu rec "
2117 "extent_item_refs %llu, passed %llu\n",
2118 (unsigned long long)start,
2119 (unsigned long long)
2120 rec->extent_item_refs,
2121 (unsigned long long)extent_item_refs);
2122 }
2123 rec->extent_item_refs = extent_item_refs;
2124 }
2125 if (is_root)
2126 rec->is_root = 1;
2127 if (set_checked) {
2128 rec->content_checked = 1;
2129 rec->owner_ref_checked = 1;
2130 }
2131
2132 if (parent_key)
2133 btrfs_cpu_key_to_disk(&rec->parent_key, parent_key);
2134
2135 maybe_free_extent_rec(extent_cache, rec);
2136 return ret;
2137 }
2138 rec = malloc(sizeof(*rec));
2139 rec->start = start;
2140 rec->nr = nr;
2141 rec->content_checked = 0;
2142 rec->owner_ref_checked = 0;
2143 INIT_LIST_HEAD(&rec->backrefs);
2144
2145 if (is_root)
2146 rec->is_root = 1;
2147 else
2148 rec->is_root = 0;
2149
2150 if (inc_ref)
2151 rec->refs = 1;
2152 else
2153 rec->refs = 0;
2154
2155 if (extent_item_refs)
2156 rec->extent_item_refs = extent_item_refs;
2157 else
2158 rec->extent_item_refs = 0;
2159
2160 if (parent_key)
2161 btrfs_cpu_key_to_disk(&rec->parent_key, parent_key);
2162 else
2163 memset(&rec->parent_key, 0, sizeof(*parent_key));
2164
2165 rec->cache.start = start;
2166 rec->cache.size = nr;
2167 ret = insert_existing_cache_extent(extent_cache, &rec->cache);
2168 BUG_ON(ret);
2169 bytes_used += nr;
2170 if (set_checked) {
2171 rec->content_checked = 1;
2172 rec->owner_ref_checked = 1;
2173 }
2174 return ret;
2175 }
2176
2177 static int add_tree_backref(struct cache_tree *extent_cache, u64 bytenr,
2178 u64 parent, u64 root, int found_ref)
2179 {
2180 struct extent_record *rec;
2181 struct tree_backref *back;
2182 struct cache_extent *cache;
2183
2184 cache = find_cache_extent(extent_cache, bytenr, 1);
2185 if (!cache) {
2186 add_extent_rec(extent_cache, NULL, bytenr, 1, 0, 0, 0, 0);
2187 cache = find_cache_extent(extent_cache, bytenr, 1);
2188 if (!cache)
2189 abort();
2190 }
2191
2192 rec = container_of(cache, struct extent_record, cache);
2193 if (rec->start != bytenr) {
2194 abort();
2195 }
2196
2197 back = find_tree_backref(rec, parent, root);
2198 if (!back)
2199 back = alloc_tree_backref(rec, parent, root);
2200
2201 if (found_ref) {
2202 if (back->node.found_ref) {
2203 fprintf(stderr, "Extent back ref already exists "
2204 "for %llu parent %llu root %llu \n",
2205 (unsigned long long)bytenr,
2206 (unsigned long long)parent,
2207 (unsigned long long)root);
2208 }
2209 back->node.found_ref = 1;
2210 } else {
2211 if (back->node.found_extent_tree) {
2212 fprintf(stderr, "Extent back ref already exists "
2213 "for %llu parent %llu root %llu \n",
2214 (unsigned long long)bytenr,
2215 (unsigned long long)parent,
2216 (unsigned long long)root);
2217 }
2218 back->node.found_extent_tree = 1;
2219 }
2220 return 0;
2221 }
2222
2223 static int add_data_backref(struct cache_tree *extent_cache, u64 bytenr,
2224 u64 parent, u64 root, u64 owner, u64 offset,
2225 u32 num_refs, int found_ref)
2226 {
2227 struct extent_record *rec;
2228 struct data_backref *back;
2229 struct cache_extent *cache;
2230
2231 cache = find_cache_extent(extent_cache, bytenr, 1);
2232 if (!cache) {
2233 add_extent_rec(extent_cache, NULL, bytenr, 1, 0, 0, 0, 0);
2234 cache = find_cache_extent(extent_cache, bytenr, 1);
2235 if (!cache)
2236 abort();
2237 }
2238
2239 rec = container_of(cache, struct extent_record, cache);
2240 if (rec->start != bytenr) {
2241 abort();
2242 }
2243 back = find_data_backref(rec, parent, root, owner, offset);
2244 if (!back)
2245 back = alloc_data_backref(rec, parent, root, owner, offset);
2246
2247 if (found_ref) {
2248 BUG_ON(num_refs != 1);
2249 back->node.found_ref = 1;
2250 back->found_ref += 1;
2251 } else {
2252 if (back->node.found_extent_tree) {
2253 fprintf(stderr, "Extent back ref already exists "
2254 "for %llu parent %llu root %llu"
2255 "owner %llu offset %llu num_refs %lu\n",
2256 (unsigned long long)bytenr,
2257 (unsigned long long)parent,
2258 (unsigned long long)root,
2259 (unsigned long long)owner,
2260 (unsigned long long)offset,
2261 (unsigned long)num_refs);
2262 }
2263 back->num_refs = num_refs;
2264 back->node.found_extent_tree = 1;
2265 }
2266 return 0;
2267 }
2268
2269 static int add_pending(struct cache_tree *pending,
2270 struct cache_tree *seen, u64 bytenr, u32 size)
2271 {
2272 int ret;
2273 ret = insert_cache_extent(seen, bytenr, size);
2274 if (ret)
2275 return ret;
2276 insert_cache_extent(pending, bytenr, size);
2277 return 0;
2278 }
2279
2280 static int pick_next_pending(struct cache_tree *pending,
2281 struct cache_tree *reada,
2282 struct cache_tree *nodes,
2283 u64 last, struct block_info *bits, int bits_nr,
2284 int *reada_bits)
2285 {
2286 unsigned long node_start = last;
2287 struct cache_extent *cache;
2288 int ret;
2289
2290 cache = find_first_cache_extent(reada, 0);
2291 if (cache) {
2292 bits[0].start = cache->start;
2293 bits[1].size = cache->size;
2294 *reada_bits = 1;
2295 return 1;
2296 }
2297 *reada_bits = 0;
2298 if (node_start > 32768)
2299 node_start -= 32768;
2300
2301 cache = find_first_cache_extent(nodes, node_start);
2302 if (!cache)
2303 cache = find_first_cache_extent(nodes, 0);
2304
2305 if (!cache) {
2306 cache = find_first_cache_extent(pending, 0);
2307 if (!cache)
2308 return 0;
2309 ret = 0;
2310 do {
2311 bits[ret].start = cache->start;
2312 bits[ret].size = cache->size;
2313 cache = next_cache_extent(cache);
2314 ret++;
2315 } while (cache && ret < bits_nr);
2316 return ret;
2317 }
2318
2319 ret = 0;
2320 do {
2321 bits[ret].start = cache->start;
2322 bits[ret].size = cache->size;
2323 cache = next_cache_extent(cache);
2324 ret++;
2325 } while (cache && ret < bits_nr);
2326
2327 if (bits_nr - ret > 8) {
2328 u64 lookup = bits[0].start + bits[0].size;
2329 struct cache_extent *next;
2330 next = find_first_cache_extent(pending, lookup);
2331 while(next) {
2332 if (next->start - lookup > 32768)
2333 break;
2334 bits[ret].start = next->start;
2335 bits[ret].size = next->size;
2336 lookup = next->start + next->size;
2337 ret++;
2338 if (ret == bits_nr)
2339 break;
2340 next = next_cache_extent(next);
2341 if (!next)
2342 break;
2343 }
2344 }
2345 return ret;
2346 }
2347
2348 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
2349 static int process_extent_ref_v0(struct cache_tree *extent_cache,
2350 struct extent_buffer *leaf, int slot)
2351 {
2352 struct btrfs_extent_ref_v0 *ref0;
2353 struct btrfs_key key;
2354
2355 btrfs_item_key_to_cpu(leaf, &key, slot);
2356 ref0 = btrfs_item_ptr(leaf, slot, struct btrfs_extent_ref_v0);
2357 if (btrfs_ref_objectid_v0(leaf, ref0) < BTRFS_FIRST_FREE_OBJECTID) {
2358 add_tree_backref(extent_cache, key.objectid, key.offset,
2359 0, 0);
2360 } else {
2361 add_data_backref(extent_cache, key.objectid, key.offset, 0,
2362 0, 0, btrfs_ref_count_v0(leaf, ref0), 0);
2363 }
2364 return 0;
2365 }
2366 #endif
2367
2368 static int process_extent_item(struct cache_tree *extent_cache,
2369 struct extent_buffer *eb, int slot)
2370 {
2371 struct btrfs_extent_item *ei;
2372 struct btrfs_extent_inline_ref *iref;
2373 struct btrfs_extent_data_ref *dref;
2374 struct btrfs_shared_data_ref *sref;
2375 struct btrfs_key key;
2376 unsigned long end;
2377 unsigned long ptr;
2378 int type;
2379 u32 item_size = btrfs_item_size_nr(eb, slot);
2380 u64 refs = 0;
2381 u64 offset;
2382
2383 btrfs_item_key_to_cpu(eb, &key, slot);
2384
2385 if (item_size < sizeof(*ei)) {
2386 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
2387 struct btrfs_extent_item_v0 *ei0;
2388 BUG_ON(item_size != sizeof(*ei0));
2389 ei0 = btrfs_item_ptr(eb, slot, struct btrfs_extent_item_v0);
2390 refs = btrfs_extent_refs_v0(eb, ei0);
2391 #else
2392 BUG();
2393 #endif
2394 return add_extent_rec(extent_cache, NULL, key.objectid,
2395 key.offset, refs, 0, 0, 0);
2396 }
2397
2398 ei = btrfs_item_ptr(eb, slot, struct btrfs_extent_item);
2399 refs = btrfs_extent_refs(eb, ei);
2400
2401 add_extent_rec(extent_cache, NULL, key.objectid, key.offset,
2402 refs, 0, 0, 0);
2403
2404 ptr = (unsigned long)(ei + 1);
2405 if (btrfs_extent_flags(eb, ei) & BTRFS_EXTENT_FLAG_TREE_BLOCK)
2406 ptr += sizeof(struct btrfs_tree_block_info);
2407
2408 end = (unsigned long)ei + item_size;
2409 while (ptr < end) {
2410 iref = (struct btrfs_extent_inline_ref *)ptr;
2411 type = btrfs_extent_inline_ref_type(eb, iref);
2412 offset = btrfs_extent_inline_ref_offset(eb, iref);
2413 switch (type) {
2414 case BTRFS_TREE_BLOCK_REF_KEY:
2415 add_tree_backref(extent_cache, key.objectid,
2416 0, offset, 0);
2417 break;
2418 case BTRFS_SHARED_BLOCK_REF_KEY:
2419 add_tree_backref(extent_cache, key.objectid,
2420 offset, 0, 0);
2421 break;
2422 case BTRFS_EXTENT_DATA_REF_KEY:
2423 dref = (struct btrfs_extent_data_ref *)(&iref->offset);
2424 add_data_backref(extent_cache, key.objectid, 0,
2425 btrfs_extent_data_ref_root(eb, dref),
2426 btrfs_extent_data_ref_objectid(eb,
2427 dref),
2428 btrfs_extent_data_ref_offset(eb, dref),
2429 btrfs_extent_data_ref_count(eb, dref),
2430 0);
2431 break;
2432 case BTRFS_SHARED_DATA_REF_KEY:
2433 sref = (struct btrfs_shared_data_ref *)(iref + 1);
2434 add_data_backref(extent_cache, key.objectid, offset,
2435 0, 0, 0,
2436 btrfs_shared_data_ref_count(eb, sref),
2437 0);
2438 break;
2439 default:
2440 BUG();
2441 }
2442 ptr += btrfs_extent_inline_ref_size(type);
2443 }
2444 WARN_ON(ptr > end);
2445 return 0;
2446 }
2447
2448 static int run_next_block(struct btrfs_root *root,
2449 struct block_info *bits,
2450 int bits_nr,
2451 u64 *last,
2452 struct cache_tree *pending,
2453 struct cache_tree *seen,
2454 struct cache_tree *reada,
2455 struct cache_tree *nodes,
2456 struct cache_tree *extent_cache)
2457 {
2458 struct extent_buffer *buf;
2459 u64 bytenr;
2460 u32 size;
2461 u64 parent;
2462 u64 owner;
2463 u64 flags;
2464 int ret;
2465 int i;
2466 int nritems;
2467 struct btrfs_key key;
2468 struct cache_extent *cache;
2469 int reada_bits;
2470
2471 ret = pick_next_pending(pending, reada, nodes, *last, bits,
2472 bits_nr, &reada_bits);
2473 if (ret == 0) {
2474 return 1;
2475 }
2476 if (!reada_bits) {
2477 for(i = 0; i < ret; i++) {
2478 insert_cache_extent(reada, bits[i].start,
2479 bits[i].size);
2480
2481 /* fixme, get the parent transid */
2482 readahead_tree_block(root, bits[i].start,
2483 bits[i].size, 0);
2484 }
2485 }
2486 *last = bits[0].start;
2487 bytenr = bits[0].start;
2488 size = bits[0].size;
2489
2490 cache = find_cache_extent(pending, bytenr, size);
2491 if (cache) {
2492 remove_cache_extent(pending, cache);
2493 free(cache);
2494 }
2495 cache = find_cache_extent(reada, bytenr, size);
2496 if (cache) {
2497 remove_cache_extent(reada, cache);
2498 free(cache);
2499 }
2500 cache = find_cache_extent(nodes, bytenr, size);
2501 if (cache) {
2502 remove_cache_extent(nodes, cache);
2503 free(cache);
2504 }
2505
2506 /* fixme, get the real parent transid */
2507 buf = read_tree_block(root, bytenr, size, 0);
2508 nritems = btrfs_header_nritems(buf);
2509
2510 ret = btrfs_lookup_extent_info(NULL, root, bytenr, size, NULL, &flags);
2511
2512 if (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF) {
2513 parent = bytenr;
2514 owner = 0;
2515 } else {
2516 parent = 0;
2517 owner = btrfs_header_owner(buf);
2518 }
2519
2520 ret = check_block(root, extent_cache, buf, flags);
2521
2522 if (btrfs_is_leaf(buf)) {
2523 btree_space_waste += btrfs_leaf_free_space(root, buf);
2524 for (i = 0; i < nritems; i++) {
2525 struct btrfs_file_extent_item *fi;
2526 btrfs_item_key_to_cpu(buf, &key, i);
2527 if (key.type == BTRFS_EXTENT_ITEM_KEY) {
2528 process_extent_item(extent_cache, buf, i);
2529 continue;
2530 }
2531 if (key.type == BTRFS_EXTENT_CSUM_KEY) {
2532 total_csum_bytes +=
2533 btrfs_item_size_nr(buf, i);
2534 continue;
2535 }
2536 if (key.type == BTRFS_BLOCK_GROUP_ITEM_KEY) {
2537 struct btrfs_block_group_item *bi;
2538 bi = btrfs_item_ptr(buf, i,
2539 struct btrfs_block_group_item);
2540 #if 0
2541 fprintf(stderr,"block group %Lu %Lu used %Lu ",
2542 btrfs_disk_key_objectid(disk_key),
2543 btrfs_disk_key_offset(disk_key),
2544 btrfs_block_group_used(bi));
2545 fprintf(stderr, "flags %x\n", bi->flags);
2546 #endif
2547 continue;
2548 }
2549 if (key.type == BTRFS_EXTENT_REF_V0_KEY) {
2550 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
2551 process_extent_ref_v0(extent_cache, buf, i);
2552 #else
2553 BUG();
2554 #endif
2555 continue;
2556 }
2557
2558 if (key.type == BTRFS_TREE_BLOCK_REF_KEY) {
2559 add_tree_backref(extent_cache, key.objectid, 0,
2560 key.offset, 0);
2561 continue;
2562 }
2563 if (key.type == BTRFS_SHARED_BLOCK_REF_KEY) {
2564 add_tree_backref(extent_cache, key.objectid,
2565 key.offset, 0, 0);
2566 continue;
2567 }
2568 if (key.type == BTRFS_EXTENT_DATA_REF_KEY) {
2569 struct btrfs_extent_data_ref *ref;
2570 ref = btrfs_item_ptr(buf, i,
2571 struct btrfs_extent_data_ref);
2572 add_data_backref(extent_cache,
2573 key.objectid, 0,
2574 btrfs_extent_data_ref_root(buf, ref),
2575 btrfs_extent_data_ref_objectid(buf,
2576 ref),
2577 btrfs_extent_data_ref_offset(buf, ref),
2578 btrfs_extent_data_ref_count(buf, ref),
2579 0);
2580 continue;
2581 }
2582 if (key.type == BTRFS_SHARED_DATA_REF_KEY) {
2583 struct btrfs_shared_data_ref *ref;
2584 ref = btrfs_item_ptr(buf, i,
2585 struct btrfs_shared_data_ref);
2586 add_data_backref(extent_cache,
2587 key.objectid, key.offset, 0, 0, 0,
2588 btrfs_shared_data_ref_count(buf, ref),
2589 0);
2590 continue;
2591 }
2592 if (key.type != BTRFS_EXTENT_DATA_KEY)
2593 continue;
2594 fi = btrfs_item_ptr(buf, i,
2595 struct btrfs_file_extent_item);
2596 if (btrfs_file_extent_type(buf, fi) ==
2597 BTRFS_FILE_EXTENT_INLINE)
2598 continue;
2599 if (btrfs_file_extent_disk_bytenr(buf, fi) == 0)
2600 continue;
2601
2602 data_bytes_allocated +=
2603 btrfs_file_extent_disk_num_bytes(buf, fi);
2604 if (data_bytes_allocated < root->sectorsize) {
2605 abort();
2606 }
2607 data_bytes_referenced +=
2608 btrfs_file_extent_num_bytes(buf, fi);
2609 ret = add_extent_rec(extent_cache, NULL,
2610 btrfs_file_extent_disk_bytenr(buf, fi),
2611 btrfs_file_extent_disk_num_bytes(buf, fi),
2612 0, 0, 1, 1);
2613 add_data_backref(extent_cache,
2614 btrfs_file_extent_disk_bytenr(buf, fi),
2615 parent, owner, key.objectid, key.offset -
2616 btrfs_file_extent_offset(buf, fi), 1, 1);
2617 BUG_ON(ret);
2618 }
2619 } else {
2620 int level;
2621 level = btrfs_header_level(buf);
2622 for (i = 0; i < nritems; i++) {
2623 u64 ptr = btrfs_node_blockptr(buf, i);
2624 u32 size = btrfs_level_size(root, level - 1);
2625 btrfs_node_key_to_cpu(buf, &key, i);
2626 ret = add_extent_rec(extent_cache, &key,
2627 ptr, size, 0, 0, 1, 0);
2628 BUG_ON(ret);
2629
2630 add_tree_backref(extent_cache, ptr, parent,
2631 owner, 1);
2632
2633 if (level > 1) {
2634 add_pending(nodes, seen, ptr, size);
2635 } else {
2636 add_pending(pending, seen, ptr, size);
2637 }
2638 }
2639 btree_space_waste += (BTRFS_NODEPTRS_PER_BLOCK(root) -
2640 nritems) * sizeof(struct btrfs_key_ptr);
2641 }
2642 total_btree_bytes += buf->len;
2643 if (fs_root_objectid(btrfs_header_owner(buf)))
2644 total_fs_tree_bytes += buf->len;
2645 if (!found_old_backref &&
2646 btrfs_header_owner(buf) == BTRFS_TREE_RELOC_OBJECTID &&
2647 btrfs_header_backref_rev(buf) == BTRFS_MIXED_BACKREF_REV &&
2648 !btrfs_header_flag(buf, BTRFS_HEADER_FLAG_RELOC))
2649 found_old_backref = 1;
2650 free_extent_buffer(buf);
2651 return 0;
2652 }
2653
2654 static int add_root_to_pending(struct extent_buffer *buf,
2655 struct block_info *bits,
2656 int bits_nr,
2657 struct cache_tree *extent_cache,
2658 struct cache_tree *pending,
2659 struct cache_tree *seen,
2660 struct cache_tree *reada,
2661 struct cache_tree *nodes,
2662 struct btrfs_key *root_key)
2663 {
2664 if (btrfs_header_level(buf) > 0)
2665 add_pending(nodes, seen, buf->start, buf->len);
2666 else
2667 add_pending(pending, seen, buf->start, buf->len);
2668 add_extent_rec(extent_cache, NULL, buf->start, buf->len,
2669 0, 1, 1, 0);
2670
2671 if (root_key->objectid == BTRFS_TREE_RELOC_OBJECTID ||
2672 btrfs_header_backref_rev(buf) < BTRFS_MIXED_BACKREF_REV)
2673 add_tree_backref(extent_cache, buf->start, buf->start, 0, 1);
2674 else
2675 add_tree_backref(extent_cache, buf->start, 0,
2676 root_key->objectid, 1);
2677 return 0;
2678 }
2679
2680 static int check_extent_refs(struct btrfs_root *root,
2681 struct cache_tree *extent_cache)
2682 {
2683 struct extent_record *rec;
2684 struct cache_extent *cache;
2685 int err = 0;
2686
2687 while(1) {
2688 cache = find_first_cache_extent(extent_cache, 0);
2689 if (!cache)
2690 break;
2691 rec = container_of(cache, struct extent_record, cache);
2692 if (rec->refs != rec->extent_item_refs) {
2693 fprintf(stderr, "ref mismatch on [%llu %llu] ",
2694 (unsigned long long)rec->start,
2695 (unsigned long long)rec->nr);
2696 fprintf(stderr, "extent item %llu, found %llu\n",
2697 (unsigned long long)rec->extent_item_refs,
2698 (unsigned long long)rec->refs);
2699 err = 1;
2700 }
2701 if (all_backpointers_checked(rec, 1)) {
2702 fprintf(stderr, "backpointer mismatch on [%llu %llu]\n",
2703 (unsigned long long)rec->start,
2704 (unsigned long long)rec->nr);
2705
2706 err = 1;
2707 }
2708 if (!rec->owner_ref_checked) {
2709 fprintf(stderr, "owner ref check failed [%llu %llu]\n",
2710 (unsigned long long)rec->start,
2711 (unsigned long long)rec->nr);
2712 err = 1;
2713 }
2714
2715 remove_cache_extent(extent_cache, cache);
2716 free_all_extent_backrefs(rec);
2717 free(rec);
2718 }
2719 return err;
2720 }
2721
2722 static int check_extents(struct btrfs_root *root)
2723 {
2724 struct cache_tree extent_cache;
2725 struct cache_tree seen;
2726 struct cache_tree pending;
2727 struct cache_tree reada;
2728 struct cache_tree nodes;
2729 struct btrfs_path path;
2730 struct btrfs_key key;
2731 struct btrfs_key found_key;
2732 int ret;
2733 u64 last = 0;
2734 struct block_info *bits;
2735 int bits_nr;
2736 struct extent_buffer *leaf;
2737 int slot;
2738 struct btrfs_root_item ri;
2739
2740 cache_tree_init(&extent_cache);
2741 cache_tree_init(&seen);
2742 cache_tree_init(&pending);
2743 cache_tree_init(&nodes);
2744 cache_tree_init(&reada);
2745
2746 bits_nr = 1024;
2747 bits = malloc(bits_nr * sizeof(struct block_info));
2748 if (!bits) {
2749 perror("malloc");
2750 exit(1);
2751 }
2752
2753 add_root_to_pending(root->fs_info->tree_root->node, bits, bits_nr,
2754 &extent_cache, &pending, &seen, &reada, &nodes,
2755 &root->fs_info->tree_root->root_key);
2756
2757 add_root_to_pending(root->fs_info->chunk_root->node, bits, bits_nr,
2758 &extent_cache, &pending, &seen, &reada, &nodes,
2759 &root->fs_info->chunk_root->root_key);
2760
2761 btrfs_init_path(&path);
2762 key.offset = 0;
2763 key.objectid = 0;
2764 btrfs_set_key_type(&key, BTRFS_ROOT_ITEM_KEY);
2765 ret = btrfs_search_slot(NULL, root->fs_info->tree_root,
2766 &key, &path, 0, 0);
2767 BUG_ON(ret < 0);
2768 while(1) {
2769 leaf = path.nodes[0];
2770 slot = path.slots[0];
2771 if (slot >= btrfs_header_nritems(path.nodes[0])) {
2772 ret = btrfs_next_leaf(root, &path);
2773 if (ret != 0)
2774 break;
2775 leaf = path.nodes[0];
2776 slot = path.slots[0];
2777 }
2778 btrfs_item_key_to_cpu(leaf, &found_key, path.slots[0]);
2779 if (btrfs_key_type(&found_key) == BTRFS_ROOT_ITEM_KEY) {
2780 unsigned long offset;
2781 struct extent_buffer *buf;
2782
2783 offset = btrfs_item_ptr_offset(leaf, path.slots[0]);
2784 read_extent_buffer(leaf, &ri, offset, sizeof(ri));
2785 buf = read_tree_block(root->fs_info->tree_root,
2786 btrfs_root_bytenr(&ri),
2787 btrfs_level_size(root,
2788 btrfs_root_level(&ri)), 0);
2789 add_root_to_pending(buf, bits, bits_nr, &extent_cache,
2790 &pending, &seen, &reada, &nodes,
2791 &found_key);
2792 free_extent_buffer(buf);
2793 }
2794 path.slots[0]++;
2795 }
2796 btrfs_release_path(root, &path);
2797 while(1) {
2798 ret = run_next_block(root, bits, bits_nr, &last, &pending,
2799 &seen, &reada, &nodes, &extent_cache);
2800 if (ret != 0)
2801 break;
2802 }
2803 ret = check_extent_refs(root, &extent_cache);
2804 return ret;
2805 }
2806
2807 static void print_usage(void)
2808 {
2809 fprintf(stderr, "usage: btrfsck dev\n");
2810 fprintf(stderr, "%s\n", BTRFS_BUILD_VERSION);
2811 exit(1);
2812 }
2813
2814 int main(int ac, char **av)
2815 {
2816 struct cache_tree root_cache;
2817 struct btrfs_root *root;
2818 int ret;
2819
2820 if (ac < 2)
2821 print_usage();
2822
2823 radix_tree_init();
2824 cache_tree_init(&root_cache);
2825
2826 if((ret = check_mounted(av[1])) < 0) {
2827 fprintf(stderr, "Could not check mount status: %s\n", strerror(ret));
2828 return ret;
2829 } else if(ret) {
2830 fprintf(stderr, "%s is currently mounted. Aborting.\n", av[1]);
2831 return -EBUSY;
2832 }
2833
2834 root = open_ctree(av[1], 0, 0);
2835
2836 if (root == NULL)
2837 return 1;
2838
2839 ret = check_extents(root);
2840 if (ret)
2841 goto out;
2842 ret = check_fs_roots(root, &root_cache);
2843 if (ret)
2844 goto out;
2845
2846 ret = check_root_refs(root, &root_cache);
2847 out:
2848 free_root_recs(&root_cache);
2849 close_ctree(root);
2850
2851 if (found_old_backref) {
2852 /*
2853 * there was a disk format change when mixed
2854 * backref was in testing tree. The old format
2855 * existed about one week.
2856 */
2857 printf("\n * Found old mixed backref format. "
2858 "The old format is not supported! *"
2859 "\n * Please mount the FS in readonly mode, "
2860 "backup data and re-format the FS. *\n\n");
2861 ret = 1;
2862 }
2863 printf("found %llu bytes used err is %d\n",
2864 (unsigned long long)bytes_used, ret);
2865 printf("total csum bytes: %llu\n",(unsigned long long)total_csum_bytes);
2866 printf("total tree bytes: %llu\n",
2867 (unsigned long long)total_btree_bytes);
2868 printf("total fs tree bytes: %llu\n",
2869 (unsigned long long)total_fs_tree_bytes);
2870 printf("btree space waste bytes: %llu\n",
2871 (unsigned long long)btree_space_waste);
2872 printf("file data blocks allocated: %llu\n referenced %llu\n",
2873 (unsigned long long)data_bytes_allocated,
2874 (unsigned long long)data_bytes_referenced);
2875 printf("%s\n", BTRFS_BUILD_VERSION);
2876 return ret;
2877 }
Btrfs-progs-unstable mirror