Andrew Scull | b4b6d4a | 2019-01-02 15:54:55 +0000 | [diff] [blame] | 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 (unlikely(item_size < sizeof(*ei))) { |
| 56 | btrfs_print_v0_err(eb->fs_info); |
| 57 | btrfs_handle_fs_error(eb->fs_info, -EINVAL, NULL); |
| 58 | } |
| 59 | |
| 60 | ei = btrfs_item_ptr(eb, slot, struct btrfs_extent_item); |
| 61 | flags = btrfs_extent_flags(eb, ei); |
| 62 | |
| 63 | pr_info("\t\textent refs %llu gen %llu flags %llu\n", |
| 64 | btrfs_extent_refs(eb, ei), btrfs_extent_generation(eb, ei), |
| 65 | flags); |
| 66 | |
| 67 | if ((type == BTRFS_EXTENT_ITEM_KEY) && |
| 68 | flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { |
| 69 | struct btrfs_tree_block_info *info; |
| 70 | info = (struct btrfs_tree_block_info *)(ei + 1); |
| 71 | btrfs_tree_block_key(eb, info, &key); |
| 72 | pr_info("\t\ttree block key (%llu %u %llu) level %d\n", |
| 73 | btrfs_disk_key_objectid(&key), key.type, |
| 74 | btrfs_disk_key_offset(&key), |
| 75 | btrfs_tree_block_level(eb, info)); |
| 76 | iref = (struct btrfs_extent_inline_ref *)(info + 1); |
| 77 | } else { |
| 78 | iref = (struct btrfs_extent_inline_ref *)(ei + 1); |
| 79 | } |
| 80 | |
| 81 | ptr = (unsigned long)iref; |
| 82 | end = (unsigned long)ei + item_size; |
| 83 | while (ptr < end) { |
| 84 | iref = (struct btrfs_extent_inline_ref *)ptr; |
| 85 | type = btrfs_extent_inline_ref_type(eb, iref); |
| 86 | offset = btrfs_extent_inline_ref_offset(eb, iref); |
| 87 | pr_info("\t\tref#%d: ", ref_index++); |
| 88 | switch (type) { |
| 89 | case BTRFS_TREE_BLOCK_REF_KEY: |
| 90 | pr_cont("tree block backref root %llu\n", offset); |
| 91 | break; |
| 92 | case BTRFS_SHARED_BLOCK_REF_KEY: |
| 93 | pr_cont("shared block backref parent %llu\n", offset); |
| 94 | /* |
| 95 | * offset is supposed to be a tree block which |
| 96 | * must be aligned to nodesize. |
| 97 | */ |
Olivier Deprez | 0e64123 | 2021-09-23 10:07:05 +0200 | [diff] [blame^] | 98 | if (!IS_ALIGNED(offset, eb->fs_info->sectorsize)) |
| 99 | pr_info( |
| 100 | "\t\t\t(parent %llu not aligned to sectorsize %u)\n", |
| 101 | offset, eb->fs_info->sectorsize); |
Andrew Scull | b4b6d4a | 2019-01-02 15:54:55 +0000 | [diff] [blame] | 102 | break; |
| 103 | case BTRFS_EXTENT_DATA_REF_KEY: |
| 104 | dref = (struct btrfs_extent_data_ref *)(&iref->offset); |
| 105 | print_extent_data_ref(eb, dref); |
| 106 | break; |
| 107 | case BTRFS_SHARED_DATA_REF_KEY: |
| 108 | sref = (struct btrfs_shared_data_ref *)(iref + 1); |
| 109 | pr_cont("shared data backref parent %llu count %u\n", |
| 110 | offset, btrfs_shared_data_ref_count(eb, sref)); |
| 111 | /* |
| 112 | * offset is supposed to be a tree block which |
| 113 | * must be aligned to nodesize. |
| 114 | */ |
| 115 | if (!IS_ALIGNED(offset, eb->fs_info->nodesize)) |
Olivier Deprez | 0e64123 | 2021-09-23 10:07:05 +0200 | [diff] [blame^] | 116 | pr_info( |
| 117 | "\t\t\t(parent %llu not aligned to sectorsize %u)\n", |
| 118 | offset, eb->fs_info->sectorsize); |
Andrew Scull | b4b6d4a | 2019-01-02 15:54:55 +0000 | [diff] [blame] | 119 | break; |
| 120 | default: |
| 121 | pr_cont("(extent %llu has INVALID ref type %d)\n", |
| 122 | eb->start, type); |
| 123 | return; |
| 124 | } |
| 125 | ptr += btrfs_extent_inline_ref_size(type); |
| 126 | } |
| 127 | WARN_ON(ptr > end); |
| 128 | } |
| 129 | |
| 130 | static void print_uuid_item(struct extent_buffer *l, unsigned long offset, |
| 131 | u32 item_size) |
| 132 | { |
| 133 | if (!IS_ALIGNED(item_size, sizeof(u64))) { |
| 134 | pr_warn("BTRFS: uuid item with illegal size %lu!\n", |
| 135 | (unsigned long)item_size); |
| 136 | return; |
| 137 | } |
| 138 | while (item_size) { |
| 139 | __le64 subvol_id; |
| 140 | |
| 141 | read_extent_buffer(l, &subvol_id, offset, sizeof(subvol_id)); |
| 142 | pr_info("\t\tsubvol_id %llu\n", |
| 143 | (unsigned long long)le64_to_cpu(subvol_id)); |
| 144 | item_size -= sizeof(u64); |
| 145 | offset += sizeof(u64); |
| 146 | } |
| 147 | } |
| 148 | |
| 149 | /* |
| 150 | * Helper to output refs and locking status of extent buffer. Useful to debug |
| 151 | * race condition related problems. |
| 152 | */ |
| 153 | static void print_eb_refs_lock(struct extent_buffer *eb) |
| 154 | { |
| 155 | #ifdef CONFIG_BTRFS_DEBUG |
| 156 | btrfs_info(eb->fs_info, |
| 157 | "refs %u lock (w:%d r:%d bw:%d br:%d sw:%d sr:%d) lock_owner %u current %u", |
David Brazdil | 0f672f6 | 2019-12-10 10:32:29 +0000 | [diff] [blame] | 158 | atomic_read(&eb->refs), eb->write_locks, |
Andrew Scull | b4b6d4a | 2019-01-02 15:54:55 +0000 | [diff] [blame] | 159 | atomic_read(&eb->read_locks), |
David Brazdil | 0f672f6 | 2019-12-10 10:32:29 +0000 | [diff] [blame] | 160 | eb->blocking_writers, |
Andrew Scull | b4b6d4a | 2019-01-02 15:54:55 +0000 | [diff] [blame] | 161 | atomic_read(&eb->blocking_readers), |
David Brazdil | 0f672f6 | 2019-12-10 10:32:29 +0000 | [diff] [blame] | 162 | eb->spinning_writers, |
Andrew Scull | b4b6d4a | 2019-01-02 15:54:55 +0000 | [diff] [blame] | 163 | atomic_read(&eb->spinning_readers), |
| 164 | eb->lock_owner, current->pid); |
| 165 | #endif |
| 166 | } |
| 167 | |
| 168 | void btrfs_print_leaf(struct extent_buffer *l) |
| 169 | { |
| 170 | struct btrfs_fs_info *fs_info; |
| 171 | int i; |
| 172 | u32 type, nr; |
| 173 | struct btrfs_item *item; |
| 174 | struct btrfs_root_item *ri; |
| 175 | struct btrfs_dir_item *di; |
| 176 | struct btrfs_inode_item *ii; |
| 177 | struct btrfs_block_group_item *bi; |
| 178 | struct btrfs_file_extent_item *fi; |
| 179 | struct btrfs_extent_data_ref *dref; |
| 180 | struct btrfs_shared_data_ref *sref; |
| 181 | struct btrfs_dev_extent *dev_extent; |
| 182 | struct btrfs_key key; |
| 183 | struct btrfs_key found_key; |
| 184 | |
| 185 | if (!l) |
| 186 | return; |
| 187 | |
| 188 | fs_info = l->fs_info; |
| 189 | nr = btrfs_header_nritems(l); |
| 190 | |
| 191 | btrfs_info(fs_info, |
| 192 | "leaf %llu gen %llu total ptrs %d free space %d owner %llu", |
| 193 | btrfs_header_bytenr(l), btrfs_header_generation(l), nr, |
David Brazdil | 0f672f6 | 2019-12-10 10:32:29 +0000 | [diff] [blame] | 194 | btrfs_leaf_free_space(l), btrfs_header_owner(l)); |
Andrew Scull | b4b6d4a | 2019-01-02 15:54:55 +0000 | [diff] [blame] | 195 | print_eb_refs_lock(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 %llu\n", |
| 251 | btrfs_file_extent_ram_bytes(l, 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 | btrfs_print_v0_err(fs_info); |
| 264 | btrfs_handle_fs_error(fs_info, -EINVAL, NULL); |
| 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, bool follow) |
| 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 gen %llu total ptrs %d free spc %u owner %llu", |
| 344 | btrfs_header_bytenr(c), level, btrfs_header_generation(c), |
| 345 | nr, (u32)BTRFS_NODEPTRS_PER_BLOCK(fs_info) - nr, |
| 346 | btrfs_header_owner(c)); |
| 347 | print_eb_refs_lock(c); |
| 348 | for (i = 0; i < nr; i++) { |
| 349 | btrfs_node_key_to_cpu(c, &key, i); |
| 350 | pr_info("\tkey %d (%llu %u %llu) block %llu gen %llu\n", |
| 351 | i, key.objectid, key.type, key.offset, |
| 352 | btrfs_node_blockptr(c, i), |
| 353 | btrfs_node_ptr_generation(c, i)); |
| 354 | } |
| 355 | if (!follow) |
| 356 | return; |
| 357 | for (i = 0; i < nr; i++) { |
| 358 | struct btrfs_key first_key; |
| 359 | struct extent_buffer *next; |
| 360 | |
| 361 | btrfs_node_key_to_cpu(c, &first_key, i); |
| 362 | next = read_tree_block(fs_info, btrfs_node_blockptr(c, i), |
| 363 | btrfs_node_ptr_generation(c, i), |
| 364 | level - 1, &first_key); |
| 365 | if (IS_ERR(next)) { |
| 366 | continue; |
| 367 | } else if (!extent_buffer_uptodate(next)) { |
| 368 | free_extent_buffer(next); |
| 369 | continue; |
| 370 | } |
| 371 | |
| 372 | if (btrfs_is_leaf(next) && |
| 373 | level != 1) |
| 374 | BUG(); |
| 375 | if (btrfs_header_level(next) != |
| 376 | level - 1) |
| 377 | BUG(); |
| 378 | btrfs_print_tree(next, follow); |
| 379 | free_extent_buffer(next); |
| 380 | } |
| 381 | } |