Btrfs: merge leaves before split
[linux-2.6-block.git] / fs / btrfs / print-tree.c
CommitLineData
5de08d7d
CM
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
234b63a0 8void btrfs_print_leaf(struct btrfs_leaf *l)
5de08d7d
CM
9{
10 int i;
7518a238 11 u32 nr = btrfs_header_nritems(&l->header);
0783fcfc 12 struct btrfs_item *item;
234b63a0 13 struct btrfs_extent_item *ei;
7518a238 14 printf("leaf %Lu total ptrs %d free space %d\n",
234b63a0 15 btrfs_header_blocknr(&l->header), nr, btrfs_leaf_free_space(l));
5de08d7d
CM
16 fflush(stdout);
17 for (i = 0 ; i < nr ; i++) {
18 item = l->items + i;
7cf75962 19 printf("\titem %d key (%Lu %u %Lu) itemoff %d itemsize %d\n",
5de08d7d 20 i,
0783fcfc
CM
21 btrfs_key_objectid(&item->key),
22 btrfs_key_flags(&item->key),
23 btrfs_key_offset(&item->key),
24 btrfs_item_offset(item),
25 btrfs_item_size(item));
5de08d7d 26 fflush(stdout);
0783fcfc
CM
27 printf("\t\titem data %.*s\n", btrfs_item_size(item),
28 l->data + btrfs_item_offset(item));
234b63a0
CM
29 ei = (struct btrfs_extent_item *)(l->data +
30 btrfs_item_offset(item));
a28ec197
CM
31 printf("\t\textent data refs %u owner %Lu\n", ei->refs,
32 ei->owner);
5de08d7d
CM
33 fflush(stdout);
34 }
35}
234b63a0 36void btrfs_print_tree(struct btrfs_root *root, struct btrfs_buffer *t)
5de08d7d
CM
37{
38 int i;
7518a238 39 u32 nr;
234b63a0 40 struct btrfs_node *c;
5de08d7d
CM
41
42 if (!t)
43 return;
44 c = &t->node;
7518a238
CM
45 nr = btrfs_header_nritems(&c->header);
46 if (btrfs_is_leaf(c)) {
234b63a0 47 btrfs_print_leaf((struct btrfs_leaf *)c);
5de08d7d
CM
48 return;
49 }
41903fe6 50 printf("node %Lu level %d total ptrs %d free spc %u\n", t->blocknr,
7518a238
CM
51 btrfs_header_level(&c->header), nr,
52 (u32)NODEPTRS_PER_BLOCK - nr);
5de08d7d
CM
53 fflush(stdout);
54 for (i = 0; i < nr; i++) {
7cf75962 55 printf("\tkey %d (%Lu %u %Lu) block %Lu\n",
5de08d7d
CM
56 i,
57 c->keys[i].objectid, c->keys[i].flags, c->keys[i].offset,
1d4f8a0c 58 btrfs_node_blockptr(c, i));
5de08d7d
CM
59 fflush(stdout);
60 }
61 for (i = 0; i < nr; i++) {
234b63a0 62 struct btrfs_buffer *next_buf = read_tree_block(root,
1d4f8a0c 63 btrfs_node_blockptr(c, i));
234b63a0 64 struct btrfs_node *next = &next_buf->node;
7518a238
CM
65 if (btrfs_is_leaf(next) &&
66 btrfs_header_level(&c->header) != 1)
5de08d7d 67 BUG();
7518a238
CM
68 if (btrfs_header_level(&next->header) !=
69 btrfs_header_level(&c->header) - 1)
5de08d7d 70 BUG();
234b63a0
CM
71 btrfs_print_tree(root, next_buf);
72 btrfs_block_release(root, next_buf);
5de08d7d
CM
73 }
74
75}
76