cmds-restore.c

   1 /*
   2  * Copyright (C) 2011 Red Hat.  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
  20 #include "kerncompat.h"
  21
  22 #include <ctype.h>
  23 #include <stdio.h>
  24 #include <stdlib.h>
  25 #include <unistd.h>
  26 #include <fcntl.h>
  27 #include <sys/stat.h>
  28 #include <sys/types.h>
  29 #include <lzo/lzoconf.h>
  30 #include <lzo/lzo1x.h>
  31 #include <zlib.h>
  32 #include <regex.h>
  33 #include <getopt.h>
  34 #include <sys/types.h>
  35 #include <sys/xattr.h>
  36
  37 #include "ctree.h"
  38 #include "disk-io.h"
  39 #include "print-tree.h"
  40 #include "transaction.h"
  41 #include "list.h"
  42 #include "volumes.h"
  43 #include "utils.h"
  44 #include "commands.h"
  45
  46 static char fs_name[PATH_MAX];
  47 static char path_name[PATH_MAX];
  48 static char symlink_target[PATH_MAX];
  49 static int get_snaps = 0;
  50 static int verbose = 0;
  51 static int restore_metadata = 0;
  52 static int restore_symlinks = 0;
  53 static int ignore_errors = 0;
  54 static int overwrite = 0;
  55 static int get_xattrs = 0;
  56 static int dry_run = 0;
  57
  58 #define LZO_LEN 4
  59 #define lzo1x_worst_compress(x) ((x) + ((x) / 16) + 64 + 3)
  60
  61 static int decompress_zlib(char *inbuf, char *outbuf, u64 compress_len,
  62                            u64 decompress_len)
  63 {
  64         z_stream strm;
  65         int ret;
  66
  67         memset(&strm, 0, sizeof(strm));
  68         ret = inflateInit(&strm);
  69         if (ret != Z_OK) {
  70                 error("zlib init returned %d", ret);
  71                 return -1;
  72         }
  73
  74         strm.avail_in = compress_len;
  75         strm.next_in = (unsigned char *)inbuf;
  76         strm.avail_out = decompress_len;
  77         strm.next_out = (unsigned char *)outbuf;
  78         ret = inflate(&strm, Z_NO_FLUSH);
  79         if (ret != Z_STREAM_END) {
  80                 (void)inflateEnd(&strm);
  81                 error("zlib inflate failed: %d", ret);
  82                 return -1;
  83         }
  84
  85         (void)inflateEnd(&strm);
  86         return 0;
  87 }
  88 static inline size_t read_compress_length(unsigned char *buf)
  89 {
  90         __le32 dlen;
  91         memcpy(&dlen, buf, LZO_LEN);
  92         return le32_to_cpu(dlen);
  93 }
  94
  95 static int decompress_lzo(struct btrfs_root *root, unsigned char *inbuf,
  96                         char *outbuf, u64 compress_len, u64 *decompress_len)
  97 {
  98         size_t new_len;
  99         size_t in_len;
 100         size_t out_len = 0;
 101         size_t tot_len;
 102         size_t tot_in;
 103         int ret;
 104
 105         ret = lzo_init();
 106         if (ret != LZO_E_OK) {
 107                 error("lzo init returned %d", ret);
 108                 return -1;
 109         }
 110
 111         tot_len = read_compress_length(inbuf);
 112         inbuf += LZO_LEN;
 113         tot_in = LZO_LEN;
 114
 115         while (tot_in < tot_len) {
 116                 size_t mod_page;
 117                 size_t rem_page;
 118                 in_len = read_compress_length(inbuf);
 119
 120                 if ((tot_in + LZO_LEN + in_len) > tot_len) {
 121                         error("bad compress length %lu",
 122                                 (unsigned long)in_len);
 123                         return -1;
 124                 }
 125
 126                 inbuf += LZO_LEN;
 127                 tot_in += LZO_LEN;
 128                 new_len = lzo1x_worst_compress(root->sectorsize);
 129                 ret = lzo1x_decompress_safe((const unsigned char *)inbuf, in_len,
 130                                             (unsigned char *)outbuf,
 131                                             (void *)&new_len, NULL);
 132                 if (ret != LZO_E_OK) {
 133                         error("lzo decompress failed: %d", ret);
 134                         return -1;
 135                 }
 136                 out_len += new_len;
 137                 outbuf += new_len;
 138                 inbuf += in_len;
 139                 tot_in += in_len;
 140
 141                 /*
 142                  * If the 4 byte header does not fit to the rest of the page we
 143                  * have to move to the next one, unless we read some garbage
 144                  */
 145                 mod_page = tot_in % root->sectorsize;
 146                 rem_page = root->sectorsize - mod_page;
 147                 if (rem_page < LZO_LEN) {
 148                         inbuf += rem_page;
 149                         tot_in += rem_page;
 150                 }
 151         }
 152
 153         *decompress_len = out_len;
 154
 155         return 0;
 156 }
 157
 158 static int decompress(struct btrfs_root *root, char *inbuf, char *outbuf,
 159                         u64 compress_len, u64 *decompress_len, int compress)
 160 {
 161         switch (compress) {
 162         case BTRFS_COMPRESS_ZLIB:
 163                 return decompress_zlib(inbuf, outbuf, compress_len,
 164                                        *decompress_len);
 165         case BTRFS_COMPRESS_LZO:
 166                 return decompress_lzo(root, (unsigned char *)inbuf, outbuf,
 167                                         compress_len, decompress_len);
 168         default:
 169                 break;
 170         }
 171
 172         error("invalid compression type: %d", compress);
 173         return -1;
 174 }
 175
 176 static int next_leaf(struct btrfs_root *root, struct btrfs_path *path)
 177 {
 178         int slot;
 179         int level = 1;
 180         int offset = 1;
 181         struct extent_buffer *c;
 182         struct extent_buffer *next = NULL;
 183
 184 again:
 185         for (; level < BTRFS_MAX_LEVEL; level++) {
 186                 if (path->nodes[level])
 187                         break;
 188         }
 189
 190         if (level >= BTRFS_MAX_LEVEL)
 191                 return 1;
 192
 193         slot = path->slots[level] + 1;
 194
 195         while(level < BTRFS_MAX_LEVEL) {
 196                 if (!path->nodes[level])
 197                         return 1;
 198
 199                 slot = path->slots[level] + offset;
 200                 c = path->nodes[level];
 201                 if (slot >= btrfs_header_nritems(c)) {
 202                         level++;
 203                         if (level == BTRFS_MAX_LEVEL)
 204                                 return 1;
 205                         offset = 1;
 206                         continue;
 207                 }
 208
 209                 if (path->reada)
 210                         reada_for_search(root, path, level, slot, 0);
 211
 212                 next = read_node_slot(root, c, slot);
 213                 if (extent_buffer_uptodate(next))
 214                         break;
 215                 offset++;
 216         }
 217         path->slots[level] = slot;
 218         while(1) {
 219                 level--;
 220                 c = path->nodes[level];
 221                 free_extent_buffer(c);
 222                 path->nodes[level] = next;
 223                 path->slots[level] = 0;
 224                 if (!level)
 225                         break;
 226                 if (path->reada)
 227                         reada_for_search(root, path, level, 0, 0);
 228                 next = read_node_slot(root, next, 0);
 229                 if (!extent_buffer_uptodate(next))
 230                         goto again;
 231         }
 232         return 0;
 233 }
 234
 235 static int copy_one_inline(struct btrfs_root *root, int fd,
 236                                 struct btrfs_path *path, u64 pos)
 237 {
 238         struct extent_buffer *leaf = path->nodes[0];
 239         struct btrfs_file_extent_item *fi;
 240         char buf[4096];
 241         char *outbuf;
 242         u64 ram_size;
 243         ssize_t done;
 244         unsigned long ptr;
 245         int ret;
 246         int len;
 247         int inline_item_len;
 248         int compress;
 249
 250         fi = btrfs_item_ptr(leaf, path->slots[0],
 251                             struct btrfs_file_extent_item);
 252         ptr = btrfs_file_extent_inline_start(fi);
 253         len = btrfs_file_extent_inline_len(leaf, path->slots[0], fi);
 254         inline_item_len = btrfs_file_extent_inline_item_len(leaf, btrfs_item_nr(path->slots[0]));
 255         read_extent_buffer(leaf, buf, ptr, inline_item_len);
 256
 257         compress = btrfs_file_extent_compression(leaf, fi);
 258         if (compress == BTRFS_COMPRESS_NONE) {
 259                 done = pwrite(fd, buf, len, pos);
 260                 if (done < len) {
 261                         fprintf(stderr, "Short inline write, wanted %d, did "
 262                                 "%zd: %d\n", len, done, errno);
 263                         return -1;
 264                 }
 265                 return 0;
 266         }
 267
 268         ram_size = btrfs_file_extent_ram_bytes(leaf, fi);
 269         outbuf = calloc(1, ram_size);
 270         if (!outbuf) {
 271                 error("not enough memory");
 272                 return -ENOMEM;
 273         }
 274
 275         ret = decompress(root, buf, outbuf, len, &ram_size, compress);
 276         if (ret) {
 277                 free(outbuf);
 278                 return ret;
 279         }
 280
 281         done = pwrite(fd, outbuf, ram_size, pos);
 282         free(outbuf);
 283         if (done < ram_size) {
 284                 fprintf(stderr, "Short compressed inline write, wanted %Lu, "
 285                         "did %zd: %d\n", ram_size, done, errno);
 286                 return -1;
 287         }
 288
 289         return 0;
 290 }
 291
 292 static int copy_one_extent(struct btrfs_root *root, int fd,
 293                            struct extent_buffer *leaf,
 294                            struct btrfs_file_extent_item *fi, u64 pos)
 295 {
 296         struct btrfs_multi_bio *multi = NULL;
 297         struct btrfs_device *device;
 298         char *inbuf, *outbuf = NULL;
 299         ssize_t done, total = 0;
 300         u64 bytenr;
 301         u64 ram_size;
 302         u64 disk_size;
 303         u64 num_bytes;
 304         u64 length;
 305         u64 size_left;
 306         u64 dev_bytenr;
 307         u64 offset;
 308         u64 count = 0;
 309         int compress;
 310         int ret;
 311         int dev_fd;
 312         int mirror_num = 1;
 313         int num_copies;
 314
 315         compress = btrfs_file_extent_compression(leaf, fi);
 316         bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
 317         disk_size = btrfs_file_extent_disk_num_bytes(leaf, fi);
 318         ram_size = btrfs_file_extent_ram_bytes(leaf, fi);
 319         offset = btrfs_file_extent_offset(leaf, fi);
 320         num_bytes = btrfs_file_extent_num_bytes(leaf, fi);
 321         size_left = disk_size;
 322         if (compress == BTRFS_COMPRESS_NONE)
 323                 bytenr += offset;
 324
 325         if (verbose && offset)
 326                 printf("offset is %Lu\n", offset);
 327         /* we found a hole */
 328         if (disk_size == 0)
 329                 return 0;
 330
 331         inbuf = malloc(size_left);
 332         if (!inbuf) {
 333                 error("not enough memory\n");
 334                 return -ENOMEM;
 335         }
 336
 337         if (compress != BTRFS_COMPRESS_NONE) {
 338                 outbuf = calloc(1, ram_size);
 339                 if (!outbuf) {
 340                         error("not enough memory");
 341                         free(inbuf);
 342                         return -ENOMEM;
 343                 }
 344         }
 345 again:
 346         length = size_left;
 347         ret = btrfs_map_block(&root->fs_info->mapping_tree, READ,
 348                               bytenr, &length, &multi, mirror_num, NULL);
 349         if (ret) {
 350                 error("cannot map block logical %llu length %llu: %d",
 351                                 (unsigned long long)bytenr,
 352                                 (unsigned long long)length, ret);
 353                 goto out;
 354         }
 355         device = multi->stripes[0].dev;
 356         dev_fd = device->fd;
 357         device->total_ios++;
 358         dev_bytenr = multi->stripes[0].physical;
 359         free(multi);
 360
 361         if (size_left < length)
 362                 length = size_left;
 363
 364         done = pread(dev_fd, inbuf+count, length, dev_bytenr);
 365         /* Need both checks, or we miss negative values due to u64 conversion */
 366         if (done < 0 || done < length) {
 367                 num_copies = btrfs_num_copies(&root->fs_info->mapping_tree,
 368                                               bytenr, length);
 369                 mirror_num++;
 370                 /* mirror_num is 1-indexed, so num_copies is a valid mirror. */
 371                 if (mirror_num > num_copies) {
 372                         ret = -1;
 373                         error("exhausted mirrors trying to read (%d > %d)",
 374                                         mirror_num, num_copies);
 375                         goto out;
 376                 }
 377                 fprintf(stderr, "Trying another mirror\n");
 378                 goto again;
 379         }
 380
 381         mirror_num = 1;
 382         size_left -= length;
 383         count += length;
 384         bytenr += length;
 385         if (size_left)
 386                 goto again;
 387
 388         if (compress == BTRFS_COMPRESS_NONE) {
 389                 while (total < num_bytes) {
 390                         done = pwrite(fd, inbuf+total, num_bytes-total,
 391                                       pos+total);
 392                         if (done < 0) {
 393                                 ret = -1;
 394                                 error("cannot write data: %d %s", errno, strerror(errno));
 395                                 goto out;
 396                         }
 397                         total += done;
 398                 }
 399                 ret = 0;
 400                 goto out;
 401         }
 402
 403         ret = decompress(root, inbuf, outbuf, disk_size, &ram_size, compress);
 404         if (ret) {
 405                 num_copies = btrfs_num_copies(&root->fs_info->mapping_tree,
 406                                               bytenr, length);
 407                 mirror_num++;
 408                 if (mirror_num >= num_copies) {
 409                         ret = -1;
 410                         goto out;
 411                 }
 412                 fprintf(stderr, "Trying another mirror\n");
 413                 goto again;
 414         }
 415
 416         while (total < num_bytes) {
 417                 done = pwrite(fd, outbuf + offset + total,
 418                               num_bytes - total,
 419                               pos + total);
 420                 if (done < 0) {
 421                         ret = -1;
 422                         goto out;
 423                 }
 424                 total += done;
 425         }
 426 out:
 427         free(inbuf);
 428         free(outbuf);
 429         return ret;
 430 }
 431
 432 enum loop_response {
 433         LOOP_STOP,
 434         LOOP_CONTINUE,
 435         LOOP_DONTASK
 436 };
 437
 438 static enum loop_response ask_to_continue(const char *file)
 439 {
 440         char buf[2];
 441         char *ret;
 442
 443         printf("We seem to be looping a lot on %s, do you want to keep going "
 444                "on ? (y/N/a): ", file);
 445 again:
 446         ret = fgets(buf, 2, stdin);
 447         if (*ret == '\n' || tolower(*ret) == 'n')
 448                 return LOOP_STOP;
 449         if (tolower(*ret) == 'a')
 450                 return LOOP_DONTASK;
 451         if (tolower(*ret) != 'y') {
 452                 printf("Please enter one of 'y', 'n', or 'a': ");
 453                 goto again;
 454         }
 455
 456         return LOOP_CONTINUE;
 457 }
 458
 459
 460 static int set_file_xattrs(struct btrfs_root *root, u64 inode,
 461                            int fd, const char *file_name)
 462 {
 463         struct btrfs_key key;
 464         struct btrfs_path path;
 465         struct extent_buffer *leaf;
 466         struct btrfs_dir_item *di;
 467         u32 name_len = 0;
 468         u32 data_len = 0;
 469         u32 len = 0;
 470         u32 cur, total_len;
 471         char *name = NULL;
 472         char *data = NULL;
 473         int ret = 0;
 474
 475         btrfs_init_path(&path);
 476         key.objectid = inode;
 477         key.type = BTRFS_XATTR_ITEM_KEY;
 478         key.offset = 0;
 479         ret = btrfs_search_slot(NULL, root, &key, &path, 0, 0);
 480         if (ret < 0)
 481                 goto out;
 482
 483         leaf = path.nodes[0];
 484         while (1) {
 485                 if (path.slots[0] >= btrfs_header_nritems(leaf)) {
 486                         do {
 487                                 ret = next_leaf(root, &path);
 488                                 if (ret < 0) {
 489                                         error("searching for extended attributes: %d\n",
 490                                                 ret);
 491                                         goto out;
 492                                 } else if (ret) {
 493                                         /* No more leaves to search */
 494                                         ret = 0;
 495                                         goto out;
 496                                 }
 497                                 leaf = path.nodes[0];
 498                         } while (!leaf);
 499                         continue;
 500                 }
 501
 502                 btrfs_item_key_to_cpu(leaf, &key, path.slots[0]);
 503                 if (key.type != BTRFS_XATTR_ITEM_KEY || key.objectid != inode)
 504                         break;
 505                 cur = 0;
 506                 total_len = btrfs_item_size_nr(leaf, path.slots[0]);
 507                 di = btrfs_item_ptr(leaf, path.slots[0],
 508                                     struct btrfs_dir_item);
 509
 510                 while (cur < total_len) {
 511                         len = btrfs_dir_name_len(leaf, di);
 512                         if (len > name_len) {
 513                                 free(name);
 514                                 name = (char *) malloc(len + 1);
 515                                 if (!name) {
 516                                         ret = -ENOMEM;
 517                                         goto out;
 518                                 }
 519                         }
 520                         read_extent_buffer(leaf, name,
 521                                            (unsigned long)(di + 1), len);
 522                         name[len] = '\0';
 523                         name_len = len;
 524
 525                         len = btrfs_dir_data_len(leaf, di);
 526                         if (len > data_len) {
 527                                 free(data);
 528                                 data = (char *) malloc(len);
 529                                 if (!data) {
 530                                         ret = -ENOMEM;
 531                                         goto out;
 532                                 }
 533                         }
 534                         read_extent_buffer(leaf, data,
 535                                            (unsigned long)(di + 1) + name_len,
 536                                            len);
 537                         data_len = len;
 538
 539                         if (fsetxattr(fd, name, data, data_len, 0))
 540                                 error("setting extended attribute %s on file %s: %s",
 541                                         name, file_name, strerror(errno));
 542
 543                         len = sizeof(*di) + name_len + data_len;
 544                         cur += len;
 545                         di = (struct btrfs_dir_item *)((char *)di + len);
 546                 }
 547                 path.slots[0]++;
 548         }
 549         ret = 0;
 550 out:
 551         btrfs_release_path(&path);
 552         free(name);
 553         free(data);
 554
 555         return ret;
 556 }
 557
 558 static int copy_metadata(struct btrfs_root *root, int fd,
 559                 struct btrfs_key *key)
 560 {
 561         struct btrfs_path *path;
 562         struct btrfs_inode_item *inode_item;
 563         int ret;
 564
 565         path = btrfs_alloc_path();
 566         if (!path) {
 567                 error("not enough memory");
 568                 return -ENOMEM;
 569         }
 570
 571         ret = btrfs_lookup_inode(NULL, root, path, key, 0);
 572         if (ret == 0) {
 573                 struct btrfs_timespec *bts;
 574                 struct timespec times[2];
 575
 576                 inode_item = btrfs_item_ptr(path->nodes[0], path->slots[0],
 577                                 struct btrfs_inode_item);
 578
 579                 ret = fchown(fd, btrfs_inode_uid(path->nodes[0], inode_item),
 580                                 btrfs_inode_gid(path->nodes[0], inode_item));
 581                 if (ret) {
 582                         error("failed to change owner: %s", strerror(errno));
 583                         goto out;
 584                 }
 585
 586                 ret = fchmod(fd, btrfs_inode_mode(path->nodes[0], inode_item));
 587                 if (ret) {
 588                         error("failed to change mode: %s", strerror(errno));
 589                         goto out;
 590                 }
 591
 592                 bts = btrfs_inode_atime(inode_item);
 593                 times[0].tv_sec = btrfs_timespec_sec(path->nodes[0], bts);
 594                 times[0].tv_nsec = btrfs_timespec_nsec(path->nodes[0], bts);
 595
 596                 bts = btrfs_inode_mtime(inode_item);
 597                 times[1].tv_sec = btrfs_timespec_sec(path->nodes[0], bts);
 598                 times[1].tv_nsec = btrfs_timespec_nsec(path->nodes[0], bts);
 599
 600                 ret = futimens(fd, times);
 601                 if (ret) {
 602                         error("failed to set times: %s", strerror(errno));
 603                         goto out;
 604                 }
 605         }
 606 out:
 607         btrfs_free_path(path);
 608         return ret;
 609 }
 610
 611 static int copy_file(struct btrfs_root *root, int fd, struct btrfs_key *key,
 612                      const char *file)
 613 {
 614         struct extent_buffer *leaf;
 615         struct btrfs_path *path;
 616         struct btrfs_file_extent_item *fi;
 617         struct btrfs_inode_item *inode_item;
 618         struct btrfs_timespec *bts;
 619         struct btrfs_key found_key;
 620         int ret;
 621         int extent_type;
 622         int compression;
 623         int loops = 0;
 624         u64 found_size = 0;
 625         struct timespec times[2];
 626         int times_ok = 0;
 627
 628         path = btrfs_alloc_path();
 629         if (!path) {
 630                 error("not enough memory");
 631                 return -ENOMEM;
 632         }
 633
 634         ret = btrfs_lookup_inode(NULL, root, path, key, 0);
 635         if (ret == 0) {
 636                 inode_item = btrfs_item_ptr(path->nodes[0], path->slots[0],
 637                                     struct btrfs_inode_item);
 638                 found_size = btrfs_inode_size(path->nodes[0], inode_item);
 639
 640                 if (restore_metadata) {
 641                         /*
 642                          * Change the ownership and mode now, set times when
 643                          * copyout is finished.
 644                          */
 645
 646                         ret = fchown(fd, btrfs_inode_uid(path->nodes[0], inode_item),
 647                                         btrfs_inode_gid(path->nodes[0], inode_item));
 648                         if (ret && !ignore_errors)
 649                                 goto out;
 650
 651                         ret = fchmod(fd, btrfs_inode_mode(path->nodes[0], inode_item));
 652                         if (ret && !ignore_errors)
 653                                 goto out;
 654
 655                         bts = btrfs_inode_atime(inode_item);
 656                         times[0].tv_sec = btrfs_timespec_sec(path->nodes[0], bts);
 657                         times[0].tv_nsec = btrfs_timespec_nsec(path->nodes[0], bts);
 658
 659                         bts = btrfs_inode_mtime(inode_item);
 660                         times[1].tv_sec = btrfs_timespec_sec(path->nodes[0], bts);
 661                         times[1].tv_nsec = btrfs_timespec_nsec(path->nodes[0], bts);
 662                         times_ok = 1;
 663                 }
 664         }
 665         btrfs_release_path(path);
 666
 667         key->offset = 0;
 668         key->type = BTRFS_EXTENT_DATA_KEY;
 669
 670         ret = btrfs_search_slot(NULL, root, key, path, 0, 0);
 671         if (ret < 0) {
 672                 error("searching extent data returned %d", ret);
 673                 goto out;
 674         }
 675
 676         leaf = path->nodes[0];
 677         while (!leaf) {
 678                 ret = next_leaf(root, path);
 679                 if (ret < 0) {
 680                         error("cannot get next leaf: %d", ret);
 681                         goto out;
 682                 } else if (ret > 0) {
 683                         /* No more leaves to search */
 684                         ret = 0;
 685                         goto out;
 686                 }
 687                 leaf = path->nodes[0];
 688         }
 689
 690         while (1) {
 691                 if (loops >= 0 && loops++ >= 1024) {
 692                         enum loop_response resp;
 693
 694                         resp = ask_to_continue(file);
 695                         if (resp == LOOP_STOP)
 696                                 break;
 697                         else if (resp == LOOP_CONTINUE)
 698                                 loops = 0;
 699                         else if (resp == LOOP_DONTASK)
 700                                 loops = -1;
 701                 }
 702                 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
 703                         do {
 704                                 ret = next_leaf(root, path);
 705                                 if (ret < 0) {
 706                                         fprintf(stderr, "Error searching %d\n", ret);
 707                                         goto out;
 708                                 } else if (ret) {
 709                                         /* No more leaves to search */
 710                                         btrfs_free_path(path);
 711                                         goto set_size;
 712                                 }
 713                                 leaf = path->nodes[0];
 714                         } while (!leaf);
 715                         continue;
 716                 }
 717                 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
 718                 if (found_key.objectid != key->objectid)
 719                         break;
 720                 if (found_key.type != key->type)
 721                         break;
 722                 fi = btrfs_item_ptr(leaf, path->slots[0],
 723                                     struct btrfs_file_extent_item);
 724                 extent_type = btrfs_file_extent_type(leaf, fi);
 725                 compression = btrfs_file_extent_compression(leaf, fi);
 726                 if (compression >= BTRFS_COMPRESS_LAST) {
 727                         warning("compression type %d not supported",
 728                                 compression);
 729                         ret = -1;
 730                         goto out;
 731                 }
 732
 733                 if (extent_type == BTRFS_FILE_EXTENT_PREALLOC)
 734                         goto next;
 735                 if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
 736                         ret = copy_one_inline(root, fd, path, found_key.offset);
 737                         if (ret)
 738                                 goto out;
 739                 } else if (extent_type == BTRFS_FILE_EXTENT_REG) {
 740                         ret = copy_one_extent(root, fd, leaf, fi,
 741                                               found_key.offset);
 742                         if (ret)
 743                                 goto out;
 744                 } else {
 745                         warning("weird extent type %d", extent_type);
 746                 }
 747 next:
 748                 path->slots[0]++;
 749         }
 750
 751         btrfs_free_path(path);
 752 set_size:
 753         if (found_size) {
 754                 ret = ftruncate(fd, (loff_t)found_size);
 755                 if (ret)
 756                         return ret;
 757         }
 758         if (get_xattrs) {
 759                 ret = set_file_xattrs(root, key->objectid, fd, file);
 760                 if (ret)
 761                         return ret;
 762         }
 763         if (restore_metadata && times_ok) {
 764                 ret = futimens(fd, times);
 765                 if (ret)
 766                         return ret;
 767         }
 768         return 0;
 769
 770 out:
 771         btrfs_free_path(path);
 772         return ret;
 773 }
 774
 775 /*
 776  * returns:
 777  *  0 if the file exists and should be skipped.
 778  *  1 if the file does NOT exist
 779  *  2 if the file exists but is OK to overwrite
 780  */
 781 static int overwrite_ok(const char * path)
 782 {
 783         static int warn = 0;
 784         struct stat st;
 785         int ret;
 786
 787         /* don't be fooled by symlinks */
 788         ret = fstatat(-1, path_name, &st, AT_SYMLINK_NOFOLLOW);
 789
 790         if (!ret) {
 791                 if (overwrite)
 792                         return 2;
 793
 794                 if (verbose || !warn)
 795                         printf("Skipping existing file"
 796                                    " %s\n", path);
 797                 if (!warn)
 798                         printf("If you wish to overwrite use -o\n");
 799                 warn = 1;
 800                 return 0;
 801         }
 802         return 1;
 803 }
 804
 805 static int copy_symlink(struct btrfs_root *root, struct btrfs_key *key,
 806                      const char *file)
 807 {
 808         struct btrfs_path *path;
 809         struct extent_buffer *leaf;
 810         struct btrfs_file_extent_item *extent_item;
 811         struct btrfs_inode_item *inode_item;
 812         u32 len;
 813         u32 name_offset;
 814         int ret;
 815         struct btrfs_timespec *bts;
 816         struct timespec times[2];
 817
 818         ret = overwrite_ok(path_name);
 819         if (ret == 0)
 820             return 0; /* skip this file */
 821
 822         /* symlink() can't overwrite, so unlink first */
 823         if (ret == 2) {
 824                 ret = unlink(path_name);
 825                 if (ret) {
 826                         fprintf(stderr, "failed to unlink '%s' for overwrite\n",
 827                                         path_name);
 828                         return ret;
 829                 }
 830         }
 831
 832         key->type = BTRFS_EXTENT_DATA_KEY;
 833         key->offset = 0;
 834
 835         path = btrfs_alloc_path();
 836         if (!path)
 837                 return -ENOMEM;
 838
 839         ret = btrfs_search_slot(NULL, root, key, path, 0, 0);
 840         if (ret < 0)
 841                 goto out;
 842
 843         leaf = path->nodes[0];
 844         if (!leaf) {
 845                 fprintf(stderr, "Error getting leaf for symlink '%s'\n", file);
 846                 ret = -1;
 847                 goto out;
 848         }
 849
 850         extent_item = btrfs_item_ptr(leaf, path->slots[0],
 851                         struct btrfs_file_extent_item);
 852
 853         len = btrfs_file_extent_inline_item_len(leaf,
 854                         btrfs_item_nr(path->slots[0]));
 855         if (len >= PATH_MAX) {
 856                 fprintf(stderr, "Symlink '%s' target length %d is longer than PATH_MAX\n",
 857                                 fs_name, len);
 858                 ret = -1;
 859                 goto out;
 860         }
 861
 862         name_offset = (unsigned long) extent_item
 863                         + offsetof(struct btrfs_file_extent_item, disk_bytenr);
 864         read_extent_buffer(leaf, symlink_target, name_offset, len);
 865
 866         symlink_target[len] = 0;
 867
 868         if (!dry_run) {
 869                 ret = symlink(symlink_target, path_name);
 870                 if (ret < 0) {
 871                         fprintf(stderr, "Failed to restore symlink '%s': %s\n",
 872                                         path_name, strerror(errno));
 873                         goto out;
 874                 }
 875         }
 876         printf("SYMLINK: '%s' => '%s'\n", path_name, symlink_target);
 877
 878         ret = 0;
 879         if (!restore_metadata)
 880                 goto out;
 881
 882         /*
 883          * Symlink metadata operates differently than files/directories, so do
 884          * our own work here.
 885          */
 886         key->type = BTRFS_INODE_ITEM_KEY;
 887         key->offset = 0;
 888
 889         btrfs_release_path(path);
 890
 891         ret = btrfs_lookup_inode(NULL, root, path, key, 0);
 892         if (ret) {
 893                 fprintf(stderr, "Failed to lookup inode for '%s'\n", file);
 894                 goto out;
 895         }
 896
 897         inode_item = btrfs_item_ptr(path->nodes[0], path->slots[0],
 898                         struct btrfs_inode_item);
 899
 900         ret = fchownat(-1, file, btrfs_inode_uid(path->nodes[0], inode_item),
 901                                    btrfs_inode_gid(path->nodes[0], inode_item),
 902                                    AT_SYMLINK_NOFOLLOW);
 903         if (ret) {
 904                 fprintf(stderr, "Failed to change owner: %s\n",
 905                                 strerror(errno));
 906                 goto out;
 907         }
 908
 909         bts = btrfs_inode_atime(inode_item);
 910         times[0].tv_sec  = btrfs_timespec_sec(path->nodes[0], bts);
 911         times[0].tv_nsec = btrfs_timespec_nsec(path->nodes[0], bts);
 912
 913         bts = btrfs_inode_mtime(inode_item);
 914         times[1].tv_sec  = btrfs_timespec_sec(path->nodes[0], bts);
 915         times[1].tv_nsec = btrfs_timespec_nsec(path->nodes[0], bts);
 916
 917         ret = utimensat(-1, file, times, AT_SYMLINK_NOFOLLOW);
 918         if (ret)
 919                 fprintf(stderr, "Failed to set times: %s\n", strerror(errno));
 920 out:
 921         btrfs_free_path(path);
 922         return ret;
 923 }
 924
 925 static int search_dir(struct btrfs_root *root, struct btrfs_key *key,
 926                       const char *output_rootdir, const char *in_dir,
 927                       const regex_t *mreg)
 928 {
 929         struct btrfs_path *path;
 930         struct extent_buffer *leaf;
 931         struct btrfs_dir_item *dir_item;
 932         struct btrfs_key found_key, location;
 933         char filename[BTRFS_NAME_LEN + 1];
 934         unsigned long name_ptr;
 935         int name_len;
 936         int ret = 0;
 937         int fd;
 938         int loops = 0;
 939         u8 type;
 940
 941         path = btrfs_alloc_path();
 942         if (!path) {
 943                 fprintf(stderr, "Ran out of memory\n");
 944                 return -ENOMEM;
 945         }
 946
 947         key->offset = 0;
 948         key->type = BTRFS_DIR_INDEX_KEY;
 949
 950         ret = btrfs_search_slot(NULL, root, key, path, 0, 0);
 951         if (ret < 0) {
 952                 fprintf(stderr, "Error searching %d\n", ret);
 953                 goto out;
 954         }
 955
 956         ret = 0;
 957
 958         leaf = path->nodes[0];
 959         while (!leaf) {
 960                 if (verbose > 1)
 961                         printf("No leaf after search, looking for the next "
 962                                "leaf\n");
 963                 ret = next_leaf(root, path);
 964                 if (ret < 0) {
 965                         fprintf(stderr, "Error getting next leaf %d\n",
 966                                 ret);
 967                         goto out;
 968                 } else if (ret > 0) {
 969                         /* No more leaves to search */
 970                         if (verbose)
 971                                 printf("Reached the end of the tree looking "
 972                                        "for the directory\n");
 973                         ret = 0;
 974                         goto out;
 975                 }
 976                 leaf = path->nodes[0];
 977         }
 978
 979         while (leaf) {
 980                 if (loops++ >= 1024) {
 981                         printf("We have looped trying to restore files in %s "
 982                                "too many times to be making progress, "
 983                                "stopping\n", in_dir);
 984                         break;
 985                 }
 986
 987                 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
 988                         do {
 989                                 ret = next_leaf(root, path);
 990                                 if (ret < 0) {
 991                                         fprintf(stderr, "Error searching %d\n",
 992                                                 ret);
 993                                         goto out;
 994                                 } else if (ret > 0) {
 995                                         /* No more leaves to search */
 996                                         if (verbose)
 997                                                 printf("Reached the end of "
 998                                                        "the tree searching the"
 999                                                        " directory\n");
1000                                         ret = 0;
1001                                         goto out;
1002                                 }
1003                                 leaf = path->nodes[0];
1004                         } while (!leaf);
1005                         continue;
1006                 }
1007                 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
1008                 if (found_key.objectid != key->objectid) {
1009                         if (verbose > 1)
1010                                 printf("Found objectid=%Lu, key=%Lu\n",
1011                                        found_key.objectid, key->objectid);
1012                         break;
1013                 }
1014                 if (found_key.type != key->type) {
1015                         if (verbose > 1)
1016                                 printf("Found type=%u, want=%u\n",
1017                                        found_key.type, key->type);
1018                         break;
1019                 }
1020                 dir_item = btrfs_item_ptr(leaf, path->slots[0],
1021                                           struct btrfs_dir_item);
1022                 name_ptr = (unsigned long)(dir_item + 1);
1023                 name_len = btrfs_dir_name_len(leaf, dir_item);
1024                 read_extent_buffer(leaf, filename, name_ptr, name_len);
1025                 filename[name_len] = '\0';
1026                 type = btrfs_dir_type(leaf, dir_item);
1027                 btrfs_dir_item_key_to_cpu(leaf, dir_item, &location);
1028
1029                 /* full path from root of btrfs being restored */
1030                 snprintf(fs_name, PATH_MAX, "%s/%s", in_dir, filename);
1031
1032                 if (mreg && REG_NOMATCH == regexec(mreg, fs_name, 0, NULL, 0))
1033                         goto next;
1034
1035                 /* full path from system root */
1036                 snprintf(path_name, PATH_MAX, "%s%s", output_rootdir, fs_name);
1037
1038                 /*
1039                  * Restore directories, files, symlinks and metadata.
1040                  */
1041                 if (type == BTRFS_FT_REG_FILE) {
1042                         if (!overwrite_ok(path_name))
1043                                 goto next;
1044
1045                         if (verbose)
1046                                 printf("Restoring %s\n", path_name);
1047                         if (dry_run)
1048                                 goto next;
1049                         fd = open(path_name, O_CREAT|O_WRONLY, 0644);
1050                         if (fd < 0) {
1051                                 fprintf(stderr, "Error creating %s: %d\n",
1052                                         path_name, errno);
1053                                 if (ignore_errors)
1054                                         goto next;
1055                                 ret = -1;
1056                                 goto out;
1057                         }
1058                         loops = 0;
1059                         ret = copy_file(root, fd, &location, path_name);
1060                         close(fd);
1061                         if (ret) {
1062                                 fprintf(stderr, "Error copying data for %s\n",
1063                                         path_name);
1064                                 if (ignore_errors)
1065                                         goto next;
1066                                 goto out;
1067                         }
1068                 } else if (type == BTRFS_FT_DIR) {
1069                         struct btrfs_root *search_root = root;
1070                         char *dir = strdup(fs_name);
1071
1072                         if (!dir) {
1073                                 fprintf(stderr, "Ran out of memory\n");
1074                                 ret = -ENOMEM;
1075                                 goto out;
1076                         }
1077
1078                         if (location.type == BTRFS_ROOT_ITEM_KEY) {
1079                                 /*
1080                                  * If we are a snapshot and this is the index
1081                                  * object to ourselves just skip it.
1082                                  */
1083                                 if (location.objectid ==
1084                                     root->root_key.objectid) {
1085                                         free(dir);
1086                                         goto next;
1087                                 }
1088
1089                                 location.offset = (u64)-1;
1090                                 search_root = btrfs_read_fs_root(root->fs_info,
1091                                                                  &location);
1092                                 if (IS_ERR(search_root)) {
1093                                         free(dir);
1094                                         fprintf(stderr, "Error reading "
1095                                                 "subvolume %s: %lu\n",
1096                                                 path_name,
1097                                                 PTR_ERR(search_root));
1098                                         if (ignore_errors)
1099                                                 goto next;
1100                                         ret = PTR_ERR(search_root);
1101                                         goto out;
1102                                 }
1103
1104                                 /*
1105                                  * A subvolume will have a key.offset of 0, a
1106                                  * snapshot will have key.offset of a transid.
1107                                  */
1108                                 if (search_root->root_key.offset != 0 &&
1109                                     get_snaps == 0) {
1110                                         free(dir);
1111                                         printf("Skipping snapshot %s\n",
1112                                                filename);
1113                                         goto next;
1114                                 }
1115                                 location.objectid = BTRFS_FIRST_FREE_OBJECTID;
1116                         }
1117
1118                         if (verbose)
1119                                 printf("Restoring %s\n", path_name);
1120
1121                         errno = 0;
1122                         if (dry_run)
1123                                 ret = 0;
1124                         else
1125                                 ret = mkdir(path_name, 0755);
1126                         if (ret && errno != EEXIST) {
1127                                 free(dir);
1128                                 fprintf(stderr, "Error mkdiring %s: %d\n",
1129                                         path_name, errno);
1130                                 if (ignore_errors)
1131                                         goto next;
1132                                 ret = -1;
1133                                 goto out;
1134                         }
1135                         loops = 0;
1136                         ret = search_dir(search_root, &location,
1137                                          output_rootdir, dir, mreg);
1138                         free(dir);
1139                         if (ret) {
1140                                 fprintf(stderr, "Error searching %s\n",
1141                                         path_name);
1142                                 if (ignore_errors)
1143                                         goto next;
1144                                 goto out;
1145                         }
1146                 } else if (type == BTRFS_FT_SYMLINK) {
1147                         if (restore_symlinks)
1148                                 ret = copy_symlink(root, &location, path_name);
1149                         if (ret < 0) {
1150                                 if (ignore_errors)
1151                                         goto next;
1152                                 btrfs_free_path(path);
1153                                 return ret;
1154                         }
1155                 }
1156 next:
1157                 path->slots[0]++;
1158         }
1159
1160         if (restore_metadata) {
1161                 snprintf(path_name, PATH_MAX, "%s%s", output_rootdir, in_dir);
1162                 fd = open(path_name, O_RDONLY);
1163                 if (fd < 0) {
1164                         fprintf(stderr, "ERROR: Failed to access %s to restore metadata\n",
1165                                         path_name);
1166                         if (!ignore_errors) {
1167                                 ret = -1;
1168                                 goto out;
1169                         }
1170                 } else {
1171                         /*
1172                          * Set owner/mode/time on the directory as well
1173                          */
1174                         key->type = BTRFS_INODE_ITEM_KEY;
1175                         ret = copy_metadata(root, fd, key);
1176                         close(fd);
1177                         if (ret && !ignore_errors)
1178                                 goto out;
1179                 }
1180         }
1181
1182         if (verbose)
1183                 printf("Done searching %s\n", in_dir);
1184 out:
1185         btrfs_free_path(path);
1186         return ret;
1187 }
1188
1189 static int do_list_roots(struct btrfs_root *root)
1190 {
1191         struct btrfs_key key;
1192         struct btrfs_key found_key;
1193         struct btrfs_disk_key disk_key;
1194         struct btrfs_path *path;
1195         struct extent_buffer *leaf;
1196         struct btrfs_root_item ri;
1197         unsigned long offset;
1198         int slot;
1199         int ret;
1200
1201         root = root->fs_info->tree_root;
1202         path = btrfs_alloc_path();
1203         if (!path) {
1204                 fprintf(stderr, "Failed to alloc path\n");
1205                 return -ENOMEM;
1206         }
1207
1208         key.offset = 0;
1209         key.objectid = 0;
1210         key.type = BTRFS_ROOT_ITEM_KEY;
1211
1212         ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
1213         if (ret < 0) {
1214                 fprintf(stderr, "Failed to do search %d\n", ret);
1215                 btrfs_free_path(path);
1216                 return -1;
1217         }
1218
1219         leaf = path->nodes[0];
1220
1221         while (1) {
1222                 slot = path->slots[0];
1223                 if (slot >= btrfs_header_nritems(leaf)) {
1224                         ret = btrfs_next_leaf(root, path);
1225                         if (ret)
1226                                 break;
1227                         leaf = path->nodes[0];
1228                         slot = path->slots[0];
1229                 }
1230                 btrfs_item_key(leaf, &disk_key, slot);
1231                 btrfs_disk_key_to_cpu(&found_key, &disk_key);
1232                 if (found_key.type != BTRFS_ROOT_ITEM_KEY) {
1233                         path->slots[0]++;
1234                         continue;
1235                 }
1236
1237                 offset = btrfs_item_ptr_offset(leaf, slot);
1238                 read_extent_buffer(leaf, &ri, offset, sizeof(ri));
1239                 printf(" tree ");
1240                 btrfs_print_key(&disk_key);
1241                 printf(" %Lu level %d\n", btrfs_root_bytenr(&ri),
1242                        btrfs_root_level(&ri));
1243                 path->slots[0]++;
1244         }
1245         btrfs_free_path(path);
1246
1247         return 0;
1248 }
1249
1250 static struct btrfs_root *open_fs(const char *dev, u64 root_location,
1251                                   int super_mirror, int list_roots)
1252 {
1253         struct btrfs_fs_info *fs_info = NULL;
1254         struct btrfs_root *root = NULL;
1255         u64 bytenr;
1256         int i;
1257
1258         for (i = super_mirror; i < BTRFS_SUPER_MIRROR_MAX; i++) {
1259                 bytenr = btrfs_sb_offset(i);
1260                 fs_info = open_ctree_fs_info(dev, bytenr, root_location, 0,
1261                                              OPEN_CTREE_PARTIAL);
1262                 if (fs_info)
1263                         break;
1264                 fprintf(stderr, "Could not open root, trying backup super\n");
1265         }
1266
1267         if (!fs_info)
1268                 return NULL;
1269
1270         /*
1271          * All we really need to succeed is reading the chunk tree, everything
1272          * else we can do by hand, since we only need to read the tree root and
1273          * the fs_root.
1274          */
1275         if (!extent_buffer_uptodate(fs_info->tree_root->node)) {
1276                 u64 generation;
1277
1278                 root = fs_info->tree_root;
1279                 if (!root_location)
1280                         root_location = btrfs_super_root(fs_info->super_copy);
1281                 generation = btrfs_super_generation(fs_info->super_copy);
1282                 root->node = read_tree_block(root, root_location,
1283                                              root->nodesize, generation);
1284                 if (!extent_buffer_uptodate(root->node)) {
1285                         fprintf(stderr, "Error opening tree root\n");
1286                         close_ctree(root);
1287                         return NULL;
1288                 }
1289         }
1290
1291         if (!list_roots && !fs_info->fs_root) {
1292                 struct btrfs_key key;
1293
1294                 key.objectid = BTRFS_FS_TREE_OBJECTID;
1295                 key.type = BTRFS_ROOT_ITEM_KEY;
1296                 key.offset = (u64)-1;
1297                 fs_info->fs_root = btrfs_read_fs_root_no_cache(fs_info, &key);
1298                 if (IS_ERR(fs_info->fs_root)) {
1299                         fprintf(stderr, "Couldn't read fs root: %ld\n",
1300                                 PTR_ERR(fs_info->fs_root));
1301                         close_ctree(fs_info->tree_root);
1302                         return NULL;
1303                 }
1304         }
1305
1306         if (list_roots && do_list_roots(fs_info->tree_root)) {
1307                 close_ctree(fs_info->tree_root);
1308                 return NULL;
1309         }
1310
1311         return fs_info->fs_root;
1312 }
1313
1314 static int find_first_dir(struct btrfs_root *root, u64 *objectid)
1315 {
1316         struct btrfs_path *path;
1317         struct btrfs_key found_key;
1318         struct btrfs_key key;
1319         int ret = -1;
1320         int i;
1321
1322         key.objectid = 0;
1323         key.type = BTRFS_DIR_INDEX_KEY;
1324         key.offset = 0;
1325
1326         path = btrfs_alloc_path();
1327         if (!path) {
1328                 fprintf(stderr, "Ran out of memory\n");
1329                 return ret;
1330         }
1331
1332         ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
1333         if (ret < 0) {
1334                 fprintf(stderr, "Error searching %d\n", ret);
1335                 goto out;
1336         }
1337
1338         if (!path->nodes[0]) {
1339                 fprintf(stderr, "No leaf!\n");
1340                 goto out;
1341         }
1342 again:
1343         for (i = path->slots[0];
1344              i < btrfs_header_nritems(path->nodes[0]); i++) {
1345                 btrfs_item_key_to_cpu(path->nodes[0], &found_key, i);
1346                 if (found_key.type != key.type)
1347                         continue;
1348
1349                 printf("Using objectid %Lu for first dir\n",
1350                        found_key.objectid);
1351                 *objectid = found_key.objectid;
1352                 ret = 0;
1353                 goto out;
1354         }
1355         do {
1356                 ret = next_leaf(root, path);
1357                 if (ret < 0) {
1358                         fprintf(stderr, "Error getting next leaf %d\n",
1359                                 ret);
1360                         goto out;
1361                 } else if (ret > 0) {
1362                         fprintf(stderr, "No more leaves\n");
1363                         goto out;
1364                 }
1365         } while (!path->nodes[0]);
1366         if (path->nodes[0])
1367                 goto again;
1368         printf("Couldn't find a dir index item\n");
1369 out:
1370         btrfs_free_path(path);
1371         return ret;
1372 }
1373
1374 const char * const cmd_restore_usage[] = {
1375         "btrfs restore [options] <device> <path> | -l <device>",
1376         "Try to restore files from a damaged filesystem (unmounted)",
1377         "",
1378         "-s|--snapshots       get snapshots",
1379         "-x|--xattr           restore extended attributes",
1380         "-m|--metadata        restore owner, mode and times",
1381         "-S|--symlink         restore symbolic links",
1382         "-v|--verbose         verbose",
1383         "-i|--ignore-errors   ignore errors",
1384         "-o|--overwrite       overwrite",
1385         "-t <bytenr>          tree location",
1386         "-f <bytenr>          filesystem location",
1387         "-u|--super <mirror>  super mirror",
1388         "-r|--root <rootid>   root objectid",
1389         "-d                   find dir",
1390         "-l|--list-roots      list tree roots",
1391         "-D|--dry-run         dry run (only list files that would be recovered)",
1392         "--path-regex <regex>",
1393         "                     restore only filenames matching regex,",
1394         "                     you have to use following syntax (possibly quoted):",
1395         "                     ^/(|home(|/username(|/Desktop(|/.*))))$",
1396         "-c                   ignore case (--path-regex only)",
1397         NULL
1398 };
1399
1400 int cmd_restore(int argc, char **argv)
1401 {
1402         struct btrfs_root *root;
1403         struct btrfs_key key;
1404         char dir_name[PATH_MAX];
1405         u64 tree_location = 0;
1406         u64 fs_location = 0;
1407         u64 root_objectid = 0;
1408         int len;
1409         int ret;
1410         int super_mirror = 0;
1411         int find_dir = 0;
1412         int list_roots = 0;
1413         const char *match_regstr = NULL;
1414         int match_cflags = REG_EXTENDED | REG_NOSUB | REG_NEWLINE;
1415         regex_t match_reg, *mreg = NULL;
1416         char reg_err[256];
1417
1418         while (1) {
1419                 int opt;
1420                 enum { GETOPT_VAL_PATH_REGEX = 256 };
1421                 static const struct option long_options[] = {
1422                         { "path-regex", required_argument, NULL,
1423                                 GETOPT_VAL_PATH_REGEX },
1424                         { "dry-run", no_argument, NULL, 'D'},
1425                         { "metadata", no_argument, NULL, 'm'},
1426                         { "symlinks", no_argument, NULL, 'S'},
1427                         { "snapshots", no_argument, NULL, 's'},
1428                         { "xattr", no_argument, NULL, 'x'},
1429                         { "verbose", no_argument, NULL, 'v'},
1430                         { "ignore-errors", no_argument, NULL, 'i'},
1431                         { "overwrite", no_argument, NULL, 'o'},
1432                         { "super", required_argument, NULL, 'u'},
1433                         { "root", required_argument, NULL, 'r'},
1434                         { "list-roots", no_argument, NULL, 'l'},
1435                         { NULL, 0, NULL, 0}
1436                 };
1437
1438                 opt = getopt_long(argc, argv, "sSxviot:u:dmf:r:lDc", long_options,
1439                                         NULL);
1440                 if (opt < 0)
1441                         break;
1442
1443                 switch (opt) {
1444                         case 's':
1445                                 get_snaps = 1;
1446                                 break;
1447                         case 'v':
1448                                 verbose++;
1449                                 break;
1450                         case 'i':
1451                                 ignore_errors = 1;
1452                                 break;
1453                         case 'o':
1454                                 overwrite = 1;
1455                                 break;
1456                         case 't':
1457                                 tree_location = arg_strtou64(optarg);
1458                                 break;
1459                         case 'f':
1460                                 fs_location = arg_strtou64(optarg);
1461                                 break;
1462                         case 'u':
1463                                 super_mirror = arg_strtou64(optarg);
1464                                 if (super_mirror >= BTRFS_SUPER_MIRROR_MAX) {
1465                                         fprintf(stderr, "Super mirror not "
1466                                                 "valid\n");
1467                                         exit(1);
1468                                 }
1469                                 break;
1470                         case 'd':
1471                                 find_dir = 1;
1472                                 break;
1473                         case 'r':
1474                                 root_objectid = arg_strtou64(optarg);
1475                                 if (!is_fstree(root_objectid)) {
1476                                         fprintf(stderr, "objectid %llu is not a valid fs/file tree\n",
1477                                                         root_objectid);
1478                                         exit(1);
1479                                 }
1480                                 break;
1481                         case 'l':
1482                                 list_roots = 1;
1483                                 break;
1484                         case 'm':
1485                                 restore_metadata = 1;
1486                                 break;
1487                         case 'S':
1488                                 restore_symlinks = 1;
1489                                 break;
1490                         case 'D':
1491                                 dry_run = 1;
1492                                 break;
1493                         case 'c':
1494                                 match_cflags |= REG_ICASE;
1495                                 break;
1496                         case GETOPT_VAL_PATH_REGEX:
1497                                 match_regstr = optarg;
1498                                 break;
1499                         case 'x':
1500                                 get_xattrs = 1;
1501                                 break;
1502                         default:
1503                                 usage(cmd_restore_usage);
1504                 }
1505         }
1506
1507         if (!list_roots && check_argc_min(argc - optind, 2))
1508                 usage(cmd_restore_usage);
1509         else if (list_roots && check_argc_min(argc - optind, 1))
1510                 usage(cmd_restore_usage);
1511
1512         if (fs_location && root_objectid) {
1513                 fprintf(stderr, "don't use -f and -r at the same time.\n");
1514                 return 1;
1515         }
1516
1517         if ((ret = check_mounted(argv[optind])) < 0) {
1518                 fprintf(stderr, "Could not check mount status: %s\n",
1519                         strerror(-ret));
1520                 return 1;
1521         } else if (ret) {
1522                 fprintf(stderr, "%s is currently mounted.  Aborting.\n", argv[optind]);
1523                 return 1;
1524         }
1525
1526         root = open_fs(argv[optind], tree_location, super_mirror, list_roots);
1527         if (root == NULL)
1528                 return 1;
1529
1530         if (list_roots)
1531                 goto out;
1532
1533         if (fs_location != 0) {
1534                 free_extent_buffer(root->node);
1535                 root->node = read_tree_block(root, fs_location, root->nodesize, 0);
1536                 if (!extent_buffer_uptodate(root->node)) {
1537                         fprintf(stderr, "Failed to read fs location\n");
1538                         ret = 1;
1539                         goto out;
1540                 }
1541         }
1542
1543         memset(path_name, 0, PATH_MAX);
1544
1545         if (strlen(argv[optind + 1]) >= PATH_MAX) {
1546                 fprintf(stderr, "ERROR: path too long\n");
1547                 ret = 1;
1548                 goto out;
1549         }
1550         strncpy(dir_name, argv[optind + 1], sizeof dir_name);
1551         dir_name[sizeof dir_name - 1] = 0;
1552
1553         /* Strip the trailing / on the dir name */
1554         len = strlen(dir_name);
1555         while (len && dir_name[--len] == '/') {
1556                 dir_name[len] = '\0';
1557         }
1558
1559         if (root_objectid != 0) {
1560                 struct btrfs_root *orig_root = root;
1561
1562                 key.objectid = root_objectid;
1563                 key.type = BTRFS_ROOT_ITEM_KEY;
1564                 key.offset = (u64)-1;
1565                 root = btrfs_read_fs_root(orig_root->fs_info, &key);
1566                 if (IS_ERR(root)) {
1567                         fprintf(stderr, "fail to read root %llu: %s\n",
1568                                         root_objectid, strerror(-PTR_ERR(root)));
1569                         root = orig_root;
1570                         ret = 1;
1571                         goto out;
1572                 }
1573                 key.type = 0;
1574                 key.offset = 0;
1575         }
1576
1577         if (find_dir) {
1578                 ret = find_first_dir(root, &key.objectid);
1579                 if (ret)
1580                         goto out;
1581         } else {
1582                 key.objectid = BTRFS_FIRST_FREE_OBJECTID;
1583         }
1584
1585         if (match_regstr) {
1586                 ret = regcomp(&match_reg, match_regstr, match_cflags);
1587                 if (ret) {
1588                         regerror(ret, &match_reg, reg_err, sizeof(reg_err));
1589                         fprintf(stderr, "Regex compile failed: %s\n", reg_err);
1590                         goto out;
1591                 }
1592                 mreg = &match_reg;
1593         }
1594
1595         if (dry_run)
1596                 printf("This is a dry-run, no files are going to be restored\n");
1597
1598         ret = search_dir(root, &key, dir_name, "", mreg);
1599
1600 out:
1601         if (mreg)
1602                 regfree(mreg);
1603         close_ctree(root);
1604         return !!ret;
1605 }