2 * Copyright (C) 2007 Oracle. 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.
22 #include <uuid/uuid.h>
23 #include "kerncompat.h"
24 #include "radix-tree.h"
27 #include "print-tree.h"
28 #include "transaction.h"
31 static int print_usage(void)
33 fprintf(stderr, "usage: btrfs-debug-tree [-e] [-d] [-r] [-R] [-u]\n");
34 fprintf(stderr, " [-b block_num ] device\n");
35 fprintf(stderr, "\t-e : print detailed extents info\n");
36 fprintf(stderr, "\t-d : print info of btrfs device and root tree dirs"
38 fprintf(stderr, "\t-r : print info of roots only\n");
39 fprintf(stderr, "\t-R : print info of roots and root backups\n");
40 fprintf(stderr, "\t-u : print info of uuid tree only\n");
41 fprintf(stderr, "\t-b block_num : print info of the specified block"
44 "\t-t tree_id : print only the tree with the given id\n");
45 fprintf(stderr, "%s\n", PACKAGE_STRING);
49 static void print_extents(struct btrfs_root *root, struct extent_buffer *eb)
58 if (btrfs_is_leaf(eb)) {
59 btrfs_print_leaf(root, eb);
63 size = btrfs_level_size(root, btrfs_header_level(eb) - 1);
64 nr = btrfs_header_nritems(eb);
65 for (i = 0; i < nr; i++) {
66 struct extent_buffer *next = read_tree_block(root,
67 btrfs_node_blockptr(eb, i),
69 btrfs_node_ptr_generation(eb, i));
70 if (!extent_buffer_uptodate(next))
72 if (btrfs_is_leaf(next) &&
73 btrfs_header_level(eb) != 1)
75 if (btrfs_header_level(next) !=
76 btrfs_header_level(eb) - 1)
78 print_extents(root, next);
79 free_extent_buffer(next);
83 static void print_old_roots(struct btrfs_super_block *super)
85 struct btrfs_root_backup *backup;
88 for (i = 0; i < BTRFS_NUM_BACKUP_ROOTS; i++) {
89 backup = super->super_roots + i;
90 printf("btrfs root backup slot %d\n", i);
91 printf("\ttree root gen %llu block %llu\n",
92 (unsigned long long)btrfs_backup_tree_root_gen(backup),
93 (unsigned long long)btrfs_backup_tree_root(backup));
95 printf("\t\textent root gen %llu block %llu\n",
96 (unsigned long long)btrfs_backup_extent_root_gen(backup),
97 (unsigned long long)btrfs_backup_extent_root(backup));
99 printf("\t\tchunk root gen %llu block %llu\n",
100 (unsigned long long)btrfs_backup_chunk_root_gen(backup),
101 (unsigned long long)btrfs_backup_chunk_root(backup));
103 printf("\t\tdevice root gen %llu block %llu\n",
104 (unsigned long long)btrfs_backup_dev_root_gen(backup),
105 (unsigned long long)btrfs_backup_dev_root(backup));
107 printf("\t\tcsum root gen %llu block %llu\n",
108 (unsigned long long)btrfs_backup_csum_root_gen(backup),
109 (unsigned long long)btrfs_backup_csum_root(backup));
111 printf("\t\tfs root gen %llu block %llu\n",
112 (unsigned long long)btrfs_backup_fs_root_gen(backup),
113 (unsigned long long)btrfs_backup_fs_root(backup));
115 printf("\t\t%llu used %llu total %llu devices\n",
116 (unsigned long long)btrfs_backup_bytes_used(backup),
117 (unsigned long long)btrfs_backup_total_bytes(backup),
118 (unsigned long long)btrfs_backup_num_devices(backup));
122 int main(int ac, char **av)
124 struct btrfs_root *root;
125 struct btrfs_fs_info *info;
126 struct btrfs_path path;
127 struct btrfs_key key;
128 struct btrfs_root_item ri;
129 struct extent_buffer *leaf;
130 struct btrfs_disk_key disk_key;
131 struct btrfs_key found_key;
132 char uuidbuf[BTRFS_UUID_UNPARSED_SIZE];
137 int uuid_tree_only = 0;
139 int root_backups = 0;
141 struct btrfs_root *tree_root_scan;
148 c = getopt(ac, av, "deb:rRut:");
169 block_only = arg_strtou64(optarg);
172 tree_id = arg_strtou64(optarg);
180 if (check_argc_exact(ac, 1))
183 ret = check_arg_type(av[optind]);
184 if (ret != BTRFS_ARG_BLKDEV && ret != BTRFS_ARG_REG) {
185 fprintf(stderr, "'%s' is not a block device or regular file\n",
190 info = open_ctree_fs_info(av[optind], 0, 0, OPEN_CTREE_PARTIAL);
192 fprintf(stderr, "unable to open %s\n", av[optind]);
196 root = info->fs_root;
198 fprintf(stderr, "unable to open %s\n", av[optind]);
203 leaf = read_tree_block(root,
207 if (extent_buffer_uptodate(leaf) &&
208 btrfs_header_level(leaf) != 0) {
209 free_extent_buffer(leaf);
214 leaf = read_tree_block(root,
218 if (!extent_buffer_uptodate(leaf)) {
219 fprintf(stderr, "failed to read %llu\n",
220 (unsigned long long)block_only);
223 btrfs_print_tree(root, leaf, 0);
224 free_extent_buffer(leaf);
228 if (!(extent_only || uuid_tree_only || tree_id)) {
230 printf("root tree: %llu level %d\n",
231 (unsigned long long)info->tree_root->node->start,
232 btrfs_header_level(info->tree_root->node));
233 printf("chunk tree: %llu level %d\n",
234 (unsigned long long)info->chunk_root->node->start,
235 btrfs_header_level(info->chunk_root->node));
237 if (info->tree_root->node) {
238 printf("root tree\n");
239 btrfs_print_tree(info->tree_root,
240 info->tree_root->node, 1);
243 if (info->chunk_root->node) {
244 printf("chunk tree\n");
245 btrfs_print_tree(info->chunk_root,
246 info->chunk_root->node, 1);
250 tree_root_scan = info->tree_root;
252 btrfs_init_path(&path);
254 if (!extent_buffer_uptodate(tree_root_scan->node))
259 btrfs_set_key_type(&key, BTRFS_ROOT_ITEM_KEY);
260 ret = btrfs_search_slot(NULL, tree_root_scan, &key, &path, 0, 0);
263 leaf = path.nodes[0];
264 slot = path.slots[0];
265 if (slot >= btrfs_header_nritems(leaf)) {
266 ret = btrfs_next_leaf(tree_root_scan, &path);
269 leaf = path.nodes[0];
270 slot = path.slots[0];
272 btrfs_item_key(leaf, &disk_key, path.slots[0]);
273 btrfs_disk_key_to_cpu(&found_key, &disk_key);
274 if (btrfs_key_type(&found_key) == BTRFS_ROOT_ITEM_KEY) {
275 unsigned long offset;
276 struct extent_buffer *buf;
277 int skip = extent_only | device_only | uuid_tree_only;
279 offset = btrfs_item_ptr_offset(leaf, slot);
280 read_extent_buffer(leaf, &ri, offset, sizeof(ri));
281 buf = read_tree_block(tree_root_scan,
282 btrfs_root_bytenr(&ri),
283 btrfs_level_size(tree_root_scan,
284 btrfs_root_level(&ri)),
286 if (!extent_buffer_uptodate(buf))
288 if (tree_id && found_key.objectid != tree_id) {
289 free_extent_buffer(buf);
293 switch(found_key.objectid) {
294 case BTRFS_ROOT_TREE_OBJECTID:
298 case BTRFS_EXTENT_TREE_OBJECTID:
299 if (!device_only && !uuid_tree_only)
304 case BTRFS_CHUNK_TREE_OBJECTID:
309 case BTRFS_DEV_TREE_OBJECTID:
315 case BTRFS_FS_TREE_OBJECTID:
320 case BTRFS_ROOT_TREE_DIR_OBJECTID:
324 case BTRFS_CSUM_TREE_OBJECTID:
329 case BTRFS_ORPHAN_OBJECTID:
334 case BTRFS_TREE_LOG_OBJECTID:
339 case BTRFS_TREE_LOG_FIXUP_OBJECTID:
344 case BTRFS_TREE_RELOC_OBJECTID:
349 case BTRFS_DATA_RELOC_TREE_OBJECTID:
351 printf("data reloc");
354 case BTRFS_EXTENT_CSUM_OBJECTID:
356 printf("extent checksum");
359 case BTRFS_QUOTA_TREE_OBJECTID:
364 case BTRFS_UUID_TREE_OBJECTID:
365 if (!extent_only && !device_only)
370 case BTRFS_MULTIPLE_OBJECTIDS:
380 if (extent_only && !skip) {
381 print_extents(tree_root_scan, buf);
384 btrfs_print_key(&disk_key);
386 printf(" %llu level %d\n",
387 (unsigned long long)buf->start,
388 btrfs_header_level(buf));
391 btrfs_print_tree(tree_root_scan, buf, 1);
394 free_extent_buffer(buf);
400 btrfs_release_path(&path);
402 if (tree_root_scan == info->tree_root &&
403 info->log_root_tree) {
404 tree_root_scan = info->log_root_tree;
408 if (extent_only || device_only || uuid_tree_only)
412 print_old_roots(info->super_copy);
414 printf("total bytes %llu\n",
415 (unsigned long long)btrfs_super_total_bytes(info->super_copy));
416 printf("bytes used %llu\n",
417 (unsigned long long)btrfs_super_bytes_used(info->super_copy));
418 uuidbuf[BTRFS_UUID_UNPARSED_SIZE - 1] = '\0';
419 uuid_unparse(info->super_copy->fsid, uuidbuf);
420 printf("uuid %s\n", uuidbuf);
421 printf("%s\n", PACKAGE_STRING);
423 return close_ctree(root);