chunk-recover.c

   1 /*
   2  * Copyright (C) 2013 FUJITSU LIMITED.  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 #include "kerncompat.h"
  20 #include "androidcompat.h"
  21
  22 #include <stdio.h>
  23 #include <stdio_ext.h>
  24 #include <stdlib.h>
  25 #include <sys/types.h>
  26 #include <sys/stat.h>
  27 #include <fcntl.h>
  28 #include <unistd.h>
  29 #include <uuid/uuid.h>
  30 #include <pthread.h>
  31
  32 #include "list.h"
  33 #include "radix-tree.h"
  34 #include "ctree.h"
  35 #include "extent-cache.h"
  36 #include "disk-io.h"
  37 #include "volumes.h"
  38 #include "transaction.h"
  39 #include "crc32c.h"
  40 #include "utils.h"
  41 #include "btrfsck.h"
  42 #include "commands.h"
  43
  44 struct recover_control {
  45         int verbose;
  46         int yes;
  47
  48         u16 csum_size;
  49         u32 sectorsize;
  50         u32 leafsize;
  51         u64 generation;
  52         u64 chunk_root_generation;
  53
  54         struct btrfs_fs_devices *fs_devices;
  55
  56         struct cache_tree chunk;
  57         struct block_group_tree bg;
  58         struct device_extent_tree devext;
  59         struct cache_tree eb_cache;
  60
  61         struct list_head good_chunks;
  62         struct list_head bad_chunks;
  63         struct list_head rebuild_chunks;
  64         struct list_head unrepaired_chunks;
  65         pthread_mutex_t rc_lock;
  66 };
  67
  68 struct extent_record {
  69         struct cache_extent cache;
  70         u64 generation;
  71         u8 csum[BTRFS_CSUM_SIZE];
  72         struct btrfs_device *devices[BTRFS_MAX_MIRRORS];
  73         u64 offsets[BTRFS_MAX_MIRRORS];
  74         int nmirrors;
  75 };
  76
  77 struct device_scan {
  78         struct recover_control *rc;
  79         struct btrfs_device *dev;
  80         int fd;
  81 };
  82
  83 static struct extent_record *btrfs_new_extent_record(struct extent_buffer *eb)
  84 {
  85         struct extent_record *rec;
  86
  87         rec = malloc(sizeof(*rec));
  88         if (!rec) {
  89                 fprintf(stderr, "Fail to allocate memory for extent record.\n");
  90                 exit(1);
  91         }
  92
  93         memset(rec, 0, sizeof(*rec));
  94         rec->cache.start = btrfs_header_bytenr(eb);
  95         rec->cache.size = eb->len;
  96         rec->generation = btrfs_header_generation(eb);
  97         read_extent_buffer(eb, rec->csum, (unsigned long)btrfs_header_csum(eb),
  98                            BTRFS_CSUM_SIZE);
  99         return rec;
 100 }
 101
 102 static int process_extent_buffer(struct cache_tree *eb_cache,
 103                                  struct extent_buffer *eb,
 104                                  struct btrfs_device *device, u64 offset)
 105 {
 106         struct extent_record *rec;
 107         struct extent_record *exist;
 108         struct cache_extent *cache;
 109         int ret = 0;
 110
 111         rec = btrfs_new_extent_record(eb);
 112         if (!rec->cache.size)
 113                 goto free_out;
 114 again:
 115         cache = lookup_cache_extent(eb_cache,
 116                                     rec->cache.start,
 117                                     rec->cache.size);
 118         if (cache) {
 119                 exist = container_of(cache, struct extent_record, cache);
 120
 121                 if (exist->generation > rec->generation)
 122                         goto free_out;
 123                 if (exist->generation == rec->generation) {
 124                         if (exist->cache.start != rec->cache.start ||
 125                             exist->cache.size != rec->cache.size ||
 126                             memcmp(exist->csum, rec->csum, BTRFS_CSUM_SIZE)) {
 127                                 ret = -EEXIST;
 128                         } else {
 129                                 BUG_ON(exist->nmirrors >= BTRFS_MAX_MIRRORS);
 130                                 exist->devices[exist->nmirrors] = device;
 131                                 exist->offsets[exist->nmirrors] = offset;
 132                                 exist->nmirrors++;
 133                         }
 134                         goto free_out;
 135                 }
 136                 remove_cache_extent(eb_cache, cache);
 137                 free(exist);
 138                 goto again;
 139         }
 140
 141         rec->devices[0] = device;
 142         rec->offsets[0] = offset;
 143         rec->nmirrors++;
 144         ret = insert_cache_extent(eb_cache, &rec->cache);
 145         BUG_ON(ret);
 146 out:
 147         return ret;
 148 free_out:
 149         free(rec);
 150         goto out;
 151 }
 152
 153 static void free_extent_record(struct cache_extent *cache)
 154 {
 155         struct extent_record *er;
 156
 157         er = container_of(cache, struct extent_record, cache);
 158         free(er);
 159 }
 160
 161 FREE_EXTENT_CACHE_BASED_TREE(extent_record, free_extent_record);
 162
 163 static struct btrfs_chunk *create_chunk_item(struct chunk_record *record)
 164 {
 165         struct btrfs_chunk *ret;
 166         struct btrfs_stripe *chunk_stripe;
 167         int i;
 168
 169         if (!record || record->num_stripes == 0)
 170                 return NULL;
 171         ret = malloc(btrfs_chunk_item_size(record->num_stripes));
 172         if (!ret)
 173                 return NULL;
 174         btrfs_set_stack_chunk_length(ret, record->length);
 175         btrfs_set_stack_chunk_owner(ret, record->owner);
 176         btrfs_set_stack_chunk_stripe_len(ret, record->stripe_len);
 177         btrfs_set_stack_chunk_type(ret, record->type_flags);
 178         btrfs_set_stack_chunk_io_align(ret, record->io_align);
 179         btrfs_set_stack_chunk_io_width(ret, record->io_width);
 180         btrfs_set_stack_chunk_sector_size(ret, record->sector_size);
 181         btrfs_set_stack_chunk_num_stripes(ret, record->num_stripes);
 182         btrfs_set_stack_chunk_sub_stripes(ret, record->sub_stripes);
 183         for (i = 0, chunk_stripe = &ret->stripe; i < record->num_stripes;
 184              i++, chunk_stripe++) {
 185                 btrfs_set_stack_stripe_devid(chunk_stripe,
 186                                 record->stripes[i].devid);
 187                 btrfs_set_stack_stripe_offset(chunk_stripe,
 188                                 record->stripes[i].offset);
 189                 memcpy(chunk_stripe->dev_uuid, record->stripes[i].dev_uuid,
 190                        BTRFS_UUID_SIZE);
 191         }
 192         return ret;
 193 }
 194
 195 static void init_recover_control(struct recover_control *rc, int verbose,
 196                 int yes)
 197 {
 198         memset(rc, 0, sizeof(struct recover_control));
 199         cache_tree_init(&rc->chunk);
 200         cache_tree_init(&rc->eb_cache);
 201         block_group_tree_init(&rc->bg);
 202         device_extent_tree_init(&rc->devext);
 203
 204         INIT_LIST_HEAD(&rc->good_chunks);
 205         INIT_LIST_HEAD(&rc->bad_chunks);
 206         INIT_LIST_HEAD(&rc->rebuild_chunks);
 207         INIT_LIST_HEAD(&rc->unrepaired_chunks);
 208
 209         rc->verbose = verbose;
 210         rc->yes = yes;
 211         pthread_mutex_init(&rc->rc_lock, NULL);
 212 }
 213
 214 static void free_recover_control(struct recover_control *rc)
 215 {
 216         free_block_group_tree(&rc->bg);
 217         free_chunk_cache_tree(&rc->chunk);
 218         free_device_extent_tree(&rc->devext);
 219         free_extent_record_tree(&rc->eb_cache);
 220         pthread_mutex_destroy(&rc->rc_lock);
 221 }
 222
 223 static int process_block_group_item(struct block_group_tree *bg_cache,
 224                                     struct extent_buffer *leaf,
 225                                     struct btrfs_key *key, int slot)
 226 {
 227         struct block_group_record *rec;
 228         struct block_group_record *exist;
 229         struct cache_extent *cache;
 230         int ret = 0;
 231
 232         rec = btrfs_new_block_group_record(leaf, key, slot);
 233         if (!rec->cache.size)
 234                 goto free_out;
 235 again:
 236         cache = lookup_cache_extent(&bg_cache->tree,
 237                                     rec->cache.start,
 238                                     rec->cache.size);
 239         if (cache) {
 240                 exist = container_of(cache, struct block_group_record, cache);
 241
 242                 /*check the generation and replace if needed*/
 243                 if (exist->generation > rec->generation)
 244                         goto free_out;
 245                 if (exist->generation == rec->generation) {
 246                         int offset = offsetof(struct block_group_record,
 247                                               generation);
 248                         /*
 249                          * According to the current kernel code, the following
 250                          * case is impossble, or there is something wrong in
 251                          * the kernel code.
 252                          */
 253                         if (memcmp(((void *)exist) + offset,
 254                                    ((void *)rec) + offset,
 255                                    sizeof(*rec) - offset))
 256                                 ret = -EEXIST;
 257                         goto free_out;
 258                 }
 259                 remove_cache_extent(&bg_cache->tree, cache);
 260                 list_del_init(&exist->list);
 261                 free(exist);
 262                 /*
 263                  * We must do seach again to avoid the following cache.
 264                  * /--old bg 1--//--old bg 2--/
 265                  *        /--new bg--/
 266                  */
 267                 goto again;
 268         }
 269
 270         ret = insert_block_group_record(bg_cache, rec);
 271         BUG_ON(ret);
 272 out:
 273         return ret;
 274 free_out:
 275         free(rec);
 276         goto out;
 277 }
 278
 279 static int process_chunk_item(struct cache_tree *chunk_cache,
 280                               struct extent_buffer *leaf, struct btrfs_key *key,
 281                               int slot)
 282 {
 283         struct chunk_record *rec;
 284         struct chunk_record *exist;
 285         struct cache_extent *cache;
 286         int ret = 0;
 287
 288         rec = btrfs_new_chunk_record(leaf, key, slot);
 289         if (!rec->cache.size)
 290                 goto free_out;
 291 again:
 292         cache = lookup_cache_extent(chunk_cache, rec->offset, rec->length);
 293         if (cache) {
 294                 exist = container_of(cache, struct chunk_record, cache);
 295
 296                 if (exist->generation > rec->generation)
 297                         goto free_out;
 298                 if (exist->generation == rec->generation) {
 299                         int num_stripes = rec->num_stripes;
 300                         int rec_size = btrfs_chunk_record_size(num_stripes);
 301                         int offset = offsetof(struct chunk_record, generation);
 302
 303                         if (exist->num_stripes != rec->num_stripes ||
 304                             memcmp(((void *)exist) + offset,
 305                                    ((void *)rec) + offset,
 306                                    rec_size - offset))
 307                                 ret = -EEXIST;
 308                         goto free_out;
 309                 }
 310                 remove_cache_extent(chunk_cache, cache);
 311                 free(exist);
 312                 goto again;
 313         }
 314         ret = insert_cache_extent(chunk_cache, &rec->cache);
 315         BUG_ON(ret);
 316 out:
 317         return ret;
 318 free_out:
 319         free(rec);
 320         goto out;
 321 }
 322
 323 static int process_device_extent_item(struct device_extent_tree *devext_cache,
 324                                       struct extent_buffer *leaf,
 325                                       struct btrfs_key *key, int slot)
 326 {
 327         struct device_extent_record *rec;
 328         struct device_extent_record *exist;
 329         struct cache_extent *cache;
 330         int ret = 0;
 331
 332         rec = btrfs_new_device_extent_record(leaf, key, slot);
 333         if (!rec->cache.size)
 334                 goto free_out;
 335 again:
 336         cache = lookup_cache_extent2(&devext_cache->tree,
 337                                      rec->cache.objectid,
 338                                      rec->cache.start,
 339                                      rec->cache.size);
 340         if (cache) {
 341                 exist = container_of(cache, struct device_extent_record, cache);
 342                 if (exist->generation > rec->generation)
 343                         goto free_out;
 344                 if (exist->generation == rec->generation) {
 345                         int offset = offsetof(struct device_extent_record,
 346                                               generation);
 347                         if (memcmp(((void *)exist) + offset,
 348                                    ((void *)rec) + offset,
 349                                    sizeof(*rec) - offset))
 350                                 ret = -EEXIST;
 351                         goto free_out;
 352                 }
 353                 remove_cache_extent(&devext_cache->tree, cache);
 354                 list_del_init(&exist->chunk_list);
 355                 list_del_init(&exist->device_list);
 356                 free(exist);
 357                 goto again;
 358         }
 359
 360         ret = insert_device_extent_record(devext_cache, rec);
 361         BUG_ON(ret);
 362 out:
 363         return ret;
 364 free_out:
 365         free(rec);
 366         goto out;
 367 }
 368
 369 static void print_block_group_info(struct block_group_record *rec, char *prefix)
 370 {
 371         if (prefix)
 372                 printf("%s", prefix);
 373         printf("Block Group: start = %llu, len = %llu, flag = %llx\n",
 374                rec->objectid, rec->offset, rec->flags);
 375 }
 376
 377 static void print_block_group_tree(struct block_group_tree *tree)
 378 {
 379         struct cache_extent *cache;
 380         struct block_group_record *rec;
 381
 382         printf("All Block Groups:\n");
 383         for (cache = first_cache_extent(&tree->tree); cache;
 384              cache = next_cache_extent(cache)) {
 385                 rec = container_of(cache, struct block_group_record, cache);
 386                 print_block_group_info(rec, "\t");
 387         }
 388         printf("\n");
 389 }
 390
 391 static void print_stripe_info(struct stripe *data, char *prefix1, char *prefix2,
 392                               int index)
 393 {
 394         if (prefix1)
 395                 printf("%s", prefix1);
 396         if (prefix2)
 397                 printf("%s", prefix2);
 398         printf("[%2d] Stripe: devid = %llu, offset = %llu\n",
 399                index, data->devid, data->offset);
 400 }
 401
 402 static void print_chunk_self_info(struct chunk_record *rec, char *prefix)
 403 {
 404         int i;
 405
 406         if (prefix)
 407                 printf("%s", prefix);
 408         printf("Chunk: start = %llu, len = %llu, type = %llx, num_stripes = %u\n",
 409                rec->offset, rec->length, rec->type_flags, rec->num_stripes);
 410         if (prefix)
 411                 printf("%s", prefix);
 412         printf("    Stripes list:\n");
 413         for (i = 0; i < rec->num_stripes; i++)
 414                 print_stripe_info(&rec->stripes[i], prefix, "    ", i);
 415 }
 416
 417 static void print_chunk_tree(struct cache_tree *tree)
 418 {
 419         struct cache_extent *n;
 420         struct chunk_record *entry;
 421
 422         printf("All Chunks:\n");
 423         for (n = first_cache_extent(tree); n;
 424              n = next_cache_extent(n)) {
 425                 entry = container_of(n, struct chunk_record, cache);
 426                 print_chunk_self_info(entry, "\t");
 427         }
 428         printf("\n");
 429 }
 430
 431 static void print_device_extent_info(struct device_extent_record *rec,
 432                                      char *prefix)
 433 {
 434         if (prefix)
 435                 printf("%s", prefix);
 436         printf("Device extent: devid = %llu, start = %llu, len = %llu, chunk offset = %llu\n",
 437                rec->objectid, rec->offset, rec->length, rec->chunk_offset);
 438 }
 439
 440 static void print_device_extent_tree(struct device_extent_tree *tree)
 441 {
 442         struct cache_extent *n;
 443         struct device_extent_record *entry;
 444
 445         printf("All Device Extents:\n");
 446         for (n = first_cache_extent(&tree->tree); n;
 447              n = next_cache_extent(n)) {
 448                 entry = container_of(n, struct device_extent_record, cache);
 449                 print_device_extent_info(entry, "\t");
 450         }
 451         printf("\n");
 452 }
 453
 454 static void print_device_info(struct btrfs_device *device, char *prefix)
 455 {
 456         if (prefix)
 457                 printf("%s", prefix);
 458         printf("Device: id = %llu, name = %s\n",
 459                device->devid, device->name);
 460 }
 461
 462 static void print_all_devices(struct list_head *devices)
 463 {
 464         struct btrfs_device *dev;
 465
 466         printf("All Devices:\n");
 467         list_for_each_entry(dev, devices, dev_list)
 468                 print_device_info(dev, "\t");
 469         printf("\n");
 470 }
 471
 472 static void print_scan_result(struct recover_control *rc)
 473 {
 474         if (!rc->verbose)
 475                 return;
 476
 477         printf("DEVICE SCAN RESULT:\n");
 478         printf("Filesystem Information:\n");
 479         printf("\tsectorsize: %d\n", rc->sectorsize);
 480         printf("\tleafsize: %d\n", rc->leafsize);
 481         printf("\ttree root generation: %llu\n", rc->generation);
 482         printf("\tchunk root generation: %llu\n", rc->chunk_root_generation);
 483         printf("\n");
 484
 485         print_all_devices(&rc->fs_devices->devices);
 486         print_block_group_tree(&rc->bg);
 487         print_chunk_tree(&rc->chunk);
 488         print_device_extent_tree(&rc->devext);
 489 }
 490
 491 static void print_chunk_info(struct chunk_record *chunk, char *prefix)
 492 {
 493         struct device_extent_record *devext;
 494         int i;
 495
 496         print_chunk_self_info(chunk, prefix);
 497         if (prefix)
 498                 printf("%s", prefix);
 499         if (chunk->bg_rec)
 500                 print_block_group_info(chunk->bg_rec, "    ");
 501         else
 502                 printf("    No block group.\n");
 503         if (prefix)
 504                 printf("%s", prefix);
 505         if (list_empty(&chunk->dextents)) {
 506                 printf("    No device extent.\n");
 507         } else {
 508                 printf("    Device extent list:\n");
 509                 i = 0;
 510                 list_for_each_entry(devext, &chunk->dextents, chunk_list) {
 511                         if (prefix)
 512                                 printf("%s", prefix);
 513                         printf("%s[%2d]", "        ", i);
 514                         print_device_extent_info(devext, NULL);
 515                         i++;
 516                 }
 517         }
 518 }
 519
 520 static void print_check_result(struct recover_control *rc)
 521 {
 522         struct chunk_record *chunk;
 523         struct block_group_record *bg;
 524         struct device_extent_record *devext;
 525         int total = 0;
 526         int good = 0;
 527         int bad = 0;
 528
 529         if (!rc->verbose)
 530                 return;
 531
 532         printf("CHECK RESULT:\n");
 533         printf("Recoverable Chunks:\n");
 534         list_for_each_entry(chunk, &rc->good_chunks, list) {
 535                 print_chunk_info(chunk, "  ");
 536                 good++;
 537                 total++;
 538         }
 539         list_for_each_entry(chunk, &rc->rebuild_chunks, list) {
 540                 print_chunk_info(chunk, "  ");
 541                 good++;
 542                 total++;
 543         }
 544         list_for_each_entry(chunk, &rc->unrepaired_chunks, list) {
 545                 print_chunk_info(chunk, "  ");
 546                 good++;
 547                 total++;
 548         }
 549         printf("Unrecoverable Chunks:\n");
 550         list_for_each_entry(chunk, &rc->bad_chunks, list) {
 551                 print_chunk_info(chunk, "  ");
 552                 bad++;
 553                 total++;
 554         }
 555         printf("\n");
 556         printf("Total Chunks:\t\t%d\n", total);
 557         printf("  Recoverable:\t\t%d\n", good);
 558         printf("  Unrecoverable:\t%d\n", bad);
 559
 560         printf("\n");
 561         printf("Orphan Block Groups:\n");
 562         list_for_each_entry(bg, &rc->bg.block_groups, list)
 563                 print_block_group_info(bg, "  ");
 564
 565         printf("\n");
 566         printf("Orphan Device Extents:\n");
 567         list_for_each_entry(devext, &rc->devext.no_chunk_orphans, chunk_list)
 568                 print_device_extent_info(devext, "  ");
 569         printf("\n");
 570 }
 571
 572 static int check_chunk_by_metadata(struct recover_control *rc,
 573                                    struct btrfs_root *root,
 574                                    struct chunk_record *chunk, int bg_only)
 575 {
 576         int ret;
 577         int i;
 578         int slot;
 579         struct btrfs_path path;
 580         struct btrfs_key key;
 581         struct btrfs_root *dev_root;
 582         struct stripe *stripe;
 583         struct btrfs_dev_extent *dev_extent;
 584         struct btrfs_block_group_item *bg_ptr;
 585         struct extent_buffer *l;
 586
 587         btrfs_init_path(&path);
 588
 589         if (bg_only)
 590                 goto bg_check;
 591
 592         dev_root = root->fs_info->dev_root;
 593         for (i = 0; i < chunk->num_stripes; i++) {
 594                 stripe = &chunk->stripes[i];
 595
 596                 key.objectid = stripe->devid;
 597                 key.offset = stripe->offset;
 598                 key.type = BTRFS_DEV_EXTENT_KEY;
 599
 600                 ret = btrfs_search_slot(NULL, dev_root, &key, &path, 0, 0);
 601                 if (ret < 0) {
 602                         fprintf(stderr, "Search device extent failed(%d)\n",
 603                                 ret);
 604                         btrfs_release_path(&path);
 605                         return ret;
 606                 } else if (ret > 0) {
 607                         if (rc->verbose)
 608                                 fprintf(stderr,
 609                                         "No device extent[%llu, %llu]\n",
 610                                         stripe->devid, stripe->offset);
 611                         btrfs_release_path(&path);
 612                         return -ENOENT;
 613                 }
 614                 l = path.nodes[0];
 615                 slot = path.slots[0];
 616                 dev_extent = btrfs_item_ptr(l, slot, struct btrfs_dev_extent);
 617                 if (chunk->offset !=
 618                     btrfs_dev_extent_chunk_offset(l, dev_extent)) {
 619                         if (rc->verbose)
 620                                 fprintf(stderr,
 621                                         "Device tree unmatch with chunks dev_extent[%llu, %llu], chunk[%llu, %llu]\n",
 622                                         btrfs_dev_extent_chunk_offset(l,
 623                                                                 dev_extent),
 624                                         btrfs_dev_extent_length(l, dev_extent),
 625                                         chunk->offset, chunk->length);
 626                         btrfs_release_path(&path);
 627                         return -ENOENT;
 628                 }
 629                 btrfs_release_path(&path);
 630         }
 631
 632 bg_check:
 633         key.objectid = chunk->offset;
 634         key.type = BTRFS_BLOCK_GROUP_ITEM_KEY;
 635         key.offset = chunk->length;
 636
 637         ret = btrfs_search_slot(NULL, root->fs_info->extent_root, &key, &path,
 638                                 0, 0);
 639         if (ret < 0) {
 640                 fprintf(stderr, "Search block group failed(%d)\n", ret);
 641                 btrfs_release_path(&path);
 642                 return ret;
 643         } else if (ret > 0) {
 644                 if (rc->verbose)
 645                         fprintf(stderr, "No block group[%llu, %llu]\n",
 646                                 key.objectid, key.offset);
 647                 btrfs_release_path(&path);
 648                 return -ENOENT;
 649         }
 650
 651         l = path.nodes[0];
 652         slot = path.slots[0];
 653         bg_ptr = btrfs_item_ptr(l, slot, struct btrfs_block_group_item);
 654         if (chunk->type_flags != btrfs_disk_block_group_flags(l, bg_ptr)) {
 655                 if (rc->verbose)
 656                         fprintf(stderr,
 657                                 "Chunk[%llu, %llu]'s type(%llu) is differemt with Block Group's type(%llu)\n",
 658                                 chunk->offset, chunk->length, chunk->type_flags,
 659                                 btrfs_disk_block_group_flags(l, bg_ptr));
 660                 btrfs_release_path(&path);
 661                 return -ENOENT;
 662         }
 663         btrfs_release_path(&path);
 664         return 0;
 665 }
 666
 667 static int check_all_chunks_by_metadata(struct recover_control *rc,
 668                                         struct btrfs_root *root)
 669 {
 670         struct chunk_record *chunk;
 671         struct chunk_record *next;
 672         LIST_HEAD(orphan_chunks);
 673         int ret = 0;
 674         int err;
 675
 676         list_for_each_entry_safe(chunk, next, &rc->good_chunks, list) {
 677                 err = check_chunk_by_metadata(rc, root, chunk, 0);
 678                 if (err) {
 679                         if (err == -ENOENT)
 680                                 list_move_tail(&chunk->list, &orphan_chunks);
 681                         else if (err && !ret)
 682                                 ret = err;
 683                 }
 684         }
 685
 686         list_for_each_entry_safe(chunk, next, &rc->unrepaired_chunks, list) {
 687                 err = check_chunk_by_metadata(rc, root, chunk, 1);
 688                 if (err == -ENOENT)
 689                         list_move_tail(&chunk->list, &orphan_chunks);
 690                 else if (err && !ret)
 691                         ret = err;
 692         }
 693
 694         list_for_each_entry(chunk, &rc->bad_chunks, list) {
 695                 err = check_chunk_by_metadata(rc, root, chunk, 1);
 696                 if (err != -ENOENT && !ret)
 697                         ret = err ? err : -EINVAL;
 698         }
 699         list_splice(&orphan_chunks, &rc->bad_chunks);
 700         return ret;
 701 }
 702
 703 static int extract_metadata_record(struct recover_control *rc,
 704                                    struct extent_buffer *leaf)
 705 {
 706         struct btrfs_key key;
 707         int ret = 0;
 708         int i;
 709         u32 nritems;
 710
 711         nritems = btrfs_header_nritems(leaf);
 712         for (i = 0; i < nritems; i++) {
 713                 btrfs_item_key_to_cpu(leaf, &key, i);
 714                 switch (key.type) {
 715                 case BTRFS_BLOCK_GROUP_ITEM_KEY:
 716                         pthread_mutex_lock(&rc->rc_lock);
 717                         ret = process_block_group_item(&rc->bg, leaf, &key, i);
 718                         pthread_mutex_unlock(&rc->rc_lock);
 719                         break;
 720                 case BTRFS_CHUNK_ITEM_KEY:
 721                         pthread_mutex_lock(&rc->rc_lock);
 722                         ret = process_chunk_item(&rc->chunk, leaf, &key, i);
 723                         pthread_mutex_unlock(&rc->rc_lock);
 724                         break;
 725                 case BTRFS_DEV_EXTENT_KEY:
 726                         pthread_mutex_lock(&rc->rc_lock);
 727                         ret = process_device_extent_item(&rc->devext, leaf,
 728                                                          &key, i);
 729                         pthread_mutex_unlock(&rc->rc_lock);
 730                         break;
 731                 }
 732                 if (ret)
 733                         break;
 734         }
 735         return ret;
 736 }
 737
 738 static inline int is_super_block_address(u64 offset)
 739 {
 740         int i;
 741
 742         for (i = 0; i < BTRFS_SUPER_MIRROR_MAX; i++) {
 743                 if (offset == btrfs_sb_offset(i))
 744                         return 1;
 745         }
 746         return 0;
 747 }
 748
 749 static int scan_one_device(void *dev_scan_struct)
 750 {
 751         struct extent_buffer *buf;
 752         u64 bytenr;
 753         int ret = 0;
 754         struct device_scan *dev_scan = (struct device_scan *)dev_scan_struct;
 755         struct recover_control *rc = dev_scan->rc;
 756         struct btrfs_device *device = dev_scan->dev;
 757         int fd = dev_scan->fd;
 758         int oldtype;
 759
 760         ret = pthread_setcanceltype(PTHREAD_CANCEL_ASYNCHRONOUS, &oldtype);
 761         if (ret)
 762                 return 1;
 763
 764         buf = malloc(sizeof(*buf) + rc->leafsize);
 765         if (!buf)
 766                 return -ENOMEM;
 767         buf->len = rc->leafsize;
 768
 769         bytenr = 0;
 770         while (1) {
 771                 if (is_super_block_address(bytenr))
 772                         bytenr += rc->sectorsize;
 773
 774                 if (pread64(fd, buf->data, rc->leafsize, bytenr) <
 775                     rc->leafsize)
 776                         break;
 777
 778                 if (memcmp_extent_buffer(buf, rc->fs_devices->fsid,
 779                                          btrfs_header_fsid(),
 780                                          BTRFS_FSID_SIZE)) {
 781                         bytenr += rc->sectorsize;
 782                         continue;
 783                 }
 784
 785                 if (verify_tree_block_csum_silent(buf, rc->csum_size)) {
 786                         bytenr += rc->sectorsize;
 787                         continue;
 788                 }
 789
 790                 pthread_mutex_lock(&rc->rc_lock);
 791                 ret = process_extent_buffer(&rc->eb_cache, buf, device, bytenr);
 792                 pthread_mutex_unlock(&rc->rc_lock);
 793                 if (ret)
 794                         goto out;
 795
 796                 if (btrfs_header_level(buf) != 0)
 797                         goto next_node;
 798
 799                 switch (btrfs_header_owner(buf)) {
 800                 case BTRFS_EXTENT_TREE_OBJECTID:
 801                 case BTRFS_DEV_TREE_OBJECTID:
 802                         /* different tree use different generation */
 803                         if (btrfs_header_generation(buf) > rc->generation)
 804                                 break;
 805                         ret = extract_metadata_record(rc, buf);
 806                         if (ret)
 807                                 goto out;
 808                         break;
 809                 case BTRFS_CHUNK_TREE_OBJECTID:
 810                         if (btrfs_header_generation(buf) >
 811                             rc->chunk_root_generation)
 812                                 break;
 813                         ret = extract_metadata_record(rc, buf);
 814                         if (ret)
 815                                 goto out;
 816                         break;
 817                 }
 818 next_node:
 819                 bytenr += rc->leafsize;
 820         }
 821 out:
 822         close(fd);
 823         free(buf);
 824         return ret;
 825 }
 826
 827 static int scan_devices(struct recover_control *rc)
 828 {
 829         int ret = 0;
 830         int fd;
 831         struct btrfs_device *dev;
 832         struct device_scan *dev_scans;
 833         pthread_t *t_scans;
 834         long *t_rets;
 835         int devnr = 0;
 836         int devidx = 0;
 837         int cancel_from = 0;
 838         int cancel_to = 0;
 839         int i;
 840
 841         list_for_each_entry(dev, &rc->fs_devices->devices, dev_list)
 842                 devnr++;
 843         dev_scans = (struct device_scan *)malloc(sizeof(struct device_scan)
 844                                                  * devnr);
 845         if (!dev_scans)
 846                 return -ENOMEM;
 847         t_scans = (pthread_t *)malloc(sizeof(pthread_t) * devnr);
 848         if (!t_scans)
 849                 return -ENOMEM;
 850         t_rets = (long *)malloc(sizeof(long) * devnr);
 851         if (!t_rets)
 852                 return -ENOMEM;
 853
 854         list_for_each_entry(dev, &rc->fs_devices->devices, dev_list) {
 855                 fd = open(dev->name, O_RDONLY);
 856                 if (fd < 0) {
 857                         fprintf(stderr, "Failed to open device %s\n",
 858                                 dev->name);
 859                         ret = 1;
 860                         goto out2;
 861                 }
 862                 dev_scans[devidx].rc = rc;
 863                 dev_scans[devidx].dev = dev;
 864                 dev_scans[devidx].fd = fd;
 865                 ret = pthread_create(&t_scans[devidx], NULL,
 866                                      (void *)scan_one_device,
 867                                      (void *)&dev_scans[devidx]);
 868                 if (ret) {
 869                         cancel_from = 0;
 870                         cancel_to = devidx - 1;
 871                         goto out1;
 872                 }
 873                 devidx++;
 874         }
 875
 876         for (i = 0; i < devidx; i++) {
 877                 ret = pthread_join(t_scans[i], (void **)&t_rets[i]);
 878                 if (ret || t_rets[i]) {
 879                         ret = 1;
 880                         cancel_from = i + 1;
 881                         cancel_to = devnr - 1;
 882                         goto out1;
 883                 }
 884         }
 885 out1:
 886         while (ret && (cancel_from <= cancel_to)) {
 887                 pthread_cancel(t_scans[cancel_from]);
 888                 cancel_from++;
 889         }
 890 out2:
 891         free(dev_scans);
 892         free(t_scans);
 893         free(t_rets);
 894         return !!ret;
 895 }
 896
 897 static int build_device_map_by_chunk_record(struct btrfs_root *root,
 898                                             struct chunk_record *chunk)
 899 {
 900         int ret = 0;
 901         int i;
 902         u64 devid;
 903         u8 uuid[BTRFS_UUID_SIZE];
 904         u16 num_stripes;
 905         struct btrfs_mapping_tree *map_tree;
 906         struct map_lookup *map;
 907         struct stripe *stripe;
 908
 909         map_tree = &root->fs_info->mapping_tree;
 910         num_stripes = chunk->num_stripes;
 911         map = malloc(btrfs_map_lookup_size(num_stripes));
 912         if (!map)
 913                 return -ENOMEM;
 914         map->ce.start = chunk->offset;
 915         map->ce.size = chunk->length;
 916         map->num_stripes = num_stripes;
 917         map->io_width = chunk->io_width;
 918         map->io_align = chunk->io_align;
 919         map->sector_size = chunk->sector_size;
 920         map->stripe_len = chunk->stripe_len;
 921         map->type = chunk->type_flags;
 922         map->sub_stripes = chunk->sub_stripes;
 923
 924         for (i = 0, stripe = chunk->stripes; i < num_stripes; i++, stripe++) {
 925                 devid = stripe->devid;
 926                 memcpy(uuid, stripe->dev_uuid, BTRFS_UUID_SIZE);
 927                 map->stripes[i].physical = stripe->offset;
 928                 map->stripes[i].dev = btrfs_find_device(root, devid,
 929                                                         uuid, NULL);
 930                 if (!map->stripes[i].dev) {
 931                         kfree(map);
 932                         return -EIO;
 933                 }
 934         }
 935
 936         ret = insert_cache_extent(&map_tree->cache_tree, &map->ce);
 937         return ret;
 938 }
 939
 940 static int build_device_maps_by_chunk_records(struct recover_control *rc,
 941                                               struct btrfs_root *root)
 942 {
 943         int ret = 0;
 944         struct chunk_record *chunk;
 945
 946         list_for_each_entry(chunk, &rc->good_chunks, list) {
 947                 ret = build_device_map_by_chunk_record(root, chunk);
 948                 if (ret)
 949                         return ret;
 950         }
 951         list_for_each_entry(chunk, &rc->rebuild_chunks, list) {
 952                 ret = build_device_map_by_chunk_record(root, chunk);
 953                 if (ret)
 954                         return ret;
 955         }
 956         return ret;
 957 }
 958
 959 static int block_group_remove_all_extent_items(struct btrfs_trans_handle *trans,
 960                                                struct btrfs_root *root,
 961                                                struct block_group_record *bg)
 962 {
 963         struct btrfs_fs_info *fs_info = root->fs_info;
 964         struct btrfs_key key;
 965         struct btrfs_path path;
 966         struct extent_buffer *leaf;
 967         u64 start = bg->objectid;
 968         u64 end = bg->objectid + bg->offset;
 969         u64 old_val;
 970         int nitems;
 971         int ret;
 972         int i;
 973         int del_s, del_nr;
 974
 975         btrfs_init_path(&path);
 976         root = root->fs_info->extent_root;
 977
 978         key.objectid = start;
 979         key.offset = 0;
 980         key.type = BTRFS_EXTENT_ITEM_KEY;
 981 again:
 982         ret = btrfs_search_slot(trans, root, &key, &path, -1, 1);
 983         if (ret < 0)
 984                 goto err;
 985         else if (ret > 0)
 986                 ret = 0;
 987
 988         leaf = path.nodes[0];
 989         nitems = btrfs_header_nritems(leaf);
 990         if (!nitems) {
 991                 /* The tree is empty. */
 992                 ret = 0;
 993                 goto err;
 994         }
 995
 996         if (path.slots[0] >= nitems) {
 997                 ret = btrfs_next_leaf(root, &path);
 998                 if (ret < 0)
 999                         goto err;
1000                 if (ret > 0) {
1001                         ret = 0;
1002                         goto err;
1003                 }
1004                 leaf = path.nodes[0];
1005                 btrfs_item_key_to_cpu(leaf, &key, 0);
1006                 if (key.objectid >= end)
1007                         goto err;
1008                 btrfs_release_path(&path);
1009                 goto again;
1010         }
1011
1012         del_nr = 0;
1013         del_s = -1;
1014         for (i = path.slots[0]; i < nitems; i++) {
1015                 btrfs_item_key_to_cpu(leaf, &key, i);
1016                 if (key.objectid >= end)
1017                         break;
1018
1019                 if (key.type == BTRFS_BLOCK_GROUP_ITEM_KEY) {
1020                         if (del_nr == 0)
1021                                 continue;
1022                         else
1023                                 break;
1024                 }
1025
1026                 if (del_s == -1)
1027                         del_s = i;
1028                 del_nr++;
1029                 if (key.type == BTRFS_EXTENT_ITEM_KEY ||
1030                     key.type == BTRFS_METADATA_ITEM_KEY) {
1031                         old_val = btrfs_super_bytes_used(fs_info->super_copy);
1032                         if (key.type == BTRFS_METADATA_ITEM_KEY)
1033                                 old_val += root->leafsize;
1034                         else
1035                                 old_val += key.offset;
1036                         btrfs_set_super_bytes_used(fs_info->super_copy,
1037                                                    old_val);
1038                 }
1039         }
1040
1041         if (del_nr) {
1042                 ret = btrfs_del_items(trans, root, &path, del_s, del_nr);
1043                 if (ret)
1044                         goto err;
1045         }
1046
1047         if (key.objectid < end) {
1048                 if (key.type == BTRFS_BLOCK_GROUP_ITEM_KEY) {
1049                         key.objectid += root->sectorsize;
1050                         key.type = BTRFS_EXTENT_ITEM_KEY;
1051                         key.offset = 0;
1052                 }
1053                 btrfs_release_path(&path);
1054                 goto again;
1055         }
1056 err:
1057         btrfs_release_path(&path);
1058         return ret;
1059 }
1060
1061 static int block_group_free_all_extent(struct btrfs_trans_handle *trans,
1062                                        struct btrfs_root *root,
1063                                        struct block_group_record *bg)
1064 {
1065         struct btrfs_block_group_cache *cache;
1066         struct btrfs_fs_info *info;
1067         u64 start;
1068         u64 end;
1069
1070         info = root->fs_info;
1071         cache = btrfs_lookup_block_group(info, bg->objectid);
1072         if (!cache)
1073                 return -ENOENT;
1074
1075         start = cache->key.objectid;
1076         end = start + cache->key.offset - 1;
1077
1078         set_extent_bits(&info->block_group_cache, start, end,
1079                         BLOCK_GROUP_DIRTY, GFP_NOFS);
1080         set_extent_dirty(&info->free_space_cache, start, end, GFP_NOFS);
1081
1082         btrfs_set_block_group_used(&cache->item, 0);
1083
1084         return 0;
1085 }
1086
1087 static int remove_chunk_extent_item(struct btrfs_trans_handle *trans,
1088                                     struct recover_control *rc,
1089                                     struct btrfs_root *root)
1090 {
1091         struct chunk_record *chunk;
1092         int ret = 0;
1093
1094         list_for_each_entry(chunk, &rc->good_chunks, list) {
1095                 if (!(chunk->type_flags & BTRFS_BLOCK_GROUP_SYSTEM))
1096                         continue;
1097                 ret = block_group_remove_all_extent_items(trans, root,
1098                                                           chunk->bg_rec);
1099                 if (ret)
1100                         return ret;
1101
1102                 ret = block_group_free_all_extent(trans, root, chunk->bg_rec);
1103                 if (ret)
1104                         return ret;
1105         }
1106         return ret;
1107 }
1108
1109 static int __rebuild_chunk_root(struct btrfs_trans_handle *trans,
1110                                 struct recover_control *rc,
1111                                 struct btrfs_root *root)
1112 {
1113         u64 min_devid = -1;
1114         struct btrfs_device *dev;
1115         struct extent_buffer *cow;
1116         struct btrfs_disk_key disk_key;
1117         int ret = 0;
1118
1119         list_for_each_entry(dev, &rc->fs_devices->devices, dev_list) {
1120                 if (min_devid > dev->devid)
1121                         min_devid = dev->devid;
1122         }
1123         disk_key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
1124         disk_key.type = BTRFS_DEV_ITEM_KEY;
1125         disk_key.offset = min_devid;
1126
1127         cow = btrfs_alloc_free_block(trans, root, root->nodesize,
1128                                      BTRFS_CHUNK_TREE_OBJECTID,
1129                                      &disk_key, 0, 0, 0);
1130         btrfs_set_header_bytenr(cow, cow->start);
1131         btrfs_set_header_generation(cow, trans->transid);
1132         btrfs_set_header_nritems(cow, 0);
1133         btrfs_set_header_level(cow, 0);
1134         btrfs_set_header_backref_rev(cow, BTRFS_MIXED_BACKREF_REV);
1135         btrfs_set_header_owner(cow, BTRFS_CHUNK_TREE_OBJECTID);
1136         write_extent_buffer(cow, root->fs_info->fsid,
1137                         btrfs_header_fsid(), BTRFS_FSID_SIZE);
1138
1139         write_extent_buffer(cow, root->fs_info->chunk_tree_uuid,
1140                         btrfs_header_chunk_tree_uuid(cow),
1141                         BTRFS_UUID_SIZE);
1142
1143         root->node = cow;
1144         btrfs_mark_buffer_dirty(cow);
1145
1146         return ret;
1147 }
1148
1149 static int __rebuild_device_items(struct btrfs_trans_handle *trans,
1150                                   struct recover_control *rc,
1151                                   struct btrfs_root *root)
1152 {
1153         struct btrfs_device *dev;
1154         struct btrfs_key key;
1155         struct btrfs_dev_item *dev_item;
1156         int ret = 0;
1157
1158         dev_item = malloc(sizeof(struct btrfs_dev_item));
1159         if (!dev_item)
1160                 return -ENOMEM;
1161
1162         list_for_each_entry(dev, &rc->fs_devices->devices, dev_list) {
1163                 key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
1164                 key.type = BTRFS_DEV_ITEM_KEY;
1165                 key.offset = dev->devid;
1166
1167                 btrfs_set_stack_device_generation(dev_item, 0);
1168                 btrfs_set_stack_device_type(dev_item, dev->type);
1169                 btrfs_set_stack_device_id(dev_item, dev->devid);
1170                 btrfs_set_stack_device_total_bytes(dev_item, dev->total_bytes);
1171                 btrfs_set_stack_device_bytes_used(dev_item, dev->bytes_used);
1172                 btrfs_set_stack_device_io_align(dev_item, dev->io_align);
1173                 btrfs_set_stack_device_io_width(dev_item, dev->io_width);
1174                 btrfs_set_stack_device_sector_size(dev_item, dev->sector_size);
1175                 memcpy(dev_item->uuid, dev->uuid, BTRFS_UUID_SIZE);
1176                 memcpy(dev_item->fsid, dev->fs_devices->fsid, BTRFS_UUID_SIZE);
1177
1178                 ret = btrfs_insert_item(trans, root, &key,
1179                                         dev_item, sizeof(*dev_item));
1180         }
1181
1182         free(dev_item);
1183         return ret;
1184 }
1185
1186 static int __insert_chunk_item(struct btrfs_trans_handle *trans,
1187                                 struct chunk_record *chunk_rec,
1188                                 struct btrfs_root *chunk_root)
1189 {
1190         struct btrfs_key key;
1191         struct btrfs_chunk *chunk = NULL;
1192         int ret = 0;
1193
1194         chunk = create_chunk_item(chunk_rec);
1195         if (!chunk)
1196                 return -ENOMEM;
1197         key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID;
1198         key.type = BTRFS_CHUNK_ITEM_KEY;
1199         key.offset = chunk_rec->offset;
1200
1201         ret = btrfs_insert_item(trans, chunk_root, &key, chunk,
1202                                 btrfs_chunk_item_size(chunk->num_stripes));
1203         free(chunk);
1204         return ret;
1205 }
1206
1207 static int __rebuild_chunk_items(struct btrfs_trans_handle *trans,
1208                                  struct recover_control *rc,
1209                                  struct btrfs_root *root)
1210 {
1211         struct btrfs_root *chunk_root;
1212         struct chunk_record *chunk_rec;
1213         int ret;
1214
1215         chunk_root = root->fs_info->chunk_root;
1216
1217         list_for_each_entry(chunk_rec, &rc->good_chunks, list) {
1218                 ret = __insert_chunk_item(trans, chunk_rec, chunk_root);
1219                 if (ret)
1220                         return ret;
1221         }
1222         list_for_each_entry(chunk_rec, &rc->rebuild_chunks, list) {
1223                 ret = __insert_chunk_item(trans, chunk_rec, chunk_root);
1224                 if (ret)
1225                         return ret;
1226         }
1227         return 0;
1228 }
1229
1230 static int rebuild_chunk_tree(struct btrfs_trans_handle *trans,
1231                               struct recover_control *rc,
1232                               struct btrfs_root *root)
1233 {
1234         int ret = 0;
1235
1236         root = root->fs_info->chunk_root;
1237
1238         ret = __rebuild_chunk_root(trans, rc, root);
1239         if (ret)
1240                 return ret;
1241
1242         ret = __rebuild_device_items(trans, rc, root);
1243         if (ret)
1244                 return ret;
1245
1246         ret = __rebuild_chunk_items(trans, rc, root);
1247
1248         return ret;
1249 }
1250
1251 static int rebuild_sys_array(struct recover_control *rc,
1252                              struct btrfs_root *root)
1253 {
1254         struct btrfs_chunk *chunk;
1255         struct btrfs_key key;
1256         struct chunk_record *chunk_rec;
1257         int ret = 0;
1258         u16 num_stripes;
1259
1260         btrfs_set_super_sys_array_size(root->fs_info->super_copy, 0);
1261
1262         list_for_each_entry(chunk_rec, &rc->good_chunks, list) {
1263                 if (!(chunk_rec->type_flags & BTRFS_BLOCK_GROUP_SYSTEM))
1264                         continue;
1265
1266                 num_stripes = chunk_rec->num_stripes;
1267                 chunk = create_chunk_item(chunk_rec);
1268                 if (!chunk) {
1269                         ret = -ENOMEM;
1270                         break;
1271                 }
1272
1273                 key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID;
1274                 key.type = BTRFS_CHUNK_ITEM_KEY;
1275                 key.offset = chunk_rec->offset;
1276
1277                 ret = btrfs_add_system_chunk(NULL, root, &key, chunk,
1278                                 btrfs_chunk_item_size(num_stripes));
1279                 free(chunk);
1280                 if (ret)
1281                         break;
1282         }
1283         return ret;
1284
1285 }
1286
1287 static int calculate_bg_used(struct btrfs_root *extent_root,
1288                              struct chunk_record *chunk_rec,
1289                              struct btrfs_path *path,
1290                              u64 *used)
1291 {
1292         struct extent_buffer *node;
1293         struct btrfs_key found_key;
1294         int slot;
1295         int ret = 0;
1296         u64 used_ret = 0;
1297
1298         while (1) {
1299                 node = path->nodes[0];
1300                 slot = path->slots[0];
1301                 btrfs_item_key_to_cpu(node, &found_key, slot);
1302                 if (found_key.objectid >= chunk_rec->offset + chunk_rec->length)
1303                         break;
1304                 if (found_key.type != BTRFS_METADATA_ITEM_KEY &&
1305                     found_key.type != BTRFS_EXTENT_DATA_KEY)
1306                         goto next;
1307                 if (found_key.type == BTRFS_METADATA_ITEM_KEY)
1308                         used_ret += extent_root->nodesize;
1309                 else
1310                         used_ret += found_key.offset;
1311 next:
1312                 if (slot + 1 < btrfs_header_nritems(node)) {
1313                         slot++;
1314                 } else {
1315                         ret = btrfs_next_leaf(extent_root, path);
1316                         if (ret > 0) {
1317                                 ret = 0;
1318                                 break;
1319                         }
1320                         if (ret < 0)
1321                                 break;
1322                 }
1323         }
1324         if (!ret)
1325                 *used = used_ret;
1326         return ret;
1327 }
1328
1329 static int __insert_block_group(struct btrfs_trans_handle *trans,
1330                                 struct chunk_record *chunk_rec,
1331                                 struct btrfs_root *extent_root,
1332                                 u64 used)
1333 {
1334         struct btrfs_block_group_item bg_item;
1335         struct btrfs_key key;
1336         int ret = 0;
1337
1338         btrfs_set_block_group_used(&bg_item, used);
1339         btrfs_set_block_group_chunk_objectid(&bg_item, used);
1340         btrfs_set_block_group_flags(&bg_item, chunk_rec->type_flags);
1341         key.objectid = chunk_rec->offset;
1342         key.type = BTRFS_BLOCK_GROUP_ITEM_KEY;
1343         key.offset = chunk_rec->length;
1344
1345         ret = btrfs_insert_item(trans, extent_root, &key, &bg_item,
1346                                 sizeof(bg_item));
1347         return ret;
1348 }
1349
1350 /*
1351  * Search through the extent tree to rebuild the 'used' member of the block
1352  * group.
1353  * However, since block group and extent item shares the extent tree,
1354  * the extent item may also missing.
1355  * In that case, we fill the 'used' with the length of the block group to
1356  * ensure no write into the block group.
1357  * Btrfsck will hate it but we will inform user to call '--init-extent-tree'
1358  * if possible, or just salvage as much data as possible from the fs.
1359  */
1360 static int rebuild_block_group(struct btrfs_trans_handle *trans,
1361                                struct recover_control *rc,
1362                                struct btrfs_root *root)
1363 {
1364         struct chunk_record *chunk_rec;
1365         struct btrfs_key search_key;
1366         struct btrfs_path *path;
1367         u64 used = 0;
1368         int ret = 0;
1369
1370         if (list_empty(&rc->rebuild_chunks))
1371                 return 0;
1372
1373         path = btrfs_alloc_path();
1374         if (!path)
1375                 return -ENOMEM;
1376         list_for_each_entry(chunk_rec, &rc->rebuild_chunks, list) {
1377                 search_key.objectid = chunk_rec->offset;
1378                 search_key.type = BTRFS_EXTENT_ITEM_KEY;
1379                 search_key.offset = 0;
1380                 ret = btrfs_search_slot(NULL, root->fs_info->extent_root,
1381                                         &search_key, path, 0, 0);
1382                 if (ret < 0)
1383                         goto out;
1384                 ret = calculate_bg_used(root->fs_info->extent_root,
1385                                         chunk_rec, path, &used);
1386                 /*
1387                  * Extent tree is damaged, better to rebuild the whole extent
1388                  * tree. Currently, change the used to chunk's len to prevent
1389                  * write/block reserve happening in that block group.
1390                  */
1391                 if (ret < 0) {
1392                         fprintf(stderr,
1393                                 "Fail to search extent tree for block group: [%llu,%llu]\n",
1394                                 chunk_rec->offset,
1395                                 chunk_rec->offset + chunk_rec->length);
1396                         fprintf(stderr,
1397                                 "Mark the block group full to prevent block rsv problems\n");
1398                         used = chunk_rec->length;
1399                 }
1400                 btrfs_release_path(path);
1401                 ret = __insert_block_group(trans, chunk_rec,
1402                                            root->fs_info->extent_root,
1403                                            used);
1404                 if (ret < 0)
1405                         goto out;
1406         }
1407 out:
1408         btrfs_free_path(path);
1409         return ret;
1410 }
1411
1412 static struct btrfs_root *
1413 open_ctree_with_broken_chunk(struct recover_control *rc)
1414 {
1415         struct btrfs_fs_info *fs_info;
1416         struct btrfs_super_block *disk_super;
1417         struct extent_buffer *eb;
1418         u32 sectorsize;
1419         u32 nodesize;
1420         u32 leafsize;
1421         u32 stripesize;
1422         int ret;
1423
1424         fs_info = btrfs_new_fs_info(1, BTRFS_SUPER_INFO_OFFSET);
1425         if (!fs_info) {
1426                 fprintf(stderr, "Failed to allocate memory for fs_info\n");
1427                 return ERR_PTR(-ENOMEM);
1428         }
1429         fs_info->is_chunk_recover = 1;
1430
1431         fs_info->fs_devices = rc->fs_devices;
1432         ret = btrfs_open_devices(fs_info->fs_devices, O_RDWR);
1433         if (ret)
1434                 goto out;
1435
1436         disk_super = fs_info->super_copy;
1437         ret = btrfs_read_dev_super(fs_info->fs_devices->latest_bdev,
1438                                    disk_super, fs_info->super_bytenr, 1);
1439         if (ret) {
1440                 fprintf(stderr, "No valid btrfs found\n");
1441                 goto out_devices;
1442         }
1443
1444         memcpy(fs_info->fsid, &disk_super->fsid, BTRFS_FSID_SIZE);
1445
1446         ret = btrfs_check_fs_compatibility(disk_super, 1);
1447         if (ret)
1448                 goto out_devices;
1449
1450         nodesize = btrfs_super_nodesize(disk_super);
1451         leafsize = btrfs_super_leafsize(disk_super);
1452         sectorsize = btrfs_super_sectorsize(disk_super);
1453         stripesize = btrfs_super_stripesize(disk_super);
1454
1455         __setup_root(nodesize, leafsize, sectorsize, stripesize,
1456                      fs_info->chunk_root, fs_info, BTRFS_CHUNK_TREE_OBJECTID);
1457
1458         ret = build_device_maps_by_chunk_records(rc, fs_info->chunk_root);
1459         if (ret)
1460                 goto out_cleanup;
1461
1462         ret = btrfs_setup_all_roots(fs_info, 0, 0);
1463         if (ret)
1464                 goto out_failed;
1465
1466         eb = fs_info->tree_root->node;
1467         read_extent_buffer(eb, fs_info->chunk_tree_uuid,
1468                            btrfs_header_chunk_tree_uuid(eb),
1469                            BTRFS_UUID_SIZE);
1470
1471         return fs_info->fs_root;
1472 out_failed:
1473         btrfs_release_all_roots(fs_info);
1474 out_cleanup:
1475         btrfs_cleanup_all_caches(fs_info);
1476 out_devices:
1477         btrfs_close_devices(fs_info->fs_devices);
1478 out:
1479         btrfs_free_fs_info(fs_info);
1480         return ERR_PTR(ret);
1481 }
1482
1483 static int recover_prepare(struct recover_control *rc, char *path)
1484 {
1485         int ret;
1486         int fd;
1487         struct btrfs_super_block *sb;
1488         struct btrfs_fs_devices *fs_devices;
1489
1490         ret = 0;
1491         fd = open(path, O_RDONLY);
1492         if (fd < 0) {
1493                 fprintf(stderr, "open %s\n error.\n", path);
1494                 return -1;
1495         }
1496
1497         sb = malloc(BTRFS_SUPER_INFO_SIZE);
1498         if (!sb) {
1499                 fprintf(stderr, "allocating memory for sb failed.\n");
1500                 ret = -ENOMEM;
1501                 goto fail_close_fd;
1502         }
1503
1504         ret = btrfs_read_dev_super(fd, sb, BTRFS_SUPER_INFO_OFFSET, 1);
1505         if (ret) {
1506                 fprintf(stderr, "read super block error\n");
1507                 goto fail_free_sb;
1508         }
1509
1510         rc->sectorsize = btrfs_super_sectorsize(sb);
1511         rc->leafsize = btrfs_super_leafsize(sb);
1512         rc->generation = btrfs_super_generation(sb);
1513         rc->chunk_root_generation = btrfs_super_chunk_root_generation(sb);
1514         rc->csum_size = btrfs_super_csum_size(sb);
1515
1516         /* if seed, the result of scanning below will be partial */
1517         if (btrfs_super_flags(sb) & BTRFS_SUPER_FLAG_SEEDING) {
1518                 fprintf(stderr, "this device is seed device\n");
1519                 ret = -1;
1520                 goto fail_free_sb;
1521         }
1522
1523         ret = btrfs_scan_fs_devices(fd, path, &fs_devices, 0, 1, 0);
1524         if (ret)
1525                 goto fail_free_sb;
1526
1527         rc->fs_devices = fs_devices;
1528
1529         if (rc->verbose)
1530                 print_all_devices(&rc->fs_devices->devices);
1531
1532 fail_free_sb:
1533         free(sb);
1534 fail_close_fd:
1535         close(fd);
1536         return ret;
1537 }
1538
1539 static int btrfs_get_device_extents(u64 chunk_object,
1540                                     struct list_head *orphan_devexts,
1541                                     struct list_head *ret_list)
1542 {
1543         struct device_extent_record *devext;
1544         struct device_extent_record *next;
1545         int count = 0;
1546
1547         list_for_each_entry_safe(devext, next, orphan_devexts, chunk_list) {
1548                 if (devext->chunk_offset == chunk_object) {
1549                         list_move_tail(&devext->chunk_list, ret_list);
1550                         count++;
1551                 }
1552         }
1553         return count;
1554 }
1555
1556 static int calc_num_stripes(u64 type)
1557 {
1558         if (type & (BTRFS_BLOCK_GROUP_RAID0 |
1559                     BTRFS_BLOCK_GROUP_RAID10 |
1560                     BTRFS_BLOCK_GROUP_RAID5 |
1561                     BTRFS_BLOCK_GROUP_RAID6))
1562                 return 0;
1563         else if (type & (BTRFS_BLOCK_GROUP_RAID1 |
1564                          BTRFS_BLOCK_GROUP_DUP))
1565                 return 2;
1566         else
1567                 return 1;
1568 }
1569
1570 static inline int calc_sub_nstripes(u64 type)
1571 {
1572         if (type & BTRFS_BLOCK_GROUP_RAID10)
1573                 return 2;
1574         else
1575                 return 1;
1576 }
1577
1578 static int btrfs_verify_device_extents(struct block_group_record *bg,
1579                                        struct list_head *devexts, int ndevexts)
1580 {
1581         struct device_extent_record *devext;
1582         u64 strpie_length;
1583         int expected_num_stripes;
1584
1585         expected_num_stripes = calc_num_stripes(bg->flags);
1586         if (expected_num_stripes && expected_num_stripes != ndevexts)
1587                 return 1;
1588
1589         strpie_length = calc_stripe_length(bg->flags, bg->offset, ndevexts);
1590         list_for_each_entry(devext, devexts, chunk_list) {
1591                 if (devext->length != strpie_length)
1592                         return 1;
1593         }
1594         return 0;
1595 }
1596
1597 static int btrfs_rebuild_unordered_chunk_stripes(struct recover_control *rc,
1598                                                  struct chunk_record *chunk)
1599 {
1600         struct device_extent_record *devext;
1601         struct btrfs_device *device;
1602         int i;
1603
1604         devext = list_first_entry(&chunk->dextents, struct device_extent_record,
1605                                   chunk_list);
1606         for (i = 0; i < chunk->num_stripes; i++) {
1607                 chunk->stripes[i].devid = devext->objectid;
1608                 chunk->stripes[i].offset = devext->offset;
1609                 device = btrfs_find_device_by_devid(rc->fs_devices,
1610                                                     devext->objectid,
1611                                                     0);
1612                 if (!device)
1613                         return -ENOENT;
1614                 BUG_ON(btrfs_find_device_by_devid(rc->fs_devices,
1615                                                   devext->objectid,
1616                                                   1));
1617                 memcpy(chunk->stripes[i].dev_uuid, device->uuid,
1618                        BTRFS_UUID_SIZE);
1619                 devext = list_next_entry(devext, chunk_list);
1620         }
1621         return 0;
1622 }
1623
1624 static int btrfs_calc_stripe_index(struct chunk_record *chunk, u64 logical)
1625 {
1626         u64 offset = logical - chunk->offset;
1627         int stripe_nr;
1628         int nr_data_stripes;
1629         int index;
1630
1631         stripe_nr = offset / chunk->stripe_len;
1632         if (chunk->type_flags & BTRFS_BLOCK_GROUP_RAID0) {
1633                 index = stripe_nr % chunk->num_stripes;
1634         } else if (chunk->type_flags & BTRFS_BLOCK_GROUP_RAID10) {
1635                 index = stripe_nr % (chunk->num_stripes / chunk->sub_stripes);
1636                 index *= chunk->sub_stripes;
1637         } else if (chunk->type_flags & BTRFS_BLOCK_GROUP_RAID5) {
1638                 nr_data_stripes = chunk->num_stripes - 1;
1639                 index = stripe_nr % nr_data_stripes;
1640                 stripe_nr /= nr_data_stripes;
1641                 index = (index + stripe_nr) % chunk->num_stripes;
1642         } else if (chunk->type_flags & BTRFS_BLOCK_GROUP_RAID6) {
1643                 nr_data_stripes = chunk->num_stripes - 2;
1644                 index = stripe_nr % nr_data_stripes;
1645                 stripe_nr /= nr_data_stripes;
1646                 index = (index + stripe_nr) % chunk->num_stripes;
1647         } else {
1648                 return -1;
1649         }
1650         return index;
1651 }
1652
1653 /* calc the logical offset which is the start of the next stripe. */
1654 static inline u64 btrfs_next_stripe_logical_offset(struct chunk_record *chunk,
1655                                                    u64 logical)
1656 {
1657         u64 offset = logical - chunk->offset;
1658
1659         offset /= chunk->stripe_len;
1660         offset *= chunk->stripe_len;
1661         offset += chunk->stripe_len;
1662
1663         return offset + chunk->offset;
1664 }
1665
1666 static int is_extent_record_in_device_extent(struct extent_record *er,
1667                                              struct device_extent_record *dext,
1668                                              int *mirror)
1669 {
1670         int i;
1671
1672         for (i = 0; i < er->nmirrors; i++) {
1673                 if (er->devices[i]->devid == dext->objectid &&
1674                     er->offsets[i] >= dext->offset &&
1675                     er->offsets[i] < dext->offset + dext->length) {
1676                         *mirror = i;
1677                         return 1;
1678                 }
1679         }
1680         return 0;
1681 }
1682
1683 static int
1684 btrfs_rebuild_ordered_meta_chunk_stripes(struct recover_control *rc,
1685                                          struct chunk_record *chunk)
1686 {
1687         u64 start = chunk->offset;
1688         u64 end = chunk->offset + chunk->length;
1689         struct cache_extent *cache;
1690         struct extent_record *er;
1691         struct device_extent_record *devext;
1692         struct device_extent_record *next;
1693         struct btrfs_device *device;
1694         LIST_HEAD(devexts);
1695         int index;
1696         int mirror;
1697         int ret;
1698
1699         cache = lookup_cache_extent(&rc->eb_cache,
1700                                     start, chunk->length);
1701         if (!cache) {
1702                 /* No used space, we can reorder the stripes freely. */
1703                 ret = btrfs_rebuild_unordered_chunk_stripes(rc, chunk);
1704                 return ret;
1705         }
1706
1707         list_splice_init(&chunk->dextents, &devexts);
1708 again:
1709         er = container_of(cache, struct extent_record, cache);
1710         index = btrfs_calc_stripe_index(chunk, er->cache.start);
1711         BUG_ON(index == -1);
1712         if (chunk->stripes[index].devid)
1713                 goto next;
1714         list_for_each_entry_safe(devext, next, &devexts, chunk_list) {
1715                 if (is_extent_record_in_device_extent(er, devext, &mirror)) {
1716                         chunk->stripes[index].devid = devext->objectid;
1717                         chunk->stripes[index].offset = devext->offset;
1718                         memcpy(chunk->stripes[index].dev_uuid,
1719                                er->devices[mirror]->uuid,
1720                                BTRFS_UUID_SIZE);
1721                         index++;
1722                         list_move(&devext->chunk_list, &chunk->dextents);
1723                 }
1724         }
1725 next:
1726         start = btrfs_next_stripe_logical_offset(chunk, er->cache.start);
1727         if (start >= end)
1728                 goto no_extent_record;
1729
1730         cache = lookup_cache_extent(&rc->eb_cache, start, end - start);
1731         if (cache)
1732                 goto again;
1733 no_extent_record:
1734         if (list_empty(&devexts))
1735                 return 0;
1736
1737         if (chunk->type_flags & (BTRFS_BLOCK_GROUP_RAID5 |
1738                                  BTRFS_BLOCK_GROUP_RAID6)) {
1739                 /* Fixme: try to recover the order by the parity block. */
1740                 list_splice_tail(&devexts, &chunk->dextents);
1741                 return -EINVAL;
1742         }
1743
1744         /* There is no data on the lost stripes, we can reorder them freely. */
1745         for (index = 0; index < chunk->num_stripes; index++) {
1746                 if (chunk->stripes[index].devid)
1747                         continue;
1748
1749                 devext = list_first_entry(&devexts,
1750                                           struct device_extent_record,
1751                                            chunk_list);
1752                 list_move(&devext->chunk_list, &chunk->dextents);
1753
1754                 chunk->stripes[index].devid = devext->objectid;
1755                 chunk->stripes[index].offset = devext->offset;
1756                 device = btrfs_find_device_by_devid(rc->fs_devices,
1757                                                     devext->objectid,
1758                                                     0);
1759                 if (!device) {
1760                         list_splice_tail(&devexts, &chunk->dextents);
1761                         return -EINVAL;
1762                 }
1763                 BUG_ON(btrfs_find_device_by_devid(rc->fs_devices,
1764                                                   devext->objectid,
1765                                                   1));
1766                 memcpy(chunk->stripes[index].dev_uuid, device->uuid,
1767                        BTRFS_UUID_SIZE);
1768         }
1769         return 0;
1770 }
1771
1772 #define BTRFS_ORDERED_RAID      (BTRFS_BLOCK_GROUP_RAID0 |      \
1773                                  BTRFS_BLOCK_GROUP_RAID10 |     \
1774                                  BTRFS_BLOCK_GROUP_RAID5 |      \
1775                                  BTRFS_BLOCK_GROUP_RAID6)
1776
1777 static int btrfs_rebuild_chunk_stripes(struct recover_control *rc,
1778                                        struct chunk_record *chunk)
1779 {
1780         int ret;
1781
1782         /*
1783          * All the data in the system metadata chunk will be dropped,
1784          * so we need not guarantee that the data is right or not, that
1785          * is we can reorder the stripes in the system metadata chunk.
1786          */
1787         if ((chunk->type_flags & BTRFS_BLOCK_GROUP_METADATA) &&
1788             (chunk->type_flags & BTRFS_ORDERED_RAID))
1789                 ret =btrfs_rebuild_ordered_meta_chunk_stripes(rc, chunk);
1790         else if ((chunk->type_flags & BTRFS_BLOCK_GROUP_DATA) &&
1791                  (chunk->type_flags & BTRFS_ORDERED_RAID))
1792                 ret = 1;        /* Be handled after the fs is opened. */
1793         else
1794                 ret = btrfs_rebuild_unordered_chunk_stripes(rc, chunk);
1795
1796         return ret;
1797 }
1798
1799 static int next_csum(struct btrfs_root *root,
1800                      struct extent_buffer **leaf,
1801                      struct btrfs_path *path,
1802                      int *slot,
1803                      u64 *csum_offset,
1804                      u32 *tree_csum,
1805                      u64 end,
1806                      struct btrfs_key *key)
1807 {
1808         int ret = 0;
1809         struct btrfs_root *csum_root = root->fs_info->csum_root;
1810         struct btrfs_csum_item *csum_item;
1811         u32 blocksize = root->sectorsize;
1812         u16 csum_size = btrfs_super_csum_size(root->fs_info->super_copy);
1813         int csums_in_item = btrfs_item_size_nr(*leaf, *slot) / csum_size;
1814
1815         if (*csum_offset >= csums_in_item) {
1816                 ++(*slot);
1817                 *csum_offset = 0;
1818                 if (*slot >= btrfs_header_nritems(*leaf)) {
1819                         ret = btrfs_next_leaf(csum_root, path);
1820                         if (ret < 0)
1821                                 return -1;
1822                         else if (ret > 0)
1823                                 return 1;
1824                         *leaf = path->nodes[0];
1825                         *slot = path->slots[0];
1826                 }
1827                 btrfs_item_key_to_cpu(*leaf, key, *slot);
1828         }
1829
1830         if (key->offset + (*csum_offset) * blocksize >= end)
1831                 return 2;
1832         csum_item = btrfs_item_ptr(*leaf, *slot, struct btrfs_csum_item);
1833         csum_item = (struct btrfs_csum_item *)((unsigned char *)csum_item
1834                                              + (*csum_offset) * csum_size);
1835         read_extent_buffer(*leaf, tree_csum,
1836                           (unsigned long)csum_item, csum_size);
1837         return ret;
1838 }
1839
1840 static u64 calc_data_offset(struct btrfs_key *key,
1841                             struct chunk_record *chunk,
1842                             u64 dev_offset,
1843                             u64 csum_offset,
1844                             u32 blocksize)
1845 {
1846         u64 data_offset;
1847         int logical_stripe_nr;
1848         int dev_stripe_nr;
1849         int nr_data_stripes;
1850
1851         data_offset = key->offset + csum_offset * blocksize - chunk->offset;
1852         nr_data_stripes = chunk->num_stripes;
1853
1854         if (chunk->type_flags & BTRFS_BLOCK_GROUP_RAID5)
1855                 nr_data_stripes -= 1;
1856         else if (chunk->type_flags & BTRFS_BLOCK_GROUP_RAID6)
1857                 nr_data_stripes -= 2;
1858
1859         logical_stripe_nr = data_offset / chunk->stripe_len;
1860         dev_stripe_nr = logical_stripe_nr / nr_data_stripes;
1861
1862         data_offset -= logical_stripe_nr * chunk->stripe_len;
1863         data_offset += dev_stripe_nr * chunk->stripe_len;
1864
1865         return dev_offset + data_offset;
1866 }
1867
1868 static int check_one_csum(int fd, u64 start, u32 len, u32 tree_csum)
1869 {
1870         char *data;
1871         int ret = 0;
1872         u32 csum_result = ~(u32)0;
1873
1874         data = malloc(len);
1875         if (!data)
1876                 return -1;
1877         ret = pread64(fd, data, len, start);
1878         if (ret < 0 || ret != len) {
1879                 ret = -1;
1880                 goto out;
1881         }
1882         ret = 0;
1883         csum_result = btrfs_csum_data(NULL, data, csum_result, len);
1884         btrfs_csum_final(csum_result, (char *)&csum_result);
1885         if (csum_result != tree_csum)
1886                 ret = 1;
1887 out:
1888         free(data);
1889         return ret;
1890 }
1891
1892 static u64 item_end_offset(struct btrfs_root *root, struct btrfs_key *key,
1893                            struct extent_buffer *leaf, int slot) {
1894         u32 blocksize = root->sectorsize;
1895         u16 csum_size = btrfs_super_csum_size(root->fs_info->super_copy);
1896
1897         u64 offset = btrfs_item_size_nr(leaf, slot);
1898         offset /= csum_size;
1899         offset *= blocksize;
1900         offset += key->offset;
1901
1902         return offset;
1903 }
1904
1905 static int insert_stripe(struct list_head *devexts,
1906                          struct recover_control *rc,
1907                          struct chunk_record *chunk,
1908                          int index) {
1909         struct device_extent_record *devext;
1910         struct btrfs_device *dev;
1911
1912         devext = list_entry(devexts->next, struct device_extent_record,
1913                             chunk_list);
1914         dev = btrfs_find_device_by_devid(rc->fs_devices, devext->objectid,
1915                                         0);
1916         if (!dev)
1917                 return 1;
1918         BUG_ON(btrfs_find_device_by_devid(rc->fs_devices, devext->objectid,
1919                                         1));
1920
1921         chunk->stripes[index].devid = devext->objectid;
1922         chunk->stripes[index].offset = devext->offset;
1923         memcpy(chunk->stripes[index].dev_uuid, dev->uuid, BTRFS_UUID_SIZE);
1924
1925         list_move(&devext->chunk_list, &chunk->dextents);
1926
1927         return 0;
1928 }
1929
1930 static inline int count_devext_records(struct list_head *record_list)
1931 {
1932         int num_of_records = 0;
1933         struct device_extent_record *devext;
1934
1935         list_for_each_entry(devext, record_list, chunk_list)
1936                 num_of_records++;
1937
1938         return num_of_records;
1939 }
1940
1941 static int fill_chunk_up(struct chunk_record *chunk, struct list_head *devexts,
1942                          struct recover_control *rc)
1943 {
1944         int ret = 0;
1945         int i;
1946
1947         for (i = 0; i < chunk->num_stripes; i++) {
1948                 if (!chunk->stripes[i].devid) {
1949                         ret = insert_stripe(devexts, rc, chunk, i);
1950                         if (ret)
1951                                 break;
1952                 }
1953         }
1954
1955         return ret;
1956 }
1957
1958 #define EQUAL_STRIPE (1 << 0)
1959
1960 static int rebuild_raid_data_chunk_stripes(struct recover_control *rc,
1961                                            struct btrfs_root *root,
1962                                            struct chunk_record *chunk,
1963                                            u8 *flags)
1964 {
1965         int i;
1966         int ret = 0;
1967         int slot;
1968         struct btrfs_path path;
1969         struct btrfs_key prev_key;
1970         struct btrfs_key key;
1971         struct btrfs_root *csum_root;
1972         struct extent_buffer *leaf;
1973         struct device_extent_record *devext;
1974         struct device_extent_record *next;
1975         struct btrfs_device *dev;
1976         u64 start = chunk->offset;
1977         u64 end = start + chunk->stripe_len;
1978         u64 chunk_end = chunk->offset + chunk->length;
1979         u64 csum_offset = 0;
1980         u64 data_offset;
1981         u32 blocksize = root->sectorsize;
1982         u32 tree_csum;
1983         int index = 0;
1984         int num_unordered = 0;
1985         LIST_HEAD(unordered);
1986         LIST_HEAD(candidates);
1987
1988         csum_root = root->fs_info->csum_root;
1989         btrfs_init_path(&path);
1990         list_splice_init(&chunk->dextents, &candidates);
1991 again:
1992         if (list_is_last(candidates.next, &candidates))
1993                 goto out;
1994
1995         key.objectid = BTRFS_EXTENT_CSUM_OBJECTID;
1996         key.type = BTRFS_EXTENT_CSUM_KEY;
1997         key.offset = start;
1998
1999         ret = btrfs_search_slot(NULL, csum_root, &key, &path, 0, 0);
2000         if (ret < 0) {
2001                 fprintf(stderr, "Search csum failed(%d)\n", ret);
2002                 goto fail_out;
2003         }
2004         leaf = path.nodes[0];
2005         slot = path.slots[0];
2006         if (ret > 0) {
2007                 if (slot >= btrfs_header_nritems(leaf)) {
2008                         ret = btrfs_next_leaf(csum_root, &path);
2009                         if (ret < 0) {
2010                                 fprintf(stderr,
2011                                         "Walk tree failed(%d)\n", ret);
2012                                 goto fail_out;
2013                         } else if (ret > 0) {
2014                                 slot = btrfs_header_nritems(leaf) - 1;
2015                                 btrfs_item_key_to_cpu(leaf, &key, slot);
2016                                 if (item_end_offset(root, &key, leaf, slot)
2017                                                                 > start) {
2018                                         csum_offset = start - key.offset;
2019                                         csum_offset /= blocksize;
2020                                         goto next_csum;
2021                                 }
2022                                 goto next_stripe;
2023                         }
2024                         leaf = path.nodes[0];
2025                         slot = path.slots[0];
2026                 }
2027                 btrfs_item_key_to_cpu(leaf, &key, slot);
2028                 ret = btrfs_previous_item(csum_root, &path, 0,
2029                                           BTRFS_EXTENT_CSUM_KEY);
2030                 if (ret < 0)
2031                         goto fail_out;
2032                 else if (ret > 0) {
2033                         if (key.offset >= end)
2034                                 goto next_stripe;
2035                         else
2036                                 goto next_csum;
2037                 }
2038                 leaf = path.nodes[0];
2039                 slot = path.slots[0];
2040
2041                 btrfs_item_key_to_cpu(leaf, &prev_key, slot);
2042                 if (item_end_offset(root, &prev_key, leaf, slot) > start) {
2043                         csum_offset = start - prev_key.offset;
2044                         csum_offset /= blocksize;
2045                         btrfs_item_key_to_cpu(leaf, &key, slot);
2046                 } else {
2047                         if (key.offset >= end)
2048                                 goto next_stripe;
2049                 }
2050
2051                 if (key.offset + csum_offset * blocksize > chunk_end)
2052                         goto out;
2053         }
2054 next_csum:
2055         ret = next_csum(root, &leaf, &path, &slot, &csum_offset, &tree_csum,
2056                         end, &key);
2057         if (ret < 0) {
2058                 fprintf(stderr, "Fetch csum failed\n");
2059                 goto fail_out;
2060         } else if (ret == 1) {
2061                 if (!(*flags & EQUAL_STRIPE))
2062                         *flags |= EQUAL_STRIPE;
2063                 goto out;
2064         } else if (ret == 2)
2065                 goto next_stripe;
2066
2067         list_for_each_entry_safe(devext, next, &candidates, chunk_list) {
2068                 data_offset = calc_data_offset(&key, chunk, devext->offset,
2069                                                csum_offset, blocksize);
2070                 dev = btrfs_find_device_by_devid(rc->fs_devices,
2071                                                  devext->objectid, 0);
2072                 if (!dev) {
2073                         ret = 1;
2074                         goto fail_out;
2075                 }
2076                 BUG_ON(btrfs_find_device_by_devid(rc->fs_devices,
2077                                                   devext->objectid, 1));
2078
2079                 ret = check_one_csum(dev->fd, data_offset, blocksize,
2080                                      tree_csum);
2081                 if (ret < 0)
2082                         goto fail_out;
2083                 else if (ret > 0)
2084                         list_move(&devext->chunk_list, &unordered);
2085         }
2086
2087         if (list_empty(&candidates)) {
2088                 num_unordered = count_devext_records(&unordered);
2089                 if (chunk->type_flags & BTRFS_BLOCK_GROUP_RAID6
2090                                         && num_unordered == 2) {
2091                         btrfs_release_path(&path);
2092                         ret = fill_chunk_up(chunk, &unordered, rc);
2093                         return ret;
2094                 }
2095
2096                 goto next_stripe;
2097         }
2098
2099         if (list_is_last(candidates.next, &candidates)) {
2100                 index = btrfs_calc_stripe_index(chunk,
2101                         key.offset + csum_offset * blocksize);
2102                 BUG_ON(index == -1);
2103                 if (chunk->stripes[index].devid)
2104                         goto next_stripe;
2105                 ret = insert_stripe(&candidates, rc, chunk, index);
2106                 if (ret)
2107                         goto fail_out;
2108         } else {
2109                 csum_offset++;
2110                 goto next_csum;
2111         }
2112 next_stripe:
2113         start = btrfs_next_stripe_logical_offset(chunk, start);
2114         end = min(start + chunk->stripe_len, chunk_end);
2115         list_splice_init(&unordered, &candidates);
2116         btrfs_release_path(&path);
2117         csum_offset = 0;
2118         if (end < chunk_end)
2119                 goto again;
2120 out:
2121         ret = 0;
2122         list_splice_init(&candidates, &unordered);
2123         num_unordered = count_devext_records(&unordered);
2124         if (num_unordered == 1) {
2125                 for (i = 0; i < chunk->num_stripes; i++) {
2126                         if (!chunk->stripes[i].devid) {
2127                                 index = i;
2128                                 break;
2129                         }
2130                 }
2131                 ret = insert_stripe(&unordered, rc, chunk, index);
2132                 if (ret)
2133                         goto fail_out;
2134         } else {
2135                 if ((num_unordered == 2 && chunk->type_flags
2136                         & BTRFS_BLOCK_GROUP_RAID5)
2137                  || (num_unordered == 3 && chunk->type_flags
2138                         & BTRFS_BLOCK_GROUP_RAID6)) {
2139                         ret = fill_chunk_up(chunk, &unordered, rc);
2140                 }
2141         }
2142 fail_out:
2143         ret = !!ret || (list_empty(&unordered) ? 0 : 1);
2144         list_splice_init(&candidates, &chunk->dextents);
2145         list_splice_init(&unordered, &chunk->dextents);
2146         btrfs_release_path(&path);
2147
2148         return ret;
2149 }
2150
2151 static int btrfs_rebuild_ordered_data_chunk_stripes(struct recover_control *rc,
2152                                            struct btrfs_root *root)
2153 {
2154         struct chunk_record *chunk;
2155         struct chunk_record *next;
2156         int ret = 0;
2157         int err;
2158         u8 flags;
2159
2160         list_for_each_entry_safe(chunk, next, &rc->unrepaired_chunks, list) {
2161                 if ((chunk->type_flags & BTRFS_BLOCK_GROUP_DATA)
2162                  && (chunk->type_flags & BTRFS_ORDERED_RAID)) {
2163                         flags = 0;
2164                         err = rebuild_raid_data_chunk_stripes(rc, root, chunk,
2165                                                               &flags);
2166                         if (err) {
2167                                 list_move(&chunk->list, &rc->bad_chunks);
2168                                 if (flags & EQUAL_STRIPE)
2169                                         fprintf(stderr,
2170                         "Failure: too many equal stripes in chunk[%llu %llu]\n",
2171                                                 chunk->offset, chunk->length);
2172                                 if (!ret)
2173                                         ret = err;
2174                         } else
2175                                 list_move(&chunk->list, &rc->good_chunks);
2176                 }
2177         }
2178         return ret;
2179 }
2180
2181 static int btrfs_recover_chunks(struct recover_control *rc)
2182 {
2183         struct chunk_record *chunk;
2184         struct block_group_record *bg;
2185         struct block_group_record *next;
2186         LIST_HEAD(new_chunks);
2187         LIST_HEAD(devexts);
2188         int nstripes;
2189         int ret;
2190
2191         /* create the chunk by block group */
2192         list_for_each_entry_safe(bg, next, &rc->bg.block_groups, list) {
2193                 nstripes = btrfs_get_device_extents(bg->objectid,
2194                                                     &rc->devext.no_chunk_orphans,
2195                                                     &devexts);
2196                 chunk = malloc(btrfs_chunk_record_size(nstripes));
2197                 if (!chunk)
2198                         return -ENOMEM;
2199                 memset(chunk, 0, btrfs_chunk_record_size(nstripes));
2200                 INIT_LIST_HEAD(&chunk->dextents);
2201                 chunk->bg_rec = bg;
2202                 chunk->cache.start = bg->objectid;
2203                 chunk->cache.size = bg->offset;
2204                 chunk->objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID;
2205                 chunk->type = BTRFS_CHUNK_ITEM_KEY;
2206                 chunk->offset = bg->objectid;
2207                 chunk->generation = bg->generation;
2208                 chunk->length = bg->offset;
2209                 chunk->owner = BTRFS_CHUNK_TREE_OBJECTID;
2210                 chunk->stripe_len = BTRFS_STRIPE_LEN;
2211                 chunk->type_flags = bg->flags;
2212                 chunk->io_width = BTRFS_STRIPE_LEN;
2213                 chunk->io_align = BTRFS_STRIPE_LEN;
2214                 chunk->sector_size = rc->sectorsize;
2215                 chunk->sub_stripes = calc_sub_nstripes(bg->flags);
2216
2217                 ret = insert_cache_extent(&rc->chunk, &chunk->cache);
2218                 BUG_ON(ret);
2219
2220                 list_del_init(&bg->list);
2221                 if (!nstripes) {
2222                         list_add_tail(&chunk->list, &rc->bad_chunks);
2223                         continue;
2224                 }
2225
2226                 list_splice_init(&devexts, &chunk->dextents);
2227
2228                 ret = btrfs_verify_device_extents(bg, &devexts, nstripes);
2229                 if (ret) {
2230                         list_add_tail(&chunk->list, &rc->bad_chunks);
2231                         continue;
2232                 }
2233
2234                 chunk->num_stripes = nstripes;
2235                 ret = btrfs_rebuild_chunk_stripes(rc, chunk);
2236                 if (ret > 0)
2237                         list_add_tail(&chunk->list, &rc->unrepaired_chunks);
2238                 else if (ret < 0)
2239                         list_add_tail(&chunk->list, &rc->bad_chunks);
2240                 else
2241                         list_add_tail(&chunk->list, &rc->good_chunks);
2242         }
2243         /*
2244          * Don't worry about the lost orphan device extents, they don't
2245          * have its chunk and block group, they must be the old ones that
2246          * we have dropped.
2247          */
2248         return 0;
2249 }
2250
2251 static inline int is_chunk_overlap(struct chunk_record *chunk1,
2252                                    struct chunk_record *chunk2)
2253 {
2254         if (chunk1->offset >= chunk2->offset + chunk2->length ||
2255             chunk1->offset + chunk1->length <= chunk2->offset)
2256                 return 0;
2257         return 1;
2258 }
2259
2260 /* Move invalid(overlap with good chunks) rebuild chunks to bad chunk list */
2261 static void validate_rebuild_chunks(struct recover_control *rc)
2262 {
2263         struct chunk_record *good;
2264         struct chunk_record *rebuild;
2265         struct chunk_record *tmp;
2266
2267         list_for_each_entry_safe(rebuild, tmp, &rc->rebuild_chunks, list) {
2268                 list_for_each_entry(good, &rc->good_chunks, list) {
2269                         if (is_chunk_overlap(rebuild, good)) {
2270                                 list_move_tail(&rebuild->list,
2271                                                &rc->bad_chunks);
2272                                 break;
2273                         }
2274                 }
2275         }
2276 }
2277
2278 /*
2279  * Return 0 when succesful, < 0 on error and > 0 if aborted by user
2280  */
2281 int btrfs_recover_chunk_tree(char *path, int verbose, int yes)
2282 {
2283         int ret = 0;
2284         struct btrfs_root *root = NULL;
2285         struct btrfs_trans_handle *trans;
2286         struct recover_control rc;
2287
2288         init_recover_control(&rc, verbose, yes);
2289
2290         ret = recover_prepare(&rc, path);
2291         if (ret) {
2292                 fprintf(stderr, "recover prepare error\n");
2293                 return ret;
2294         }
2295
2296         ret = scan_devices(&rc);
2297         if (ret) {
2298                 fprintf(stderr, "scan chunk headers error\n");
2299                 goto fail_rc;
2300         }
2301
2302         if (cache_tree_empty(&rc.chunk) &&
2303             cache_tree_empty(&rc.bg.tree) &&
2304             cache_tree_empty(&rc.devext.tree)) {
2305                 fprintf(stderr, "no recoverable chunk\n");
2306                 goto fail_rc;
2307         }
2308
2309         print_scan_result(&rc);
2310
2311         ret = check_chunks(&rc.chunk, &rc.bg, &rc.devext, &rc.good_chunks,
2312                            &rc.bad_chunks, &rc.rebuild_chunks, 1);
2313         if (ret) {
2314                 if (!list_empty(&rc.bg.block_groups) ||
2315                     !list_empty(&rc.devext.no_chunk_orphans)) {
2316                         ret = btrfs_recover_chunks(&rc);
2317                         if (ret)
2318                                 goto fail_rc;
2319                 }
2320         } else {
2321                 print_check_result(&rc);
2322                 printf("Check chunks successfully with no orphans\n");
2323                 goto fail_rc;
2324         }
2325         validate_rebuild_chunks(&rc);
2326         print_check_result(&rc);
2327
2328         root = open_ctree_with_broken_chunk(&rc);
2329         if (IS_ERR(root)) {
2330                 fprintf(stderr, "open with broken chunk error\n");
2331                 ret = PTR_ERR(root);
2332                 goto fail_rc;
2333         }
2334
2335         ret = check_all_chunks_by_metadata(&rc, root);
2336         if (ret) {
2337                 fprintf(stderr, "The chunks in memory can not match the metadata of the fs. Repair failed.\n");
2338                 goto fail_close_ctree;
2339         }
2340
2341         ret = btrfs_rebuild_ordered_data_chunk_stripes(&rc, root);
2342         if (ret) {
2343                 fprintf(stderr, "Failed to rebuild ordered chunk stripes.\n");
2344                 goto fail_close_ctree;
2345         }
2346
2347         if (!rc.yes) {
2348                 ret = ask_user("We are going to rebuild the chunk tree on disk, it might destroy the old metadata on the disk, Are you sure?");
2349                 if (!ret) {
2350                         ret = 1;
2351                         goto fail_close_ctree;
2352                 }
2353         }
2354
2355         trans = btrfs_start_transaction(root, 1);
2356         ret = remove_chunk_extent_item(trans, &rc, root);
2357         BUG_ON(ret);
2358
2359         ret = rebuild_chunk_tree(trans, &rc, root);
2360         BUG_ON(ret);
2361
2362         ret = rebuild_sys_array(&rc, root);
2363         BUG_ON(ret);
2364
2365         ret = rebuild_block_group(trans, &rc, root);
2366         if (ret) {
2367                 printf("Fail to rebuild block groups.\n");
2368                 printf("Recommend to run 'btrfs check --init-extent-tree <dev>' after recovery\n");
2369         }
2370
2371         btrfs_commit_transaction(trans, root);
2372 fail_close_ctree:
2373         close_ctree(root);
2374 fail_rc:
2375         free_recover_control(&rc);
2376         return ret;
2377 }