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.
21 #include <uuid/uuid.h>
22 #include "kerncompat.h"
23 #include "radix-tree.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)
36 char namebuf[BTRFS_NAME_LEN];
37 struct btrfs_disk_key location;
39 total = btrfs_item_size(eb, item);
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);
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);
64 static int print_inode_ref_item(struct extent_buffer *eb, struct btrfs_item *item,
65 struct btrfs_inode_ref *ref)
72 char namebuf[BTRFS_NAME_LEN];
73 total = btrfs_item_size(eb, item);
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);
88 static void print_chunk(struct extent_buffer *eb, struct btrfs_chunk *chunk)
90 int num_stripes = btrfs_chunk_num_stripes(eb, chunk);
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),
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)
118 u8 disk_uuid[BTRFS_UUID_SIZE];
120 read_extent_buffer(eb, disk_uuid, (unsigned long)btrfs_header_fsid(eb),
124 uuid_unparse(disk_uuid, fs_uuid);
126 read_extent_buffer(eb, disk_uuid,
127 (unsigned long)btrfs_header_chunk_tree_uuid(eb),
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));
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));
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;
179 u32 item_size = btrfs_item_size_nr(eb, slot);
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));
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 ");
209 btrfs_print_key(&key);
210 printf(" level %d\n", btrfs_tree_block_level(eb, info));
211 iref = (struct btrfs_extent_inline_ref *)(info + 1);
213 iref = (struct btrfs_extent_inline_ref *)(ei + 1);
216 ptr = (unsigned long)iref;
217 end = (unsigned long)ei + item_size;
219 iref = (struct btrfs_extent_inline_ref *)ptr;
220 type = btrfs_extent_inline_ref_type(eb, iref);
221 offset = btrfs_extent_inline_ref_offset(eb, iref);
223 case BTRFS_TREE_BLOCK_REF_KEY:
224 printf("\t\ttree block backref root %llu\n",
225 (unsigned long long)offset);
227 case BTRFS_SHARED_BLOCK_REF_KEY:
228 printf("\t\tshared block backref parent %llu\n",
229 (unsigned long long)offset);
231 case BTRFS_EXTENT_DATA_REF_KEY:
232 dref = (struct btrfs_extent_data_ref *)(&iref->offset);
233 printf("\t\textent data backref root %llu "
234 "objectid %llu offset %llu count %u\n",
235 (unsigned long long)btrfs_extent_data_ref_root(eb, dref),
236 (unsigned long long)btrfs_extent_data_ref_objectid(eb, dref),
237 (unsigned long long)btrfs_extent_data_ref_offset(eb, dref),
238 btrfs_extent_data_ref_count(eb, dref));
240 case BTRFS_SHARED_DATA_REF_KEY:
241 sref = (struct btrfs_shared_data_ref *)(iref + 1);
242 printf("\t\tshared data backref parent %llu count %u\n",
243 (unsigned long long)offset,
244 btrfs_shared_data_ref_count(eb, sref));
249 ptr += btrfs_extent_inline_ref_size(type);
254 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
255 static void print_extent_ref_v0(struct extent_buffer *eb, int slot)
257 struct btrfs_extent_ref_v0 *ref0;
259 ref0 = btrfs_item_ptr(eb, slot, struct btrfs_extent_ref_v0);
260 printf("\t\textent back ref root %llu gen %llu "
261 "owner %llu num_refs %lu\n",
262 (unsigned long long)btrfs_ref_root_v0(eb, ref0),
263 (unsigned long long)btrfs_ref_generation_v0(eb, ref0),
264 (unsigned long long)btrfs_ref_objectid_v0(eb, ref0),
265 (unsigned long)btrfs_ref_count_v0(eb, ref0));
269 static void print_root_ref(struct extent_buffer *leaf, int slot, char *tag)
271 struct btrfs_root_ref *ref;
272 char namebuf[BTRFS_NAME_LEN];
275 ref = btrfs_item_ptr(leaf, slot, struct btrfs_root_ref);
276 namelen = btrfs_root_ref_name_len(leaf, ref);
277 read_extent_buffer(leaf, namebuf, (unsigned long)(ref + 1), namelen);
278 printf("\t\troot %s key dirid %llu sequence %llu name %.*s\n", tag,
279 (unsigned long long)btrfs_root_ref_dirid(leaf, ref),
280 (unsigned long long)btrfs_root_ref_sequence(leaf, ref),
284 static int count_bytes(void *buf, int len, char b)
288 for (i = 0; i < len; i++) {
289 if (((char*)buf)[i] == b)
295 static void print_root(struct extent_buffer *leaf, int slot)
297 struct btrfs_root_item *ri;
298 struct btrfs_root_item root_item;
302 ri = btrfs_item_ptr(leaf, slot, struct btrfs_root_item);
303 len = btrfs_item_size_nr(leaf, slot);
305 memset(&root_item, 0, sizeof(root_item));
306 read_extent_buffer(leaf, &root_item, (unsigned long)ri, len);
308 printf("\t\troot data bytenr %llu level %d dirid %llu refs %u gen %llu\n",
309 (unsigned long long)btrfs_root_bytenr(&root_item),
310 btrfs_root_level(&root_item),
311 (unsigned long long)btrfs_root_dirid(&root_item),
312 btrfs_root_refs(&root_item),
313 (unsigned long long)btrfs_root_generation(&root_item));
315 if (root_item.generation == root_item.generation_v2) {
316 uuid_unparse(root_item.uuid, uuid_str);
317 printf("\t\tuuid %s\n", uuid_str);
318 if (count_bytes(root_item.parent_uuid, BTRFS_UUID_SIZE, 0) != BTRFS_UUID_SIZE) {
319 uuid_unparse(root_item.parent_uuid, uuid_str);
320 printf("\t\tparent_uuid %s\n", uuid_str);
322 if (count_bytes(root_item.received_uuid, BTRFS_UUID_SIZE, 0) != BTRFS_UUID_SIZE) {
323 uuid_unparse(root_item.received_uuid, uuid_str);
324 printf("\t\treceived_uuid %s\n", uuid_str);
326 if (root_item.ctransid) {
327 printf("\t\tctransid %llu otransid %llu stransid %llu rtransid %llu\n",
328 btrfs_root_ctransid(&root_item),
329 btrfs_root_otransid(&root_item),
330 btrfs_root_stransid(&root_item),
331 btrfs_root_rtransid(&root_item));
334 if (btrfs_root_refs(&root_item) == 0) {
335 struct btrfs_key drop_key;
336 btrfs_disk_key_to_cpu(&drop_key,
337 &root_item.drop_progress);
339 btrfs_print_key(&root_item.drop_progress);
340 printf(" level %d\n", root_item.drop_level);
344 static void print_free_space_header(struct extent_buffer *leaf, int slot)
346 struct btrfs_free_space_header *header;
347 struct btrfs_disk_key location;
349 header = btrfs_item_ptr(leaf, slot, struct btrfs_free_space_header);
350 btrfs_free_space_key(leaf, header, &location);
351 printf("\t\tlocation ");
352 btrfs_print_key(&location);
354 printf("\t\tcache generation %llu entries %llu bitmaps %llu\n",
355 (unsigned long long)btrfs_free_space_generation(leaf, header),
356 (unsigned long long)btrfs_free_space_entries(leaf, header),
357 (unsigned long long)btrfs_free_space_bitmaps(leaf, header));
360 static void print_key_type(u64 objectid, u8 type)
362 if (type == 0 && objectid == BTRFS_FREE_SPACE_OBJECTID) {
368 case BTRFS_INODE_ITEM_KEY:
369 printf("INODE_ITEM");
371 case BTRFS_INODE_REF_KEY:
374 case BTRFS_DIR_ITEM_KEY:
377 case BTRFS_DIR_INDEX_KEY:
380 case BTRFS_DIR_LOG_ITEM_KEY:
381 printf("DIR_LOG_ITEM");
383 case BTRFS_DIR_LOG_INDEX_KEY:
384 printf("DIR_LOG_INDEX");
386 case BTRFS_XATTR_ITEM_KEY:
387 printf("XATTR_ITEM");
389 case BTRFS_ORPHAN_ITEM_KEY:
390 printf("ORPHAN_ITEM");
392 case BTRFS_ROOT_ITEM_KEY:
395 case BTRFS_ROOT_REF_KEY:
398 case BTRFS_ROOT_BACKREF_KEY:
399 printf("ROOT_BACKREF");
401 case BTRFS_EXTENT_ITEM_KEY:
402 printf("EXTENT_ITEM");
404 case BTRFS_TREE_BLOCK_REF_KEY:
405 printf("TREE_BLOCK_REF");
407 case BTRFS_SHARED_BLOCK_REF_KEY:
408 printf("SHARED_BLOCK_REF");
410 case BTRFS_EXTENT_DATA_REF_KEY:
411 printf("EXTENT_DATA_REF");
413 case BTRFS_SHARED_DATA_REF_KEY:
414 printf("SHARED_DATA_REF");
416 case BTRFS_EXTENT_REF_V0_KEY:
417 printf("EXTENT_REF_V0");
419 case BTRFS_CSUM_ITEM_KEY:
422 case BTRFS_EXTENT_CSUM_KEY:
423 printf("EXTENT_CSUM");
425 case BTRFS_EXTENT_DATA_KEY:
426 printf("EXTENT_DATA");
428 case BTRFS_BLOCK_GROUP_ITEM_KEY:
429 printf("BLOCK_GROUP_ITEM");
431 case BTRFS_CHUNK_ITEM_KEY:
432 printf("CHUNK_ITEM");
434 case BTRFS_DEV_ITEM_KEY:
437 case BTRFS_DEV_EXTENT_KEY:
438 printf("DEV_EXTENT");
440 case BTRFS_BALANCE_ITEM_KEY:
441 printf("BALANCE_ITEM");
443 case BTRFS_STRING_ITEM_KEY:
444 printf("STRING_ITEM");
446 case BTRFS_QGROUP_STATUS_KEY:
447 printf("BTRFS_STATUS_KEY");
449 case BTRFS_QGROUP_RELATION_KEY:
450 printf("BTRFS_QGROUP_RELATION_KEY");
452 case BTRFS_QGROUP_INFO_KEY:
453 printf("BTRFS_QGROUP_INFO_KEY");
455 case BTRFS_QGROUP_LIMIT_KEY:
456 printf("BTRFS_QGROUP_LIMIT_KEY");
459 printf("UNKNOWN.%d", type);
463 static void print_objectid(u64 objectid, u8 type)
465 if (type == BTRFS_DEV_EXTENT_KEY) {
466 printf("%llu", (unsigned long long)objectid); /* device id */
470 case BTRFS_QGROUP_RELATION_KEY:
471 printf("%llu/%llu", objectid >> 48,
472 objectid & ((1ll << 48) - 1));
477 case BTRFS_ROOT_TREE_OBJECTID:
478 if (type == BTRFS_DEV_ITEM_KEY)
483 case BTRFS_EXTENT_TREE_OBJECTID:
484 printf("EXTENT_TREE");
486 case BTRFS_CHUNK_TREE_OBJECTID:
487 printf("CHUNK_TREE");
489 case BTRFS_DEV_TREE_OBJECTID:
492 case BTRFS_FS_TREE_OBJECTID:
495 case BTRFS_ROOT_TREE_DIR_OBJECTID:
496 printf("ROOT_TREE_DIR");
498 case BTRFS_CSUM_TREE_OBJECTID:
501 case BTRFS_BALANCE_OBJECTID:
504 case BTRFS_ORPHAN_OBJECTID:
507 case BTRFS_TREE_LOG_OBJECTID:
510 case BTRFS_TREE_LOG_FIXUP_OBJECTID:
513 case BTRFS_TREE_RELOC_OBJECTID:
514 printf("TREE_RELOC");
516 case BTRFS_DATA_RELOC_TREE_OBJECTID:
517 printf("DATA_RELOC_TREE");
519 case BTRFS_EXTENT_CSUM_OBJECTID:
520 printf("EXTENT_CSUM");
522 case BTRFS_FREE_SPACE_OBJECTID:
523 printf("FREE_SPACE");
525 case BTRFS_FREE_INO_OBJECTID:
527 case BTRFS_QUOTA_TREE_OBJECTID:
528 printf("QUOTA_TREE");
530 case BTRFS_MULTIPLE_OBJECTIDS:
533 case BTRFS_FIRST_CHUNK_TREE_OBJECTID:
534 if (type == BTRFS_CHUNK_ITEM_KEY) {
535 printf("FIRST_CHUNK_TREE");
540 printf("%llu", (unsigned long long)objectid);
544 void btrfs_print_key(struct btrfs_disk_key *disk_key)
546 u64 objectid = btrfs_disk_key_objectid(disk_key);
547 u8 type = btrfs_disk_key_type(disk_key);
548 u64 offset = btrfs_disk_key_offset(disk_key);
551 print_objectid(objectid, type);
553 print_key_type(objectid, type);
555 case BTRFS_QGROUP_RELATION_KEY:
556 case BTRFS_QGROUP_INFO_KEY:
557 case BTRFS_QGROUP_LIMIT_KEY:
558 printf(" %llu/%llu)", (unsigned long long)(offset >> 48),
559 (unsigned long long)(offset & ((1ll << 48) - 1)));
562 printf(" %llu)", (unsigned long long)offset);
567 void btrfs_print_leaf(struct btrfs_root *root, struct extent_buffer *l)
571 struct btrfs_item *item;
572 struct btrfs_dir_item *di;
573 struct btrfs_inode_item *ii;
574 struct btrfs_file_extent_item *fi;
575 struct btrfs_block_group_item *bi;
576 struct btrfs_extent_data_ref *dref;
577 struct btrfs_shared_data_ref *sref;
578 struct btrfs_inode_ref *iref;
579 struct btrfs_dev_extent *dev_extent;
580 struct btrfs_disk_key disk_key;
581 struct btrfs_block_group_item bg_item;
582 struct btrfs_dir_log_item *dlog;
583 struct btrfs_qgroup_info_item *qg_info;
584 struct btrfs_qgroup_limit_item *qg_limit;
585 struct btrfs_qgroup_status_item *qg_status;
586 u32 nr = btrfs_header_nritems(l);
590 printf("leaf %llu items %d free space %d generation %llu owner %llu\n",
591 (unsigned long long)btrfs_header_bytenr(l), nr,
592 btrfs_leaf_free_space(root, l),
593 (unsigned long long)btrfs_header_generation(l),
594 (unsigned long long)btrfs_header_owner(l));
597 for (i = 0 ; i < nr ; i++) {
598 item = btrfs_item_nr(l, i);
599 btrfs_item_key(l, &disk_key, i);
600 objectid = btrfs_disk_key_objectid(&disk_key);
601 type = btrfs_disk_key_type(&disk_key);
602 printf("\titem %d ", i);
603 btrfs_print_key(&disk_key);
604 printf(" itemoff %d itemsize %d\n",
605 btrfs_item_offset(l, item),
606 btrfs_item_size(l, item));
608 if (type == 0 && objectid == BTRFS_FREE_SPACE_OBJECTID)
609 print_free_space_header(l, i);
612 case BTRFS_INODE_ITEM_KEY:
613 ii = btrfs_item_ptr(l, i, struct btrfs_inode_item);
614 printf("\t\tinode generation %llu transid %llu size %llu block group %llu mode %o links %u\n",
615 (unsigned long long)btrfs_inode_generation(l, ii),
616 (unsigned long long)btrfs_inode_transid(l, ii),
617 (unsigned long long)btrfs_inode_size(l, ii),
618 (unsigned long long)btrfs_inode_block_group(l,ii),
619 btrfs_inode_mode(l, ii),
620 btrfs_inode_nlink(l, ii));
622 case BTRFS_INODE_REF_KEY:
623 iref = btrfs_item_ptr(l, i, struct btrfs_inode_ref);
624 print_inode_ref_item(l, item, iref);
626 case BTRFS_DIR_ITEM_KEY:
627 case BTRFS_DIR_INDEX_KEY:
628 case BTRFS_XATTR_ITEM_KEY:
629 di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
630 print_dir_item(l, item, di);
632 case BTRFS_DIR_LOG_INDEX_KEY:
633 case BTRFS_DIR_LOG_ITEM_KEY:
634 dlog = btrfs_item_ptr(l, i, struct btrfs_dir_log_item);
635 printf("\t\tdir log end %Lu\n",
636 (unsigned long long)btrfs_dir_log_end(l, dlog));
638 case BTRFS_ORPHAN_ITEM_KEY:
639 printf("\t\torphan item\n");
641 case BTRFS_ROOT_ITEM_KEY:
644 case BTRFS_ROOT_REF_KEY:
645 print_root_ref(l, i, "ref");
647 case BTRFS_ROOT_BACKREF_KEY:
648 print_root_ref(l, i, "backref");
650 case BTRFS_EXTENT_ITEM_KEY:
651 print_extent_item(l, i);
653 case BTRFS_TREE_BLOCK_REF_KEY:
654 printf("\t\ttree block backref\n");
656 case BTRFS_SHARED_BLOCK_REF_KEY:
657 printf("\t\tshared block backref\n");
659 case BTRFS_EXTENT_DATA_REF_KEY:
660 dref = btrfs_item_ptr(l, i, struct btrfs_extent_data_ref);
661 printf("\t\textent data backref root %llu "
662 "objectid %llu offset %llu count %u\n",
663 (unsigned long long)btrfs_extent_data_ref_root(l, dref),
664 (unsigned long long)btrfs_extent_data_ref_objectid(l, dref),
665 (unsigned long long)btrfs_extent_data_ref_offset(l, dref),
666 btrfs_extent_data_ref_count(l, dref));
668 case BTRFS_SHARED_DATA_REF_KEY:
669 sref = btrfs_item_ptr(l, i, struct btrfs_shared_data_ref);
670 printf("\t\tshared data backref count %u\n",
671 btrfs_shared_data_ref_count(l, sref));
673 case BTRFS_EXTENT_REF_V0_KEY:
674 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
675 print_extent_ref_v0(l, i);
680 case BTRFS_CSUM_ITEM_KEY:
681 printf("\t\tcsum item\n");
683 case BTRFS_EXTENT_CSUM_KEY:
684 printf("\t\textent csum item\n");
686 case BTRFS_EXTENT_DATA_KEY:
687 fi = btrfs_item_ptr(l, i,
688 struct btrfs_file_extent_item);
689 print_file_extent_item(l, item, fi);
691 case BTRFS_BLOCK_GROUP_ITEM_KEY:
692 bi = btrfs_item_ptr(l, i,
693 struct btrfs_block_group_item);
694 read_extent_buffer(l, &bg_item, (unsigned long)bi,
696 printf("\t\tblock group used %llu chunk_objectid %llu flags %llu\n",
697 (unsigned long long)btrfs_block_group_used(&bg_item),
698 (unsigned long long)btrfs_block_group_chunk_objectid(&bg_item),
699 (unsigned long long)btrfs_block_group_flags(&bg_item));
701 case BTRFS_CHUNK_ITEM_KEY:
702 print_chunk(l, btrfs_item_ptr(l, i, struct btrfs_chunk));
704 case BTRFS_DEV_ITEM_KEY:
705 print_dev_item(l, btrfs_item_ptr(l, i,
706 struct btrfs_dev_item));
708 case BTRFS_DEV_EXTENT_KEY:
709 dev_extent = btrfs_item_ptr(l, i,
710 struct btrfs_dev_extent);
711 printf("\t\tdev extent chunk_tree %llu\n"
712 "\t\tchunk objectid %llu chunk offset %llu "
715 btrfs_dev_extent_chunk_tree(l, dev_extent),
717 btrfs_dev_extent_chunk_objectid(l, dev_extent),
719 btrfs_dev_extent_chunk_offset(l, dev_extent),
721 btrfs_dev_extent_length(l, dev_extent));
723 case BTRFS_QGROUP_STATUS_KEY:
724 qg_status = btrfs_item_ptr(l, i,
725 struct btrfs_qgroup_status_item);
726 printf("\t\tversion %llu generation %llu flags %#llx "
729 btrfs_qgroup_status_version(l, qg_status),
731 btrfs_qgroup_status_generation(l, qg_status),
733 btrfs_qgroup_status_flags(l, qg_status),
735 btrfs_qgroup_status_scan(l, qg_status));
737 case BTRFS_QGROUP_RELATION_KEY:
739 case BTRFS_QGROUP_INFO_KEY:
740 qg_info = btrfs_item_ptr(l, i,
741 struct btrfs_qgroup_info_item);
742 printf("\t\tgeneration %llu\n"
743 "\t\treferenced %lld referenced compressed %lld\n"
744 "\t\texclusive %lld exclusive compressed %lld\n",
746 btrfs_qgroup_info_generation(l, qg_info),
748 btrfs_qgroup_info_referenced(l, qg_info),
750 btrfs_qgroup_info_referenced_compressed(l,
753 btrfs_qgroup_info_exclusive(l, qg_info),
755 btrfs_qgroup_info_exclusive_compressed(l,
758 case BTRFS_QGROUP_LIMIT_KEY:
759 qg_limit = btrfs_item_ptr(l, i,
760 struct btrfs_qgroup_limit_item);
761 printf("\t\tflags %llx\n"
762 "\t\tmax referenced %lld max exclusive %lld\n"
763 "\t\trsv referenced %lld rsv exclusive %lld\n",
765 btrfs_qgroup_limit_flags(l, qg_limit),
767 btrfs_qgroup_limit_max_referenced(l, qg_limit),
769 btrfs_qgroup_limit_max_exclusive(l, qg_limit),
771 btrfs_qgroup_limit_rsv_referenced(l, qg_limit),
773 btrfs_qgroup_limit_rsv_exclusive(l, qg_limit));
775 case BTRFS_STRING_ITEM_KEY:
776 /* dirty, but it's simple */
777 str = l->data + btrfs_item_ptr_offset(l, i);
778 printf("\t\titem data %.*s\n", btrfs_item_size(l, item), str);
785 void btrfs_print_tree(struct btrfs_root *root, struct extent_buffer *eb, int follow)
790 struct btrfs_disk_key disk_key;
791 struct btrfs_key key;
795 nr = btrfs_header_nritems(eb);
796 if (btrfs_is_leaf(eb)) {
797 btrfs_print_leaf(root, eb);
800 printf("node %llu level %d items %d free %u generation %llu owner %llu\n",
801 (unsigned long long)eb->start,
802 btrfs_header_level(eb), nr,
803 (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr,
804 (unsigned long long)btrfs_header_generation(eb),
805 (unsigned long long)btrfs_header_owner(eb));
808 size = btrfs_level_size(root, btrfs_header_level(eb) - 1);
809 for (i = 0; i < nr; i++) {
810 u64 blocknr = btrfs_node_blockptr(eb, i);
811 btrfs_node_key(eb, &disk_key, i);
812 btrfs_disk_key_to_cpu(&key, &disk_key);
814 btrfs_print_key(&disk_key);
815 printf(" block %llu (%llu) gen %llu\n",
816 (unsigned long long)blocknr,
817 (unsigned long long)blocknr / size,
818 (unsigned long long)btrfs_node_ptr_generation(eb, i));
824 for (i = 0; i < nr; i++) {
825 struct extent_buffer *next = read_tree_block(root,
826 btrfs_node_blockptr(eb, i),
828 btrfs_node_ptr_generation(eb, i));
830 fprintf(stderr, "failed to read %llu in tree %llu\n",
831 (unsigned long long)btrfs_node_blockptr(eb, i),
832 (unsigned long long)btrfs_header_owner(eb));
835 if (btrfs_is_leaf(next) &&
836 btrfs_header_level(eb) != 1)
838 if (btrfs_header_level(next) !=
839 btrfs_header_level(eb) - 1)
841 btrfs_print_tree(root, next, 1);
842 free_extent_buffer(next);