Add root tree pointer transaction ids
[btrfs-progs-unstable.git] / print-tree.c
blob31a33526bcd6bf93b3ff57693301a2b8c9de2ec7
1 /*
2 * Copyright (C) 2007 Oracle. All rights reserved.
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.
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
13 * You should have received a copy of the GNU General Public
14 * License along with this program; if not, write to the
15 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16 * Boston, MA 021110-1307, USA.
19 #include <stdio.h>
20 #include <stdlib.h>
21 #include <uuid/uuid.h>
22 #include "kerncompat.h"
23 #include "radix-tree.h"
24 #include "ctree.h"
25 #include "disk-io.h"
27 static int print_dir_item(struct extent_buffer *eb, struct btrfs_item *item,
28 struct btrfs_dir_item *di)
30 u32 total;
31 u32 cur = 0;
32 u32 len;
33 u32 name_len;
34 u32 data_len;
35 char namebuf[BTRFS_NAME_LEN];
36 struct btrfs_disk_key location;
38 total = btrfs_item_size(eb, item);
39 while(cur < total) {
40 btrfs_dir_item_key(eb, di, &location);
41 printf("\t\tdir index %llu type %u\n",
42 (unsigned long long)btrfs_disk_key_objectid(&location),
43 btrfs_dir_type(eb, di));
44 name_len = btrfs_dir_name_len(eb, di);
45 data_len = btrfs_dir_data_len(eb, di);
46 len = (name_len <= sizeof(namebuf))? name_len: sizeof(namebuf);
47 read_extent_buffer(eb, namebuf, (unsigned long)(di + 1), len);
48 printf("\t\tnamelen %u datalen %u name: %.*s\n",
49 name_len, data_len, len, namebuf);
50 len = sizeof(*di) + name_len + data_len;
51 di = (struct btrfs_dir_item *)((char *)di + len);
52 cur += len;
54 return 0;
57 static int print_inode_ref_item(struct extent_buffer *eb, struct btrfs_item *item,
58 struct btrfs_inode_ref *ref)
60 u32 total;
61 u32 cur = 0;
62 u32 len;
63 u32 name_len;
64 u64 index;
65 char namebuf[BTRFS_NAME_LEN];
66 total = btrfs_item_size(eb, item);
67 while(cur < total) {
68 name_len = btrfs_inode_ref_name_len(eb, ref);
69 index = btrfs_inode_ref_index(eb, ref);
70 len = (name_len <= sizeof(namebuf))? name_len: sizeof(namebuf);
71 read_extent_buffer(eb, namebuf, (unsigned long)(ref + 1), len);
72 printf("\t\tinode ref index %llu namelen %u name: %.*s\n",
73 index, name_len, len, namebuf);
74 len = sizeof(*ref) + name_len;
75 ref = (struct btrfs_inode_ref *)((char *)ref + len);
76 cur += len;
78 return 0;
81 static void print_chunk(struct extent_buffer *eb, struct btrfs_chunk *chunk)
83 int num_stripes = btrfs_chunk_num_stripes(eb, chunk);
84 int i;
85 printf("\t\tchunk length %llu owner %llu type %llu num_stripes %d\n",
86 (unsigned long long)btrfs_chunk_length(eb, chunk),
87 (unsigned long long)btrfs_chunk_owner(eb, chunk),
88 (unsigned long long)btrfs_chunk_type(eb, chunk),
89 num_stripes);
90 for (i = 0 ; i < num_stripes ; i++) {
91 printf("\t\t\tstripe %d devid %llu offset %llu\n", i,
92 (unsigned long long)btrfs_stripe_devid_nr(eb, chunk, i),
93 (unsigned long long)btrfs_stripe_offset_nr(eb, chunk, i));
96 static void print_dev_item(struct extent_buffer *eb,
97 struct btrfs_dev_item *dev_item)
99 printf("\t\tdev item devid %llu "
100 "total_bytes %llu bytes used %Lu\n",
101 (unsigned long long)btrfs_device_id(eb, dev_item),
102 (unsigned long long)btrfs_device_total_bytes(eb, dev_item),
103 (unsigned long long)btrfs_device_bytes_used(eb, dev_item));
106 static void print_uuids(struct extent_buffer *eb)
108 char fs_uuid[37];
109 char chunk_uuid[37];
110 u8 disk_uuid[BTRFS_UUID_SIZE];
112 read_extent_buffer(eb, disk_uuid, (unsigned long)btrfs_header_fsid(eb),
113 BTRFS_FSID_SIZE);
115 fs_uuid[36] = '\0';
116 uuid_unparse(disk_uuid, fs_uuid);
118 read_extent_buffer(eb, disk_uuid,
119 (unsigned long)btrfs_header_chunk_tree_uuid(eb),
120 BTRFS_UUID_SIZE);
122 chunk_uuid[36] = '\0';
123 uuid_unparse(disk_uuid, chunk_uuid);
124 printf("fs uuid %s\nchunk uuid %s\n", fs_uuid, chunk_uuid);
127 void btrfs_print_leaf(struct btrfs_root *root, struct extent_buffer *l)
129 int i;
130 char *str;
131 struct btrfs_item *item;
132 struct btrfs_extent_item *ei;
133 struct btrfs_root_item *ri;
134 struct btrfs_dir_item *di;
135 struct btrfs_inode_item *ii;
136 struct btrfs_file_extent_item *fi;
137 struct btrfs_csum_item *ci;
138 struct btrfs_block_group_item *bi;
139 struct btrfs_extent_ref *ref;
140 struct btrfs_inode_ref *iref;
141 struct btrfs_dev_extent *dev_extent;
142 struct btrfs_disk_key disk_key;
143 struct btrfs_root_item root_item;
144 struct btrfs_block_group_item bg_item;
145 u32 nr = btrfs_header_nritems(l);
146 u32 type;
148 printf("leaf %llu ptrs %d free space %d generation %llu owner %llu\n",
149 (unsigned long long)btrfs_header_bytenr(l), nr,
150 btrfs_leaf_free_space(root, l),
151 (unsigned long long)btrfs_header_generation(l),
152 (unsigned long long)btrfs_header_owner(l));
153 print_uuids(l);
154 fflush(stdout);
155 for (i = 0 ; i < nr ; i++) {
156 item = btrfs_item_nr(l, i);
157 btrfs_item_key(l, &disk_key, i);
158 type = btrfs_disk_key_type(&disk_key);
159 printf("\titem %d key (%llu %x %llu) itemoff %d itemsize %d\n",
161 (unsigned long long)btrfs_disk_key_objectid(&disk_key),
162 btrfs_disk_key_type(&disk_key),
163 (unsigned long long)btrfs_disk_key_offset(&disk_key),
164 btrfs_item_offset(l, item),
165 btrfs_item_size(l, item));
166 switch (type) {
167 case BTRFS_INODE_ITEM_KEY:
168 ii = btrfs_item_ptr(l, i, struct btrfs_inode_item);
169 printf("\t\tinode generation %llu size %llu block group %llu mode %o links %u\n",
170 (unsigned long long)btrfs_inode_generation(l, ii),
171 (unsigned long long)btrfs_inode_size(l, ii),
172 (unsigned long long)btrfs_inode_block_group(l,ii),
173 btrfs_inode_mode(l, ii),
174 btrfs_inode_nlink(l, ii));
175 break;
176 case BTRFS_INODE_REF_KEY:
177 iref = btrfs_item_ptr(l, i, struct btrfs_inode_ref);
178 print_inode_ref_item(l, item, iref);
179 break;
180 case BTRFS_DIR_ITEM_KEY:
181 case BTRFS_DIR_INDEX_KEY:
182 case BTRFS_XATTR_ITEM_KEY:
183 di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
184 print_dir_item(l, item, di);
185 break;
186 case BTRFS_ORPHAN_ITEM_KEY:
187 printf("\t\torphan item\n");
188 break;
189 case BTRFS_ROOT_ITEM_KEY:
190 ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
191 read_extent_buffer(l, &root_item, (unsigned long)ri, sizeof(root_item));
192 printf("\t\troot data bytenr %llu level %d dirid %llu refs %u\n",
193 (unsigned long long)btrfs_root_bytenr(&root_item),
194 btrfs_root_level(&root_item),
195 (unsigned long long)btrfs_root_dirid(&root_item),
196 btrfs_root_refs(&root_item));
197 if (1 || btrfs_root_refs(&root_item) == 0) {
198 struct btrfs_key drop_key;
199 btrfs_disk_key_to_cpu(&drop_key,
200 &root_item.drop_progress);
201 printf("\t\tdrop key %Lu %x %Lu level %d\n",
202 (unsigned long long)drop_key.objectid,
203 drop_key.type,
204 (unsigned long long)drop_key.offset,
205 root_item.drop_level);
207 break;
208 case BTRFS_EXTENT_ITEM_KEY:
209 ei = btrfs_item_ptr(l, i, struct btrfs_extent_item);
210 printf("\t\textent data refs %u\n",
211 btrfs_extent_refs(l, ei));
212 break;
213 case BTRFS_EXTENT_REF_KEY:
214 ref = btrfs_item_ptr(l, i, struct btrfs_extent_ref);
215 printf("\t\textent back ref root %llu gen %llu "
216 "owner %llu num_refs %lu\n",
217 (unsigned long long)btrfs_ref_root(l, ref),
218 (unsigned long long)btrfs_ref_generation(l, ref),
219 (unsigned long long)btrfs_ref_objectid(l, ref),
220 (unsigned long)btrfs_ref_num_refs(l, ref));
221 break;
222 case BTRFS_CSUM_ITEM_KEY:
223 ci = btrfs_item_ptr(l, i, struct btrfs_csum_item);
224 printf("\t\tcsum item\n");
225 break;
226 case BTRFS_EXTENT_DATA_KEY:
227 fi = btrfs_item_ptr(l, i,
228 struct btrfs_file_extent_item);
229 if (btrfs_file_extent_type(l, fi) ==
230 BTRFS_FILE_EXTENT_INLINE) {
231 printf("\t\tinline extent data size %u "
232 "ram %llu compress %d\n",
233 btrfs_file_extent_inline_len(l, item),
234 (unsigned long long)
235 btrfs_file_extent_ram_bytes(l, fi),
236 btrfs_file_extent_compression(l, fi));
237 break;
239 printf("\t\textent data disk byte %llu nr %llu\n",
240 (unsigned long long)btrfs_file_extent_disk_bytenr(l, fi),
241 (unsigned long long)btrfs_file_extent_disk_num_bytes(l, fi));
242 printf("\t\textent data offset %llu nr %llu ram %llu\n",
243 (unsigned long long)btrfs_file_extent_offset(l, fi),
244 (unsigned long long)btrfs_file_extent_num_bytes(l, fi),
245 (unsigned long long)btrfs_file_extent_ram_bytes(l, fi));
246 printf("\t\textent compression %d\n",
247 btrfs_file_extent_compression(l, fi));
248 break;
249 case BTRFS_BLOCK_GROUP_ITEM_KEY:
250 bi = btrfs_item_ptr(l, i,
251 struct btrfs_block_group_item);
252 read_extent_buffer(l, &bg_item, (unsigned long)bi,
253 sizeof(bg_item));
254 printf("\t\tblock group used %llu flags %llu\n",
255 (unsigned long long)btrfs_block_group_used(&bg_item),
256 (unsigned long long)btrfs_block_group_flags(&bg_item));
257 break;
258 case BTRFS_CHUNK_ITEM_KEY:
259 print_chunk(l, btrfs_item_ptr(l, i, struct btrfs_chunk));
260 break;
261 case BTRFS_DEV_ITEM_KEY:
262 print_dev_item(l, btrfs_item_ptr(l, i,
263 struct btrfs_dev_item));
264 break;
265 case BTRFS_DEV_EXTENT_KEY:
266 dev_extent = btrfs_item_ptr(l, i,
267 struct btrfs_dev_extent);
268 printf("\t\tdev extent chunk_tree %llu\n"
269 "\t\tchunk objectid %llu chunk offset %llu "
270 "length %llu\n",
271 (unsigned long long)
272 btrfs_dev_extent_chunk_tree(l, dev_extent),
273 (unsigned long long)
274 btrfs_dev_extent_chunk_objectid(l, dev_extent),
275 (unsigned long long)
276 btrfs_dev_extent_chunk_offset(l, dev_extent),
277 (unsigned long long)
278 btrfs_dev_extent_length(l, dev_extent));
279 break;
280 case BTRFS_STRING_ITEM_KEY:
281 /* dirty, but it's simple */
282 str = l->data + btrfs_item_ptr_offset(l, i);
283 printf("\t\titem data %.*s\n", btrfs_item_size(l, item), str);
284 break;
286 fflush(stdout);
290 void btrfs_print_tree(struct btrfs_root *root, struct extent_buffer *eb)
292 int i;
293 u32 nr;
294 u32 size;
295 struct btrfs_key key;
297 if (!eb)
298 return;
299 nr = btrfs_header_nritems(eb);
300 if (btrfs_is_leaf(eb)) {
301 btrfs_print_leaf(root, eb);
302 return;
304 printf("node %llu level %d ptrs %d free %u generation %llu owner %llu\n",
305 (unsigned long long)eb->start,
306 btrfs_header_level(eb), nr,
307 (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr,
308 (unsigned long long)btrfs_header_generation(eb),
309 (unsigned long long)btrfs_header_owner(eb));
310 print_uuids(eb);
311 fflush(stdout);
312 size = btrfs_level_size(root, btrfs_header_level(eb) - 1);
313 for (i = 0; i < nr; i++) {
314 u64 blocknr = btrfs_node_blockptr(eb, i);
315 btrfs_node_key_to_cpu(eb, &key, i);
316 printf("\tkey %d (%llu %x %llu) block %llu (%llu) gen %llu\n",
318 (unsigned long long)key.objectid,
319 key.type,
320 (unsigned long long)key.offset,
321 (unsigned long long)blocknr,
322 (unsigned long long)blocknr / size,
323 (unsigned long long)btrfs_node_ptr_generation(eb, i));
324 fflush(stdout);
326 for (i = 0; i < nr; i++) {
327 struct extent_buffer *next = read_tree_block(root,
328 btrfs_node_blockptr(eb, i),
329 size,
330 btrfs_node_ptr_generation(eb, i));
331 if (btrfs_is_leaf(next) &&
332 btrfs_header_level(eb) != 1)
333 BUG();
334 if (btrfs_header_level(next) !=
335 btrfs_header_level(eb) - 1)
336 BUG();
337 btrfs_print_tree(root, next);
338 free_extent_buffer(next);