print-tree.c 2.5 KB
Newer Older
C
Chris Mason 已提交
1 2 3 4 5 6 7
#include <stdio.h>
#include <stdlib.h>
#include "kerncompat.h"
#include "radix-tree.h"
#include "ctree.h"
#include "disk-io.h"

C
Chris Mason 已提交
8
void btrfs_print_leaf(struct btrfs_root *root, struct btrfs_leaf *l)
C
Chris Mason 已提交
9 10
{
	int i;
11
	u32 nr = btrfs_header_nritems(&l->header);
C
Chris Mason 已提交
12
	struct btrfs_item *item;
C
Chris Mason 已提交
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",
C
Chris Mason 已提交
17 18
		btrfs_header_blocknr(&l->header), nr,
		btrfs_leaf_free_space(root, l));
C
Chris Mason 已提交
19 20 21
	fflush(stdout);
	for (i = 0 ; i < nr ; i++) {
		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",
C
Chris Mason 已提交
24
			i,
25 26 27
			btrfs_disk_key_objectid(&item->key),
			btrfs_disk_key_offset(&item->key),
			btrfs_disk_key_flags(&item->key),
C
Chris Mason 已提交
28 29
			btrfs_item_offset(item),
			btrfs_item_size(item));
30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49
		switch (type) {
		case BTRFS_INODE_ITEM_KEY:
			break;
		case BTRFS_DIR_ITEM_KEY:
			break;
		case BTRFS_ROOT_ITEM_KEY:
			ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
			printf("\t\troot data blocknr %Lu refs %u\n",
				btrfs_root_blocknr(ri), btrfs_root_refs(ri));
			break;
		case BTRFS_EXTENT_ITEM_KEY:
			ei = btrfs_item_ptr(l, i, struct btrfs_extent_item);
			printf("\t\textent data refs %u owner %Lu\n",
				btrfs_extent_refs(ei), btrfs_extent_owner(ei));
			break;
		case BTRFS_STRING_ITEM_KEY:
			printf("\t\titem data %.*s\n", btrfs_item_size(item),
				btrfs_leaf_data(l) + btrfs_item_offset(item));
			break;
		};
C
Chris Mason 已提交
50 51 52
		fflush(stdout);
	}
}
C
Chris Mason 已提交
53
void btrfs_print_tree(struct btrfs_root *root, struct btrfs_buffer *t)
C
Chris Mason 已提交
54 55
{
	int i;
56
	u32 nr;
C
Chris Mason 已提交
57
	struct btrfs_node *c;
C
Chris Mason 已提交
58 59 60 61

	if (!t)
		return;
	c = &t->node;
62 63
	nr = btrfs_header_nritems(&c->header);
	if (btrfs_is_leaf(c)) {
C
Chris Mason 已提交
64
		btrfs_print_leaf(root, (struct btrfs_leaf *)c);
C
Chris Mason 已提交
65 66
		return;
	}
C
Chris Mason 已提交
67
	printf("node %Lu level %d total ptrs %d free spc %u\n", t->blocknr,
68
	        btrfs_header_level(&c->header), nr,
C
Chris Mason 已提交
69
		(u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr);
C
Chris Mason 已提交
70 71
	fflush(stdout);
	for (i = 0; i < nr; i++) {
72
		printf("\tkey %d (%Lu %Lu %u) block %Lu\n",
C
Chris Mason 已提交
73
		       i,
74 75 76 77
		       c->ptrs[i].key.objectid,
		       c->ptrs[i].key.offset,
		       c->ptrs[i].key.flags,
		       btrfs_node_blockptr(c, i));
C
Chris Mason 已提交
78 79 80
		fflush(stdout);
	}
	for (i = 0; i < nr; i++) {
C
Chris Mason 已提交
81
		struct btrfs_buffer *next_buf = read_tree_block(root,
82
						btrfs_node_blockptr(c, i));
C
Chris Mason 已提交
83
		struct btrfs_node *next = &next_buf->node;
84 85
		if (btrfs_is_leaf(next) &&
		    btrfs_header_level(&c->header) != 1)
C
Chris Mason 已提交
86
			BUG();
87 88
		if (btrfs_header_level(&next->header) !=
			btrfs_header_level(&c->header) - 1)
C
Chris Mason 已提交
89
			BUG();
C
Chris Mason 已提交
90 91
		btrfs_print_tree(root, next_buf);
		btrfs_block_release(root, next_buf);
C
Chris Mason 已提交
92 93 94
	}
}