btrfs-progs/print-tree.c

95 lines
2.5 KiB
C
Raw Normal View History

2007-02-24 11:24:44 +00:00
#include <stdio.h>
#include <stdlib.h>
#include "kerncompat.h"
#include "radix-tree.h"
#include "ctree.h"
#include "disk-io.h"
2007-03-14 18:14:43 +00:00
void btrfs_print_leaf(struct btrfs_root *root, struct btrfs_leaf *l)
2007-02-24 11:24:44 +00:00
{
int i;
2007-03-12 16:01:18 +00:00
u32 nr = btrfs_header_nritems(&l->header);
2007-03-13 00:12:07 +00:00
struct btrfs_item *item;
2007-03-13 14:46:10 +00:00
struct btrfs_extent_item *ei;
struct btrfs_root_item *ri;
u32 type;
2007-03-12 16:01:18 +00:00
printf("leaf %Lu total ptrs %d free space %d\n",
2007-03-14 18:14:43 +00:00
btrfs_header_blocknr(&l->header), nr,
btrfs_leaf_free_space(root, l));
2007-02-24 11:24:44 +00:00
fflush(stdout);
for (i = 0 ; i < nr ; i++) {
item = l->items + i;
type = btrfs_disk_key_type(&item->key);
2007-03-14 18:26:53 +00:00
printf("\titem %d key (%Lu %Lu %u) itemoff %d itemsize %d\n",
2007-02-24 11:24:44 +00:00
i,
btrfs_disk_key_objectid(&item->key),
btrfs_disk_key_offset(&item->key),
btrfs_disk_key_flags(&item->key),
2007-03-13 00:12:07 +00:00
btrfs_item_offset(item),
btrfs_item_size(item));
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;
};
2007-02-24 11:24:44 +00:00
fflush(stdout);
}
}
2007-03-13 14:46:10 +00:00
void btrfs_print_tree(struct btrfs_root *root, struct btrfs_buffer *t)
2007-02-24 11:24:44 +00:00
{
int i;
2007-03-12 16:01:18 +00:00
u32 nr;
2007-03-13 14:46:10 +00:00
struct btrfs_node *c;
2007-02-24 11:24:44 +00:00
if (!t)
return;
c = &t->node;
2007-03-12 16:01:18 +00:00
nr = btrfs_header_nritems(&c->header);
if (btrfs_is_leaf(c)) {
2007-03-14 18:14:43 +00:00
btrfs_print_leaf(root, (struct btrfs_leaf *)c);
2007-02-24 11:24:44 +00:00
return;
}
2007-02-26 15:55:42 +00:00
printf("node %Lu level %d total ptrs %d free spc %u\n", t->blocknr,
2007-03-12 16:01:18 +00:00
btrfs_header_level(&c->header), nr,
2007-03-14 18:14:43 +00:00
(u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr);
2007-02-24 11:24:44 +00:00
fflush(stdout);
for (i = 0; i < nr; i++) {
2007-03-14 18:26:53 +00:00
printf("\tkey %d (%Lu %Lu %u) block %Lu\n",
2007-02-24 11:24:44 +00:00
i,
2007-03-14 18:26:53 +00:00
c->ptrs[i].key.objectid,
c->ptrs[i].key.offset,
c->ptrs[i].key.flags,
btrfs_node_blockptr(c, i));
2007-02-24 11:24:44 +00:00
fflush(stdout);
}
for (i = 0; i < nr; i++) {
2007-03-13 14:46:10 +00:00
struct btrfs_buffer *next_buf = read_tree_block(root,
2007-03-13 13:28:32 +00:00
btrfs_node_blockptr(c, i));
2007-03-13 14:46:10 +00:00
struct btrfs_node *next = &next_buf->node;
2007-03-12 16:01:18 +00:00
if (btrfs_is_leaf(next) &&
btrfs_header_level(&c->header) != 1)
2007-02-24 11:24:44 +00:00
BUG();
2007-03-12 16:01:18 +00:00
if (btrfs_header_level(&next->header) !=
btrfs_header_level(&c->header) - 1)
2007-02-24 11:24:44 +00:00
BUG();
2007-03-13 14:46:10 +00:00
btrfs_print_tree(root, next_buf);
btrfs_block_release(root, next_buf);
2007-02-24 11:24:44 +00:00
}
}