3 #include "kerncompat.h"
4 #include "radix-tree.h"
8 static int print_dir_item(struct btrfs_item *item,
9 struct btrfs_dir_item *di)
14 total = btrfs_item_size(item);
16 printf("\t\tdir index %llu flags %u type %u\n",
17 (unsigned long long)btrfs_disk_key_objectid(&di->location),
20 printf("\t\tname %.*s\n",
21 btrfs_dir_name_len(di),(char *)(di + 1));
22 len = sizeof(*di) + btrfs_dir_name_len(di);
23 di = (struct btrfs_dir_item *)((char *)di + len);
28 void btrfs_print_leaf(struct btrfs_root *root, struct btrfs_leaf *l)
31 u32 nr = btrfs_header_nritems(&l->header);
32 struct btrfs_item *item;
33 struct btrfs_extent_item *ei;
34 struct btrfs_root_item *ri;
35 struct btrfs_dir_item *di;
36 struct btrfs_inode_item *ii;
37 struct btrfs_file_extent_item *fi;
38 struct btrfs_csum_item *ci;
39 struct btrfs_block_group_item *bi;
42 printf("leaf %llu ptrs %d free space %d generation %llu owner %llu\n",
43 (unsigned long long)btrfs_header_blocknr(&l->header), nr,
44 btrfs_leaf_free_space(root, l),
45 (unsigned long long)btrfs_header_generation(&l->header),
46 (unsigned long long)btrfs_header_owner(&l->header));
48 for (i = 0 ; i < nr ; i++) {
50 type = btrfs_disk_key_type(&item->key);
51 printf("\titem %d key (%llu %x %llu) itemoff %d itemsize %d\n",
53 (unsigned long long)btrfs_disk_key_objectid(&item->key),
54 btrfs_disk_key_flags(&item->key),
55 (unsigned long long)btrfs_disk_key_offset(&item->key),
56 btrfs_item_offset(item),
57 btrfs_item_size(item));
59 case BTRFS_INODE_ITEM_KEY:
60 ii = btrfs_item_ptr(l, i, struct btrfs_inode_item);
61 printf("\t\tinode generation %llu size %llu block group %llu mode %o\n",
62 (unsigned long long)btrfs_inode_generation(ii),
63 (unsigned long long)btrfs_inode_size(ii),
64 (unsigned long long)btrfs_inode_block_group(ii),
65 btrfs_inode_mode(ii));
67 case BTRFS_DIR_ITEM_KEY:
68 di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
69 print_dir_item(l->items + i, di);
71 case BTRFS_DIR_INDEX_KEY:
72 di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
73 print_dir_item(l->items + i, di);
75 case BTRFS_ROOT_ITEM_KEY:
76 ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
77 printf("\t\troot data blocknr %llu dirid %llu refs %u\n",
78 (unsigned long long)btrfs_root_blocknr(ri),
79 (unsigned long long)btrfs_root_dirid(ri),
82 case BTRFS_EXTENT_ITEM_KEY:
83 ei = btrfs_item_ptr(l, i, struct btrfs_extent_item);
84 printf("\t\textent data refs %u owner %llu\n",
85 btrfs_extent_refs(ei),
86 (unsigned long long)btrfs_extent_owner(ei));
88 case BTRFS_CSUM_ITEM_KEY:
89 ci = btrfs_item_ptr(l, i,
90 struct btrfs_csum_item);
91 printf("\t\tcsum item\n");
93 case BTRFS_EXTENT_DATA_KEY:
94 fi = btrfs_item_ptr(l, i,
95 struct btrfs_file_extent_item);
96 if (btrfs_file_extent_type(fi) ==
97 BTRFS_FILE_EXTENT_INLINE) {
98 printf("\t\tinline extent data size %u\n",
99 btrfs_file_extent_inline_len(l->items + i));
102 printf("\t\textent data disk block %llu nr %llu\n",
103 (unsigned long long)btrfs_file_extent_disk_blocknr(fi),
104 (unsigned long long)btrfs_file_extent_disk_num_blocks(fi));
105 printf("\t\textent data offset %llu nr %llu\n",
106 (unsigned long long)btrfs_file_extent_offset(fi),
107 (unsigned long long)btrfs_file_extent_num_blocks(fi));
109 case BTRFS_BLOCK_GROUP_ITEM_KEY:
110 bi = btrfs_item_ptr(l, i,
111 struct btrfs_block_group_item);
112 printf("\t\tblock group used %llu flags %x\n",
113 (unsigned long long)btrfs_block_group_used(bi),
116 case BTRFS_STRING_ITEM_KEY:
117 printf("\t\titem data %.*s\n", btrfs_item_size(item),
118 btrfs_leaf_data(l) + btrfs_item_offset(item));
124 void btrfs_print_tree(struct btrfs_root *root, struct btrfs_buffer *t)
128 struct btrfs_node *c;
133 nr = btrfs_header_nritems(&c->header);
134 if (btrfs_is_leaf(c)) {
135 btrfs_print_leaf(root, (struct btrfs_leaf *)c);
138 printf("node %llu level %d ptrs %d free %u generation %llu owner %llu\n",
139 (unsigned long long)t->blocknr,
140 btrfs_header_level(&c->header), nr,
141 (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr,
142 (unsigned long long)btrfs_header_generation(&c->header),
143 (unsigned long long)btrfs_header_owner(&c->header));
145 for (i = 0; i < nr; i++) {
146 printf("\tkey %d (%llu %x %llu) block %llu\n",
148 (unsigned long long)c->ptrs[i].key.objectid,
149 c->ptrs[i].key.flags,
150 (unsigned long long)c->ptrs[i].key.offset,
151 (unsigned long long)btrfs_node_blockptr(c, i));
154 for (i = 0; i < nr; i++) {
155 struct btrfs_buffer *next_buf = read_tree_block(root,
156 btrfs_node_blockptr(c, i));
157 struct btrfs_node *next = &next_buf->node;
158 if (btrfs_is_leaf(next) &&
159 btrfs_header_level(&c->header) != 1)
161 if (btrfs_header_level(&next->header) !=
162 btrfs_header_level(&c->header) - 1)
164 btrfs_print_tree(root, next_buf);
165 btrfs_block_release(root, next_buf);