aboutsummaryrefslogtreecommitdiffstats
path: root/fs/btrfs/print-tree.c
diff options
context:
space:
mode:
authorChris Mason <chris.mason@oracle.com>2007-02-26 10:55:01 -0500
committerDavid Woodhouse <dwmw2@hera.kernel.org>2007-02-26 10:55:01 -0500
commit7cf75962acd27ed0f819df791486e7b803c7109c (patch)
treec8e85b451c563355906d80561679492acfd482f1 /fs/btrfs/print-tree.c
parentc673024aba596e57c07196cb3400cdcc9d28f3aa (diff)
Btrfs: u64 cleanups
Signed-off-by: Chris Mason <chris.mason@oracle.com>
Diffstat (limited to 'fs/btrfs/print-tree.c')
-rw-r--r--fs/btrfs/print-tree.c10
1 files changed, 5 insertions, 5 deletions
diff --git a/fs/btrfs/print-tree.c b/fs/btrfs/print-tree.c
index 594d23b5b24c..1d591270f4c4 100644
--- a/fs/btrfs/print-tree.c
+++ b/fs/btrfs/print-tree.c
@@ -11,19 +11,19 @@ void print_leaf(struct leaf *l)
11 int nr = l->header.nritems; 11 int nr = l->header.nritems;
12 struct item *item; 12 struct item *item;
13 struct extent_item *ei; 13 struct extent_item *ei;
14 printf("leaf %lu total ptrs %d free space %d\n", l->header.blocknr, nr, 14 printf("leaf %Lu total ptrs %d free space %d\n", l->header.blocknr, nr,
15 leaf_free_space(l)); 15 leaf_free_space(l));
16 fflush(stdout); 16 fflush(stdout);
17 for (i = 0 ; i < nr ; i++) { 17 for (i = 0 ; i < nr ; i++) {
18 item = l->items + i; 18 item = l->items + i;
19 printf("\titem %d key (%lu %u %lu) itemoff %d itemsize %d\n", 19 printf("\titem %d key (%Lu %u %Lu) itemoff %d itemsize %d\n",
20 i, 20 i,
21 item->key.objectid, item->key.flags, item->key.offset, 21 item->key.objectid, item->key.flags, item->key.offset,
22 item->offset, item->size); 22 item->offset, item->size);
23 fflush(stdout); 23 fflush(stdout);
24 printf("\t\titem data %.*s\n", item->size, l->data+item->offset); 24 printf("\t\titem data %.*s\n", item->size, l->data+item->offset);
25 ei = (struct extent_item *)(l->data + item->offset); 25 ei = (struct extent_item *)(l->data + item->offset);
26 printf("\t\textent data %u %lu\n", ei->refs, ei->owner); 26 printf("\t\textent data %u %Lu\n", ei->refs, ei->owner);
27 fflush(stdout); 27 fflush(stdout);
28 } 28 }
29} 29}
@@ -43,12 +43,12 @@ void print_tree(struct ctree_root *root, struct tree_buffer *t)
43 print_leaf((struct leaf *)c); 43 print_leaf((struct leaf *)c);
44 return; 44 return;
45 } 45 }
46 printf("node %lu level %d total ptrs %d free spc %lu\n", t->blocknr, 46 printf("node %Lu level %d total ptrs %d free spc %lu\n", t->blocknr,
47 node_level(c->header.flags), c->header.nritems, 47 node_level(c->header.flags), c->header.nritems,
48 NODEPTRS_PER_BLOCK - c->header.nritems); 48 NODEPTRS_PER_BLOCK - c->header.nritems);
49 fflush(stdout); 49 fflush(stdout);
50 for (i = 0; i < nr; i++) { 50 for (i = 0; i < nr; i++) {
51 printf("\tkey %d (%lu %u %lu) block %lu\n", 51 printf("\tkey %d (%Lu %u %Lu) block %Lu\n",
52 i, 52 i,
53 c->keys[i].objectid, c->keys[i].flags, c->keys[i].offset, 53 c->keys[i].objectid, c->keys[i].flags, c->keys[i].offset,
54 c->blockptrs[i]); 54 c->blockptrs[i]);