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: debug-tree [ -e ] device\n");
34 fprintf(stderr, "%s\n", BTRFS_BUILD_VERSION);
38 static void print_extent_leaf(struct btrfs_root *root, struct extent_buffer *l)
41 struct btrfs_item *item;
42 // struct btrfs_extent_ref *ref;
45 static u64 last_len = 0;
46 u32 nr = btrfs_header_nritems(l);
49 for (i = 0 ; i < nr ; i++) {
50 item = btrfs_item_nr(l, i);
51 btrfs_item_key_to_cpu(l, &key, i);
52 type = btrfs_key_type(&key);
54 case BTRFS_EXTENT_ITEM_KEY:
55 last_len = key.offset;
59 case BTRFS_EXTENT_REF_KEY:
60 ref = btrfs_item_ptr(l, i, struct btrfs_extent_ref);
61 printf("%llu %llu extent back ref root %llu gen %llu "
62 "owner %llu num_refs %lu\n",
63 (unsigned long long)last,
64 (unsigned long long)last_len,
65 (unsigned long long)btrfs_ref_root(l, ref),
66 (unsigned long long)btrfs_ref_generation(l, ref),
67 (unsigned long long)btrfs_ref_objectid(l, ref),
68 (unsigned long)btrfs_ref_num_refs(l, ref));
76 static void print_extents(struct btrfs_root *root, struct extent_buffer *eb)
84 if (btrfs_is_leaf(eb)) {
85 print_extent_leaf(root, eb);
88 size = btrfs_level_size(root, btrfs_header_level(eb) - 1);
89 nr = btrfs_header_nritems(eb);
90 for (i = 0; i < nr; i++) {
91 struct extent_buffer *next = read_tree_block(root,
92 btrfs_node_blockptr(eb, i),
94 btrfs_node_ptr_generation(eb, i));
95 if (btrfs_is_leaf(next) &&
96 btrfs_header_level(eb) != 1)
98 if (btrfs_header_level(next) !=
99 btrfs_header_level(eb) - 1)
101 print_extents(root, next);
102 free_extent_buffer(next);
106 int main(int ac, char **av)
108 struct btrfs_root *root;
109 struct btrfs_path path;
110 struct btrfs_key key;
111 struct btrfs_root_item ri;
112 struct extent_buffer *leaf;
113 struct btrfs_disk_key disk_key;
114 struct btrfs_key found_key;
121 struct btrfs_root *tree_root_scan;
127 c = getopt(ac, av, "deb:");
138 block_only = atoll(optarg);
148 root = open_ctree(av[optind], 0, 0);
150 fprintf(stderr, "unable to open %s\n", av[optind]);
154 leaf = read_tree_block(root,
158 if (leaf && btrfs_header_level(leaf) != 0) {
159 free_extent_buffer(leaf);
164 leaf = read_tree_block(root,
169 fprintf(stderr, "failed to read %llu\n", block_only);
172 btrfs_print_tree(root, leaf, 0);
177 printf("root tree\n");
178 btrfs_print_tree(root->fs_info->tree_root,
179 root->fs_info->tree_root->node, 1);
181 printf("chunk tree\n");
182 btrfs_print_tree(root->fs_info->chunk_root,
183 root->fs_info->chunk_root->node, 1);
185 tree_root_scan = root->fs_info->tree_root;
187 btrfs_init_path(&path);
191 btrfs_set_key_type(&key, BTRFS_ROOT_ITEM_KEY);
192 ret = btrfs_search_slot(NULL, tree_root_scan, &key, &path, 0, 0);
195 leaf = path.nodes[0];
196 slot = path.slots[0];
197 if (slot >= btrfs_header_nritems(leaf)) {
198 ret = btrfs_next_leaf(tree_root_scan, &path);
201 leaf = path.nodes[0];
202 slot = path.slots[0];
204 btrfs_item_key(leaf, &disk_key, path.slots[0]);
205 btrfs_disk_key_to_cpu(&found_key, &disk_key);
206 if (btrfs_key_type(&found_key) == BTRFS_ROOT_ITEM_KEY) {
207 unsigned long offset;
208 struct extent_buffer *buf;
209 int skip = extent_only | device_only;
211 offset = btrfs_item_ptr_offset(leaf, slot);
212 read_extent_buffer(leaf, &ri, offset, sizeof(ri));
213 buf = read_tree_block(tree_root_scan,
214 btrfs_root_bytenr(&ri),
215 btrfs_level_size(tree_root_scan,
216 btrfs_root_level(&ri)),
218 switch(found_key.objectid) {
219 case BTRFS_ROOT_TREE_OBJECTID:
223 case BTRFS_EXTENT_TREE_OBJECTID:
226 if (!extent_only && !device_only)
229 case BTRFS_CHUNK_TREE_OBJECTID:
234 case BTRFS_DEV_TREE_OBJECTID:
238 case BTRFS_FS_TREE_OBJECTID:
243 case BTRFS_ROOT_TREE_DIR_OBJECTID:
247 case BTRFS_CSUM_TREE_OBJECTID:
252 case BTRFS_ORPHAN_OBJECTID:
257 case BTRFS_TREE_LOG_OBJECTID:
262 case BTRFS_TREE_LOG_FIXUP_OBJECTID:
267 case BTRFS_TREE_RELOC_OBJECTID:
272 case BTRFS_DATA_RELOC_TREE_OBJECTID:
274 printf("data reloc");
277 case BTRFS_EXTENT_CSUM_OBJECTID:
279 printf("extent checksum");
281 case BTRFS_MULTIPLE_OBJECTIDS:
291 if (extent_only && !skip) {
292 print_extents(tree_root_scan, buf);
295 btrfs_print_key(&disk_key);
297 btrfs_print_tree(tree_root_scan, buf, 1);
302 btrfs_release_path(root, &path);
304 if (tree_root_scan == root->fs_info->tree_root &&
305 root->fs_info->log_root_tree) {
306 tree_root_scan = root->fs_info->log_root_tree;
310 if (extent_only || device_only)
313 printf("total bytes %llu\n",
314 (unsigned long long)btrfs_super_total_bytes(&root->fs_info->super_copy));
315 printf("bytes used %llu\n",
316 (unsigned long long)btrfs_super_bytes_used(&root->fs_info->super_copy));
318 uuid_unparse(root->fs_info->super_copy.fsid, uuidbuf);
319 printf("uuid %s\n", uuidbuf);
320 printf("%s\n", BTRFS_BUILD_VERSION);