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
, l
->data
+item
->offset
);
25 ei
= (struct extent_item
*)(l
->data
+ item
->offset
);
26 printf("\t\textent data %u %Lu\n", ei
->refs
, ei
->owner
);
30 void print_tree(struct ctree_root
*root
, struct tree_buffer
*t
)
39 nr
= c
->header
.nritems
;
40 if (c
->header
.blocknr
!= t
->blocknr
)
42 if (is_leaf(c
->header
.flags
)) {
43 print_leaf((struct leaf
*)c
);
46 printf("node %Lu level %d total ptrs %d free spc %u\n", t
->blocknr
,
47 node_level(c
->header
.flags
), c
->header
.nritems
,
48 (u32
)NODEPTRS_PER_BLOCK
- c
->header
.nritems
);
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 (is_leaf(next
->header
.flags
) &&
62 node_level(c
->header
.flags
) != 1)
64 if (node_level(next
->header
.flags
) !=
65 node_level(c
->header
.flags
) - 1)
67 print_tree(root
, next_buf
);
68 tree_block_release(root
, next_buf
);