[deliverable/linux.git] / fs / btrfs / print-tree.c

/*
 * Copyright (C) 2007 Oracle.  All rights reserved.
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public
 * License v2 as published by the Free Software Foundation.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * General Public License for more details.
 *
 * You should have received a copy of the GNU General Public
 * License along with this program; if not, write to the
 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
 * Boston, MA 021110-1307, USA.
 */

#include "ctree.h"
#include "disk-io.h"
#include "print-tree.h"

static void print_chunk(struct extent_buffer *eb, struct btrfs_chunk *chunk)
{
	int num_stripes = btrfs_chunk_num_stripes(eb, chunk);
	int i;
	printk(KERN_INFO "\t\tchunk length %llu owner %llu type %llu "
	       "num_stripes %d\n",
	       btrfs_chunk_length(eb, chunk), btrfs_chunk_owner(eb, chunk),
	       btrfs_chunk_type(eb, chunk), num_stripes);
	for (i = 0 ; i < num_stripes ; i++) {
		printk(KERN_INFO "\t\t\tstripe %d devid %llu offset %llu\n", i,
		      btrfs_stripe_devid_nr(eb, chunk, i),
		      btrfs_stripe_offset_nr(eb, chunk, i));
	}
}
static void print_dev_item(struct extent_buffer *eb,
			   struct btrfs_dev_item *dev_item)
{
	printk(KERN_INFO "\t\tdev item devid %llu "
	       "total_bytes %llu bytes used %llu\n",
	       btrfs_device_id(eb, dev_item),
	       btrfs_device_total_bytes(eb, dev_item),
	       btrfs_device_bytes_used(eb, dev_item));
}
static void print_extent_data_ref(struct extent_buffer *eb,
				  struct btrfs_extent_data_ref *ref)
{
	printk(KERN_INFO "\t\textent data backref root %llu "
	       "objectid %llu offset %llu count %u\n",
	       btrfs_extent_data_ref_root(eb, ref),
	       btrfs_extent_data_ref_objectid(eb, ref),
	       btrfs_extent_data_ref_offset(eb, ref),
	       btrfs_extent_data_ref_count(eb, ref));
}

static void print_extent_item(struct extent_buffer *eb, int slot, int type)
{
	struct btrfs_extent_item *ei;
	struct btrfs_extent_inline_ref *iref;
	struct btrfs_extent_data_ref *dref;
	struct btrfs_shared_data_ref *sref;
	struct btrfs_disk_key key;
	unsigned long end;
	unsigned long ptr;
	u32 item_size = btrfs_item_size_nr(eb, slot);
	u64 flags;
	u64 offset;

	if (item_size < sizeof(*ei)) {
#ifdef BTRFS_COMPAT_EXTENT_TREE_V0
		struct btrfs_extent_item_v0 *ei0;
		BUG_ON(item_size != sizeof(*ei0));
		ei0 = btrfs_item_ptr(eb, slot, struct btrfs_extent_item_v0);
		printk(KERN_INFO "\t\textent refs %u\n",
		       btrfs_extent_refs_v0(eb, ei0));
		return;
#else
		BUG();
#endif
	}

	ei = btrfs_item_ptr(eb, slot, struct btrfs_extent_item);
	flags = btrfs_extent_flags(eb, ei);

	printk(KERN_INFO "\t\textent refs %llu gen %llu flags %llu\n",
	       btrfs_extent_refs(eb, ei), btrfs_extent_generation(eb, ei),
	       flags);

	if ((type == BTRFS_EXTENT_ITEM_KEY) &&
	    flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) {
		struct btrfs_tree_block_info *info;
		info = (struct btrfs_tree_block_info *)(ei + 1);
		btrfs_tree_block_key(eb, info, &key);
		printk(KERN_INFO "\t\ttree block key (%llu %u %llu) "
		       "level %d\n",
		       btrfs_disk_key_objectid(&key), key.type,
		       btrfs_disk_key_offset(&key),
		       btrfs_tree_block_level(eb, info));
		iref = (struct btrfs_extent_inline_ref *)(info + 1);
	} else {
		iref = (struct btrfs_extent_inline_ref *)(ei + 1);
	}

	ptr = (unsigned long)iref;
	end = (unsigned long)ei + item_size;
	while (ptr < end) {
		iref = (struct btrfs_extent_inline_ref *)ptr;
		type = btrfs_extent_inline_ref_type(eb, iref);
		offset = btrfs_extent_inline_ref_offset(eb, iref);
		switch (type) {
		case BTRFS_TREE_BLOCK_REF_KEY:
			printk(KERN_INFO "\t\ttree block backref "
				"root %llu\n", offset);
			break;
		case BTRFS_SHARED_BLOCK_REF_KEY:
			printk(KERN_INFO "\t\tshared block backref "
				"parent %llu\n", offset);
			break;
		case BTRFS_EXTENT_DATA_REF_KEY:
			dref = (struct btrfs_extent_data_ref *)(&iref->offset);
			print_extent_data_ref(eb, dref);
			break;
		case BTRFS_SHARED_DATA_REF_KEY:
			sref = (struct btrfs_shared_data_ref *)(iref + 1);
			printk(KERN_INFO "\t\tshared data backref "
			       "parent %llu count %u\n",
			       offset, btrfs_shared_data_ref_count(eb, sref));
			break;
		default:
			BUG();
		}
		ptr += btrfs_extent_inline_ref_size(type);
	}
	WARN_ON(ptr > end);
}

#ifdef BTRFS_COMPAT_EXTENT_TREE_V0
static void print_extent_ref_v0(struct extent_buffer *eb, int slot)
{
	struct btrfs_extent_ref_v0 *ref0;

	ref0 = btrfs_item_ptr(eb, slot, struct btrfs_extent_ref_v0);
	printk("\t\textent back ref root %llu gen %llu "
		"owner %llu num_refs %lu\n",
		btrfs_ref_root_v0(eb, ref0),
		btrfs_ref_generation_v0(eb, ref0),
		btrfs_ref_objectid_v0(eb, ref0),
		(unsigned long)btrfs_ref_count_v0(eb, ref0));
}
#endif

static void print_uuid_item(struct extent_buffer *l, unsigned long offset,
			    u32 item_size)
{
	if (!IS_ALIGNED(item_size, sizeof(u64))) {
		pr_warn("BTRFS: uuid item with illegal size %lu!\n",
			(unsigned long)item_size);
		return;
	}
	while (item_size) {
		__le64 subvol_id;

		read_extent_buffer(l, &subvol_id, offset, sizeof(subvol_id));
		printk(KERN_INFO "\t\tsubvol_id %llu\n",
		       (unsigned long long)le64_to_cpu(subvol_id));
		item_size -= sizeof(u64);
		offset += sizeof(u64);
	}
}

void btrfs_print_leaf(struct btrfs_root *root, struct extent_buffer *l)
{
	int i;
	u32 type, nr;
	struct btrfs_item *item;
	struct btrfs_root_item *ri;
	struct btrfs_dir_item *di;
	struct btrfs_inode_item *ii;
	struct btrfs_block_group_item *bi;
	struct btrfs_file_extent_item *fi;
	struct btrfs_extent_data_ref *dref;
	struct btrfs_shared_data_ref *sref;
	struct btrfs_dev_extent *dev_extent;
	struct btrfs_key key;
	struct btrfs_key found_key;

	if (!l)
		return;

	nr = btrfs_header_nritems(l);

	btrfs_info(root->fs_info, "leaf %llu total ptrs %d free space %d",
		   btrfs_header_bytenr(l), nr, btrfs_leaf_free_space(root, l));
	for (i = 0 ; i < nr ; i++) {
		item = btrfs_item_nr(i);
		btrfs_item_key_to_cpu(l, &key, i);
		type = key.type;
		printk(KERN_INFO "\titem %d key (%llu %u %llu) itemoff %d "
		       "itemsize %d\n",
			i, key.objectid, type, key.offset,
			btrfs_item_offset(l, item), btrfs_item_size(l, item));
		switch (type) {
		case BTRFS_INODE_ITEM_KEY:
			ii = btrfs_item_ptr(l, i, struct btrfs_inode_item);
			printk(KERN_INFO "\t\tinode generation %llu size %llu "
			       "mode %o\n",
			       btrfs_inode_generation(l, ii),
			       btrfs_inode_size(l, ii),
			       btrfs_inode_mode(l, ii));
			break;
		case BTRFS_DIR_ITEM_KEY:
			di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
			btrfs_dir_item_key_to_cpu(l, di, &found_key);
			printk(KERN_INFO "\t\tdir oid %llu type %u\n",
				found_key.objectid,
				btrfs_dir_type(l, di));
			break;
		case BTRFS_ROOT_ITEM_KEY:
			ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
			printk(KERN_INFO "\t\troot data bytenr %llu refs %u\n",
				btrfs_disk_root_bytenr(l, ri),
				btrfs_disk_root_refs(l, ri));
			break;
		case BTRFS_EXTENT_ITEM_KEY:
		case BTRFS_METADATA_ITEM_KEY:
			print_extent_item(l, i, type);
			break;
		case BTRFS_TREE_BLOCK_REF_KEY:
			printk(KERN_INFO "\t\ttree block backref\n");
			break;
		case BTRFS_SHARED_BLOCK_REF_KEY:
			printk(KERN_INFO "\t\tshared block backref\n");
			break;
		case BTRFS_EXTENT_DATA_REF_KEY:
			dref = btrfs_item_ptr(l, i,
					      struct btrfs_extent_data_ref);
			print_extent_data_ref(l, dref);
			break;
		case BTRFS_SHARED_DATA_REF_KEY:
			sref = btrfs_item_ptr(l, i,
					      struct btrfs_shared_data_ref);
			printk(KERN_INFO "\t\tshared data backref count %u\n",
			       btrfs_shared_data_ref_count(l, sref));
			break;
		case BTRFS_EXTENT_DATA_KEY:
			fi = btrfs_item_ptr(l, i,
					    struct btrfs_file_extent_item);
			if (btrfs_file_extent_type(l, fi) ==
			    BTRFS_FILE_EXTENT_INLINE) {
				printk(KERN_INFO "\t\tinline extent data "
				       "size %u\n",
				       btrfs_file_extent_inline_len(l, i, fi));
				break;
			}
			printk(KERN_INFO "\t\textent data disk bytenr %llu "
			       "nr %llu\n",
			       btrfs_file_extent_disk_bytenr(l, fi),
			       btrfs_file_extent_disk_num_bytes(l, fi));
			printk(KERN_INFO "\t\textent data offset %llu "
			       "nr %llu ram %llu\n",
			       btrfs_file_extent_offset(l, fi),
			       btrfs_file_extent_num_bytes(l, fi),
			       btrfs_file_extent_ram_bytes(l, fi));
			break;
		case BTRFS_EXTENT_REF_V0_KEY:
#ifdef BTRFS_COMPAT_EXTENT_TREE_V0
			print_extent_ref_v0(l, i);
#else
			BUG();
#endif
			break;
		case BTRFS_BLOCK_GROUP_ITEM_KEY:
			bi = btrfs_item_ptr(l, i,
					    struct btrfs_block_group_item);
			printk(KERN_INFO "\t\tblock group used %llu\n",
			       btrfs_disk_block_group_used(l, bi));
			break;
		case BTRFS_CHUNK_ITEM_KEY:
			print_chunk(l, btrfs_item_ptr(l, i,
						      struct btrfs_chunk));
			break;
		case BTRFS_DEV_ITEM_KEY:
			print_dev_item(l, btrfs_item_ptr(l, i,
					struct btrfs_dev_item));
			break;
		case BTRFS_DEV_EXTENT_KEY:
			dev_extent = btrfs_item_ptr(l, i,
						    struct btrfs_dev_extent);
			printk(KERN_INFO "\t\tdev extent chunk_tree %llu\n"
			       "\t\tchunk objectid %llu chunk offset %llu "
			       "length %llu\n",
			       btrfs_dev_extent_chunk_tree(l, dev_extent),
			       btrfs_dev_extent_chunk_objectid(l, dev_extent),
			       btrfs_dev_extent_chunk_offset(l, dev_extent),
			       btrfs_dev_extent_length(l, dev_extent));
			break;
		case BTRFS_PERSISTENT_ITEM_KEY:
			printk(KERN_INFO "\t\tpersistent item objectid %llu offset %llu\n",
					key.objectid, key.offset);
			switch (key.objectid) {
			case BTRFS_DEV_STATS_OBJECTID:
				printk(KERN_INFO "\t\tdevice stats\n");
				break;
			default:
				printk(KERN_INFO "\t\tunknown persistent item\n");
			}
			break;
		case BTRFS_TEMPORARY_ITEM_KEY:
			printk(KERN_INFO "\t\ttemporary item objectid %llu offset %llu\n",
					key.objectid, key.offset);
			switch (key.objectid) {
			case BTRFS_BALANCE_OBJECTID:
				printk(KERN_INFO "\t\tbalance status\n");
				break;
			default:
				printk(KERN_INFO "\t\tunknown temporary item\n");
			}
			break;
		case BTRFS_DEV_REPLACE_KEY:
			printk(KERN_INFO "\t\tdev replace\n");
			break;
		case BTRFS_UUID_KEY_SUBVOL:
		case BTRFS_UUID_KEY_RECEIVED_SUBVOL:
			print_uuid_item(l, btrfs_item_ptr_offset(l, i),
					btrfs_item_size_nr(l, i));
			break;
		};
	}
}

void btrfs_print_tree(struct btrfs_root *root, struct extent_buffer *c)
{
	int i; u32 nr;
	struct btrfs_key key;
	int level;

	if (!c)
		return;
	nr = btrfs_header_nritems(c);
	level = btrfs_header_level(c);
	if (level == 0) {
		btrfs_print_leaf(root, c);
		return;
	}
	btrfs_info(root->fs_info, "node %llu level %d total ptrs %d free spc %u",
		btrfs_header_bytenr(c), level, nr,
		(u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr);
	for (i = 0; i < nr; i++) {
		btrfs_node_key_to_cpu(c, &key, i);
		printk(KERN_INFO "\tkey %d (%llu %u %llu) block %llu\n",
		       i, key.objectid, key.type, key.offset,
		       btrfs_node_blockptr(c, i));
	}
	for (i = 0; i < nr; i++) {
		struct extent_buffer *next = read_tree_block(root,
					btrfs_node_blockptr(c, i),
					btrfs_node_ptr_generation(c, i));
		if (btrfs_is_leaf(next) &&
		   level != 1)
			BUG();
		if (btrfs_header_level(next) !=
		       level - 1)
			BUG();
		btrfs_print_tree(root, next);
		free_extent_buffer(next);
	}
}
Commit	Line	Data
6cbd5570 CM	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,
	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.
	12	*
	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.
	17	*/
	18
5de08d7d CM	19	#include "ctree.h"
5de08d7d CM	20	#include "disk-io.h"
35b7e476	21	#include "print-tree.h"
5de08d7d	22
0b86a832 CM	23	static void print_chunk(struct extent_buffer eb, struct btrfs_chunk chunk)
	24	{
	25	int num_stripes = btrfs_chunk_num_stripes(eb, chunk);
	26	int i;
d397712b CM	27	printk(KERN_INFO "\t\tchunk length %llu owner %llu type %llu "
d397712b CM	28	"num_stripes %d\n",
c1c9ff7c GU	29	btrfs_chunk_length(eb, chunk), btrfs_chunk_owner(eb, chunk),
c1c9ff7c GU	30	btrfs_chunk_type(eb, chunk), num_stripes);
0b86a832	31	for (i = 0 ; i < num_stripes ; i++) {
d397712b	32	printk(KERN_INFO "\t\t\tstripe %d devid %llu offset %llu\n", i,
c1c9ff7c GU	33	btrfs_stripe_devid_nr(eb, chunk, i),
c1c9ff7c GU	34	btrfs_stripe_offset_nr(eb, chunk, i));
0b86a832 CM	35	}
	36	}
	37	static void print_dev_item(struct extent_buffer *eb,
	38	struct btrfs_dev_item *dev_item)
	39	{
d397712b CM	40	printk(KERN_INFO "\t\tdev item devid %llu "
d397712b CM	41	"total_bytes %llu bytes used %llu\n",
c1c9ff7c GU	42	btrfs_device_id(eb, dev_item),
	43	btrfs_device_total_bytes(eb, dev_item),
	44	btrfs_device_bytes_used(eb, dev_item));
0b86a832	45	}
5d4f98a2 YZ	46	static void print_extent_data_ref(struct extent_buffer *eb,
	47	struct btrfs_extent_data_ref *ref)
	48	{
	49	printk(KERN_INFO "\t\textent data backref root %llu "
	50	"objectid %llu offset %llu count %u\n",
c1c9ff7c GU	51	btrfs_extent_data_ref_root(eb, ref),
	52	btrfs_extent_data_ref_objectid(eb, ref),
	53	btrfs_extent_data_ref_offset(eb, ref),
5d4f98a2 YZ	54	btrfs_extent_data_ref_count(eb, ref));
	55	}
	56
be2c765d	57	static void print_extent_item(struct extent_buffer *eb, int slot, int type)
5d4f98a2 YZ	58	{
	59	struct btrfs_extent_item *ei;
	60	struct btrfs_extent_inline_ref *iref;
	61	struct btrfs_extent_data_ref *dref;
	62	struct btrfs_shared_data_ref *sref;
	63	struct btrfs_disk_key key;
	64	unsigned long end;
	65	unsigned long ptr;
5d4f98a2 YZ	66	u32 item_size = btrfs_item_size_nr(eb, slot);
	67	u64 flags;
	68	u64 offset;
	69
	70	if (item_size < sizeof(*ei)) {
	71	#ifdef BTRFS_COMPAT_EXTENT_TREE_V0
	72	struct btrfs_extent_item_v0 *ei0;
	73	BUG_ON(item_size != sizeof(*ei0));
	74	ei0 = btrfs_item_ptr(eb, slot, struct btrfs_extent_item_v0);
	75	printk(KERN_INFO "\t\textent refs %u\n",
	76	btrfs_extent_refs_v0(eb, ei0));
	77	return;
	78	#else
	79	BUG();
	80	#endif
	81	}
	82
	83	ei = btrfs_item_ptr(eb, slot, struct btrfs_extent_item);
	84	flags = btrfs_extent_flags(eb, ei);
	85
	86	printk(KERN_INFO "\t\textent refs %llu gen %llu flags %llu\n",
c1c9ff7c GU	87	btrfs_extent_refs(eb, ei), btrfs_extent_generation(eb, ei),
c1c9ff7c GU	88	flags);
5d4f98a2	89
be2c765d JB	90	if ((type == BTRFS_EXTENT_ITEM_KEY) &&
be2c765d JB	91	flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) {
5d4f98a2 YZ	92	struct btrfs_tree_block_info *info;
	93	info = (struct btrfs_tree_block_info *)(ei + 1);
	94	btrfs_tree_block_key(eb, info, &key);
d4c34f6b	95	printk(KERN_INFO "\t\ttree block key (%llu %u %llu) "
5d4f98a2	96	"level %d\n",
c1c9ff7c GU	97	btrfs_disk_key_objectid(&key), key.type,
c1c9ff7c GU	98	btrfs_disk_key_offset(&key),
5d4f98a2 YZ	99	btrfs_tree_block_level(eb, info));
	100	iref = (struct btrfs_extent_inline_ref *)(info + 1);
	101	} else {
	102	iref = (struct btrfs_extent_inline_ref *)(ei + 1);
	103	}
	104
	105	ptr = (unsigned long)iref;
	106	end = (unsigned long)ei + item_size;
	107	while (ptr < end) {
	108	iref = (struct btrfs_extent_inline_ref *)ptr;
	109	type = btrfs_extent_inline_ref_type(eb, iref);
	110	offset = btrfs_extent_inline_ref_offset(eb, iref);
	111	switch (type) {
	112	case BTRFS_TREE_BLOCK_REF_KEY:
	113	printk(KERN_INFO "\t\ttree block backref "
c1c9ff7c	114	"root %llu\n", offset);
5d4f98a2 YZ	115	break;
	116	case BTRFS_SHARED_BLOCK_REF_KEY:
	117	printk(KERN_INFO "\t\tshared block backref "
c1c9ff7c	118	"parent %llu\n", offset);
5d4f98a2 YZ	119	break;
	120	case BTRFS_EXTENT_DATA_REF_KEY:
	121	dref = (struct btrfs_extent_data_ref *)(&iref->offset);
	122	print_extent_data_ref(eb, dref);
	123	break;
	124	case BTRFS_SHARED_DATA_REF_KEY:
	125	sref = (struct btrfs_shared_data_ref *)(iref + 1);
	126	printk(KERN_INFO "\t\tshared data backref "
	127	"parent %llu count %u\n",
c1c9ff7c	128	offset, btrfs_shared_data_ref_count(eb, sref));
5d4f98a2 YZ	129	break;
	130	default:
	131	BUG();
	132	}
	133	ptr += btrfs_extent_inline_ref_size(type);
	134	}
	135	WARN_ON(ptr > end);
	136	}
	137
	138	#ifdef BTRFS_COMPAT_EXTENT_TREE_V0
	139	static void print_extent_ref_v0(struct extent_buffer *eb, int slot)
	140	{
	141	struct btrfs_extent_ref_v0 *ref0;
	142
	143	ref0 = btrfs_item_ptr(eb, slot, struct btrfs_extent_ref_v0);
	144	printk("\t\textent back ref root %llu gen %llu "
	145	"owner %llu num_refs %lu\n",
c1c9ff7c GU	146	btrfs_ref_root_v0(eb, ref0),
	147	btrfs_ref_generation_v0(eb, ref0),
	148	btrfs_ref_objectid_v0(eb, ref0),
5d4f98a2 YZ	149	(unsigned long)btrfs_ref_count_v0(eb, ref0));
	150	}
	151	#endif
	152
8f8ae8e2 SB	153	static void print_uuid_item(struct extent_buffer *l, unsigned long offset,
	154	u32 item_size)
	155	{
	156	if (!IS_ALIGNED(item_size, sizeof(u64))) {
efe120a0	157	pr_warn("BTRFS: uuid item with illegal size %lu!\n",
8f8ae8e2 SB	158	(unsigned long)item_size);
	159	return;
	160	}
	161	while (item_size) {
	162	__le64 subvol_id;
	163
	164	read_extent_buffer(l, &subvol_id, offset, sizeof(subvol_id));
	165	printk(KERN_INFO "\t\tsubvol_id %llu\n",
	166	(unsigned long long)le64_to_cpu(subvol_id));
	167	item_size -= sizeof(u64);
	168	offset += sizeof(u64);
	169	}
	170	}
	171
5f39d397	172	void btrfs_print_leaf(struct btrfs_root root, struct extent_buffer l)
5de08d7d CM	173	{
5de08d7d CM	174	int i;
068132ba	175	u32 type, nr;
0783fcfc	176	struct btrfs_item *item;
3768f368	177	struct btrfs_root_item *ri;
1d4f6404	178	struct btrfs_dir_item *di;
293ffd5f	179	struct btrfs_inode_item *ii;
9078a3e1	180	struct btrfs_block_group_item *bi;
8c2383c3	181	struct btrfs_file_extent_item *fi;
5d4f98a2 YZ	182	struct btrfs_extent_data_ref *dref;
	183	struct btrfs_shared_data_ref *sref;
	184	struct btrfs_dev_extent *dev_extent;
5f39d397 CM	185	struct btrfs_key key;
5f39d397 CM	186	struct btrfs_key found_key;
1d4f6404	187
068132ba DB	188	if (!l)
	189	return;
	190
	191	nr = btrfs_header_nritems(l);
	192
c2cf52eb	193	btrfs_info(root->fs_info, "leaf %llu total ptrs %d free space %d",
c1c9ff7c	194	btrfs_header_bytenr(l), nr, btrfs_leaf_free_space(root, l));
5de08d7d	195	for (i = 0 ; i < nr ; i++) {
dd3cc16b	196	item = btrfs_item_nr(i);
5f39d397	197	btrfs_item_key_to_cpu(l, &key, i);
962a298f	198	type = key.type;
d4c34f6b	199	printk(KERN_INFO "\titem %d key (%llu %u %llu) itemoff %d "
d397712b	200	"itemsize %d\n",
c1c9ff7c	201	i, key.objectid, type, key.offset,
5f39d397	202	btrfs_item_offset(l, item), btrfs_item_size(l, item));
62e2749e CM	203	switch (type) {
62e2749e CM	204	case BTRFS_INODE_ITEM_KEY:
293ffd5f	205	ii = btrfs_item_ptr(l, i, struct btrfs_inode_item);
d397712b CM	206	printk(KERN_INFO "\t\tinode generation %llu size %llu "
d397712b CM	207	"mode %o\n",
d397712b	208	btrfs_inode_generation(l, ii),
c1c9ff7c	209	btrfs_inode_size(l, ii),
5f39d397	210	btrfs_inode_mode(l, ii));
62e2749e CM	211	break;
62e2749e CM	212	case BTRFS_DIR_ITEM_KEY:
1d4f6404	213	di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
5f39d397	214	btrfs_dir_item_key_to_cpu(l, di, &found_key);
d397712b	215	printk(KERN_INFO "\t\tdir oid %llu type %u\n",
c1c9ff7c	216	found_key.objectid,
5f39d397	217	btrfs_dir_type(l, di));
62e2749e CM	218	break;
	219	case BTRFS_ROOT_ITEM_KEY:
	220	ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
d397712b	221	printk(KERN_INFO "\t\troot data bytenr %llu refs %u\n",
d397712b	222	btrfs_disk_root_bytenr(l, ri),
5f39d397	223	btrfs_disk_root_refs(l, ri));
62e2749e CM	224	break;
62e2749e CM	225	case BTRFS_EXTENT_ITEM_KEY:
be2c765d JB	226	case BTRFS_METADATA_ITEM_KEY:
be2c765d JB	227	print_extent_item(l, i, type);
62e2749e	228	break;
5d4f98a2 YZ	229	case BTRFS_TREE_BLOCK_REF_KEY:
	230	printk(KERN_INFO "\t\ttree block backref\n");
	231	break;
	232	case BTRFS_SHARED_BLOCK_REF_KEY:
	233	printk(KERN_INFO "\t\tshared block backref\n");
	234	break;
	235	case BTRFS_EXTENT_DATA_REF_KEY:
	236	dref = btrfs_item_ptr(l, i,
	237	struct btrfs_extent_data_ref);
	238	print_extent_data_ref(l, dref);
	239	break;
	240	case BTRFS_SHARED_DATA_REF_KEY:
	241	sref = btrfs_item_ptr(l, i,
	242	struct btrfs_shared_data_ref);
	243	printk(KERN_INFO "\t\tshared data backref count %u\n",
	244	btrfs_shared_data_ref_count(l, sref));
7bb86316	245	break;
8c2383c3 CM	246	case BTRFS_EXTENT_DATA_KEY:
	247	fi = btrfs_item_ptr(l, i,
	248	struct btrfs_file_extent_item);
5f39d397	249	if (btrfs_file_extent_type(l, fi) ==
8c2383c3	250	BTRFS_FILE_EXTENT_INLINE) {
d397712b CM	251	printk(KERN_INFO "\t\tinline extent data "
d397712b CM	252	"size %u\n",
514ac8ad	253	btrfs_file_extent_inline_len(l, i, fi));
8c2383c3 CM	254	break;
8c2383c3 CM	255	}
d397712b CM	256	printk(KERN_INFO "\t\textent data disk bytenr %llu "
d397712b CM	257	"nr %llu\n",
d397712b	258	btrfs_file_extent_disk_bytenr(l, fi),
d397712b CM	259	btrfs_file_extent_disk_num_bytes(l, fi));
	260	printk(KERN_INFO "\t\textent data offset %llu "
	261	"nr %llu ram %llu\n",
d397712b	262	btrfs_file_extent_offset(l, fi),
d397712b	263	btrfs_file_extent_num_bytes(l, fi),
d397712b	264	btrfs_file_extent_ram_bytes(l, fi));
8c2383c3	265	break;
5d4f98a2 YZ	266	case BTRFS_EXTENT_REF_V0_KEY:
	267	#ifdef BTRFS_COMPAT_EXTENT_TREE_V0
	268	print_extent_ref_v0(l, i);
	269	#else
	270	BUG();
	271	#endif
333e8105	272	break;
9078a3e1 CM	273	case BTRFS_BLOCK_GROUP_ITEM_KEY:
	274	bi = btrfs_item_ptr(l, i,
	275	struct btrfs_block_group_item);
d397712b	276	printk(KERN_INFO "\t\tblock group used %llu\n",
d397712b	277	btrfs_disk_block_group_used(l, bi));
62e2749e	278	break;
0b86a832	279	case BTRFS_CHUNK_ITEM_KEY:
d397712b CM	280	print_chunk(l, btrfs_item_ptr(l, i,
d397712b CM	281	struct btrfs_chunk));
0b86a832 CM	282	break;
	283	case BTRFS_DEV_ITEM_KEY:
	284	print_dev_item(l, btrfs_item_ptr(l, i,
	285	struct btrfs_dev_item));
	286	break;
	287	case BTRFS_DEV_EXTENT_KEY:
	288	dev_extent = btrfs_item_ptr(l, i,
	289	struct btrfs_dev_extent);
d397712b	290	printk(KERN_INFO "\t\tdev extent chunk_tree %llu\n"
e17cade2 CM	291	"\t\tchunk objectid %llu chunk offset %llu "
e17cade2 CM	292	"length %llu\n",
e17cade2	293	btrfs_dev_extent_chunk_tree(l, dev_extent),
e17cade2	294	btrfs_dev_extent_chunk_objectid(l, dev_extent),
e17cade2	295	btrfs_dev_extent_chunk_offset(l, dev_extent),
e17cade2	296	btrfs_dev_extent_length(l, dev_extent));
0e636027	297	break;
585a3d0d DS	298	case BTRFS_PERSISTENT_ITEM_KEY:
	299	printk(KERN_INFO "\t\tpersistent item objectid %llu offset %llu\n",
	300	key.objectid, key.offset);
	301	switch (key.objectid) {
	302	case BTRFS_DEV_STATS_OBJECTID:
	303	printk(KERN_INFO "\t\tdevice stats\n");
	304	break;
	305	default:
	306	printk(KERN_INFO "\t\tunknown persistent item\n");
	307	}
733f4fbb	308	break;
9f07e1d7 DS	309	case BTRFS_TEMPORARY_ITEM_KEY:
	310	printk(KERN_INFO "\t\ttemporary item objectid %llu offset %llu\n",
	311	key.objectid, key.offset);
	312	switch (key.objectid) {
	313	case BTRFS_BALANCE_OBJECTID:
	314	printk(KERN_INFO "\t\tbalance status\n");
	315	break;
	316	default:
	317	printk(KERN_INFO "\t\tunknown temporary item\n");
	318	}
	319	break;
a2bff640 SB	320	case BTRFS_DEV_REPLACE_KEY:
	321	printk(KERN_INFO "\t\tdev replace\n");
	322	break;
8f8ae8e2 SB	323	case BTRFS_UUID_KEY_SUBVOL:
	324	case BTRFS_UUID_KEY_RECEIVED_SUBVOL:
	325	print_uuid_item(l, btrfs_item_ptr_offset(l, i),
	326	btrfs_item_size_nr(l, i));
	327	break;
62e2749e	328	};
5de08d7d CM	329	}
5de08d7d CM	330	}
e20d96d6	331
5f39d397	332	void btrfs_print_tree(struct btrfs_root root, struct extent_buffer c)
5de08d7d	333	{
e17cade2	334	int i; u32 nr;
5f39d397	335	struct btrfs_key key;
db94535d	336	int level;
5de08d7d	337
5f39d397	338	if (!c)
5de08d7d	339	return;
5f39d397	340	nr = btrfs_header_nritems(c);
db94535d CM	341	level = btrfs_header_level(c);
db94535d CM	342	if (level == 0) {
5f39d397	343	btrfs_print_leaf(root, c);
5de08d7d CM	344	return;
5de08d7d CM	345	}
c2cf52eb	346	btrfs_info(root->fs_info, "node %llu level %d total ptrs %d free spc %u",
c1c9ff7c GU	347	btrfs_header_bytenr(c), level, nr,
c1c9ff7c GU	348	(u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr);
5de08d7d	349	for (i = 0; i < nr; i++) {
5f39d397	350	btrfs_node_key_to_cpu(c, &key, i);
d397712b	351	printk(KERN_INFO "\tkey %d (%llu %u %llu) block %llu\n",
c1c9ff7c GU	352	i, key.objectid, key.type, key.offset,
c1c9ff7c GU	353	btrfs_node_blockptr(c, i));
5de08d7d CM	354	}
5de08d7d CM	355	for (i = 0; i < nr; i++) {
5f39d397	356	struct extent_buffer *next = read_tree_block(root,
db94535d	357	btrfs_node_blockptr(c, i),
ca7a79ad	358	btrfs_node_ptr_generation(c, i));
7518a238	359	if (btrfs_is_leaf(next) &&
c271b492	360	level != 1)
5de08d7d	361	BUG();
5f39d397	362	if (btrfs_header_level(next) !=
c271b492	363	level - 1)
5de08d7d	364	BUG();
5f39d397 CM	365	btrfs_print_tree(root, next);
5f39d397 CM	366	free_extent_buffer(next);
5de08d7d	367	}
5de08d7d	368	}