3 #include "kerncompat.h"
4 #include "radix-tree.h"
8 void btrfs_print_leaf(struct btrfs_leaf *l)
11 u32 nr = btrfs_header_nritems(&l->header);
12 struct btrfs_item *item;
13 struct btrfs_extent_item *ei;
14 struct btrfs_root_item *ri;
15 printf("leaf %Lu total ptrs %d free space %d\n",
16 btrfs_header_blocknr(&l->header), nr, btrfs_leaf_free_space(l));
18 for (i = 0 ; i < nr ; i++) {
20 printf("\titem %d key (%Lu %u %Lu) itemoff %d itemsize %d\n",
22 btrfs_key_objectid(&item->key),
23 btrfs_key_flags(&item->key),
24 btrfs_key_offset(&item->key),
25 btrfs_item_offset(item),
26 btrfs_item_size(item));
27 printf("\t\titem data %.*s\n", btrfs_item_size(item),
28 l->data + btrfs_item_offset(item));
29 ei = btrfs_item_ptr(l, i, struct btrfs_extent_item);
30 printf("\t\textent data refs %u owner %Lu\n",
31 btrfs_extent_refs(ei), btrfs_extent_owner(ei));
32 ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
33 printf("\t\troot data blocknr %Lu refs %u\n",
34 btrfs_root_blocknr(ri), btrfs_root_refs(ri));
38 void btrfs_print_tree(struct btrfs_root *root, struct btrfs_buffer *t)
47 nr = btrfs_header_nritems(&c->header);
48 if (btrfs_is_leaf(c)) {
49 btrfs_print_leaf((struct btrfs_leaf *)c);
52 printf("node %Lu level %d total ptrs %d free spc %u\n", t->blocknr,
53 btrfs_header_level(&c->header), nr,
54 (u32)NODEPTRS_PER_BLOCK - nr);
56 for (i = 0; i < nr; i++) {
57 printf("\tkey %d (%Lu %u %Lu) block %Lu\n",
59 c->keys[i].objectid, c->keys[i].flags, c->keys[i].offset,
60 btrfs_node_blockptr(c, i));
63 for (i = 0; i < nr; i++) {
64 struct btrfs_buffer *next_buf = read_tree_block(root,
65 btrfs_node_blockptr(c, i));
66 struct btrfs_node *next = &next_buf->node;
67 if (btrfs_is_leaf(next) &&
68 btrfs_header_level(&c->header) != 1)
70 if (btrfs_header_level(&next->header) !=
71 btrfs_header_level(&c->header) - 1)
73 btrfs_print_tree(root, next_buf);
74 btrfs_block_release(root, next_buf);