3 #include "kerncompat.h"
4 #include "radix-tree.h"
8 void print_leaf(struct leaf *l)
11 u32 nr = btrfs_header_nritems(&l->header);
13 struct extent_item *ei;
14 printf("leaf %Lu total ptrs %d free space %d\n",
15 btrfs_header_blocknr(&l->header), nr, 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 item->key.objectid, item->key.flags, item->key.offset,
22 item->offset, item->size);
24 printf("\t\titem data %.*s\n", item->size,
25 l->data+item->offset);
26 ei = (struct extent_item *)(l->data + item->offset);
27 printf("\t\textent data refs %u owner %Lu\n", ei->refs,
32 void print_tree(struct ctree_root *root, struct tree_buffer *t)
41 nr = btrfs_header_nritems(&c->header);
42 if (btrfs_is_leaf(c)) {
43 print_leaf((struct leaf *)c);
46 printf("node %Lu level %d total ptrs %d free spc %u\n", t->blocknr,
47 btrfs_header_level(&c->header), nr,
48 (u32)NODEPTRS_PER_BLOCK - nr);
50 for (i = 0; i < nr; i++) {
51 printf("\tkey %d (%Lu %u %Lu) block %Lu\n",
53 c->keys[i].objectid, c->keys[i].flags, c->keys[i].offset,
57 for (i = 0; i < nr; i++) {
58 struct tree_buffer *next_buf = read_tree_block(root,
60 struct node *next = &next_buf->node;
61 if (btrfs_is_leaf(next) &&
62 btrfs_header_level(&c->header) != 1)
64 if (btrfs_header_level(&next->header) !=
65 btrfs_header_level(&c->header) - 1)
67 print_tree(root, next_buf);
68 tree_block_release(root, next_buf);