3 #include "kerncompat.h"
4 #include "radix-tree.h"
8 void print_leaf(struct leaf *l)
11 int nr = l->header.nritems;
13 struct extent_item *ei;
14 printf("leaf %Lu total ptrs %d free space %d\n", l->header.blocknr, nr,
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 = c->header.nritems;
42 if (c->header.blocknr != t->blocknr)
44 if (is_leaf(c->header.flags)) {
45 print_leaf((struct leaf *)c);
48 printf("node %Lu level %d total ptrs %d free spc %u\n", t->blocknr,
49 node_level(c->header.flags), c->header.nritems,
50 (u32)NODEPTRS_PER_BLOCK - c->header.nritems);
52 for (i = 0; i < nr; i++) {
53 printf("\tkey %d (%Lu %u %Lu) block %Lu\n",
55 c->keys[i].objectid, c->keys[i].flags, c->keys[i].offset,
59 for (i = 0; i < nr; i++) {
60 struct tree_buffer *next_buf = read_tree_block(root,
62 struct node *next = &next_buf->node;
63 if (is_leaf(next->header.flags) &&
64 node_level(c->header.flags) != 1)
66 if (node_level(next->header.flags) !=
67 node_level(c->header.flags) - 1)
69 print_tree(root, next_buf);
70 tree_block_release(root, next_buf);