3 #include "kerncompat.h"
4 #include "radix-tree.h"
8 void btrfs_print_leaf(struct btrfs_root *root, struct btrfs_leaf *l)
11 u32 nr = btrfs_header_nritems(&l->header);
12 struct btrfs_item *item;
13 struct btrfs_extent_item *ei;
14 struct btrfs_root_item *ri;
15 struct btrfs_dir_item *di;
16 struct btrfs_inode_map_item *mi;
17 struct btrfs_inode_item *ii;
20 printf("leaf %Lu total ptrs %d free space %d\n",
21 btrfs_header_blocknr(&l->header), nr,
22 btrfs_leaf_free_space(root, l));
24 for (i = 0 ; i < nr ; i++) {
26 type = btrfs_disk_key_type(&item->key);
27 printf("\titem %d key (%Lu %u %Lu) itemoff %d itemsize %d\n",
29 btrfs_disk_key_objectid(&item->key),
30 btrfs_disk_key_flags(&item->key),
31 btrfs_disk_key_offset(&item->key),
32 btrfs_item_offset(item),
33 btrfs_item_size(item));
35 case BTRFS_INODE_ITEM_KEY:
36 ii = btrfs_item_ptr(l, i, struct btrfs_inode_item);
37 printf("\t\tinode generation %Lu size %Lu\n",
38 btrfs_inode_generation(ii),
39 btrfs_inode_size(ii));
41 case BTRFS_DIR_ITEM_KEY:
42 di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
43 printf("\t\tdir oid %Lu flags %u type %u\n",
44 btrfs_dir_objectid(di),
47 printf("\t\tname %.*s\n",
48 btrfs_dir_name_len(di),(char *)(di + 1));
50 case BTRFS_ROOT_ITEM_KEY:
51 ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
52 printf("\t\troot data blocknr %Lu refs %u\n",
53 btrfs_root_blocknr(ri), btrfs_root_refs(ri));
55 case BTRFS_EXTENT_ITEM_KEY:
56 ei = btrfs_item_ptr(l, i, struct btrfs_extent_item);
57 printf("\t\textent data refs %u owner %Lu\n",
58 btrfs_extent_refs(ei), btrfs_extent_owner(ei));
60 case BTRFS_INODE_MAP_ITEM_KEY:
61 mi = btrfs_item_ptr(l, i, struct btrfs_inode_map_item);
62 printf("\t\tinode map key %Lu %u %Lu\n",
63 btrfs_disk_key_objectid(&mi->key),
64 btrfs_disk_key_flags(&mi->key),
65 btrfs_disk_key_offset(&mi->key));
67 case BTRFS_STRING_ITEM_KEY:
68 printf("\t\titem data %.*s\n", btrfs_item_size(item),
69 btrfs_leaf_data(l) + btrfs_item_offset(item));
75 void btrfs_print_tree(struct btrfs_root *root, struct btrfs_buffer *t)
84 nr = btrfs_header_nritems(&c->header);
85 if (btrfs_is_leaf(c)) {
86 btrfs_print_leaf(root, (struct btrfs_leaf *)c);
89 printf("node %Lu level %d total ptrs %d free spc %u\n", t->blocknr,
90 btrfs_header_level(&c->header), nr,
91 (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr);
93 for (i = 0; i < nr; i++) {
94 printf("\tkey %d (%Lu %u %Lu) block %Lu\n",
96 c->ptrs[i].key.objectid,
98 c->ptrs[i].key.offset,
99 btrfs_node_blockptr(c, i));
102 for (i = 0; i < nr; i++) {
103 struct btrfs_buffer *next_buf = read_tree_block(root,
104 btrfs_node_blockptr(c, i));
105 struct btrfs_node *next = &next_buf->node;
106 if (btrfs_is_leaf(next) &&
107 btrfs_header_level(&c->header) != 1)
109 if (btrfs_header_level(&next->header) !=
110 btrfs_header_level(&c->header) - 1)
112 btrfs_print_tree(root, next_buf);
113 btrfs_block_release(root, next_buf);