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 printf("leaf %Lu total ptrs %d free space %d\n",
15 btrfs_header_blocknr(&l->header), nr, btrfs_leaf_free_space(l));
17 for (i = 0 ; i < nr ; i++) {
19 printf("\titem %d key (%Lu %u %Lu) itemoff %d itemsize %d\n",
21 btrfs_key_objectid(&item->key),
22 btrfs_key_flags(&item->key),
23 btrfs_key_offset(&item->key),
24 btrfs_item_offset(item),
25 btrfs_item_size(item));
27 printf("\t\titem data %.*s\n", btrfs_item_size(item),
28 l->data + btrfs_item_offset(item));
29 ei = (struct btrfs_extent_item *)(l->data +
30 btrfs_item_offset(item));
31 printf("\t\textent data refs %u owner %Lu\n", ei->refs,
36 void btrfs_print_tree(struct btrfs_root *root, struct btrfs_buffer *t)
45 nr = btrfs_header_nritems(&c->header);
46 if (btrfs_is_leaf(c)) {
47 btrfs_print_leaf((struct btrfs_leaf *)c);
50 printf("node %Lu level %d total ptrs %d free spc %u\n", t->blocknr,
51 btrfs_header_level(&c->header), nr,
52 (u32)NODEPTRS_PER_BLOCK - nr);
54 for (i = 0; i < nr; i++) {
55 printf("\tkey %d (%Lu %u %Lu) block %Lu\n",
57 c->keys[i].objectid, c->keys[i].flags, c->keys[i].offset,
58 btrfs_node_blockptr(c, i));
61 for (i = 0; i < nr; i++) {
62 struct btrfs_buffer *next_buf = read_tree_block(root,
63 btrfs_node_blockptr(c, i));
64 struct btrfs_node *next = &next_buf->node;
65 if (btrfs_is_leaf(next) &&
66 btrfs_header_level(&c->header) != 1)
68 if (btrfs_header_level(&next->header) !=
69 btrfs_header_level(&c->header) - 1)
71 btrfs_print_tree(root, next_buf);
72 btrfs_block_release(root, next_buf);