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