Commit | Line | Data |
---|---|---|
2e635a27 | 1 | #include <linux/module.h> |
5de08d7d CM |
2 | #include "ctree.h" |
3 | #include "disk-io.h" | |
4 | ||
123abc88 | 5 | void btrfs_print_leaf(struct btrfs_root *root, struct btrfs_leaf *l) |
5de08d7d CM |
6 | { |
7 | int i; | |
7518a238 | 8 | u32 nr = btrfs_header_nritems(&l->header); |
0783fcfc | 9 | struct btrfs_item *item; |
234b63a0 | 10 | struct btrfs_extent_item *ei; |
3768f368 | 11 | struct btrfs_root_item *ri; |
1d4f6404 | 12 | struct btrfs_dir_item *di; |
9f5fae2f | 13 | struct btrfs_inode_map_item *mi; |
293ffd5f | 14 | struct btrfs_inode_item *ii; |
62e2749e | 15 | u32 type; |
1d4f6404 | 16 | |
2e635a27 | 17 | printk("leaf %Lu total ptrs %d free space %d\n", |
123abc88 CM |
18 | btrfs_header_blocknr(&l->header), nr, |
19 | btrfs_leaf_free_space(root, l)); | |
5de08d7d CM |
20 | fflush(stdout); |
21 | for (i = 0 ; i < nr ; i++) { | |
22 | item = l->items + i; | |
62e2749e | 23 | type = btrfs_disk_key_type(&item->key); |
2e635a27 | 24 | printk("\titem %d key (%Lu %u %Lu) itemoff %d itemsize %d\n", |
5de08d7d | 25 | i, |
62e2749e | 26 | btrfs_disk_key_objectid(&item->key), |
62e2749e | 27 | btrfs_disk_key_flags(&item->key), |
a8a2ee0c | 28 | btrfs_disk_key_offset(&item->key), |
0783fcfc CM |
29 | btrfs_item_offset(item), |
30 | btrfs_item_size(item)); | |
62e2749e CM |
31 | switch (type) { |
32 | case BTRFS_INODE_ITEM_KEY: | |
293ffd5f | 33 | ii = btrfs_item_ptr(l, i, struct btrfs_inode_item); |
2e635a27 | 34 | printk("\t\tinode generation %Lu size %Lu mode %o\n", |
293ffd5f | 35 | btrfs_inode_generation(ii), |
2e635a27 CM |
36 | btrfs_inode_size(ii), |
37 | btrfs_inode_mode(ii)); | |
62e2749e CM |
38 | break; |
39 | case BTRFS_DIR_ITEM_KEY: | |
1d4f6404 | 40 | di = btrfs_item_ptr(l, i, struct btrfs_dir_item); |
2e635a27 | 41 | printk("\t\tdir oid %Lu flags %u type %u\n", |
1d4f6404 CM |
42 | btrfs_dir_objectid(di), |
43 | btrfs_dir_flags(di), | |
44 | btrfs_dir_type(di)); | |
2e635a27 | 45 | printk("\t\tname %.*s\n", |
9f5fae2f | 46 | btrfs_dir_name_len(di),(char *)(di + 1)); |
62e2749e CM |
47 | break; |
48 | case BTRFS_ROOT_ITEM_KEY: | |
49 | ri = btrfs_item_ptr(l, i, struct btrfs_root_item); | |
2e635a27 | 50 | printk("\t\troot data blocknr %Lu refs %u\n", |
62e2749e CM |
51 | btrfs_root_blocknr(ri), btrfs_root_refs(ri)); |
52 | break; | |
53 | case BTRFS_EXTENT_ITEM_KEY: | |
54 | ei = btrfs_item_ptr(l, i, struct btrfs_extent_item); | |
2e635a27 | 55 | printk("\t\textent data refs %u owner %Lu\n", |
62e2749e CM |
56 | btrfs_extent_refs(ei), btrfs_extent_owner(ei)); |
57 | break; | |
9f5fae2f CM |
58 | case BTRFS_INODE_MAP_ITEM_KEY: |
59 | mi = btrfs_item_ptr(l, i, struct btrfs_inode_map_item); | |
2e635a27 | 60 | printk("\t\tinode map key %Lu %u %Lu\n", |
9f5fae2f CM |
61 | btrfs_disk_key_objectid(&mi->key), |
62 | btrfs_disk_key_flags(&mi->key), | |
63 | btrfs_disk_key_offset(&mi->key)); | |
64 | break; | |
62e2749e | 65 | case BTRFS_STRING_ITEM_KEY: |
2e635a27 | 66 | printk("\t\titem data %.*s\n", btrfs_item_size(item), |
62e2749e CM |
67 | btrfs_leaf_data(l) + btrfs_item_offset(item)); |
68 | break; | |
69 | }; | |
5de08d7d CM |
70 | fflush(stdout); |
71 | } | |
72 | } | |
234b63a0 | 73 | void btrfs_print_tree(struct btrfs_root *root, struct btrfs_buffer *t) |
5de08d7d CM |
74 | { |
75 | int i; | |
7518a238 | 76 | u32 nr; |
234b63a0 | 77 | struct btrfs_node *c; |
5de08d7d CM |
78 | |
79 | if (!t) | |
80 | return; | |
81 | c = &t->node; | |
7518a238 CM |
82 | nr = btrfs_header_nritems(&c->header); |
83 | if (btrfs_is_leaf(c)) { | |
123abc88 | 84 | btrfs_print_leaf(root, (struct btrfs_leaf *)c); |
5de08d7d CM |
85 | return; |
86 | } | |
2e635a27 | 87 | printk("node %Lu level %d total ptrs %d free spc %u\n", t->blocknr, |
7518a238 | 88 | btrfs_header_level(&c->header), nr, |
123abc88 | 89 | (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr); |
5de08d7d CM |
90 | fflush(stdout); |
91 | for (i = 0; i < nr; i++) { | |
2e635a27 | 92 | printk("\tkey %d (%Lu %u %Lu) block %Lu\n", |
5de08d7d | 93 | i, |
a1516c89 | 94 | c->ptrs[i].key.objectid, |
a1516c89 | 95 | c->ptrs[i].key.flags, |
a8a2ee0c | 96 | c->ptrs[i].key.offset, |
a1516c89 | 97 | btrfs_node_blockptr(c, i)); |
5de08d7d CM |
98 | fflush(stdout); |
99 | } | |
100 | for (i = 0; i < nr; i++) { | |
234b63a0 | 101 | struct btrfs_buffer *next_buf = read_tree_block(root, |
1d4f8a0c | 102 | btrfs_node_blockptr(c, i)); |
234b63a0 | 103 | struct btrfs_node *next = &next_buf->node; |
7518a238 CM |
104 | if (btrfs_is_leaf(next) && |
105 | btrfs_header_level(&c->header) != 1) | |
5de08d7d | 106 | BUG(); |
7518a238 CM |
107 | if (btrfs_header_level(&next->header) != |
108 | btrfs_header_level(&c->header) - 1) | |
5de08d7d | 109 | BUG(); |
234b63a0 CM |
110 | btrfs_print_tree(root, next_buf); |
111 | btrfs_block_release(root, next_buf); | |
5de08d7d | 112 | } |
5de08d7d CM |
113 | } |
114 |