btrfs-progs/print-tree.c

161 lines
4.7 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;
struct btrfs_dir_item *di;
2007-04-11 17:57:55 +00:00
struct btrfs_device_item *devi;
2007-03-20 19:57:25 +00:00
struct btrfs_inode_item *ii;
2007-03-26 20:01:00 +00:00
struct btrfs_file_extent_item *fi;
struct btrfs_csum_item *ci;
2007-04-04 17:27:22 +00:00
char *p;
u32 type;
2007-04-10 16:36:58 +00:00
printf("leaf %Lu ptrs %d free space %d generation %Lu\n",
2007-03-14 18:14:43 +00:00
btrfs_header_blocknr(&l->header), nr,
2007-03-26 15:24:42 +00:00
btrfs_leaf_free_space(root, l),
btrfs_header_generation(&l->header));
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-04-18 20:15:47 +00:00
printf("\titem %d key (%Lu %x %Lu) itemoff %d itemsize %d\n",
2007-02-24 11:24:44 +00:00
i,
btrfs_disk_key_objectid(&item->key),
2007-04-06 19:39:12 +00:00
btrfs_disk_key_flags(&item->key),
2007-04-17 19:40:34 +00:00
btrfs_disk_key_offset(&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:
2007-03-20 19:57:25 +00:00
ii = btrfs_item_ptr(l, i, struct btrfs_inode_item);
2007-03-21 15:13:29 +00:00
printf("\t\tinode generation %Lu size %Lu mode %o\n",
2007-03-20 19:57:25 +00:00
btrfs_inode_generation(ii),
2007-03-21 15:13:29 +00:00
btrfs_inode_size(ii),
btrfs_inode_mode(ii));
break;
2007-04-04 17:27:22 +00:00
case BTRFS_INLINE_DATA_KEY:
p = btrfs_item_ptr(l, i, char);
printf("\t\tinline data %.*s\n", 10, p);
break;
case BTRFS_DIR_ITEM_KEY:
di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
printf("\t\tdir oid %Lu flags %u type %u\n",
2007-04-06 19:39:12 +00:00
btrfs_disk_key_objectid(&di->location),
btrfs_dir_flags(di),
btrfs_dir_type(di));
printf("\t\tname %.*s\n",
btrfs_dir_name_len(di),(char *)(di + 1));
break;
2007-04-05 01:23:26 +00:00
case BTRFS_DIR_INDEX_KEY:
di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
printf("\t\tdir index %Lu flags %u type %u\n",
2007-04-06 19:39:12 +00:00
btrfs_disk_key_objectid(&di->location),
2007-04-05 01:23:26 +00:00
btrfs_dir_flags(di),
btrfs_dir_type(di));
printf("\t\tname %.*s\n",
btrfs_dir_name_len(di),(char *)(di + 1));
break;
case BTRFS_ROOT_ITEM_KEY:
ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
2007-04-06 19:39:12 +00:00
printf("\t\troot data blocknr %Lu dirid %Lu refs %u\n",
btrfs_root_blocknr(ri),
btrfs_root_dirid(ri),
btrfs_root_refs(ri));
break;
case BTRFS_EXTENT_ITEM_KEY:
ei = btrfs_item_ptr(l, i, struct btrfs_extent_item);
2007-04-10 16:36:58 +00:00
printf("\t\textent data refs %u\n",
btrfs_extent_refs(ei));
break;
case BTRFS_CSUM_ITEM_KEY:
ci = btrfs_item_ptr(l, i,
struct btrfs_csum_item);
printf("\t\tcsum item\n");
break;
2007-03-26 20:01:00 +00:00
case BTRFS_EXTENT_DATA_KEY:
fi = btrfs_item_ptr(l, i,
struct btrfs_file_extent_item);
2007-04-19 17:38:02 +00:00
if (btrfs_file_extent_type(fi) ==
BTRFS_FILE_EXTENT_INLINE) {
printf("\t\tinline extent data size %u\n",
btrfs_file_extent_inline_len(l->items + i));
break;
}
2007-03-26 20:01:00 +00:00
printf("\t\textent data disk block %Lu nr %Lu\n",
btrfs_file_extent_disk_blocknr(fi),
btrfs_file_extent_disk_num_blocks(fi));
printf("\t\textent data offset %Lu nr %Lu\n",
btrfs_file_extent_offset(fi),
btrfs_file_extent_num_blocks(fi));
break;
2007-04-11 17:57:55 +00:00
case BTRFS_DEV_ITEM_KEY:
devi = btrfs_item_ptr(l, i, struct btrfs_device_item);
printf("\t\tdev id %Lu namelen %u name %.*s\n",
btrfs_device_id(devi),
2007-04-11 17:57:55 +00:00
btrfs_device_pathlen(devi),
btrfs_device_pathlen(devi),
(char *)(devi + 1));
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-04-10 16:36:58 +00:00
printf("node %Lu level %d ptrs %d free %u generation %Lu\n",
2007-03-26 15:24:42 +00:00
t->blocknr,
2007-03-12 16:01:18 +00:00
btrfs_header_level(&c->header), nr,
2007-03-26 15:24:42 +00:00
(u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr,
btrfs_header_generation(&c->header));
2007-02-24 11:24:44 +00:00
fflush(stdout);
for (i = 0; i < nr; i++) {
2007-04-18 20:15:47 +00:00
printf("\tkey %d (%Lu %x %Lu) 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.flags,
c->ptrs[i].key.offset,
2007-03-14 18:26:53 +00:00
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
}
}