1 #include <linux/module.h>
4 #include "print-tree.h"
6 void btrfs_print_leaf(struct btrfs_root *root, struct btrfs_leaf *l)
9 u32 nr = btrfs_header_nritems(&l->header);
10 struct btrfs_item *item;
11 struct btrfs_extent_item *ei;
12 struct btrfs_root_item *ri;
13 struct btrfs_dir_item *di;
14 struct btrfs_inode_item *ii;
15 struct btrfs_block_group_item *bi;
18 printk("leaf %llu total ptrs %d free space %d\n",
19 (unsigned long long)btrfs_header_blocknr(&l->header), nr,
20 btrfs_leaf_free_space(root, l));
21 for (i = 0 ; i < nr ; i++) {
23 type = btrfs_disk_key_type(&item->key);
24 printk("\titem %d key (%llu %x %llu) itemoff %d itemsize %d\n",
26 (unsigned long long)btrfs_disk_key_objectid(&item->key),
27 btrfs_disk_key_flags(&item->key),
28 (unsigned long long)btrfs_disk_key_offset(&item->key),
29 btrfs_item_offset(item),
30 btrfs_item_size(item));
32 case BTRFS_INODE_ITEM_KEY:
33 ii = btrfs_item_ptr(l, i, struct btrfs_inode_item);
34 printk("\t\tinode generation %llu size %llu mode %o\n",
35 (unsigned long long)btrfs_inode_generation(ii),
36 (unsigned long long)btrfs_inode_size(ii),
37 btrfs_inode_mode(ii));
39 case BTRFS_DIR_ITEM_KEY:
40 di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
41 printk("\t\tdir oid %llu flags %u type %u\n",
42 (unsigned long long)btrfs_disk_key_objectid(
46 printk("\t\tname %.*s\n",
47 btrfs_dir_name_len(di),(char *)(di + 1));
49 case BTRFS_ROOT_ITEM_KEY:
50 ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
51 printk("\t\troot data blocknr %llu refs %u\n",
52 (unsigned long long)btrfs_root_blocknr(ri),
55 case BTRFS_EXTENT_ITEM_KEY:
56 ei = btrfs_item_ptr(l, i, struct btrfs_extent_item);
57 printk("\t\textent data refs %u\n",
58 btrfs_extent_refs(ei));
60 case BTRFS_BLOCK_GROUP_ITEM_KEY:
61 bi = btrfs_item_ptr(l, i,
62 struct btrfs_block_group_item);
63 printk("\t\tblock group used %llu\n",
64 (unsigned long long)btrfs_block_group_used(bi));
66 case BTRFS_STRING_ITEM_KEY:
67 printk("\t\titem data %.*s\n", btrfs_item_size(item),
68 btrfs_leaf_data(l) + btrfs_item_offset(item));
74 void btrfs_print_tree(struct btrfs_root *root, struct buffer_head *t)
82 c = btrfs_buffer_node(t);
83 nr = btrfs_header_nritems(&c->header);
84 if (btrfs_is_leaf(c)) {
85 btrfs_print_leaf(root, (struct btrfs_leaf *)c);
88 printk("node %llu level %d total ptrs %d free spc %u\n",
89 (unsigned long long)btrfs_header_blocknr(&c->header),
90 btrfs_header_level(&c->header), nr,
91 (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr);
92 for (i = 0; i < nr; i++) {
93 printk("\tkey %d (%llu %u %llu) block %llu\n",
95 (unsigned long long)c->ptrs[i].key.objectid,
97 (unsigned long long)c->ptrs[i].key.offset,
98 (unsigned long long)btrfs_node_blockptr(c, i));
100 for (i = 0; i < nr; i++) {
101 struct buffer_head *next_buf = read_tree_block(root,
102 btrfs_node_blockptr(c, i));
103 struct btrfs_node *next = btrfs_buffer_node(next_buf);
104 if (btrfs_is_leaf(next) &&
105 btrfs_header_level(&c->header) != 1)
107 if (btrfs_header_level(&next->header) !=
108 btrfs_header_level(&c->header) - 1)
110 btrfs_print_tree(root, next_buf);
111 btrfs_block_release(root, next_buf);