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 %Lu total ptrs %d free space %d\n",
19 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 (%Lu %x %Lu) itemoff %d itemsize %d\n",
26 btrfs_disk_key_objectid(&item->key),
27 btrfs_disk_key_flags(&item->key),
28 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 %Lu size %Lu mode %o\n",
35 btrfs_inode_generation(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 %Lu flags %u type %u\n",
42 btrfs_disk_key_objectid(&di->location),
45 printk("\t\tname %.*s\n",
46 btrfs_dir_name_len(di),(char *)(di + 1));
48 case BTRFS_ROOT_ITEM_KEY:
49 ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
50 printk("\t\troot data blocknr %Lu refs %u\n",
51 btrfs_root_blocknr(ri), btrfs_root_refs(ri));
53 case BTRFS_EXTENT_ITEM_KEY:
54 ei = btrfs_item_ptr(l, i, struct btrfs_extent_item);
55 printk("\t\textent data refs %u\n",
56 btrfs_extent_refs(ei));
58 case BTRFS_BLOCK_GROUP_ITEM_KEY:
59 bi = btrfs_item_ptr(l, i,
60 struct btrfs_block_group_item);
61 printk("\t\tblock group used %Lu\n",
62 btrfs_block_group_used(bi));
64 case BTRFS_STRING_ITEM_KEY:
65 printk("\t\titem data %.*s\n", btrfs_item_size(item),
66 btrfs_leaf_data(l) + btrfs_item_offset(item));
72 void btrfs_print_tree(struct btrfs_root *root, struct buffer_head *t)
80 c = btrfs_buffer_node(t);
81 nr = btrfs_header_nritems(&c->header);
82 if (btrfs_is_leaf(c)) {
83 btrfs_print_leaf(root, (struct btrfs_leaf *)c);
86 printk("node %Lu level %d total ptrs %d free spc %u\n",
87 btrfs_header_blocknr(&c->header),
88 btrfs_header_level(&c->header), nr,
89 (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr);
90 for (i = 0; i < nr; i++) {
91 printk("\tkey %d (%Lu %u %Lu) block %Lu\n",
93 c->ptrs[i].key.objectid,
95 c->ptrs[i].key.offset,
96 btrfs_node_blockptr(c, i));
98 for (i = 0; i < nr; i++) {
99 struct buffer_head *next_buf = read_tree_block(root,
100 btrfs_node_blockptr(c, i));
101 struct btrfs_node *next = btrfs_buffer_node(next_buf);
102 if (btrfs_is_leaf(next) &&
103 btrfs_header_level(&c->header) != 1)
105 if (btrfs_header_level(&next->header) !=
106 btrfs_header_level(&c->header) - 1)
108 btrfs_print_tree(root, next_buf);
109 btrfs_block_release(root, next_buf);