-#include <stdio.h>
-#include <stdlib.h>
-#include "kerncompat.h"
-#include "radix-tree.h"
+#include <linux/module.h>
#include "ctree.h"
#include "disk-io.h"
+#include "print-tree.h"
-void print_leaf(struct leaf *l)
+void btrfs_print_leaf(struct btrfs_root *root, struct btrfs_leaf *l)
{
int i;
- int nr = l->header.nritems;
- struct item *item;
- struct extent_item *ei;
- printf("leaf %Lu total ptrs %d free space %d\n", l->header.blocknr, nr,
- leaf_free_space(l));
- fflush(stdout);
+ u32 nr = btrfs_header_nritems(&l->header);
+ struct btrfs_item *item;
+ struct btrfs_extent_item *ei;
+ struct btrfs_root_item *ri;
+ struct btrfs_dir_item *di;
+ struct btrfs_inode_item *ii;
+ struct btrfs_block_group_item *bi;
+ u32 type;
+
+ printk("leaf %Lu total ptrs %d free space %d\n",
+ btrfs_header_blocknr(&l->header), nr,
+ btrfs_leaf_free_space(root, l));
for (i = 0 ; i < nr ; i++) {
item = l->items + i;
- printf("\titem %d key (%Lu %u %Lu) itemoff %d itemsize %d\n",
+ type = btrfs_disk_key_type(&item->key);
+ printk("\titem %d key (%Lu %x %Lu) itemoff %d itemsize %d\n",
i,
- item->key.objectid, item->key.flags, item->key.offset,
- item->offset, item->size);
- fflush(stdout);
- printf("\t\titem data %.*s\n", item->size, l->data+item->offset);
- ei = (struct extent_item *)(l->data + item->offset);
- printf("\t\textent data %u %Lu\n", ei->refs, ei->owner);
- fflush(stdout);
+ btrfs_disk_key_objectid(&item->key),
+ btrfs_disk_key_flags(&item->key),
+ btrfs_disk_key_offset(&item->key),
+ btrfs_item_offset(item),
+ btrfs_item_size(item));
+ switch (type) {
+ case BTRFS_INODE_ITEM_KEY:
+ ii = btrfs_item_ptr(l, i, struct btrfs_inode_item);
+ printk("\t\tinode generation %Lu size %Lu mode %o\n",
+ btrfs_inode_generation(ii),
+ btrfs_inode_size(ii),
+ btrfs_inode_mode(ii));
+ break;
+ case BTRFS_DIR_ITEM_KEY:
+ di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
+ printk("\t\tdir oid %Lu flags %u type %u\n",
+ btrfs_disk_key_objectid(&di->location),
+ btrfs_dir_flags(di),
+ btrfs_dir_type(di));
+ printk("\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);
+ printk("\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);
+ printk("\t\textent data refs %u\n",
+ btrfs_extent_refs(ei));
+ break;
+ case BTRFS_BLOCK_GROUP_ITEM_KEY:
+ bi = btrfs_item_ptr(l, i,
+ struct btrfs_block_group_item);
+ printk("\t\tblock group used %Lu\n",
+ btrfs_block_group_used(bi));
+ break;
+ case BTRFS_STRING_ITEM_KEY:
+ printk("\t\titem data %.*s\n", btrfs_item_size(item),
+ btrfs_leaf_data(l) + btrfs_item_offset(item));
+ break;
+ };
}
}
-void print_tree(struct ctree_root *root, struct tree_buffer *t)
+
+void btrfs_print_tree(struct btrfs_root *root, struct buffer_head *t)
{
int i;
- int nr;
- struct node *c;
+ u32 nr;
+ struct btrfs_node *c;
if (!t)
return;
- c = &t->node;
- nr = c->header.nritems;
- if (c->header.blocknr != t->blocknr)
- BUG();
- if (is_leaf(c->header.flags)) {
- print_leaf((struct leaf *)c);
+ c = btrfs_buffer_node(t);
+ nr = btrfs_header_nritems(&c->header);
+ if (btrfs_is_leaf(c)) {
+ btrfs_print_leaf(root, (struct btrfs_leaf *)c);
return;
}
- printf("node %Lu level %d total ptrs %d free spc %u\n", t->blocknr,
- node_level(c->header.flags), c->header.nritems,
- (u32)NODEPTRS_PER_BLOCK - c->header.nritems);
- fflush(stdout);
+ printk("node %Lu level %d total ptrs %d free spc %u\n",
+ btrfs_header_blocknr(&c->header),
+ btrfs_header_level(&c->header), nr,
+ (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr);
for (i = 0; i < nr; i++) {
- printf("\tkey %d (%Lu %u %Lu) block %Lu\n",
+ printk("\tkey %d (%Lu %u %Lu) block %Lu\n",
i,
- c->keys[i].objectid, c->keys[i].flags, c->keys[i].offset,
- c->blockptrs[i]);
- fflush(stdout);
+ c->ptrs[i].key.objectid,
+ c->ptrs[i].key.flags,
+ c->ptrs[i].key.offset,
+ btrfs_node_blockptr(c, i));
}
for (i = 0; i < nr; i++) {
- struct tree_buffer *next_buf = read_tree_block(root,
- c->blockptrs[i]);
- struct node *next = &next_buf->node;
- if (is_leaf(next->header.flags) &&
- node_level(c->header.flags) != 1)
+ struct buffer_head *next_buf = read_tree_block(root,
+ btrfs_node_blockptr(c, i));
+ struct btrfs_node *next = btrfs_buffer_node(next_buf);
+ if (btrfs_is_leaf(next) &&
+ btrfs_header_level(&c->header) != 1)
BUG();
- if (node_level(next->header.flags) !=
- node_level(c->header.flags) - 1)
+ if (btrfs_header_level(&next->header) !=
+ btrfs_header_level(&c->header) - 1)
BUG();
- print_tree(root, next_buf);
- tree_block_release(root, next_buf);
+ btrfs_print_tree(root, next_buf);
+ btrfs_block_release(root, next_buf);
}
-
}
projects / linux-2.6-omap-h63xx.git / blobdiff