print-tree.c (a1516c8921ce2c148b69493e858d95bc79c92f01) print-tree.c (62e2749e03a855d98855f9ce032dbe72d5fad148)
1#include <stdio.h>
2#include <stdlib.h>
3#include "kerncompat.h"
4#include "radix-tree.h"
5#include "ctree.h"
6#include "disk-io.h"
7
8void btrfs_print_leaf(struct btrfs_root *root, struct btrfs_leaf *l)
9{
10 int i;
11 u32 nr = btrfs_header_nritems(&l->header);
12 struct btrfs_item *item;
13 struct btrfs_extent_item *ei;
14 struct btrfs_root_item *ri;
1#include <stdio.h>
2#include <stdlib.h>
3#include "kerncompat.h"
4#include "radix-tree.h"
5#include "ctree.h"
6#include "disk-io.h"
7
8void btrfs_print_leaf(struct btrfs_root *root, struct btrfs_leaf *l)
9{
10 int i;
11 u32 nr = btrfs_header_nritems(&l->header);
12 struct btrfs_item *item;
13 struct btrfs_extent_item *ei;
14 struct btrfs_root_item *ri;
15 u32 type;
15 printf("leaf %Lu total ptrs %d free space %d\n",
16 btrfs_header_blocknr(&l->header), nr,
17 btrfs_leaf_free_space(root, l));
18 fflush(stdout);
19 for (i = 0 ; i < nr ; i++) {
20 item = l->items + i;
16 printf("leaf %Lu total ptrs %d free space %d\n",
17 btrfs_header_blocknr(&l->header), nr,
18 btrfs_leaf_free_space(root, l));
19 fflush(stdout);
20 for (i = 0 ; i < nr ; i++) {
21 item = l->items + i;
22 type = btrfs_disk_key_type(&item->key);
21 printf("\titem %d key (%Lu %Lu %u) itemoff %d itemsize %d\n",
22 i,
23 printf("\titem %d key (%Lu %Lu %u) itemoff %d itemsize %d\n",
24 i,
23 btrfs_key_objectid(&item->key),
24 btrfs_key_offset(&item->key),
25 btrfs_key_flags(&item->key),
25 btrfs_disk_key_objectid(&item->key),
26 btrfs_disk_key_offset(&item->key),
27 btrfs_disk_key_flags(&item->key),
26 btrfs_item_offset(item),
27 btrfs_item_size(item));
28 btrfs_item_offset(item),
29 btrfs_item_size(item));
28 printf("\t\titem data %.*s\n", btrfs_item_size(item),
29 btrfs_leaf_data(l) + btrfs_item_offset(item));
30 ei = btrfs_item_ptr(l, i, struct btrfs_extent_item);
31 printf("\t\textent data refs %u owner %Lu\n",
32 btrfs_extent_refs(ei), btrfs_extent_owner(ei));
33 ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
34 printf("\t\troot data blocknr %Lu refs %u\n",
35 btrfs_root_blocknr(ri), btrfs_root_refs(ri));
30 switch (type) {
31 case BTRFS_INODE_ITEM_KEY:
32 break;
33 case BTRFS_DIR_ITEM_KEY:
34 break;
35 case BTRFS_ROOT_ITEM_KEY:
36 ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
37 printf("\t\troot data blocknr %Lu refs %u\n",
38 btrfs_root_blocknr(ri), btrfs_root_refs(ri));
39 break;
40 case BTRFS_EXTENT_ITEM_KEY:
41 ei = btrfs_item_ptr(l, i, struct btrfs_extent_item);
42 printf("\t\textent data refs %u owner %Lu\n",
43 btrfs_extent_refs(ei), btrfs_extent_owner(ei));
44 break;
45 case BTRFS_STRING_ITEM_KEY:
46 printf("\t\titem data %.*s\n", btrfs_item_size(item),
47 btrfs_leaf_data(l) + btrfs_item_offset(item));
48 break;
49 };
36 fflush(stdout);
37 }
38}
39void btrfs_print_tree(struct btrfs_root *root, struct btrfs_buffer *t)
40{
41 int i;
42 u32 nr;
43 struct btrfs_node *c;

--- 37 unchanged lines hidden --- 		50 fflush(stdout);
51 }
52}
53void btrfs_print_tree(struct btrfs_root *root, struct btrfs_buffer *t)
54{
55 int i;
56 u32 nr;
57 struct btrfs_node *c;

--- 37 unchanged lines hidden ---