Commit | Line | Data |
---|---|---|
5de08d7d CM |
1 | #include <stdio.h> |
2 | #include <stdlib.h> | |
3 | #include "kerncompat.h" | |
4 | #include "radix-tree.h" | |
5 | #include "ctree.h" | |
6 | #include "disk-io.h" | |
7 | ||
8 | void print_leaf(struct leaf *l) | |
9 | { | |
10 | int i; | |
7518a238 | 11 | u32 nr = btrfs_header_nritems(&l->header); |
5de08d7d CM |
12 | struct item *item; |
13 | struct extent_item *ei; | |
7518a238 CM |
14 | printf("leaf %Lu total ptrs %d free space %d\n", |
15 | btrfs_header_blocknr(&l->header), nr, leaf_free_space(l)); | |
5de08d7d CM |
16 | fflush(stdout); |
17 | for (i = 0 ; i < nr ; i++) { | |
18 | item = l->items + i; | |
7cf75962 | 19 | printf("\titem %d key (%Lu %u %Lu) itemoff %d itemsize %d\n", |
5de08d7d CM |
20 | i, |
21 | item->key.objectid, item->key.flags, item->key.offset, | |
22 | item->offset, item->size); | |
23 | fflush(stdout); | |
a28ec197 CM |
24 | printf("\t\titem data %.*s\n", item->size, |
25 | l->data+item->offset); | |
5de08d7d | 26 | ei = (struct extent_item *)(l->data + item->offset); |
a28ec197 CM |
27 | printf("\t\textent data refs %u owner %Lu\n", ei->refs, |
28 | ei->owner); | |
5de08d7d CM |
29 | fflush(stdout); |
30 | } | |
31 | } | |
32 | void print_tree(struct ctree_root *root, struct tree_buffer *t) | |
33 | { | |
34 | int i; | |
7518a238 | 35 | u32 nr; |
5de08d7d CM |
36 | struct node *c; |
37 | ||
38 | if (!t) | |
39 | return; | |
40 | c = &t->node; | |
7518a238 CM |
41 | nr = btrfs_header_nritems(&c->header); |
42 | if (btrfs_is_leaf(c)) { | |
5de08d7d CM |
43 | print_leaf((struct leaf *)c); |
44 | return; | |
45 | } | |
41903fe6 | 46 | printf("node %Lu level %d total ptrs %d free spc %u\n", t->blocknr, |
7518a238 CM |
47 | btrfs_header_level(&c->header), nr, |
48 | (u32)NODEPTRS_PER_BLOCK - nr); | |
5de08d7d CM |
49 | fflush(stdout); |
50 | for (i = 0; i < nr; i++) { | |
7cf75962 | 51 | printf("\tkey %d (%Lu %u %Lu) block %Lu\n", |
5de08d7d CM |
52 | i, |
53 | c->keys[i].objectid, c->keys[i].flags, c->keys[i].offset, | |
54 | c->blockptrs[i]); | |
55 | fflush(stdout); | |
56 | } | |
57 | for (i = 0; i < nr; i++) { | |
58 | struct tree_buffer *next_buf = read_tree_block(root, | |
59 | c->blockptrs[i]); | |
60 | struct node *next = &next_buf->node; | |
7518a238 CM |
61 | if (btrfs_is_leaf(next) && |
62 | btrfs_header_level(&c->header) != 1) | |
5de08d7d | 63 | BUG(); |
7518a238 CM |
64 | if (btrfs_header_level(&next->header) != |
65 | btrfs_header_level(&c->header) - 1) | |
5de08d7d CM |
66 | BUG(); |
67 | print_tree(root, next_buf); | |
68 | tree_block_release(root, next_buf); | |
69 | } | |
70 | ||
71 | } | |
72 |