cmds-check.c

   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 <unistd.h>
  24 #include <fcntl.h>
  25 #include <sys/types.h>
  26 #include <sys/stat.h>
  27 #include <unistd.h>
  28 #include <getopt.h>
  29 #include <uuid/uuid.h>
  30 #include "ctree.h"
  31 #include "volumes.h"
  32 #include "repair.h"
  33 #include "disk-io.h"
  34 #include "print-tree.h"
  35 #include "transaction.h"
  36 #include "version.h"
  37 #include "utils.h"
  38 #include "commands.h"
  39 #include "free-space-cache.h"
  40 #include "btrfsck.h"
  41
  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
  53 struct extent_backref {
  54         struct list_head list;
  55         unsigned int is_data:1;
  56         unsigned int found_extent_tree:1;
  57         unsigned int full_backref:1;
  58         unsigned int found_ref:1;
  59 };
  60
  61 struct data_backref {
  62         struct extent_backref node;
  63         union {
  64                 u64 parent;
  65                 u64 root;
  66         };
  67         u64 owner;
  68         u64 offset;
  69         u64 disk_bytenr;
  70         u64 bytes;
  71         u64 ram_bytes;
  72         u32 num_refs;
  73         u32 found_ref;
  74 };
  75
  76 struct tree_backref {
  77         struct extent_backref node;
  78         union {
  79                 u64 parent;
  80                 u64 root;
  81         };
  82 };
  83
  84 struct extent_record {
  85         struct list_head backrefs;
  86         struct list_head dups;
  87         struct list_head list;
  88         struct cache_extent cache;
  89         struct btrfs_disk_key parent_key;
  90         unsigned int found_rec;
  91         u64 start;
  92         u64 max_size;
  93         u64 nr;
  94         u64 refs;
  95         u64 extent_item_refs;
  96         u64 generation;
  97         u64 info_objectid;
  98         u64 num_duplicates;
  99         u8 info_level;
 100         unsigned int content_checked:1;
 101         unsigned int owner_ref_checked:1;
 102         unsigned int is_root:1;
 103         unsigned int metadata:1;
 104 };
 105
 106 struct inode_backref {
 107         struct list_head list;
 108         unsigned int found_dir_item:1;
 109         unsigned int found_dir_index:1;
 110         unsigned int found_inode_ref:1;
 111         unsigned int filetype:8;
 112         int errors;
 113         unsigned int ref_type;
 114         u64 dir;
 115         u64 index;
 116         u16 namelen;
 117         char name[0];
 118 };
 119
 120 #define REF_ERR_NO_DIR_ITEM             (1 << 0)
 121 #define REF_ERR_NO_DIR_INDEX            (1 << 1)
 122 #define REF_ERR_NO_INODE_REF            (1 << 2)
 123 #define REF_ERR_DUP_DIR_ITEM            (1 << 3)
 124 #define REF_ERR_DUP_DIR_INDEX           (1 << 4)
 125 #define REF_ERR_DUP_INODE_REF           (1 << 5)
 126 #define REF_ERR_INDEX_UNMATCH           (1 << 6)
 127 #define REF_ERR_FILETYPE_UNMATCH        (1 << 7)
 128 #define REF_ERR_NAME_TOO_LONG           (1 << 8) // 100
 129 #define REF_ERR_NO_ROOT_REF             (1 << 9)
 130 #define REF_ERR_NO_ROOT_BACKREF         (1 << 10)
 131 #define REF_ERR_DUP_ROOT_REF            (1 << 11)
 132 #define REF_ERR_DUP_ROOT_BACKREF        (1 << 12)
 133
 134 struct inode_record {
 135         struct list_head backrefs;
 136         unsigned int checked:1;
 137         unsigned int merging:1;
 138         unsigned int found_inode_item:1;
 139         unsigned int found_dir_item:1;
 140         unsigned int found_file_extent:1;
 141         unsigned int found_csum_item:1;
 142         unsigned int some_csum_missing:1;
 143         unsigned int nodatasum:1;
 144         int errors;
 145
 146         u64 ino;
 147         u32 nlink;
 148         u32 imode;
 149         u64 isize;
 150         u64 nbytes;
 151
 152         u32 found_link;
 153         u64 found_size;
 154         u64 extent_start;
 155         u64 extent_end;
 156         u64 first_extent_gap;
 157
 158         u32 refs;
 159 };
 160
 161 #define I_ERR_NO_INODE_ITEM             (1 << 0)
 162 #define I_ERR_NO_ORPHAN_ITEM            (1 << 1)
 163 #define I_ERR_DUP_INODE_ITEM            (1 << 2)
 164 #define I_ERR_DUP_DIR_INDEX             (1 << 3)
 165 #define I_ERR_ODD_DIR_ITEM              (1 << 4)
 166 #define I_ERR_ODD_FILE_EXTENT           (1 << 5)
 167 #define I_ERR_BAD_FILE_EXTENT           (1 << 6)
 168 #define I_ERR_FILE_EXTENT_OVERLAP       (1 << 7)
 169 #define I_ERR_FILE_EXTENT_DISCOUNT      (1 << 8) // 100
 170 #define I_ERR_DIR_ISIZE_WRONG           (1 << 9)
 171 #define I_ERR_FILE_NBYTES_WRONG         (1 << 10) // 400
 172 #define I_ERR_ODD_CSUM_ITEM             (1 << 11)
 173 #define I_ERR_SOME_CSUM_MISSING         (1 << 12)
 174 #define I_ERR_LINK_COUNT_WRONG          (1 << 13)
 175
 176 struct root_backref {
 177         struct list_head list;
 178         unsigned int found_dir_item:1;
 179         unsigned int found_dir_index:1;
 180         unsigned int found_back_ref:1;
 181         unsigned int found_forward_ref:1;
 182         unsigned int reachable:1;
 183         int errors;
 184         u64 ref_root;
 185         u64 dir;
 186         u64 index;
 187         u16 namelen;
 188         char name[0];
 189 };
 190
 191 struct root_record {
 192         struct list_head backrefs;
 193         struct cache_extent cache;
 194         unsigned int found_root_item:1;
 195         u64 objectid;
 196         u32 found_ref;
 197 };
 198
 199 struct ptr_node {
 200         struct cache_extent cache;
 201         void *data;
 202 };
 203
 204 struct shared_node {
 205         struct cache_extent cache;
 206         struct cache_tree root_cache;
 207         struct cache_tree inode_cache;
 208         struct inode_record *current;
 209         u32 refs;
 210 };
 211
 212 struct block_info {
 213         u64 start;
 214         u32 size;
 215 };
 216
 217 struct walk_control {
 218         struct cache_tree shared;
 219         struct shared_node *nodes[BTRFS_MAX_LEVEL];
 220         int active_node;
 221         int root_level;
 222 };
 223
 224 static u8 imode_to_type(u32 imode)
 225 {
 226 #define S_SHIFT 12
 227         static unsigned char btrfs_type_by_mode[S_IFMT >> S_SHIFT] = {
 228                 [S_IFREG >> S_SHIFT]    = BTRFS_FT_REG_FILE,
 229                 [S_IFDIR >> S_SHIFT]    = BTRFS_FT_DIR,
 230                 [S_IFCHR >> S_SHIFT]    = BTRFS_FT_CHRDEV,
 231                 [S_IFBLK >> S_SHIFT]    = BTRFS_FT_BLKDEV,
 232                 [S_IFIFO >> S_SHIFT]    = BTRFS_FT_FIFO,
 233                 [S_IFSOCK >> S_SHIFT]   = BTRFS_FT_SOCK,
 234                 [S_IFLNK >> S_SHIFT]    = BTRFS_FT_SYMLINK,
 235         };
 236
 237         return btrfs_type_by_mode[(imode & S_IFMT) >> S_SHIFT];
 238 #undef S_SHIFT
 239 }
 240
 241 static int device_record_compare(struct rb_node *node1, struct rb_node *node2)
 242 {
 243         struct device_record *rec1;
 244         struct device_record *rec2;
 245
 246         rec1 = rb_entry(node1, struct device_record, node);
 247         rec2 = rb_entry(node2, struct device_record, node);
 248         if (rec1->devid > rec2->devid)
 249                 return -1;
 250         else if (rec1->devid < rec2->devid)
 251                 return 1;
 252         else
 253                 return 0;
 254 }
 255
 256 static struct inode_record *clone_inode_rec(struct inode_record *orig_rec)
 257 {
 258         struct inode_record *rec;
 259         struct inode_backref *backref;
 260         struct inode_backref *orig;
 261         size_t size;
 262
 263         rec = malloc(sizeof(*rec));
 264         memcpy(rec, orig_rec, sizeof(*rec));
 265         rec->refs = 1;
 266         INIT_LIST_HEAD(&rec->backrefs);
 267
 268         list_for_each_entry(orig, &orig_rec->backrefs, list) {
 269                 size = sizeof(*orig) + orig->namelen + 1;
 270                 backref = malloc(size);
 271                 memcpy(backref, orig, size);
 272                 list_add_tail(&backref->list, &rec->backrefs);
 273         }
 274         return rec;
 275 }
 276
 277 static struct inode_record *get_inode_rec(struct cache_tree *inode_cache,
 278                                           u64 ino, int mod)
 279 {
 280         struct ptr_node *node;
 281         struct cache_extent *cache;
 282         struct inode_record *rec = NULL;
 283         int ret;
 284
 285         cache = lookup_cache_extent(inode_cache, ino, 1);
 286         if (cache) {
 287                 node = container_of(cache, struct ptr_node, cache);
 288                 rec = node->data;
 289                 if (mod && rec->refs > 1) {
 290                         node->data = clone_inode_rec(rec);
 291                         rec->refs--;
 292                         rec = node->data;
 293                 }
 294         } else if (mod) {
 295                 rec = calloc(1, sizeof(*rec));
 296                 rec->ino = ino;
 297                 rec->extent_start = (u64)-1;
 298                 rec->first_extent_gap = (u64)-1;
 299                 rec->refs = 1;
 300                 INIT_LIST_HEAD(&rec->backrefs);
 301
 302                 node = malloc(sizeof(*node));
 303                 node->cache.start = ino;
 304                 node->cache.size = 1;
 305                 node->data = rec;
 306
 307                 if (ino == BTRFS_FREE_INO_OBJECTID)
 308                         rec->found_link = 1;
 309
 310                 ret = insert_cache_extent(inode_cache, &node->cache);
 311                 BUG_ON(ret);
 312         }
 313         return rec;
 314 }
 315
 316 static void free_inode_rec(struct inode_record *rec)
 317 {
 318         struct inode_backref *backref;
 319
 320         if (--rec->refs > 0)
 321                 return;
 322
 323         while (!list_empty(&rec->backrefs)) {
 324                 backref = list_entry(rec->backrefs.next,
 325                                      struct inode_backref, list);
 326                 list_del(&backref->list);
 327                 free(backref);
 328         }
 329         free(rec);
 330 }
 331
 332 static int can_free_inode_rec(struct inode_record *rec)
 333 {
 334         if (!rec->errors && rec->checked && rec->found_inode_item &&
 335             rec->nlink == rec->found_link && list_empty(&rec->backrefs))
 336                 return 1;
 337         return 0;
 338 }
 339
 340 static void maybe_free_inode_rec(struct cache_tree *inode_cache,
 341                                  struct inode_record *rec)
 342 {
 343         struct cache_extent *cache;
 344         struct inode_backref *tmp, *backref;
 345         struct ptr_node *node;
 346         unsigned char filetype;
 347
 348         if (!rec->found_inode_item)
 349                 return;
 350
 351         filetype = imode_to_type(rec->imode);
 352         list_for_each_entry_safe(backref, tmp, &rec->backrefs, list) {
 353                 if (backref->found_dir_item && backref->found_dir_index) {
 354                         if (backref->filetype != filetype)
 355                                 backref->errors |= REF_ERR_FILETYPE_UNMATCH;
 356                         if (!backref->errors && backref->found_inode_ref) {
 357                                 list_del(&backref->list);
 358                                 free(backref);
 359                         }
 360                 }
 361         }
 362
 363         if (!rec->checked || rec->merging)
 364                 return;
 365
 366         if (S_ISDIR(rec->imode)) {
 367                 if (rec->found_size != rec->isize)
 368                         rec->errors |= I_ERR_DIR_ISIZE_WRONG;
 369                 if (rec->found_file_extent)
 370                         rec->errors |= I_ERR_ODD_FILE_EXTENT;
 371         } else if (S_ISREG(rec->imode) || S_ISLNK(rec->imode)) {
 372                 if (rec->found_dir_item)
 373                         rec->errors |= I_ERR_ODD_DIR_ITEM;
 374                 if (rec->found_size != rec->nbytes)
 375                         rec->errors |= I_ERR_FILE_NBYTES_WRONG;
 376                 if (rec->extent_start == (u64)-1 || rec->extent_start > 0)
 377                         rec->first_extent_gap = 0;
 378                 if (rec->nlink > 0 && (rec->extent_end < rec->isize ||
 379                     rec->first_extent_gap < rec->isize))
 380                         rec->errors |= I_ERR_FILE_EXTENT_DISCOUNT;
 381         }
 382
 383         if (S_ISREG(rec->imode) || S_ISLNK(rec->imode)) {
 384                 if (rec->found_csum_item && rec->nodatasum)
 385                         rec->errors |= I_ERR_ODD_CSUM_ITEM;
 386                 if (rec->some_csum_missing && !rec->nodatasum)
 387                         rec->errors |= I_ERR_SOME_CSUM_MISSING;
 388         }
 389
 390         BUG_ON(rec->refs != 1);
 391         if (can_free_inode_rec(rec)) {
 392                 cache = lookup_cache_extent(inode_cache, rec->ino, 1);
 393                 node = container_of(cache, struct ptr_node, cache);
 394                 BUG_ON(node->data != rec);
 395                 remove_cache_extent(inode_cache, &node->cache);
 396                 free(node);
 397                 free_inode_rec(rec);
 398         }
 399 }
 400
 401 static int check_orphan_item(struct btrfs_root *root, u64 ino)
 402 {
 403         struct btrfs_path path;
 404         struct btrfs_key key;
 405         int ret;
 406
 407         key.objectid = BTRFS_ORPHAN_OBJECTID;
 408         key.type = BTRFS_ORPHAN_ITEM_KEY;
 409         key.offset = ino;
 410
 411         btrfs_init_path(&path);
 412         ret = btrfs_search_slot(NULL, root, &key, &path, 0, 0);
 413         btrfs_release_path(&path);
 414         if (ret > 0)
 415                 ret = -ENOENT;
 416         return ret;
 417 }
 418
 419 static int process_inode_item(struct extent_buffer *eb,
 420                               int slot, struct btrfs_key *key,
 421                               struct shared_node *active_node)
 422 {
 423         struct inode_record *rec;
 424         struct btrfs_inode_item *item;
 425
 426         rec = active_node->current;
 427         BUG_ON(rec->ino != key->objectid || rec->refs > 1);
 428         if (rec->found_inode_item) {
 429                 rec->errors |= I_ERR_DUP_INODE_ITEM;
 430                 return 1;
 431         }
 432         item = btrfs_item_ptr(eb, slot, struct btrfs_inode_item);
 433         rec->nlink = btrfs_inode_nlink(eb, item);
 434         rec->isize = btrfs_inode_size(eb, item);
 435         rec->nbytes = btrfs_inode_nbytes(eb, item);
 436         rec->imode = btrfs_inode_mode(eb, item);
 437         if (btrfs_inode_flags(eb, item) & BTRFS_INODE_NODATASUM)
 438                 rec->nodatasum = 1;
 439         rec->found_inode_item = 1;
 440         if (rec->nlink == 0)
 441                 rec->errors |= I_ERR_NO_ORPHAN_ITEM;
 442         maybe_free_inode_rec(&active_node->inode_cache, rec);
 443         return 0;
 444 }
 445
 446 static struct inode_backref *get_inode_backref(struct inode_record *rec,
 447                                                 const char *name,
 448                                                 int namelen, u64 dir)
 449 {
 450         struct inode_backref *backref;
 451
 452         list_for_each_entry(backref, &rec->backrefs, list) {
 453                 if (backref->dir != dir || backref->namelen != namelen)
 454                         continue;
 455                 if (memcmp(name, backref->name, namelen))
 456                         continue;
 457                 return backref;
 458         }
 459
 460         backref = malloc(sizeof(*backref) + namelen + 1);
 461         memset(backref, 0, sizeof(*backref));
 462         backref->dir = dir;
 463         backref->namelen = namelen;
 464         memcpy(backref->name, name, namelen);
 465         backref->name[namelen] = '\0';
 466         list_add_tail(&backref->list, &rec->backrefs);
 467         return backref;
 468 }
 469
 470 static int add_inode_backref(struct cache_tree *inode_cache,
 471                              u64 ino, u64 dir, u64 index,
 472                              const char *name, int namelen,
 473                              int filetype, int itemtype, int errors)
 474 {
 475         struct inode_record *rec;
 476         struct inode_backref *backref;
 477
 478         rec = get_inode_rec(inode_cache, ino, 1);
 479         backref = get_inode_backref(rec, name, namelen, dir);
 480         if (errors)
 481                 backref->errors |= errors;
 482         if (itemtype == BTRFS_DIR_INDEX_KEY) {
 483                 if (backref->found_dir_index)
 484                         backref->errors |= REF_ERR_DUP_DIR_INDEX;
 485                 if (backref->found_inode_ref && backref->index != index)
 486                         backref->errors |= REF_ERR_INDEX_UNMATCH;
 487                 if (backref->found_dir_item && backref->filetype != filetype)
 488                         backref->errors |= REF_ERR_FILETYPE_UNMATCH;
 489
 490                 backref->index = index;
 491                 backref->filetype = filetype;
 492                 backref->found_dir_index = 1;
 493         } else if (itemtype == BTRFS_DIR_ITEM_KEY) {
 494                 rec->found_link++;
 495                 if (backref->found_dir_item)
 496                         backref->errors |= REF_ERR_DUP_DIR_ITEM;
 497                 if (backref->found_dir_index && backref->filetype != filetype)
 498                         backref->errors |= REF_ERR_FILETYPE_UNMATCH;
 499
 500                 backref->filetype = filetype;
 501                 backref->found_dir_item = 1;
 502         } else if ((itemtype == BTRFS_INODE_REF_KEY) ||
 503                    (itemtype == BTRFS_INODE_EXTREF_KEY)) {
 504                 if (backref->found_inode_ref)
 505                         backref->errors |= REF_ERR_DUP_INODE_REF;
 506                 if (backref->found_dir_index && backref->index != index)
 507                         backref->errors |= REF_ERR_INDEX_UNMATCH;
 508
 509                 backref->ref_type = itemtype;
 510                 backref->index = index;
 511                 backref->found_inode_ref = 1;
 512         } else {
 513                 BUG_ON(1);
 514         }
 515
 516         maybe_free_inode_rec(inode_cache, rec);
 517         return 0;
 518 }
 519
 520 static int merge_inode_recs(struct inode_record *src, struct inode_record *dst,
 521                             struct cache_tree *dst_cache)
 522 {
 523         struct inode_backref *backref;
 524         u32 dir_count = 0;
 525
 526         dst->merging = 1;
 527         list_for_each_entry(backref, &src->backrefs, list) {
 528                 if (backref->found_dir_index) {
 529                         add_inode_backref(dst_cache, dst->ino, backref->dir,
 530                                         backref->index, backref->name,
 531                                         backref->namelen, backref->filetype,
 532                                         BTRFS_DIR_INDEX_KEY, backref->errors);
 533                 }
 534                 if (backref->found_dir_item) {
 535                         dir_count++;
 536                         add_inode_backref(dst_cache, dst->ino,
 537                                         backref->dir, 0, backref->name,
 538                                         backref->namelen, backref->filetype,
 539                                         BTRFS_DIR_ITEM_KEY, backref->errors);
 540                 }
 541                 if (backref->found_inode_ref) {
 542                         add_inode_backref(dst_cache, dst->ino,
 543                                         backref->dir, backref->index,
 544                                         backref->name, backref->namelen, 0,
 545                                         backref->ref_type, backref->errors);
 546                 }
 547         }
 548
 549         if (src->found_dir_item)
 550                 dst->found_dir_item = 1;
 551         if (src->found_file_extent)
 552                 dst->found_file_extent = 1;
 553         if (src->found_csum_item)
 554                 dst->found_csum_item = 1;
 555         if (src->some_csum_missing)
 556                 dst->some_csum_missing = 1;
 557         if (dst->first_extent_gap > src->first_extent_gap)
 558                 dst->first_extent_gap = src->first_extent_gap;
 559
 560         BUG_ON(src->found_link < dir_count);
 561         dst->found_link += src->found_link - dir_count;
 562         dst->found_size += src->found_size;
 563         if (src->extent_start != (u64)-1) {
 564                 if (dst->extent_start == (u64)-1) {
 565                         dst->extent_start = src->extent_start;
 566                         dst->extent_end = src->extent_end;
 567                 } else {
 568                         if (dst->extent_end > src->extent_start)
 569                                 dst->errors |= I_ERR_FILE_EXTENT_OVERLAP;
 570                         else if (dst->extent_end < src->extent_start &&
 571                                  dst->extent_end < dst->first_extent_gap)
 572                                 dst->first_extent_gap = dst->extent_end;
 573                         if (dst->extent_end < src->extent_end)
 574                                 dst->extent_end = src->extent_end;
 575                 }
 576         }
 577
 578         dst->errors |= src->errors;
 579         if (src->found_inode_item) {
 580                 if (!dst->found_inode_item) {
 581                         dst->nlink = src->nlink;
 582                         dst->isize = src->isize;
 583                         dst->nbytes = src->nbytes;
 584                         dst->imode = src->imode;
 585                         dst->nodatasum = src->nodatasum;
 586                         dst->found_inode_item = 1;
 587                 } else {
 588                         dst->errors |= I_ERR_DUP_INODE_ITEM;
 589                 }
 590         }
 591         dst->merging = 0;
 592
 593         return 0;
 594 }
 595
 596 static int splice_shared_node(struct shared_node *src_node,
 597                               struct shared_node *dst_node)
 598 {
 599         struct cache_extent *cache;
 600         struct ptr_node *node, *ins;
 601         struct cache_tree *src, *dst;
 602         struct inode_record *rec, *conflict;
 603         u64 current_ino = 0;
 604         int splice = 0;
 605         int ret;
 606
 607         if (--src_node->refs == 0)
 608                 splice = 1;
 609         if (src_node->current)
 610                 current_ino = src_node->current->ino;
 611
 612         src = &src_node->root_cache;
 613         dst = &dst_node->root_cache;
 614 again:
 615         cache = search_cache_extent(src, 0);
 616         while (cache) {
 617                 node = container_of(cache, struct ptr_node, cache);
 618                 rec = node->data;
 619                 cache = next_cache_extent(cache);
 620
 621                 if (splice) {
 622                         remove_cache_extent(src, &node->cache);
 623                         ins = node;
 624                 } else {
 625                         ins = malloc(sizeof(*ins));
 626                         ins->cache.start = node->cache.start;
 627                         ins->cache.size = node->cache.size;
 628                         ins->data = rec;
 629                         rec->refs++;
 630                 }
 631                 ret = insert_cache_extent(dst, &ins->cache);
 632                 if (ret == -EEXIST) {
 633                         conflict = get_inode_rec(dst, rec->ino, 1);
 634                         merge_inode_recs(rec, conflict, dst);
 635                         if (rec->checked) {
 636                                 conflict->checked = 1;
 637                                 if (dst_node->current == conflict)
 638                                         dst_node->current = NULL;
 639                         }
 640                         maybe_free_inode_rec(dst, conflict);
 641                         free_inode_rec(rec);
 642                         free(ins);
 643                 } else {
 644                         BUG_ON(ret);
 645                 }
 646         }
 647
 648         if (src == &src_node->root_cache) {
 649                 src = &src_node->inode_cache;
 650                 dst = &dst_node->inode_cache;
 651                 goto again;
 652         }
 653
 654         if (current_ino > 0 && (!dst_node->current ||
 655             current_ino > dst_node->current->ino)) {
 656                 if (dst_node->current) {
 657                         dst_node->current->checked = 1;
 658                         maybe_free_inode_rec(dst, dst_node->current);
 659                 }
 660                 dst_node->current = get_inode_rec(dst, current_ino, 1);
 661         }
 662         return 0;
 663 }
 664
 665 static void free_inode_ptr(struct cache_extent *cache)
 666 {
 667         struct ptr_node *node;
 668         struct inode_record *rec;
 669
 670         node = container_of(cache, struct ptr_node, cache);
 671         rec = node->data;
 672         free_inode_rec(rec);
 673         free(node);
 674 }
 675
 676 FREE_EXTENT_CACHE_BASED_TREE(inode_recs, free_inode_ptr);
 677
 678 static struct shared_node *find_shared_node(struct cache_tree *shared,
 679                                             u64 bytenr)
 680 {
 681         struct cache_extent *cache;
 682         struct shared_node *node;
 683
 684         cache = lookup_cache_extent(shared, bytenr, 1);
 685         if (cache) {
 686                 node = container_of(cache, struct shared_node, cache);
 687                 return node;
 688         }
 689         return NULL;
 690 }
 691
 692 static int add_shared_node(struct cache_tree *shared, u64 bytenr, u32 refs)
 693 {
 694         int ret;
 695         struct shared_node *node;
 696
 697         node = calloc(1, sizeof(*node));
 698         node->cache.start = bytenr;
 699         node->cache.size = 1;
 700         cache_tree_init(&node->root_cache);
 701         cache_tree_init(&node->inode_cache);
 702         node->refs = refs;
 703
 704         ret = insert_cache_extent(shared, &node->cache);
 705         BUG_ON(ret);
 706         return 0;
 707 }
 708
 709 static int enter_shared_node(struct btrfs_root *root, u64 bytenr, u32 refs,
 710                              struct walk_control *wc, int level)
 711 {
 712         struct shared_node *node;
 713         struct shared_node *dest;
 714
 715         if (level == wc->active_node)
 716                 return 0;
 717
 718         BUG_ON(wc->active_node <= level);
 719         node = find_shared_node(&wc->shared, bytenr);
 720         if (!node) {
 721                 add_shared_node(&wc->shared, bytenr, refs);
 722                 node = find_shared_node(&wc->shared, bytenr);
 723                 wc->nodes[level] = node;
 724                 wc->active_node = level;
 725                 return 0;
 726         }
 727
 728         if (wc->root_level == wc->active_node &&
 729             btrfs_root_refs(&root->root_item) == 0) {
 730                 if (--node->refs == 0) {
 731                         free_inode_recs_tree(&node->root_cache);
 732                         free_inode_recs_tree(&node->inode_cache);
 733                         remove_cache_extent(&wc->shared, &node->cache);
 734                         free(node);
 735                 }
 736                 return 1;
 737         }
 738
 739         dest = wc->nodes[wc->active_node];
 740         splice_shared_node(node, dest);
 741         if (node->refs == 0) {
 742                 remove_cache_extent(&wc->shared, &node->cache);
 743                 free(node);
 744         }
 745         return 1;
 746 }
 747
 748 static int leave_shared_node(struct btrfs_root *root,
 749                              struct walk_control *wc, int level)
 750 {
 751         struct shared_node *node;
 752         struct shared_node *dest;
 753         int i;
 754
 755         if (level == wc->root_level)
 756                 return 0;
 757
 758         for (i = level + 1; i < BTRFS_MAX_LEVEL; i++) {
 759                 if (wc->nodes[i])
 760                         break;
 761         }
 762         BUG_ON(i >= BTRFS_MAX_LEVEL);
 763
 764         node = wc->nodes[wc->active_node];
 765         wc->nodes[wc->active_node] = NULL;
 766         wc->active_node = i;
 767
 768         dest = wc->nodes[wc->active_node];
 769         if (wc->active_node < wc->root_level ||
 770             btrfs_root_refs(&root->root_item) > 0) {
 771                 BUG_ON(node->refs <= 1);
 772                 splice_shared_node(node, dest);
 773         } else {
 774                 BUG_ON(node->refs < 2);
 775                 node->refs--;
 776         }
 777         return 0;
 778 }
 779
 780 static int is_child_root(struct btrfs_root *root, u64 parent_root_id,
 781                          u64 child_root_id)
 782 {
 783         struct btrfs_path path;
 784         struct btrfs_key key;
 785         struct extent_buffer *leaf;
 786         int has_parent = 0;
 787         int ret;
 788
 789         btrfs_init_path(&path);
 790
 791         key.objectid = parent_root_id;
 792         key.type = BTRFS_ROOT_REF_KEY;
 793         key.offset = child_root_id;
 794         ret = btrfs_search_slot(NULL, root->fs_info->tree_root, &key, &path,
 795                                 0, 0);
 796         BUG_ON(ret < 0);
 797         btrfs_release_path(&path);
 798         if (!ret)
 799                 return 1;
 800
 801         key.objectid = child_root_id;
 802         key.type = BTRFS_ROOT_BACKREF_KEY;
 803         key.offset = 0;
 804         ret = btrfs_search_slot(NULL, root->fs_info->tree_root, &key, &path,
 805                                 0, 0);
 806         BUG_ON(ret <= 0);
 807
 808         while (1) {
 809                 leaf = path.nodes[0];
 810                 if (path.slots[0] >= btrfs_header_nritems(leaf)) {
 811                         ret = btrfs_next_leaf(root->fs_info->tree_root, &path);
 812                         BUG_ON(ret < 0);
 813
 814                         if (ret > 0)
 815                                 break;
 816                         leaf = path.nodes[0];
 817                 }
 818
 819                 btrfs_item_key_to_cpu(leaf, &key, path.slots[0]);
 820                 if (key.objectid != child_root_id ||
 821                     key.type != BTRFS_ROOT_BACKREF_KEY)
 822                         break;
 823
 824                 has_parent = 1;
 825
 826                 if (key.offset == parent_root_id) {
 827                         btrfs_release_path(&path);
 828                         return 1;
 829                 }
 830
 831                 path.slots[0]++;
 832         }
 833
 834         btrfs_release_path(&path);
 835         return has_parent? 0 : -1;
 836 }
 837
 838 static int process_dir_item(struct btrfs_root *root,
 839                             struct extent_buffer *eb,
 840                             int slot, struct btrfs_key *key,
 841                             struct shared_node *active_node)
 842 {
 843         u32 total;
 844         u32 cur = 0;
 845         u32 len;
 846         u32 name_len;
 847         u32 data_len;
 848         int error;
 849         int nritems = 0;
 850         int filetype;
 851         struct btrfs_dir_item *di;
 852         struct inode_record *rec;
 853         struct cache_tree *root_cache;
 854         struct cache_tree *inode_cache;
 855         struct btrfs_key location;
 856         char namebuf[BTRFS_NAME_LEN];
 857
 858         root_cache = &active_node->root_cache;
 859         inode_cache = &active_node->inode_cache;
 860         rec = active_node->current;
 861         rec->found_dir_item = 1;
 862
 863         di = btrfs_item_ptr(eb, slot, struct btrfs_dir_item);
 864         total = btrfs_item_size_nr(eb, slot);
 865         while (cur < total) {
 866                 nritems++;
 867                 btrfs_dir_item_key_to_cpu(eb, di, &location);
 868                 name_len = btrfs_dir_name_len(eb, di);
 869                 data_len = btrfs_dir_data_len(eb, di);
 870                 filetype = btrfs_dir_type(eb, di);
 871
 872                 rec->found_size += name_len;
 873                 if (name_len <= BTRFS_NAME_LEN) {
 874                         len = name_len;
 875                         error = 0;
 876                 } else {
 877                         len = BTRFS_NAME_LEN;
 878                         error = REF_ERR_NAME_TOO_LONG;
 879                 }
 880                 read_extent_buffer(eb, namebuf, (unsigned long)(di + 1), len);
 881
 882                 if (location.type == BTRFS_INODE_ITEM_KEY) {
 883                         add_inode_backref(inode_cache, location.objectid,
 884                                           key->objectid, key->offset, namebuf,
 885                                           len, filetype, key->type, error);
 886                 } else if (location.type == BTRFS_ROOT_ITEM_KEY) {
 887                         add_inode_backref(root_cache, location.objectid,
 888                                           key->objectid, key->offset,
 889                                           namebuf, len, filetype,
 890                                           key->type, error);
 891                 } else {
 892                         fprintf(stderr, "warning line %d\n", __LINE__);
 893                 }
 894
 895                 len = sizeof(*di) + name_len + data_len;
 896                 di = (struct btrfs_dir_item *)((char *)di + len);
 897                 cur += len;
 898         }
 899         if (key->type == BTRFS_DIR_INDEX_KEY && nritems > 1)
 900                 rec->errors |= I_ERR_DUP_DIR_INDEX;
 901
 902         return 0;
 903 }
 904
 905 static int process_inode_ref(struct extent_buffer *eb,
 906                              int slot, struct btrfs_key *key,
 907                              struct shared_node *active_node)
 908 {
 909         u32 total;
 910         u32 cur = 0;
 911         u32 len;
 912         u32 name_len;
 913         u64 index;
 914         int error;
 915         struct cache_tree *inode_cache;
 916         struct btrfs_inode_ref *ref;
 917         char namebuf[BTRFS_NAME_LEN];
 918
 919         inode_cache = &active_node->inode_cache;
 920
 921         ref = btrfs_item_ptr(eb, slot, struct btrfs_inode_ref);
 922         total = btrfs_item_size_nr(eb, slot);
 923         while (cur < total) {
 924                 name_len = btrfs_inode_ref_name_len(eb, ref);
 925                 index = btrfs_inode_ref_index(eb, ref);
 926                 if (name_len <= BTRFS_NAME_LEN) {
 927                         len = name_len;
 928                         error = 0;
 929                 } else {
 930                         len = BTRFS_NAME_LEN;
 931                         error = REF_ERR_NAME_TOO_LONG;
 932                 }
 933                 read_extent_buffer(eb, namebuf, (unsigned long)(ref + 1), len);
 934                 add_inode_backref(inode_cache, key->objectid, key->offset,
 935                                   index, namebuf, len, 0, key->type, error);
 936
 937                 len = sizeof(*ref) + name_len;
 938                 ref = (struct btrfs_inode_ref *)((char *)ref + len);
 939                 cur += len;
 940         }
 941         return 0;
 942 }
 943
 944 static int process_inode_extref(struct extent_buffer *eb,
 945                                 int slot, struct btrfs_key *key,
 946                                 struct shared_node *active_node)
 947 {
 948         u32 total;
 949         u32 cur = 0;
 950         u32 len;
 951         u32 name_len;
 952         u64 index;
 953         u64 parent;
 954         int error;
 955         struct cache_tree *inode_cache;
 956         struct btrfs_inode_extref *extref;
 957         char namebuf[BTRFS_NAME_LEN];
 958
 959         inode_cache = &active_node->inode_cache;
 960
 961         extref = btrfs_item_ptr(eb, slot, struct btrfs_inode_extref);
 962         total = btrfs_item_size_nr(eb, slot);
 963         while (cur < total) {
 964                 name_len = btrfs_inode_extref_name_len(eb, extref);
 965                 index = btrfs_inode_extref_index(eb, extref);
 966                 parent = btrfs_inode_extref_parent(eb, extref);
 967                 if (name_len <= BTRFS_NAME_LEN) {
 968                         len = name_len;
 969                         error = 0;
 970                 } else {
 971                         len = BTRFS_NAME_LEN;
 972                         error = REF_ERR_NAME_TOO_LONG;
 973                 }
 974                 read_extent_buffer(eb, namebuf,
 975                                    (unsigned long)(extref + 1), len);
 976                 add_inode_backref(inode_cache, key->objectid, parent,
 977                                   index, namebuf, len, 0, key->type, error);
 978
 979                 len = sizeof(*extref) + name_len;
 980                 extref = (struct btrfs_inode_extref *)((char *)extref + len);
 981                 cur += len;
 982         }
 983         return 0;
 984
 985 }
 986
 987 static u64 count_csum_range(struct btrfs_root *root, u64 start, u64 len)
 988 {
 989         struct btrfs_key key;
 990         struct btrfs_path path;
 991         struct extent_buffer *leaf;
 992         int ret ;
 993         size_t size;
 994         u64 found = 0;
 995         u64 csum_end;
 996         u16 csum_size = btrfs_super_csum_size(root->fs_info->super_copy);
 997
 998         btrfs_init_path(&path);
 999
1000         key.objectid = BTRFS_EXTENT_CSUM_OBJECTID;
1001         key.offset = start;
1002         key.type = BTRFS_EXTENT_CSUM_KEY;
1003
1004         ret = btrfs_search_slot(NULL, root->fs_info->csum_root,
1005                                 &key, &path, 0, 0);
1006         BUG_ON(ret < 0);
1007         if (ret > 0 && path.slots[0] > 0) {
1008                 leaf = path.nodes[0];
1009                 btrfs_item_key_to_cpu(leaf, &key, path.slots[0] - 1);
1010                 if (key.objectid == BTRFS_EXTENT_CSUM_OBJECTID &&
1011                     key.type == BTRFS_EXTENT_CSUM_KEY)
1012                         path.slots[0]--;
1013         }
1014
1015         while (len > 0) {
1016                 leaf = path.nodes[0];
1017                 if (path.slots[0] >= btrfs_header_nritems(leaf)) {
1018                         ret = btrfs_next_leaf(root->fs_info->csum_root, &path);
1019                         BUG_ON(ret < 0);
1020                         if (ret > 0)
1021                                 break;
1022                         leaf = path.nodes[0];
1023                 }
1024
1025                 btrfs_item_key_to_cpu(leaf, &key, path.slots[0]);
1026                 if (key.objectid != BTRFS_EXTENT_CSUM_OBJECTID ||
1027                     key.type != BTRFS_EXTENT_CSUM_KEY)
1028                         break;
1029
1030                 btrfs_item_key_to_cpu(leaf, &key, path.slots[0]);
1031                 if (key.offset >= start + len)
1032                         break;
1033
1034                 if (key.offset > start)
1035                         start = key.offset;
1036
1037                 size = btrfs_item_size_nr(leaf, path.slots[0]);
1038                 csum_end = key.offset + (size / csum_size) * root->sectorsize;
1039                 if (csum_end > start) {
1040                         size = min(csum_end - start, len);
1041                         len -= size;
1042                         start += size;
1043                         found += size;
1044                 }
1045
1046                 path.slots[0]++;
1047         }
1048         btrfs_release_path(&path);
1049         return found;
1050 }
1051
1052 static int process_file_extent(struct btrfs_root *root,
1053                                 struct extent_buffer *eb,
1054                                 int slot, struct btrfs_key *key,
1055                                 struct shared_node *active_node)
1056 {
1057         struct inode_record *rec;
1058         struct btrfs_file_extent_item *fi;
1059         u64 num_bytes = 0;
1060         u64 disk_bytenr = 0;
1061         u64 extent_offset = 0;
1062         u64 mask = root->sectorsize - 1;
1063         int extent_type;
1064
1065         rec = active_node->current;
1066         BUG_ON(rec->ino != key->objectid || rec->refs > 1);
1067         rec->found_file_extent = 1;
1068
1069         if (rec->extent_start == (u64)-1) {
1070                 rec->extent_start = key->offset;
1071                 rec->extent_end = key->offset;
1072         }
1073
1074         if (rec->extent_end > key->offset)
1075                 rec->errors |= I_ERR_FILE_EXTENT_OVERLAP;
1076         else if (rec->extent_end < key->offset &&
1077                  rec->extent_end < rec->first_extent_gap)
1078                 rec->first_extent_gap = rec->extent_end;
1079
1080         fi = btrfs_item_ptr(eb, slot, struct btrfs_file_extent_item);
1081         extent_type = btrfs_file_extent_type(eb, fi);
1082
1083         if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
1084                 num_bytes = btrfs_file_extent_inline_len(eb, fi);
1085                 if (num_bytes == 0)
1086                         rec->errors |= I_ERR_BAD_FILE_EXTENT;
1087                 rec->found_size += num_bytes;
1088                 num_bytes = (num_bytes + mask) & ~mask;
1089         } else if (extent_type == BTRFS_FILE_EXTENT_REG ||
1090                    extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
1091                 num_bytes = btrfs_file_extent_num_bytes(eb, fi);
1092                 disk_bytenr = btrfs_file_extent_disk_bytenr(eb, fi);
1093                 extent_offset = btrfs_file_extent_offset(eb, fi);
1094                 if (num_bytes == 0 || (num_bytes & mask))
1095                         rec->errors |= I_ERR_BAD_FILE_EXTENT;
1096                 if (num_bytes + extent_offset >
1097                     btrfs_file_extent_ram_bytes(eb, fi))
1098                         rec->errors |= I_ERR_BAD_FILE_EXTENT;
1099                 if (extent_type == BTRFS_FILE_EXTENT_PREALLOC &&
1100                     (btrfs_file_extent_compression(eb, fi) ||
1101                      btrfs_file_extent_encryption(eb, fi) ||
1102                      btrfs_file_extent_other_encoding(eb, fi)))
1103                         rec->errors |= I_ERR_BAD_FILE_EXTENT;
1104                 if (disk_bytenr > 0)
1105                         rec->found_size += num_bytes;
1106         } else {
1107                 rec->errors |= I_ERR_BAD_FILE_EXTENT;
1108         }
1109         rec->extent_end = key->offset + num_bytes;
1110
1111         if (disk_bytenr > 0) {
1112                 u64 found;
1113                 if (btrfs_file_extent_compression(eb, fi))
1114                         num_bytes = btrfs_file_extent_disk_num_bytes(eb, fi);
1115                 else
1116                         disk_bytenr += extent_offset;
1117
1118                 found = count_csum_range(root, disk_bytenr, num_bytes);
1119                 if (extent_type == BTRFS_FILE_EXTENT_REG) {
1120                         if (found > 0)
1121                                 rec->found_csum_item = 1;
1122                         if (found < num_bytes)
1123                                 rec->some_csum_missing = 1;
1124                 } else if (extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
1125                         if (found > 0)
1126                                 rec->errors |= I_ERR_ODD_CSUM_ITEM;
1127                 }
1128         }
1129         return 0;
1130 }
1131
1132 static int process_one_leaf(struct btrfs_root *root, struct extent_buffer *eb,
1133                             struct walk_control *wc)
1134 {
1135         struct btrfs_key key;
1136         u32 nritems;
1137         int i;
1138         int ret = 0;
1139         struct cache_tree *inode_cache;
1140         struct shared_node *active_node;
1141
1142         if (wc->root_level == wc->active_node &&
1143             btrfs_root_refs(&root->root_item) == 0)
1144                 return 0;
1145
1146         active_node = wc->nodes[wc->active_node];
1147         inode_cache = &active_node->inode_cache;
1148         nritems = btrfs_header_nritems(eb);
1149         for (i = 0; i < nritems; i++) {
1150                 btrfs_item_key_to_cpu(eb, &key, i);
1151
1152                 if (key.objectid == BTRFS_FREE_SPACE_OBJECTID)
1153                         continue;
1154
1155                 if (active_node->current == NULL ||
1156                     active_node->current->ino < key.objectid) {
1157                         if (active_node->current) {
1158                                 active_node->current->checked = 1;
1159                                 maybe_free_inode_rec(inode_cache,
1160                                                      active_node->current);
1161                         }
1162                         active_node->current = get_inode_rec(inode_cache,
1163                                                              key.objectid, 1);
1164                 }
1165                 switch (key.type) {
1166                 case BTRFS_DIR_ITEM_KEY:
1167                 case BTRFS_DIR_INDEX_KEY:
1168                         ret = process_dir_item(root, eb, i, &key, active_node);
1169                         break;
1170                 case BTRFS_INODE_REF_KEY:
1171                         ret = process_inode_ref(eb, i, &key, active_node);
1172                         break;
1173                 case BTRFS_INODE_EXTREF_KEY:
1174                         ret = process_inode_extref(eb, i, &key, active_node);
1175                         break;
1176                 case BTRFS_INODE_ITEM_KEY:
1177                         ret = process_inode_item(eb, i, &key, active_node);
1178                         break;
1179                 case BTRFS_EXTENT_DATA_KEY:
1180                         ret = process_file_extent(root, eb, i, &key,
1181                                                   active_node);
1182                         break;
1183                 default:
1184                         break;
1185                 };
1186         }
1187         return ret;
1188 }
1189
1190 static void reada_walk_down(struct btrfs_root *root,
1191                             struct extent_buffer *node, int slot)
1192 {
1193         u64 bytenr;
1194         u64 ptr_gen;
1195         u32 nritems;
1196         u32 blocksize;
1197         int i;
1198         int ret;
1199         int level;
1200
1201         level = btrfs_header_level(node);
1202         if (level != 1)
1203                 return;
1204
1205         nritems = btrfs_header_nritems(node);
1206         blocksize = btrfs_level_size(root, level - 1);
1207         for (i = slot; i < nritems; i++) {
1208                 bytenr = btrfs_node_blockptr(node, i);
1209                 ptr_gen = btrfs_node_ptr_generation(node, i);
1210                 ret = readahead_tree_block(root, bytenr, blocksize, ptr_gen);
1211                 if (ret)
1212                         break;
1213         }
1214 }
1215
1216 static int walk_down_tree(struct btrfs_root *root, struct btrfs_path *path,
1217                           struct walk_control *wc, int *level)
1218 {
1219         u64 bytenr;
1220         u64 ptr_gen;
1221         struct extent_buffer *next;
1222         struct extent_buffer *cur;
1223         u32 blocksize;
1224         int ret, err = 0;
1225         u64 refs;
1226
1227         WARN_ON(*level < 0);
1228         WARN_ON(*level >= BTRFS_MAX_LEVEL);
1229         ret = btrfs_lookup_extent_info(NULL, root,
1230                                        path->nodes[*level]->start,
1231                                        *level, 1, &refs, NULL);
1232         if (ret < 0) {
1233                 err = ret;
1234                 goto out;
1235         }
1236
1237         if (refs > 1) {
1238                 ret = enter_shared_node(root, path->nodes[*level]->start,
1239                                         refs, wc, *level);
1240                 if (ret > 0) {
1241                         err = ret;
1242                         goto out;
1243                 }
1244         }
1245
1246         while (*level >= 0) {
1247                 WARN_ON(*level < 0);
1248                 WARN_ON(*level >= BTRFS_MAX_LEVEL);
1249                 cur = path->nodes[*level];
1250
1251                 if (btrfs_header_level(cur) != *level)
1252                         WARN_ON(1);
1253
1254                 if (path->slots[*level] >= btrfs_header_nritems(cur))
1255                         break;
1256                 if (*level == 0) {
1257                         ret = process_one_leaf(root, cur, wc);
1258                         break;
1259                 }
1260                 bytenr = btrfs_node_blockptr(cur, path->slots[*level]);
1261                 ptr_gen = btrfs_node_ptr_generation(cur, path->slots[*level]);
1262                 blocksize = btrfs_level_size(root, *level - 1);
1263                 ret = btrfs_lookup_extent_info(NULL, root, bytenr, *level - 1,
1264                                                1, &refs, NULL);
1265                 if (ret < 0)
1266                         refs = 0;
1267
1268                 if (refs > 1) {
1269                         ret = enter_shared_node(root, bytenr, refs,
1270                                                 wc, *level - 1);
1271                         if (ret > 0) {
1272                                 path->slots[*level]++;
1273                                 continue;
1274                         }
1275                 }
1276
1277                 next = btrfs_find_tree_block(root, bytenr, blocksize);
1278                 if (!next || !btrfs_buffer_uptodate(next, ptr_gen)) {
1279                         free_extent_buffer(next);
1280                         reada_walk_down(root, cur, path->slots[*level]);
1281                         next = read_tree_block(root, bytenr, blocksize,
1282                                                ptr_gen);
1283                         if (!next) {
1284                                 err = -EIO;
1285                                 goto out;
1286                         }
1287                 }
1288
1289                 *level = *level - 1;
1290                 free_extent_buffer(path->nodes[*level]);
1291                 path->nodes[*level] = next;
1292                 path->slots[*level] = 0;
1293         }
1294 out:
1295         path->slots[*level] = btrfs_header_nritems(path->nodes[*level]);
1296         return err;
1297 }
1298
1299 static int walk_up_tree(struct btrfs_root *root, struct btrfs_path *path,
1300                         struct walk_control *wc, int *level)
1301 {
1302         int i;
1303         struct extent_buffer *leaf;
1304
1305         for (i = *level; i < BTRFS_MAX_LEVEL - 1 && path->nodes[i]; i++) {
1306                 leaf = path->nodes[i];
1307                 if (path->slots[i] + 1 < btrfs_header_nritems(leaf)) {
1308                         path->slots[i]++;
1309                         *level = i;
1310                         return 0;
1311                 } else {
1312                         free_extent_buffer(path->nodes[*level]);
1313                         path->nodes[*level] = NULL;
1314                         BUG_ON(*level > wc->active_node);
1315                         if (*level == wc->active_node)
1316                                 leave_shared_node(root, wc, *level);
1317                         *level = i + 1;
1318                 }
1319         }
1320         return 1;
1321 }
1322
1323 static int check_root_dir(struct inode_record *rec)
1324 {
1325         struct inode_backref *backref;
1326         int ret = -1;
1327
1328         if (!rec->found_inode_item || rec->errors)
1329                 goto out;
1330         if (rec->nlink != 1 || rec->found_link != 0)
1331                 goto out;
1332         if (list_empty(&rec->backrefs))
1333                 goto out;
1334         backref = list_entry(rec->backrefs.next, struct inode_backref, list);
1335         if (!backref->found_inode_ref)
1336                 goto out;
1337         if (backref->index != 0 || backref->namelen != 2 ||
1338             memcmp(backref->name, "..", 2))
1339                 goto out;
1340         if (backref->found_dir_index || backref->found_dir_item)
1341                 goto out;
1342         ret = 0;
1343 out:
1344         return ret;
1345 }
1346
1347 static int check_inode_recs(struct btrfs_root *root,
1348                             struct cache_tree *inode_cache)
1349 {
1350         struct cache_extent *cache;
1351         struct ptr_node *node;
1352         struct inode_record *rec;
1353         struct inode_backref *backref;
1354         int ret;
1355         u64 error = 0;
1356         u64 root_dirid = btrfs_root_dirid(&root->root_item);
1357
1358         if (btrfs_root_refs(&root->root_item) == 0) {
1359                 if (!cache_tree_empty(inode_cache))
1360                         fprintf(stderr, "warning line %d\n", __LINE__);
1361                 return 0;
1362         }
1363
1364         rec = get_inode_rec(inode_cache, root_dirid, 0);
1365         if (rec) {
1366                 ret = check_root_dir(rec);
1367                 if (ret) {
1368                         fprintf(stderr, "root %llu root dir %llu error\n",
1369                                 (unsigned long long)root->root_key.objectid,
1370                                 (unsigned long long)root_dirid);
1371                         error++;
1372                 }
1373         } else {
1374                 fprintf(stderr, "root %llu root dir %llu not found\n",
1375                         (unsigned long long)root->root_key.objectid,
1376                         (unsigned long long)root_dirid);
1377         }
1378
1379         while (1) {
1380                 cache = search_cache_extent(inode_cache, 0);
1381                 if (!cache)
1382                         break;
1383                 node = container_of(cache, struct ptr_node, cache);
1384                 rec = node->data;
1385                 remove_cache_extent(inode_cache, &node->cache);
1386                 free(node);
1387                 if (rec->ino == root_dirid ||
1388                     rec->ino == BTRFS_ORPHAN_OBJECTID) {
1389                         free_inode_rec(rec);
1390                         continue;
1391                 }
1392
1393                 if (rec->errors & I_ERR_NO_ORPHAN_ITEM) {
1394                         ret = check_orphan_item(root, rec->ino);
1395                         if (ret == 0)
1396                                 rec->errors &= ~I_ERR_NO_ORPHAN_ITEM;
1397                         if (can_free_inode_rec(rec)) {
1398                                 free_inode_rec(rec);
1399                                 continue;
1400                         }
1401                 }
1402
1403                 error++;
1404                 if (!rec->found_inode_item)
1405                         rec->errors |= I_ERR_NO_INODE_ITEM;
1406                 if (rec->found_link != rec->nlink)
1407                         rec->errors |= I_ERR_LINK_COUNT_WRONG;
1408                 fprintf(stderr, "root %llu inode %llu errors %x\n",
1409                         (unsigned long long) root->root_key.objectid,
1410                         (unsigned long long) rec->ino, rec->errors);
1411                 list_for_each_entry(backref, &rec->backrefs, list) {
1412                         if (!backref->found_dir_item)
1413                                 backref->errors |= REF_ERR_NO_DIR_ITEM;
1414                         if (!backref->found_dir_index)
1415                                 backref->errors |= REF_ERR_NO_DIR_INDEX;
1416                         if (!backref->found_inode_ref)
1417                                 backref->errors |= REF_ERR_NO_INODE_REF;
1418                         fprintf(stderr, "\tunresolved ref dir %llu index %llu"
1419                                 " namelen %u name %s filetype %d error %x\n",
1420                                 (unsigned long long)backref->dir,
1421                                 (unsigned long long)backref->index,
1422                                 backref->namelen, backref->name,
1423                                 backref->filetype, backref->errors);
1424                 }
1425                 free_inode_rec(rec);
1426         }
1427         return (error > 0) ? -1 : 0;
1428 }
1429
1430 static struct root_record *get_root_rec(struct cache_tree *root_cache,
1431                                         u64 objectid)
1432 {
1433         struct cache_extent *cache;
1434         struct root_record *rec = NULL;
1435         int ret;
1436
1437         cache = lookup_cache_extent(root_cache, objectid, 1);
1438         if (cache) {
1439                 rec = container_of(cache, struct root_record, cache);
1440         } else {
1441                 rec = calloc(1, sizeof(*rec));
1442                 rec->objectid = objectid;
1443                 INIT_LIST_HEAD(&rec->backrefs);
1444                 rec->cache.start = objectid;
1445                 rec->cache.size = 1;
1446
1447                 ret = insert_cache_extent(root_cache, &rec->cache);
1448                 BUG_ON(ret);
1449         }
1450         return rec;
1451 }
1452
1453 static struct root_backref *get_root_backref(struct root_record *rec,
1454                                              u64 ref_root, u64 dir, u64 index,
1455                                              const char *name, int namelen)
1456 {
1457         struct root_backref *backref;
1458
1459         list_for_each_entry(backref, &rec->backrefs, list) {
1460                 if (backref->ref_root != ref_root || backref->dir != dir ||
1461                     backref->namelen != namelen)
1462                         continue;
1463                 if (memcmp(name, backref->name, namelen))
1464                         continue;
1465                 return backref;
1466         }
1467
1468         backref = malloc(sizeof(*backref) + namelen + 1);
1469         memset(backref, 0, sizeof(*backref));
1470         backref->ref_root = ref_root;
1471         backref->dir = dir;
1472         backref->index = index;
1473         backref->namelen = namelen;
1474         memcpy(backref->name, name, namelen);
1475         backref->name[namelen] = '\0';
1476         list_add_tail(&backref->list, &rec->backrefs);
1477         return backref;
1478 }
1479
1480 static void free_root_record(struct cache_extent *cache)
1481 {
1482         struct root_record *rec;
1483         struct root_backref *backref;
1484
1485         rec = container_of(cache, struct root_record, cache);
1486         while (!list_empty(&rec->backrefs)) {
1487                 backref = list_entry(rec->backrefs.next,
1488                                      struct root_backref, list);
1489                 list_del(&backref->list);
1490                 free(backref);
1491         }
1492
1493         kfree(rec);
1494 }
1495
1496 FREE_EXTENT_CACHE_BASED_TREE(root_recs, free_root_record);
1497
1498 static int add_root_backref(struct cache_tree *root_cache,
1499                             u64 root_id, u64 ref_root, u64 dir, u64 index,
1500                             const char *name, int namelen,
1501                             int item_type, int errors)
1502 {
1503         struct root_record *rec;
1504         struct root_backref *backref;
1505
1506         rec = get_root_rec(root_cache, root_id);
1507         backref = get_root_backref(rec, ref_root, dir, index, name, namelen);
1508
1509         backref->errors |= errors;
1510
1511         if (item_type != BTRFS_DIR_ITEM_KEY) {
1512                 if (backref->found_dir_index || backref->found_back_ref ||
1513                     backref->found_forward_ref) {
1514                         if (backref->index != index)
1515                                 backref->errors |= REF_ERR_INDEX_UNMATCH;
1516                 } else {
1517                         backref->index = index;
1518                 }
1519         }
1520
1521         if (item_type == BTRFS_DIR_ITEM_KEY) {
1522                 if (backref->found_forward_ref)
1523                         rec->found_ref++;
1524                 backref->found_dir_item = 1;
1525         } else if (item_type == BTRFS_DIR_INDEX_KEY) {
1526                 backref->found_dir_index = 1;
1527         } else if (item_type == BTRFS_ROOT_REF_KEY) {
1528                 if (backref->found_forward_ref)
1529                         backref->errors |= REF_ERR_DUP_ROOT_REF;
1530                 else if (backref->found_dir_item)
1531                         rec->found_ref++;
1532                 backref->found_forward_ref = 1;
1533         } else if (item_type == BTRFS_ROOT_BACKREF_KEY) {
1534                 if (backref->found_back_ref)
1535                         backref->errors |= REF_ERR_DUP_ROOT_BACKREF;
1536                 backref->found_back_ref = 1;
1537         } else {
1538                 BUG_ON(1);
1539         }
1540
1541         if (backref->found_forward_ref && backref->found_dir_item)
1542                 backref->reachable = 1;
1543         return 0;
1544 }
1545
1546 static int merge_root_recs(struct btrfs_root *root,
1547                            struct cache_tree *src_cache,
1548                            struct cache_tree *dst_cache)
1549 {
1550         struct cache_extent *cache;
1551         struct ptr_node *node;
1552         struct inode_record *rec;
1553         struct inode_backref *backref;
1554
1555         if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) {
1556                 free_inode_recs_tree(src_cache);
1557                 return 0;
1558         }
1559
1560         while (1) {
1561                 cache = search_cache_extent(src_cache, 0);
1562                 if (!cache)
1563                         break;
1564                 node = container_of(cache, struct ptr_node, cache);
1565                 rec = node->data;
1566                 remove_cache_extent(src_cache, &node->cache);
1567                 free(node);
1568
1569                 if (!is_child_root(root, root->objectid, rec->ino))
1570                         goto skip;
1571
1572                 list_for_each_entry(backref, &rec->backrefs, list) {
1573                         BUG_ON(backref->found_inode_ref);
1574                         if (backref->found_dir_item)
1575                                 add_root_backref(dst_cache, rec->ino,
1576                                         root->root_key.objectid, backref->dir,
1577                                         backref->index, backref->name,
1578                                         backref->namelen, BTRFS_DIR_ITEM_KEY,
1579                                         backref->errors);
1580                         if (backref->found_dir_index)
1581                                 add_root_backref(dst_cache, rec->ino,
1582                                         root->root_key.objectid, backref->dir,
1583                                         backref->index, backref->name,
1584                                         backref->namelen, BTRFS_DIR_INDEX_KEY,
1585                                         backref->errors);
1586                 }
1587 skip:
1588                 free_inode_rec(rec);
1589         }
1590         return 0;
1591 }
1592
1593 static int check_root_refs(struct btrfs_root *root,
1594                            struct cache_tree *root_cache)
1595 {
1596         struct root_record *rec;
1597         struct root_record *ref_root;
1598         struct root_backref *backref;
1599         struct cache_extent *cache;
1600         int loop = 1;
1601         int ret;
1602         int error;
1603         int errors = 0;
1604
1605         rec = get_root_rec(root_cache, BTRFS_FS_TREE_OBJECTID);
1606         rec->found_ref = 1;
1607
1608         /* fixme: this can not detect circular references */
1609         while (loop) {
1610                 loop = 0;
1611                 cache = search_cache_extent(root_cache, 0);
1612                 while (1) {
1613                         if (!cache)
1614                                 break;
1615                         rec = container_of(cache, struct root_record, cache);
1616                         cache = next_cache_extent(cache);
1617
1618                         if (rec->found_ref == 0)
1619                                 continue;
1620
1621                         list_for_each_entry(backref, &rec->backrefs, list) {
1622                                 if (!backref->reachable)
1623                                         continue;
1624
1625                                 ref_root = get_root_rec(root_cache,
1626                                                         backref->ref_root);
1627                                 if (ref_root->found_ref > 0)
1628                                         continue;
1629
1630                                 backref->reachable = 0;
1631                                 rec->found_ref--;
1632                                 if (rec->found_ref == 0)
1633                                         loop = 1;
1634                         }
1635                 }
1636         }
1637
1638         cache = search_cache_extent(root_cache, 0);
1639         while (1) {
1640                 if (!cache)
1641                         break;
1642                 rec = container_of(cache, struct root_record, cache);
1643                 cache = next_cache_extent(cache);
1644
1645                 if (rec->found_ref == 0 &&
1646                     rec->objectid >= BTRFS_FIRST_FREE_OBJECTID &&
1647                     rec->objectid <= BTRFS_LAST_FREE_OBJECTID) {
1648                         ret = check_orphan_item(root->fs_info->tree_root,
1649                                                 rec->objectid);
1650                         if (ret == 0)
1651                                 continue;
1652
1653                         /*
1654                          * If we don't have a root item then we likely just have
1655                          * a dir item in a snapshot for this root but no actual
1656                          * ref key or anything so it's meaningless.
1657                          */
1658                         if (!rec->found_root_item)
1659                                 continue;
1660                         errors++;
1661                         fprintf(stderr, "fs tree %llu not referenced\n",
1662                                 (unsigned long long)rec->objectid);
1663                 }
1664
1665                 error = 0;
1666                 if (rec->found_ref > 0 && !rec->found_root_item)
1667                         error = 1;
1668                 list_for_each_entry(backref, &rec->backrefs, list) {
1669                         if (!backref->found_dir_item)
1670                                 backref->errors |= REF_ERR_NO_DIR_ITEM;
1671                         if (!backref->found_dir_index)
1672                                 backref->errors |= REF_ERR_NO_DIR_INDEX;
1673                         if (!backref->found_back_ref)
1674                                 backref->errors |= REF_ERR_NO_ROOT_BACKREF;
1675                         if (!backref->found_forward_ref)
1676                                 backref->errors |= REF_ERR_NO_ROOT_REF;
1677                         if (backref->reachable && backref->errors)
1678                                 error = 1;
1679                 }
1680                 if (!error)
1681                         continue;
1682
1683                 errors++;
1684                 fprintf(stderr, "fs tree %llu refs %u %s\n",
1685                         (unsigned long long)rec->objectid, rec->found_ref,
1686                          rec->found_root_item ? "" : "not found");
1687
1688                 list_for_each_entry(backref, &rec->backrefs, list) {
1689                         if (!backref->reachable)
1690                                 continue;
1691                         if (!backref->errors && rec->found_root_item)
1692                                 continue;
1693                         fprintf(stderr, "\tunresolved ref root %llu dir %llu"
1694                                 " index %llu namelen %u name %s error %x\n",
1695                                 (unsigned long long)backref->ref_root,
1696                                 (unsigned long long)backref->dir,
1697                                 (unsigned long long)backref->index,
1698                                 backref->namelen, backref->name,
1699                                 backref->errors);
1700                 }
1701         }
1702         return errors > 0 ? 1 : 0;
1703 }
1704
1705 static int process_root_ref(struct extent_buffer *eb, int slot,
1706                             struct btrfs_key *key,
1707                             struct cache_tree *root_cache)
1708 {
1709         u64 dirid;
1710         u64 index;
1711         u32 len;
1712         u32 name_len;
1713         struct btrfs_root_ref *ref;
1714         char namebuf[BTRFS_NAME_LEN];
1715         int error;
1716
1717         ref = btrfs_item_ptr(eb, slot, struct btrfs_root_ref);
1718
1719         dirid = btrfs_root_ref_dirid(eb, ref);
1720         index = btrfs_root_ref_sequence(eb, ref);
1721         name_len = btrfs_root_ref_name_len(eb, ref);
1722
1723         if (name_len <= BTRFS_NAME_LEN) {
1724                 len = name_len;
1725                 error = 0;
1726         } else {
1727                 len = BTRFS_NAME_LEN;
1728                 error = REF_ERR_NAME_TOO_LONG;
1729         }
1730         read_extent_buffer(eb, namebuf, (unsigned long)(ref + 1), len);
1731
1732         if (key->type == BTRFS_ROOT_REF_KEY) {
1733                 add_root_backref(root_cache, key->offset, key->objectid, dirid,
1734                                  index, namebuf, len, key->type, error);
1735         } else {
1736                 add_root_backref(root_cache, key->objectid, key->offset, dirid,
1737                                  index, namebuf, len, key->type, error);
1738         }
1739         return 0;
1740 }
1741
1742 static int check_fs_root(struct btrfs_root *root,
1743                          struct cache_tree *root_cache,
1744                          struct walk_control *wc)
1745 {
1746         int ret = 0;
1747         int wret;
1748         int level;
1749         struct btrfs_path path;
1750         struct shared_node root_node;
1751         struct root_record *rec;
1752         struct btrfs_root_item *root_item = &root->root_item;
1753
1754         if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) {
1755                 rec = get_root_rec(root_cache, root->root_key.objectid);
1756                 if (btrfs_root_refs(root_item) > 0)
1757                         rec->found_root_item = 1;
1758         }
1759
1760         btrfs_init_path(&path);
1761         memset(&root_node, 0, sizeof(root_node));
1762         cache_tree_init(&root_node.root_cache);
1763         cache_tree_init(&root_node.inode_cache);
1764
1765         level = btrfs_header_level(root->node);
1766         memset(wc->nodes, 0, sizeof(wc->nodes));
1767         wc->nodes[level] = &root_node;
1768         wc->active_node = level;
1769         wc->root_level = level;
1770
1771         if (btrfs_root_refs(root_item) > 0 ||
1772             btrfs_disk_key_objectid(&root_item->drop_progress) == 0) {
1773                 path.nodes[level] = root->node;
1774                 extent_buffer_get(root->node);
1775                 path.slots[level] = 0;
1776         } else {
1777                 struct btrfs_key key;
1778                 struct btrfs_disk_key found_key;
1779
1780                 btrfs_disk_key_to_cpu(&key, &root_item->drop_progress);
1781                 level = root_item->drop_level;
1782                 path.lowest_level = level;
1783                 wret = btrfs_search_slot(NULL, root, &key, &path, 0, 0);
1784                 BUG_ON(wret < 0);
1785                 btrfs_node_key(path.nodes[level], &found_key,
1786                                 path.slots[level]);
1787                 WARN_ON(memcmp(&found_key, &root_item->drop_progress,
1788                                         sizeof(found_key)));
1789         }
1790
1791         while (1) {
1792                 wret = walk_down_tree(root, &path, wc, &level);
1793                 if (wret < 0)
1794                         ret = wret;
1795                 if (wret != 0)
1796                         break;
1797
1798                 wret = walk_up_tree(root, &path, wc, &level);
1799                 if (wret < 0)
1800                         ret = wret;
1801                 if (wret != 0)
1802                         break;
1803         }
1804         btrfs_release_path(&path);
1805
1806         merge_root_recs(root, &root_node.root_cache, root_cache);
1807
1808         if (root_node.current) {
1809                 root_node.current->checked = 1;
1810                 maybe_free_inode_rec(&root_node.inode_cache,
1811                                 root_node.current);
1812         }
1813
1814         ret = check_inode_recs(root, &root_node.inode_cache);
1815         return ret;
1816 }
1817
1818 static int fs_root_objectid(u64 objectid)
1819 {
1820         if (objectid == BTRFS_FS_TREE_OBJECTID ||
1821             objectid == BTRFS_TREE_RELOC_OBJECTID ||
1822             objectid == BTRFS_DATA_RELOC_TREE_OBJECTID ||
1823             (objectid >= BTRFS_FIRST_FREE_OBJECTID &&
1824              objectid <= BTRFS_LAST_FREE_OBJECTID))
1825                 return 1;
1826         return 0;
1827 }
1828
1829 static int check_fs_roots(struct btrfs_root *root,
1830                           struct cache_tree *root_cache)
1831 {
1832         struct btrfs_path path;
1833         struct btrfs_key key;
1834         struct walk_control wc;
1835         struct extent_buffer *leaf;
1836         struct btrfs_root *tmp_root;
1837         struct btrfs_root *tree_root = root->fs_info->tree_root;
1838         int ret;
1839         int err = 0;
1840
1841         memset(&wc, 0, sizeof(wc));
1842         cache_tree_init(&wc.shared);
1843         btrfs_init_path(&path);
1844
1845         key.offset = 0;
1846         key.objectid = 0;
1847         key.type = BTRFS_ROOT_ITEM_KEY;
1848         ret = btrfs_search_slot(NULL, tree_root, &key, &path, 0, 0);
1849         BUG_ON(ret < 0);
1850         while (1) {
1851                 leaf = path.nodes[0];
1852                 if (path.slots[0] >= btrfs_header_nritems(leaf)) {
1853                         ret = btrfs_next_leaf(tree_root, &path);
1854                         if (ret != 0)
1855                                 break;
1856                         leaf = path.nodes[0];
1857                 }
1858                 btrfs_item_key_to_cpu(leaf, &key, path.slots[0]);
1859                 if (key.type == BTRFS_ROOT_ITEM_KEY &&
1860                     fs_root_objectid(key.objectid)) {
1861                         tmp_root = btrfs_read_fs_root_no_cache(root->fs_info,
1862                                                                &key);
1863                         if (IS_ERR(tmp_root)) {
1864                                 err = 1;
1865                                 goto next;
1866                         }
1867                         ret = check_fs_root(tmp_root, root_cache, &wc);
1868                         if (ret)
1869                                 err = 1;
1870                         btrfs_free_fs_root(tmp_root);
1871                 } else if (key.type == BTRFS_ROOT_REF_KEY ||
1872                            key.type == BTRFS_ROOT_BACKREF_KEY) {
1873                         process_root_ref(leaf, path.slots[0], &key,
1874                                          root_cache);
1875                 }
1876 next:
1877                 path.slots[0]++;
1878         }
1879         btrfs_release_path(&path);
1880
1881         if (!cache_tree_empty(&wc.shared))
1882                 fprintf(stderr, "warning line %d\n", __LINE__);
1883
1884         return err;
1885 }
1886
1887 static int all_backpointers_checked(struct extent_record *rec, int print_errs)
1888 {
1889         struct list_head *cur = rec->backrefs.next;
1890         struct extent_backref *back;
1891         struct tree_backref *tback;
1892         struct data_backref *dback;
1893         u64 found = 0;
1894         int err = 0;
1895
1896         while(cur != &rec->backrefs) {
1897                 back = list_entry(cur, struct extent_backref, list);
1898                 cur = cur->next;
1899                 if (!back->found_extent_tree) {
1900                         err = 1;
1901                         if (!print_errs)
1902                                 goto out;
1903                         if (back->is_data) {
1904                                 dback = (struct data_backref *)back;
1905                                 fprintf(stderr, "Backref %llu %s %llu"
1906                                         " owner %llu offset %llu num_refs %lu"
1907                                         " not found in extent tree\n",
1908                                         (unsigned long long)rec->start,
1909                                         back->full_backref ?
1910                                         "parent" : "root",
1911                                         back->full_backref ?
1912                                         (unsigned long long)dback->parent:
1913                                         (unsigned long long)dback->root,
1914                                         (unsigned long long)dback->owner,
1915                                         (unsigned long long)dback->offset,
1916                                         (unsigned long)dback->num_refs);
1917                         } else {
1918                                 tback = (struct tree_backref *)back;
1919                                 fprintf(stderr, "Backref %llu parent %llu"
1920                                         " root %llu not found in extent tree\n",
1921                                         (unsigned long long)rec->start,
1922                                         (unsigned long long)tback->parent,
1923                                         (unsigned long long)tback->root);
1924                         }
1925                 }
1926                 if (!back->is_data && !back->found_ref) {
1927                         err = 1;
1928                         if (!print_errs)
1929                                 goto out;
1930                         tback = (struct tree_backref *)back;
1931                         fprintf(stderr, "Backref %llu %s %llu not referenced back %p\n",
1932                                 (unsigned long long)rec->start,
1933                                 back->full_backref ? "parent" : "root",
1934                                 back->full_backref ?
1935                                 (unsigned long long)tback->parent :
1936                                 (unsigned long long)tback->root, back);
1937                 }
1938                 if (back->is_data) {
1939                         dback = (struct data_backref *)back;
1940                         if (dback->found_ref != dback->num_refs) {
1941                                 err = 1;
1942                                 if (!print_errs)
1943                                         goto out;
1944                                 fprintf(stderr, "Incorrect local backref count"
1945                                         " on %llu %s %llu owner %llu"
1946                                         " offset %llu found %u wanted %u back %p\n",
1947                                         (unsigned long long)rec->start,
1948                                         back->full_backref ?
1949                                         "parent" : "root",
1950                                         back->full_backref ?
1951                                         (unsigned long long)dback->parent:
1952                                         (unsigned long long)dback->root,
1953                                         (unsigned long long)dback->owner,
1954                                         (unsigned long long)dback->offset,
1955                                         dback->found_ref, dback->num_refs, back);
1956                         }
1957                         if (dback->disk_bytenr != rec->start) {
1958                                 err = 1;
1959                                 if (!print_errs)
1960                                         goto out;
1961                                 fprintf(stderr, "Backref disk bytenr does not"
1962                                         " match extent record, bytenr=%llu, "
1963                                         "ref bytenr=%llu\n",
1964                                         (unsigned long long)rec->start,
1965                                         (unsigned long long)dback->disk_bytenr);
1966                         }
1967
1968                         if (dback->bytes != rec->nr) {
1969                                 err = 1;
1970                                 if (!print_errs)
1971                                         goto out;
1972                                 fprintf(stderr, "Backref bytes do not match "
1973                                         "extent backref, bytenr=%llu, ref "
1974                                         "bytes=%llu, backref bytes=%llu\n",
1975                                         (unsigned long long)rec->start,
1976                                         (unsigned long long)rec->nr,
1977                                         (unsigned long long)dback->bytes);
1978                         }
1979                 }
1980                 if (!back->is_data) {
1981                         found += 1;
1982                 } else {
1983                         dback = (struct data_backref *)back;
1984                         found += dback->found_ref;
1985                 }
1986         }
1987         if (found != rec->refs) {
1988                 err = 1;
1989                 if (!print_errs)
1990                         goto out;
1991                 fprintf(stderr, "Incorrect global backref count "
1992                         "on %llu found %llu wanted %llu\n",
1993                         (unsigned long long)rec->start,
1994                         (unsigned long long)found,
1995                         (unsigned long long)rec->refs);
1996         }
1997 out:
1998         return err;
1999 }
2000
2001 static int free_all_extent_backrefs(struct extent_record *rec)
2002 {
2003         struct extent_backref *back;
2004         struct list_head *cur;
2005         while (!list_empty(&rec->backrefs)) {
2006                 cur = rec->backrefs.next;
2007                 back = list_entry(cur, struct extent_backref, list);
2008                 list_del(cur);
2009                 free(back);
2010         }
2011         return 0;
2012 }
2013
2014 static void free_extent_record_cache(struct btrfs_fs_info *fs_info,
2015                                      struct cache_tree *extent_cache)
2016 {
2017         struct cache_extent *cache;
2018         struct extent_record *rec;
2019
2020         while (1) {
2021                 cache = first_cache_extent(extent_cache);
2022                 if (!cache)
2023                         break;
2024                 rec = container_of(cache, struct extent_record, cache);
2025                 btrfs_unpin_extent(fs_info, rec->start, rec->max_size);
2026                 remove_cache_extent(extent_cache, cache);
2027                 free_all_extent_backrefs(rec);
2028                 free(rec);
2029         }
2030 }
2031
2032 static int maybe_free_extent_rec(struct cache_tree *extent_cache,
2033                                  struct extent_record *rec)
2034 {
2035         if (rec->content_checked && rec->owner_ref_checked &&
2036             rec->extent_item_refs == rec->refs && rec->refs > 0 &&
2037             rec->num_duplicates == 0 && !all_backpointers_checked(rec, 0)) {
2038                 remove_cache_extent(extent_cache, &rec->cache);
2039                 free_all_extent_backrefs(rec);
2040                 list_del_init(&rec->list);
2041                 free(rec);
2042         }
2043         return 0;
2044 }
2045
2046 static int check_owner_ref(struct btrfs_root *root,
2047                             struct extent_record *rec,
2048                             struct extent_buffer *buf)
2049 {
2050         struct extent_backref *node;
2051         struct tree_backref *back;
2052         struct btrfs_root *ref_root;
2053         struct btrfs_key key;
2054         struct btrfs_path path;
2055         struct extent_buffer *parent;
2056         int level;
2057         int found = 0;
2058         int ret;
2059
2060         list_for_each_entry(node, &rec->backrefs, list) {
2061                 if (node->is_data)
2062                         continue;
2063                 if (!node->found_ref)
2064                         continue;
2065                 if (node->full_backref)
2066                         continue;
2067                 back = (struct tree_backref *)node;
2068                 if (btrfs_header_owner(buf) == back->root)
2069                         return 0;
2070         }
2071         BUG_ON(rec->is_root);
2072
2073         /* try to find the block by search corresponding fs tree */
2074         key.objectid = btrfs_header_owner(buf);
2075         key.type = BTRFS_ROOT_ITEM_KEY;
2076         key.offset = (u64)-1;
2077
2078         ref_root = btrfs_read_fs_root(root->fs_info, &key);
2079         if (IS_ERR(ref_root))
2080                 return 1;
2081
2082         level = btrfs_header_level(buf);
2083         if (level == 0)
2084                 btrfs_item_key_to_cpu(buf, &key, 0);
2085         else
2086                 btrfs_node_key_to_cpu(buf, &key, 0);
2087
2088         btrfs_init_path(&path);
2089         path.lowest_level = level + 1;
2090         ret = btrfs_search_slot(NULL, ref_root, &key, &path, 0, 0);
2091         if (ret < 0)
2092                 return 0;
2093
2094         parent = path.nodes[level + 1];
2095         if (parent && buf->start == btrfs_node_blockptr(parent,
2096                                                         path.slots[level + 1]))
2097                 found = 1;
2098
2099         btrfs_release_path(&path);
2100         return found ? 0 : 1;
2101 }
2102
2103 static int is_extent_tree_record(struct extent_record *rec)
2104 {
2105         struct list_head *cur = rec->backrefs.next;
2106         struct extent_backref *node;
2107         struct tree_backref *back;
2108         int is_extent = 0;
2109
2110         while(cur != &rec->backrefs) {
2111                 node = list_entry(cur, struct extent_backref, list);
2112                 cur = cur->next;
2113                 if (node->is_data)
2114                         return 0;
2115                 back = (struct tree_backref *)node;
2116                 if (node->full_backref)
2117                         return 0;
2118                 if (back->root == BTRFS_EXTENT_TREE_OBJECTID)
2119                         is_extent = 1;
2120         }
2121         return is_extent;
2122 }
2123
2124
2125 static int record_bad_block_io(struct btrfs_fs_info *info,
2126                                struct cache_tree *extent_cache,
2127                                u64 start, u64 len)
2128 {
2129         struct extent_record *rec;
2130         struct cache_extent *cache;
2131         struct btrfs_key key;
2132
2133         cache = lookup_cache_extent(extent_cache, start, len);
2134         if (!cache)
2135                 return 0;
2136
2137         rec = container_of(cache, struct extent_record, cache);
2138         if (!is_extent_tree_record(rec))
2139                 return 0;
2140
2141         btrfs_disk_key_to_cpu(&key, &rec->parent_key);
2142         return btrfs_add_corrupt_extent_record(info, &key, start, len, 0);
2143 }
2144
2145 static int check_block(struct btrfs_root *root,
2146                        struct cache_tree *extent_cache,
2147                        struct extent_buffer *buf, u64 flags)
2148 {
2149         struct extent_record *rec;
2150         struct cache_extent *cache;
2151         struct btrfs_key key;
2152         int ret = 1;
2153         int level;
2154
2155         cache = lookup_cache_extent(extent_cache, buf->start, buf->len);
2156         if (!cache)
2157                 return 1;
2158         rec = container_of(cache, struct extent_record, cache);
2159         rec->generation = btrfs_header_generation(buf);
2160
2161         level = btrfs_header_level(buf);
2162         if (btrfs_header_nritems(buf) > 0) {
2163
2164                 if (level == 0)
2165                         btrfs_item_key_to_cpu(buf, &key, 0);
2166                 else
2167                         btrfs_node_key_to_cpu(buf, &key, 0);
2168
2169                 rec->info_objectid = key.objectid;
2170         }
2171         rec->info_level = level;
2172
2173         if (btrfs_is_leaf(buf))
2174                 ret = btrfs_check_leaf(root, &rec->parent_key, buf);
2175         else
2176                 ret = btrfs_check_node(root, &rec->parent_key, buf);
2177
2178         if (ret) {
2179                 fprintf(stderr, "bad block %llu\n",
2180                         (unsigned long long)buf->start);
2181         } else {
2182                 rec->content_checked = 1;
2183                 if (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)
2184                         rec->owner_ref_checked = 1;
2185                 else {
2186                         ret = check_owner_ref(root, rec, buf);
2187                         if (!ret)
2188                                 rec->owner_ref_checked = 1;
2189                 }
2190         }
2191         if (!ret)
2192                 maybe_free_extent_rec(extent_cache, rec);
2193         return ret;
2194 }
2195
2196 static struct tree_backref *find_tree_backref(struct extent_record *rec,
2197                                                 u64 parent, u64 root)
2198 {
2199         struct list_head *cur = rec->backrefs.next;
2200         struct extent_backref *node;
2201         struct tree_backref *back;
2202
2203         while(cur != &rec->backrefs) {
2204                 node = list_entry(cur, struct extent_backref, list);
2205                 cur = cur->next;
2206                 if (node->is_data)
2207                         continue;
2208                 back = (struct tree_backref *)node;
2209                 if (parent > 0) {
2210                         if (!node->full_backref)
2211                                 continue;
2212                         if (parent == back->parent)
2213                                 return back;
2214                 } else {
2215                         if (node->full_backref)
2216                                 continue;
2217                         if (back->root == root)
2218                                 return back;
2219                 }
2220         }
2221         return NULL;
2222 }
2223
2224 static struct tree_backref *alloc_tree_backref(struct extent_record *rec,
2225                                                 u64 parent, u64 root)
2226 {
2227         struct tree_backref *ref = malloc(sizeof(*ref));
2228         memset(&ref->node, 0, sizeof(ref->node));
2229         if (parent > 0) {
2230                 ref->parent = parent;
2231                 ref->node.full_backref = 1;
2232         } else {
2233                 ref->root = root;
2234                 ref->node.full_backref = 0;
2235         }
2236         list_add_tail(&ref->node.list, &rec->backrefs);
2237
2238         return ref;
2239 }
2240
2241 static struct data_backref *find_data_backref(struct extent_record *rec,
2242                                                 u64 parent, u64 root,
2243                                                 u64 owner, u64 offset,
2244                                                 int found_ref,
2245                                                 u64 disk_bytenr, u64 bytes)
2246 {
2247         struct list_head *cur = rec->backrefs.next;
2248         struct extent_backref *node;
2249         struct data_backref *back;
2250
2251         while(cur != &rec->backrefs) {
2252                 node = list_entry(cur, struct extent_backref, list);
2253                 cur = cur->next;
2254                 if (!node->is_data)
2255                         continue;
2256                 back = (struct data_backref *)node;
2257                 if (parent > 0) {
2258                         if (!node->full_backref)
2259                                 continue;
2260                         if (parent == back->parent)
2261                                 return back;
2262                 } else {
2263                         if (node->full_backref)
2264                                 continue;
2265                         if (back->root == root && back->owner == owner &&
2266                             back->offset == offset) {
2267                                 if (found_ref && node->found_ref &&
2268                                     (back->bytes != bytes ||
2269                                     back->disk_bytenr != disk_bytenr))
2270                                         continue;
2271                                 return back;
2272                         }
2273                 }
2274         }
2275         return NULL;
2276 }
2277
2278 static struct data_backref *alloc_data_backref(struct extent_record *rec,
2279                                                 u64 parent, u64 root,
2280                                                 u64 owner, u64 offset,
2281                                                 u64 max_size)
2282 {
2283         struct data_backref *ref = malloc(sizeof(*ref));
2284         memset(&ref->node, 0, sizeof(ref->node));
2285         ref->node.is_data = 1;
2286
2287         if (parent > 0) {
2288                 ref->parent = parent;
2289                 ref->owner = 0;
2290                 ref->offset = 0;
2291                 ref->node.full_backref = 1;
2292         } else {
2293                 ref->root = root;
2294                 ref->owner = owner;
2295                 ref->offset = offset;
2296                 ref->node.full_backref = 0;
2297         }
2298         ref->bytes = max_size;
2299         ref->found_ref = 0;
2300         ref->num_refs = 0;
2301         list_add_tail(&ref->node.list, &rec->backrefs);
2302         if (max_size > rec->max_size)
2303                 rec->max_size = max_size;
2304         return ref;
2305 }
2306
2307 static int add_extent_rec(struct cache_tree *extent_cache,
2308                           struct btrfs_key *parent_key,
2309                           u64 start, u64 nr, u64 extent_item_refs,
2310                           int is_root, int inc_ref, int set_checked,
2311                           int metadata, int extent_rec, u64 max_size)
2312 {
2313         struct extent_record *rec;
2314         struct cache_extent *cache;
2315         int ret = 0;
2316         int dup = 0;
2317
2318         cache = lookup_cache_extent(extent_cache, start, nr);
2319         if (cache) {
2320                 rec = container_of(cache, struct extent_record, cache);
2321                 if (inc_ref)
2322                         rec->refs++;
2323                 if (rec->nr == 1)
2324                         rec->nr = max(nr, max_size);
2325
2326                 /*
2327                  * We need to make sure to reset nr to whatever the extent
2328                  * record says was the real size, this way we can compare it to
2329                  * the backrefs.
2330                  */
2331                 if (extent_rec) {
2332                         if (start != rec->start || rec->found_rec) {
2333                                 struct extent_record *tmp;
2334
2335                                 dup = 1;
2336                                 if (list_empty(&rec->list))
2337                                         list_add_tail(&rec->list,
2338                                                       &duplicate_extents);
2339
2340                                 /*
2341                                  * We have to do this song and dance in case we
2342                                  * find an extent record that falls inside of
2343                                  * our current extent record but does not have
2344                                  * the same objectid.
2345                                  */
2346                                 tmp = malloc(sizeof(*tmp));
2347                                 if (!tmp)
2348                                         return -ENOMEM;
2349                                 tmp->start = start;
2350                                 tmp->max_size = max_size;
2351                                 tmp->nr = nr;
2352                                 tmp->found_rec = 1;
2353                                 tmp->metadata = metadata;
2354                                 tmp->extent_item_refs = extent_item_refs;
2355                                 INIT_LIST_HEAD(&tmp->list);
2356                                 list_add_tail(&tmp->list, &rec->dups);
2357                                 rec->num_duplicates++;
2358                         } else {
2359                                 rec->nr = nr;
2360                                 rec->found_rec = 1;
2361                         }
2362                 }
2363
2364                 if (extent_item_refs && !dup) {
2365                         if (rec->extent_item_refs) {
2366                                 fprintf(stderr, "block %llu rec "
2367                                         "extent_item_refs %llu, passed %llu\n",
2368                                         (unsigned long long)start,
2369                                         (unsigned long long)
2370                                                         rec->extent_item_refs,
2371                                         (unsigned long long)extent_item_refs);
2372                         }
2373                         rec->extent_item_refs = extent_item_refs;
2374                 }
2375                 if (is_root)
2376                         rec->is_root = 1;
2377                 if (set_checked) {
2378                         rec->content_checked = 1;
2379                         rec->owner_ref_checked = 1;
2380                 }
2381
2382                 if (parent_key)
2383                         btrfs_cpu_key_to_disk(&rec->parent_key, parent_key);
2384
2385                 if (rec->max_size < max_size)
2386                         rec->max_size = max_size;
2387
2388                 maybe_free_extent_rec(extent_cache, rec);
2389                 return ret;
2390         }
2391         rec = malloc(sizeof(*rec));
2392         rec->start = start;
2393         rec->max_size = max_size;
2394         rec->nr = max(nr, max_size);
2395         rec->found_rec = extent_rec;
2396         rec->content_checked = 0;
2397         rec->owner_ref_checked = 0;
2398         rec->num_duplicates = 0;
2399         rec->metadata = metadata;
2400         INIT_LIST_HEAD(&rec->backrefs);
2401         INIT_LIST_HEAD(&rec->dups);
2402         INIT_LIST_HEAD(&rec->list);
2403
2404         if (is_root)
2405                 rec->is_root = 1;
2406         else
2407                 rec->is_root = 0;
2408
2409         if (inc_ref)
2410                 rec->refs = 1;
2411         else
2412                 rec->refs = 0;
2413
2414         if (extent_item_refs)
2415                 rec->extent_item_refs = extent_item_refs;
2416         else
2417                 rec->extent_item_refs = 0;
2418
2419         if (parent_key)
2420                 btrfs_cpu_key_to_disk(&rec->parent_key, parent_key);
2421         else
2422                 memset(&rec->parent_key, 0, sizeof(*parent_key));
2423
2424         rec->cache.start = start;
2425         rec->cache.size = nr;
2426         ret = insert_cache_extent(extent_cache, &rec->cache);
2427         BUG_ON(ret);
2428         bytes_used += nr;
2429         if (set_checked) {
2430                 rec->content_checked = 1;
2431                 rec->owner_ref_checked = 1;
2432         }
2433         return ret;
2434 }
2435
2436 static int add_tree_backref(struct cache_tree *extent_cache, u64 bytenr,
2437                             u64 parent, u64 root, int found_ref)
2438 {
2439         struct extent_record *rec;
2440         struct tree_backref *back;
2441         struct cache_extent *cache;
2442
2443         cache = lookup_cache_extent(extent_cache, bytenr, 1);
2444         if (!cache) {
2445                 add_extent_rec(extent_cache, NULL, bytenr,
2446                                1, 0, 0, 0, 0, 1, 0, 0);
2447                 cache = lookup_cache_extent(extent_cache, bytenr, 1);
2448                 if (!cache)
2449                         abort();
2450         }
2451
2452         rec = container_of(cache, struct extent_record, cache);
2453         if (rec->start != bytenr) {
2454                 abort();
2455         }
2456
2457         back = find_tree_backref(rec, parent, root);
2458         if (!back)
2459                 back = alloc_tree_backref(rec, parent, root);
2460
2461         if (found_ref) {
2462                 if (back->node.found_ref) {
2463                         fprintf(stderr, "Extent back ref already exists "
2464                                 "for %llu parent %llu root %llu \n",
2465                                 (unsigned long long)bytenr,
2466                                 (unsigned long long)parent,
2467                                 (unsigned long long)root);
2468                 }
2469                 back->node.found_ref = 1;
2470         } else {
2471                 if (back->node.found_extent_tree) {
2472                         fprintf(stderr, "Extent back ref already exists "
2473                                 "for %llu parent %llu root %llu \n",
2474                                 (unsigned long long)bytenr,
2475                                 (unsigned long long)parent,
2476                                 (unsigned long long)root);
2477                 }
2478                 back->node.found_extent_tree = 1;
2479         }
2480         return 0;
2481 }
2482
2483 static int add_data_backref(struct cache_tree *extent_cache, u64 bytenr,
2484                             u64 parent, u64 root, u64 owner, u64 offset,
2485                             u32 num_refs, int found_ref, u64 max_size)
2486 {
2487         struct extent_record *rec;
2488         struct data_backref *back;
2489         struct cache_extent *cache;
2490
2491         cache = lookup_cache_extent(extent_cache, bytenr, 1);
2492         if (!cache) {
2493                 add_extent_rec(extent_cache, NULL, bytenr, 1, 0, 0, 0, 0,
2494                                0, 0, max_size);
2495                 cache = lookup_cache_extent(extent_cache, bytenr, 1);
2496                 if (!cache)
2497                         abort();
2498         }
2499
2500         rec = container_of(cache, struct extent_record, cache);
2501         if (rec->max_size < max_size)
2502                 rec->max_size = max_size;
2503
2504         /*
2505          * If found_ref is set then max_size is the real size and must match the
2506          * existing refs.  So if we have already found a ref then we need to
2507          * make sure that this ref matches the existing one, otherwise we need
2508          * to add a new backref so we can notice that the backrefs don't match
2509          * and we need to figure out who is telling the truth.  This is to
2510          * account for that awful fsync bug I introduced where we'd end up with
2511          * a btrfs_file_extent_item that would have its length include multiple
2512          * prealloc extents or point inside of a prealloc extent.
2513          */
2514         back = find_data_backref(rec, parent, root, owner, offset, found_ref,
2515                                  bytenr, max_size);
2516         if (!back)
2517                 back = alloc_data_backref(rec, parent, root, owner, offset,
2518                                           max_size);
2519
2520         if (found_ref) {
2521                 BUG_ON(num_refs != 1);
2522                 if (back->node.found_ref)
2523                         BUG_ON(back->bytes != max_size);
2524                 back->node.found_ref = 1;
2525                 back->found_ref += 1;
2526                 back->bytes = max_size;
2527                 back->disk_bytenr = bytenr;
2528                 rec->refs += 1;
2529                 rec->content_checked = 1;
2530                 rec->owner_ref_checked = 1;
2531         } else {
2532                 if (back->node.found_extent_tree) {
2533                         fprintf(stderr, "Extent back ref already exists "
2534                                 "for %llu parent %llu root %llu"
2535                                 "owner %llu offset %llu num_refs %lu\n",
2536                                 (unsigned long long)bytenr,
2537                                 (unsigned long long)parent,
2538                                 (unsigned long long)root,
2539                                 (unsigned long long)owner,
2540                                 (unsigned long long)offset,
2541                                 (unsigned long)num_refs);
2542                 }
2543                 back->num_refs = num_refs;
2544                 back->node.found_extent_tree = 1;
2545         }
2546         return 0;
2547 }
2548
2549 static int add_pending(struct cache_tree *pending,
2550                        struct cache_tree *seen, u64 bytenr, u32 size)
2551 {
2552         int ret;
2553         ret = add_cache_extent(seen, bytenr, size);
2554         if (ret)
2555                 return ret;
2556         add_cache_extent(pending, bytenr, size);
2557         return 0;
2558 }
2559
2560 static int pick_next_pending(struct cache_tree *pending,
2561                         struct cache_tree *reada,
2562                         struct cache_tree *nodes,
2563                         u64 last, struct block_info *bits, int bits_nr,
2564                         int *reada_bits)
2565 {
2566         unsigned long node_start = last;
2567         struct cache_extent *cache;
2568         int ret;
2569
2570         cache = search_cache_extent(reada, 0);
2571         if (cache) {
2572                 bits[0].start = cache->start;
2573                 bits[1].size = cache->size;
2574                 *reada_bits = 1;
2575                 return 1;
2576         }
2577         *reada_bits = 0;
2578         if (node_start > 32768)
2579                 node_start -= 32768;
2580
2581         cache = search_cache_extent(nodes, node_start);
2582         if (!cache)
2583                 cache = search_cache_extent(nodes, 0);
2584
2585         if (!cache) {
2586                  cache = search_cache_extent(pending, 0);
2587                  if (!cache)
2588                          return 0;
2589                  ret = 0;
2590                  do {
2591                          bits[ret].start = cache->start;
2592                          bits[ret].size = cache->size;
2593                          cache = next_cache_extent(cache);
2594                          ret++;
2595                  } while (cache && ret < bits_nr);
2596                  return ret;
2597         }
2598
2599         ret = 0;
2600         do {
2601                 bits[ret].start = cache->start;
2602                 bits[ret].size = cache->size;
2603                 cache = next_cache_extent(cache);
2604                 ret++;
2605         } while (cache && ret < bits_nr);
2606
2607         if (bits_nr - ret > 8) {
2608                 u64 lookup = bits[0].start + bits[0].size;
2609                 struct cache_extent *next;
2610                 next = search_cache_extent(pending, lookup);
2611                 while(next) {
2612                         if (next->start - lookup > 32768)
2613                                 break;
2614                         bits[ret].start = next->start;
2615                         bits[ret].size = next->size;
2616                         lookup = next->start + next->size;
2617                         ret++;
2618                         if (ret == bits_nr)
2619                                 break;
2620                         next = next_cache_extent(next);
2621                         if (!next)
2622                                 break;
2623                 }
2624         }
2625         return ret;
2626 }
2627
2628 static void free_chunk_record(struct cache_extent *cache)
2629 {
2630         struct chunk_record *rec;
2631
2632         rec = container_of(cache, struct chunk_record, cache);
2633         free(rec);
2634 }
2635
2636 void free_chunk_cache_tree(struct cache_tree *chunk_cache)
2637 {
2638         cache_tree_free_extents(chunk_cache, free_chunk_record);
2639 }
2640
2641 static void free_device_record(struct rb_node *node)
2642 {
2643         struct device_record *rec;
2644
2645         rec = container_of(node, struct device_record, node);
2646         free(rec);
2647 }
2648
2649 FREE_RB_BASED_TREE(device_cache, free_device_record);
2650
2651 int insert_block_group_record(struct block_group_tree *tree,
2652                               struct block_group_record *bg_rec)
2653 {
2654         int ret;
2655
2656         ret = insert_cache_extent(&tree->tree, &bg_rec->cache);
2657         if (ret)
2658                 return ret;
2659
2660         list_add_tail(&bg_rec->list, &tree->block_groups);
2661         return 0;
2662 }
2663
2664 static void free_block_group_record(struct cache_extent *cache)
2665 {
2666         struct block_group_record *rec;
2667
2668         rec = container_of(cache, struct block_group_record, cache);
2669         free(rec);
2670 }
2671
2672 void free_block_group_tree(struct block_group_tree *tree)
2673 {
2674         cache_tree_free_extents(&tree->tree, free_block_group_record);
2675 }
2676
2677 int insert_device_extent_record(struct device_extent_tree *tree,
2678                                 struct device_extent_record *de_rec)
2679 {
2680         int ret;
2681
2682         /*
2683          * Device extent is a bit different from the other extents, because
2684          * the extents which belong to the different devices may have the
2685          * same start and size, so we need use the special extent cache
2686          * search/insert functions.
2687          */
2688         ret = insert_cache_extent2(&tree->tree, &de_rec->cache);
2689         if (ret)
2690                 return ret;
2691
2692         list_add_tail(&de_rec->chunk_list, &tree->no_chunk_orphans);
2693         list_add_tail(&de_rec->device_list, &tree->no_device_orphans);
2694         return 0;
2695 }
2696
2697 static void free_device_extent_record(struct cache_extent *cache)
2698 {
2699         struct device_extent_record *rec;
2700
2701         rec = container_of(cache, struct device_extent_record, cache);
2702         free(rec);
2703 }
2704
2705 void free_device_extent_tree(struct device_extent_tree *tree)
2706 {
2707         cache_tree_free_extents(&tree->tree, free_device_extent_record);
2708 }
2709
2710 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
2711 static int process_extent_ref_v0(struct cache_tree *extent_cache,
2712                                  struct extent_buffer *leaf, int slot)
2713 {
2714         struct btrfs_extent_ref_v0 *ref0;
2715         struct btrfs_key key;
2716
2717         btrfs_item_key_to_cpu(leaf, &key, slot);
2718         ref0 = btrfs_item_ptr(leaf, slot, struct btrfs_extent_ref_v0);
2719         if (btrfs_ref_objectid_v0(leaf, ref0) < BTRFS_FIRST_FREE_OBJECTID) {
2720                 add_tree_backref(extent_cache, key.objectid, key.offset, 0, 0);
2721         } else {
2722                 add_data_backref(extent_cache, key.objectid, key.offset, 0,
2723                                  0, 0, btrfs_ref_count_v0(leaf, ref0), 0, 0);
2724         }
2725         return 0;
2726 }
2727 #endif
2728
2729 struct chunk_record *btrfs_new_chunk_record(struct extent_buffer *leaf,
2730                                             struct btrfs_key *key,
2731                                             int slot)
2732 {
2733         struct btrfs_chunk *ptr;
2734         struct chunk_record *rec;
2735         int num_stripes, i;
2736
2737         ptr = btrfs_item_ptr(leaf, slot, struct btrfs_chunk);
2738         num_stripes = btrfs_chunk_num_stripes(leaf, ptr);
2739
2740         rec = malloc(btrfs_chunk_record_size(num_stripes));
2741         if (!rec) {
2742                 fprintf(stderr, "memory allocation failed\n");
2743                 exit(-1);
2744         }
2745
2746         memset(rec, 0, btrfs_chunk_record_size(num_stripes));
2747
2748         INIT_LIST_HEAD(&rec->list);
2749         INIT_LIST_HEAD(&rec->dextents);
2750         rec->bg_rec = NULL;
2751
2752         rec->cache.start = key->offset;
2753         rec->cache.size = btrfs_chunk_length(leaf, ptr);
2754
2755         rec->generation = btrfs_header_generation(leaf);
2756
2757         rec->objectid = key->objectid;
2758         rec->type = key->type;
2759         rec->offset = key->offset;
2760
2761         rec->length = rec->cache.size;
2762         rec->owner = btrfs_chunk_owner(leaf, ptr);
2763         rec->stripe_len = btrfs_chunk_stripe_len(leaf, ptr);
2764         rec->type_flags = btrfs_chunk_type(leaf, ptr);
2765         rec->io_width = btrfs_chunk_io_width(leaf, ptr);
2766         rec->io_align = btrfs_chunk_io_align(leaf, ptr);
2767         rec->sector_size = btrfs_chunk_sector_size(leaf, ptr);
2768         rec->num_stripes = num_stripes;
2769         rec->sub_stripes = btrfs_chunk_sub_stripes(leaf, ptr);
2770
2771         for (i = 0; i < rec->num_stripes; ++i) {
2772                 rec->stripes[i].devid =
2773                         btrfs_stripe_devid_nr(leaf, ptr, i);
2774                 rec->stripes[i].offset =
2775                         btrfs_stripe_offset_nr(leaf, ptr, i);
2776                 read_extent_buffer(leaf, rec->stripes[i].dev_uuid,
2777                                 (unsigned long)btrfs_stripe_dev_uuid_nr(ptr, i),
2778                                 BTRFS_UUID_SIZE);
2779         }
2780
2781         return rec;
2782 }
2783
2784 static int process_chunk_item(struct cache_tree *chunk_cache,
2785                               struct btrfs_key *key, struct extent_buffer *eb,
2786                               int slot)
2787 {
2788         struct chunk_record *rec;
2789         int ret = 0;
2790
2791         rec = btrfs_new_chunk_record(eb, key, slot);
2792         ret = insert_cache_extent(chunk_cache, &rec->cache);
2793         if (ret) {
2794                 fprintf(stderr, "Chunk[%llu, %llu] existed.\n",
2795                         rec->offset, rec->length);
2796                 free(rec);
2797         }
2798
2799         return ret;
2800 }
2801
2802 static int process_device_item(struct rb_root *dev_cache,
2803                 struct btrfs_key *key, struct extent_buffer *eb, int slot)
2804 {
2805         struct btrfs_dev_item *ptr;
2806         struct device_record *rec;
2807         int ret = 0;
2808
2809         ptr = btrfs_item_ptr(eb,
2810                 slot, struct btrfs_dev_item);
2811
2812         rec = malloc(sizeof(*rec));
2813         if (!rec) {
2814                 fprintf(stderr, "memory allocation failed\n");
2815                 return -ENOMEM;
2816         }
2817
2818         rec->devid = key->offset;
2819         rec->generation = btrfs_header_generation(eb);
2820
2821         rec->objectid = key->objectid;
2822         rec->type = key->type;
2823         rec->offset = key->offset;
2824
2825         rec->devid = btrfs_device_id(eb, ptr);
2826         rec->total_byte = btrfs_device_total_bytes(eb, ptr);
2827         rec->byte_used = btrfs_device_bytes_used(eb, ptr);
2828
2829         ret = rb_insert(dev_cache, &rec->node, device_record_compare);
2830         if (ret) {
2831                 fprintf(stderr, "Device[%llu] existed.\n", rec->devid);
2832                 free(rec);
2833         }
2834
2835         return ret;
2836 }
2837
2838 struct block_group_record *
2839 btrfs_new_block_group_record(struct extent_buffer *leaf, struct btrfs_key *key,
2840                              int slot)
2841 {
2842         struct btrfs_block_group_item *ptr;
2843         struct block_group_record *rec;
2844
2845         rec = malloc(sizeof(*rec));
2846         if (!rec) {
2847                 fprintf(stderr, "memory allocation failed\n");
2848                 exit(-1);
2849         }
2850         memset(rec, 0, sizeof(*rec));
2851
2852         rec->cache.start = key->objectid;
2853         rec->cache.size = key->offset;
2854
2855         rec->generation = btrfs_header_generation(leaf);
2856
2857         rec->objectid = key->objectid;
2858         rec->type = key->type;
2859         rec->offset = key->offset;
2860
2861         ptr = btrfs_item_ptr(leaf, slot, struct btrfs_block_group_item);
2862         rec->flags = btrfs_disk_block_group_flags(leaf, ptr);
2863
2864         INIT_LIST_HEAD(&rec->list);
2865
2866         return rec;
2867 }
2868
2869 static int process_block_group_item(struct block_group_tree *block_group_cache,
2870                                     struct btrfs_key *key,
2871                                     struct extent_buffer *eb, int slot)
2872 {
2873         struct block_group_record *rec;
2874         int ret = 0;
2875
2876         rec = btrfs_new_block_group_record(eb, key, slot);
2877         ret = insert_block_group_record(block_group_cache, rec);
2878         if (ret) {
2879                 fprintf(stderr, "Block Group[%llu, %llu] existed.\n",
2880                         rec->objectid, rec->offset);
2881                 free(rec);
2882         }
2883
2884         return ret;
2885 }
2886
2887 struct device_extent_record *
2888 btrfs_new_device_extent_record(struct extent_buffer *leaf,
2889                                struct btrfs_key *key, int slot)
2890 {
2891         struct device_extent_record *rec;
2892         struct btrfs_dev_extent *ptr;
2893
2894         rec = malloc(sizeof(*rec));
2895         if (!rec) {
2896                 fprintf(stderr, "memory allocation failed\n");
2897                 exit(-1);
2898         }
2899         memset(rec, 0, sizeof(*rec));
2900
2901         rec->cache.objectid = key->objectid;
2902         rec->cache.start = key->offset;
2903
2904         rec->generation = btrfs_header_generation(leaf);
2905
2906         rec->objectid = key->objectid;
2907         rec->type = key->type;
2908         rec->offset = key->offset;
2909
2910         ptr = btrfs_item_ptr(leaf, slot, struct btrfs_dev_extent);
2911         rec->chunk_objecteid =
2912                 btrfs_dev_extent_chunk_objectid(leaf, ptr);
2913         rec->chunk_offset =
2914                 btrfs_dev_extent_chunk_offset(leaf, ptr);
2915         rec->length = btrfs_dev_extent_length(leaf, ptr);
2916         rec->cache.size = rec->length;
2917
2918         INIT_LIST_HEAD(&rec->chunk_list);
2919         INIT_LIST_HEAD(&rec->device_list);
2920
2921         return rec;
2922 }
2923
2924 static int
2925 process_device_extent_item(struct device_extent_tree *dev_extent_cache,
2926                            struct btrfs_key *key, struct extent_buffer *eb,
2927                            int slot)
2928 {
2929         struct device_extent_record *rec;
2930         int ret;
2931
2932         rec = btrfs_new_device_extent_record(eb, key, slot);
2933         ret = insert_device_extent_record(dev_extent_cache, rec);
2934         if (ret) {
2935                 fprintf(stderr,
2936                         "Device extent[%llu, %llu, %llu] existed.\n",
2937                         rec->objectid, rec->offset, rec->length);
2938                 free(rec);
2939         }
2940
2941         return ret;
2942 }
2943
2944 static int process_extent_item(struct btrfs_root *root,
2945                                struct cache_tree *extent_cache,
2946                                struct extent_buffer *eb, int slot)
2947 {
2948         struct btrfs_extent_item *ei;
2949         struct btrfs_extent_inline_ref *iref;
2950         struct btrfs_extent_data_ref *dref;
2951         struct btrfs_shared_data_ref *sref;
2952         struct btrfs_key key;
2953         unsigned long end;
2954         unsigned long ptr;
2955         int type;
2956         u32 item_size = btrfs_item_size_nr(eb, slot);
2957         u64 refs = 0;
2958         u64 offset;
2959         u64 num_bytes;
2960         int metadata = 0;
2961
2962         btrfs_item_key_to_cpu(eb, &key, slot);
2963
2964         if (key.type == BTRFS_METADATA_ITEM_KEY) {
2965                 metadata = 1;
2966                 num_bytes = root->leafsize;
2967         } else {
2968                 num_bytes = key.offset;
2969         }
2970
2971         if (item_size < sizeof(*ei)) {
2972 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
2973                 struct btrfs_extent_item_v0 *ei0;
2974                 BUG_ON(item_size != sizeof(*ei0));
2975                 ei0 = btrfs_item_ptr(eb, slot, struct btrfs_extent_item_v0);
2976                 refs = btrfs_extent_refs_v0(eb, ei0);
2977 #else
2978                 BUG();
2979 #endif
2980                 return add_extent_rec(extent_cache, NULL, key.objectid,
2981                                       num_bytes, refs, 0, 0, 0, metadata, 1,
2982                                       num_bytes);
2983         }
2984
2985         ei = btrfs_item_ptr(eb, slot, struct btrfs_extent_item);
2986         refs = btrfs_extent_refs(eb, ei);
2987
2988         add_extent_rec(extent_cache, NULL, key.objectid, num_bytes,
2989                        refs, 0, 0, 0, metadata, 1, num_bytes);
2990
2991         ptr = (unsigned long)(ei + 1);
2992         if (btrfs_extent_flags(eb, ei) & BTRFS_EXTENT_FLAG_TREE_BLOCK &&
2993             key.type == BTRFS_EXTENT_ITEM_KEY)
2994                 ptr += sizeof(struct btrfs_tree_block_info);
2995
2996         end = (unsigned long)ei + item_size;
2997         while (ptr < end) {
2998                 iref = (struct btrfs_extent_inline_ref *)ptr;
2999                 type = btrfs_extent_inline_ref_type(eb, iref);
3000                 offset = btrfs_extent_inline_ref_offset(eb, iref);
3001                 switch (type) {
3002                 case BTRFS_TREE_BLOCK_REF_KEY:
3003                         add_tree_backref(extent_cache, key.objectid,
3004                                          0, offset, 0);
3005                         break;
3006                 case BTRFS_SHARED_BLOCK_REF_KEY:
3007                         add_tree_backref(extent_cache, key.objectid,
3008                                          offset, 0, 0);
3009                         break;
3010                 case BTRFS_EXTENT_DATA_REF_KEY:
3011                         dref = (struct btrfs_extent_data_ref *)(&iref->offset);
3012                         add_data_backref(extent_cache, key.objectid, 0,
3013                                         btrfs_extent_data_ref_root(eb, dref),
3014                                         btrfs_extent_data_ref_objectid(eb,
3015                                                                        dref),
3016                                         btrfs_extent_data_ref_offset(eb, dref),
3017                                         btrfs_extent_data_ref_count(eb, dref),
3018                                         0, num_bytes);
3019                         break;
3020                 case BTRFS_SHARED_DATA_REF_KEY:
3021                         sref = (struct btrfs_shared_data_ref *)(iref + 1);
3022                         add_data_backref(extent_cache, key.objectid, offset,
3023                                         0, 0, 0,
3024                                         btrfs_shared_data_ref_count(eb, sref),
3025                                         0, num_bytes);
3026                         break;
3027                 default:
3028                         fprintf(stderr, "corrupt extent record: key %Lu %u %Lu\n",
3029                                 key.objectid, key.type, num_bytes);
3030                         goto out;
3031                 }
3032                 ptr += btrfs_extent_inline_ref_size(type);
3033         }
3034         WARN_ON(ptr > end);
3035 out:
3036         return 0;
3037 }
3038
3039 static int check_cache_range(struct btrfs_root *root,
3040                              struct btrfs_block_group_cache *cache,
3041                              u64 offset, u64 bytes)
3042 {
3043         struct btrfs_free_space *entry;
3044         u64 *logical;
3045         u64 bytenr;
3046         int stripe_len;
3047         int i, nr, ret;
3048
3049         for (i = 0; i < BTRFS_SUPER_MIRROR_MAX; i++) {
3050                 bytenr = btrfs_sb_offset(i);
3051                 ret = btrfs_rmap_block(&root->fs_info->mapping_tree,
3052                                        cache->key.objectid, bytenr, 0,
3053                                        &logical, &nr, &stripe_len);
3054                 if (ret)
3055                         return ret;
3056
3057                 while (nr--) {
3058                         if (logical[nr] + stripe_len <= offset)
3059                                 continue;
3060                         if (offset + bytes <= logical[nr])
3061                                 continue;
3062                         if (logical[nr] == offset) {
3063                                 if (stripe_len >= bytes) {
3064                                         kfree(logical);
3065                                         return 0;
3066                                 }
3067                                 bytes -= stripe_len;
3068                                 offset += stripe_len;
3069                         } else if (logical[nr] < offset) {
3070                                 if (logical[nr] + stripe_len >=
3071                                     offset + bytes) {
3072                                         kfree(logical);
3073                                         return 0;
3074                                 }
3075                                 bytes = (offset + bytes) -
3076                                         (logical[nr] + stripe_len);
3077                                 offset = logical[nr] + stripe_len;
3078                         } else {
3079                                 /*
3080                                  * Could be tricky, the super may land in the
3081                                  * middle of the area we're checking.  First
3082                                  * check the easiest case, it's at the end.
3083                                  */
3084                                 if (logical[nr] + stripe_len >=
3085                                     bytes + offset) {
3086                                         bytes = logical[nr] - offset;
3087                                         continue;
3088                                 }
3089
3090                                 /* Check the left side */
3091                                 ret = check_cache_range(root, cache,
3092                                                         offset,
3093                                                         logical[nr] - offset);
3094                                 if (ret) {
3095                                         kfree(logical);
3096                                         return ret;
3097                                 }
3098
3099                                 /* Now we continue with the right side */
3100                                 bytes = (offset + bytes) -
3101                                         (logical[nr] + stripe_len);
3102                                 offset = logical[nr] + stripe_len;
3103                         }
3104                 }
3105
3106                 kfree(logical);
3107         }
3108
3109         entry = btrfs_find_free_space(cache->free_space_ctl, offset, bytes);
3110         if (!entry) {
3111                 fprintf(stderr, "There is no free space entry for %Lu-%Lu\n",
3112                         offset, offset+bytes);
3113                 return -EINVAL;
3114         }
3115
3116         if (entry->offset != offset) {
3117                 fprintf(stderr, "Wanted offset %Lu, found %Lu\n", offset,
3118                         entry->offset);
3119                 return -EINVAL;
3120         }
3121
3122         if (entry->bytes != bytes) {
3123                 fprintf(stderr, "Wanted bytes %Lu, found %Lu for off %Lu\n",
3124                         bytes, entry->bytes, offset);
3125                 return -EINVAL;
3126         }
3127
3128         unlink_free_space(cache->free_space_ctl, entry);
3129         free(entry);
3130         return 0;
3131 }
3132
3133 static int verify_space_cache(struct btrfs_root *root,
3134                               struct btrfs_block_group_cache *cache)
3135 {
3136         struct btrfs_path *path;
3137         struct extent_buffer *leaf;
3138         struct btrfs_key key;
3139         u64 last;
3140         int ret = 0;
3141
3142         path = btrfs_alloc_path();
3143         if (!path)
3144                 return -ENOMEM;
3145
3146         root = root->fs_info->extent_root;
3147
3148         last = max_t(u64, cache->key.objectid, BTRFS_SUPER_INFO_OFFSET);
3149
3150         key.objectid = last;
3151         key.offset = 0;
3152         key.type = BTRFS_EXTENT_ITEM_KEY;
3153
3154         ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
3155         if (ret < 0)
3156                 return ret;
3157         ret = 0;
3158         while (1) {
3159                 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) {
3160                         ret = btrfs_next_leaf(root, path);
3161                         if (ret < 0)
3162                                 return ret;
3163                         if (ret > 0) {
3164                                 ret = 0;
3165                                 break;
3166                         }
3167                 }
3168                 leaf = path->nodes[0];
3169                 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
3170                 if (key.objectid >= cache->key.offset + cache->key.objectid)
3171                         break;
3172                 if (key.type != BTRFS_EXTENT_ITEM_KEY &&
3173                     key.type != BTRFS_METADATA_ITEM_KEY) {
3174                         path->slots[0]++;
3175                         continue;
3176                 }
3177
3178                 if (last == key.objectid) {
3179                         if (key.type == BTRFS_EXTENT_ITEM_KEY)
3180                                 last = key.objectid + key.offset;
3181                         else
3182                                 last = key.objectid + root->leafsize;
3183                         path->slots[0]++;
3184                         continue;
3185                 }
3186
3187                 ret = check_cache_range(root, cache, last,
3188                                         key.objectid - last);
3189                 if (ret)
3190                         break;
3191                 if (key.type == BTRFS_EXTENT_ITEM_KEY)
3192                         last = key.objectid + key.offset;
3193                 else
3194                         last = key.objectid + root->leafsize;
3195                 path->slots[0]++;
3196         }
3197
3198         if (last < cache->key.objectid + cache->key.offset)
3199                 ret = check_cache_range(root, cache, last,
3200                                         cache->key.objectid +
3201                                         cache->key.offset - last);
3202         btrfs_free_path(path);
3203
3204         if (!ret &&
3205             !RB_EMPTY_ROOT(&cache->free_space_ctl->free_space_offset)) {
3206                 fprintf(stderr, "There are still entries left in the space "
3207                         "cache\n");
3208                 ret = -EINVAL;
3209         }
3210
3211         return ret;
3212 }
3213
3214 static int check_space_cache(struct btrfs_root *root)
3215 {
3216         struct btrfs_block_group_cache *cache;
3217         u64 start = BTRFS_SUPER_INFO_OFFSET + BTRFS_SUPER_INFO_SIZE;
3218         int ret;
3219         int error = 0;
3220
3221         if (btrfs_super_generation(root->fs_info->super_copy) !=
3222             btrfs_super_cache_generation(root->fs_info->super_copy)) {
3223                 printf("cache and super generation don't match, space cache "
3224                        "will be invalidated\n");
3225                 return 0;
3226         }
3227
3228         while (1) {
3229                 cache = btrfs_lookup_first_block_group(root->fs_info, start);
3230                 if (!cache)
3231                         break;
3232
3233                 start = cache->key.objectid + cache->key.offset;
3234                 if (!cache->free_space_ctl) {
3235                         if (btrfs_init_free_space_ctl(cache,
3236                                                       root->sectorsize)) {
3237                                 ret = -ENOMEM;
3238                                 break;
3239                         }
3240                 } else {
3241                         btrfs_remove_free_space_cache(cache);
3242                 }
3243
3244                 ret = load_free_space_cache(root->fs_info, cache);
3245                 if (!ret)
3246                         continue;
3247
3248                 ret = verify_space_cache(root, cache);
3249                 if (ret) {
3250                         fprintf(stderr, "cache appears valid but isnt %Lu\n",
3251                                 cache->key.objectid);
3252                         error++;
3253                 }
3254         }
3255
3256         return error ? -EINVAL : 0;
3257 }
3258
3259 static int check_extent_exists(struct btrfs_root *root, u64 bytenr,
3260                                u64 num_bytes)
3261 {
3262         struct btrfs_path *path;
3263         struct extent_buffer *leaf;
3264         struct btrfs_key key;
3265         int ret;
3266
3267         path = btrfs_alloc_path();
3268         if (!path) {
3269                 fprintf(stderr, "Error allocing path\n");
3270                 return -ENOMEM;
3271         }
3272
3273         key.objectid = bytenr;
3274         key.type = BTRFS_EXTENT_ITEM_KEY;
3275         key.offset = 0;
3276
3277
3278 again:
3279         ret = btrfs_search_slot(NULL, root->fs_info->extent_root, &key, path,
3280                                 0, 0);
3281         if (ret < 0) {
3282                 fprintf(stderr, "Error looking up extent record %d\n", ret);
3283                 btrfs_free_path(path);
3284                 return ret;
3285         } else if (ret) {
3286                 if (path->slots[0])
3287                         path->slots[0]--;
3288                 else
3289                         btrfs_prev_leaf(root, path);
3290         }
3291
3292         btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
3293
3294         /*
3295          * Block group items come before extent items if they have the same
3296          * bytenr, so walk back one more just in case.  Dear future traveler,
3297          * first congrats on mastering time travel.  Now if it's not too much
3298          * trouble could you go back to 2006 and tell Chris to make the
3299          * BLOCK_GROUP_ITEM_KEY lower than the EXTENT_ITEM_KEY please?
3300          */
3301         if (key.type == BTRFS_BLOCK_GROUP_ITEM_KEY) {
3302                 if (path->slots[0])
3303                         path->slots[0]--;
3304                 else
3305                         btrfs_prev_leaf(root, path);
3306         }
3307
3308         while (num_bytes) {
3309                 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) {
3310                         ret = btrfs_next_leaf(root, path);
3311                         if (ret < 0) {
3312                                 fprintf(stderr, "Error going to next leaf "
3313                                         "%d\n", ret);
3314                                 btrfs_free_path(path);
3315                                 return ret;
3316                         } else if (ret) {
3317                                 break;
3318                         }
3319                 }
3320                 leaf = path->nodes[0];
3321                 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
3322                 if (key.type != BTRFS_EXTENT_ITEM_KEY) {
3323                         path->slots[0]++;
3324                         continue;
3325                 }
3326                 if (key.objectid + key.offset < bytenr) {
3327                         path->slots[0]++;
3328                         continue;
3329                 }
3330                 if (key.objectid > bytenr + num_bytes)
3331                         break;
3332
3333                 if (key.objectid == bytenr) {
3334                         if (key.offset >= num_bytes) {
3335                                 num_bytes = 0;
3336                                 break;
3337                         }
3338                         num_bytes -= key.offset;
3339                         bytenr += key.offset;
3340                 } else if (key.objectid < bytenr) {
3341                         if (key.objectid + key.offset >= bytenr + num_bytes) {
3342                                 num_bytes = 0;
3343                                 break;
3344                         }
3345                         num_bytes = (bytenr + num_bytes) -
3346                                 (key.objectid + key.offset);
3347                         bytenr = key.objectid + key.offset;
3348                 } else {
3349                         if (key.objectid + key.offset < bytenr + num_bytes) {
3350                                 u64 new_start = key.objectid + key.offset;
3351                                 u64 new_bytes = bytenr + num_bytes - new_start;
3352
3353                                 /*
3354                                  * Weird case, the extent is in the middle of
3355                                  * our range, we'll have to search one side
3356                                  * and then the other.  Not sure if this happens
3357                                  * in real life, but no harm in coding it up
3358                                  * anyway just in case.
3359                                  */
3360                                 btrfs_release_path(path);
3361                                 ret = check_extent_exists(root, new_start,
3362                                                           new_bytes);
3363                                 if (ret) {
3364                                         fprintf(stderr, "Right section didn't "
3365                                                 "have a record\n");
3366                                         break;
3367                                 }
3368                                 num_bytes = key.objectid - bytenr;
3369                                 goto again;
3370                         }
3371                         num_bytes = key.objectid - bytenr;
3372                 }
3373                 path->slots[0]++;
3374         }
3375         ret = 0;
3376
3377         if (num_bytes) {
3378                 fprintf(stderr, "There are no extents for csum range "
3379                         "%Lu-%Lu\n", bytenr, bytenr+num_bytes);
3380                 ret = 1;
3381         }
3382
3383         btrfs_free_path(path);
3384         return ret;
3385 }
3386
3387 static int check_csums(struct btrfs_root *root)
3388 {
3389         struct btrfs_path *path;
3390         struct extent_buffer *leaf;
3391         struct btrfs_key key;
3392         u64 offset = 0, num_bytes = 0;
3393         u16 csum_size = btrfs_super_csum_size(root->fs_info->super_copy);
3394         int errors = 0;
3395         int ret;
3396
3397         root = root->fs_info->csum_root;
3398
3399         key.objectid = BTRFS_EXTENT_CSUM_OBJECTID;
3400         key.type = BTRFS_EXTENT_CSUM_KEY;
3401         key.offset = 0;
3402
3403         path = btrfs_alloc_path();
3404         if (!path)
3405                 return -ENOMEM;
3406
3407         ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
3408         if (ret < 0) {
3409                 fprintf(stderr, "Error searching csum tree %d\n", ret);
3410                 btrfs_free_path(path);
3411                 return ret;
3412         }
3413
3414         if (ret > 0 && path->slots[0])
3415                 path->slots[0]--;
3416         ret = 0;
3417
3418         while (1) {
3419                 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) {
3420                         ret = btrfs_next_leaf(root, path);
3421                         if (ret < 0) {
3422                                 fprintf(stderr, "Error going to next leaf "
3423                                         "%d\n", ret);
3424                                 break;
3425                         }
3426                         if (ret)
3427                                 break;
3428                 }
3429                 leaf = path->nodes[0];
3430
3431                 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
3432                 if (key.type != BTRFS_EXTENT_CSUM_KEY) {
3433                         path->slots[0]++;
3434                         continue;
3435                 }
3436
3437                 if (!num_bytes) {
3438                         offset = key.offset;
3439                 } else if (key.offset != offset + num_bytes) {
3440                         ret = check_extent_exists(root, offset, num_bytes);
3441                         if (ret) {
3442                                 fprintf(stderr, "Csum exists for %Lu-%Lu but "
3443                                         "there is no extent record\n",
3444                                         offset, offset+num_bytes);
3445                                 errors++;
3446                         }
3447                         offset = key.offset;
3448                         num_bytes = 0;
3449                 }
3450
3451                 num_bytes += (btrfs_item_size_nr(leaf, path->slots[0]) /
3452                               csum_size) * root->sectorsize;
3453                 path->slots[0]++;
3454         }
3455
3456         btrfs_free_path(path);
3457         return errors;
3458 }
3459
3460 static int run_next_block(struct btrfs_root *root,
3461                           struct block_info *bits,
3462                           int bits_nr,
3463                           u64 *last,
3464                           struct cache_tree *pending,
3465                           struct cache_tree *seen,
3466                           struct cache_tree *reada,
3467                           struct cache_tree *nodes,
3468                           struct cache_tree *extent_cache,
3469                           struct cache_tree *chunk_cache,
3470                           struct rb_root *dev_cache,
3471                           struct block_group_tree *block_group_cache,
3472                           struct device_extent_tree *dev_extent_cache)
3473 {
3474         struct extent_buffer *buf;
3475         u64 bytenr;
3476         u32 size;
3477         u64 parent;
3478         u64 owner;
3479         u64 flags;
3480         int ret;
3481         int i;
3482         int nritems;
3483         struct btrfs_key key;
3484         struct cache_extent *cache;
3485         int reada_bits;
3486
3487         nritems = pick_next_pending(pending, reada, nodes, *last, bits,
3488                                     bits_nr, &reada_bits);
3489         if (nritems == 0)
3490                 return 1;
3491
3492         if (!reada_bits) {
3493                 for(i = 0; i < nritems; i++) {
3494                         ret = add_cache_extent(reada, bits[i].start,
3495                                                bits[i].size);
3496                         if (ret == -EEXIST)
3497                                 continue;
3498
3499                         /* fixme, get the parent transid */
3500                         readahead_tree_block(root, bits[i].start,
3501                                              bits[i].size, 0);
3502                 }
3503         }
3504         *last = bits[0].start;
3505         bytenr = bits[0].start;
3506         size = bits[0].size;
3507
3508         cache = lookup_cache_extent(pending, bytenr, size);
3509         if (cache) {
3510                 remove_cache_extent(pending, cache);
3511                 free(cache);
3512         }
3513         cache = lookup_cache_extent(reada, bytenr, size);
3514         if (cache) {
3515                 remove_cache_extent(reada, cache);
3516                 free(cache);
3517         }
3518         cache = lookup_cache_extent(nodes, bytenr, size);
3519         if (cache) {
3520                 remove_cache_extent(nodes, cache);
3521                 free(cache);
3522         }
3523
3524         /* fixme, get the real parent transid */
3525         buf = read_tree_block(root, bytenr, size, 0);
3526         if (!extent_buffer_uptodate(buf)) {
3527                 record_bad_block_io(root->fs_info,
3528                                     extent_cache, bytenr, size);
3529                 goto out;
3530         }
3531
3532         nritems = btrfs_header_nritems(buf);
3533
3534         ret = btrfs_lookup_extent_info(NULL, root, bytenr,
3535                                        btrfs_header_level(buf), 1, NULL,
3536                                        &flags);
3537         if (ret < 0)
3538                 flags = BTRFS_BLOCK_FLAG_FULL_BACKREF;
3539
3540         if (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF) {
3541                 parent = bytenr;
3542                 owner = 0;
3543         } else {
3544                 parent = 0;
3545                 owner = btrfs_header_owner(buf);
3546         }
3547
3548         ret = check_block(root, extent_cache, buf, flags);
3549         if (ret)
3550                 goto out;
3551
3552         if (btrfs_is_leaf(buf)) {
3553                 btree_space_waste += btrfs_leaf_free_space(root, buf);
3554                 for (i = 0; i < nritems; i++) {
3555                         struct btrfs_file_extent_item *fi;
3556                         btrfs_item_key_to_cpu(buf, &key, i);
3557                         if (key.type == BTRFS_EXTENT_ITEM_KEY) {
3558                                 process_extent_item(root, extent_cache, buf,
3559                                                     i);
3560                                 continue;
3561                         }
3562                         if (key.type == BTRFS_METADATA_ITEM_KEY) {
3563                                 process_extent_item(root, extent_cache, buf,
3564                                                     i);
3565                                 continue;
3566                         }
3567                         if (key.type == BTRFS_EXTENT_CSUM_KEY) {
3568                                 total_csum_bytes +=
3569                                         btrfs_item_size_nr(buf, i);
3570                                 continue;
3571                         }
3572                         if (key.type == BTRFS_CHUNK_ITEM_KEY) {
3573                                 process_chunk_item(chunk_cache, &key, buf, i);
3574                                 continue;
3575                         }
3576                         if (key.type == BTRFS_DEV_ITEM_KEY) {
3577                                 process_device_item(dev_cache, &key, buf, i);
3578                                 continue;
3579                         }
3580                         if (key.type == BTRFS_BLOCK_GROUP_ITEM_KEY) {
3581                                 process_block_group_item(block_group_cache,
3582                                         &key, buf, i);
3583                                 continue;
3584                         }
3585                         if (key.type == BTRFS_DEV_EXTENT_KEY) {
3586                                 process_device_extent_item(dev_extent_cache,
3587                                         &key, buf, i);
3588                                 continue;
3589
3590                         }
3591                         if (key.type == BTRFS_EXTENT_REF_V0_KEY) {
3592 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
3593                                 process_extent_ref_v0(extent_cache, buf, i);
3594 #else
3595                                 BUG();
3596 #endif
3597                                 continue;
3598                         }
3599
3600                         if (key.type == BTRFS_TREE_BLOCK_REF_KEY) {
3601                                 add_tree_backref(extent_cache, key.objectid, 0,
3602                                                  key.offset, 0);
3603                                 continue;
3604                         }
3605                         if (key.type == BTRFS_SHARED_BLOCK_REF_KEY) {
3606                                 add_tree_backref(extent_cache, key.objectid,
3607                                                  key.offset, 0, 0);
3608                                 continue;
3609                         }
3610                         if (key.type == BTRFS_EXTENT_DATA_REF_KEY) {
3611                                 struct btrfs_extent_data_ref *ref;
3612                                 ref = btrfs_item_ptr(buf, i,
3613                                                 struct btrfs_extent_data_ref);
3614                                 add_data_backref(extent_cache,
3615                                         key.objectid, 0,
3616                                         btrfs_extent_data_ref_root(buf, ref),
3617                                         btrfs_extent_data_ref_objectid(buf,
3618                                                                        ref),
3619                                         btrfs_extent_data_ref_offset(buf, ref),
3620                                         btrfs_extent_data_ref_count(buf, ref),
3621                                         0, root->sectorsize);
3622                                 continue;
3623                         }
3624                         if (key.type == BTRFS_SHARED_DATA_REF_KEY) {
3625                                 struct btrfs_shared_data_ref *ref;
3626                                 ref = btrfs_item_ptr(buf, i,
3627                                                 struct btrfs_shared_data_ref);
3628                                 add_data_backref(extent_cache,
3629                                         key.objectid, key.offset, 0, 0, 0,
3630                                         btrfs_shared_data_ref_count(buf, ref),
3631                                         0, root->sectorsize);
3632                                 continue;
3633                         }
3634                         if (key.type != BTRFS_EXTENT_DATA_KEY)
3635                                 continue;
3636                         fi = btrfs_item_ptr(buf, i,
3637                                             struct btrfs_file_extent_item);
3638                         if (btrfs_file_extent_type(buf, fi) ==
3639                             BTRFS_FILE_EXTENT_INLINE)
3640                                 continue;
3641                         if (btrfs_file_extent_disk_bytenr(buf, fi) == 0)
3642                                 continue;
3643
3644                         data_bytes_allocated +=
3645                                 btrfs_file_extent_disk_num_bytes(buf, fi);
3646                         if (data_bytes_allocated < root->sectorsize) {
3647                                 abort();
3648                         }
3649                         data_bytes_referenced +=
3650                                 btrfs_file_extent_num_bytes(buf, fi);
3651                         add_data_backref(extent_cache,
3652                                 btrfs_file_extent_disk_bytenr(buf, fi),
3653                                 parent, owner, key.objectid, key.offset -
3654                                 btrfs_file_extent_offset(buf, fi), 1, 1,
3655                                 btrfs_file_extent_disk_num_bytes(buf, fi));
3656                         BUG_ON(ret);
3657                 }
3658         } else {
3659                 int level;
3660                 struct btrfs_key first_key;
3661
3662                 first_key.objectid = 0;
3663
3664                 if (nritems > 0)
3665                         btrfs_item_key_to_cpu(buf, &first_key, 0);
3666                 level = btrfs_header_level(buf);
3667                 for (i = 0; i < nritems; i++) {
3668                         u64 ptr = btrfs_node_blockptr(buf, i);
3669                         u32 size = btrfs_level_size(root, level - 1);
3670                         btrfs_node_key_to_cpu(buf, &key, i);
3671                         ret = add_extent_rec(extent_cache, &key,
3672                                              ptr, size, 0, 0, 1, 0, 1, 0,
3673                                              size);
3674                         BUG_ON(ret);
3675
3676                         add_tree_backref(extent_cache, ptr, parent, owner, 1);
3677
3678                         if (level > 1) {
3679                                 add_pending(nodes, seen, ptr, size);
3680                         } else {
3681                                 add_pending(pending, seen, ptr, size);
3682                         }
3683                 }
3684                 btree_space_waste += (BTRFS_NODEPTRS_PER_BLOCK(root) -
3685                                       nritems) * sizeof(struct btrfs_key_ptr);
3686         }
3687         total_btree_bytes += buf->len;
3688         if (fs_root_objectid(btrfs_header_owner(buf)))
3689                 total_fs_tree_bytes += buf->len;
3690         if (btrfs_header_owner(buf) == BTRFS_EXTENT_TREE_OBJECTID)
3691                 total_extent_tree_bytes += buf->len;
3692         if (!found_old_backref &&
3693             btrfs_header_owner(buf) == BTRFS_TREE_RELOC_OBJECTID &&
3694             btrfs_header_backref_rev(buf) == BTRFS_MIXED_BACKREF_REV &&
3695             !btrfs_header_flag(buf, BTRFS_HEADER_FLAG_RELOC))
3696                 found_old_backref = 1;
3697 out:
3698         free_extent_buffer(buf);
3699         return 0;
3700 }
3701
3702 static int add_root_to_pending(struct extent_buffer *buf,
3703                                struct cache_tree *extent_cache,
3704                                struct cache_tree *pending,
3705                                struct cache_tree *seen,
3706                                struct cache_tree *nodes,
3707                                struct btrfs_key *root_key)
3708 {
3709         if (btrfs_header_level(buf) > 0)
3710                 add_pending(nodes, seen, buf->start, buf->len);
3711         else
3712                 add_pending(pending, seen, buf->start, buf->len);
3713         add_extent_rec(extent_cache, NULL, buf->start, buf->len,
3714                        0, 1, 1, 0, 1, 0, buf->len);
3715
3716         if (root_key->objectid == BTRFS_TREE_RELOC_OBJECTID ||
3717             btrfs_header_backref_rev(buf) < BTRFS_MIXED_BACKREF_REV)
3718                 add_tree_backref(extent_cache, buf->start, buf->start,
3719                                  0, 1);
3720         else
3721                 add_tree_backref(extent_cache, buf->start, 0,
3722                                  root_key->objectid, 1);
3723         return 0;
3724 }
3725
3726 /* as we fix the tree, we might be deleting blocks that
3727  * we're tracking for repair.  This hook makes sure we
3728  * remove any backrefs for blocks as we are fixing them.
3729  */
3730 static int free_extent_hook(struct btrfs_trans_handle *trans,
3731                             struct btrfs_root *root,
3732                             u64 bytenr, u64 num_bytes, u64 parent,
3733                             u64 root_objectid, u64 owner, u64 offset,
3734                             int refs_to_drop)
3735 {
3736         struct extent_record *rec;
3737         struct cache_extent *cache;
3738         int is_data;
3739         struct cache_tree *extent_cache = root->fs_info->fsck_extent_cache;
3740
3741         is_data = owner >= BTRFS_FIRST_FREE_OBJECTID;
3742         cache = lookup_cache_extent(extent_cache, bytenr, num_bytes);
3743         if (!cache)
3744                 return 0;
3745
3746         rec = container_of(cache, struct extent_record, cache);
3747         if (is_data) {
3748                 struct data_backref *back;
3749                 back = find_data_backref(rec, parent, root_objectid, owner,
3750                                          offset, 1, bytenr, num_bytes);
3751                 if (!back)
3752                         goto out;
3753                 if (back->node.found_ref) {
3754                         back->found_ref -= refs_to_drop;
3755                         if (rec->refs)
3756                                 rec->refs -= refs_to_drop;
3757                 }
3758                 if (back->node.found_extent_tree) {
3759                         back->num_refs -= refs_to_drop;
3760                         if (rec->extent_item_refs)
3761                                 rec->extent_item_refs -= refs_to_drop;
3762                 }
3763                 if (back->found_ref == 0)
3764                         back->node.found_ref = 0;
3765                 if (back->num_refs == 0)
3766                         back->node.found_extent_tree = 0;
3767
3768                 if (!back->node.found_extent_tree && back->node.found_ref) {
3769                         list_del(&back->node.list);
3770                         free(back);
3771                 }
3772         } else {
3773                 struct tree_backref *back;
3774                 back = find_tree_backref(rec, parent, root_objectid);
3775                 if (!back)
3776                         goto out;
3777                 if (back->node.found_ref) {
3778                         if (rec->refs)
3779                                 rec->refs--;
3780                         back->node.found_ref = 0;
3781                 }
3782                 if (back->node.found_extent_tree) {
3783                         if (rec->extent_item_refs)
3784                                 rec->extent_item_refs--;
3785                         back->node.found_extent_tree = 0;
3786                 }
3787                 if (!back->node.found_extent_tree && back->node.found_ref) {
3788                         list_del(&back->node.list);
3789                         free(back);
3790                 }
3791         }
3792         maybe_free_extent_rec(extent_cache, rec);
3793 out:
3794         return 0;
3795 }
3796
3797 static int delete_extent_records(struct btrfs_trans_handle *trans,
3798                                  struct btrfs_root *root,
3799                                  struct btrfs_path *path,
3800                                  u64 bytenr, u64 new_len)
3801 {
3802         struct btrfs_key key;
3803         struct btrfs_key found_key;
3804         struct extent_buffer *leaf;
3805         int ret;
3806         int slot;
3807
3808
3809         key.objectid = bytenr;
3810         key.type = (u8)-1;
3811         key.offset = (u64)-1;
3812
3813         while(1) {
3814                 ret = btrfs_search_slot(trans, root->fs_info->extent_root,
3815                                         &key, path, 0, 1);
3816                 if (ret < 0)
3817                         break;
3818
3819                 if (ret > 0) {
3820                         ret = 0;
3821                         if (path->slots[0] == 0)
3822                                 break;
3823                         path->slots[0]--;
3824                 }
3825                 ret = 0;
3826
3827                 leaf = path->nodes[0];
3828                 slot = path->slots[0];
3829
3830                 btrfs_item_key_to_cpu(leaf, &found_key, slot);
3831                 if (found_key.objectid != bytenr)
3832                         break;
3833
3834                 if (found_key.type != BTRFS_EXTENT_ITEM_KEY &&
3835                     found_key.type != BTRFS_METADATA_ITEM_KEY &&
3836                     found_key.type != BTRFS_TREE_BLOCK_REF_KEY &&
3837                     found_key.type != BTRFS_EXTENT_DATA_REF_KEY &&
3838                     found_key.type != BTRFS_EXTENT_REF_V0_KEY &&
3839                     found_key.type != BTRFS_SHARED_BLOCK_REF_KEY &&
3840                     found_key.type != BTRFS_SHARED_DATA_REF_KEY) {
3841                         btrfs_release_path(path);
3842                         if (found_key.type == 0) {
3843                                 if (found_key.offset == 0)
3844                                         break;
3845                                 key.offset = found_key.offset - 1;
3846                                 key.type = found_key.type;
3847                         }
3848                         key.type = found_key.type - 1;
3849                         key.offset = (u64)-1;
3850                         continue;
3851                 }
3852
3853                 fprintf(stderr, "repair deleting extent record: key %Lu %u %Lu\n",
3854                         found_key.objectid, found_key.type, found_key.offset);
3855
3856                 ret = btrfs_del_item(trans, root->fs_info->extent_root, path);
3857                 if (ret)
3858                         break;
3859                 btrfs_release_path(path);
3860
3861                 if (found_key.type == BTRFS_EXTENT_ITEM_KEY ||
3862                     found_key.type == BTRFS_METADATA_ITEM_KEY) {
3863                         u64 bytes = (found_key.type == BTRFS_EXTENT_ITEM_KEY) ?
3864                                 found_key.offset : root->leafsize;
3865
3866                         ret = btrfs_update_block_group(trans, root, bytenr,
3867                                                        bytes, 0, 0);
3868                         if (ret)
3869                                 break;
3870                 }
3871         }
3872
3873         btrfs_release_path(path);
3874         return ret;
3875 }
3876
3877 /*
3878  * for a single backref, this will allocate a new extent
3879  * and add the backref to it.
3880  */
3881 static int record_extent(struct btrfs_trans_handle *trans,
3882                          struct btrfs_fs_info *info,
3883                          struct btrfs_path *path,
3884                          struct extent_record *rec,
3885                          struct extent_backref *back,
3886                          int allocated, u64 flags)
3887 {
3888         int ret;
3889         struct btrfs_root *extent_root = info->extent_root;
3890         struct extent_buffer *leaf;
3891         struct btrfs_key ins_key;
3892         struct btrfs_extent_item *ei;
3893         struct tree_backref *tback;
3894         struct data_backref *dback;
3895         struct btrfs_tree_block_info *bi;
3896
3897         if (!back->is_data)
3898                 rec->max_size = max_t(u64, rec->max_size,
3899                                     info->extent_root->leafsize);
3900
3901         if (!allocated) {
3902                 u32 item_size = sizeof(*ei);
3903
3904                 if (!back->is_data)
3905                         item_size += sizeof(*bi);
3906
3907                 ins_key.objectid = rec->start;
3908                 ins_key.offset = rec->max_size;
3909                 ins_key.type = BTRFS_EXTENT_ITEM_KEY;
3910
3911                 ret = btrfs_insert_empty_item(trans, extent_root, path,
3912                                         &ins_key, item_size);
3913                 if (ret)
3914                         goto fail;
3915
3916                 leaf = path->nodes[0];
3917                 ei = btrfs_item_ptr(leaf, path->slots[0],
3918                                     struct btrfs_extent_item);
3919
3920                 btrfs_set_extent_refs(leaf, ei, 0);
3921                 btrfs_set_extent_generation(leaf, ei, rec->generation);
3922
3923                 if (back->is_data) {
3924                         btrfs_set_extent_flags(leaf, ei,
3925                                                BTRFS_EXTENT_FLAG_DATA);
3926                 } else {
3927                         struct btrfs_disk_key copy_key;;
3928
3929                         tback = (struct tree_backref *)back;
3930                         bi = (struct btrfs_tree_block_info *)(ei + 1);
3931                         memset_extent_buffer(leaf, 0, (unsigned long)bi,
3932                                              sizeof(*bi));
3933                         memset(&copy_key, 0, sizeof(copy_key));
3934
3935                         copy_key.objectid = le64_to_cpu(rec->info_objectid);
3936                         btrfs_set_tree_block_level(leaf, bi, rec->info_level);
3937                         btrfs_set_tree_block_key(leaf, bi, &copy_key);
3938
3939                         btrfs_set_extent_flags(leaf, ei,
3940                                                BTRFS_EXTENT_FLAG_TREE_BLOCK | flags);
3941                 }
3942
3943                 btrfs_mark_buffer_dirty(leaf);
3944                 ret = btrfs_update_block_group(trans, extent_root, rec->start,
3945                                                rec->max_size, 1, 0);
3946                 if (ret)
3947                         goto fail;
3948                 btrfs_release_path(path);
3949         }
3950
3951         if (back->is_data) {
3952                 u64 parent;
3953                 int i;
3954
3955                 dback = (struct data_backref *)back;
3956                 if (back->full_backref)
3957                         parent = dback->parent;
3958                 else
3959                         parent = 0;
3960
3961                 for (i = 0; i < dback->found_ref; i++) {
3962                         /* if parent != 0, we're doing a full backref
3963                          * passing BTRFS_FIRST_FREE_OBJECTID as the owner
3964                          * just makes the backref allocator create a data
3965                          * backref
3966                          */
3967                         ret = btrfs_inc_extent_ref(trans, info->extent_root,
3968                                                    rec->start, rec->max_size,
3969                                                    parent,
3970                                                    dback->root,
3971                                                    parent ?
3972                                                    BTRFS_FIRST_FREE_OBJECTID :
3973                                                    dback->owner,
3974                                                    dback->offset);
3975                         if (ret)
3976                                 break;
3977                 }
3978                 fprintf(stderr, "adding new data backref"
3979                                 " on %llu %s %llu owner %llu"
3980                                 " offset %llu found %d\n",
3981                                 (unsigned long long)rec->start,
3982                                 back->full_backref ?
3983                                 "parent" : "root",
3984                                 back->full_backref ?
3985                                 (unsigned long long)parent :
3986                                 (unsigned long long)dback->root,
3987                                 (unsigned long long)dback->owner,
3988                                 (unsigned long long)dback->offset,
3989                                 dback->found_ref);
3990         } else {
3991                 u64 parent;
3992
3993                 tback = (struct tree_backref *)back;
3994                 if (back->full_backref)
3995                         parent = tback->parent;
3996                 else
3997                         parent = 0;
3998
3999                 ret = btrfs_inc_extent_ref(trans, info->extent_root,
4000                                            rec->start, rec->max_size,
4001                                            parent, tback->root, 0, 0);
4002                 fprintf(stderr, "adding new tree backref on "
4003                         "start %llu len %llu parent %llu root %llu\n",
4004                         rec->start, rec->max_size, tback->parent, tback->root);
4005         }
4006         if (ret)
4007                 goto fail;
4008 fail:
4009         btrfs_release_path(path);
4010         return ret;
4011 }
4012
4013 struct extent_entry {
4014         u64 bytenr;
4015         u64 bytes;
4016         int count;
4017         struct list_head list;
4018 };
4019
4020 static struct extent_entry *find_entry(struct list_head *entries,
4021                                        u64 bytenr, u64 bytes)
4022 {
4023         struct extent_entry *entry = NULL;
4024
4025         list_for_each_entry(entry, entries, list) {
4026                 if (entry->bytenr == bytenr && entry->bytes == bytes)
4027                         return entry;
4028         }
4029
4030         return NULL;
4031 }
4032
4033 static struct extent_entry *find_most_right_entry(struct list_head *entries)
4034 {
4035         struct extent_entry *entry, *best = NULL, *prev = NULL;
4036
4037         list_for_each_entry(entry, entries, list) {
4038                 if (!prev) {
4039                         prev = entry;
4040                         continue;
4041                 }
4042
4043                 /*
4044                  * If our current entry == best then we can't be sure our best
4045                  * is really the best, so we need to keep searching.
4046                  */
4047                 if (best && best->count == entry->count) {
4048                         prev = entry;
4049                         best = NULL;
4050                         continue;
4051                 }
4052
4053                 /* Prev == entry, not good enough, have to keep searching */
4054                 if (prev->count == entry->count)
4055                         continue;
4056
4057                 if (!best)
4058                         best = (prev->count > entry->count) ? prev : entry;
4059                 else if (best->count < entry->count)
4060                         best = entry;
4061                 prev = entry;
4062         }
4063
4064         return best;
4065 }
4066
4067 static int repair_ref(struct btrfs_trans_handle *trans,
4068                       struct btrfs_fs_info *info, struct btrfs_path *path,
4069                       struct data_backref *dback, struct extent_entry *entry)
4070 {
4071         struct btrfs_root *root;
4072         struct btrfs_file_extent_item *fi;
4073         struct extent_buffer *leaf;
4074         struct btrfs_key key;
4075         u64 bytenr, bytes;
4076         int ret;
4077
4078         key.objectid = dback->root;
4079         key.type = BTRFS_ROOT_ITEM_KEY;
4080         key.offset = (u64)-1;
4081         root = btrfs_read_fs_root(info, &key);
4082         if (IS_ERR(root)) {
4083                 fprintf(stderr, "Couldn't find root for our ref\n");
4084                 return -EINVAL;
4085         }
4086
4087         /*
4088          * The backref points to the original offset of the extent if it was
4089          * split, so we need to search down to the offset we have and then walk
4090          * forward until we find the backref we're looking for.
4091          */
4092         key.objectid = dback->owner;
4093         key.type = BTRFS_EXTENT_DATA_KEY;
4094         key.offset = dback->offset;
4095         ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
4096         if (ret < 0) {
4097                 fprintf(stderr, "Error looking up ref %d\n", ret);
4098                 return ret;
4099         }
4100
4101         while (1) {
4102                 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) {
4103                         ret = btrfs_next_leaf(root, path);
4104                         if (ret) {
4105                                 fprintf(stderr, "Couldn't find our ref, next\n");
4106                                 return -EINVAL;
4107                         }
4108                 }
4109                 leaf = path->nodes[0];
4110                 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
4111                 if (key.objectid != dback->owner ||
4112                     key.type != BTRFS_EXTENT_DATA_KEY) {
4113                         fprintf(stderr, "Couldn't find our ref, search\n");
4114                         return -EINVAL;
4115                 }
4116                 fi = btrfs_item_ptr(leaf, path->slots[0],
4117                                     struct btrfs_file_extent_item);
4118                 bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
4119                 bytes = btrfs_file_extent_disk_num_bytes(leaf, fi);
4120
4121                 if (bytenr == dback->disk_bytenr && bytes == dback->bytes)
4122                         break;
4123                 path->slots[0]++;
4124         }
4125
4126         btrfs_release_path(path);
4127
4128         /*
4129          * Have to make sure that this root gets updated when we commit the
4130          * transaction
4131          */
4132         root->track_dirty = 1;
4133         if (root->last_trans != trans->transid) {
4134                 root->last_trans = trans->transid;
4135                 root->commit_root = root->node;
4136                 extent_buffer_get(root->node);
4137         }
4138
4139         /*
4140          * Ok we have the key of the file extent we want to fix, now we can cow
4141          * down to the thing and fix it.
4142          */
4143         ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
4144         if (ret < 0) {
4145                 fprintf(stderr, "Error cowing down to ref [%Lu, %u, %Lu]: %d\n",
4146                         key.objectid, key.type, key.offset, ret);
4147                 return ret;
4148         }
4149         if (ret > 0) {
4150                 fprintf(stderr, "Well that's odd, we just found this key "
4151                         "[%Lu, %u, %Lu]\n", key.objectid, key.type,
4152                         key.offset);
4153                 return -EINVAL;
4154         }
4155         leaf = path->nodes[0];
4156         fi = btrfs_item_ptr(leaf, path->slots[0],
4157                             struct btrfs_file_extent_item);
4158
4159         if (btrfs_file_extent_compression(leaf, fi) &&
4160             dback->disk_bytenr != entry->bytenr) {
4161                 fprintf(stderr, "Ref doesn't match the record start and is "
4162                         "compressed, please take a btrfs-image of this file "
4163                         "system and send it to a btrfs developer so they can "
4164                         "complete this functionality for bytenr %Lu\n",
4165                         dback->disk_bytenr);
4166                 return -EINVAL;
4167         }
4168
4169         if (dback->disk_bytenr > entry->bytenr) {
4170                 u64 off_diff, offset;
4171
4172                 off_diff = dback->disk_bytenr - entry->bytenr;
4173                 offset = btrfs_file_extent_offset(leaf, fi);
4174                 if (dback->disk_bytenr + offset +
4175                     btrfs_file_extent_num_bytes(leaf, fi) >
4176                     entry->bytenr + entry->bytes) {
4177                         fprintf(stderr, "Ref is past the entry end, please "
4178                                 "take a btrfs-image of this file system and "
4179                                 "send it to a btrfs developer, ref %Lu\n",
4180                                 dback->disk_bytenr);
4181                         return -EINVAL;
4182                 }
4183                 offset += off_diff;
4184                 btrfs_set_file_extent_disk_bytenr(leaf, fi, entry->bytenr);
4185                 btrfs_set_file_extent_offset(leaf, fi, offset);
4186         } else if (dback->disk_bytenr < entry->bytenr) {
4187                 u64 offset;
4188
4189                 offset = btrfs_file_extent_offset(leaf, fi);
4190                 if (dback->disk_bytenr + offset < entry->bytenr) {
4191                         fprintf(stderr, "Ref is before the entry start, please"
4192                                 " take a btrfs-image of this file system and "
4193                                 "send it to a btrfs developer, ref %Lu\n",
4194                                 dback->disk_bytenr);
4195                         return -EINVAL;
4196                 }
4197
4198                 offset += dback->disk_bytenr;
4199                 offset -= entry->bytenr;
4200                 btrfs_set_file_extent_disk_bytenr(leaf, fi, entry->bytenr);
4201                 btrfs_set_file_extent_offset(leaf, fi, offset);
4202         }
4203
4204         btrfs_set_file_extent_disk_num_bytes(leaf, fi, entry->bytes);
4205
4206         /*
4207          * Chances are if disk_num_bytes were wrong then so is ram_bytes, but
4208          * only do this if we aren't using compression, otherwise it's a
4209          * trickier case.
4210          */
4211         if (!btrfs_file_extent_compression(leaf, fi))
4212                 btrfs_set_file_extent_ram_bytes(leaf, fi, entry->bytes);
4213         else
4214                 printf("ram bytes may be wrong?\n");
4215         btrfs_mark_buffer_dirty(leaf);
4216         btrfs_release_path(path);
4217         return 0;
4218 }
4219
4220 static int verify_backrefs(struct btrfs_trans_handle *trans,
4221                            struct btrfs_fs_info *info, struct btrfs_path *path,
4222                            struct extent_record *rec)
4223 {
4224         struct extent_backref *back;
4225         struct data_backref *dback;
4226         struct extent_entry *entry, *best = NULL;
4227         LIST_HEAD(entries);
4228         int nr_entries = 0;
4229         int ret = 0;
4230
4231         /*
4232          * Metadata is easy and the backrefs should always agree on bytenr and
4233          * size, if not we've got bigger issues.
4234          */
4235         if (rec->metadata)
4236                 return 0;
4237
4238         list_for_each_entry(back, &rec->backrefs, list) {
4239                 dback = (struct data_backref *)back;
4240                 /*
4241                  * We only pay attention to backrefs that we found a real
4242                  * backref for.
4243                  */
4244                 if (dback->found_ref == 0)
4245                         continue;
4246                 if (back->full_backref)
4247                         continue;
4248
4249                 /*
4250                  * For now we only catch when the bytes don't match, not the
4251                  * bytenr.  We can easily do this at the same time, but I want
4252                  * to have a fs image to test on before we just add repair
4253                  * functionality willy-nilly so we know we won't screw up the
4254                  * repair.
4255                  */
4256
4257                 entry = find_entry(&entries, dback->disk_bytenr,
4258                                    dback->bytes);
4259                 if (!entry) {
4260                         entry = malloc(sizeof(struct extent_entry));
4261                         if (!entry) {
4262                                 ret = -ENOMEM;
4263                                 goto out;
4264                         }
4265                         memset(entry, 0, sizeof(*entry));
4266                         entry->bytenr = dback->disk_bytenr;
4267                         entry->bytes = dback->bytes;
4268                         list_add_tail(&entry->list, &entries);
4269                         nr_entries++;
4270                 }
4271                 entry->count++;
4272         }
4273
4274         /* Yay all the backrefs agree, carry on good sir */
4275         if (nr_entries <= 1)
4276                 goto out;
4277
4278         fprintf(stderr, "attempting to repair backref discrepency for bytenr "
4279                 "%Lu\n", rec->start);
4280
4281         /*
4282          * First we want to see if the backrefs can agree amongst themselves who
4283          * is right, so figure out which one of the entries has the highest
4284          * count.
4285          */
4286         best = find_most_right_entry(&entries);
4287
4288         /*
4289          * Ok so we may have an even split between what the backrefs think, so
4290          * this is where we use the extent ref to see what it thinks.
4291          */
4292         if (!best) {
4293                 entry = find_entry(&entries, rec->start, rec->nr);
4294                 if (!entry) {
4295                         fprintf(stderr, "Backrefs don't agree with eachother "
4296                                 "and extent record doesn't agree with anybody,"
4297                                 " so we can't fix bytenr %Lu bytes %Lu\n",
4298                                 rec->start, rec->nr);
4299                         ret = -EINVAL;
4300                         goto out;
4301                 }
4302                 entry->count++;
4303                 best = find_most_right_entry(&entries);
4304                 if (!best) {
4305                         fprintf(stderr, "Backrefs and extent record evenly "
4306                                 "split on who is right, this is going to "
4307                                 "require user input to fix bytenr %Lu bytes "
4308                                 "%Lu\n", rec->start, rec->nr);
4309                         ret = -EINVAL;
4310                         goto out;
4311                 }
4312         }
4313
4314         /*
4315          * I don't think this can happen currently as we'll abort() if we catch
4316          * this case higher up, but in case somebody removes that we still can't
4317          * deal with it properly here yet, so just bail out of that's the case.
4318          */
4319         if (best->bytenr != rec->start) {
4320                 fprintf(stderr, "Extent start and backref starts don't match, "
4321                         "please use btrfs-image on this file system and send "
4322                         "it to a btrfs developer so they can make fsck fix "
4323                         "this particular case.  bytenr is %Lu, bytes is %Lu\n",
4324                         rec->start, rec->nr);
4325                 ret = -EINVAL;
4326                 goto out;
4327         }
4328
4329         /*
4330          * Ok great we all agreed on an extent record, let's go find the real
4331          * references and fix up the ones that don't match.
4332          */
4333         list_for_each_entry(back, &rec->backrefs, list) {
4334                 dback = (struct data_backref *)back;
4335
4336                 /*
4337                  * Still ignoring backrefs that don't have a real ref attached
4338                  * to them.
4339                  */
4340                 if (dback->found_ref == 0)
4341                         continue;
4342                 if (back->full_backref)
4343                         continue;
4344
4345                 if (dback->bytes == best->bytes &&
4346                     dback->disk_bytenr == best->bytenr)
4347                         continue;
4348
4349                 ret = repair_ref(trans, info, path, dback, best);
4350                 if (ret)
4351                         goto out;
4352         }
4353
4354         /*
4355          * Ok we messed with the actual refs, which means we need to drop our
4356          * entire cache and go back and rescan.  I know this is a huge pain and
4357          * adds a lot of extra work, but it's the only way to be safe.  Once all
4358          * the backrefs agree we may not need to do anything to the extent
4359          * record itself.
4360          */
4361         ret = -EAGAIN;
4362 out:
4363         while (!list_empty(&entries)) {
4364                 entry = list_entry(entries.next, struct extent_entry, list);
4365                 list_del_init(&entry->list);
4366                 free(entry);
4367         }
4368         return ret;
4369 }
4370
4371 static int process_duplicates(struct btrfs_root *root,
4372                               struct cache_tree *extent_cache,
4373                               struct extent_record *rec)
4374 {
4375         struct extent_record *good, *tmp;
4376         struct cache_extent *cache;
4377         int ret;
4378
4379         /*
4380          * If we found a extent record for this extent then return, or if we
4381          * have more than one duplicate we are likely going to need to delete
4382          * something.
4383          */
4384         if (rec->found_rec || rec->num_duplicates > 1)
4385                 return 0;
4386
4387         /* Shouldn't happen but just in case */
4388         BUG_ON(!rec->num_duplicates);
4389
4390         /*
4391          * So this happens if we end up with a backref that doesn't match the
4392          * actual extent entry.  So either the backref is bad or the extent
4393          * entry is bad.  Either way we want to have the extent_record actually
4394          * reflect what we found in the extent_tree, so we need to take the
4395          * duplicate out and use that as the extent_record since the only way we
4396          * get a duplicate is if we find a real life BTRFS_EXTENT_ITEM_KEY.
4397          */
4398         remove_cache_extent(extent_cache, &rec->cache);
4399
4400         good = list_entry(rec->dups.next, struct extent_record, list);
4401         list_del_init(&good->list);
4402         INIT_LIST_HEAD(&good->backrefs);
4403         INIT_LIST_HEAD(&good->dups);
4404         good->cache.start = good->start;
4405         good->cache.size = good->nr;
4406         good->content_checked = 0;
4407         good->owner_ref_checked = 0;
4408         good->num_duplicates = 0;
4409         good->refs = rec->refs;
4410         list_splice_init(&rec->backrefs, &good->backrefs);
4411         while (1) {
4412                 cache = lookup_cache_extent(extent_cache, good->start,
4413                                             good->nr);
4414                 if (!cache)
4415                         break;
4416                 tmp = container_of(cache, struct extent_record, cache);
4417
4418                 /*
4419                  * If we find another overlapping extent and it's found_rec is
4420                  * set then it's a duplicate and we need to try and delete
4421                  * something.
4422                  */
4423                 if (tmp->found_rec || tmp->num_duplicates > 0) {
4424                         if (list_empty(&good->list))
4425                                 list_add_tail(&good->list,
4426                                               &duplicate_extents);
4427                         good->num_duplicates += tmp->num_duplicates + 1;
4428                         list_splice_init(&tmp->dups, &good->dups);
4429                         list_del_init(&tmp->list);
4430                         list_add_tail(&tmp->list, &good->dups);
4431                         remove_cache_extent(extent_cache, &tmp->cache);
4432                         continue;
4433                 }
4434
4435                 /*
4436                  * Ok we have another non extent item backed extent rec, so lets
4437                  * just add it to this extent and carry on like we did above.
4438                  */
4439                 good->refs += tmp->refs;
4440                 list_splice_init(&tmp->backrefs, &good->backrefs);
4441                 remove_cache_extent(extent_cache, &tmp->cache);
4442                 free(tmp);
4443         }
4444         ret = insert_cache_extent(extent_cache, &good->cache);
4445         BUG_ON(ret);
4446         free(rec);
4447         return good->num_duplicates ? 0 : 1;
4448 }
4449
4450 static int delete_duplicate_records(struct btrfs_trans_handle *trans,
4451                                     struct btrfs_root *root,
4452                                     struct extent_record *rec)
4453 {
4454         LIST_HEAD(delete_list);
4455         struct btrfs_path *path;
4456         struct extent_record *tmp, *good, *n;
4457         int nr_del = 0;
4458         int ret = 0;
4459         struct btrfs_key key;
4460
4461         path = btrfs_alloc_path();
4462         if (!path) {
4463                 ret = -ENOMEM;
4464                 goto out;
4465         }
4466
4467         good = rec;
4468         /* Find the record that covers all of the duplicates. */
4469         list_for_each_entry(tmp, &rec->dups, list) {
4470                 if (good->start < tmp->start)
4471                         continue;
4472                 if (good->nr > tmp->nr)
4473                         continue;
4474
4475                 if (tmp->start + tmp->nr < good->start + good->nr) {
4476                         fprintf(stderr, "Ok we have overlapping extents that "
4477                                 "aren't completely covered by eachother, this "
4478                                 "is going to require more careful thought.  "
4479                                 "The extents are [%Lu-%Lu] and [%Lu-%Lu]\n",
4480                                 tmp->start, tmp->nr, good->start, good->nr);
4481                         abort();
4482                 }
4483                 good = tmp;
4484         }
4485
4486         if (good != rec)
4487                 list_add_tail(&rec->list, &delete_list);
4488
4489         list_for_each_entry_safe(tmp, n, &rec->dups, list) {
4490                 if (tmp == good)
4491                         continue;
4492                 list_move_tail(&tmp->list, &delete_list);
4493         }
4494
4495         root = root->fs_info->extent_root;
4496         list_for_each_entry(tmp, &delete_list, list) {
4497                 if (tmp->found_rec == 0)
4498                         continue;
4499                 key.objectid = tmp->start;
4500                 key.type = BTRFS_EXTENT_ITEM_KEY;
4501                 key.offset = tmp->nr;
4502
4503                 /* Shouldn't happen but just in case */
4504                 if (tmp->metadata) {
4505                         fprintf(stderr, "Well this shouldn't happen, extent "
4506                                 "record overlaps but is metadata? "
4507                                 "[%Lu, %Lu]\n", tmp->start, tmp->nr);
4508                         abort();
4509                 }
4510
4511                 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
4512                 if (ret) {
4513                         if (ret > 0)
4514                                 ret = -EINVAL;
4515                         goto out;
4516                 }
4517                 ret = btrfs_del_item(trans, root, path);
4518                 if (ret)
4519                         goto out;
4520                 btrfs_release_path(path);
4521                 nr_del++;
4522         }
4523
4524 out:
4525         while (!list_empty(&delete_list)) {
4526                 tmp = list_entry(delete_list.next, struct extent_record, list);
4527                 list_del_init(&tmp->list);
4528                 if (tmp == rec)
4529                         continue;
4530                 free(tmp);
4531         }
4532
4533         while (!list_empty(&rec->dups)) {
4534                 tmp = list_entry(rec->dups.next, struct extent_record, list);
4535                 list_del_init(&tmp->list);
4536                 free(tmp);
4537         }
4538
4539         btrfs_free_path(path);
4540
4541         if (!ret && !nr_del)
4542                 rec->num_duplicates = 0;
4543
4544         return ret ? ret : nr_del;
4545 }
4546
4547 /*
4548  * when an incorrect extent item is found, this will delete
4549  * all of the existing entries for it and recreate them
4550  * based on what the tree scan found.
4551  */
4552 static int fixup_extent_refs(struct btrfs_trans_handle *trans,
4553                              struct btrfs_fs_info *info,
4554                              struct extent_record *rec)
4555 {
4556         int ret;
4557         struct btrfs_path *path;
4558         struct list_head *cur = rec->backrefs.next;
4559         struct cache_extent *cache;
4560         struct extent_backref *back;
4561         int allocated = 0;
4562         u64 flags = 0;
4563
4564         /* remember our flags for recreating the extent */
4565         ret = btrfs_lookup_extent_info(NULL, info->extent_root, rec->start,
4566                                        rec->max_size, rec->metadata, NULL,
4567                                        &flags);
4568         if (ret < 0)
4569                 flags = BTRFS_BLOCK_FLAG_FULL_BACKREF;
4570
4571         path = btrfs_alloc_path();
4572         if (!path)
4573                 return -ENOMEM;
4574
4575         /* step one, make sure all of the backrefs agree */
4576         ret = verify_backrefs(trans, info, path, rec);
4577         if (ret < 0)
4578                 goto out;
4579
4580         /* step two, delete all the existing records */
4581         ret = delete_extent_records(trans, info->extent_root, path,
4582                                     rec->start, rec->max_size);
4583
4584         if (ret < 0)
4585                 goto out;
4586
4587         /* was this block corrupt?  If so, don't add references to it */
4588         cache = lookup_cache_extent(info->corrupt_blocks,
4589                                     rec->start, rec->max_size);
4590         if (cache) {
4591                 ret = 0;
4592                 goto out;
4593         }
4594
4595         /* step three, recreate all the refs we did find */
4596         while(cur != &rec->backrefs) {
4597                 back = list_entry(cur, struct extent_backref, list);
4598                 cur = cur->next;
4599
4600                 /*
4601                  * if we didn't find any references, don't create a
4602                  * new extent record
4603                  */
4604                 if (!back->found_ref)
4605                         continue;
4606
4607                 ret = record_extent(trans, info, path, rec, back, allocated, flags);
4608                 allocated = 1;
4609
4610                 if (ret)
4611                         goto out;
4612         }
4613 out:
4614         btrfs_free_path(path);
4615         return ret;
4616 }
4617
4618 /* right now we only prune from the extent allocation tree */
4619 static int prune_one_block(struct btrfs_trans_handle *trans,
4620                            struct btrfs_fs_info *info,
4621                            struct btrfs_corrupt_block *corrupt)
4622 {
4623         int ret;
4624         struct btrfs_path path;
4625         struct extent_buffer *eb;
4626         u64 found;
4627         int slot;
4628         int nritems;
4629         int level = corrupt->level + 1;
4630
4631         btrfs_init_path(&path);
4632 again:
4633         /* we want to stop at the parent to our busted block */
4634         path.lowest_level = level;
4635
4636         ret = btrfs_search_slot(trans, info->extent_root,
4637                                 &corrupt->key, &path, -1, 1);
4638
4639         if (ret < 0)
4640                 goto out;
4641
4642         eb = path.nodes[level];
4643         if (!eb) {
4644                 ret = -ENOENT;
4645                 goto out;
4646         }
4647
4648         /*
4649          * hopefully the search gave us the block we want to prune,
4650          * lets try that first
4651          */
4652         slot = path.slots[level];
4653         found =  btrfs_node_blockptr(eb, slot);
4654         if (found == corrupt->cache.start)
4655                 goto del_ptr;
4656
4657         nritems = btrfs_header_nritems(eb);
4658
4659         /* the search failed, lets scan this node and hope we find it */
4660         for (slot = 0; slot < nritems; slot++) {
4661                 found =  btrfs_node_blockptr(eb, slot);
4662                 if (found == corrupt->cache.start)
4663                         goto del_ptr;
4664         }
4665         /*
4666          * we couldn't find the bad block.  TODO, search all the nodes for pointers
4667          * to this block
4668          */
4669         if (eb == info->extent_root->node) {
4670                 ret = -ENOENT;
4671                 goto out;
4672         } else {
4673                 level++;
4674                 btrfs_release_path(&path);
4675                 goto again;
4676         }
4677
4678 del_ptr:
4679         printk("deleting pointer to block %Lu\n", corrupt->cache.start);
4680         ret = btrfs_del_ptr(trans, info->extent_root, &path, level, slot);
4681
4682 out:
4683         btrfs_release_path(&path);
4684         return ret;
4685 }
4686
4687 static int prune_corrupt_blocks(struct btrfs_trans_handle *trans,
4688                                 struct btrfs_fs_info *info)
4689 {
4690         struct cache_extent *cache;
4691         struct btrfs_corrupt_block *corrupt;
4692
4693         cache = search_cache_extent(info->corrupt_blocks, 0);
4694         while (1) {
4695                 if (!cache)
4696                         break;
4697                 corrupt = container_of(cache, struct btrfs_corrupt_block, cache);
4698                 prune_one_block(trans, info, corrupt);
4699                 cache = next_cache_extent(cache);
4700         }
4701         return 0;
4702 }
4703
4704 static void free_corrupt_block(struct cache_extent *cache)
4705 {
4706         struct btrfs_corrupt_block *corrupt;
4707
4708         corrupt = container_of(cache, struct btrfs_corrupt_block, cache);
4709         free(corrupt);
4710 }
4711
4712 FREE_EXTENT_CACHE_BASED_TREE(corrupt_blocks, free_corrupt_block);
4713
4714 static int check_block_group(struct btrfs_trans_handle *trans,
4715                               struct btrfs_fs_info *info,
4716                               struct map_lookup *map,
4717                               int *reinit)
4718 {
4719         struct btrfs_key key;
4720         struct btrfs_path path;
4721         int ret;
4722
4723         key.objectid = map->ce.start;
4724         key.offset = map->ce.size;
4725         key.type = BTRFS_BLOCK_GROUP_ITEM_KEY;
4726
4727         btrfs_init_path(&path);
4728         ret = btrfs_search_slot(NULL, info->extent_root,
4729                                 &key, &path, 0, 0);
4730         btrfs_release_path(&path);
4731         if (ret <= 0)
4732                 goto out;
4733
4734         ret = btrfs_make_block_group(trans, info->extent_root, 0, map->type,
4735                                BTRFS_FIRST_CHUNK_TREE_OBJECTID,
4736                                key.objectid, key.offset);
4737         *reinit = 1;
4738 out:
4739         return ret;
4740 }
4741
4742 static int check_block_groups(struct btrfs_trans_handle *trans,
4743                               struct btrfs_fs_info *info, int *reinit)
4744 {
4745         struct cache_extent *ce;
4746         struct map_lookup *map;
4747         struct btrfs_mapping_tree *map_tree = &info->mapping_tree;
4748
4749         /* this isn't quite working */
4750         return 0;
4751
4752         ce = search_cache_extent(&map_tree->cache_tree, 0);
4753         while (1) {
4754                 if (!ce)
4755                         break;
4756                 map = container_of(ce, struct map_lookup, ce);
4757                 check_block_group(trans, info, map, reinit);
4758                 ce = next_cache_extent(ce);
4759         }
4760         return 0;
4761 }
4762
4763 static void reset_cached_block_groups(struct btrfs_fs_info *fs_info)
4764 {
4765         struct btrfs_block_group_cache *cache;
4766         u64 start, end;
4767         int ret;
4768
4769         while (1) {
4770                 ret = find_first_extent_bit(&fs_info->free_space_cache, 0,
4771                                             &start, &end, EXTENT_DIRTY);
4772                 if (ret)
4773                         break;
4774                 clear_extent_dirty(&fs_info->free_space_cache, start, end,
4775                                    GFP_NOFS);
4776         }
4777
4778         start = 0;
4779         while (1) {
4780                 cache = btrfs_lookup_first_block_group(fs_info, start);
4781                 if (!cache)
4782                         break;
4783                 if (cache->cached)
4784                         cache->cached = 0;
4785                 start = cache->key.objectid + cache->key.offset;
4786         }
4787 }
4788
4789 static int check_extent_refs(struct btrfs_trans_handle *trans,
4790                              struct btrfs_root *root,
4791                              struct cache_tree *extent_cache, int repair)
4792 {
4793         struct extent_record *rec;
4794         struct cache_extent *cache;
4795         int err = 0;
4796         int ret = 0;
4797         int fixed = 0;
4798         int reinit = 0;
4799         int had_dups = 0;
4800
4801         if (repair) {
4802                 /*
4803                  * if we're doing a repair, we have to make sure
4804                  * we don't allocate from the problem extents.
4805                  * In the worst case, this will be all the
4806                  * extents in the FS
4807                  */
4808                 cache = search_cache_extent(extent_cache, 0);
4809                 while(cache) {
4810                         rec = container_of(cache, struct extent_record, cache);
4811                         btrfs_pin_extent(root->fs_info,
4812                                          rec->start, rec->max_size);
4813                         cache = next_cache_extent(cache);
4814                 }
4815
4816                 /* pin down all the corrupted blocks too */
4817                 cache = search_cache_extent(root->fs_info->corrupt_blocks, 0);
4818                 while(cache) {
4819                         btrfs_pin_extent(root->fs_info,
4820                                          cache->start, cache->size);
4821                         cache = next_cache_extent(cache);
4822                 }
4823                 prune_corrupt_blocks(trans, root->fs_info);
4824                 check_block_groups(trans, root->fs_info, &reinit);
4825                 if (reinit)
4826                         btrfs_read_block_groups(root->fs_info->extent_root);
4827                 reset_cached_block_groups(root->fs_info);
4828         }
4829
4830         /*
4831          * We need to delete any duplicate entries we find first otherwise we
4832          * could mess up the extent tree when we have backrefs that actually
4833          * belong to a different extent item and not the weird duplicate one.
4834          */
4835         while (repair && !list_empty(&duplicate_extents)) {
4836                 rec = list_entry(duplicate_extents.next, struct extent_record,
4837                                  list);
4838                 list_del_init(&rec->list);
4839
4840                 /* Sometimes we can find a backref before we find an actual
4841                  * extent, so we need to process it a little bit to see if there
4842                  * truly are multiple EXTENT_ITEM_KEY's for the same range, or
4843                  * if this is a backref screwup.  If we need to delete stuff
4844                  * process_duplicates() will return 0, otherwise it will return
4845                  * 1 and we
4846                  */
4847                 if (process_duplicates(root, extent_cache, rec))
4848                         continue;
4849                 ret = delete_duplicate_records(trans, root, rec);
4850                 if (ret < 0)
4851                         return ret;
4852                 /*
4853                  * delete_duplicate_records will return the number of entries
4854                  * deleted, so if it's greater than 0 then we know we actually
4855                  * did something and we need to remove.
4856                  */
4857                 if (ret)
4858                         had_dups = 1;
4859         }
4860
4861         if (had_dups)
4862                 return -EAGAIN;
4863
4864         while(1) {
4865                 fixed = 0;
4866                 cache = search_cache_extent(extent_cache, 0);
4867                 if (!cache)
4868                         break;
4869                 rec = container_of(cache, struct extent_record, cache);
4870                 if (rec->num_duplicates) {
4871                         fprintf(stderr, "extent item %llu has multiple extent "
4872                                 "items\n", (unsigned long long)rec->start);
4873                         err = 1;
4874                 }
4875
4876                 if (rec->refs != rec->extent_item_refs) {
4877                         fprintf(stderr, "ref mismatch on [%llu %llu] ",
4878                                 (unsigned long long)rec->start,
4879                                 (unsigned long long)rec->nr);
4880                         fprintf(stderr, "extent item %llu, found %llu\n",
4881                                 (unsigned long long)rec->extent_item_refs,
4882                                 (unsigned long long)rec->refs);
4883                         if (!fixed && repair) {
4884                                 ret = fixup_extent_refs(trans, root->fs_info, rec);
4885                                 if (ret)
4886                                         goto repair_abort;
4887                                 fixed = 1;
4888                         }
4889                         err = 1;
4890
4891                 }
4892                 if (all_backpointers_checked(rec, 1)) {
4893                         fprintf(stderr, "backpointer mismatch on [%llu %llu]\n",
4894                                 (unsigned long long)rec->start,
4895                                 (unsigned long long)rec->nr);
4896
4897                         if (!fixed && repair) {
4898                                 ret = fixup_extent_refs(trans, root->fs_info, rec);
4899                                 if (ret)
4900                                         goto repair_abort;
4901                                 fixed = 1;
4902                         }
4903
4904                         err = 1;
4905                 }
4906                 if (!rec->owner_ref_checked) {
4907                         fprintf(stderr, "owner ref check failed [%llu %llu]\n",
4908                                 (unsigned long long)rec->start,
4909                                 (unsigned long long)rec->nr);
4910                         if (!fixed && repair) {
4911                                 ret = fixup_extent_refs(trans, root->fs_info, rec);
4912                                 if (ret)
4913                                         goto repair_abort;
4914                                 fixed = 1;
4915                         }
4916                         err = 1;
4917                 }
4918
4919                 remove_cache_extent(extent_cache, cache);
4920                 free_all_extent_backrefs(rec);
4921                 free(rec);
4922         }
4923 repair_abort:
4924         if (repair) {
4925                 if (ret && ret != -EAGAIN) {
4926                         fprintf(stderr, "failed to repair damaged filesystem, aborting\n");
4927                         exit(1);
4928                 } else if (!ret) {
4929                         btrfs_fix_block_accounting(trans, root);
4930                 }
4931                 if (err)
4932                         fprintf(stderr, "repaired damaged extent references\n");
4933                 return ret;
4934         }
4935         return err;
4936 }
4937
4938 u64 calc_stripe_length(u64 type, u64 length, int num_stripes)
4939 {
4940         u64 stripe_size;
4941
4942         if (type & BTRFS_BLOCK_GROUP_RAID0) {
4943                 stripe_size = length;
4944                 stripe_size /= num_stripes;
4945         } else if (type & BTRFS_BLOCK_GROUP_RAID10) {
4946                 stripe_size = length * 2;
4947                 stripe_size /= num_stripes;
4948         } else if (type & BTRFS_BLOCK_GROUP_RAID5) {
4949                 stripe_size = length;
4950                 stripe_size /= (num_stripes - 1);
4951         } else if (type & BTRFS_BLOCK_GROUP_RAID6) {
4952                 stripe_size = length;
4953                 stripe_size /= (num_stripes - 2);
4954         } else {
4955                 stripe_size = length;
4956         }
4957         return stripe_size;
4958 }
4959
4960 static int check_chunk_refs(struct chunk_record *chunk_rec,
4961                             struct block_group_tree *block_group_cache,
4962                             struct device_extent_tree *dev_extent_cache,
4963                             int silent)
4964 {
4965         struct cache_extent *block_group_item;
4966         struct block_group_record *block_group_rec;
4967         struct cache_extent *dev_extent_item;
4968         struct device_extent_record *dev_extent_rec;
4969         u64 devid;
4970         u64 offset;
4971         u64 length;
4972         int i;
4973         int ret = 0;
4974
4975         block_group_item = lookup_cache_extent(&block_group_cache->tree,
4976                                                chunk_rec->offset,
4977                                                chunk_rec->length);
4978         if (block_group_item) {
4979                 block_group_rec = container_of(block_group_item,
4980                                                struct block_group_record,
4981                                                cache);
4982                 if (chunk_rec->length != block_group_rec->offset ||
4983                     chunk_rec->offset != block_group_rec->objectid ||
4984                     chunk_rec->type_flags != block_group_rec->flags) {
4985                         if (!silent)
4986                                 fprintf(stderr,
4987                                         "Chunk[%llu, %u, %llu]: length(%llu), offset(%llu), type(%llu) mismatch with block group[%llu, %u, %llu]: offset(%llu), objectid(%llu), flags(%llu)\n",
4988                                         chunk_rec->objectid,
4989                                         chunk_rec->type,
4990                                         chunk_rec->offset,
4991                                         chunk_rec->length,
4992                                         chunk_rec->offset,
4993                                         chunk_rec->type_flags,
4994                                         block_group_rec->objectid,
4995                                         block_group_rec->type,
4996                                         block_group_rec->offset,
4997                                         block_group_rec->offset,
4998                                         block_group_rec->objectid,
4999                                         block_group_rec->flags);
5000                         ret = -1;
5001                 } else {
5002                         list_del_init(&block_group_rec->list);
5003                         chunk_rec->bg_rec = block_group_rec;
5004                 }
5005         } else {
5006                 if (!silent)
5007                         fprintf(stderr,
5008                                 "Chunk[%llu, %u, %llu]: length(%llu), offset(%llu), type(%llu) is not found in block group\n",
5009                                 chunk_rec->objectid,
5010                                 chunk_rec->type,
5011                                 chunk_rec->offset,
5012                                 chunk_rec->length,
5013                                 chunk_rec->offset,
5014                                 chunk_rec->type_flags);
5015                 ret = -1;
5016         }
5017
5018         length = calc_stripe_length(chunk_rec->type_flags, chunk_rec->length,
5019                                     chunk_rec->num_stripes);
5020         for (i = 0; i < chunk_rec->num_stripes; ++i) {
5021                 devid = chunk_rec->stripes[i].devid;
5022                 offset = chunk_rec->stripes[i].offset;
5023                 dev_extent_item = lookup_cache_extent2(&dev_extent_cache->tree,
5024                                                        devid, offset, length);
5025                 if (dev_extent_item) {
5026                         dev_extent_rec = container_of(dev_extent_item,
5027                                                 struct device_extent_record,
5028                                                 cache);
5029                         if (dev_extent_rec->objectid != devid ||
5030                             dev_extent_rec->offset != offset ||
5031                             dev_extent_rec->chunk_offset != chunk_rec->offset ||
5032                             dev_extent_rec->length != length) {
5033                                 if (!silent)
5034                                         fprintf(stderr,
5035                                                 "Chunk[%llu, %u, %llu] stripe[%llu, %llu] dismatch dev extent[%llu, %llu, %llu]\n",
5036                                                 chunk_rec->objectid,
5037                                                 chunk_rec->type,
5038                                                 chunk_rec->offset,
5039                                                 chunk_rec->stripes[i].devid,
5040                                                 chunk_rec->stripes[i].offset,
5041                                                 dev_extent_rec->objectid,
5042                                                 dev_extent_rec->offset,
5043                                                 dev_extent_rec->length);
5044                                 ret = -1;
5045                         } else {
5046                                 list_move(&dev_extent_rec->chunk_list,
5047                                           &chunk_rec->dextents);
5048                         }
5049                 } else {
5050                         if (!silent)
5051                                 fprintf(stderr,
5052                                         "Chunk[%llu, %u, %llu] stripe[%llu, %llu] is not found in dev extent\n",
5053                                         chunk_rec->objectid,
5054                                         chunk_rec->type,
5055                                         chunk_rec->offset,
5056                                         chunk_rec->stripes[i].devid,
5057                                         chunk_rec->stripes[i].offset);
5058                         ret = -1;
5059                 }
5060         }
5061         return ret;
5062 }
5063
5064 /* check btrfs_chunk -> btrfs_dev_extent / btrfs_block_group_item */
5065 int check_chunks(struct cache_tree *chunk_cache,
5066                  struct block_group_tree *block_group_cache,
5067                  struct device_extent_tree *dev_extent_cache,
5068                  struct list_head *good, struct list_head *bad, int silent)
5069 {
5070         struct cache_extent *chunk_item;
5071         struct chunk_record *chunk_rec;
5072         struct block_group_record *bg_rec;
5073         struct device_extent_record *dext_rec;
5074         int err;
5075         int ret = 0;
5076
5077         chunk_item = first_cache_extent(chunk_cache);
5078         while (chunk_item) {
5079                 chunk_rec = container_of(chunk_item, struct chunk_record,
5080                                          cache);
5081                 err = check_chunk_refs(chunk_rec, block_group_cache,
5082                                        dev_extent_cache, silent);
5083                 if (err) {
5084                         ret = err;
5085                         if (bad)
5086                                 list_add_tail(&chunk_rec->list, bad);
5087                 } else {
5088                         if (good)
5089                                 list_add_tail(&chunk_rec->list, good);
5090                 }
5091
5092                 chunk_item = next_cache_extent(chunk_item);
5093         }
5094
5095         list_for_each_entry(bg_rec, &block_group_cache->block_groups, list) {
5096                 if (!silent)
5097                         fprintf(stderr,
5098                                 "Block group[%llu, %llu] (flags = %llu) didn't find the relative chunk.\n",
5099                                 bg_rec->objectid,
5100                                 bg_rec->offset,
5101                                 bg_rec->flags);
5102                 if (!ret)
5103                         ret = 1;
5104         }
5105
5106         list_for_each_entry(dext_rec, &dev_extent_cache->no_chunk_orphans,
5107                             chunk_list) {
5108                 if (!silent)
5109                         fprintf(stderr,
5110                                 "Device extent[%llu, %llu, %llu] didn't find the relative chunk.\n",
5111                                 dext_rec->objectid,
5112                                 dext_rec->offset,
5113                                 dext_rec->length);
5114                 if (!ret)
5115                         ret = 1;
5116         }
5117         return ret;
5118 }
5119
5120
5121 static int check_device_used(struct device_record *dev_rec,
5122                              struct device_extent_tree *dext_cache)
5123 {
5124         struct cache_extent *cache;
5125         struct device_extent_record *dev_extent_rec;
5126         u64 total_byte = 0;
5127
5128         cache = search_cache_extent2(&dext_cache->tree, dev_rec->devid, 0);
5129         while (cache) {
5130                 dev_extent_rec = container_of(cache,
5131                                               struct device_extent_record,
5132                                               cache);
5133                 if (dev_extent_rec->objectid != dev_rec->devid)
5134                         break;
5135
5136                 list_del(&dev_extent_rec->device_list);
5137                 total_byte += dev_extent_rec->length;
5138                 cache = next_cache_extent(cache);
5139         }
5140
5141         if (total_byte != dev_rec->byte_used) {
5142                 fprintf(stderr,
5143                         "Dev extent's total-byte(%llu) is not equal to byte-used(%llu) in dev[%llu, %u, %llu]\n",
5144                         total_byte, dev_rec->byte_used, dev_rec->objectid,
5145                         dev_rec->type, dev_rec->offset);
5146                 return -1;
5147         } else {
5148                 return 0;
5149         }
5150 }
5151
5152 /* check btrfs_dev_item -> btrfs_dev_extent */
5153 static int check_devices(struct rb_root *dev_cache,
5154                          struct device_extent_tree *dev_extent_cache)
5155 {
5156         struct rb_node *dev_node;
5157         struct device_record *dev_rec;
5158         struct device_extent_record *dext_rec;
5159         int err;
5160         int ret = 0;
5161
5162         dev_node = rb_first(dev_cache);
5163         while (dev_node) {
5164                 dev_rec = container_of(dev_node, struct device_record, node);
5165                 err = check_device_used(dev_rec, dev_extent_cache);
5166                 if (err)
5167                         ret = err;
5168
5169                 dev_node = rb_next(dev_node);
5170         }
5171         list_for_each_entry(dext_rec, &dev_extent_cache->no_device_orphans,
5172                             device_list) {
5173                 fprintf(stderr,
5174                         "Device extent[%llu, %llu, %llu] didn't find its device.\n",
5175                         dext_rec->objectid, dext_rec->offset, dext_rec->length);
5176                 if (!ret)
5177                         ret = 1;
5178         }
5179         return ret;
5180 }
5181
5182 static int check_chunks_and_extents(struct btrfs_root *root, int repair)
5183 {
5184         struct rb_root dev_cache;
5185         struct cache_tree chunk_cache;
5186         struct block_group_tree block_group_cache;
5187         struct device_extent_tree dev_extent_cache;
5188         struct cache_tree extent_cache;
5189         struct cache_tree seen;
5190         struct cache_tree pending;
5191         struct cache_tree reada;
5192         struct cache_tree nodes;
5193         struct cache_tree corrupt_blocks;
5194         struct btrfs_path path;
5195         struct btrfs_key key;
5196         struct btrfs_key found_key;
5197         int ret, err = 0;
5198         u64 last = 0;
5199         struct block_info *bits;
5200         int bits_nr;
5201         struct extent_buffer *leaf;
5202         struct btrfs_trans_handle *trans = NULL;
5203         int slot;
5204         struct btrfs_root_item ri;
5205
5206         dev_cache = RB_ROOT;
5207         cache_tree_init(&chunk_cache);
5208         block_group_tree_init(&block_group_cache);
5209         device_extent_tree_init(&dev_extent_cache);
5210
5211         cache_tree_init(&extent_cache);
5212         cache_tree_init(&seen);
5213         cache_tree_init(&pending);
5214         cache_tree_init(&nodes);
5215         cache_tree_init(&reada);
5216         cache_tree_init(&corrupt_blocks);
5217
5218         if (repair) {
5219                 trans = btrfs_start_transaction(root, 1);
5220                 if (IS_ERR(trans)) {
5221                         fprintf(stderr, "Error starting transaction\n");
5222                         return PTR_ERR(trans);
5223                 }
5224                 root->fs_info->fsck_extent_cache = &extent_cache;
5225                 root->fs_info->free_extent_hook = free_extent_hook;
5226                 root->fs_info->corrupt_blocks = &corrupt_blocks;
5227         }
5228
5229         bits_nr = 1024;
5230         bits = malloc(bits_nr * sizeof(struct block_info));
5231         if (!bits) {
5232                 perror("malloc");
5233                 exit(1);
5234         }
5235
5236 again:
5237         add_root_to_pending(root->fs_info->tree_root->node,
5238                             &extent_cache, &pending, &seen, &nodes,
5239                             &root->fs_info->tree_root->root_key);
5240
5241         add_root_to_pending(root->fs_info->chunk_root->node,
5242                             &extent_cache, &pending, &seen, &nodes,
5243                             &root->fs_info->chunk_root->root_key);
5244
5245         btrfs_init_path(&path);
5246         key.offset = 0;
5247         key.objectid = 0;
5248         btrfs_set_key_type(&key, BTRFS_ROOT_ITEM_KEY);
5249         ret = btrfs_search_slot(NULL, root->fs_info->tree_root,
5250                                         &key, &path, 0, 0);
5251         BUG_ON(ret < 0);
5252         while(1) {
5253                 leaf = path.nodes[0];
5254                 slot = path.slots[0];
5255                 if (slot >= btrfs_header_nritems(path.nodes[0])) {
5256                         ret = btrfs_next_leaf(root, &path);
5257                         if (ret != 0)
5258                                 break;
5259                         leaf = path.nodes[0];
5260                         slot = path.slots[0];
5261                 }
5262                 btrfs_item_key_to_cpu(leaf, &found_key, path.slots[0]);
5263                 if (btrfs_key_type(&found_key) == BTRFS_ROOT_ITEM_KEY) {
5264                         unsigned long offset;
5265                         struct extent_buffer *buf;
5266
5267                         offset = btrfs_item_ptr_offset(leaf, path.slots[0]);
5268                         read_extent_buffer(leaf, &ri, offset, sizeof(ri));
5269                         buf = read_tree_block(root->fs_info->tree_root,
5270                                               btrfs_root_bytenr(&ri),
5271                                               btrfs_level_size(root,
5272                                                btrfs_root_level(&ri)), 0);
5273                         add_root_to_pending(buf, &extent_cache, &pending,
5274                                             &seen, &nodes, &found_key);
5275                         free_extent_buffer(buf);
5276                 }
5277                 path.slots[0]++;
5278         }
5279         btrfs_release_path(&path);
5280         while(1) {
5281                 ret = run_next_block(root, bits, bits_nr, &last, &pending,
5282                                      &seen, &reada, &nodes, &extent_cache,
5283                                      &chunk_cache, &dev_cache,
5284                                      &block_group_cache, &dev_extent_cache);
5285                 if (ret != 0)
5286                         break;
5287         }
5288
5289         ret = check_extent_refs(trans, root, &extent_cache, repair);
5290         if (ret == -EAGAIN) {
5291                 ret = btrfs_commit_transaction(trans, root);
5292                 if (ret)
5293                         goto out;
5294
5295                 trans = btrfs_start_transaction(root, 1);
5296                 if (IS_ERR(trans)) {
5297                         ret = PTR_ERR(trans);
5298                         goto out;
5299                 }
5300
5301                 free_corrupt_blocks_tree(root->fs_info->corrupt_blocks);
5302                 free_extent_cache_tree(&seen);
5303                 free_extent_cache_tree(&pending);
5304                 free_extent_cache_tree(&reada);
5305                 free_extent_cache_tree(&nodes);
5306                 free_extent_record_cache(root->fs_info, &extent_cache);
5307                 goto again;
5308         }
5309
5310         err = check_chunks(&chunk_cache, &block_group_cache,
5311                            &dev_extent_cache, NULL, NULL, 0);
5312         if (err && !ret)
5313                 ret = err;
5314
5315         err = check_devices(&dev_cache, &dev_extent_cache);
5316         if (err && !ret)
5317                 ret = err;
5318
5319         if (trans) {
5320                 int err;
5321
5322                 err = btrfs_commit_transaction(trans, root);
5323                 if (!ret)
5324                         ret = err;
5325         }
5326 out:
5327         if (repair) {
5328                 free_corrupt_blocks_tree(root->fs_info->corrupt_blocks);
5329                 root->fs_info->fsck_extent_cache = NULL;
5330                 root->fs_info->free_extent_hook = NULL;
5331                 root->fs_info->corrupt_blocks = NULL;
5332         }
5333         free(bits);
5334         free_chunk_cache_tree(&chunk_cache);
5335         free_device_cache_tree(&dev_cache);
5336         free_block_group_tree(&block_group_cache);
5337         free_device_extent_tree(&dev_extent_cache);
5338         return ret;
5339 }
5340
5341 static int btrfs_fsck_reinit_root(struct btrfs_trans_handle *trans,
5342                            struct btrfs_root *root, int overwrite)
5343 {
5344         struct extent_buffer *c;
5345         struct extent_buffer *old = root->node;
5346         int level;
5347         struct btrfs_disk_key disk_key = {0,0,0};
5348
5349         level = 0;
5350
5351         if (overwrite) {
5352                 c = old;
5353                 extent_buffer_get(c);
5354                 goto init;
5355         }
5356         c = btrfs_alloc_free_block(trans, root,
5357                                    btrfs_level_size(root, 0),
5358                                    root->root_key.objectid,
5359                                    &disk_key, level, 0, 0);
5360         if (IS_ERR(c)) {
5361                 c = old;
5362                 extent_buffer_get(c);
5363         }
5364 init:
5365         memset_extent_buffer(c, 0, 0, sizeof(struct btrfs_header));
5366         btrfs_set_header_level(c, level);
5367         btrfs_set_header_bytenr(c, c->start);
5368         btrfs_set_header_generation(c, trans->transid);
5369         btrfs_set_header_backref_rev(c, BTRFS_MIXED_BACKREF_REV);
5370         btrfs_set_header_owner(c, root->root_key.objectid);
5371
5372         write_extent_buffer(c, root->fs_info->fsid,
5373                             (unsigned long)btrfs_header_fsid(c),
5374                             BTRFS_FSID_SIZE);
5375
5376         write_extent_buffer(c, root->fs_info->chunk_tree_uuid,
5377                             (unsigned long)btrfs_header_chunk_tree_uuid(c),
5378                             BTRFS_UUID_SIZE);
5379
5380         btrfs_mark_buffer_dirty(c);
5381
5382         free_extent_buffer(old);
5383         root->node = c;
5384         add_root_to_dirty_list(root);
5385         return 0;
5386 }
5387
5388 static int pin_down_tree_blocks(struct btrfs_fs_info *fs_info,
5389                                 struct extent_buffer *eb, int tree_root)
5390 {
5391         struct extent_buffer *tmp;
5392         struct btrfs_root_item *ri;
5393         struct btrfs_key key;
5394         u64 bytenr;
5395         u32 leafsize;
5396         int level = btrfs_header_level(eb);
5397         int nritems;
5398         int ret;
5399         int i;
5400
5401         btrfs_pin_extent(fs_info, eb->start, eb->len);
5402
5403         leafsize = btrfs_super_leafsize(fs_info->super_copy);
5404         nritems = btrfs_header_nritems(eb);
5405         for (i = 0; i < nritems; i++) {
5406                 if (level == 0) {
5407                         btrfs_item_key_to_cpu(eb, &key, i);
5408                         if (key.type != BTRFS_ROOT_ITEM_KEY)
5409                                 continue;
5410                         /* Skip the extent root and reloc roots */
5411                         if (key.objectid == BTRFS_EXTENT_TREE_OBJECTID ||
5412                             key.objectid == BTRFS_TREE_RELOC_OBJECTID ||
5413                             key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID)
5414                                 continue;
5415                         ri = btrfs_item_ptr(eb, i, struct btrfs_root_item);
5416                         bytenr = btrfs_disk_root_bytenr(eb, ri);
5417
5418                         /*
5419                          * If at any point we start needing the real root we
5420                          * will have to build a stump root for the root we are
5421                          * in, but for now this doesn't actually use the root so
5422                          * just pass in extent_root.
5423                          */
5424                         tmp = read_tree_block(fs_info->extent_root, bytenr,
5425                                               leafsize, 0);
5426                         if (!tmp) {
5427                                 fprintf(stderr, "Error reading root block\n");
5428                                 return -EIO;
5429                         }
5430                         ret = pin_down_tree_blocks(fs_info, tmp, 0);
5431                         free_extent_buffer(tmp);
5432                         if (ret)
5433                                 return ret;
5434                 } else {
5435                         bytenr = btrfs_node_blockptr(eb, i);
5436
5437                         /* If we aren't the tree root don't read the block */
5438                         if (level == 1 && !tree_root) {
5439                                 btrfs_pin_extent(fs_info, bytenr, leafsize);
5440                                 continue;
5441                         }
5442
5443                         tmp = read_tree_block(fs_info->extent_root, bytenr,
5444                                               leafsize, 0);
5445                         if (!tmp) {
5446                                 fprintf(stderr, "Error reading tree block\n");
5447                                 return -EIO;
5448                         }
5449                         ret = pin_down_tree_blocks(fs_info, tmp, tree_root);
5450                         free_extent_buffer(tmp);
5451                         if (ret)
5452                                 return ret;
5453                 }
5454         }
5455
5456         return 0;
5457 }
5458
5459 static int pin_metadata_blocks(struct btrfs_fs_info *fs_info)
5460 {
5461         int ret;
5462
5463         ret = pin_down_tree_blocks(fs_info, fs_info->chunk_root->node, 0);
5464         if (ret)
5465                 return ret;
5466
5467         return pin_down_tree_blocks(fs_info, fs_info->tree_root->node, 1);
5468 }
5469
5470 static int reset_block_groups(struct btrfs_fs_info *fs_info)
5471 {
5472         struct btrfs_path *path;
5473         struct extent_buffer *leaf;
5474         struct btrfs_chunk *chunk;
5475         struct btrfs_key key;
5476         int ret;
5477
5478         path = btrfs_alloc_path();
5479         if (!path)
5480                 return -ENOMEM;
5481
5482         key.objectid = 0;
5483         key.type = BTRFS_CHUNK_ITEM_KEY;
5484         key.offset = 0;
5485
5486         ret = btrfs_search_slot(NULL, fs_info->chunk_root, &key, path, 0, 0);
5487         if (ret < 0) {
5488                 btrfs_free_path(path);
5489                 return ret;
5490         }
5491
5492         /*
5493          * We do this in case the block groups were screwed up and had alloc
5494          * bits that aren't actually set on the chunks.  This happens with
5495          * restored images every time and could happen in real life I guess.
5496          */
5497         fs_info->avail_data_alloc_bits = 0;
5498         fs_info->avail_metadata_alloc_bits = 0;
5499         fs_info->avail_system_alloc_bits = 0;
5500
5501         /* First we need to create the in-memory block groups */
5502         while (1) {
5503                 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) {
5504                         ret = btrfs_next_leaf(fs_info->chunk_root, path);
5505                         if (ret < 0) {
5506                                 btrfs_free_path(path);
5507                                 return ret;
5508                         }
5509                         if (ret) {
5510                                 ret = 0;
5511                                 break;
5512                         }
5513                 }
5514                 leaf = path->nodes[0];
5515                 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
5516                 if (key.type != BTRFS_CHUNK_ITEM_KEY) {
5517                         path->slots[0]++;
5518                         continue;
5519                 }
5520
5521                 chunk = btrfs_item_ptr(leaf, path->slots[0],
5522                                        struct btrfs_chunk);
5523                 btrfs_add_block_group(fs_info, 0,
5524                                       btrfs_chunk_type(leaf, chunk),
5525                                       key.objectid, key.offset,
5526                                       btrfs_chunk_length(leaf, chunk));
5527                 path->slots[0]++;
5528         }
5529
5530         btrfs_free_path(path);
5531         return 0;
5532 }
5533
5534 static int reset_balance(struct btrfs_trans_handle *trans,
5535                          struct btrfs_fs_info *fs_info)
5536 {
5537         struct btrfs_root *root = fs_info->tree_root;
5538         struct btrfs_path *path;
5539         struct extent_buffer *leaf;
5540         struct btrfs_key key;
5541         int del_slot, del_nr = 0;
5542         int ret;
5543         int found = 0;
5544
5545         path = btrfs_alloc_path();
5546         if (!path)
5547                 return -ENOMEM;
5548
5549         key.objectid = BTRFS_BALANCE_OBJECTID;
5550         key.type = BTRFS_BALANCE_ITEM_KEY;
5551         key.offset = 0;
5552
5553         ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
5554         if (ret) {
5555                 if (ret > 0)
5556                         ret = 0;
5557                 goto out;
5558         }
5559
5560         ret = btrfs_del_item(trans, root, path);
5561         if (ret)
5562                 goto out;
5563         btrfs_release_path(path);
5564
5565         key.objectid = BTRFS_TREE_RELOC_OBJECTID;
5566         key.type = BTRFS_ROOT_ITEM_KEY;
5567         key.offset = 0;
5568
5569         ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
5570         if (ret < 0)
5571                 goto out;
5572         while (1) {
5573                 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) {
5574                         if (!found)
5575                                 break;
5576
5577                         if (del_nr) {
5578                                 ret = btrfs_del_items(trans, root, path,
5579                                                       del_slot, del_nr);
5580                                 del_nr = 0;
5581                                 if (ret)
5582                                         goto out;
5583                         }
5584                         key.offset++;
5585                         btrfs_release_path(path);
5586
5587                         found = 0;
5588                         ret = btrfs_search_slot(trans, root, &key, path,
5589                                                 -1, 1);
5590                         if (ret < 0)
5591                                 goto out;
5592                         continue;
5593                 }
5594                 found = 1;
5595                 leaf = path->nodes[0];
5596                 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
5597                 if (key.objectid > BTRFS_TREE_RELOC_OBJECTID)
5598                         break;
5599                 if (key.objectid != BTRFS_TREE_RELOC_OBJECTID) {
5600                         path->slots[0]++;
5601                         continue;
5602                 }
5603                 if (!del_nr) {
5604                         del_slot = path->slots[0];
5605                         del_nr = 1;
5606                 } else {
5607                         del_nr++;
5608                 }
5609                 path->slots[0]++;
5610         }
5611
5612         if (del_nr) {
5613                 ret = btrfs_del_items(trans, root, path, del_slot, del_nr);
5614                 if (ret)
5615                         goto out;
5616         }
5617         btrfs_release_path(path);
5618
5619         key.objectid = BTRFS_DATA_RELOC_TREE_OBJECTID;
5620         key.type = BTRFS_ROOT_ITEM_KEY;
5621         key.offset = (u64)-1;
5622         root = btrfs_read_fs_root(fs_info, &key);
5623         if (IS_ERR(root)) {
5624                 fprintf(stderr, "Error reading data reloc tree\n");
5625                 return PTR_ERR(root);
5626         }
5627         root->track_dirty = 1;
5628         if (root->last_trans != trans->transid) {
5629                 root->last_trans = trans->transid;
5630                 root->commit_root = root->node;
5631                 extent_buffer_get(root->node);
5632         }
5633         ret = btrfs_fsck_reinit_root(trans, root, 0);
5634 out:
5635         btrfs_free_path(path);
5636         return ret;
5637 }
5638
5639 static int reinit_extent_tree(struct btrfs_fs_info *fs_info)
5640 {
5641         struct btrfs_trans_handle *trans;
5642         u64 start = 0;
5643         int ret;
5644
5645         /*
5646          * The only reason we don't do this is because right now we're just
5647          * walking the trees we find and pinning down their bytes, we don't look
5648          * at any of the leaves.  In order to do mixed groups we'd have to check
5649          * the leaves of any fs roots and pin down the bytes for any file
5650          * extents we find.  Not hard but why do it if we don't have to?
5651          */
5652         if (btrfs_fs_incompat(fs_info, BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS)) {
5653                 fprintf(stderr, "We don't support re-initing the extent tree "
5654                         "for mixed block groups yet, please notify a btrfs "
5655                         "developer you want to do this so they can add this "
5656                         "functionality.\n");
5657                 return -EINVAL;
5658         }
5659
5660         trans = btrfs_start_transaction(fs_info->extent_root, 1);
5661         if (IS_ERR(trans)) {
5662                 fprintf(stderr, "Error starting transaction\n");
5663                 return PTR_ERR(trans);
5664         }
5665
5666         /*
5667          * first we need to walk all of the trees except the extent tree and pin
5668          * down the bytes that are in use so we don't overwrite any existing
5669          * metadata.
5670          */
5671         ret = pin_metadata_blocks(fs_info);
5672         if (ret) {
5673                 fprintf(stderr, "error pinning down used bytes\n");
5674                 return ret;
5675         }
5676
5677         /*
5678          * Need to drop all the block groups since we're going to recreate all
5679          * of them again.
5680          */
5681         btrfs_free_block_groups(fs_info);
5682         ret = reset_block_groups(fs_info);
5683         if (ret) {
5684                 fprintf(stderr, "error resetting the block groups\n");
5685                 return ret;
5686         }
5687
5688         /* Ok we can allocate now, reinit the extent root */
5689         ret = btrfs_fsck_reinit_root(trans, fs_info->extent_root, 1);
5690         if (ret) {
5691                 fprintf(stderr, "extent root initialization failed\n");
5692                 /*
5693                  * When the transaction code is updated we should end the
5694                  * transaction, but for now progs only knows about commit so
5695                  * just return an error.
5696                  */
5697                 return ret;
5698         }
5699
5700         ret = reset_balance(trans, fs_info);
5701         if (ret) {
5702                 fprintf(stderr, "error reseting the pending balance\n");
5703                 return ret;
5704         }
5705
5706         /*
5707          * Now we have all the in-memory block groups setup so we can make
5708          * allocations properly, and the metadata we care about is safe since we
5709          * pinned all of it above.
5710          */
5711         while (1) {
5712                 struct btrfs_block_group_cache *cache;
5713
5714                 cache = btrfs_lookup_first_block_group(fs_info, start);
5715                 if (!cache)
5716                         break;
5717                 start = cache->key.objectid + cache->key.offset;
5718                 ret = btrfs_insert_item(trans, fs_info->extent_root,
5719                                         &cache->key, &cache->item,
5720                                         sizeof(cache->item));
5721                 if (ret) {
5722                         fprintf(stderr, "Error adding block group\n");
5723                         return ret;
5724                 }
5725                 btrfs_extent_post_op(trans, fs_info->extent_root);
5726         }
5727
5728         /*
5729          * Ok now we commit and run the normal fsck, which will add extent
5730          * entries for all of the items it finds.
5731          */
5732         return btrfs_commit_transaction(trans, fs_info->extent_root);
5733 }
5734
5735 static struct option long_options[] = {
5736         { "super", 1, NULL, 's' },
5737         { "repair", 0, NULL, 0 },
5738         { "init-csum-tree", 0, NULL, 0 },
5739         { "init-extent-tree", 0, NULL, 0 },
5740         { 0, 0, 0, 0}
5741 };
5742
5743 const char * const cmd_check_usage[] = {
5744         "btrfs check [options] <device>",
5745         "Check an unmounted btrfs filesystem.",
5746         "",
5747         "-s|--super <superblock>     use this superblock copy",
5748         "--repair                    try to repair the filesystem",
5749         "--init-csum-tree            create a new CRC tree",
5750         "--init-extent-tree          create a new extent tree",
5751         NULL
5752 };
5753
5754 int cmd_check(int argc, char **argv)
5755 {
5756         struct cache_tree root_cache;
5757         struct btrfs_root *root;
5758         struct btrfs_fs_info *info;
5759         u64 bytenr = 0;
5760         char uuidbuf[37];
5761         int ret;
5762         int num;
5763         int repair = 0;
5764         int option_index = 0;
5765         int init_csum_tree = 0;
5766         int init_extent_tree = 0;
5767         int rw = 0;
5768
5769         while(1) {
5770                 int c;
5771                 c = getopt_long(argc, argv, "as:", long_options,
5772                                 &option_index);
5773                 if (c < 0)
5774                         break;
5775                 switch(c) {
5776                         case 'a': /* ignored */ break;
5777                         case 's':
5778                                 num = atol(optarg);
5779                                 bytenr = btrfs_sb_offset(num);
5780                                 printf("using SB copy %d, bytenr %llu\n", num,
5781                                        (unsigned long long)bytenr);
5782                                 break;
5783                         case '?':
5784                         case 'h':
5785                                 usage(cmd_check_usage);
5786                 }
5787                 if (option_index == 1) {
5788                         printf("enabling repair mode\n");
5789                         repair = 1;
5790                         rw = 1;
5791                 } else if (option_index == 2) {
5792                         printf("Creating a new CRC tree\n");
5793                         init_csum_tree = 1;
5794                         rw = 1;
5795                 } else if (option_index == 3) {
5796                         init_extent_tree = 1;
5797                         rw = 1;
5798                         repair = 1;
5799                 }
5800
5801         }
5802         argc = argc - optind;
5803
5804         if (argc != 1)
5805                 usage(cmd_check_usage);
5806
5807         radix_tree_init();
5808         cache_tree_init(&root_cache);
5809
5810         if((ret = check_mounted(argv[optind])) < 0) {
5811                 fprintf(stderr, "Could not check mount status: %s\n", strerror(-ret));
5812                 return ret;
5813         } else if(ret) {
5814                 fprintf(stderr, "%s is currently mounted. Aborting.\n", argv[optind]);
5815                 return -EBUSY;
5816         }
5817
5818         info = open_ctree_fs_info(argv[optind], bytenr, 0, rw, 1);
5819         if (!info) {
5820                 fprintf(stderr, "Couldn't open file system\n");
5821                 return -EIO;
5822         }
5823
5824         uuid_unparse(info->super_copy->fsid, uuidbuf);
5825         printf("Checking filesystem on %s\nUUID: %s\n", argv[optind], uuidbuf);
5826
5827         if (!extent_buffer_uptodate(info->tree_root->node) ||
5828             !extent_buffer_uptodate(info->dev_root->node) ||
5829             !extent_buffer_uptodate(info->extent_root->node) ||
5830             !extent_buffer_uptodate(info->chunk_root->node)) {
5831                 fprintf(stderr, "Critical roots corrupted, unable to fsck the FS\n");
5832                 return -EIO;
5833         }
5834
5835         root = info->fs_root;
5836
5837         if (init_extent_tree) {
5838                 printf("Creating a new extent tree\n");
5839                 ret = reinit_extent_tree(info);
5840                 if (ret)
5841                         return ret;
5842         }
5843         fprintf(stderr, "checking extents\n");
5844         if (init_csum_tree) {
5845                 struct btrfs_trans_handle *trans;
5846
5847                 fprintf(stderr, "Reinit crc root\n");
5848                 trans = btrfs_start_transaction(info->csum_root, 1);
5849                 if (IS_ERR(trans)) {
5850                         fprintf(stderr, "Error starting transaction\n");
5851                         return PTR_ERR(trans);
5852                 }
5853
5854                 ret = btrfs_fsck_reinit_root(trans, info->csum_root, 0);
5855                 if (ret) {
5856                         fprintf(stderr, "crc root initialization failed\n");
5857                         return -EIO;
5858                 }
5859
5860                 ret = btrfs_commit_transaction(trans, info->csum_root);
5861                 if (ret)
5862                         exit(1);
5863                 goto out;
5864         }
5865         ret = check_chunks_and_extents(root, repair);
5866         if (ret)
5867                 fprintf(stderr, "Errors found in extent allocation tree or chunk allocation\n");
5868
5869         fprintf(stderr, "checking free space cache\n");
5870         ret = check_space_cache(root);
5871         if (ret)
5872                 goto out;
5873
5874         fprintf(stderr, "checking fs roots\n");
5875         ret = check_fs_roots(root, &root_cache);
5876         if (ret)
5877                 goto out;
5878
5879         fprintf(stderr, "checking csums\n");
5880         ret = check_csums(root);
5881         if (ret)
5882                 goto out;
5883
5884         fprintf(stderr, "checking root refs\n");
5885         ret = check_root_refs(root, &root_cache);
5886 out:
5887         free_root_recs_tree(&root_cache);
5888         close_ctree(root);
5889
5890         if (found_old_backref) { /*
5891                  * there was a disk format change when mixed
5892                  * backref was in testing tree. The old format
5893                  * existed about one week.
5894                  */
5895                 printf("\n * Found old mixed backref format. "
5896                        "The old format is not supported! *"
5897                        "\n * Please mount the FS in readonly mode, "
5898                        "backup data and re-format the FS. *\n\n");
5899                 ret = 1;
5900         }
5901         printf("found %llu bytes used err is %d\n",
5902                (unsigned long long)bytes_used, ret);
5903         printf("total csum bytes: %llu\n",(unsigned long long)total_csum_bytes);
5904         printf("total tree bytes: %llu\n",
5905                (unsigned long long)total_btree_bytes);
5906         printf("total fs tree bytes: %llu\n",
5907                (unsigned long long)total_fs_tree_bytes);
5908         printf("total extent tree bytes: %llu\n",
5909                (unsigned long long)total_extent_tree_bytes);
5910         printf("btree space waste bytes: %llu\n",
5911                (unsigned long long)btree_space_waste);
5912         printf("file data blocks allocated: %llu\n referenced %llu\n",
5913                 (unsigned long long)data_bytes_allocated,
5914                 (unsigned long long)data_bytes_referenced);
5915         printf("%s\n", BTRFS_BUILD_VERSION);
5916         return ret;
5917 }