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; 11 int nr = l->header.nritems; 12 struct item *item; 13 struct extent_item *ei; 14 printf("leaf %Lu total ptrs %d free space %d\n", l->header.blocknr, nr, 15 leaf_free_space(l)); 16 fflush(stdout); 17 for (i = 0 ; i < nr ; i++) { 18 item = l->items + i; 19 printf("\titem %d key (%Lu %u %Lu) itemoff %d itemsize %d\n", 20 i, 21 item->key.objectid, item->key.flags, item->key.offset, 22 item->offset, item->size); 23 fflush(stdout); 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, 28 ei->owner); 29 fflush(stdout); 30 } 31 } 32 void print_tree(struct ctree_root *root, struct tree_buffer *t) 33 { 34 int i; 35 int nr; 36 struct node *c; 37 38 if (!t) 39 return; 40 c = &t->node; 41 nr = c->header.nritems; 42 if (c->header.blocknr != t->blocknr) 43 BUG(); 44 if (is_leaf(c->header.flags)) { 45 print_leaf((struct leaf *)c); 46 return; 47 } 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); 51 fflush(stdout); 52 for (i = 0; i < nr; i++) { 53 printf("\tkey %d (%Lu %u %Lu) block %Lu\n", 54 i, 55 c->keys[i].objectid, c->keys[i].flags, c->keys[i].offset, 56 c->blockptrs[i]); 57 fflush(stdout); 58 } 59 for (i = 0; i < nr; i++) { 60 struct tree_buffer *next_buf = read_tree_block(root, 61 c->blockptrs[i]); 62 struct node *next = &next_buf->node; 63 if (is_leaf(next->header.flags) && 64 node_level(c->header.flags) != 1) 65 BUG(); 66 if (node_level(next->header.flags) != 67 node_level(c->header.flags) - 1) 68 BUG(); 69 print_tree(root, next_buf); 70 tree_block_release(root, next_buf); 71 } 72 73 } 74 75