Btrfs-progs: switch to arg_strtou64() part1
[btrfs-progs-unstable/devel.git] / btrfs-debug-tree.c
blobf37de9d29471460bc728a6f532ab2989b01fc5f8
1 /*
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.
19 #include <stdio.h>
20 #include <stdlib.h>
21 #include <unistd.h>
22 #include <uuid/uuid.h>
23 #include "kerncompat.h"
24 #include "radix-tree.h"
25 #include "ctree.h"
26 #include "disk-io.h"
27 #include "print-tree.h"
28 #include "transaction.h"
29 #include "version.h"
30 #include "utils.h"
32 static int print_usage(void)
34 fprintf(stderr, "usage: btrfs-debug-tree [-e] [-d] [-r] [-R] [-u]\n");
35 fprintf(stderr, " [-b block_num ] device\n");
36 fprintf(stderr, "\t-e : print detailed extents info\n");
37 fprintf(stderr, "\t-d : print info of btrfs device and root tree dirs"
38 " only\n");
39 fprintf(stderr, "\t-r : print info of roots only\n");
40 fprintf(stderr, "\t-R : print info of roots and root backups\n");
41 fprintf(stderr, "\t-u : print info of uuid tree only\n");
42 fprintf(stderr, "\t-b block_num : print info of the specified block"
43 " only\n");
44 fprintf(stderr, "%s\n", BTRFS_BUILD_VERSION);
45 exit(1);
48 static void print_extents(struct btrfs_root *root, struct extent_buffer *eb)
50 int i;
51 u32 nr;
52 u32 size;
54 if (!eb)
55 return;
57 if (btrfs_is_leaf(eb)) {
58 btrfs_print_leaf(root, eb);
59 return;
62 size = btrfs_level_size(root, btrfs_header_level(eb) - 1);
63 nr = btrfs_header_nritems(eb);
64 for (i = 0; i < nr; i++) {
65 struct extent_buffer *next = read_tree_block(root,
66 btrfs_node_blockptr(eb, i),
67 size,
68 btrfs_node_ptr_generation(eb, i));
69 if (btrfs_is_leaf(next) &&
70 btrfs_header_level(eb) != 1)
71 BUG();
72 if (btrfs_header_level(next) !=
73 btrfs_header_level(eb) - 1)
74 BUG();
75 print_extents(root, next);
76 free_extent_buffer(next);
80 static void print_old_roots(struct btrfs_super_block *super)
82 struct btrfs_root_backup *backup;
83 int i;
85 for (i = 0; i < BTRFS_NUM_BACKUP_ROOTS; i++) {
86 backup = super->super_roots + i;
87 printf("btrfs root backup slot %d\n", i);
88 printf("\ttree root gen %llu block %llu\n",
89 (unsigned long long)btrfs_backup_tree_root_gen(backup),
90 (unsigned long long)btrfs_backup_tree_root(backup));
92 printf("\t\textent root gen %llu block %llu\n",
93 (unsigned long long)btrfs_backup_extent_root_gen(backup),
94 (unsigned long long)btrfs_backup_extent_root(backup));
96 printf("\t\tchunk root gen %llu block %llu\n",
97 (unsigned long long)btrfs_backup_chunk_root_gen(backup),
98 (unsigned long long)btrfs_backup_chunk_root(backup));
100 printf("\t\tdevice root gen %llu block %llu\n",
101 (unsigned long long)btrfs_backup_dev_root_gen(backup),
102 (unsigned long long)btrfs_backup_dev_root(backup));
104 printf("\t\tcsum root gen %llu block %llu\n",
105 (unsigned long long)btrfs_backup_csum_root_gen(backup),
106 (unsigned long long)btrfs_backup_csum_root(backup));
108 printf("\t\tfs root gen %llu block %llu\n",
109 (unsigned long long)btrfs_backup_fs_root_gen(backup),
110 (unsigned long long)btrfs_backup_fs_root(backup));
112 printf("\t\t%llu used %llu total %llu devices\n",
113 (unsigned long long)btrfs_backup_bytes_used(backup),
114 (unsigned long long)btrfs_backup_total_bytes(backup),
115 (unsigned long long)btrfs_backup_num_devices(backup));
119 int main(int ac, char **av)
121 struct btrfs_root *root;
122 struct btrfs_fs_info *info;
123 struct btrfs_path path;
124 struct btrfs_key key;
125 struct btrfs_root_item ri;
126 struct extent_buffer *leaf;
127 struct btrfs_disk_key disk_key;
128 struct btrfs_key found_key;
129 char uuidbuf[BTRFS_UUID_UNPARSED_SIZE];
130 int ret;
131 int slot;
132 int extent_only = 0;
133 int device_only = 0;
134 int uuid_tree_only = 0;
135 int roots_only = 0;
136 int root_backups = 0;
137 u64 block_only = 0;
138 struct btrfs_root *tree_root_scan;
140 radix_tree_init();
142 while(1) {
143 int c;
144 c = getopt(ac, av, "deb:rRu");
145 if (c < 0)
146 break;
147 switch(c) {
148 case 'e':
149 extent_only = 1;
150 break;
151 case 'd':
152 device_only = 1;
153 break;
154 case 'r':
155 roots_only = 1;
156 break;
157 case 'u':
158 uuid_tree_only = 1;
159 break;
160 case 'R':
161 roots_only = 1;
162 root_backups = 1;
163 break;
164 case 'b':
165 block_only = atoll(optarg);
166 break;
167 default:
168 print_usage();
171 ac = ac - optind;
172 if (ac != 1)
173 print_usage();
175 info = open_ctree_fs_info(av[optind], 0, 0, OPEN_CTREE_PARTIAL);
176 if (!info) {
177 fprintf(stderr, "unable to open %s\n", av[optind]);
178 exit(1);
180 root = info->fs_root;
182 if (block_only) {
183 if (!root) {
184 fprintf(stderr, "unable to open %s\n", av[optind]);
185 exit(1);
187 leaf = read_tree_block(root,
188 block_only,
189 root->leafsize, 0);
191 if (leaf && btrfs_header_level(leaf) != 0) {
192 free_extent_buffer(leaf);
193 leaf = NULL;
196 if (!leaf) {
197 leaf = read_tree_block(root,
198 block_only,
199 root->nodesize, 0);
201 if (!leaf) {
202 fprintf(stderr, "failed to read %llu\n",
203 (unsigned long long)block_only);
204 goto close_root;
206 btrfs_print_tree(root, leaf, 0);
207 goto close_root;
210 if (!(extent_only || uuid_tree_only)) {
211 if (roots_only) {
212 printf("root tree: %llu level %d\n",
213 (unsigned long long)info->tree_root->node->start,
214 btrfs_header_level(info->tree_root->node));
215 printf("chunk tree: %llu level %d\n",
216 (unsigned long long)info->chunk_root->node->start,
217 btrfs_header_level(info->chunk_root->node));
218 } else {
219 if (info->tree_root->node) {
220 printf("root tree\n");
221 btrfs_print_tree(info->tree_root,
222 info->tree_root->node, 1);
225 if (info->chunk_root->node) {
226 printf("chunk tree\n");
227 btrfs_print_tree(info->chunk_root,
228 info->chunk_root->node, 1);
232 tree_root_scan = info->tree_root;
234 btrfs_init_path(&path);
235 again:
236 if (!extent_buffer_uptodate(tree_root_scan->node))
237 goto no_node;
239 key.offset = 0;
240 key.objectid = 0;
241 btrfs_set_key_type(&key, BTRFS_ROOT_ITEM_KEY);
242 ret = btrfs_search_slot(NULL, tree_root_scan, &key, &path, 0, 0);
243 BUG_ON(ret < 0);
244 while(1) {
245 leaf = path.nodes[0];
246 slot = path.slots[0];
247 if (slot >= btrfs_header_nritems(leaf)) {
248 ret = btrfs_next_leaf(tree_root_scan, &path);
249 if (ret != 0)
250 break;
251 leaf = path.nodes[0];
252 slot = path.slots[0];
254 btrfs_item_key(leaf, &disk_key, path.slots[0]);
255 btrfs_disk_key_to_cpu(&found_key, &disk_key);
256 if (btrfs_key_type(&found_key) == BTRFS_ROOT_ITEM_KEY) {
257 unsigned long offset;
258 struct extent_buffer *buf;
259 int skip = extent_only | device_only | uuid_tree_only;
261 offset = btrfs_item_ptr_offset(leaf, slot);
262 read_extent_buffer(leaf, &ri, offset, sizeof(ri));
263 buf = read_tree_block(tree_root_scan,
264 btrfs_root_bytenr(&ri),
265 btrfs_level_size(tree_root_scan,
266 btrfs_root_level(&ri)),
268 if (!extent_buffer_uptodate(buf))
269 goto next;
271 switch(found_key.objectid) {
272 case BTRFS_ROOT_TREE_OBJECTID:
273 if (!skip)
274 printf("root");
275 break;
276 case BTRFS_EXTENT_TREE_OBJECTID:
277 if (!device_only && !uuid_tree_only)
278 skip = 0;
279 if (!skip)
280 printf("extent");
281 break;
282 case BTRFS_CHUNK_TREE_OBJECTID:
283 if (!skip) {
284 printf("chunk");
286 break;
287 case BTRFS_DEV_TREE_OBJECTID:
288 if (!uuid_tree_only)
289 skip = 0;
290 if (!skip)
291 printf("device");
292 break;
293 case BTRFS_FS_TREE_OBJECTID:
294 if (!skip) {
295 printf("fs");
297 break;
298 case BTRFS_ROOT_TREE_DIR_OBJECTID:
299 skip = 0;
300 printf("directory");
301 break;
302 case BTRFS_CSUM_TREE_OBJECTID:
303 if (!skip) {
304 printf("checksum");
306 break;
307 case BTRFS_ORPHAN_OBJECTID:
308 if (!skip) {
309 printf("orphan");
311 break;
312 case BTRFS_TREE_LOG_OBJECTID:
313 if (!skip) {
314 printf("log");
316 break;
317 case BTRFS_TREE_LOG_FIXUP_OBJECTID:
318 if (!skip) {
319 printf("log fixup");
321 break;
322 case BTRFS_TREE_RELOC_OBJECTID:
323 if (!skip) {
324 printf("reloc");
326 break;
327 case BTRFS_DATA_RELOC_TREE_OBJECTID:
328 if (!skip) {
329 printf("data reloc");
331 break;
332 case BTRFS_EXTENT_CSUM_OBJECTID:
333 if (!skip) {
334 printf("extent checksum");
336 break;
337 case BTRFS_QUOTA_TREE_OBJECTID:
338 if (!skip) {
339 printf("quota");
341 break;
342 case BTRFS_UUID_TREE_OBJECTID:
343 if (!extent_only && !device_only)
344 skip = 0;
345 if (!skip)
346 printf("uuid");
347 break;
348 case BTRFS_MULTIPLE_OBJECTIDS:
349 if (!skip) {
350 printf("multiple");
352 break;
353 default:
354 if (!skip) {
355 printf("file");
358 if (extent_only && !skip) {
359 print_extents(tree_root_scan, buf);
360 } else if (!skip) {
361 printf(" tree ");
362 btrfs_print_key(&disk_key);
363 if (roots_only) {
364 printf(" %llu level %d\n",
365 (unsigned long long)buf->start,
366 btrfs_header_level(buf));
367 } else {
368 printf(" \n");
369 btrfs_print_tree(tree_root_scan, buf, 1);
372 free_extent_buffer(buf);
374 next:
375 path.slots[0]++;
377 no_node:
378 btrfs_release_path(&path);
380 if (tree_root_scan == info->tree_root &&
381 info->log_root_tree) {
382 tree_root_scan = info->log_root_tree;
383 goto again;
386 if (extent_only || device_only || uuid_tree_only)
387 goto close_root;
389 if (root_backups)
390 print_old_roots(info->super_copy);
392 printf("total bytes %llu\n",
393 (unsigned long long)btrfs_super_total_bytes(info->super_copy));
394 printf("bytes used %llu\n",
395 (unsigned long long)btrfs_super_bytes_used(info->super_copy));
396 uuidbuf[BTRFS_UUID_UNPARSED_SIZE - 1] = '\0';
397 uuid_unparse(info->super_copy->fsid, uuidbuf);
398 printf("uuid %s\n", uuidbuf);
399 printf("%s\n", BTRFS_BUILD_VERSION);
400 close_root:
401 return close_ctree(root);