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