2 * This program is free software; you can redistribute it and/or
3 * modify it under the terms of the GNU General Public
4 * License v2 as published by the Free Software Foundation.
6 * This program is distributed in the hope that it will be useful,
7 * but WITHOUT ANY WARRANTY; without even the implied warranty of
8 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
9 * General Public License for more details.
11 * You should have received a copy of the GNU General Public
12 * License along with this program; if not, write to the
13 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
14 * Boston, MA 021110-1307, USA.
21 #include <sys/ioctl.h>
26 #include "kerncompat.h"
30 #include "send-utils.h"
33 #include "btrfs-list.h"
34 #include "cmds-inspect-dump-tree.h"
35 #include "cmds-inspect-dump-super.h"
36 #include "cmds-inspect-tree-stats.h"
39 static const char * const inspect_cmd_group_usage[] = {
40 "btrfs inspect-internal <command> <args>",
44 static int __ino_to_path_fd(u64 inum, int fd, int verbose, const char *prepend)
48 struct btrfs_ioctl_ino_path_args ipa;
49 struct btrfs_data_container fspath[PATH_MAX];
51 memset(fspath, 0, sizeof(*fspath));
54 ipa.fspath = ptr_to_u64(fspath);
56 ret = ioctl(fd, BTRFS_IOC_INO_PATHS, &ipa);
58 error("ino paths ioctl: %s", strerror(errno));
63 printf("ioctl ret=%d, bytes_left=%lu, bytes_missing=%lu, "
64 "cnt=%d, missed=%d\n", ret,
65 (unsigned long)fspath->bytes_left,
66 (unsigned long)fspath->bytes_missing,
67 fspath->elem_cnt, fspath->elem_missed);
69 for (i = 0; i < fspath->elem_cnt; ++i) {
72 ptr = (u64)(unsigned long)fspath->val;
73 ptr += fspath->val[i];
74 str = (char *)(unsigned long)ptr;
76 printf("%s/%s\n", prepend, str);
85 static const char * const cmd_inspect_inode_resolve_usage[] = {
86 "btrfs inspect-internal inode-resolve [-v] <inode> <path>",
87 "Get file system paths for the given inode",
93 static int cmd_inspect_inode_resolve(int argc, char **argv)
98 DIR *dirstream = NULL;
101 int c = getopt(argc, argv, "v");
110 usage(cmd_inspect_inode_resolve_usage);
114 if (check_argc_exact(argc - optind, 2))
115 usage(cmd_inspect_inode_resolve_usage);
117 fd = btrfs_open_dir(argv[optind + 1], &dirstream, 1);
121 ret = __ino_to_path_fd(arg_strtou64(argv[optind]), fd, verbose,
123 close_file_or_dir(fd, dirstream);
128 static const char * const cmd_inspect_logical_resolve_usage[] = {
129 "btrfs inspect-internal logical-resolve [-Pv] [-s bufsize] <logical> <path>",
130 "Get file system paths for the given logical address",
131 "-P skip the path resolving and print the inodes instead",
133 "-s bufsize set inode container's size. This is used to increase inode",
134 " container's size in case it is not enough to read all the ",
135 " resolved results. The max value one can set is 64k",
139 static int cmd_inspect_logical_resolve(int argc, char **argv)
147 struct btrfs_ioctl_logical_ino_args loi;
148 struct btrfs_data_container *inodes;
150 char full_path[PATH_MAX];
152 DIR *dirstream = NULL;
155 int c = getopt(argc, argv, "Pvs:");
167 size = arg_strtou64(optarg);
170 usage(cmd_inspect_logical_resolve_usage);
174 if (check_argc_exact(argc - optind, 2))
175 usage(cmd_inspect_logical_resolve_usage);
177 size = min(size, (u64)SZ_64K);
178 inodes = malloc(size);
182 memset(inodes, 0, sizeof(*inodes));
183 loi.logical = arg_strtou64(argv[optind]);
185 loi.inodes = ptr_to_u64(inodes);
187 fd = btrfs_open_dir(argv[optind + 1], &dirstream, 1);
193 ret = ioctl(fd, BTRFS_IOC_LOGICAL_INO, &loi);
195 error("logical ino ioctl: %s", strerror(errno));
200 printf("ioctl ret=%d, total_size=%llu, bytes_left=%lu, "
201 "bytes_missing=%lu, cnt=%d, missed=%d\n",
203 (unsigned long)inodes->bytes_left,
204 (unsigned long)inodes->bytes_missing,
205 inodes->elem_cnt, inodes->elem_missed);
207 bytes_left = sizeof(full_path);
208 ret = snprintf(full_path, bytes_left, "%s/", argv[optind+1]);
209 path_ptr = full_path + ret;
210 bytes_left -= ret + 1;
211 if (bytes_left < 0) {
212 error("path buffer too small: %d bytes", bytes_left);
216 for (i = 0; i < inodes->elem_cnt; i += 3) {
217 u64 inum = inodes->val[i];
218 u64 offset = inodes->val[i+1];
219 u64 root = inodes->val[i+2];
225 name = btrfs_list_path_for_root(fd, root);
235 ret = snprintf(path_ptr, bytes_left, "%s",
238 if (ret >= bytes_left) {
239 error("path buffer too small: %d bytes",
243 path_fd = btrfs_open_dir(full_path, &dirs, 1);
249 __ino_to_path_fd(inum, path_fd, verbose, full_path);
251 close_file_or_dir(path_fd, dirs);
253 printf("inode %llu offset %llu root %llu\n", inum,
259 close_file_or_dir(fd, dirstream);
264 static const char * const cmd_inspect_subvolid_resolve_usage[] = {
265 "btrfs inspect-internal subvolid-resolve <subvolid> <path>",
266 "Get file system paths for the given subvolume ID.",
270 static int cmd_inspect_subvolid_resolve(int argc, char **argv)
276 DIR *dirstream = NULL;
278 clean_args_no_options(argc, argv, cmd_inspect_subvolid_resolve_usage);
280 if (check_argc_exact(argc - optind, 2))
281 usage(cmd_inspect_subvolid_resolve_usage);
283 fd = btrfs_open_dir(argv[optind + 1], &dirstream, 1);
289 subvol_id = arg_strtou64(argv[optind]);
290 ret = btrfs_subvolid_resolve(fd, path, sizeof(path), subvol_id);
293 error("resolving subvolid %llu error %d",
294 (unsigned long long)subvol_id, ret);
298 path[PATH_MAX - 1] = '\0';
299 printf("%s\n", path);
302 close_file_or_dir(fd, dirstream);
306 static const char* const cmd_inspect_rootid_usage[] = {
307 "btrfs inspect-internal rootid <path>",
308 "Get tree ID of the containing subvolume of path.",
312 static int cmd_inspect_rootid(int argc, char **argv)
317 DIR *dirstream = NULL;
319 clean_args_no_options(argc, argv, cmd_inspect_rootid_usage);
321 if (check_argc_exact(argc - optind, 1))
322 usage(cmd_inspect_rootid_usage);
324 fd = btrfs_open_dir(argv[optind], &dirstream, 1);
330 ret = lookup_path_rootid(fd, &rootid);
332 error("failed to lookup root id: %s", strerror(-ret));
336 printf("%llu\n", (unsigned long long)rootid);
338 close_file_or_dir(fd, dirstream);
343 static const char* const cmd_inspect_min_dev_size_usage[] = {
344 "btrfs inspect-internal min-dev-size [options] <path>",
345 "Get the minimum size the device can be shrunk to. The",
346 "device id 1 is used by default.",
347 "--id DEVID specify the device id to query",
351 struct dev_extent_elem {
355 struct list_head list;
358 static int add_dev_extent(struct list_head *list,
359 const u64 start, const u64 end,
362 struct dev_extent_elem *e;
364 e = malloc(sizeof(*e));
372 list_add_tail(&e->list, list);
374 list_add(&e->list, list);
379 static void free_dev_extent_list(struct list_head *list)
381 while (!list_empty(list)) {
382 struct dev_extent_elem *e;
384 e = list_first_entry(list, struct dev_extent_elem, list);
390 static int hole_includes_sb_mirror(const u64 start, const u64 end)
395 for (i = 0; i < BTRFS_SUPER_MIRROR_MAX; i++) {
396 u64 bytenr = btrfs_sb_offset(i);
398 if (bytenr >= start && bytenr <= end) {
407 static void adjust_dev_min_size(struct list_head *extents,
408 struct list_head *holes,
412 * If relocation of the block group of a device extent must happen (see
413 * below) scratch space is used for the relocation. So track here the
414 * size of the largest device extent that has to be relocated. We track
415 * only the largest and not the sum of the sizes of all relocated block
416 * groups because after each block group is relocated the running
417 * transaction is committed so that pinned space is released.
419 u64 scratch_space = 0;
422 * List of device extents is sorted by descending order of the extent's
423 * end offset. If some extent goes beyond the computed minimum size,
424 * which initially matches the sum of the lengths of all extents,
425 * we need to check if the extent can be relocated to an hole in the
426 * device between [0, *min_size[ (which is what the resize ioctl does).
428 while (!list_empty(extents)) {
429 struct dev_extent_elem *e;
430 struct dev_extent_elem *h;
435 e = list_first_entry(extents, struct dev_extent_elem, list);
436 if (e->end <= *min_size)
440 * Our extent goes beyond the computed *min_size. See if we can
441 * find a hole large enough to relocate it to. If not we must stop
442 * and set *min_size to the end of the extent.
444 extent_len = e->end - e->start + 1;
445 list_for_each_entry(h, holes, list) {
446 hole_len = h->end - h->start + 1;
447 if (hole_len >= extent_len) {
454 *min_size = e->end + 1;
459 * If the hole found contains the location for a superblock
460 * mirror, we are pessimistic and require allocating one
461 * more extent of the same size. This is because the block
462 * group could be in the worst case used by a single extent
463 * with a size >= (block_group.length - superblock.size).
465 if (hole_includes_sb_mirror(h->start,
466 h->start + extent_len - 1))
467 *min_size += extent_len;
469 if (hole_len > extent_len) {
470 h->start += extent_len;
479 if (extent_len > scratch_space)
480 scratch_space = extent_len;
484 *min_size += scratch_space;
486 * Chunk allocation requires inserting/updating items in the
487 * chunk tree, so often this can lead to the need of allocating
488 * a new system chunk too, which has a maximum size of 32Mb.
494 static int print_min_dev_size(int fd, u64 devid)
498 * Device allocations starts at 1Mb or at the value passed through the
499 * mount option alloc_start if it's bigger than 1Mb. The alloc_start
500 * option is used for debugging and testing only, and recently the
501 * possibility of deprecating/removing it has been discussed, so we
504 u64 min_size = SZ_1M;
505 struct btrfs_ioctl_search_args args;
506 struct btrfs_ioctl_search_key *sk = &args.key;
507 u64 last_pos = (u64)-1;
511 memset(&args, 0, sizeof(args));
512 sk->tree_id = BTRFS_DEV_TREE_OBJECTID;
513 sk->min_objectid = devid;
514 sk->max_objectid = devid;
515 sk->max_type = BTRFS_DEV_EXTENT_KEY;
516 sk->min_type = BTRFS_DEV_EXTENT_KEY;
518 sk->max_offset = (u64)-1;
520 sk->max_transid = (u64)-1;
525 struct btrfs_ioctl_search_header *sh;
526 unsigned long off = 0;
528 ret = ioctl(fd, BTRFS_IOC_TREE_SEARCH, &args);
530 error("tree search ioctl: %s", strerror(errno));
535 if (sk->nr_items == 0)
538 for (i = 0; i < sk->nr_items; i++) {
539 struct btrfs_dev_extent *extent;
542 sh = (struct btrfs_ioctl_search_header *)(args.buf +
545 extent = (struct btrfs_dev_extent *)(args.buf + off);
546 off += btrfs_search_header_len(sh);
548 sk->min_objectid = btrfs_search_header_objectid(sh);
549 sk->min_type = btrfs_search_header_type(sh);
550 sk->min_offset = btrfs_search_header_offset(sh) + 1;
552 if (btrfs_search_header_objectid(sh) != devid ||
553 btrfs_search_header_type(sh) != BTRFS_DEV_EXTENT_KEY)
556 len = btrfs_stack_dev_extent_length(extent);
558 ret = add_dev_extent(&extents,
559 btrfs_search_header_offset(sh),
560 btrfs_search_header_offset(sh) + len - 1, 0);
562 if (!ret && last_pos != (u64)-1 &&
563 last_pos != btrfs_search_header_offset(sh))
564 ret = add_dev_extent(&holes, last_pos,
565 btrfs_search_header_offset(sh) - 1, 1);
567 error("add device extent: %s", strerror(-ret));
572 last_pos = btrfs_search_header_offset(sh) + len;
575 if (sk->min_type != BTRFS_DEV_EXTENT_KEY ||
576 sk->min_objectid != devid)
580 adjust_dev_min_size(&extents, &holes, &min_size);
581 printf("%llu bytes (%s)\n", min_size, pretty_size(min_size));
584 free_dev_extent_list(&extents);
585 free_dev_extent_list(&holes);
590 static int cmd_inspect_min_dev_size(int argc, char **argv)
594 DIR *dirstream = NULL;
599 enum { GETOPT_VAL_DEVID = 256 };
600 static const struct option long_options[] = {
601 { "id", required_argument, NULL, GETOPT_VAL_DEVID },
605 c = getopt_long(argc, argv, "", long_options, NULL);
610 case GETOPT_VAL_DEVID:
611 devid = arg_strtou64(optarg);
614 usage(cmd_inspect_min_dev_size_usage);
617 if (check_argc_exact(argc - optind, 1))
618 usage(cmd_inspect_min_dev_size_usage);
620 fd = btrfs_open_dir(argv[optind], &dirstream, 1);
626 ret = print_min_dev_size(fd, devid);
627 close_file_or_dir(fd, dirstream);
632 static const char inspect_cmd_group_info[] =
633 "query various internal information";
635 const struct cmd_group inspect_cmd_group = {
636 inspect_cmd_group_usage, inspect_cmd_group_info, {
637 { "inode-resolve", cmd_inspect_inode_resolve,
638 cmd_inspect_inode_resolve_usage, NULL, 0 },
639 { "logical-resolve", cmd_inspect_logical_resolve,
640 cmd_inspect_logical_resolve_usage, NULL, 0 },
641 { "subvolid-resolve", cmd_inspect_subvolid_resolve,
642 cmd_inspect_subvolid_resolve_usage, NULL, 0 },
643 { "rootid", cmd_inspect_rootid, cmd_inspect_rootid_usage, NULL,
645 { "min-dev-size", cmd_inspect_min_dev_size,
646 cmd_inspect_min_dev_size_usage, NULL, 0 },
647 { "dump-tree", cmd_inspect_dump_tree,
648 cmd_inspect_dump_tree_usage, NULL, 0 },
649 { "dump-super", cmd_inspect_dump_super,
650 cmd_inspect_dump_super_usage, NULL, 0 },
651 { "tree-stats", cmd_inspect_tree_stats,
652 cmd_inspect_tree_stats_usage, NULL, 0 },
657 int cmd_inspect(int argc, char **argv)
659 return handle_command_group(&inspect_cmd_group, argc, argv);