btrfs-progs: fsck: understand the -s option
[btrfs-progs-unstable/devel.git] / print-tree.c
blob89fc5b4620c74dd9d7c0204a1a9382418a71184f
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"
26 #include "print-tree.h"
28 static int print_dir_item(struct extent_buffer *eb, struct btrfs_item *item,
29 struct btrfs_dir_item *di)
31 u32 total;
32 u32 cur = 0;
33 u32 len;
34 u32 name_len;
35 u32 data_len;
36 char namebuf[BTRFS_NAME_LEN];
37 struct btrfs_disk_key location;
39 total = btrfs_item_size(eb, item);
40 while(cur < total) {
41 btrfs_dir_item_key(eb, di, &location);
42 printf("\t\tlocation ");
43 btrfs_print_key(&location);
44 printf(" type %u\n", btrfs_dir_type(eb, di));
45 name_len = btrfs_dir_name_len(eb, di);
46 data_len = btrfs_dir_data_len(eb, di);
47 len = (name_len <= sizeof(namebuf))? name_len: sizeof(namebuf);
48 read_extent_buffer(eb, namebuf, (unsigned long)(di + 1), len);
49 printf("\t\tnamelen %u datalen %u name: %.*s\n",
50 name_len, data_len, len, namebuf);
51 if (data_len) {
52 len = (data_len <= sizeof(namebuf))? data_len: sizeof(namebuf);
53 read_extent_buffer(eb, namebuf,
54 (unsigned long)(di + 1) + name_len, len);
55 printf("\t\tdata %.*s\n", len, namebuf);
57 len = sizeof(*di) + name_len + data_len;
58 di = (struct btrfs_dir_item *)((char *)di + len);
59 cur += len;
61 return 0;
64 static int print_inode_ref_item(struct extent_buffer *eb, struct btrfs_item *item,
65 struct btrfs_inode_ref *ref)
67 u32 total;
68 u32 cur = 0;
69 u32 len;
70 u32 name_len;
71 u64 index;
72 char namebuf[BTRFS_NAME_LEN];
73 total = btrfs_item_size(eb, item);
74 while(cur < total) {
75 name_len = btrfs_inode_ref_name_len(eb, ref);
76 index = btrfs_inode_ref_index(eb, ref);
77 len = (name_len <= sizeof(namebuf))? name_len: sizeof(namebuf);
78 read_extent_buffer(eb, namebuf, (unsigned long)(ref + 1), len);
79 printf("\t\tinode ref index %llu namelen %u name: %.*s\n",
80 (unsigned long long)index, name_len, len, namebuf);
81 len = sizeof(*ref) + name_len;
82 ref = (struct btrfs_inode_ref *)((char *)ref + len);
83 cur += len;
85 return 0;
88 static void print_chunk(struct extent_buffer *eb, struct btrfs_chunk *chunk)
90 int num_stripes = btrfs_chunk_num_stripes(eb, chunk);
91 int i;
92 printf("\t\tchunk length %llu owner %llu type %llu num_stripes %d\n",
93 (unsigned long long)btrfs_chunk_length(eb, chunk),
94 (unsigned long long)btrfs_chunk_owner(eb, chunk),
95 (unsigned long long)btrfs_chunk_type(eb, chunk),
96 num_stripes);
97 for (i = 0 ; i < num_stripes ; i++) {
98 printf("\t\t\tstripe %d devid %llu offset %llu\n", i,
99 (unsigned long long)btrfs_stripe_devid_nr(eb, chunk, i),
100 (unsigned long long)btrfs_stripe_offset_nr(eb, chunk, i));
104 static void print_dev_item(struct extent_buffer *eb,
105 struct btrfs_dev_item *dev_item)
107 printf("\t\tdev item devid %llu "
108 "total_bytes %llu bytes used %Lu\n",
109 (unsigned long long)btrfs_device_id(eb, dev_item),
110 (unsigned long long)btrfs_device_total_bytes(eb, dev_item),
111 (unsigned long long)btrfs_device_bytes_used(eb, dev_item));
114 static void print_uuids(struct extent_buffer *eb)
116 char fs_uuid[37];
117 char chunk_uuid[37];
118 u8 disk_uuid[BTRFS_UUID_SIZE];
120 read_extent_buffer(eb, disk_uuid, (unsigned long)btrfs_header_fsid(eb),
121 BTRFS_FSID_SIZE);
123 fs_uuid[36] = '\0';
124 uuid_unparse(disk_uuid, fs_uuid);
126 read_extent_buffer(eb, disk_uuid,
127 (unsigned long)btrfs_header_chunk_tree_uuid(eb),
128 BTRFS_UUID_SIZE);
130 chunk_uuid[36] = '\0';
131 uuid_unparse(disk_uuid, chunk_uuid);
132 printf("fs uuid %s\nchunk uuid %s\n", fs_uuid, chunk_uuid);
135 static void print_file_extent_item(struct extent_buffer *eb,
136 struct btrfs_item *item,
137 struct btrfs_file_extent_item *fi)
139 int extent_type = btrfs_file_extent_type(eb, fi);
141 if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
142 printf("\t\tinline extent data size %u "
143 "ram %u compress %d\n",
144 btrfs_file_extent_inline_item_len(eb, item),
145 btrfs_file_extent_inline_len(eb, fi),
146 btrfs_file_extent_compression(eb, fi));
147 return;
149 if (extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
150 printf("\t\tprealloc data disk byte %llu nr %llu\n",
151 (unsigned long long)btrfs_file_extent_disk_bytenr(eb, fi),
152 (unsigned long long)btrfs_file_extent_disk_num_bytes(eb, fi));
153 printf("\t\tprealloc data offset %llu nr %llu\n",
154 (unsigned long long)btrfs_file_extent_offset(eb, fi),
155 (unsigned long long)btrfs_file_extent_num_bytes(eb, fi));
156 return;
158 printf("\t\textent data disk byte %llu nr %llu\n",
159 (unsigned long long)btrfs_file_extent_disk_bytenr(eb, fi),
160 (unsigned long long)btrfs_file_extent_disk_num_bytes(eb, fi));
161 printf("\t\textent data offset %llu nr %llu ram %llu\n",
162 (unsigned long long)btrfs_file_extent_offset(eb, fi),
163 (unsigned long long)btrfs_file_extent_num_bytes(eb, fi),
164 (unsigned long long)btrfs_file_extent_ram_bytes(eb, fi));
165 printf("\t\textent compression %d\n",
166 btrfs_file_extent_compression(eb, fi));
169 static void print_extent_item(struct extent_buffer *eb, int slot)
171 struct btrfs_extent_item *ei;
172 struct btrfs_extent_inline_ref *iref;
173 struct btrfs_extent_data_ref *dref;
174 struct btrfs_shared_data_ref *sref;
175 struct btrfs_disk_key key;
176 unsigned long end;
177 unsigned long ptr;
178 int type;
179 u32 item_size = btrfs_item_size_nr(eb, slot);
180 u64 flags;
181 u64 offset;
183 if (item_size < sizeof(*ei)) {
184 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
185 struct btrfs_extent_item_v0 *ei0;
186 BUG_ON(item_size != sizeof(*ei0));
187 ei0 = btrfs_item_ptr(eb, slot, struct btrfs_extent_item_v0);
188 printf("\t\textent refs %u\n",
189 btrfs_extent_refs_v0(eb, ei0));
190 return;
191 #else
192 BUG();
193 #endif
196 ei = btrfs_item_ptr(eb, slot, struct btrfs_extent_item);
197 flags = btrfs_extent_flags(eb, ei);
199 printf("\t\textent refs %llu gen %llu flags %llu\n",
200 (unsigned long long)btrfs_extent_refs(eb, ei),
201 (unsigned long long)btrfs_extent_generation(eb, ei),
202 (unsigned long long)flags);
204 if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) {
205 struct btrfs_tree_block_info *info;
206 info = (struct btrfs_tree_block_info *)(ei + 1);
207 btrfs_tree_block_key(eb, info, &key);
208 printf("\t\ttree block key (%llu %x %llu) level %d\n",
209 (unsigned long long)btrfs_disk_key_objectid(&key),
210 key.type,
211 (unsigned long long)btrfs_disk_key_offset(&key),
212 btrfs_tree_block_level(eb, info));
213 iref = (struct btrfs_extent_inline_ref *)(info + 1);
214 } else {
215 iref = (struct btrfs_extent_inline_ref *)(ei + 1);
218 ptr = (unsigned long)iref;
219 end = (unsigned long)ei + item_size;
220 while (ptr < end) {
221 iref = (struct btrfs_extent_inline_ref *)ptr;
222 type = btrfs_extent_inline_ref_type(eb, iref);
223 offset = btrfs_extent_inline_ref_offset(eb, iref);
224 switch (type) {
225 case BTRFS_TREE_BLOCK_REF_KEY:
226 printf("\t\ttree block backref root %llu\n",
227 (unsigned long long)offset);
228 break;
229 case BTRFS_SHARED_BLOCK_REF_KEY:
230 printf("\t\tshared block backref parent %llu\n",
231 (unsigned long long)offset);
232 break;
233 case BTRFS_EXTENT_DATA_REF_KEY:
234 dref = (struct btrfs_extent_data_ref *)(&iref->offset);
235 printf("\t\textent data backref root %llu "
236 "objectid %llu offset %llu count %u\n",
237 (unsigned long long)btrfs_extent_data_ref_root(eb, dref),
238 (unsigned long long)btrfs_extent_data_ref_objectid(eb, dref),
239 (unsigned long long)btrfs_extent_data_ref_offset(eb, dref),
240 btrfs_extent_data_ref_count(eb, dref));
241 break;
242 case BTRFS_SHARED_DATA_REF_KEY:
243 sref = (struct btrfs_shared_data_ref *)(iref + 1);
244 printf("\t\tshared data backref parent %llu count %u\n",
245 (unsigned long long)offset,
246 btrfs_shared_data_ref_count(eb, sref));
247 break;
248 default:
249 return;
251 ptr += btrfs_extent_inline_ref_size(type);
253 WARN_ON(ptr > end);
256 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
257 static void print_extent_ref_v0(struct extent_buffer *eb, int slot)
259 struct btrfs_extent_ref_v0 *ref0;
261 ref0 = btrfs_item_ptr(eb, slot, struct btrfs_extent_ref_v0);
262 printf("\t\textent back ref root %llu gen %llu "
263 "owner %llu num_refs %lu\n",
264 (unsigned long long)btrfs_ref_root_v0(eb, ref0),
265 (unsigned long long)btrfs_ref_generation_v0(eb, ref0),
266 (unsigned long long)btrfs_ref_objectid_v0(eb, ref0),
267 (unsigned long)btrfs_ref_count_v0(eb, ref0));
269 #endif
271 static void print_root_ref(struct extent_buffer *leaf, int slot, char *tag)
273 struct btrfs_root_ref *ref;
274 char namebuf[BTRFS_NAME_LEN];
275 int namelen;
277 ref = btrfs_item_ptr(leaf, slot, struct btrfs_root_ref);
278 namelen = btrfs_root_ref_name_len(leaf, ref);
279 read_extent_buffer(leaf, namebuf, (unsigned long)(ref + 1), namelen);
280 printf("\t\troot %s key dirid %llu sequence %llu name %.*s\n", tag,
281 (unsigned long long)btrfs_root_ref_dirid(leaf, ref),
282 (unsigned long long)btrfs_root_ref_sequence(leaf, ref),
283 namelen, namebuf);
286 static int count_bytes(void *buf, int len, char b)
288 int cnt = 0;
289 int i;
290 for (i = 0; i < len; i++) {
291 if (((char*)buf)[i] == b)
292 cnt++;
294 return cnt;
297 static void print_root(struct extent_buffer *leaf, int slot)
299 struct btrfs_root_item *ri;
300 struct btrfs_root_item root_item;
301 int len;
302 char uuid_str[128];
304 ri = btrfs_item_ptr(leaf, slot, struct btrfs_root_item);
305 len = btrfs_item_size_nr(leaf, slot);
307 memset(&root_item, 0, sizeof(root_item));
308 read_extent_buffer(leaf, &root_item, (unsigned long)ri, len);
310 printf("\t\troot data bytenr %llu level %d dirid %llu refs %u gen %llu\n",
311 (unsigned long long)btrfs_root_bytenr(&root_item),
312 btrfs_root_level(&root_item),
313 (unsigned long long)btrfs_root_dirid(&root_item),
314 btrfs_root_refs(&root_item),
315 (unsigned long long)btrfs_root_generation(&root_item));
317 if (root_item.generation == root_item.generation_v2) {
318 uuid_unparse(root_item.uuid, uuid_str);
319 printf("\t\tuuid %s\n", uuid_str);
320 if (count_bytes(root_item.parent_uuid, BTRFS_UUID_SIZE, 0) != BTRFS_UUID_SIZE) {
321 uuid_unparse(root_item.parent_uuid, uuid_str);
322 printf("\t\tparent_uuid %s\n", uuid_str);
324 if (count_bytes(root_item.received_uuid, BTRFS_UUID_SIZE, 0) != BTRFS_UUID_SIZE) {
325 uuid_unparse(root_item.received_uuid, uuid_str);
326 printf("\t\treceived_uuid %s\n", uuid_str);
328 if (root_item.ctransid) {
329 printf("\t\tctransid %llu otransid %llu stransid %llu rtransid %llu\n",
330 btrfs_root_ctransid(&root_item),
331 btrfs_root_otransid(&root_item),
332 btrfs_root_stransid(&root_item),
333 btrfs_root_rtransid(&root_item));
336 if (btrfs_root_refs(&root_item) == 0) {
337 struct btrfs_key drop_key;
338 btrfs_disk_key_to_cpu(&drop_key,
339 &root_item.drop_progress);
340 printf("\t\tdrop ");
341 btrfs_print_key(&root_item.drop_progress);
342 printf(" level %d\n", root_item.drop_level);
346 static void print_free_space_header(struct extent_buffer *leaf, int slot)
348 struct btrfs_free_space_header *header;
349 struct btrfs_disk_key location;
351 header = btrfs_item_ptr(leaf, slot, struct btrfs_free_space_header);
352 btrfs_free_space_key(leaf, header, &location);
353 printf("\t\tlocation ");
354 btrfs_print_key(&location);
355 printf("\n");
356 printf("\t\tcache generation %llu entries %llu bitmaps %llu\n",
357 (unsigned long long)btrfs_free_space_generation(leaf, header),
358 (unsigned long long)btrfs_free_space_entries(leaf, header),
359 (unsigned long long)btrfs_free_space_bitmaps(leaf, header));
362 static void print_key_type(u64 objectid, u8 type)
364 if (type == 0 && objectid == BTRFS_FREE_SPACE_OBJECTID) {
365 printf("UNTYPED");
366 return;
369 switch (type) {
370 case BTRFS_INODE_ITEM_KEY:
371 printf("INODE_ITEM");
372 break;
373 case BTRFS_INODE_REF_KEY:
374 printf("INODE_REF");
375 break;
376 case BTRFS_DIR_ITEM_KEY:
377 printf("DIR_ITEM");
378 break;
379 case BTRFS_DIR_INDEX_KEY:
380 printf("DIR_INDEX");
381 break;
382 case BTRFS_DIR_LOG_ITEM_KEY:
383 printf("DIR_LOG_ITEM");
384 break;
385 case BTRFS_DIR_LOG_INDEX_KEY:
386 printf("DIR_LOG_INDEX");
387 break;
388 case BTRFS_XATTR_ITEM_KEY:
389 printf("XATTR_ITEM");
390 break;
391 case BTRFS_ORPHAN_ITEM_KEY:
392 printf("ORPHAN_ITEM");
393 break;
394 case BTRFS_ROOT_ITEM_KEY:
395 printf("ROOT_ITEM");
396 break;
397 case BTRFS_ROOT_REF_KEY:
398 printf("ROOT_REF");
399 break;
400 case BTRFS_ROOT_BACKREF_KEY:
401 printf("ROOT_BACKREF");
402 break;
403 case BTRFS_EXTENT_ITEM_KEY:
404 printf("EXTENT_ITEM");
405 break;
406 case BTRFS_TREE_BLOCK_REF_KEY:
407 printf("TREE_BLOCK_REF");
408 break;
409 case BTRFS_SHARED_BLOCK_REF_KEY:
410 printf("SHARED_BLOCK_REF");
411 break;
412 case BTRFS_EXTENT_DATA_REF_KEY:
413 printf("EXTENT_DATA_REF");
414 break;
415 case BTRFS_SHARED_DATA_REF_KEY:
416 printf("SHARED_DATA_REF");
417 break;
418 case BTRFS_EXTENT_REF_V0_KEY:
419 printf("EXTENT_REF_V0");
420 break;
421 case BTRFS_CSUM_ITEM_KEY:
422 printf("CSUM_ITEM");
423 break;
424 case BTRFS_EXTENT_CSUM_KEY:
425 printf("EXTENT_CSUM");
426 break;
427 case BTRFS_EXTENT_DATA_KEY:
428 printf("EXTENT_DATA");
429 break;
430 case BTRFS_BLOCK_GROUP_ITEM_KEY:
431 printf("BLOCK_GROUP_ITEM");
432 break;
433 case BTRFS_CHUNK_ITEM_KEY:
434 printf("CHUNK_ITEM");
435 break;
436 case BTRFS_DEV_ITEM_KEY:
437 printf("DEV_ITEM");
438 break;
439 case BTRFS_DEV_EXTENT_KEY:
440 printf("DEV_EXTENT");
441 break;
442 case BTRFS_BALANCE_ITEM_KEY:
443 printf("BALANCE_ITEM");
444 break;
445 case BTRFS_STRING_ITEM_KEY:
446 printf("STRING_ITEM");
447 break;
448 case BTRFS_QGROUP_STATUS_KEY:
449 printf("BTRFS_STATUS_KEY");
450 break;
451 case BTRFS_QGROUP_RELATION_KEY:
452 printf("BTRFS_QGROUP_RELATION_KEY");
453 break;
454 case BTRFS_QGROUP_INFO_KEY:
455 printf("BTRFS_QGROUP_INFO_KEY");
456 break;
457 case BTRFS_QGROUP_LIMIT_KEY:
458 printf("BTRFS_QGROUP_LIMIT_KEY");
459 break;
460 default:
461 printf("UNKNOWN.%d", type);
465 static void print_objectid(u64 objectid, u8 type)
467 if (type == BTRFS_DEV_EXTENT_KEY) {
468 printf("%llu", (unsigned long long)objectid); /* device id */
469 return;
471 switch (type) {
472 case BTRFS_QGROUP_RELATION_KEY:
473 printf("%llu/%llu", objectid >> 48,
474 objectid & ((1ll << 48) - 1));
475 return;
478 switch (objectid) {
479 case BTRFS_ROOT_TREE_OBJECTID:
480 if (type == BTRFS_DEV_ITEM_KEY)
481 printf("DEV_ITEMS");
482 else
483 printf("ROOT_TREE");
484 break;
485 case BTRFS_EXTENT_TREE_OBJECTID:
486 printf("EXTENT_TREE");
487 break;
488 case BTRFS_CHUNK_TREE_OBJECTID:
489 printf("CHUNK_TREE");
490 break;
491 case BTRFS_DEV_TREE_OBJECTID:
492 printf("DEV_TREE");
493 break;
494 case BTRFS_FS_TREE_OBJECTID:
495 printf("FS_TREE");
496 break;
497 case BTRFS_ROOT_TREE_DIR_OBJECTID:
498 printf("ROOT_TREE_DIR");
499 break;
500 case BTRFS_CSUM_TREE_OBJECTID:
501 printf("CSUM_TREE");
502 break;
503 case BTRFS_BALANCE_OBJECTID:
504 printf("BALANCE");
505 break;
506 case BTRFS_ORPHAN_OBJECTID:
507 printf("ORPHAN");
508 break;
509 case BTRFS_TREE_LOG_OBJECTID:
510 printf("TREE_LOG");
511 break;
512 case BTRFS_TREE_LOG_FIXUP_OBJECTID:
513 printf("LOG_FIXUP");
514 break;
515 case BTRFS_TREE_RELOC_OBJECTID:
516 printf("TREE_RELOC");
517 break;
518 case BTRFS_DATA_RELOC_TREE_OBJECTID:
519 printf("DATA_RELOC_TREE");
520 break;
521 case BTRFS_EXTENT_CSUM_OBJECTID:
522 printf("EXTENT_CSUM");
523 break;
524 case BTRFS_FREE_SPACE_OBJECTID:
525 printf("FREE_SPACE");
526 break;
527 case BTRFS_FREE_INO_OBJECTID:
528 printf("FREE_INO");
529 case BTRFS_QUOTA_TREE_OBJECTID:
530 printf("QUOTA_TREE");
531 break;
532 case BTRFS_MULTIPLE_OBJECTIDS:
533 printf("MULTIPLE");
534 break;
535 case BTRFS_FIRST_CHUNK_TREE_OBJECTID:
536 if (type == BTRFS_CHUNK_ITEM_KEY) {
537 printf("FIRST_CHUNK_TREE");
538 break;
540 /* fall-thru */
541 default:
542 printf("%llu", (unsigned long long)objectid);
546 void btrfs_print_key(struct btrfs_disk_key *disk_key)
548 u64 objectid = btrfs_disk_key_objectid(disk_key);
549 u8 type = btrfs_disk_key_type(disk_key);
550 u64 offset = btrfs_disk_key_offset(disk_key);
552 printf("key (");
553 print_objectid(objectid, type);
554 printf(" ");
555 print_key_type(objectid, type);
556 switch (type) {
557 case BTRFS_QGROUP_RELATION_KEY:
558 case BTRFS_QGROUP_INFO_KEY:
559 case BTRFS_QGROUP_LIMIT_KEY:
560 printf(" %llu/%llu)", (unsigned long long)(offset >> 48),
561 (unsigned long long)(offset & ((1ll << 48) - 1)));
562 break;
563 default:
564 printf(" %llu)", (unsigned long long)offset);
565 break;
569 void btrfs_print_leaf(struct btrfs_root *root, struct extent_buffer *l)
571 int i;
572 char *str;
573 struct btrfs_item *item;
574 struct btrfs_dir_item *di;
575 struct btrfs_inode_item *ii;
576 struct btrfs_file_extent_item *fi;
577 struct btrfs_block_group_item *bi;
578 struct btrfs_extent_data_ref *dref;
579 struct btrfs_shared_data_ref *sref;
580 struct btrfs_inode_ref *iref;
581 struct btrfs_dev_extent *dev_extent;
582 struct btrfs_disk_key disk_key;
583 struct btrfs_block_group_item bg_item;
584 struct btrfs_dir_log_item *dlog;
585 struct btrfs_qgroup_info_item *qg_info;
586 struct btrfs_qgroup_limit_item *qg_limit;
587 struct btrfs_qgroup_status_item *qg_status;
588 u32 nr = btrfs_header_nritems(l);
589 u64 objectid;
590 u32 type;
592 printf("leaf %llu items %d free space %d generation %llu owner %llu\n",
593 (unsigned long long)btrfs_header_bytenr(l), nr,
594 btrfs_leaf_free_space(root, l),
595 (unsigned long long)btrfs_header_generation(l),
596 (unsigned long long)btrfs_header_owner(l));
597 print_uuids(l);
598 fflush(stdout);
599 for (i = 0 ; i < nr ; i++) {
600 item = btrfs_item_nr(l, i);
601 btrfs_item_key(l, &disk_key, i);
602 objectid = btrfs_disk_key_objectid(&disk_key);
603 type = btrfs_disk_key_type(&disk_key);
604 printf("\titem %d ", i);
605 btrfs_print_key(&disk_key);
606 printf(" itemoff %d itemsize %d\n",
607 btrfs_item_offset(l, item),
608 btrfs_item_size(l, item));
610 if (type == 0 && objectid == BTRFS_FREE_SPACE_OBJECTID)
611 print_free_space_header(l, i);
613 switch (type) {
614 case BTRFS_INODE_ITEM_KEY:
615 ii = btrfs_item_ptr(l, i, struct btrfs_inode_item);
616 printf("\t\tinode generation %llu transid %llu size %llu block group %llu mode %o links %u\n",
617 (unsigned long long)btrfs_inode_generation(l, ii),
618 (unsigned long long)btrfs_inode_transid(l, ii),
619 (unsigned long long)btrfs_inode_size(l, ii),
620 (unsigned long long)btrfs_inode_block_group(l,ii),
621 btrfs_inode_mode(l, ii),
622 btrfs_inode_nlink(l, ii));
623 break;
624 case BTRFS_INODE_REF_KEY:
625 iref = btrfs_item_ptr(l, i, struct btrfs_inode_ref);
626 print_inode_ref_item(l, item, iref);
627 break;
628 case BTRFS_DIR_ITEM_KEY:
629 case BTRFS_DIR_INDEX_KEY:
630 case BTRFS_XATTR_ITEM_KEY:
631 di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
632 print_dir_item(l, item, di);
633 break;
634 case BTRFS_DIR_LOG_INDEX_KEY:
635 case BTRFS_DIR_LOG_ITEM_KEY:
636 dlog = btrfs_item_ptr(l, i, struct btrfs_dir_log_item);
637 printf("\t\tdir log end %Lu\n",
638 (unsigned long long)btrfs_dir_log_end(l, dlog));
639 break;
640 case BTRFS_ORPHAN_ITEM_KEY:
641 printf("\t\torphan item\n");
642 break;
643 case BTRFS_ROOT_ITEM_KEY:
644 print_root(l, i);
645 break;
646 case BTRFS_ROOT_REF_KEY:
647 print_root_ref(l, i, "ref");
648 break;
649 case BTRFS_ROOT_BACKREF_KEY:
650 print_root_ref(l, i, "backref");
651 break;
652 case BTRFS_EXTENT_ITEM_KEY:
653 print_extent_item(l, i);
654 break;
655 case BTRFS_TREE_BLOCK_REF_KEY:
656 printf("\t\ttree block backref\n");
657 break;
658 case BTRFS_SHARED_BLOCK_REF_KEY:
659 printf("\t\tshared block backref\n");
660 break;
661 case BTRFS_EXTENT_DATA_REF_KEY:
662 dref = btrfs_item_ptr(l, i, struct btrfs_extent_data_ref);
663 printf("\t\textent data backref root %llu "
664 "objectid %llu offset %llu count %u\n",
665 (unsigned long long)btrfs_extent_data_ref_root(l, dref),
666 (unsigned long long)btrfs_extent_data_ref_objectid(l, dref),
667 (unsigned long long)btrfs_extent_data_ref_offset(l, dref),
668 btrfs_extent_data_ref_count(l, dref));
669 break;
670 case BTRFS_SHARED_DATA_REF_KEY:
671 sref = btrfs_item_ptr(l, i, struct btrfs_shared_data_ref);
672 printf("\t\tshared data backref count %u\n",
673 btrfs_shared_data_ref_count(l, sref));
674 break;
675 case BTRFS_EXTENT_REF_V0_KEY:
676 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
677 print_extent_ref_v0(l, i);
678 #else
679 BUG();
680 #endif
681 break;
682 case BTRFS_CSUM_ITEM_KEY:
683 printf("\t\tcsum item\n");
684 break;
685 case BTRFS_EXTENT_CSUM_KEY:
686 printf("\t\textent csum item\n");
687 break;
688 case BTRFS_EXTENT_DATA_KEY:
689 fi = btrfs_item_ptr(l, i,
690 struct btrfs_file_extent_item);
691 print_file_extent_item(l, item, fi);
692 break;
693 case BTRFS_BLOCK_GROUP_ITEM_KEY:
694 bi = btrfs_item_ptr(l, i,
695 struct btrfs_block_group_item);
696 read_extent_buffer(l, &bg_item, (unsigned long)bi,
697 sizeof(bg_item));
698 printf("\t\tblock group used %llu chunk_objectid %llu flags %llu\n",
699 (unsigned long long)btrfs_block_group_used(&bg_item),
700 (unsigned long long)btrfs_block_group_chunk_objectid(&bg_item),
701 (unsigned long long)btrfs_block_group_flags(&bg_item));
702 break;
703 case BTRFS_CHUNK_ITEM_KEY:
704 print_chunk(l, btrfs_item_ptr(l, i, struct btrfs_chunk));
705 break;
706 case BTRFS_DEV_ITEM_KEY:
707 print_dev_item(l, btrfs_item_ptr(l, i,
708 struct btrfs_dev_item));
709 break;
710 case BTRFS_DEV_EXTENT_KEY:
711 dev_extent = btrfs_item_ptr(l, i,
712 struct btrfs_dev_extent);
713 printf("\t\tdev extent chunk_tree %llu\n"
714 "\t\tchunk objectid %llu chunk offset %llu "
715 "length %llu\n",
716 (unsigned long long)
717 btrfs_dev_extent_chunk_tree(l, dev_extent),
718 (unsigned long long)
719 btrfs_dev_extent_chunk_objectid(l, dev_extent),
720 (unsigned long long)
721 btrfs_dev_extent_chunk_offset(l, dev_extent),
722 (unsigned long long)
723 btrfs_dev_extent_length(l, dev_extent));
724 break;
725 case BTRFS_QGROUP_STATUS_KEY:
726 qg_status = btrfs_item_ptr(l, i,
727 struct btrfs_qgroup_status_item);
728 printf("\t\tversion %llu generation %llu flags %#llx "
729 "scan %lld\n",
730 (unsigned long long)
731 btrfs_qgroup_status_version(l, qg_status),
732 (unsigned long long)
733 btrfs_qgroup_status_generation(l, qg_status),
734 (unsigned long long)
735 btrfs_qgroup_status_flags(l, qg_status),
736 (unsigned long long)
737 btrfs_qgroup_status_scan(l, qg_status));
738 break;
739 case BTRFS_QGROUP_RELATION_KEY:
740 break;
741 case BTRFS_QGROUP_INFO_KEY:
742 qg_info = btrfs_item_ptr(l, i,
743 struct btrfs_qgroup_info_item);
744 printf("\t\tgeneration %llu\n"
745 "\t\treferenced %lld referenced compressed %lld\n"
746 "\t\texclusive %lld exclusive compressed %lld\n",
747 (unsigned long long)
748 btrfs_qgroup_info_generation(l, qg_info),
749 (long long)
750 btrfs_qgroup_info_referenced(l, qg_info),
751 (long long)
752 btrfs_qgroup_info_referenced_compressed(l,
753 qg_info),
754 (long long)
755 btrfs_qgroup_info_exclusive(l, qg_info),
756 (long long)
757 btrfs_qgroup_info_exclusive_compressed(l,
758 qg_info));
759 break;
760 case BTRFS_QGROUP_LIMIT_KEY:
761 qg_limit = btrfs_item_ptr(l, i,
762 struct btrfs_qgroup_limit_item);
763 printf("\t\tflags %llx\n"
764 "\t\tmax referenced %lld max exclusive %lld\n"
765 "\t\trsv referenced %lld rsv exclusive %lld\n",
766 (unsigned long long)
767 btrfs_qgroup_limit_flags(l, qg_limit),
768 (long long)
769 btrfs_qgroup_limit_max_referenced(l, qg_limit),
770 (long long)
771 btrfs_qgroup_limit_max_exclusive(l, qg_limit),
772 (long long)
773 btrfs_qgroup_limit_rsv_referenced(l, qg_limit),
774 (long long)
775 btrfs_qgroup_limit_rsv_exclusive(l, qg_limit));
776 break;
777 case BTRFS_STRING_ITEM_KEY:
778 /* dirty, but it's simple */
779 str = l->data + btrfs_item_ptr_offset(l, i);
780 printf("\t\titem data %.*s\n", btrfs_item_size(l, item), str);
781 break;
783 fflush(stdout);
787 void btrfs_print_tree(struct btrfs_root *root, struct extent_buffer *eb, int follow)
789 int i;
790 u32 nr;
791 u32 size;
792 struct btrfs_disk_key disk_key;
793 struct btrfs_key key;
795 if (!eb)
796 return;
797 nr = btrfs_header_nritems(eb);
798 if (btrfs_is_leaf(eb)) {
799 btrfs_print_leaf(root, eb);
800 return;
802 printf("node %llu level %d items %d free %u generation %llu owner %llu\n",
803 (unsigned long long)eb->start,
804 btrfs_header_level(eb), nr,
805 (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr,
806 (unsigned long long)btrfs_header_generation(eb),
807 (unsigned long long)btrfs_header_owner(eb));
808 print_uuids(eb);
809 fflush(stdout);
810 size = btrfs_level_size(root, btrfs_header_level(eb) - 1);
811 for (i = 0; i < nr; i++) {
812 u64 blocknr = btrfs_node_blockptr(eb, i);
813 btrfs_node_key(eb, &disk_key, i);
814 btrfs_disk_key_to_cpu(&key, &disk_key);
815 printf("\t");
816 btrfs_print_key(&disk_key);
817 printf(" block %llu (%llu) gen %llu\n",
818 (unsigned long long)blocknr,
819 (unsigned long long)blocknr / size,
820 (unsigned long long)btrfs_node_ptr_generation(eb, i));
821 fflush(stdout);
823 if (!follow)
824 return;
826 for (i = 0; i < nr; i++) {
827 struct extent_buffer *next = read_tree_block(root,
828 btrfs_node_blockptr(eb, i),
829 size,
830 btrfs_node_ptr_generation(eb, i));
831 if (!next) {
832 fprintf(stderr, "failed to read %llu in tree %llu\n",
833 (unsigned long long)btrfs_node_blockptr(eb, i),
834 (unsigned long long)btrfs_header_owner(eb));
835 continue;
837 if (btrfs_is_leaf(next) &&
838 btrfs_header_level(eb) != 1)
839 BUG();
840 if (btrfs_header_level(next) !=
841 btrfs_header_level(eb) - 1)
842 BUG();
843 btrfs_print_tree(root, next, 1);
844 free_extent_buffer(next);