1 #include <linux/module.h>
5 void btrfs_print_leaf(struct btrfs_root *root, struct btrfs_leaf *l)
8 u32 nr = btrfs_header_nritems(&l->header);
9 struct btrfs_item *item;
10 struct btrfs_extent_item *ei;
11 struct btrfs_root_item *ri;
12 struct btrfs_dir_item *di;
13 struct btrfs_inode_map_item *mi;
14 struct btrfs_inode_item *ii;
17 printk("leaf %Lu total ptrs %d free space %d\n",
18 btrfs_header_blocknr(&l->header), nr,
19 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 %u %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_dir_objectid(di),
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 owner %Lu\n",
56 btrfs_extent_refs(ei), btrfs_extent_owner(ei));
58 case BTRFS_INODE_MAP_ITEM_KEY:
59 mi = btrfs_item_ptr(l, i, struct btrfs_inode_map_item);
60 printk("\t\tinode map key %Lu %u %Lu\n",
61 btrfs_disk_key_objectid(&mi->key),
62 btrfs_disk_key_flags(&mi->key),
63 btrfs_disk_key_offset(&mi->key));
65 case BTRFS_STRING_ITEM_KEY:
66 printk("\t\titem data %.*s\n", btrfs_item_size(item),
67 btrfs_leaf_data(l) + btrfs_item_offset(item));
73 void btrfs_print_tree(struct btrfs_root *root, struct btrfs_buffer *t)
82 nr = btrfs_header_nritems(&c->header);
83 if (btrfs_is_leaf(c)) {
84 btrfs_print_leaf(root, (struct btrfs_leaf *)c);
87 printk("node %Lu level %d total ptrs %d free spc %u\n", t->blocknr,
88 btrfs_header_level(&c->header), nr,
89 (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr);
91 for (i = 0; i < nr; i++) {
92 printk("\tkey %d (%Lu %u %Lu) block %Lu\n",
94 c->ptrs[i].key.objectid,
96 c->ptrs[i].key.offset,
97 btrfs_node_blockptr(c, i));
100 for (i = 0; i < nr; i++) {
101 struct btrfs_buffer *next_buf = read_tree_block(root,
102 btrfs_node_blockptr(c, i));
103 struct btrfs_node *next = &next_buf->node;
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);