blob: c95c85640aa9dbc2a3b9361bb39306790c6428bf [file] [log] [blame]
Chris Mason5de08d72007-02-24 06:24:44 -05001#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
Chris Mason234b63a2007-03-13 10:46:10 -04008void btrfs_print_leaf(struct btrfs_leaf *l)
Chris Mason5de08d72007-02-24 06:24:44 -05009{
10 int i;
Chris Mason7518a232007-03-12 12:01:18 -040011 u32 nr = btrfs_header_nritems(&l->header);
Chris Mason0783fcf2007-03-12 20:12:07 -040012 struct btrfs_item *item;
Chris Mason234b63a2007-03-13 10:46:10 -040013 struct btrfs_extent_item *ei;
Chris Mason7518a232007-03-12 12:01:18 -040014 printf("leaf %Lu total ptrs %d free space %d\n",
Chris Mason234b63a2007-03-13 10:46:10 -040015 btrfs_header_blocknr(&l->header), nr, btrfs_leaf_free_space(l));
Chris Mason5de08d72007-02-24 06:24:44 -050016 fflush(stdout);
17 for (i = 0 ; i < nr ; i++) {
18 item = l->items + i;
Chris Mason7cf75962007-02-26 10:55:01 -050019 printf("\titem %d key (%Lu %u %Lu) itemoff %d itemsize %d\n",
Chris Mason5de08d72007-02-24 06:24:44 -050020 i,
Chris Mason0783fcf2007-03-12 20:12:07 -040021 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));
Chris Mason5de08d72007-02-24 06:24:44 -050026 fflush(stdout);
Chris Mason0783fcf2007-03-12 20:12:07 -040027 printf("\t\titem data %.*s\n", btrfs_item_size(item),
28 l->data + btrfs_item_offset(item));
Chris Mason234b63a2007-03-13 10:46:10 -040029 ei = (struct btrfs_extent_item *)(l->data +
30 btrfs_item_offset(item));
Chris Masona28ec192007-03-06 20:08:01 -050031 printf("\t\textent data refs %u owner %Lu\n", ei->refs,
32 ei->owner);
Chris Mason5de08d72007-02-24 06:24:44 -050033 fflush(stdout);
34 }
35}
Chris Mason234b63a2007-03-13 10:46:10 -040036void btrfs_print_tree(struct btrfs_root *root, struct btrfs_buffer *t)
Chris Mason5de08d72007-02-24 06:24:44 -050037{
38 int i;
Chris Mason7518a232007-03-12 12:01:18 -040039 u32 nr;
Chris Mason234b63a2007-03-13 10:46:10 -040040 struct btrfs_node *c;
Chris Mason5de08d72007-02-24 06:24:44 -050041
42 if (!t)
43 return;
44 c = &t->node;
Chris Mason7518a232007-03-12 12:01:18 -040045 nr = btrfs_header_nritems(&c->header);
46 if (btrfs_is_leaf(c)) {
Chris Mason234b63a2007-03-13 10:46:10 -040047 btrfs_print_leaf((struct btrfs_leaf *)c);
Chris Mason5de08d72007-02-24 06:24:44 -050048 return;
49 }
Chris Mason41903fe2007-02-26 10:55:42 -050050 printf("node %Lu level %d total ptrs %d free spc %u\n", t->blocknr,
Chris Mason7518a232007-03-12 12:01:18 -040051 btrfs_header_level(&c->header), nr,
52 (u32)NODEPTRS_PER_BLOCK - nr);
Chris Mason5de08d72007-02-24 06:24:44 -050053 fflush(stdout);
54 for (i = 0; i < nr; i++) {
Chris Mason7cf75962007-02-26 10:55:01 -050055 printf("\tkey %d (%Lu %u %Lu) block %Lu\n",
Chris Mason5de08d72007-02-24 06:24:44 -050056 i,
57 c->keys[i].objectid, c->keys[i].flags, c->keys[i].offset,
Chris Mason1d4f8a02007-03-13 09:28:32 -040058 btrfs_node_blockptr(c, i));
Chris Mason5de08d72007-02-24 06:24:44 -050059 fflush(stdout);
60 }
61 for (i = 0; i < nr; i++) {
Chris Mason234b63a2007-03-13 10:46:10 -040062 struct btrfs_buffer *next_buf = read_tree_block(root,
Chris Mason1d4f8a02007-03-13 09:28:32 -040063 btrfs_node_blockptr(c, i));
Chris Mason234b63a2007-03-13 10:46:10 -040064 struct btrfs_node *next = &next_buf->node;
Chris Mason7518a232007-03-12 12:01:18 -040065 if (btrfs_is_leaf(next) &&
66 btrfs_header_level(&c->header) != 1)
Chris Mason5de08d72007-02-24 06:24:44 -050067 BUG();
Chris Mason7518a232007-03-12 12:01:18 -040068 if (btrfs_header_level(&next->header) !=
69 btrfs_header_level(&c->header) - 1)
Chris Mason5de08d72007-02-24 06:24:44 -050070 BUG();
Chris Mason234b63a2007-03-13 10:46:10 -040071 btrfs_print_tree(root, next_buf);
72 btrfs_block_release(root, next_buf);
Chris Mason5de08d72007-02-24 06:24:44 -050073 }
74
75}
76