print-tree.c (5f39d397dfbe140a14edecd4e73c34ce23c4f9ee) print-tree.c (db94535db75e67fab12ccbb7f5ee548e33fed891)
1/*
2 * Copyright (C) 2007 Oracle. All rights reserved.
3 *
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
7 *
8 * This program is distributed in the hope that it will be useful,

--- 22 unchanged lines hidden (view full) ---

31 struct btrfs_inode_item *ii;
32 struct btrfs_block_group_item *bi;
33 struct btrfs_file_extent_item *fi;
34 struct btrfs_key key;
35 struct btrfs_key found_key;
36 u32 type;
37
38 printk("leaf %llu total ptrs %d free space %d\n",
1/*
2 * Copyright (C) 2007 Oracle. All rights reserved.
3 *
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
7 *
8 * This program is distributed in the hope that it will be useful,

--- 22 unchanged lines hidden (view full) ---

31 struct btrfs_inode_item *ii;
32 struct btrfs_block_group_item *bi;
33 struct btrfs_file_extent_item *fi;
34 struct btrfs_key key;
35 struct btrfs_key found_key;
36 u32 type;
37
38 printk("leaf %llu total ptrs %d free space %d\n",
39 (unsigned long long)btrfs_header_blocknr(l), nr,
39 (unsigned long long)btrfs_header_bytenr(l), nr,
40 btrfs_leaf_free_space(root, l));
41 for (i = 0 ; i < nr ; i++) {
42 item = btrfs_item_nr(l, i);
43 btrfs_item_key_to_cpu(l, &key, i);
44 type = btrfs_key_type(&key);
45 printk("\titem %d key (%llu %x %llu) itemoff %d itemsize %d\n",
46 i,
47 (unsigned long long)key.objectid, type,

--- 12 unchanged lines hidden (view full) ---

60 btrfs_dir_item_key_to_cpu(l, di, &found_key);
61 printk("\t\tdir oid %llu flags %u type %u\n",
62 (unsigned long long)found_key.objectid,
63 btrfs_dir_flags(l, di),
64 btrfs_dir_type(l, di));
65 break;
66 case BTRFS_ROOT_ITEM_KEY:
67 ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
40 btrfs_leaf_free_space(root, l));
41 for (i = 0 ; i < nr ; i++) {
42 item = btrfs_item_nr(l, i);
43 btrfs_item_key_to_cpu(l, &key, i);
44 type = btrfs_key_type(&key);
45 printk("\titem %d key (%llu %x %llu) itemoff %d itemsize %d\n",
46 i,
47 (unsigned long long)key.objectid, type,

--- 12 unchanged lines hidden (view full) ---

60 btrfs_dir_item_key_to_cpu(l, di, &found_key);
61 printk("\t\tdir oid %llu flags %u type %u\n",
62 (unsigned long long)found_key.objectid,
63 btrfs_dir_flags(l, di),
64 btrfs_dir_type(l, di));
65 break;
66 case BTRFS_ROOT_ITEM_KEY:
67 ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
68 printk("\t\troot data blocknr %llu refs %u\n",
69 (unsigned long long)btrfs_disk_root_blocknr(l, ri),
68 printk("\t\troot data bytenr %llu refs %u\n",
69 (unsigned long long)btrfs_disk_root_bytenr(l, ri),
70 btrfs_disk_root_refs(l, ri));
71 break;
72 case BTRFS_EXTENT_ITEM_KEY:
73 ei = btrfs_item_ptr(l, i, struct btrfs_extent_item);
74 printk("\t\textent data refs %u\n",
75 btrfs_extent_refs(l, ei));
76 break;
77
78 case BTRFS_EXTENT_DATA_KEY:
79 fi = btrfs_item_ptr(l, i,
80 struct btrfs_file_extent_item);
81 if (btrfs_file_extent_type(l, fi) ==
82 BTRFS_FILE_EXTENT_INLINE) {
83 printk("\t\tinline extent data size %u\n",
84 btrfs_file_extent_inline_len(l, item));
85 break;
86 }
70 btrfs_disk_root_refs(l, ri));
71 break;
72 case BTRFS_EXTENT_ITEM_KEY:
73 ei = btrfs_item_ptr(l, i, struct btrfs_extent_item);
74 printk("\t\textent data refs %u\n",
75 btrfs_extent_refs(l, ei));
76 break;
77
78 case BTRFS_EXTENT_DATA_KEY:
79 fi = btrfs_item_ptr(l, i,
80 struct btrfs_file_extent_item);
81 if (btrfs_file_extent_type(l, fi) ==
82 BTRFS_FILE_EXTENT_INLINE) {
83 printk("\t\tinline extent data size %u\n",
84 btrfs_file_extent_inline_len(l, item));
85 break;
86 }
87 printk("\t\textent data disk block %llu nr %llu\n",
88 (unsigned long long)btrfs_file_extent_disk_blocknr(l, fi),
89 (unsigned long long)btrfs_file_extent_disk_num_blocks(l, fi));
87 printk("\t\textent data disk bytenr %llu nr %llu\n",
88 (unsigned long long)btrfs_file_extent_disk_bytenr(l, fi),
89 (unsigned long long)btrfs_file_extent_disk_num_bytes(l, fi));
90 printk("\t\textent data offset %llu nr %llu\n",
91 (unsigned long long)btrfs_file_extent_offset(l, fi),
90 printk("\t\textent data offset %llu nr %llu\n",
91 (unsigned long long)btrfs_file_extent_offset(l, fi),
92 (unsigned long long)btrfs_file_extent_num_blocks(l, fi));
92 (unsigned long long)btrfs_file_extent_num_bytes(l, fi));
93 break;
94 case BTRFS_BLOCK_GROUP_ITEM_KEY:
95 bi = btrfs_item_ptr(l, i,
96 struct btrfs_block_group_item);
97 printk("\t\tblock group used %llu\n",
98 (unsigned long long)btrfs_disk_block_group_used(l, bi));
99 break;
100 };
101 }
102}
103
104void btrfs_print_tree(struct btrfs_root *root, struct extent_buffer *c)
105{
106 int i;
107 u32 nr;
108 struct btrfs_key key;
93 break;
94 case BTRFS_BLOCK_GROUP_ITEM_KEY:
95 bi = btrfs_item_ptr(l, i,
96 struct btrfs_block_group_item);
97 printk("\t\tblock group used %llu\n",
98 (unsigned long long)btrfs_disk_block_group_used(l, bi));
99 break;
100 };
101 }
102}
103
104void btrfs_print_tree(struct btrfs_root *root, struct extent_buffer *c)
105{
106 int i;
107 u32 nr;
108 struct btrfs_key key;
109 int level;
109
110 if (!c)
111 return;
112 nr = btrfs_header_nritems(c);
110
111 if (!c)
112 return;
113 nr = btrfs_header_nritems(c);
113 if (btrfs_is_leaf(c)) {
114 level = btrfs_header_level(c);
115 if (level == 0) {
114 btrfs_print_leaf(root, c);
115 return;
116 }
117 printk("node %llu level %d total ptrs %d free spc %u\n",
116 btrfs_print_leaf(root, c);
117 return;
118 }
119 printk("node %llu level %d total ptrs %d free spc %u\n",
118 (unsigned long long)btrfs_header_blocknr(c),
120 (unsigned long long)btrfs_header_bytenr(c),
119 btrfs_header_level(c), nr,
120 (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr);
121 for (i = 0; i < nr; i++) {
122 btrfs_node_key_to_cpu(c, &key, i);
123 printk("\tkey %d (%llu %u %llu) block %llu\n",
124 i,
125 (unsigned long long)key.objectid,
126 key.type,
127 (unsigned long long)key.offset,
128 (unsigned long long)btrfs_node_blockptr(c, i));
129 }
130 for (i = 0; i < nr; i++) {
131 struct extent_buffer *next = read_tree_block(root,
121 btrfs_header_level(c), nr,
122 (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr);
123 for (i = 0; i < nr; i++) {
124 btrfs_node_key_to_cpu(c, &key, i);
125 printk("\tkey %d (%llu %u %llu) block %llu\n",
126 i,
127 (unsigned long long)key.objectid,
128 key.type,
129 (unsigned long long)key.offset,
130 (unsigned long long)btrfs_node_blockptr(c, i));
131 }
132 for (i = 0; i < nr; i++) {
133 struct extent_buffer *next = read_tree_block(root,
132 btrfs_node_blockptr(c, i));
134 btrfs_node_blockptr(c, i),
135 btrfs_level_size(root, level - 1));
133 if (btrfs_is_leaf(next) &&
134 btrfs_header_level(c) != 1)
135 BUG();
136 if (btrfs_header_level(next) !=
137 btrfs_header_level(c) - 1)
138 BUG();
139 btrfs_print_tree(root, next);
140 free_extent_buffer(next);
141 }
142}
143
136 if (btrfs_is_leaf(next) &&
137 btrfs_header_level(c) != 1)
138 BUG();
139 if (btrfs_header_level(next) !=
140 btrfs_header_level(c) - 1)
141 BUG();
142 btrfs_print_tree(root, next);
143 free_extent_buffer(next);
144 }
145}
146