/* * Copyright (C) 2011 Red Hat. All rights reserved. * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public * License v2 as published by the Free Software Foundation. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * General Public License for more details. * * You should have received a copy of the GNU General Public * License along with this program; if not, write to the * Free Software Foundation, Inc., 59 Temple Place - Suite 330, * Boston, MA 021110-1307, USA. */ #define _XOPEN_SOURCE 500 #define _GNU_SOURCE 1 #include "kerncompat.h" #include #include #include #include #include #include #include #include "ctree.h" #include "disk-io.h" #include "print-tree.h" #include "transaction.h" #include "list.h" #include "version.h" #include "volumes.h" #include "utils.h" static char path_name[4096]; static int get_snaps = 0; static int verbose = 0; static int ignore_errors = 0; static int overwrite = 0; static int decompress(char *inbuf, char *outbuf, u64 compress_len, u64 decompress_len) { z_stream strm; int ret; memset(&strm, 0, sizeof(strm)); ret = inflateInit(&strm); if (ret != Z_OK) { fprintf(stderr, "inflate init returnd %d\n", ret); return -1; } strm.avail_in = compress_len; strm.next_in = (unsigned char *)inbuf; strm.avail_out = decompress_len; strm.next_out = (unsigned char *)outbuf; ret = inflate(&strm, Z_NO_FLUSH); if (ret != Z_STREAM_END) { (void)inflateEnd(&strm); fprintf(stderr, "ret is %d\n", ret); return -1; } (void)inflateEnd(&strm); return 0; } int next_leaf(struct btrfs_root *root, struct btrfs_path *path) { int slot; int level = 1; struct extent_buffer *c; struct extent_buffer *next = NULL; for (; level < BTRFS_MAX_LEVEL; level++) { if (path->nodes[level]) break; } if (level == BTRFS_MAX_LEVEL) return 1; slot = path->slots[level] + 1; while(level < BTRFS_MAX_LEVEL) { if (!path->nodes[level]) return 1; slot = path->slots[level] + 1; c = path->nodes[level]; if (slot >= btrfs_header_nritems(c)) { level++; if (level == BTRFS_MAX_LEVEL) return 1; continue; } if (path->reada) reada_for_search(root, path, level, slot, 0); next = read_node_slot(root, c, slot); break; } path->slots[level] = slot; while(1) { level--; c = path->nodes[level]; free_extent_buffer(c); path->nodes[level] = next; path->slots[level] = 0; if (!level) break; if (path->reada) reada_for_search(root, path, level, 0, 0); next = read_node_slot(root, next, 0); } return 0; } static int copy_one_inline(int fd, struct btrfs_path *path, u64 pos) { struct extent_buffer *leaf = path->nodes[0]; struct btrfs_file_extent_item *fi; char buf[4096]; char *outbuf; ssize_t done; unsigned long ptr; int ret; int len; int ram_size; int compress; fi = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_file_extent_item); ptr = btrfs_file_extent_inline_start(fi); len = btrfs_file_extent_inline_item_len(leaf, btrfs_item_nr(leaf, path->slots[0])); read_extent_buffer(leaf, buf, ptr, len); compress = btrfs_file_extent_compression(leaf, fi); if (compress == BTRFS_COMPRESS_NONE) { done = pwrite(fd, buf, len, pos); if (done < len) { fprintf(stderr, "Short inline write, wanted %d, did " "%zd: %d\n", len, done, errno); return -1; } return 0; } ram_size = btrfs_file_extent_ram_bytes(leaf, fi); outbuf = malloc(ram_size); if (!outbuf) { fprintf(stderr, "No memory\n"); return -1; } ret = decompress(buf, outbuf, len, ram_size); if (ret) { free(outbuf); return ret; } done = pwrite(fd, outbuf, ram_size, pos); free(outbuf); if (done < ram_size) { fprintf(stderr, "Short compressed inline write, wanted %d, " "did %zd: %d\n", ram_size, done, errno); return -1; } return 0; } static int copy_one_extent(struct btrfs_root *root, int fd, struct extent_buffer *leaf, struct btrfs_file_extent_item *fi, u64 pos) { struct btrfs_multi_bio *multi = NULL; struct btrfs_device *device; char *inbuf, *outbuf = NULL; ssize_t done, total = 0; u64 bytenr; u64 ram_size; u64 disk_size; u64 length; u64 size_left; u64 dev_bytenr; u64 count = 0; int compress; int ret; int dev_fd; compress = btrfs_file_extent_compression(leaf, fi); bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); disk_size = btrfs_file_extent_disk_num_bytes(leaf, fi); ram_size = btrfs_file_extent_ram_bytes(leaf, fi); size_left = disk_size; /* we found a hole */ if (disk_size == 0) return 0; inbuf = malloc(disk_size); if (!inbuf) { fprintf(stderr, "No memory\n"); return -1; } if (compress != BTRFS_COMPRESS_NONE) { outbuf = malloc(ram_size); if (!outbuf) { fprintf(stderr, "No memory\n"); free(inbuf); return -1; } } again: length = size_left; ret = btrfs_map_block(&root->fs_info->mapping_tree, READ, bytenr, &length, &multi, 0); if (ret) { free(inbuf); free(outbuf); fprintf(stderr, "Error mapping block %d\n", ret); return ret; } device = multi->stripes[0].dev; dev_fd = device->fd; device->total_ios++; dev_bytenr = multi->stripes[0].physical; kfree(multi); if (size_left < length) length = size_left; size_left -= length; done = pread(dev_fd, inbuf+count, length, dev_bytenr); if (done < length) { free(inbuf); free(outbuf); fprintf(stderr, "Short read %d\n", errno); return -1; } count += length; bytenr += length; if (size_left) goto again; if (compress == BTRFS_COMPRESS_NONE) { while (total < ram_size) { done = pwrite(fd, inbuf+total, ram_size-total, pos+total); if (done < 0) { free(inbuf); fprintf(stderr, "Error writing: %d %s\n", errno, strerror(errno)); return -1; } total += done; } free(inbuf); return 0; } ret = decompress(inbuf, outbuf, disk_size, ram_size); free(inbuf); if (ret) { free(outbuf); return ret; } while (total < ram_size) { done = pwrite(fd, outbuf+total, ram_size-total, pos+total); if (done < 0) { free(outbuf); fprintf(stderr, "Error writing: %d %s\n", errno, strerror(errno)); return -1; } total += done; } free(outbuf); return 0; } static int ask_to_continue(const char *file) { char buf[2]; char *ret; printf("We seem to be looping a lot on %s, do you want to keep going " "on ? (y/N): ", file); again: ret = fgets(buf, 2, stdin); if (*ret == '\n' || tolower(*ret) == 'n') return 1; if (tolower(*ret) != 'y') { printf("Please enter either 'y' or 'n': "); goto again; } return 0; } static int copy_file(struct btrfs_root *root, int fd, struct btrfs_key *key, const char *file) { struct extent_buffer *leaf; struct btrfs_path *path; struct btrfs_file_extent_item *fi; struct btrfs_inode_item *inode_item; struct btrfs_key found_key; int ret; int extent_type; int compression; int loops = 0; u64 found_size = 0; path = btrfs_alloc_path(); if (!path) { fprintf(stderr, "Ran out of memory\n"); return -1; } path->skip_locking = 1; ret = btrfs_lookup_inode(NULL, root, path, key, 0); if (ret == 0) { inode_item = btrfs_item_ptr(path->nodes[0], path->slots[0], struct btrfs_inode_item); found_size = btrfs_inode_size(path->nodes[0], inode_item); } btrfs_release_path(root, path); key->offset = 0; key->type = BTRFS_EXTENT_DATA_KEY; ret = btrfs_search_slot(NULL, root, key, path, 0, 0); if (ret < 0) { fprintf(stderr, "Error searching %d\n", ret); btrfs_free_path(path); return ret; } leaf = path->nodes[0]; while (!leaf) { ret = next_leaf(root, path); if (ret < 0) { fprintf(stderr, "Error getting next leaf %d\n", ret); btrfs_free_path(path); return ret; } else if (ret > 0) { /* No more leaves to search */ btrfs_free_path(path); return 0; } leaf = path->nodes[0]; } while (1) { if (loops++ >= 1024) { ret = ask_to_continue(file); if (ret) break; loops = 0; } if (path->slots[0] >= btrfs_header_nritems(leaf)) { do { ret = next_leaf(root, path); if (ret < 0) { fprintf(stderr, "Error searching %d\n", ret); btrfs_free_path(path); return ret; } else if (ret) { /* No more leaves to search */ btrfs_free_path(path); goto set_size; } leaf = path->nodes[0]; } while (!leaf); continue; } btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); if (found_key.objectid != key->objectid) break; if (found_key.type != key->type) break; fi = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_file_extent_item); extent_type = btrfs_file_extent_type(leaf, fi); compression = btrfs_file_extent_compression(leaf, fi); if (compression >= BTRFS_COMPRESS_LAST) { fprintf(stderr, "Don't support compression yet %d\n", compression); btrfs_free_path(path); return -1; } if (extent_type == BTRFS_FILE_EXTENT_PREALLOC) goto next; if (extent_type == BTRFS_FILE_EXTENT_INLINE) { ret = copy_one_inline(fd, path, found_key.offset); if (ret) { btrfs_free_path(path); return -1; } } else if (extent_type == BTRFS_FILE_EXTENT_REG) { ret = copy_one_extent(root, fd, leaf, fi, found_key.offset); if (ret) { btrfs_free_path(path); return ret; } } else { printf("Weird extent type %d\n", extent_type); } next: path->slots[0]++; } btrfs_free_path(path); set_size: if (found_size) { ret = ftruncate(fd, (loff_t)found_size); if (ret) return ret; } return 0; } static int search_dir(struct btrfs_root *root, struct btrfs_key *key, const char *dir) { struct btrfs_path *path; struct extent_buffer *leaf; struct btrfs_dir_item *dir_item; struct btrfs_key found_key, location; char filename[BTRFS_NAME_LEN + 1]; unsigned long name_ptr; int name_len; int ret; int fd; int loops = 0; u8 type; path = btrfs_alloc_path(); if (!path) { fprintf(stderr, "Ran out of memory\n"); return -1; } path->skip_locking = 1; key->offset = 0; key->type = BTRFS_DIR_INDEX_KEY; ret = btrfs_search_slot(NULL, root, key, path, 0, 0); if (ret < 0) { fprintf(stderr, "Error searching %d\n", ret); btrfs_free_path(path); return ret; } leaf = path->nodes[0]; while (!leaf) { if (verbose > 1) printf("No leaf after search, looking for the next " "leaf\n"); ret = next_leaf(root, path); if (ret < 0) { fprintf(stderr, "Error getting next leaf %d\n", ret); btrfs_free_path(path); return ret; } else if (ret > 0) { /* No more leaves to search */ if (verbose) printf("Reached the end of the tree looking " "for the directory\n"); btrfs_free_path(path); return 0; } leaf = path->nodes[0]; } while (leaf) { if (loops++ >= 1024) { printf("We have looped trying to restore files in %s " "too many times to be making progress, " "stopping\n", dir); break; } if (path->slots[0] >= btrfs_header_nritems(leaf)) { do { ret = next_leaf(root, path); if (ret < 0) { fprintf(stderr, "Error searching %d\n", ret); btrfs_free_path(path); return ret; } else if (ret > 0) { /* No more leaves to search */ if (verbose) printf("Reached the end of " "the tree searching the" " directory\n"); btrfs_free_path(path); return 0; } leaf = path->nodes[0]; } while (!leaf); continue; } btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); if (found_key.objectid != key->objectid) { if (verbose > 1) printf("Found objectid=%Lu, key=%Lu\n", found_key.objectid, key->objectid); break; } if (found_key.type != key->type) { if (verbose > 1) printf("Found type=%u, want=%u\n", found_key.type, key->type); break; } dir_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dir_item); name_ptr = (unsigned long)(dir_item + 1); name_len = btrfs_dir_name_len(leaf, dir_item); read_extent_buffer(leaf, filename, name_ptr, name_len); filename[name_len] = '\0'; type = btrfs_dir_type(leaf, dir_item); btrfs_dir_item_key_to_cpu(leaf, dir_item, &location); snprintf(path_name, 4096, "%s/%s", dir, filename); /* * At this point we're only going to restore directories and * files, no symlinks or anything else. */ if (type == BTRFS_FT_REG_FILE) { if (!overwrite) { static int warn = 0; struct stat st; ret = stat(path_name, &st); if (!ret) { loops = 0; if (verbose || !warn) printf("Skipping existing file" " %s\n", path_name); if (warn) goto next; printf("If you wish to overwrite use " "the -o option to overwrite\n"); warn = 1; goto next; } ret = 0; } if (verbose) printf("Restoring %s\n", path_name); fd = open(path_name, O_CREAT|O_WRONLY, 0644); if (fd < 0) { fprintf(stderr, "Error creating %s: %d\n", path_name, errno); if (ignore_errors) goto next; btrfs_free_path(path); return -1; } loops = 0; ret = copy_file(root, fd, &location, path_name); close(fd); if (ret) { if (ignore_errors) goto next; btrfs_free_path(path); return ret; } } else if (type == BTRFS_FT_DIR) { struct btrfs_root *search_root = root; char *dir = strdup(path_name); if (!dir) { fprintf(stderr, "Ran out of memory\n"); btrfs_free_path(path); return -1; } if (location.type == BTRFS_ROOT_ITEM_KEY) { /* * If we are a snapshot and this is the index * object to ourselves just skip it. */ if (location.objectid == root->root_key.objectid) { free(dir); goto next; } search_root = btrfs_read_fs_root(root->fs_info, &location); if (IS_ERR(search_root)) { free(dir); fprintf(stderr, "Error reading " "subvolume %s: %lu\n", path_name, PTR_ERR(search_root)); if (ignore_errors) goto next; btrfs_free_path(path); return PTR_ERR(search_root); } /* * A subvolume will have a key.offset of 0, a * snapshot will have key.offset of a transid. */ if (search_root->root_key.offset != 0 && get_snaps == 0) { free(dir); printf("Skipping snapshot %s\n", filename); goto next; } location.objectid = BTRFS_FIRST_FREE_OBJECTID; } if (verbose) printf("Restoring %s\n", path_name); errno = 0; ret = mkdir(path_name, 0755); if (ret && errno != EEXIST) { free(dir); fprintf(stderr, "Error mkdiring %s: %d\n", path_name, errno); if (ignore_errors) goto next; btrfs_free_path(path); return -1; } loops = 0; ret = search_dir(search_root, &location, dir); free(dir); if (ret) { if (ignore_errors) goto next; btrfs_free_path(path); return ret; } } next: path->slots[0]++; } if (verbose) printf("Done searching %s\n", dir); btrfs_free_path(path); return 0; } static void usage() { fprintf(stderr, "Usage: restore [-svio] [-t disk offset] " "\n"); } static struct btrfs_root *open_fs(const char *dev, u64 root_location, int super_mirror) { struct btrfs_root *root; u64 bytenr; int i; for (i = super_mirror; i < BTRFS_SUPER_MIRROR_MAX; i++) { bytenr = btrfs_sb_offset(i); root = open_ctree_recovery(dev, bytenr, root_location); if (root) return root; fprintf(stderr, "Could not open root, trying backup super\n"); } return NULL; } static int find_first_dir(struct btrfs_root *root, u64 *objectid) { struct btrfs_path *path; struct btrfs_key found_key; struct btrfs_key key; int ret = -1; int i; key.objectid = 0; key.type = BTRFS_DIR_INDEX_KEY; key.offset = 0; path = btrfs_alloc_path(); if (!path) { fprintf(stderr, "Ran out of memory\n"); return ret; } ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); if (ret < 0) { fprintf(stderr, "Error searching %d\n", ret); goto out; } if (!path->nodes[0]) { fprintf(stderr, "No leaf!\n"); goto out; } again: for (i = path->slots[0]; i < btrfs_header_nritems(path->nodes[0]); i++) { btrfs_item_key_to_cpu(path->nodes[0], &found_key, i); if (found_key.type != key.type) continue; printf("Using objectid %Lu for first dir\n", found_key.objectid); *objectid = found_key.objectid; ret = 0; goto out; } do { ret = next_leaf(root, path); if (ret < 0) { fprintf(stderr, "Error getting next leaf %d\n", ret); goto out; } else if (ret > 0) { fprintf(stderr, "No more leaves\n"); goto out; } } while (!path->nodes[0]); if (path->nodes[0]) goto again; printf("Couldn't find a dir index item\n"); out: btrfs_free_path(path); return ret; } int main(int argc, char **argv) { struct btrfs_root *root; struct btrfs_key key; char dir_name[128]; u64 tree_location = 0; u64 fs_location = 0; int len; int ret; int opt; int super_mirror = 0; int find_dir = 0; while ((opt = getopt(argc, argv, "sviot:u:df:")) != -1) { switch (opt) { case 's': get_snaps = 1; break; case 'v': verbose++; break; case 'i': ignore_errors = 1; break; case 'o': overwrite = 1; break; case 't': errno = 0; tree_location = (u64)strtoll(optarg, NULL, 10); if (errno != 0) { fprintf(stderr, "Tree location not valid\n"); exit(1); } break; case 'f': errno = 0; fs_location = (u64)strtoll(optarg, NULL, 10); if (errno != 0) { fprintf(stderr, "Fs location not valid\n"); exit(1); } break; case 'u': errno = 0; super_mirror = (int)strtol(optarg, NULL, 10); if (errno != 0 || super_mirror >= BTRFS_SUPER_MIRROR_MAX) { fprintf(stderr, "Super mirror not " "valid\n"); exit(1); } break; case 'd': find_dir = 1; break; default: usage(); exit(1); } } if (optind + 1 >= argc) { usage(); exit(1); } if ((ret = check_mounted(argv[optind])) < 0) { fprintf(stderr, "Could not check mount status: %s\n", strerror(ret)); return ret; } else if (ret) { fprintf(stderr, "%s is currently mounted. Aborting.\n", argv[optind]); return 1; } root = open_fs(argv[optind], tree_location, super_mirror); if (root == NULL) return 1; if (fs_location != 0) { free_extent_buffer(root->node); root->node = read_tree_block(root, fs_location, 4096, 0); if (!root->node) { fprintf(stderr, "Failed to read fs location\n"); goto out; } } printf("Root objectid is %Lu\n", root->objectid); memset(path_name, 0, 4096); strncpy(dir_name, argv[optind + 1], sizeof dir_name); dir_name[sizeof dir_name - 1] = 0; /* Strip the trailing / on the dir name */ len = strlen(dir_name); while (len && dir_name[--len] == '/') { dir_name[len] = '\0'; } if (find_dir) { ret = find_first_dir(root, &key.objectid); if (ret) goto out; } else { key.objectid = BTRFS_FIRST_FREE_OBJECTID; } ret = search_dir(root->fs_info->fs_root, &key, dir_name); out: close_ctree(root); return ret; }