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 "print-tree.h"
23 static void print_chunk(struct extent_buffer
*eb
, struct btrfs_chunk
*chunk
)
25 int num_stripes
= btrfs_chunk_num_stripes(eb
, chunk
);
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
));
36 static void print_dev_item(struct extent_buffer
*eb
,
37 struct btrfs_dev_item
*dev_item
)
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
));
44 static void print_extent_data_ref(struct extent_buffer
*eb
,
45 struct btrfs_extent_data_ref
*ref
)
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
));
54 static void print_extent_item(struct extent_buffer
*eb
, int slot
, int type
)
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
;
63 u32 item_size
= btrfs_item_size_nr(eb
, slot
);
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
));
80 ei
= btrfs_item_ptr(eb
, slot
, struct btrfs_extent_item
);
81 flags
= btrfs_extent_flags(eb
, ei
);
83 pr_info("\t\textent refs %llu gen %llu flags %llu\n",
84 btrfs_extent_refs(eb
, ei
), btrfs_extent_generation(eb
, ei
),
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);
98 iref
= (struct btrfs_extent_inline_ref
*)(ei
+ 1);
101 ptr
= (unsigned long)iref
;
102 end
= (unsigned long)ei
+ item_size
;
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
);
108 case BTRFS_TREE_BLOCK_REF_KEY
:
109 pr_info("\t\ttree block backref root %llu\n", offset
);
111 case BTRFS_SHARED_BLOCK_REF_KEY
:
112 pr_info("\t\tshared block backref parent %llu\n", offset
);
114 case BTRFS_EXTENT_DATA_REF_KEY
:
115 dref
= (struct btrfs_extent_data_ref
*)(&iref
->offset
);
116 print_extent_data_ref(eb
, dref
);
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
));
126 ptr
+= btrfs_extent_inline_ref_size(type
);
131 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
132 static void print_extent_ref_v0(struct extent_buffer
*eb
, int slot
)
134 struct btrfs_extent_ref_v0
*ref0
;
136 ref0
= btrfs_item_ptr(eb
, slot
, struct btrfs_extent_ref_v0
);
137 printk("\t\textent back ref root %llu gen %llu owner %llu num_refs %lu\n",
138 btrfs_ref_root_v0(eb
, ref0
),
139 btrfs_ref_generation_v0(eb
, ref0
),
140 btrfs_ref_objectid_v0(eb
, ref0
),
141 (unsigned long)btrfs_ref_count_v0(eb
, ref0
));
145 static void print_uuid_item(struct extent_buffer
*l
, unsigned long offset
,
148 if (!IS_ALIGNED(item_size
, sizeof(u64
))) {
149 pr_warn("BTRFS: uuid item with illegal size %lu!\n",
150 (unsigned long)item_size
);
156 read_extent_buffer(l
, &subvol_id
, offset
, sizeof(subvol_id
));
157 pr_info("\t\tsubvol_id %llu\n",
158 (unsigned long long)le64_to_cpu(subvol_id
));
159 item_size
-= sizeof(u64
);
160 offset
+= sizeof(u64
);
164 void btrfs_print_leaf(struct btrfs_fs_info
*fs_info
, struct extent_buffer
*l
)
168 struct btrfs_item
*item
;
169 struct btrfs_root_item
*ri
;
170 struct btrfs_dir_item
*di
;
171 struct btrfs_inode_item
*ii
;
172 struct btrfs_block_group_item
*bi
;
173 struct btrfs_file_extent_item
*fi
;
174 struct btrfs_extent_data_ref
*dref
;
175 struct btrfs_shared_data_ref
*sref
;
176 struct btrfs_dev_extent
*dev_extent
;
177 struct btrfs_key key
;
178 struct btrfs_key found_key
;
183 nr
= btrfs_header_nritems(l
);
185 btrfs_info(fs_info
, "leaf %llu total ptrs %d free space %d",
186 btrfs_header_bytenr(l
), nr
,
187 btrfs_leaf_free_space(fs_info
, l
));
188 for (i
= 0 ; i
< nr
; i
++) {
189 item
= btrfs_item_nr(i
);
190 btrfs_item_key_to_cpu(l
, &key
, i
);
192 pr_info("\titem %d key (%llu %u %llu) itemoff %d itemsize %d\n",
193 i
, key
.objectid
, type
, key
.offset
,
194 btrfs_item_offset(l
, item
), btrfs_item_size(l
, item
));
196 case BTRFS_INODE_ITEM_KEY
:
197 ii
= btrfs_item_ptr(l
, i
, struct btrfs_inode_item
);
198 pr_info("\t\tinode generation %llu size %llu mode %o\n",
199 btrfs_inode_generation(l
, ii
),
200 btrfs_inode_size(l
, ii
),
201 btrfs_inode_mode(l
, ii
));
203 case BTRFS_DIR_ITEM_KEY
:
204 di
= btrfs_item_ptr(l
, i
, struct btrfs_dir_item
);
205 btrfs_dir_item_key_to_cpu(l
, di
, &found_key
);
206 pr_info("\t\tdir oid %llu type %u\n",
208 btrfs_dir_type(l
, di
));
210 case BTRFS_ROOT_ITEM_KEY
:
211 ri
= btrfs_item_ptr(l
, i
, struct btrfs_root_item
);
212 pr_info("\t\troot data bytenr %llu refs %u\n",
213 btrfs_disk_root_bytenr(l
, ri
),
214 btrfs_disk_root_refs(l
, ri
));
216 case BTRFS_EXTENT_ITEM_KEY
:
217 case BTRFS_METADATA_ITEM_KEY
:
218 print_extent_item(l
, i
, type
);
220 case BTRFS_TREE_BLOCK_REF_KEY
:
221 pr_info("\t\ttree block backref\n");
223 case BTRFS_SHARED_BLOCK_REF_KEY
:
224 pr_info("\t\tshared block backref\n");
226 case BTRFS_EXTENT_DATA_REF_KEY
:
227 dref
= btrfs_item_ptr(l
, i
,
228 struct btrfs_extent_data_ref
);
229 print_extent_data_ref(l
, dref
);
231 case BTRFS_SHARED_DATA_REF_KEY
:
232 sref
= btrfs_item_ptr(l
, i
,
233 struct btrfs_shared_data_ref
);
234 pr_info("\t\tshared data backref count %u\n",
235 btrfs_shared_data_ref_count(l
, sref
));
237 case BTRFS_EXTENT_DATA_KEY
:
238 fi
= btrfs_item_ptr(l
, i
,
239 struct btrfs_file_extent_item
);
240 if (btrfs_file_extent_type(l
, fi
) ==
241 BTRFS_FILE_EXTENT_INLINE
) {
242 pr_info("\t\tinline extent data size %u\n",
243 btrfs_file_extent_inline_len(l
, i
, fi
));
246 pr_info("\t\textent data disk bytenr %llu nr %llu\n",
247 btrfs_file_extent_disk_bytenr(l
, fi
),
248 btrfs_file_extent_disk_num_bytes(l
, fi
));
249 pr_info("\t\textent data offset %llu nr %llu ram %llu\n",
250 btrfs_file_extent_offset(l
, fi
),
251 btrfs_file_extent_num_bytes(l
, fi
),
252 btrfs_file_extent_ram_bytes(l
, fi
));
254 case BTRFS_EXTENT_REF_V0_KEY
:
255 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
256 print_extent_ref_v0(l
, i
);
261 case BTRFS_BLOCK_GROUP_ITEM_KEY
:
262 bi
= btrfs_item_ptr(l
, i
,
263 struct btrfs_block_group_item
);
264 pr_info("\t\tblock group used %llu\n",
265 btrfs_disk_block_group_used(l
, bi
));
267 case BTRFS_CHUNK_ITEM_KEY
:
268 print_chunk(l
, btrfs_item_ptr(l
, i
,
269 struct btrfs_chunk
));
271 case BTRFS_DEV_ITEM_KEY
:
272 print_dev_item(l
, btrfs_item_ptr(l
, i
,
273 struct btrfs_dev_item
));
275 case BTRFS_DEV_EXTENT_KEY
:
276 dev_extent
= btrfs_item_ptr(l
, i
,
277 struct btrfs_dev_extent
);
278 pr_info("\t\tdev extent chunk_tree %llu\n\t\tchunk objectid %llu chunk offset %llu length %llu\n",
279 btrfs_dev_extent_chunk_tree(l
, dev_extent
),
280 btrfs_dev_extent_chunk_objectid(l
, dev_extent
),
281 btrfs_dev_extent_chunk_offset(l
, dev_extent
),
282 btrfs_dev_extent_length(l
, dev_extent
));
284 case BTRFS_PERSISTENT_ITEM_KEY
:
285 pr_info("\t\tpersistent item objectid %llu offset %llu\n",
286 key
.objectid
, key
.offset
);
287 switch (key
.objectid
) {
288 case BTRFS_DEV_STATS_OBJECTID
:
289 pr_info("\t\tdevice stats\n");
292 pr_info("\t\tunknown persistent item\n");
295 case BTRFS_TEMPORARY_ITEM_KEY
:
296 pr_info("\t\ttemporary item objectid %llu offset %llu\n",
297 key
.objectid
, key
.offset
);
298 switch (key
.objectid
) {
299 case BTRFS_BALANCE_OBJECTID
:
300 pr_info("\t\tbalance status\n");
303 pr_info("\t\tunknown temporary item\n");
306 case BTRFS_DEV_REPLACE_KEY
:
307 pr_info("\t\tdev replace\n");
309 case BTRFS_UUID_KEY_SUBVOL
:
310 case BTRFS_UUID_KEY_RECEIVED_SUBVOL
:
311 print_uuid_item(l
, btrfs_item_ptr_offset(l
, i
),
312 btrfs_item_size_nr(l
, i
));
318 void btrfs_print_tree(struct btrfs_fs_info
*fs_info
, struct extent_buffer
*c
)
321 struct btrfs_key key
;
326 nr
= btrfs_header_nritems(c
);
327 level
= btrfs_header_level(c
);
329 btrfs_print_leaf(fs_info
, c
);
333 "node %llu level %d total ptrs %d free spc %u",
334 btrfs_header_bytenr(c
), level
, nr
,
335 (u32
)BTRFS_NODEPTRS_PER_BLOCK(fs_info
) - nr
);
336 for (i
= 0; i
< nr
; i
++) {
337 btrfs_node_key_to_cpu(c
, &key
, i
);
338 pr_info("\tkey %d (%llu %u %llu) block %llu\n",
339 i
, key
.objectid
, key
.type
, key
.offset
,
340 btrfs_node_blockptr(c
, i
));
342 for (i
= 0; i
< nr
; i
++) {
343 struct extent_buffer
*next
= read_tree_block(fs_info
,
344 btrfs_node_blockptr(c
, i
),
345 btrfs_node_ptr_generation(c
, i
));
348 } else if (!extent_buffer_uptodate(next
)) {
349 free_extent_buffer(next
);
353 if (btrfs_is_leaf(next
) &&
356 if (btrfs_header_level(next
) !=
359 btrfs_print_tree(fs_info
, next
);
360 free_extent_buffer(next
);