2 * Copyright (C) 2011 Red Hat. All rights reserved.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
13 * You should have received a copy of the GNU General Public
14 * License along with this program; if not, write to the
15 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16 * Boston, MA 021110-1307, USA.
19 #define _XOPEN_SOURCE 500
22 #include "kerncompat.h"
30 #include <sys/types.h>
31 #include <lzo/lzoconf.h>
32 #include <lzo/lzo1x.h>
36 #include <sys/types.h>
37 #include <sys/xattr.h>
41 #include "print-tree.h"
42 #include "transaction.h"
49 static char fs_name[4096];
50 static char path_name[4096];
51 static int get_snaps = 0;
52 static int verbose = 0;
53 static int ignore_errors = 0;
54 static int overwrite = 0;
55 static int get_xattrs = 0;
56 static int dry_run = 0;
59 #define PAGE_CACHE_SIZE 4096
60 #define lzo1x_worst_compress(x) ((x) + ((x) / 16) + 64 + 3)
62 static int decompress_zlib(char *inbuf, char *outbuf, u64 compress_len,
68 memset(&strm, 0, sizeof(strm));
69 ret = inflateInit(&strm);
71 fprintf(stderr, "inflate init returnd %d\n", ret);
75 strm.avail_in = compress_len;
76 strm.next_in = (unsigned char *)inbuf;
77 strm.avail_out = decompress_len;
78 strm.next_out = (unsigned char *)outbuf;
79 ret = inflate(&strm, Z_NO_FLUSH);
80 if (ret != Z_STREAM_END) {
81 (void)inflateEnd(&strm);
82 fprintf(stderr, "failed to inflate: %d\n", ret);
86 (void)inflateEnd(&strm);
89 static inline size_t read_compress_length(unsigned char *buf)
92 memcpy(&dlen, buf, LZO_LEN);
93 return le32_to_cpu(dlen);
96 static int decompress_lzo(unsigned char *inbuf, char *outbuf, u64 compress_len,
107 if (ret != LZO_E_OK) {
108 fprintf(stderr, "lzo init returned %d\n", ret);
112 tot_len = read_compress_length(inbuf);
116 while (tot_in < tot_len) {
117 in_len = read_compress_length(inbuf);
119 if ((tot_in + LZO_LEN + in_len) > tot_len) {
120 fprintf(stderr, "bad compress length %lu\n",
121 (unsigned long)in_len);
128 new_len = lzo1x_worst_compress(PAGE_CACHE_SIZE);
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 fprintf(stderr, "failed to inflate: %d\n", ret);
142 *decompress_len = out_len;
147 static int decompress(char *inbuf, char *outbuf, u64 compress_len,
148 u64 *decompress_len, int compress)
151 case BTRFS_COMPRESS_ZLIB:
152 return decompress_zlib(inbuf, outbuf, compress_len,
154 case BTRFS_COMPRESS_LZO:
155 return decompress_lzo((unsigned char *)inbuf, outbuf, compress_len,
161 fprintf(stderr, "invalid compression type: %d\n", compress);
165 static int next_leaf(struct btrfs_root *root, struct btrfs_path *path)
170 struct extent_buffer *c;
171 struct extent_buffer *next = NULL;
174 for (; level < BTRFS_MAX_LEVEL; level++) {
175 if (path->nodes[level])
179 if (level == BTRFS_MAX_LEVEL)
182 slot = path->slots[level] + 1;
184 while(level < BTRFS_MAX_LEVEL) {
185 if (!path->nodes[level])
188 slot = path->slots[level] + offset;
189 c = path->nodes[level];
190 if (slot >= btrfs_header_nritems(c)) {
192 if (level == BTRFS_MAX_LEVEL)
198 reada_for_search(root, path, level, slot, 0);
200 next = read_node_slot(root, c, slot);
205 path->slots[level] = slot;
208 c = path->nodes[level];
209 free_extent_buffer(c);
210 path->nodes[level] = next;
211 path->slots[level] = 0;
215 reada_for_search(root, path, level, 0, 0);
216 next = read_node_slot(root, next, 0);
223 static int copy_one_inline(int fd, struct btrfs_path *path, u64 pos)
225 struct extent_buffer *leaf = path->nodes[0];
226 struct btrfs_file_extent_item *fi;
236 fi = btrfs_item_ptr(leaf, path->slots[0],
237 struct btrfs_file_extent_item);
238 ptr = btrfs_file_extent_inline_start(fi);
239 len = btrfs_file_extent_inline_len(leaf, path->slots[0], fi);
240 read_extent_buffer(leaf, buf, ptr, len);
242 compress = btrfs_file_extent_compression(leaf, fi);
243 if (compress == BTRFS_COMPRESS_NONE) {
244 done = pwrite(fd, buf, len, pos);
246 fprintf(stderr, "Short inline write, wanted %d, did "
247 "%zd: %d\n", len, done, errno);
253 ram_size = btrfs_file_extent_ram_bytes(leaf, fi);
254 outbuf = malloc(ram_size);
256 fprintf(stderr, "No memory\n");
260 ret = decompress(buf, outbuf, len, &ram_size, compress);
266 done = pwrite(fd, outbuf, ram_size, pos);
268 if (done < ram_size) {
269 fprintf(stderr, "Short compressed inline write, wanted %Lu, "
270 "did %zd: %d\n", ram_size, done, errno);
277 static int copy_one_extent(struct btrfs_root *root, int fd,
278 struct extent_buffer *leaf,
279 struct btrfs_file_extent_item *fi, u64 pos)
281 struct btrfs_multi_bio *multi = NULL;
282 struct btrfs_device *device;
283 char *inbuf, *outbuf = NULL;
284 ssize_t done, total = 0;
300 compress = btrfs_file_extent_compression(leaf, fi);
301 bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
302 disk_size = btrfs_file_extent_disk_num_bytes(leaf, fi);
303 ram_size = btrfs_file_extent_ram_bytes(leaf, fi);
304 offset = btrfs_file_extent_offset(leaf, fi);
305 num_bytes = btrfs_file_extent_num_bytes(leaf, fi);
306 size_left = disk_size;
307 if (compress == BTRFS_COMPRESS_NONE)
311 printf("offset is %Lu\n", offset);
312 /* we found a hole */
316 inbuf = malloc(size_left);
318 fprintf(stderr, "No memory\n");
322 if (compress != BTRFS_COMPRESS_NONE) {
323 outbuf = malloc(ram_size);
325 fprintf(stderr, "No memory\n");
332 ret = btrfs_map_block(&root->fs_info->mapping_tree, READ,
333 bytenr, &length, &multi, mirror_num, NULL);
335 fprintf(stderr, "Error mapping block %d\n", ret);
338 device = multi->stripes[0].dev;
341 dev_bytenr = multi->stripes[0].physical;
344 if (size_left < length)
347 done = pread(dev_fd, inbuf+count, length, dev_bytenr);
348 /* Need both checks, or we miss negative values due to u64 conversion */
349 if (done < 0 || done < length) {
350 num_copies = btrfs_num_copies(&root->fs_info->mapping_tree,
353 /* mirror_num is 1-indexed, so num_copies is a valid mirror. */
354 if (mirror_num > num_copies) {
356 fprintf(stderr, "Exhausted mirrors trying to read\n");
359 fprintf(stderr, "Trying another mirror\n");
370 if (compress == BTRFS_COMPRESS_NONE) {
371 while (total < num_bytes) {
372 done = pwrite(fd, inbuf+total, num_bytes-total,
376 fprintf(stderr, "Error writing: %d %s\n", errno, strerror(errno));
385 ret = decompress(inbuf, outbuf, disk_size, &ram_size, compress);
387 num_copies = btrfs_num_copies(&root->fs_info->mapping_tree,
390 if (mirror_num >= num_copies) {
394 fprintf(stderr, "Trying another mirror\n");
398 while (total < num_bytes) {
399 done = pwrite(fd, outbuf + offset + total,
420 static enum loop_response ask_to_continue(const char *file)
425 printf("We seem to be looping a lot on %s, do you want to keep going "
426 "on ? (y/N/a): ", file);
428 ret = fgets(buf, 2, stdin);
429 if (*ret == '\n' || tolower(*ret) == 'n')
431 if (tolower(*ret) == 'a')
433 if (tolower(*ret) != 'y') {
434 printf("Please enter one of 'y', 'n', or 'a': ");
438 return LOOP_CONTINUE;
442 static int set_file_xattrs(struct btrfs_root *root, u64 inode,
443 int fd, const char *file_name)
445 struct btrfs_key key;
446 struct btrfs_path *path;
447 struct extent_buffer *leaf;
448 struct btrfs_dir_item *di;
457 key.objectid = inode;
458 key.type = BTRFS_XATTR_ITEM_KEY;
461 path = btrfs_alloc_path();
465 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
469 leaf = path->nodes[0];
471 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
473 ret = next_leaf(root, path);
476 "Error searching for extended attributes: %d\n",
480 /* No more leaves to search */
484 leaf = path->nodes[0];
489 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
490 if (key.type != BTRFS_XATTR_ITEM_KEY || key.objectid != inode)
493 total_len = btrfs_item_size_nr(leaf, path->slots[0]);
494 di = btrfs_item_ptr(leaf, path->slots[0],
495 struct btrfs_dir_item);
497 while (cur < total_len) {
498 len = btrfs_dir_name_len(leaf, di);
499 if (len > name_len) {
501 name = (char *) malloc(len + 1);
507 read_extent_buffer(leaf, name,
508 (unsigned long)(di + 1), len);
512 len = btrfs_dir_data_len(leaf, di);
513 if (len > data_len) {
515 data = (char *) malloc(len);
521 read_extent_buffer(leaf, data,
522 (unsigned long)(di + 1) + name_len,
526 if (fsetxattr(fd, name, data, data_len, 0)) {
530 "Error setting extended attribute %s on file %s: %s\n",
531 name, file_name, strerror(err));
534 len = sizeof(*di) + name_len + data_len;
536 di = (struct btrfs_dir_item *)((char *)di + len);
542 btrfs_free_path(path);
550 static int copy_file(struct btrfs_root *root, int fd, struct btrfs_key *key,
553 struct extent_buffer *leaf;
554 struct btrfs_path *path;
555 struct btrfs_file_extent_item *fi;
556 struct btrfs_inode_item *inode_item;
557 struct btrfs_key found_key;
564 path = btrfs_alloc_path();
566 fprintf(stderr, "Ran out of memory\n");
569 path->skip_locking = 1;
571 ret = btrfs_lookup_inode(NULL, root, path, key, 0);
573 inode_item = btrfs_item_ptr(path->nodes[0], path->slots[0],
574 struct btrfs_inode_item);
575 found_size = btrfs_inode_size(path->nodes[0], inode_item);
577 btrfs_release_path(path);
580 key->type = BTRFS_EXTENT_DATA_KEY;
582 ret = btrfs_search_slot(NULL, root, key, path, 0, 0);
584 fprintf(stderr, "Error searching %d\n", ret);
585 btrfs_free_path(path);
589 leaf = path->nodes[0];
591 ret = next_leaf(root, path);
593 fprintf(stderr, "Error getting next leaf %d\n",
595 btrfs_free_path(path);
597 } else if (ret > 0) {
598 /* No more leaves to search */
599 btrfs_free_path(path);
602 leaf = path->nodes[0];
606 if (loops >= 0 && loops++ >= 1024) {
607 enum loop_response resp;
609 resp = ask_to_continue(file);
610 if (resp == LOOP_STOP)
612 else if (resp == LOOP_CONTINUE)
614 else if (resp == LOOP_DONTASK)
617 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
619 ret = next_leaf(root, path);
621 fprintf(stderr, "Error searching %d\n", ret);
622 btrfs_free_path(path);
625 /* No more leaves to search */
626 btrfs_free_path(path);
629 leaf = path->nodes[0];
633 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
634 if (found_key.objectid != key->objectid)
636 if (found_key.type != key->type)
638 fi = btrfs_item_ptr(leaf, path->slots[0],
639 struct btrfs_file_extent_item);
640 extent_type = btrfs_file_extent_type(leaf, fi);
641 compression = btrfs_file_extent_compression(leaf, fi);
642 if (compression >= BTRFS_COMPRESS_LAST) {
643 fprintf(stderr, "Don't support compression yet %d\n",
645 btrfs_free_path(path);
649 if (extent_type == BTRFS_FILE_EXTENT_PREALLOC)
651 if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
652 ret = copy_one_inline(fd, path, found_key.offset);
654 btrfs_free_path(path);
657 } else if (extent_type == BTRFS_FILE_EXTENT_REG) {
658 ret = copy_one_extent(root, fd, leaf, fi,
661 btrfs_free_path(path);
665 printf("Weird extent type %d\n", extent_type);
671 btrfs_free_path(path);
674 ret = ftruncate(fd, (loff_t)found_size);
679 ret = set_file_xattrs(root, key->objectid, fd, file);
686 static int search_dir(struct btrfs_root *root, struct btrfs_key *key,
687 const char *output_rootdir, const char *in_dir,
690 struct btrfs_path *path;
691 struct extent_buffer *leaf;
692 struct btrfs_dir_item *dir_item;
693 struct btrfs_key found_key, location;
694 char filename[BTRFS_NAME_LEN + 1];
695 unsigned long name_ptr;
702 path = btrfs_alloc_path();
704 fprintf(stderr, "Ran out of memory\n");
707 path->skip_locking = 1;
710 key->type = BTRFS_DIR_INDEX_KEY;
712 ret = btrfs_search_slot(NULL, root, key, path, 0, 0);
714 fprintf(stderr, "Error searching %d\n", ret);
715 btrfs_free_path(path);
719 leaf = path->nodes[0];
722 printf("No leaf after search, looking for the next "
724 ret = next_leaf(root, path);
726 fprintf(stderr, "Error getting next leaf %d\n",
728 btrfs_free_path(path);
730 } else if (ret > 0) {
731 /* No more leaves to search */
733 printf("Reached the end of the tree looking "
734 "for the directory\n");
735 btrfs_free_path(path);
738 leaf = path->nodes[0];
742 if (loops++ >= 1024) {
743 printf("We have looped trying to restore files in %s "
744 "too many times to be making progress, "
745 "stopping\n", in_dir);
749 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
751 ret = next_leaf(root, path);
753 fprintf(stderr, "Error searching %d\n",
755 btrfs_free_path(path);
757 } else if (ret > 0) {
758 /* No more leaves to search */
760 printf("Reached the end of "
761 "the tree searching the"
763 btrfs_free_path(path);
766 leaf = path->nodes[0];
770 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
771 if (found_key.objectid != key->objectid) {
773 printf("Found objectid=%Lu, key=%Lu\n",
774 found_key.objectid, key->objectid);
777 if (found_key.type != key->type) {
779 printf("Found type=%u, want=%u\n",
780 found_key.type, key->type);
783 dir_item = btrfs_item_ptr(leaf, path->slots[0],
784 struct btrfs_dir_item);
785 name_ptr = (unsigned long)(dir_item + 1);
786 name_len = btrfs_dir_name_len(leaf, dir_item);
787 read_extent_buffer(leaf, filename, name_ptr, name_len);
788 filename[name_len] = '\0';
789 type = btrfs_dir_type(leaf, dir_item);
790 btrfs_dir_item_key_to_cpu(leaf, dir_item, &location);
792 /* full path from root of btrfs being restored */
793 snprintf(fs_name, 4096, "%s/%s", in_dir, filename);
795 if (mreg && REG_NOMATCH == regexec(mreg, fs_name, 0, NULL, 0))
798 /* full path from system root */
799 snprintf(path_name, 4096, "%s%s", output_rootdir, fs_name);
802 * At this point we're only going to restore directories and
803 * files, no symlinks or anything else.
805 if (type == BTRFS_FT_REG_FILE) {
810 ret = stat(path_name, &st);
813 if (verbose || !warn)
814 printf("Skipping existing file"
818 printf("If you wish to overwrite use "
819 "the -o option to overwrite\n");
826 printf("Restoring %s\n", path_name);
829 fd = open(path_name, O_CREAT|O_WRONLY, 0644);
831 fprintf(stderr, "Error creating %s: %d\n",
835 btrfs_free_path(path);
839 ret = copy_file(root, fd, &location, path_name);
844 btrfs_free_path(path);
847 } else if (type == BTRFS_FT_DIR) {
848 struct btrfs_root *search_root = root;
849 char *dir = strdup(fs_name);
852 fprintf(stderr, "Ran out of memory\n");
853 btrfs_free_path(path);
857 if (location.type == BTRFS_ROOT_ITEM_KEY) {
859 * If we are a snapshot and this is the index
860 * object to ourselves just skip it.
862 if (location.objectid ==
863 root->root_key.objectid) {
868 location.offset = (u64)-1;
869 search_root = btrfs_read_fs_root(root->fs_info,
871 if (IS_ERR(search_root)) {
873 fprintf(stderr, "Error reading "
874 "subvolume %s: %lu\n",
876 PTR_ERR(search_root));
879 btrfs_free_path(path);
880 return PTR_ERR(search_root);
884 * A subvolume will have a key.offset of 0, a
885 * snapshot will have key.offset of a transid.
887 if (search_root->root_key.offset != 0 &&
890 printf("Skipping snapshot %s\n",
894 location.objectid = BTRFS_FIRST_FREE_OBJECTID;
898 printf("Restoring %s\n", path_name);
904 ret = mkdir(path_name, 0755);
905 if (ret && errno != EEXIST) {
907 fprintf(stderr, "Error mkdiring %s: %d\n",
911 btrfs_free_path(path);
915 ret = search_dir(search_root, &location,
916 output_rootdir, dir, mreg);
921 btrfs_free_path(path);
930 printf("Done searching %s\n", in_dir);
931 btrfs_free_path(path);
935 static int do_list_roots(struct btrfs_root *root)
937 struct btrfs_key key;
938 struct btrfs_key found_key;
939 struct btrfs_disk_key disk_key;
940 struct btrfs_path *path;
941 struct extent_buffer *leaf;
942 struct btrfs_root_item ri;
943 unsigned long offset;
947 root = root->fs_info->tree_root;
948 path = btrfs_alloc_path();
950 fprintf(stderr, "Failed to alloc path\n");
956 key.type = BTRFS_ROOT_ITEM_KEY;
958 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
960 fprintf(stderr, "Failed to do search %d\n", ret);
961 btrfs_free_path(path);
966 leaf = path->nodes[0];
967 slot = path->slots[0];
968 if (slot >= btrfs_header_nritems(leaf)) {
969 ret = btrfs_next_leaf(root, path);
972 leaf = path->nodes[0];
973 slot = path->slots[0];
975 btrfs_item_key(leaf, &disk_key, slot);
976 btrfs_disk_key_to_cpu(&found_key, &disk_key);
977 if (btrfs_key_type(&found_key) != BTRFS_ROOT_ITEM_KEY) {
982 offset = btrfs_item_ptr_offset(leaf, slot);
983 read_extent_buffer(leaf, &ri, offset, sizeof(ri));
985 btrfs_print_key(&disk_key);
986 printf(" %Lu level %d\n", btrfs_root_bytenr(&ri),
987 btrfs_root_level(&ri));
990 btrfs_free_path(path);
995 static struct btrfs_root *open_fs(const char *dev, u64 root_location,
996 int super_mirror, int list_roots)
998 struct btrfs_fs_info *fs_info = NULL;
999 struct btrfs_root *root = NULL;
1003 for (i = super_mirror; i < BTRFS_SUPER_MIRROR_MAX; i++) {
1004 bytenr = btrfs_sb_offset(i);
1005 fs_info = open_ctree_fs_info(dev, bytenr, root_location,
1006 OPEN_CTREE_PARTIAL);
1009 fprintf(stderr, "Could not open root, trying backup super\n");
1016 * All we really need to succeed is reading the chunk tree, everything
1017 * else we can do by hand, since we only need to read the tree root and
1020 if (!extent_buffer_uptodate(fs_info->tree_root->node)) {
1023 root = fs_info->tree_root;
1025 root_location = btrfs_super_root(fs_info->super_copy);
1026 generation = btrfs_super_generation(fs_info->super_copy);
1027 root->node = read_tree_block(root, root_location,
1028 root->leafsize, generation);
1029 if (!extent_buffer_uptodate(root->node)) {
1030 fprintf(stderr, "Error opening tree root\n");
1036 if (!list_roots && !fs_info->fs_root) {
1037 struct btrfs_key key;
1039 key.objectid = BTRFS_FS_TREE_OBJECTID;
1040 key.type = BTRFS_ROOT_ITEM_KEY;
1041 key.offset = (u64)-1;
1042 fs_info->fs_root = btrfs_read_fs_root_no_cache(fs_info, &key);
1043 if (IS_ERR(fs_info->fs_root)) {
1044 fprintf(stderr, "Couldn't read fs root: %ld\n",
1045 PTR_ERR(fs_info->fs_root));
1046 close_ctree(fs_info->tree_root);
1051 if (list_roots && do_list_roots(fs_info->tree_root)) {
1052 close_ctree(fs_info->tree_root);
1056 return fs_info->fs_root;
1059 static int find_first_dir(struct btrfs_root *root, u64 *objectid)
1061 struct btrfs_path *path;
1062 struct btrfs_key found_key;
1063 struct btrfs_key key;
1068 key.type = BTRFS_DIR_INDEX_KEY;
1071 path = btrfs_alloc_path();
1073 fprintf(stderr, "Ran out of memory\n");
1077 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
1079 fprintf(stderr, "Error searching %d\n", ret);
1083 if (!path->nodes[0]) {
1084 fprintf(stderr, "No leaf!\n");
1088 for (i = path->slots[0];
1089 i < btrfs_header_nritems(path->nodes[0]); i++) {
1090 btrfs_item_key_to_cpu(path->nodes[0], &found_key, i);
1091 if (found_key.type != key.type)
1094 printf("Using objectid %Lu for first dir\n",
1095 found_key.objectid);
1096 *objectid = found_key.objectid;
1101 ret = next_leaf(root, path);
1103 fprintf(stderr, "Error getting next leaf %d\n",
1106 } else if (ret > 0) {
1107 fprintf(stderr, "No more leaves\n");
1110 } while (!path->nodes[0]);
1113 printf("Couldn't find a dir index item\n");
1115 btrfs_free_path(path);
1119 static struct option long_options[] = {
1120 { "path-regex", 1, NULL, 256},
1121 { "dry-run", 0, NULL, 'D'},
1125 const char * const cmd_restore_usage[] = {
1126 "btrfs restore [options] <device> <path> | -l <device>",
1127 "Try to restore files from a damaged filesystem (unmounted)",
1130 "-x get extended attributes",
1134 "-t <bytenr> tree location",
1135 "-f <bytenr> filesystem location",
1136 "-u <mirror> super mirror",
1137 "-r <rootid> root objectid",
1139 "-l list tree roots",
1140 "-D|--dry-run dry run (only list files that would be recovered)",
1141 "--path-regex <regex>",
1142 " restore only filenames matching regex,",
1143 " you have to use following syntax (possibly quoted):",
1144 " ^/(|home(|/username(|/Desktop(|/.*))))$",
1145 "-c ignore case (--path-regrex only)",
1149 int cmd_restore(int argc, char **argv)
1151 struct btrfs_root *root;
1152 struct btrfs_key key;
1154 u64 tree_location = 0;
1155 u64 fs_location = 0;
1156 u64 root_objectid = 0;
1160 int option_index = 0;
1161 int super_mirror = 0;
1164 const char *match_regstr = NULL;
1165 int match_cflags = REG_EXTENDED | REG_NOSUB | REG_NEWLINE;
1166 regex_t match_reg, *mreg = NULL;
1169 while ((opt = getopt_long(argc, argv, "sxviot:u:df:r:lDc", long_options,
1170 &option_index)) != -1) {
1186 tree_location = arg_strtou64(optarg);
1189 fs_location = arg_strtou64(optarg);
1192 super_mirror = arg_strtou64(optarg);
1193 if (super_mirror >= BTRFS_SUPER_MIRROR_MAX) {
1194 fprintf(stderr, "Super mirror not "
1203 root_objectid = arg_strtou64(optarg);
1204 if (!is_fstree(root_objectid)) {
1205 fprintf(stderr, "objectid %llu is not a valid fs/file tree\n",
1217 match_cflags |= REG_ICASE;
1219 /* long option without single letter alternative */
1221 match_regstr = optarg;
1227 usage(cmd_restore_usage);
1232 if (!list_roots && check_argc_min(argc - optind, 2))
1233 usage(cmd_restore_usage);
1234 else if (list_roots && check_argc_min(argc - optind, 1))
1235 usage(cmd_restore_usage);
1237 if (fs_location && root_objectid) {
1238 fprintf(stderr, "don't use -f and -r at the same time.\n");
1242 if ((ret = check_mounted(argv[optind])) < 0) {
1243 fprintf(stderr, "Could not check mount status: %s\n",
1247 fprintf(stderr, "%s is currently mounted. Aborting.\n", argv[optind]);
1251 root = open_fs(argv[optind], tree_location, super_mirror, list_roots);
1258 if (fs_location != 0) {
1259 free_extent_buffer(root->node);
1260 root->node = read_tree_block(root, fs_location, root->leafsize, 0);
1262 fprintf(stderr, "Failed to read fs location\n");
1268 memset(path_name, 0, 4096);
1270 strncpy(dir_name, argv[optind + 1], sizeof dir_name);
1271 dir_name[sizeof dir_name - 1] = 0;
1273 /* Strip the trailing / on the dir name */
1274 len = strlen(dir_name);
1275 while (len && dir_name[--len] == '/') {
1276 dir_name[len] = '\0';
1279 if (root_objectid != 0) {
1280 struct btrfs_root *orig_root = root;
1282 key.objectid = root_objectid;
1283 key.type = BTRFS_ROOT_ITEM_KEY;
1284 key.offset = (u64)-1;
1285 root = btrfs_read_fs_root(orig_root->fs_info, &key);
1287 fprintf(stderr, "fail to read root %llu: %s\n",
1288 root_objectid, strerror(-PTR_ERR(root)));
1298 ret = find_first_dir(root, &key.objectid);
1302 key.objectid = BTRFS_FIRST_FREE_OBJECTID;
1306 ret = regcomp(&match_reg, match_regstr, match_cflags);
1308 regerror(ret, &match_reg, reg_err, sizeof(reg_err));
1309 fprintf(stderr, "Regex compile failed: %s\n", reg_err);
1316 printf("This is a dry-run, no files are going to be restored\n");
1318 ret = search_dir(root, &key, dir_name, "", mreg);