Btrfs: Use a chunk of the key flags to record the item type.
[deliverable/linux.git] / fs / btrfs / print-tree.c
1 #include <stdio.h>
2 #include <stdlib.h>
3 #include "kerncompat.h"
4 #include "radix-tree.h"
5 #include "ctree.h"
6 #include "disk-io.h"
7
8 void btrfs_print_leaf(struct btrfs_root *root, struct btrfs_leaf *l)
9 {
10 int i;
11 u32 nr = btrfs_header_nritems(&l->header);
12 struct btrfs_item *item;
13 struct btrfs_extent_item *ei;
14 struct btrfs_root_item *ri;
15 u32 type;
16 printf("leaf %Lu total ptrs %d free space %d\n",
17 btrfs_header_blocknr(&l->header), nr,
18 btrfs_leaf_free_space(root, l));
19 fflush(stdout);
20 for (i = 0 ; i < nr ; i++) {
21 item = l->items + i;
22 type = btrfs_disk_key_type(&item->key);
23 printf("\titem %d key (%Lu %Lu %u) itemoff %d itemsize %d\n",
24 i,
25 btrfs_disk_key_objectid(&item->key),
26 btrfs_disk_key_offset(&item->key),
27 btrfs_disk_key_flags(&item->key),
28 btrfs_item_offset(item),
29 btrfs_item_size(item));
30 switch (type) {
31 case BTRFS_INODE_ITEM_KEY:
32 break;
33 case BTRFS_DIR_ITEM_KEY:
34 break;
35 case BTRFS_ROOT_ITEM_KEY:
36 ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
37 printf("\t\troot data blocknr %Lu refs %u\n",
38 btrfs_root_blocknr(ri), btrfs_root_refs(ri));
39 break;
40 case BTRFS_EXTENT_ITEM_KEY:
41 ei = btrfs_item_ptr(l, i, struct btrfs_extent_item);
42 printf("\t\textent data refs %u owner %Lu\n",
43 btrfs_extent_refs(ei), btrfs_extent_owner(ei));
44 break;
45 case BTRFS_STRING_ITEM_KEY:
46 printf("\t\titem data %.*s\n", btrfs_item_size(item),
47 btrfs_leaf_data(l) + btrfs_item_offset(item));
48 break;
49 };
50 fflush(stdout);
51 }
52 }
53 void btrfs_print_tree(struct btrfs_root *root, struct btrfs_buffer *t)
54 {
55 int i;
56 u32 nr;
57 struct btrfs_node *c;
58
59 if (!t)
60 return;
61 c = &t->node;
62 nr = btrfs_header_nritems(&c->header);
63 if (btrfs_is_leaf(c)) {
64 btrfs_print_leaf(root, (struct btrfs_leaf *)c);
65 return;
66 }
67 printf("node %Lu level %d total ptrs %d free spc %u\n", t->blocknr,
68 btrfs_header_level(&c->header), nr,
69 (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr);
70 fflush(stdout);
71 for (i = 0; i < nr; i++) {
72 printf("\tkey %d (%Lu %Lu %u) block %Lu\n",
73 i,
74 c->ptrs[i].key.objectid,
75 c->ptrs[i].key.offset,
76 c->ptrs[i].key.flags,
77 btrfs_node_blockptr(c, i));
78 fflush(stdout);
79 }
80 for (i = 0; i < nr; i++) {
81 struct btrfs_buffer *next_buf = read_tree_block(root,
82 btrfs_node_blockptr(c, i));
83 struct btrfs_node *next = &next_buf->node;
84 if (btrfs_is_leaf(next) &&
85 btrfs_header_level(&c->header) != 1)
86 BUG();
87 if (btrfs_header_level(&next->header) !=
88 btrfs_header_level(&c->header) - 1)
89 BUG();
90 btrfs_print_tree(root, next_buf);
91 btrfs_block_release(root, next_buf);
92 }
93 }
94
This page took 0.035887 seconds and 6 git commands to generate.