1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (C) STRATO AG 2011. All rights reserved.
7 * This module can be used to catch cases when the btrfs kernel
8 * code executes write requests to the disk that bring the file
9 * system in an inconsistent state. In such a state, a power-loss
10 * or kernel panic event would cause that the data on disk is
11 * lost or at least damaged.
13 * Code is added that examines all block write requests during
14 * runtime (including writes of the super block). Three rules
15 * are verified and an error is printed on violation of the
17 * 1. It is not allowed to write a disk block which is
18 * currently referenced by the super block (either directly
20 * 2. When a super block is written, it is verified that all
21 * referenced (directly or indirectly) blocks fulfill the
22 * following requirements:
23 * 2a. All referenced blocks have either been present when
24 * the file system was mounted, (i.e., they have been
25 * referenced by the super block) or they have been
26 * written since then and the write completion callback
27 * was called and no write error was indicated and a
28 * FLUSH request to the device where these blocks are
29 * located was received and completed.
30 * 2b. All referenced blocks need to have a generation
31 * number which is equal to the parent's number.
33 * One issue that was found using this module was that the log
34 * tree on disk became temporarily corrupted because disk blocks
35 * that had been in use for the log tree had been freed and
36 * reused too early, while being referenced by the written super
39 * The search term in the kernel log that can be used to filter
40 * on the existence of detected integrity issues is
43 * The integrity check is enabled via mount options. These
44 * mount options are only supported if the integrity check
45 * tool is compiled by defining BTRFS_FS_CHECK_INTEGRITY.
47 * Example #1, apply integrity checks to all metadata:
48 * mount /dev/sdb1 /mnt -o check_int
50 * Example #2, apply integrity checks to all metadata and
52 * mount /dev/sdb1 /mnt -o check_int_data
54 * Example #3, apply integrity checks to all metadata and dump
55 * the tree that the super block references to kernel messages
56 * each time after a super block was written:
57 * mount /dev/sdb1 /mnt -o check_int,check_int_print_mask=263
59 * If the integrity check tool is included and activated in
60 * the mount options, plenty of kernel memory is used, and
61 * plenty of additional CPU cycles are spent. Enabling this
62 * functionality is not intended for normal use. In most
63 * cases, unless you are a btrfs developer who needs to verify
64 * the integrity of (super)-block write requests, do not
65 * enable the config option BTRFS_FS_CHECK_INTEGRITY to
66 * include and compile the integrity check tool.
68 * Expect millions of lines of information in the kernel log with an
69 * enabled check_int_print_mask. Therefore set LOG_BUF_SHIFT in the
70 * kernel config to at least 26 (which is 64MB). Usually the value is
71 * limited to 21 (which is 2MB) in init/Kconfig. The file needs to be
72 * changed like this before LOG_BUF_SHIFT can be set to a high value:
73 * config LOG_BUF_SHIFT
74 * int "Kernel log buffer size (16 => 64KB, 17 => 128KB)"
78 #include <linux/sched.h>
79 #include <linux/slab.h>
80 #include <linux/mutex.h>
81 #include <linux/blkdev.h>
83 #include <linux/string.h>
84 #include <crypto/hash.h>
88 #include "transaction.h"
89 #include "extent_io.h"
91 #include "print-tree.h"
93 #include "check-integrity.h"
94 #include "rcu-string.h"
95 #include "compression.h"
97 #define BTRFSIC_BLOCK_HASHTABLE_SIZE 0x10000
98 #define BTRFSIC_BLOCK_LINK_HASHTABLE_SIZE 0x10000
99 #define BTRFSIC_DEV2STATE_HASHTABLE_SIZE 0x100
100 #define BTRFSIC_BLOCK_MAGIC_NUMBER 0x14491051
101 #define BTRFSIC_BLOCK_LINK_MAGIC_NUMBER 0x11070807
102 #define BTRFSIC_DEV2STATE_MAGIC_NUMBER 0x20111530
103 #define BTRFSIC_BLOCK_STACK_FRAME_MAGIC_NUMBER 20111300
104 #define BTRFSIC_TREE_DUMP_MAX_INDENT_LEVEL (200 - 6) /* in characters,
105 * excluding " [...]" */
106 #define BTRFSIC_GENERATION_UNKNOWN ((u64)-1)
109 * The definition of the bitmask fields for the print_mask.
110 * They are specified with the mount option check_integrity_print_mask.
112 #define BTRFSIC_PRINT_MASK_SUPERBLOCK_WRITE 0x00000001
113 #define BTRFSIC_PRINT_MASK_ROOT_CHUNK_LOG_TREE_LOCATION 0x00000002
114 #define BTRFSIC_PRINT_MASK_TREE_AFTER_SB_WRITE 0x00000004
115 #define BTRFSIC_PRINT_MASK_TREE_BEFORE_SB_WRITE 0x00000008
116 #define BTRFSIC_PRINT_MASK_SUBMIT_BIO_BH 0x00000010
117 #define BTRFSIC_PRINT_MASK_END_IO_BIO_BH 0x00000020
118 #define BTRFSIC_PRINT_MASK_VERBOSE 0x00000040
119 #define BTRFSIC_PRINT_MASK_VERY_VERBOSE 0x00000080
120 #define BTRFSIC_PRINT_MASK_INITIAL_TREE 0x00000100
121 #define BTRFSIC_PRINT_MASK_INITIAL_ALL_TREES 0x00000200
122 #define BTRFSIC_PRINT_MASK_INITIAL_DATABASE 0x00000400
123 #define BTRFSIC_PRINT_MASK_NUM_COPIES 0x00000800
124 #define BTRFSIC_PRINT_MASK_TREE_WITH_ALL_MIRRORS 0x00001000
125 #define BTRFSIC_PRINT_MASK_SUBMIT_BIO_BH_VERBOSE 0x00002000
127 struct btrfsic_dev_state;
128 struct btrfsic_state;
130 struct btrfsic_block {
131 u32 magic_num; /* only used for debug purposes */
132 unsigned int is_metadata:1; /* if it is meta-data, not data-data */
133 unsigned int is_superblock:1; /* if it is one of the superblocks */
134 unsigned int is_iodone:1; /* if is done by lower subsystem */
135 unsigned int iodone_w_error:1; /* error was indicated to endio */
136 unsigned int never_written:1; /* block was added because it was
137 * referenced, not because it was
139 unsigned int mirror_num; /* large enough to hold
140 * BTRFS_SUPER_MIRROR_MAX */
141 struct btrfsic_dev_state *dev_state;
142 u64 dev_bytenr; /* key, physical byte num on disk */
143 u64 logical_bytenr; /* logical byte num on disk */
145 struct btrfs_disk_key disk_key; /* extra info to print in case of
146 * issues, will not always be correct */
147 struct list_head collision_resolving_node; /* list node */
148 struct list_head all_blocks_node; /* list node */
150 /* the following two lists contain block_link items */
151 struct list_head ref_to_list; /* list */
152 struct list_head ref_from_list; /* list */
153 struct btrfsic_block *next_in_same_bio;
154 void *orig_bio_private;
155 bio_end_io_t *orig_bio_end_io;
156 blk_opf_t submit_bio_bh_rw;
157 u64 flush_gen; /* only valid if !never_written */
161 * Elements of this type are allocated dynamically and required because
162 * each block object can refer to and can be ref from multiple blocks.
163 * The key to lookup them in the hashtable is the dev_bytenr of
164 * the block ref to plus the one from the block referred from.
165 * The fact that they are searchable via a hashtable and that a
166 * ref_cnt is maintained is not required for the btrfs integrity
167 * check algorithm itself, it is only used to make the output more
168 * beautiful in case that an error is detected (an error is defined
169 * as a write operation to a block while that block is still referenced).
171 struct btrfsic_block_link {
172 u32 magic_num; /* only used for debug purposes */
174 struct list_head node_ref_to; /* list node */
175 struct list_head node_ref_from; /* list node */
176 struct list_head collision_resolving_node; /* list node */
177 struct btrfsic_block *block_ref_to;
178 struct btrfsic_block *block_ref_from;
179 u64 parent_generation;
182 struct btrfsic_dev_state {
183 u32 magic_num; /* only used for debug purposes */
184 struct block_device *bdev;
185 struct btrfsic_state *state;
186 struct list_head collision_resolving_node; /* list node */
187 struct btrfsic_block dummy_block_for_bio_bh_flush;
191 struct btrfsic_block_hashtable {
192 struct list_head table[BTRFSIC_BLOCK_HASHTABLE_SIZE];
195 struct btrfsic_block_link_hashtable {
196 struct list_head table[BTRFSIC_BLOCK_LINK_HASHTABLE_SIZE];
199 struct btrfsic_dev_state_hashtable {
200 struct list_head table[BTRFSIC_DEV2STATE_HASHTABLE_SIZE];
203 struct btrfsic_block_data_ctx {
204 u64 start; /* virtual bytenr */
205 u64 dev_bytenr; /* physical bytenr on device */
207 struct btrfsic_dev_state *dev;
213 /* This structure is used to implement recursion without occupying
214 * any stack space, refer to btrfsic_process_metablock() */
215 struct btrfsic_stack_frame {
223 struct btrfsic_block *block;
224 struct btrfsic_block_data_ctx *block_ctx;
225 struct btrfsic_block *next_block;
226 struct btrfsic_block_data_ctx next_block_ctx;
227 struct btrfs_header *hdr;
228 struct btrfsic_stack_frame *prev;
231 /* Some state per mounted filesystem */
232 struct btrfsic_state {
234 int include_extent_data;
235 struct list_head all_blocks_list;
236 struct btrfsic_block_hashtable block_hashtable;
237 struct btrfsic_block_link_hashtable block_link_hashtable;
238 struct btrfs_fs_info *fs_info;
239 u64 max_superblock_generation;
240 struct btrfsic_block *latest_superblock;
245 static int btrfsic_process_metablock(struct btrfsic_state *state,
246 struct btrfsic_block *block,
247 struct btrfsic_block_data_ctx *block_ctx,
248 int limit_nesting, int force_iodone_flag);
249 static void btrfsic_read_from_block_data(
250 struct btrfsic_block_data_ctx *block_ctx,
251 void *dst, u32 offset, size_t len);
252 static int btrfsic_create_link_to_next_block(
253 struct btrfsic_state *state,
254 struct btrfsic_block *block,
255 struct btrfsic_block_data_ctx
256 *block_ctx, u64 next_bytenr,
258 struct btrfsic_block_data_ctx *next_block_ctx,
259 struct btrfsic_block **next_blockp,
260 int force_iodone_flag,
261 int *num_copiesp, int *mirror_nump,
262 struct btrfs_disk_key *disk_key,
263 u64 parent_generation);
264 static int btrfsic_handle_extent_data(struct btrfsic_state *state,
265 struct btrfsic_block *block,
266 struct btrfsic_block_data_ctx *block_ctx,
267 u32 item_offset, int force_iodone_flag);
268 static int btrfsic_map_block(struct btrfsic_state *state, u64 bytenr, u32 len,
269 struct btrfsic_block_data_ctx *block_ctx_out,
271 static void btrfsic_release_block_ctx(struct btrfsic_block_data_ctx *block_ctx);
272 static int btrfsic_read_block(struct btrfsic_state *state,
273 struct btrfsic_block_data_ctx *block_ctx);
274 static int btrfsic_process_written_superblock(
275 struct btrfsic_state *state,
276 struct btrfsic_block *const block,
277 struct btrfs_super_block *const super_hdr);
278 static void btrfsic_bio_end_io(struct bio *bp);
279 static int btrfsic_is_block_ref_by_superblock(const struct btrfsic_state *state,
280 const struct btrfsic_block *block,
281 int recursion_level);
282 static int btrfsic_check_all_ref_blocks(struct btrfsic_state *state,
283 struct btrfsic_block *const block,
284 int recursion_level);
285 static void btrfsic_print_add_link(const struct btrfsic_state *state,
286 const struct btrfsic_block_link *l);
287 static void btrfsic_print_rem_link(const struct btrfsic_state *state,
288 const struct btrfsic_block_link *l);
289 static char btrfsic_get_block_type(const struct btrfsic_state *state,
290 const struct btrfsic_block *block);
291 static void btrfsic_dump_tree(const struct btrfsic_state *state);
292 static void btrfsic_dump_tree_sub(const struct btrfsic_state *state,
293 const struct btrfsic_block *block,
295 static struct btrfsic_block_link *btrfsic_block_link_lookup_or_add(
296 struct btrfsic_state *state,
297 struct btrfsic_block_data_ctx *next_block_ctx,
298 struct btrfsic_block *next_block,
299 struct btrfsic_block *from_block,
300 u64 parent_generation);
301 static struct btrfsic_block *btrfsic_block_lookup_or_add(
302 struct btrfsic_state *state,
303 struct btrfsic_block_data_ctx *block_ctx,
304 const char *additional_string,
310 static int btrfsic_process_superblock_dev_mirror(
311 struct btrfsic_state *state,
312 struct btrfsic_dev_state *dev_state,
313 struct btrfs_device *device,
314 int superblock_mirror_num,
315 struct btrfsic_dev_state **selected_dev_state,
316 struct btrfs_super_block *selected_super);
317 static struct btrfsic_dev_state *btrfsic_dev_state_lookup(dev_t dev);
318 static void btrfsic_cmp_log_and_dev_bytenr(struct btrfsic_state *state,
320 struct btrfsic_dev_state *dev_state,
323 static struct mutex btrfsic_mutex;
324 static int btrfsic_is_initialized;
325 static struct btrfsic_dev_state_hashtable btrfsic_dev_state_hashtable;
328 static void btrfsic_block_init(struct btrfsic_block *b)
330 b->magic_num = BTRFSIC_BLOCK_MAGIC_NUMBER;
333 b->logical_bytenr = 0;
334 b->generation = BTRFSIC_GENERATION_UNKNOWN;
335 b->disk_key.objectid = 0;
336 b->disk_key.type = 0;
337 b->disk_key.offset = 0;
339 b->is_superblock = 0;
341 b->iodone_w_error = 0;
342 b->never_written = 0;
344 b->next_in_same_bio = NULL;
345 b->orig_bio_private = NULL;
346 b->orig_bio_end_io = NULL;
347 INIT_LIST_HEAD(&b->collision_resolving_node);
348 INIT_LIST_HEAD(&b->all_blocks_node);
349 INIT_LIST_HEAD(&b->ref_to_list);
350 INIT_LIST_HEAD(&b->ref_from_list);
351 b->submit_bio_bh_rw = 0;
355 static struct btrfsic_block *btrfsic_block_alloc(void)
357 struct btrfsic_block *b;
359 b = kzalloc(sizeof(*b), GFP_NOFS);
361 btrfsic_block_init(b);
366 static void btrfsic_block_free(struct btrfsic_block *b)
368 BUG_ON(!(NULL == b || BTRFSIC_BLOCK_MAGIC_NUMBER == b->magic_num));
372 static void btrfsic_block_link_init(struct btrfsic_block_link *l)
374 l->magic_num = BTRFSIC_BLOCK_LINK_MAGIC_NUMBER;
376 INIT_LIST_HEAD(&l->node_ref_to);
377 INIT_LIST_HEAD(&l->node_ref_from);
378 INIT_LIST_HEAD(&l->collision_resolving_node);
379 l->block_ref_to = NULL;
380 l->block_ref_from = NULL;
383 static struct btrfsic_block_link *btrfsic_block_link_alloc(void)
385 struct btrfsic_block_link *l;
387 l = kzalloc(sizeof(*l), GFP_NOFS);
389 btrfsic_block_link_init(l);
394 static void btrfsic_block_link_free(struct btrfsic_block_link *l)
396 BUG_ON(!(NULL == l || BTRFSIC_BLOCK_LINK_MAGIC_NUMBER == l->magic_num));
400 static void btrfsic_dev_state_init(struct btrfsic_dev_state *ds)
402 ds->magic_num = BTRFSIC_DEV2STATE_MAGIC_NUMBER;
405 INIT_LIST_HEAD(&ds->collision_resolving_node);
406 ds->last_flush_gen = 0;
407 btrfsic_block_init(&ds->dummy_block_for_bio_bh_flush);
408 ds->dummy_block_for_bio_bh_flush.is_iodone = 1;
409 ds->dummy_block_for_bio_bh_flush.dev_state = ds;
412 static struct btrfsic_dev_state *btrfsic_dev_state_alloc(void)
414 struct btrfsic_dev_state *ds;
416 ds = kzalloc(sizeof(*ds), GFP_NOFS);
418 btrfsic_dev_state_init(ds);
423 static void btrfsic_dev_state_free(struct btrfsic_dev_state *ds)
425 BUG_ON(!(NULL == ds ||
426 BTRFSIC_DEV2STATE_MAGIC_NUMBER == ds->magic_num));
430 static void btrfsic_block_hashtable_init(struct btrfsic_block_hashtable *h)
434 for (i = 0; i < BTRFSIC_BLOCK_HASHTABLE_SIZE; i++)
435 INIT_LIST_HEAD(h->table + i);
438 static void btrfsic_block_hashtable_add(struct btrfsic_block *b,
439 struct btrfsic_block_hashtable *h)
441 const unsigned int hashval =
442 (((unsigned int)(b->dev_bytenr >> 16)) ^
443 ((unsigned int)((uintptr_t)b->dev_state->bdev))) &
444 (BTRFSIC_BLOCK_HASHTABLE_SIZE - 1);
446 list_add(&b->collision_resolving_node, h->table + hashval);
449 static void btrfsic_block_hashtable_remove(struct btrfsic_block *b)
451 list_del(&b->collision_resolving_node);
454 static struct btrfsic_block *btrfsic_block_hashtable_lookup(
455 struct block_device *bdev,
457 struct btrfsic_block_hashtable *h)
459 const unsigned int hashval =
460 (((unsigned int)(dev_bytenr >> 16)) ^
461 ((unsigned int)((uintptr_t)bdev))) &
462 (BTRFSIC_BLOCK_HASHTABLE_SIZE - 1);
463 struct btrfsic_block *b;
465 list_for_each_entry(b, h->table + hashval, collision_resolving_node) {
466 if (b->dev_state->bdev == bdev && b->dev_bytenr == dev_bytenr)
473 static void btrfsic_block_link_hashtable_init(
474 struct btrfsic_block_link_hashtable *h)
478 for (i = 0; i < BTRFSIC_BLOCK_LINK_HASHTABLE_SIZE; i++)
479 INIT_LIST_HEAD(h->table + i);
482 static void btrfsic_block_link_hashtable_add(
483 struct btrfsic_block_link *l,
484 struct btrfsic_block_link_hashtable *h)
486 const unsigned int hashval =
487 (((unsigned int)(l->block_ref_to->dev_bytenr >> 16)) ^
488 ((unsigned int)(l->block_ref_from->dev_bytenr >> 16)) ^
489 ((unsigned int)((uintptr_t)l->block_ref_to->dev_state->bdev)) ^
490 ((unsigned int)((uintptr_t)l->block_ref_from->dev_state->bdev)))
491 & (BTRFSIC_BLOCK_LINK_HASHTABLE_SIZE - 1);
493 BUG_ON(NULL == l->block_ref_to);
494 BUG_ON(NULL == l->block_ref_from);
495 list_add(&l->collision_resolving_node, h->table + hashval);
498 static void btrfsic_block_link_hashtable_remove(struct btrfsic_block_link *l)
500 list_del(&l->collision_resolving_node);
503 static struct btrfsic_block_link *btrfsic_block_link_hashtable_lookup(
504 struct block_device *bdev_ref_to,
505 u64 dev_bytenr_ref_to,
506 struct block_device *bdev_ref_from,
507 u64 dev_bytenr_ref_from,
508 struct btrfsic_block_link_hashtable *h)
510 const unsigned int hashval =
511 (((unsigned int)(dev_bytenr_ref_to >> 16)) ^
512 ((unsigned int)(dev_bytenr_ref_from >> 16)) ^
513 ((unsigned int)((uintptr_t)bdev_ref_to)) ^
514 ((unsigned int)((uintptr_t)bdev_ref_from))) &
515 (BTRFSIC_BLOCK_LINK_HASHTABLE_SIZE - 1);
516 struct btrfsic_block_link *l;
518 list_for_each_entry(l, h->table + hashval, collision_resolving_node) {
519 BUG_ON(NULL == l->block_ref_to);
520 BUG_ON(NULL == l->block_ref_from);
521 if (l->block_ref_to->dev_state->bdev == bdev_ref_to &&
522 l->block_ref_to->dev_bytenr == dev_bytenr_ref_to &&
523 l->block_ref_from->dev_state->bdev == bdev_ref_from &&
524 l->block_ref_from->dev_bytenr == dev_bytenr_ref_from)
531 static void btrfsic_dev_state_hashtable_init(
532 struct btrfsic_dev_state_hashtable *h)
536 for (i = 0; i < BTRFSIC_DEV2STATE_HASHTABLE_SIZE; i++)
537 INIT_LIST_HEAD(h->table + i);
540 static void btrfsic_dev_state_hashtable_add(
541 struct btrfsic_dev_state *ds,
542 struct btrfsic_dev_state_hashtable *h)
544 const unsigned int hashval =
545 (((unsigned int)((uintptr_t)ds->bdev->bd_dev)) &
546 (BTRFSIC_DEV2STATE_HASHTABLE_SIZE - 1));
548 list_add(&ds->collision_resolving_node, h->table + hashval);
551 static void btrfsic_dev_state_hashtable_remove(struct btrfsic_dev_state *ds)
553 list_del(&ds->collision_resolving_node);
556 static struct btrfsic_dev_state *btrfsic_dev_state_hashtable_lookup(dev_t dev,
557 struct btrfsic_dev_state_hashtable *h)
559 const unsigned int hashval =
560 dev & (BTRFSIC_DEV2STATE_HASHTABLE_SIZE - 1);
561 struct btrfsic_dev_state *ds;
563 list_for_each_entry(ds, h->table + hashval, collision_resolving_node) {
564 if (ds->bdev->bd_dev == dev)
571 static int btrfsic_process_superblock(struct btrfsic_state *state,
572 struct btrfs_fs_devices *fs_devices)
574 struct btrfs_super_block *selected_super;
575 struct list_head *dev_head = &fs_devices->devices;
576 struct btrfs_device *device;
577 struct btrfsic_dev_state *selected_dev_state = NULL;
581 selected_super = kzalloc(sizeof(*selected_super), GFP_NOFS);
585 list_for_each_entry(device, dev_head, dev_list) {
587 struct btrfsic_dev_state *dev_state;
589 if (!device->bdev || !device->name)
592 dev_state = btrfsic_dev_state_lookup(device->bdev->bd_dev);
593 BUG_ON(NULL == dev_state);
594 for (i = 0; i < BTRFS_SUPER_MIRROR_MAX; i++) {
595 ret = btrfsic_process_superblock_dev_mirror(
596 state, dev_state, device, i,
597 &selected_dev_state, selected_super);
598 if (0 != ret && 0 == i) {
599 kfree(selected_super);
605 if (NULL == state->latest_superblock) {
606 pr_info("btrfsic: no superblock found!\n");
607 kfree(selected_super);
611 for (pass = 0; pass < 3; pass++) {
618 next_bytenr = btrfs_super_root(selected_super);
619 if (state->print_mask &
620 BTRFSIC_PRINT_MASK_ROOT_CHUNK_LOG_TREE_LOCATION)
621 pr_info("root@%llu\n", next_bytenr);
624 next_bytenr = btrfs_super_chunk_root(selected_super);
625 if (state->print_mask &
626 BTRFSIC_PRINT_MASK_ROOT_CHUNK_LOG_TREE_LOCATION)
627 pr_info("chunk@%llu\n", next_bytenr);
630 next_bytenr = btrfs_super_log_root(selected_super);
631 if (0 == next_bytenr)
633 if (state->print_mask &
634 BTRFSIC_PRINT_MASK_ROOT_CHUNK_LOG_TREE_LOCATION)
635 pr_info("log@%llu\n", next_bytenr);
639 num_copies = btrfs_num_copies(state->fs_info, next_bytenr,
640 state->metablock_size);
641 if (state->print_mask & BTRFSIC_PRINT_MASK_NUM_COPIES)
642 pr_info("num_copies(log_bytenr=%llu) = %d\n",
643 next_bytenr, num_copies);
645 for (mirror_num = 1; mirror_num <= num_copies; mirror_num++) {
646 struct btrfsic_block *next_block;
647 struct btrfsic_block_data_ctx tmp_next_block_ctx;
648 struct btrfsic_block_link *l;
650 ret = btrfsic_map_block(state, next_bytenr,
651 state->metablock_size,
655 pr_info("btrfsic: btrfsic_map_block(root @%llu, mirror %d) failed!\n",
656 next_bytenr, mirror_num);
657 kfree(selected_super);
661 next_block = btrfsic_block_hashtable_lookup(
662 tmp_next_block_ctx.dev->bdev,
663 tmp_next_block_ctx.dev_bytenr,
664 &state->block_hashtable);
665 BUG_ON(NULL == next_block);
667 l = btrfsic_block_link_hashtable_lookup(
668 tmp_next_block_ctx.dev->bdev,
669 tmp_next_block_ctx.dev_bytenr,
670 state->latest_superblock->dev_state->
672 state->latest_superblock->dev_bytenr,
673 &state->block_link_hashtable);
676 ret = btrfsic_read_block(state, &tmp_next_block_ctx);
677 if (ret < (int)PAGE_SIZE) {
678 pr_info("btrfsic: read @logical %llu failed!\n",
679 tmp_next_block_ctx.start);
680 btrfsic_release_block_ctx(&tmp_next_block_ctx);
681 kfree(selected_super);
685 ret = btrfsic_process_metablock(state,
688 BTRFS_MAX_LEVEL + 3, 1);
689 btrfsic_release_block_ctx(&tmp_next_block_ctx);
693 kfree(selected_super);
697 static int btrfsic_process_superblock_dev_mirror(
698 struct btrfsic_state *state,
699 struct btrfsic_dev_state *dev_state,
700 struct btrfs_device *device,
701 int superblock_mirror_num,
702 struct btrfsic_dev_state **selected_dev_state,
703 struct btrfs_super_block *selected_super)
705 struct btrfs_fs_info *fs_info = state->fs_info;
706 struct btrfs_super_block *super_tmp;
708 struct btrfsic_block *superblock_tmp;
710 struct block_device *const superblock_bdev = device->bdev;
712 struct address_space *mapping = superblock_bdev->bd_inode->i_mapping;
715 /* super block bytenr is always the unmapped device bytenr */
716 dev_bytenr = btrfs_sb_offset(superblock_mirror_num);
717 if (dev_bytenr + BTRFS_SUPER_INFO_SIZE > device->commit_total_bytes)
720 page = read_cache_page_gfp(mapping, dev_bytenr >> PAGE_SHIFT, GFP_NOFS);
724 super_tmp = page_address(page);
726 if (btrfs_super_bytenr(super_tmp) != dev_bytenr ||
727 btrfs_super_magic(super_tmp) != BTRFS_MAGIC ||
728 memcmp(device->uuid, super_tmp->dev_item.uuid, BTRFS_UUID_SIZE) ||
729 btrfs_super_nodesize(super_tmp) != state->metablock_size ||
730 btrfs_super_sectorsize(super_tmp) != state->datablock_size) {
736 btrfsic_block_hashtable_lookup(superblock_bdev,
738 &state->block_hashtable);
739 if (NULL == superblock_tmp) {
740 superblock_tmp = btrfsic_block_alloc();
741 if (NULL == superblock_tmp) {
745 /* for superblock, only the dev_bytenr makes sense */
746 superblock_tmp->dev_bytenr = dev_bytenr;
747 superblock_tmp->dev_state = dev_state;
748 superblock_tmp->logical_bytenr = dev_bytenr;
749 superblock_tmp->generation = btrfs_super_generation(super_tmp);
750 superblock_tmp->is_metadata = 1;
751 superblock_tmp->is_superblock = 1;
752 superblock_tmp->is_iodone = 1;
753 superblock_tmp->never_written = 0;
754 superblock_tmp->mirror_num = 1 + superblock_mirror_num;
755 if (state->print_mask & BTRFSIC_PRINT_MASK_SUPERBLOCK_WRITE)
756 btrfs_info_in_rcu(fs_info,
757 "new initial S-block (bdev %p, %s) @%llu (%pg/%llu/%d)",
759 rcu_str_deref(device->name), dev_bytenr,
760 dev_state->bdev, dev_bytenr,
761 superblock_mirror_num);
762 list_add(&superblock_tmp->all_blocks_node,
763 &state->all_blocks_list);
764 btrfsic_block_hashtable_add(superblock_tmp,
765 &state->block_hashtable);
768 /* select the one with the highest generation field */
769 if (btrfs_super_generation(super_tmp) >
770 state->max_superblock_generation ||
771 0 == state->max_superblock_generation) {
772 memcpy(selected_super, super_tmp, sizeof(*selected_super));
773 *selected_dev_state = dev_state;
774 state->max_superblock_generation =
775 btrfs_super_generation(super_tmp);
776 state->latest_superblock = superblock_tmp;
779 for (pass = 0; pass < 3; pass++) {
783 const char *additional_string = NULL;
784 struct btrfs_disk_key tmp_disk_key;
786 tmp_disk_key.type = BTRFS_ROOT_ITEM_KEY;
787 tmp_disk_key.offset = 0;
790 btrfs_set_disk_key_objectid(&tmp_disk_key,
791 BTRFS_ROOT_TREE_OBJECTID);
792 additional_string = "initial root ";
793 next_bytenr = btrfs_super_root(super_tmp);
796 btrfs_set_disk_key_objectid(&tmp_disk_key,
797 BTRFS_CHUNK_TREE_OBJECTID);
798 additional_string = "initial chunk ";
799 next_bytenr = btrfs_super_chunk_root(super_tmp);
802 btrfs_set_disk_key_objectid(&tmp_disk_key,
803 BTRFS_TREE_LOG_OBJECTID);
804 additional_string = "initial log ";
805 next_bytenr = btrfs_super_log_root(super_tmp);
806 if (0 == next_bytenr)
811 num_copies = btrfs_num_copies(fs_info, next_bytenr,
812 state->metablock_size);
813 if (state->print_mask & BTRFSIC_PRINT_MASK_NUM_COPIES)
814 pr_info("num_copies(log_bytenr=%llu) = %d\n",
815 next_bytenr, num_copies);
816 for (mirror_num = 1; mirror_num <= num_copies; mirror_num++) {
817 struct btrfsic_block *next_block;
818 struct btrfsic_block_data_ctx tmp_next_block_ctx;
819 struct btrfsic_block_link *l;
821 if (btrfsic_map_block(state, next_bytenr,
822 state->metablock_size,
825 pr_info("btrfsic: btrfsic_map_block(bytenr @%llu, mirror %d) failed!\n",
826 next_bytenr, mirror_num);
831 next_block = btrfsic_block_lookup_or_add(
832 state, &tmp_next_block_ctx,
833 additional_string, 1, 1, 0,
835 if (NULL == next_block) {
836 btrfsic_release_block_ctx(&tmp_next_block_ctx);
841 next_block->disk_key = tmp_disk_key;
842 next_block->generation = BTRFSIC_GENERATION_UNKNOWN;
843 l = btrfsic_block_link_lookup_or_add(
844 state, &tmp_next_block_ctx,
845 next_block, superblock_tmp,
846 BTRFSIC_GENERATION_UNKNOWN);
847 btrfsic_release_block_ctx(&tmp_next_block_ctx);
854 if (state->print_mask & BTRFSIC_PRINT_MASK_INITIAL_ALL_TREES)
855 btrfsic_dump_tree_sub(state, superblock_tmp, 0);
862 static struct btrfsic_stack_frame *btrfsic_stack_frame_alloc(void)
864 struct btrfsic_stack_frame *sf;
866 sf = kzalloc(sizeof(*sf), GFP_NOFS);
868 sf->magic = BTRFSIC_BLOCK_STACK_FRAME_MAGIC_NUMBER;
872 static void btrfsic_stack_frame_free(struct btrfsic_stack_frame *sf)
874 BUG_ON(!(NULL == sf ||
875 BTRFSIC_BLOCK_STACK_FRAME_MAGIC_NUMBER == sf->magic));
879 static noinline_for_stack int btrfsic_process_metablock(
880 struct btrfsic_state *state,
881 struct btrfsic_block *const first_block,
882 struct btrfsic_block_data_ctx *const first_block_ctx,
883 int first_limit_nesting, int force_iodone_flag)
885 struct btrfsic_stack_frame initial_stack_frame = { 0 };
886 struct btrfsic_stack_frame *sf;
887 struct btrfsic_stack_frame *next_stack;
888 struct btrfs_header *const first_hdr =
889 (struct btrfs_header *)first_block_ctx->datav[0];
892 sf = &initial_stack_frame;
895 sf->limit_nesting = first_limit_nesting;
896 sf->block = first_block;
897 sf->block_ctx = first_block_ctx;
898 sf->next_block = NULL;
902 continue_with_new_stack_frame:
903 sf->block->generation = btrfs_stack_header_generation(sf->hdr);
904 if (0 == sf->hdr->level) {
905 struct btrfs_leaf *const leafhdr =
906 (struct btrfs_leaf *)sf->hdr;
909 sf->nr = btrfs_stack_header_nritems(&leafhdr->header);
911 if (state->print_mask & BTRFSIC_PRINT_MASK_VERBOSE)
912 pr_info("leaf %llu items %d generation %llu owner %llu\n",
913 sf->block_ctx->start, sf->nr,
914 btrfs_stack_header_generation(
916 btrfs_stack_header_owner(
920 continue_with_current_leaf_stack_frame:
921 if (0 == sf->num_copies || sf->mirror_num > sf->num_copies) {
926 if (sf->i < sf->nr) {
927 struct btrfs_item disk_item;
928 u32 disk_item_offset =
929 (uintptr_t)(leafhdr->items + sf->i) -
931 struct btrfs_disk_key *disk_key;
936 if (disk_item_offset + sizeof(struct btrfs_item) >
937 sf->block_ctx->len) {
938 leaf_item_out_of_bounce_error:
940 "btrfsic: leaf item out of bounce at logical %llu, dev %pg\n",
941 sf->block_ctx->start,
942 sf->block_ctx->dev->bdev);
943 goto one_stack_frame_backwards;
945 btrfsic_read_from_block_data(sf->block_ctx,
948 sizeof(struct btrfs_item));
949 item_offset = btrfs_stack_item_offset(&disk_item);
950 item_size = btrfs_stack_item_size(&disk_item);
951 disk_key = &disk_item.key;
952 type = btrfs_disk_key_type(disk_key);
954 if (BTRFS_ROOT_ITEM_KEY == type) {
955 struct btrfs_root_item root_item;
956 u32 root_item_offset;
959 root_item_offset = item_offset +
960 offsetof(struct btrfs_leaf, items);
961 if (root_item_offset + item_size >
963 goto leaf_item_out_of_bounce_error;
964 btrfsic_read_from_block_data(
965 sf->block_ctx, &root_item,
968 next_bytenr = btrfs_root_bytenr(&root_item);
971 btrfsic_create_link_to_next_block(
983 btrfs_root_generation(
986 goto one_stack_frame_backwards;
988 if (NULL != sf->next_block) {
989 struct btrfs_header *const next_hdr =
990 (struct btrfs_header *)
991 sf->next_block_ctx.datav[0];
994 btrfsic_stack_frame_alloc();
995 if (NULL == next_stack) {
997 btrfsic_release_block_ctx(
1000 goto one_stack_frame_backwards;
1004 next_stack->block = sf->next_block;
1005 next_stack->block_ctx =
1006 &sf->next_block_ctx;
1007 next_stack->next_block = NULL;
1008 next_stack->hdr = next_hdr;
1009 next_stack->limit_nesting =
1010 sf->limit_nesting - 1;
1011 next_stack->prev = sf;
1013 goto continue_with_new_stack_frame;
1015 } else if (BTRFS_EXTENT_DATA_KEY == type &&
1016 state->include_extent_data) {
1017 sf->error = btrfsic_handle_extent_data(
1024 goto one_stack_frame_backwards;
1027 goto continue_with_current_leaf_stack_frame;
1030 struct btrfs_node *const nodehdr = (struct btrfs_node *)sf->hdr;
1033 sf->nr = btrfs_stack_header_nritems(&nodehdr->header);
1035 if (state->print_mask & BTRFSIC_PRINT_MASK_VERBOSE)
1036 pr_info("node %llu level %d items %d generation %llu owner %llu\n",
1037 sf->block_ctx->start,
1038 nodehdr->header.level, sf->nr,
1039 btrfs_stack_header_generation(
1041 btrfs_stack_header_owner(
1045 continue_with_current_node_stack_frame:
1046 if (0 == sf->num_copies || sf->mirror_num > sf->num_copies) {
1051 if (sf->i < sf->nr) {
1052 struct btrfs_key_ptr key_ptr;
1056 key_ptr_offset = (uintptr_t)(nodehdr->ptrs + sf->i) -
1058 if (key_ptr_offset + sizeof(struct btrfs_key_ptr) >
1059 sf->block_ctx->len) {
1061 "btrfsic: node item out of bounce at logical %llu, dev %pg\n",
1062 sf->block_ctx->start,
1063 sf->block_ctx->dev->bdev);
1064 goto one_stack_frame_backwards;
1066 btrfsic_read_from_block_data(
1067 sf->block_ctx, &key_ptr, key_ptr_offset,
1068 sizeof(struct btrfs_key_ptr));
1069 next_bytenr = btrfs_stack_key_blockptr(&key_ptr);
1071 sf->error = btrfsic_create_link_to_next_block(
1077 &sf->next_block_ctx,
1083 btrfs_stack_key_generation(&key_ptr));
1085 goto one_stack_frame_backwards;
1087 if (NULL != sf->next_block) {
1088 struct btrfs_header *const next_hdr =
1089 (struct btrfs_header *)
1090 sf->next_block_ctx.datav[0];
1092 next_stack = btrfsic_stack_frame_alloc();
1093 if (NULL == next_stack) {
1095 goto one_stack_frame_backwards;
1099 next_stack->block = sf->next_block;
1100 next_stack->block_ctx = &sf->next_block_ctx;
1101 next_stack->next_block = NULL;
1102 next_stack->hdr = next_hdr;
1103 next_stack->limit_nesting =
1104 sf->limit_nesting - 1;
1105 next_stack->prev = sf;
1107 goto continue_with_new_stack_frame;
1110 goto continue_with_current_node_stack_frame;
1114 one_stack_frame_backwards:
1115 if (NULL != sf->prev) {
1116 struct btrfsic_stack_frame *const prev = sf->prev;
1118 /* the one for the initial block is freed in the caller */
1119 btrfsic_release_block_ctx(sf->block_ctx);
1122 prev->error = sf->error;
1123 btrfsic_stack_frame_free(sf);
1125 goto one_stack_frame_backwards;
1128 btrfsic_stack_frame_free(sf);
1130 goto continue_with_new_stack_frame;
1132 BUG_ON(&initial_stack_frame != sf);
1138 static void btrfsic_read_from_block_data(
1139 struct btrfsic_block_data_ctx *block_ctx,
1140 void *dstv, u32 offset, size_t len)
1145 char *dst = (char *)dstv;
1146 size_t start_offset = offset_in_page(block_ctx->start);
1147 unsigned long i = (start_offset + offset) >> PAGE_SHIFT;
1149 WARN_ON(offset + len > block_ctx->len);
1150 pgoff = offset_in_page(start_offset + offset);
1153 cur = min(len, ((size_t)PAGE_SIZE - pgoff));
1154 BUG_ON(i >= DIV_ROUND_UP(block_ctx->len, PAGE_SIZE));
1155 kaddr = block_ctx->datav[i];
1156 memcpy(dst, kaddr + pgoff, cur);
1165 static int btrfsic_create_link_to_next_block(
1166 struct btrfsic_state *state,
1167 struct btrfsic_block *block,
1168 struct btrfsic_block_data_ctx *block_ctx,
1171 struct btrfsic_block_data_ctx *next_block_ctx,
1172 struct btrfsic_block **next_blockp,
1173 int force_iodone_flag,
1174 int *num_copiesp, int *mirror_nump,
1175 struct btrfs_disk_key *disk_key,
1176 u64 parent_generation)
1178 struct btrfs_fs_info *fs_info = state->fs_info;
1179 struct btrfsic_block *next_block = NULL;
1181 struct btrfsic_block_link *l;
1182 int did_alloc_block_link;
1183 int block_was_created;
1185 *next_blockp = NULL;
1186 if (0 == *num_copiesp) {
1187 *num_copiesp = btrfs_num_copies(fs_info, next_bytenr,
1188 state->metablock_size);
1189 if (state->print_mask & BTRFSIC_PRINT_MASK_NUM_COPIES)
1190 pr_info("num_copies(log_bytenr=%llu) = %d\n",
1191 next_bytenr, *num_copiesp);
1195 if (*mirror_nump > *num_copiesp)
1198 if (state->print_mask & BTRFSIC_PRINT_MASK_VERBOSE)
1199 pr_info("btrfsic_create_link_to_next_block(mirror_num=%d)\n",
1201 ret = btrfsic_map_block(state, next_bytenr,
1202 state->metablock_size,
1203 next_block_ctx, *mirror_nump);
1205 pr_info("btrfsic: btrfsic_map_block(@%llu, mirror=%d) failed!\n",
1206 next_bytenr, *mirror_nump);
1207 btrfsic_release_block_ctx(next_block_ctx);
1208 *next_blockp = NULL;
1212 next_block = btrfsic_block_lookup_or_add(state,
1213 next_block_ctx, "referenced ",
1214 1, force_iodone_flag,
1217 &block_was_created);
1218 if (NULL == next_block) {
1219 btrfsic_release_block_ctx(next_block_ctx);
1220 *next_blockp = NULL;
1223 if (block_was_created) {
1225 next_block->generation = BTRFSIC_GENERATION_UNKNOWN;
1227 if (state->print_mask & BTRFSIC_PRINT_MASK_VERBOSE) {
1228 if (next_block->logical_bytenr != next_bytenr &&
1229 !(!next_block->is_metadata &&
1230 0 == next_block->logical_bytenr))
1232 "referenced block @%llu (%pg/%llu/%d) found in hash table, %c, bytenr mismatch (!= stored %llu)\n",
1233 next_bytenr, next_block_ctx->dev->bdev,
1234 next_block_ctx->dev_bytenr, *mirror_nump,
1235 btrfsic_get_block_type(state,
1237 next_block->logical_bytenr);
1240 "referenced block @%llu (%pg/%llu/%d) found in hash table, %c\n",
1241 next_bytenr, next_block_ctx->dev->bdev,
1242 next_block_ctx->dev_bytenr, *mirror_nump,
1243 btrfsic_get_block_type(state,
1246 next_block->logical_bytenr = next_bytenr;
1248 next_block->mirror_num = *mirror_nump;
1249 l = btrfsic_block_link_hashtable_lookup(
1250 next_block_ctx->dev->bdev,
1251 next_block_ctx->dev_bytenr,
1252 block_ctx->dev->bdev,
1253 block_ctx->dev_bytenr,
1254 &state->block_link_hashtable);
1257 next_block->disk_key = *disk_key;
1259 l = btrfsic_block_link_alloc();
1261 btrfsic_release_block_ctx(next_block_ctx);
1262 *next_blockp = NULL;
1266 did_alloc_block_link = 1;
1267 l->block_ref_to = next_block;
1268 l->block_ref_from = block;
1270 l->parent_generation = parent_generation;
1272 if (state->print_mask & BTRFSIC_PRINT_MASK_VERBOSE)
1273 btrfsic_print_add_link(state, l);
1275 list_add(&l->node_ref_to, &block->ref_to_list);
1276 list_add(&l->node_ref_from, &next_block->ref_from_list);
1278 btrfsic_block_link_hashtable_add(l,
1279 &state->block_link_hashtable);
1281 did_alloc_block_link = 0;
1282 if (0 == limit_nesting) {
1284 l->parent_generation = parent_generation;
1285 if (state->print_mask & BTRFSIC_PRINT_MASK_VERBOSE)
1286 btrfsic_print_add_link(state, l);
1290 if (limit_nesting > 0 && did_alloc_block_link) {
1291 ret = btrfsic_read_block(state, next_block_ctx);
1292 if (ret < (int)next_block_ctx->len) {
1293 pr_info("btrfsic: read block @logical %llu failed!\n",
1295 btrfsic_release_block_ctx(next_block_ctx);
1296 *next_blockp = NULL;
1300 *next_blockp = next_block;
1302 *next_blockp = NULL;
1309 static int btrfsic_handle_extent_data(
1310 struct btrfsic_state *state,
1311 struct btrfsic_block *block,
1312 struct btrfsic_block_data_ctx *block_ctx,
1313 u32 item_offset, int force_iodone_flag)
1315 struct btrfs_fs_info *fs_info = state->fs_info;
1316 struct btrfs_file_extent_item file_extent_item;
1317 u64 file_extent_item_offset;
1321 struct btrfsic_block_link *l;
1324 file_extent_item_offset = offsetof(struct btrfs_leaf, items) +
1326 if (file_extent_item_offset +
1327 offsetof(struct btrfs_file_extent_item, disk_num_bytes) >
1329 pr_info("btrfsic: file item out of bounce at logical %llu, dev %pg\n",
1330 block_ctx->start, block_ctx->dev->bdev);
1334 btrfsic_read_from_block_data(block_ctx, &file_extent_item,
1335 file_extent_item_offset,
1336 offsetof(struct btrfs_file_extent_item, disk_num_bytes));
1337 if (BTRFS_FILE_EXTENT_REG != file_extent_item.type ||
1338 btrfs_stack_file_extent_disk_bytenr(&file_extent_item) == 0) {
1339 if (state->print_mask & BTRFSIC_PRINT_MASK_VERY_VERBOSE)
1340 pr_info("extent_data: type %u, disk_bytenr = %llu\n",
1341 file_extent_item.type,
1342 btrfs_stack_file_extent_disk_bytenr(
1343 &file_extent_item));
1347 if (file_extent_item_offset + sizeof(struct btrfs_file_extent_item) >
1349 pr_info("btrfsic: file item out of bounce at logical %llu, dev %pg\n",
1350 block_ctx->start, block_ctx->dev->bdev);
1353 btrfsic_read_from_block_data(block_ctx, &file_extent_item,
1354 file_extent_item_offset,
1355 sizeof(struct btrfs_file_extent_item));
1356 next_bytenr = btrfs_stack_file_extent_disk_bytenr(&file_extent_item);
1357 if (btrfs_stack_file_extent_compression(&file_extent_item) ==
1358 BTRFS_COMPRESS_NONE) {
1359 next_bytenr += btrfs_stack_file_extent_offset(&file_extent_item);
1360 num_bytes = btrfs_stack_file_extent_num_bytes(&file_extent_item);
1362 num_bytes = btrfs_stack_file_extent_disk_num_bytes(&file_extent_item);
1364 generation = btrfs_stack_file_extent_generation(&file_extent_item);
1366 if (state->print_mask & BTRFSIC_PRINT_MASK_VERY_VERBOSE)
1367 pr_info("extent_data: type %u, disk_bytenr = %llu, offset = %llu, num_bytes = %llu\n",
1368 file_extent_item.type,
1369 btrfs_stack_file_extent_disk_bytenr(&file_extent_item),
1370 btrfs_stack_file_extent_offset(&file_extent_item),
1372 while (num_bytes > 0) {
1377 if (num_bytes > state->datablock_size)
1378 chunk_len = state->datablock_size;
1380 chunk_len = num_bytes;
1382 num_copies = btrfs_num_copies(fs_info, next_bytenr,
1383 state->datablock_size);
1384 if (state->print_mask & BTRFSIC_PRINT_MASK_NUM_COPIES)
1385 pr_info("num_copies(log_bytenr=%llu) = %d\n",
1386 next_bytenr, num_copies);
1387 for (mirror_num = 1; mirror_num <= num_copies; mirror_num++) {
1388 struct btrfsic_block_data_ctx next_block_ctx;
1389 struct btrfsic_block *next_block;
1390 int block_was_created;
1392 if (state->print_mask & BTRFSIC_PRINT_MASK_VERBOSE)
1393 pr_info("btrfsic_handle_extent_data(mirror_num=%d)\n",
1395 if (state->print_mask & BTRFSIC_PRINT_MASK_VERY_VERBOSE)
1396 pr_info("\tdisk_bytenr = %llu, num_bytes %u\n",
1397 next_bytenr, chunk_len);
1398 ret = btrfsic_map_block(state, next_bytenr,
1399 chunk_len, &next_block_ctx,
1402 pr_info("btrfsic: btrfsic_map_block(@%llu, mirror=%d) failed!\n",
1403 next_bytenr, mirror_num);
1407 next_block = btrfsic_block_lookup_or_add(
1415 &block_was_created);
1416 if (NULL == next_block) {
1417 btrfsic_release_block_ctx(&next_block_ctx);
1420 if (!block_was_created) {
1421 if ((state->print_mask &
1422 BTRFSIC_PRINT_MASK_VERBOSE) &&
1423 next_block->logical_bytenr != next_bytenr &&
1424 !(!next_block->is_metadata &&
1425 0 == next_block->logical_bytenr)) {
1427 "referenced block @%llu (%pg/%llu/%d) found in hash table, D, bytenr mismatch (!= stored %llu)\n",
1429 next_block_ctx.dev->bdev,
1430 next_block_ctx.dev_bytenr,
1432 next_block->logical_bytenr);
1434 next_block->logical_bytenr = next_bytenr;
1435 next_block->mirror_num = mirror_num;
1438 l = btrfsic_block_link_lookup_or_add(state,
1442 btrfsic_release_block_ctx(&next_block_ctx);
1447 next_bytenr += chunk_len;
1448 num_bytes -= chunk_len;
1454 static int btrfsic_map_block(struct btrfsic_state *state, u64 bytenr, u32 len,
1455 struct btrfsic_block_data_ctx *block_ctx_out,
1458 struct btrfs_fs_info *fs_info = state->fs_info;
1461 struct btrfs_io_context *multi = NULL;
1462 struct btrfs_device *device;
1465 ret = btrfs_map_block(fs_info, BTRFS_MAP_READ,
1466 bytenr, &length, &multi, mirror_num);
1469 block_ctx_out->start = 0;
1470 block_ctx_out->dev_bytenr = 0;
1471 block_ctx_out->len = 0;
1472 block_ctx_out->dev = NULL;
1473 block_ctx_out->datav = NULL;
1474 block_ctx_out->pagev = NULL;
1475 block_ctx_out->mem_to_free = NULL;
1480 device = multi->stripes[0].dev;
1481 if (test_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state) ||
1482 !device->bdev || !device->name)
1483 block_ctx_out->dev = NULL;
1485 block_ctx_out->dev = btrfsic_dev_state_lookup(
1486 device->bdev->bd_dev);
1487 block_ctx_out->dev_bytenr = multi->stripes[0].physical;
1488 block_ctx_out->start = bytenr;
1489 block_ctx_out->len = len;
1490 block_ctx_out->datav = NULL;
1491 block_ctx_out->pagev = NULL;
1492 block_ctx_out->mem_to_free = NULL;
1495 if (NULL == block_ctx_out->dev) {
1497 pr_info("btrfsic: error, cannot lookup dev (#1)!\n");
1503 static void btrfsic_release_block_ctx(struct btrfsic_block_data_ctx *block_ctx)
1505 if (block_ctx->mem_to_free) {
1506 unsigned int num_pages;
1508 BUG_ON(!block_ctx->datav);
1509 BUG_ON(!block_ctx->pagev);
1510 num_pages = (block_ctx->len + (u64)PAGE_SIZE - 1) >>
1512 /* Pages must be unmapped in reverse order */
1513 while (num_pages > 0) {
1515 if (block_ctx->datav[num_pages])
1516 block_ctx->datav[num_pages] = NULL;
1517 if (block_ctx->pagev[num_pages]) {
1518 __free_page(block_ctx->pagev[num_pages]);
1519 block_ctx->pagev[num_pages] = NULL;
1523 kfree(block_ctx->mem_to_free);
1524 block_ctx->mem_to_free = NULL;
1525 block_ctx->pagev = NULL;
1526 block_ctx->datav = NULL;
1530 static int btrfsic_read_block(struct btrfsic_state *state,
1531 struct btrfsic_block_data_ctx *block_ctx)
1533 unsigned int num_pages;
1539 BUG_ON(block_ctx->datav);
1540 BUG_ON(block_ctx->pagev);
1541 BUG_ON(block_ctx->mem_to_free);
1542 if (!PAGE_ALIGNED(block_ctx->dev_bytenr)) {
1543 pr_info("btrfsic: read_block() with unaligned bytenr %llu\n",
1544 block_ctx->dev_bytenr);
1548 num_pages = (block_ctx->len + (u64)PAGE_SIZE - 1) >>
1550 size = sizeof(*block_ctx->datav) + sizeof(*block_ctx->pagev);
1551 block_ctx->mem_to_free = kcalloc(num_pages, size, GFP_NOFS);
1552 if (!block_ctx->mem_to_free)
1554 block_ctx->datav = block_ctx->mem_to_free;
1555 block_ctx->pagev = (struct page **)(block_ctx->datav + num_pages);
1556 ret = btrfs_alloc_page_array(num_pages, block_ctx->pagev);
1560 dev_bytenr = block_ctx->dev_bytenr;
1561 for (i = 0; i < num_pages;) {
1565 bio = bio_alloc(block_ctx->dev->bdev, num_pages - i,
1566 REQ_OP_READ, GFP_NOFS);
1567 bio->bi_iter.bi_sector = dev_bytenr >> 9;
1569 for (j = i; j < num_pages; j++) {
1570 ret = bio_add_page(bio, block_ctx->pagev[j],
1572 if (PAGE_SIZE != ret)
1576 pr_info("btrfsic: error, failed to add a single page!\n");
1579 if (submit_bio_wait(bio)) {
1580 pr_info("btrfsic: read error at logical %llu dev %pg!\n",
1581 block_ctx->start, block_ctx->dev->bdev);
1586 dev_bytenr += (j - i) * PAGE_SIZE;
1589 for (i = 0; i < num_pages; i++)
1590 block_ctx->datav[i] = page_address(block_ctx->pagev[i]);
1592 return block_ctx->len;
1595 static void btrfsic_dump_database(struct btrfsic_state *state)
1597 const struct btrfsic_block *b_all;
1599 BUG_ON(NULL == state);
1601 pr_info("all_blocks_list:\n");
1602 list_for_each_entry(b_all, &state->all_blocks_list, all_blocks_node) {
1603 const struct btrfsic_block_link *l;
1605 pr_info("%c-block @%llu (%pg/%llu/%d)\n",
1606 btrfsic_get_block_type(state, b_all),
1607 b_all->logical_bytenr, b_all->dev_state->bdev,
1608 b_all->dev_bytenr, b_all->mirror_num);
1610 list_for_each_entry(l, &b_all->ref_to_list, node_ref_to) {
1612 " %c @%llu (%pg/%llu/%d) refers %u* to %c @%llu (%pg/%llu/%d)\n",
1613 btrfsic_get_block_type(state, b_all),
1614 b_all->logical_bytenr, b_all->dev_state->bdev,
1615 b_all->dev_bytenr, b_all->mirror_num,
1617 btrfsic_get_block_type(state, l->block_ref_to),
1618 l->block_ref_to->logical_bytenr,
1619 l->block_ref_to->dev_state->bdev,
1620 l->block_ref_to->dev_bytenr,
1621 l->block_ref_to->mirror_num);
1624 list_for_each_entry(l, &b_all->ref_from_list, node_ref_from) {
1626 " %c @%llu (%pg/%llu/%d) is ref %u* from %c @%llu (%pg/%llu/%d)\n",
1627 btrfsic_get_block_type(state, b_all),
1628 b_all->logical_bytenr, b_all->dev_state->bdev,
1629 b_all->dev_bytenr, b_all->mirror_num,
1631 btrfsic_get_block_type(state, l->block_ref_from),
1632 l->block_ref_from->logical_bytenr,
1633 l->block_ref_from->dev_state->bdev,
1634 l->block_ref_from->dev_bytenr,
1635 l->block_ref_from->mirror_num);
1643 * Test whether the disk block contains a tree block (leaf or node)
1644 * (note that this test fails for the super block)
1646 static noinline_for_stack int btrfsic_test_for_metadata(
1647 struct btrfsic_state *state,
1648 char **datav, unsigned int num_pages)
1650 struct btrfs_fs_info *fs_info = state->fs_info;
1651 SHASH_DESC_ON_STACK(shash, fs_info->csum_shash);
1652 struct btrfs_header *h;
1653 u8 csum[BTRFS_CSUM_SIZE];
1656 if (num_pages * PAGE_SIZE < state->metablock_size)
1657 return 1; /* not metadata */
1658 num_pages = state->metablock_size >> PAGE_SHIFT;
1659 h = (struct btrfs_header *)datav[0];
1661 if (memcmp(h->fsid, fs_info->fs_devices->fsid, BTRFS_FSID_SIZE))
1664 shash->tfm = fs_info->csum_shash;
1665 crypto_shash_init(shash);
1667 for (i = 0; i < num_pages; i++) {
1668 u8 *data = i ? datav[i] : (datav[i] + BTRFS_CSUM_SIZE);
1669 size_t sublen = i ? PAGE_SIZE :
1670 (PAGE_SIZE - BTRFS_CSUM_SIZE);
1672 crypto_shash_update(shash, data, sublen);
1674 crypto_shash_final(shash, csum);
1675 if (memcmp(csum, h->csum, fs_info->csum_size))
1678 return 0; /* is metadata */
1681 static void btrfsic_process_written_block(struct btrfsic_dev_state *dev_state,
1682 u64 dev_bytenr, char **mapped_datav,
1683 unsigned int num_pages,
1684 struct bio *bio, int *bio_is_patched,
1685 blk_opf_t submit_bio_bh_rw)
1688 struct btrfsic_block *block;
1689 struct btrfsic_block_data_ctx block_ctx;
1691 struct btrfsic_state *state = dev_state->state;
1692 struct block_device *bdev = dev_state->bdev;
1693 unsigned int processed_len;
1695 if (NULL != bio_is_patched)
1696 *bio_is_patched = 0;
1703 is_metadata = (0 == btrfsic_test_for_metadata(state, mapped_datav,
1706 block = btrfsic_block_hashtable_lookup(bdev, dev_bytenr,
1707 &state->block_hashtable);
1708 if (NULL != block) {
1710 struct btrfsic_block_link *l, *tmp;
1712 if (block->is_superblock) {
1713 bytenr = btrfs_super_bytenr((struct btrfs_super_block *)
1715 if (num_pages * PAGE_SIZE <
1716 BTRFS_SUPER_INFO_SIZE) {
1717 pr_info("btrfsic: cannot work with too short bios!\n");
1721 BUG_ON(!PAGE_ALIGNED(BTRFS_SUPER_INFO_SIZE));
1722 processed_len = BTRFS_SUPER_INFO_SIZE;
1723 if (state->print_mask &
1724 BTRFSIC_PRINT_MASK_TREE_BEFORE_SB_WRITE) {
1725 pr_info("[before new superblock is written]:\n");
1726 btrfsic_dump_tree_sub(state, block, 0);
1730 if (!block->is_superblock) {
1731 if (num_pages * PAGE_SIZE <
1732 state->metablock_size) {
1733 pr_info("btrfsic: cannot work with too short bios!\n");
1736 processed_len = state->metablock_size;
1737 bytenr = btrfs_stack_header_bytenr(
1738 (struct btrfs_header *)
1740 btrfsic_cmp_log_and_dev_bytenr(state, bytenr,
1744 if (state->print_mask & BTRFSIC_PRINT_MASK_VERBOSE) {
1745 if (block->logical_bytenr != bytenr &&
1746 !(!block->is_metadata &&
1747 block->logical_bytenr == 0))
1749 "written block @%llu (%pg/%llu/%d) found in hash table, %c, bytenr mismatch (!= stored %llu)\n",
1750 bytenr, dev_state->bdev,
1753 btrfsic_get_block_type(state,
1755 block->logical_bytenr);
1758 "written block @%llu (%pg/%llu/%d) found in hash table, %c\n",
1759 bytenr, dev_state->bdev,
1760 dev_bytenr, block->mirror_num,
1761 btrfsic_get_block_type(state,
1764 block->logical_bytenr = bytenr;
1766 if (num_pages * PAGE_SIZE <
1767 state->datablock_size) {
1768 pr_info("btrfsic: cannot work with too short bios!\n");
1771 processed_len = state->datablock_size;
1772 bytenr = block->logical_bytenr;
1773 if (state->print_mask & BTRFSIC_PRINT_MASK_VERBOSE)
1775 "written block @%llu (%pg/%llu/%d) found in hash table, %c\n",
1776 bytenr, dev_state->bdev, dev_bytenr,
1778 btrfsic_get_block_type(state, block));
1781 if (state->print_mask & BTRFSIC_PRINT_MASK_VERBOSE)
1782 pr_info("ref_to_list: %cE, ref_from_list: %cE\n",
1783 list_empty(&block->ref_to_list) ? ' ' : '!',
1784 list_empty(&block->ref_from_list) ? ' ' : '!');
1785 if (btrfsic_is_block_ref_by_superblock(state, block, 0)) {
1787 "btrfs: attempt to overwrite %c-block @%llu (%pg/%llu/%d), old(gen=%llu, objectid=%llu, type=%d, offset=%llu), new(gen=%llu), which is referenced by most recent superblock (superblockgen=%llu)!\n",
1788 btrfsic_get_block_type(state, block), bytenr,
1789 dev_state->bdev, dev_bytenr, block->mirror_num,
1791 btrfs_disk_key_objectid(&block->disk_key),
1792 block->disk_key.type,
1793 btrfs_disk_key_offset(&block->disk_key),
1794 btrfs_stack_header_generation(
1795 (struct btrfs_header *) mapped_datav[0]),
1796 state->max_superblock_generation);
1797 btrfsic_dump_tree(state);
1800 if (!block->is_iodone && !block->never_written) {
1802 "btrfs: attempt to overwrite %c-block @%llu (%pg/%llu/%d), oldgen=%llu, newgen=%llu, which is not yet iodone!\n",
1803 btrfsic_get_block_type(state, block), bytenr,
1804 dev_state->bdev, dev_bytenr, block->mirror_num,
1806 btrfs_stack_header_generation(
1807 (struct btrfs_header *)
1809 /* it would not be safe to go on */
1810 btrfsic_dump_tree(state);
1815 * Clear all references of this block. Do not free
1816 * the block itself even if is not referenced anymore
1817 * because it still carries valuable information
1818 * like whether it was ever written and IO completed.
1820 list_for_each_entry_safe(l, tmp, &block->ref_to_list,
1822 if (state->print_mask & BTRFSIC_PRINT_MASK_VERBOSE)
1823 btrfsic_print_rem_link(state, l);
1825 if (0 == l->ref_cnt) {
1826 list_del(&l->node_ref_to);
1827 list_del(&l->node_ref_from);
1828 btrfsic_block_link_hashtable_remove(l);
1829 btrfsic_block_link_free(l);
1833 block_ctx.dev = dev_state;
1834 block_ctx.dev_bytenr = dev_bytenr;
1835 block_ctx.start = bytenr;
1836 block_ctx.len = processed_len;
1837 block_ctx.pagev = NULL;
1838 block_ctx.mem_to_free = NULL;
1839 block_ctx.datav = mapped_datav;
1841 if (is_metadata || state->include_extent_data) {
1842 block->never_written = 0;
1843 block->iodone_w_error = 0;
1845 block->is_iodone = 0;
1846 BUG_ON(NULL == bio_is_patched);
1847 if (!*bio_is_patched) {
1848 block->orig_bio_private =
1850 block->orig_bio_end_io =
1852 block->next_in_same_bio = NULL;
1853 bio->bi_private = block;
1854 bio->bi_end_io = btrfsic_bio_end_io;
1855 *bio_is_patched = 1;
1857 struct btrfsic_block *chained_block =
1858 (struct btrfsic_block *)
1861 BUG_ON(NULL == chained_block);
1862 block->orig_bio_private =
1863 chained_block->orig_bio_private;
1864 block->orig_bio_end_io =
1865 chained_block->orig_bio_end_io;
1866 block->next_in_same_bio = chained_block;
1867 bio->bi_private = block;
1870 block->is_iodone = 1;
1871 block->orig_bio_private = NULL;
1872 block->orig_bio_end_io = NULL;
1873 block->next_in_same_bio = NULL;
1877 block->flush_gen = dev_state->last_flush_gen + 1;
1878 block->submit_bio_bh_rw = submit_bio_bh_rw;
1880 block->logical_bytenr = bytenr;
1881 block->is_metadata = 1;
1882 if (block->is_superblock) {
1884 BTRFS_SUPER_INFO_SIZE);
1885 ret = btrfsic_process_written_superblock(
1888 (struct btrfs_super_block *)
1890 if (state->print_mask &
1891 BTRFSIC_PRINT_MASK_TREE_AFTER_SB_WRITE) {
1892 pr_info("[after new superblock is written]:\n");
1893 btrfsic_dump_tree_sub(state, block, 0);
1896 block->mirror_num = 0; /* unknown */
1897 ret = btrfsic_process_metablock(
1904 pr_info("btrfsic: btrfsic_process_metablock(root @%llu) failed!\n",
1907 block->is_metadata = 0;
1908 block->mirror_num = 0; /* unknown */
1909 block->generation = BTRFSIC_GENERATION_UNKNOWN;
1910 if (!state->include_extent_data
1911 && list_empty(&block->ref_from_list)) {
1913 * disk block is overwritten with extent
1914 * data (not meta data) and we are configured
1915 * to not include extent data: take the
1916 * chance and free the block's memory
1918 btrfsic_block_hashtable_remove(block);
1919 list_del(&block->all_blocks_node);
1920 btrfsic_block_free(block);
1923 btrfsic_release_block_ctx(&block_ctx);
1925 /* block has not been found in hash table */
1929 processed_len = state->datablock_size;
1930 if (state->print_mask & BTRFSIC_PRINT_MASK_VERBOSE)
1932 "written block (%pg/%llu/?) !found in hash table, D\n",
1933 dev_state->bdev, dev_bytenr);
1934 if (!state->include_extent_data) {
1935 /* ignore that written D block */
1939 /* this is getting ugly for the
1940 * include_extent_data case... */
1941 bytenr = 0; /* unknown */
1943 processed_len = state->metablock_size;
1944 bytenr = btrfs_stack_header_bytenr(
1945 (struct btrfs_header *)
1947 btrfsic_cmp_log_and_dev_bytenr(state, bytenr, dev_state,
1949 if (state->print_mask & BTRFSIC_PRINT_MASK_VERBOSE)
1951 "written block @%llu (%pg/%llu/?) !found in hash table, M\n",
1952 bytenr, dev_state->bdev, dev_bytenr);
1955 block_ctx.dev = dev_state;
1956 block_ctx.dev_bytenr = dev_bytenr;
1957 block_ctx.start = bytenr;
1958 block_ctx.len = processed_len;
1959 block_ctx.pagev = NULL;
1960 block_ctx.mem_to_free = NULL;
1961 block_ctx.datav = mapped_datav;
1963 block = btrfsic_block_alloc();
1964 if (NULL == block) {
1965 btrfsic_release_block_ctx(&block_ctx);
1968 block->dev_state = dev_state;
1969 block->dev_bytenr = dev_bytenr;
1970 block->logical_bytenr = bytenr;
1971 block->is_metadata = is_metadata;
1972 block->never_written = 0;
1973 block->iodone_w_error = 0;
1974 block->mirror_num = 0; /* unknown */
1975 block->flush_gen = dev_state->last_flush_gen + 1;
1976 block->submit_bio_bh_rw = submit_bio_bh_rw;
1978 block->is_iodone = 0;
1979 BUG_ON(NULL == bio_is_patched);
1980 if (!*bio_is_patched) {
1981 block->orig_bio_private = bio->bi_private;
1982 block->orig_bio_end_io = bio->bi_end_io;
1983 block->next_in_same_bio = NULL;
1984 bio->bi_private = block;
1985 bio->bi_end_io = btrfsic_bio_end_io;
1986 *bio_is_patched = 1;
1988 struct btrfsic_block *chained_block =
1989 (struct btrfsic_block *)
1992 BUG_ON(NULL == chained_block);
1993 block->orig_bio_private =
1994 chained_block->orig_bio_private;
1995 block->orig_bio_end_io =
1996 chained_block->orig_bio_end_io;
1997 block->next_in_same_bio = chained_block;
1998 bio->bi_private = block;
2001 block->is_iodone = 1;
2002 block->orig_bio_private = NULL;
2003 block->orig_bio_end_io = NULL;
2004 block->next_in_same_bio = NULL;
2006 if (state->print_mask & BTRFSIC_PRINT_MASK_VERBOSE)
2007 pr_info("new written %c-block @%llu (%pg/%llu/%d)\n",
2008 is_metadata ? 'M' : 'D',
2009 block->logical_bytenr, block->dev_state->bdev,
2010 block->dev_bytenr, block->mirror_num);
2011 list_add(&block->all_blocks_node, &state->all_blocks_list);
2012 btrfsic_block_hashtable_add(block, &state->block_hashtable);
2015 ret = btrfsic_process_metablock(state, block,
2018 pr_info("btrfsic: process_metablock(root @%llu) failed!\n",
2021 btrfsic_release_block_ctx(&block_ctx);
2025 BUG_ON(!processed_len);
2026 dev_bytenr += processed_len;
2027 mapped_datav += processed_len >> PAGE_SHIFT;
2028 num_pages -= processed_len >> PAGE_SHIFT;
2032 static void btrfsic_bio_end_io(struct bio *bp)
2034 struct btrfsic_block *block = bp->bi_private;
2037 /* mutex is not held! This is not save if IO is not yet completed
2043 BUG_ON(NULL == block);
2044 bp->bi_private = block->orig_bio_private;
2045 bp->bi_end_io = block->orig_bio_end_io;
2048 struct btrfsic_block *next_block;
2049 struct btrfsic_dev_state *const dev_state = block->dev_state;
2051 if ((dev_state->state->print_mask &
2052 BTRFSIC_PRINT_MASK_END_IO_BIO_BH))
2053 pr_info("bio_end_io(err=%d) for %c @%llu (%pg/%llu/%d)\n",
2055 btrfsic_get_block_type(dev_state->state, block),
2056 block->logical_bytenr, dev_state->bdev,
2057 block->dev_bytenr, block->mirror_num);
2058 next_block = block->next_in_same_bio;
2059 block->iodone_w_error = iodone_w_error;
2060 if (block->submit_bio_bh_rw & REQ_PREFLUSH) {
2061 dev_state->last_flush_gen++;
2062 if ((dev_state->state->print_mask &
2063 BTRFSIC_PRINT_MASK_END_IO_BIO_BH))
2064 pr_info("bio_end_io() new %pg flush_gen=%llu\n",
2066 dev_state->last_flush_gen);
2068 if (block->submit_bio_bh_rw & REQ_FUA)
2069 block->flush_gen = 0; /* FUA completed means block is
2071 block->is_iodone = 1; /* for FLUSH, this releases the block */
2073 } while (NULL != block);
2078 static int btrfsic_process_written_superblock(
2079 struct btrfsic_state *state,
2080 struct btrfsic_block *const superblock,
2081 struct btrfs_super_block *const super_hdr)
2083 struct btrfs_fs_info *fs_info = state->fs_info;
2086 superblock->generation = btrfs_super_generation(super_hdr);
2087 if (!(superblock->generation > state->max_superblock_generation ||
2088 0 == state->max_superblock_generation)) {
2089 if (state->print_mask & BTRFSIC_PRINT_MASK_SUPERBLOCK_WRITE)
2091 "btrfsic: superblock @%llu (%pg/%llu/%d) with old gen %llu <= %llu\n",
2092 superblock->logical_bytenr,
2093 superblock->dev_state->bdev,
2094 superblock->dev_bytenr, superblock->mirror_num,
2095 btrfs_super_generation(super_hdr),
2096 state->max_superblock_generation);
2098 if (state->print_mask & BTRFSIC_PRINT_MASK_SUPERBLOCK_WRITE)
2100 "btrfsic: got new superblock @%llu (%pg/%llu/%d) with new gen %llu > %llu\n",
2101 superblock->logical_bytenr,
2102 superblock->dev_state->bdev,
2103 superblock->dev_bytenr, superblock->mirror_num,
2104 btrfs_super_generation(super_hdr),
2105 state->max_superblock_generation);
2107 state->max_superblock_generation =
2108 btrfs_super_generation(super_hdr);
2109 state->latest_superblock = superblock;
2112 for (pass = 0; pass < 3; pass++) {
2115 struct btrfsic_block *next_block;
2116 struct btrfsic_block_data_ctx tmp_next_block_ctx;
2117 struct btrfsic_block_link *l;
2120 const char *additional_string = NULL;
2121 struct btrfs_disk_key tmp_disk_key = {0};
2123 btrfs_set_disk_key_objectid(&tmp_disk_key,
2124 BTRFS_ROOT_ITEM_KEY);
2125 btrfs_set_disk_key_objectid(&tmp_disk_key, 0);
2129 btrfs_set_disk_key_objectid(&tmp_disk_key,
2130 BTRFS_ROOT_TREE_OBJECTID);
2131 additional_string = "root ";
2132 next_bytenr = btrfs_super_root(super_hdr);
2133 if (state->print_mask &
2134 BTRFSIC_PRINT_MASK_ROOT_CHUNK_LOG_TREE_LOCATION)
2135 pr_info("root@%llu\n", next_bytenr);
2138 btrfs_set_disk_key_objectid(&tmp_disk_key,
2139 BTRFS_CHUNK_TREE_OBJECTID);
2140 additional_string = "chunk ";
2141 next_bytenr = btrfs_super_chunk_root(super_hdr);
2142 if (state->print_mask &
2143 BTRFSIC_PRINT_MASK_ROOT_CHUNK_LOG_TREE_LOCATION)
2144 pr_info("chunk@%llu\n", next_bytenr);
2147 btrfs_set_disk_key_objectid(&tmp_disk_key,
2148 BTRFS_TREE_LOG_OBJECTID);
2149 additional_string = "log ";
2150 next_bytenr = btrfs_super_log_root(super_hdr);
2151 if (0 == next_bytenr)
2153 if (state->print_mask &
2154 BTRFSIC_PRINT_MASK_ROOT_CHUNK_LOG_TREE_LOCATION)
2155 pr_info("log@%llu\n", next_bytenr);
2159 num_copies = btrfs_num_copies(fs_info, next_bytenr,
2160 BTRFS_SUPER_INFO_SIZE);
2161 if (state->print_mask & BTRFSIC_PRINT_MASK_NUM_COPIES)
2162 pr_info("num_copies(log_bytenr=%llu) = %d\n",
2163 next_bytenr, num_copies);
2164 for (mirror_num = 1; mirror_num <= num_copies; mirror_num++) {
2167 if (state->print_mask & BTRFSIC_PRINT_MASK_VERBOSE)
2168 pr_info("btrfsic_process_written_superblock(mirror_num=%d)\n", mirror_num);
2169 ret = btrfsic_map_block(state, next_bytenr,
2170 BTRFS_SUPER_INFO_SIZE,
2171 &tmp_next_block_ctx,
2174 pr_info("btrfsic: btrfsic_map_block(@%llu, mirror=%d) failed!\n",
2175 next_bytenr, mirror_num);
2179 next_block = btrfsic_block_lookup_or_add(
2181 &tmp_next_block_ctx,
2186 if (NULL == next_block) {
2187 btrfsic_release_block_ctx(&tmp_next_block_ctx);
2191 next_block->disk_key = tmp_disk_key;
2193 next_block->generation =
2194 BTRFSIC_GENERATION_UNKNOWN;
2195 l = btrfsic_block_link_lookup_or_add(
2197 &tmp_next_block_ctx,
2200 BTRFSIC_GENERATION_UNKNOWN);
2201 btrfsic_release_block_ctx(&tmp_next_block_ctx);
2207 if (WARN_ON(-1 == btrfsic_check_all_ref_blocks(state, superblock, 0)))
2208 btrfsic_dump_tree(state);
2213 static int btrfsic_check_all_ref_blocks(struct btrfsic_state *state,
2214 struct btrfsic_block *const block,
2215 int recursion_level)
2217 const struct btrfsic_block_link *l;
2220 if (recursion_level >= 3 + BTRFS_MAX_LEVEL) {
2222 * Note that this situation can happen and does not
2223 * indicate an error in regular cases. It happens
2224 * when disk blocks are freed and later reused.
2225 * The check-integrity module is not aware of any
2226 * block free operations, it just recognizes block
2227 * write operations. Therefore it keeps the linkage
2228 * information for a block until a block is
2229 * rewritten. This can temporarily cause incorrect
2230 * and even circular linkage information. This
2231 * causes no harm unless such blocks are referenced
2232 * by the most recent super block.
2234 if (state->print_mask & BTRFSIC_PRINT_MASK_VERBOSE)
2235 pr_info("btrfsic: abort cyclic linkage (case 1).\n");
2241 * This algorithm is recursive because the amount of used stack
2242 * space is very small and the max recursion depth is limited.
2244 list_for_each_entry(l, &block->ref_to_list, node_ref_to) {
2245 if (state->print_mask & BTRFSIC_PRINT_MASK_VERBOSE)
2247 "rl=%d, %c @%llu (%pg/%llu/%d) %u* refers to %c @%llu (%pg/%llu/%d)\n",
2249 btrfsic_get_block_type(state, block),
2250 block->logical_bytenr, block->dev_state->bdev,
2251 block->dev_bytenr, block->mirror_num,
2253 btrfsic_get_block_type(state, l->block_ref_to),
2254 l->block_ref_to->logical_bytenr,
2255 l->block_ref_to->dev_state->bdev,
2256 l->block_ref_to->dev_bytenr,
2257 l->block_ref_to->mirror_num);
2258 if (l->block_ref_to->never_written) {
2260 "btrfs: attempt to write superblock which references block %c @%llu (%pg/%llu/%d) which is never written!\n",
2261 btrfsic_get_block_type(state, l->block_ref_to),
2262 l->block_ref_to->logical_bytenr,
2263 l->block_ref_to->dev_state->bdev,
2264 l->block_ref_to->dev_bytenr,
2265 l->block_ref_to->mirror_num);
2267 } else if (!l->block_ref_to->is_iodone) {
2269 "btrfs: attempt to write superblock which references block %c @%llu (%pg/%llu/%d) which is not yet iodone!\n",
2270 btrfsic_get_block_type(state, l->block_ref_to),
2271 l->block_ref_to->logical_bytenr,
2272 l->block_ref_to->dev_state->bdev,
2273 l->block_ref_to->dev_bytenr,
2274 l->block_ref_to->mirror_num);
2276 } else if (l->block_ref_to->iodone_w_error) {
2278 "btrfs: attempt to write superblock which references block %c @%llu (%pg/%llu/%d) which has write error!\n",
2279 btrfsic_get_block_type(state, l->block_ref_to),
2280 l->block_ref_to->logical_bytenr,
2281 l->block_ref_to->dev_state->bdev,
2282 l->block_ref_to->dev_bytenr,
2283 l->block_ref_to->mirror_num);
2285 } else if (l->parent_generation !=
2286 l->block_ref_to->generation &&
2287 BTRFSIC_GENERATION_UNKNOWN !=
2288 l->parent_generation &&
2289 BTRFSIC_GENERATION_UNKNOWN !=
2290 l->block_ref_to->generation) {
2292 "btrfs: attempt to write superblock which references block %c @%llu (%pg/%llu/%d) with generation %llu != parent generation %llu!\n",
2293 btrfsic_get_block_type(state, l->block_ref_to),
2294 l->block_ref_to->logical_bytenr,
2295 l->block_ref_to->dev_state->bdev,
2296 l->block_ref_to->dev_bytenr,
2297 l->block_ref_to->mirror_num,
2298 l->block_ref_to->generation,
2299 l->parent_generation);
2301 } else if (l->block_ref_to->flush_gen >
2302 l->block_ref_to->dev_state->last_flush_gen) {
2304 "btrfs: attempt to write superblock which references block %c @%llu (%pg/%llu/%d) which is not flushed out of disk's write cache (block flush_gen=%llu, dev->flush_gen=%llu)!\n",
2305 btrfsic_get_block_type(state, l->block_ref_to),
2306 l->block_ref_to->logical_bytenr,
2307 l->block_ref_to->dev_state->bdev,
2308 l->block_ref_to->dev_bytenr,
2309 l->block_ref_to->mirror_num, block->flush_gen,
2310 l->block_ref_to->dev_state->last_flush_gen);
2312 } else if (-1 == btrfsic_check_all_ref_blocks(state,
2323 static int btrfsic_is_block_ref_by_superblock(
2324 const struct btrfsic_state *state,
2325 const struct btrfsic_block *block,
2326 int recursion_level)
2328 const struct btrfsic_block_link *l;
2330 if (recursion_level >= 3 + BTRFS_MAX_LEVEL) {
2331 /* refer to comment at "abort cyclic linkage (case 1)" */
2332 if (state->print_mask & BTRFSIC_PRINT_MASK_VERBOSE)
2333 pr_info("btrfsic: abort cyclic linkage (case 2).\n");
2339 * This algorithm is recursive because the amount of used stack space
2340 * is very small and the max recursion depth is limited.
2342 list_for_each_entry(l, &block->ref_from_list, node_ref_from) {
2343 if (state->print_mask & BTRFSIC_PRINT_MASK_VERBOSE)
2345 "rl=%d, %c @%llu (%pg/%llu/%d) is ref %u* from %c @%llu (%pg/%llu/%d)\n",
2347 btrfsic_get_block_type(state, block),
2348 block->logical_bytenr, block->dev_state->bdev,
2349 block->dev_bytenr, block->mirror_num,
2351 btrfsic_get_block_type(state, l->block_ref_from),
2352 l->block_ref_from->logical_bytenr,
2353 l->block_ref_from->dev_state->bdev,
2354 l->block_ref_from->dev_bytenr,
2355 l->block_ref_from->mirror_num);
2356 if (l->block_ref_from->is_superblock &&
2357 state->latest_superblock->dev_bytenr ==
2358 l->block_ref_from->dev_bytenr &&
2359 state->latest_superblock->dev_state->bdev ==
2360 l->block_ref_from->dev_state->bdev)
2362 else if (btrfsic_is_block_ref_by_superblock(state,
2372 static void btrfsic_print_add_link(const struct btrfsic_state *state,
2373 const struct btrfsic_block_link *l)
2375 pr_info("add %u* link from %c @%llu (%pg/%llu/%d) to %c @%llu (%pg/%llu/%d)\n",
2377 btrfsic_get_block_type(state, l->block_ref_from),
2378 l->block_ref_from->logical_bytenr,
2379 l->block_ref_from->dev_state->bdev,
2380 l->block_ref_from->dev_bytenr, l->block_ref_from->mirror_num,
2381 btrfsic_get_block_type(state, l->block_ref_to),
2382 l->block_ref_to->logical_bytenr,
2383 l->block_ref_to->dev_state->bdev, l->block_ref_to->dev_bytenr,
2384 l->block_ref_to->mirror_num);
2387 static void btrfsic_print_rem_link(const struct btrfsic_state *state,
2388 const struct btrfsic_block_link *l)
2390 pr_info("rem %u* link from %c @%llu (%pg/%llu/%d) to %c @%llu (%pg/%llu/%d)\n",
2392 btrfsic_get_block_type(state, l->block_ref_from),
2393 l->block_ref_from->logical_bytenr,
2394 l->block_ref_from->dev_state->bdev,
2395 l->block_ref_from->dev_bytenr, l->block_ref_from->mirror_num,
2396 btrfsic_get_block_type(state, l->block_ref_to),
2397 l->block_ref_to->logical_bytenr,
2398 l->block_ref_to->dev_state->bdev, l->block_ref_to->dev_bytenr,
2399 l->block_ref_to->mirror_num);
2402 static char btrfsic_get_block_type(const struct btrfsic_state *state,
2403 const struct btrfsic_block *block)
2405 if (block->is_superblock &&
2406 state->latest_superblock->dev_bytenr == block->dev_bytenr &&
2407 state->latest_superblock->dev_state->bdev == block->dev_state->bdev)
2409 else if (block->is_superblock)
2411 else if (block->is_metadata)
2417 static void btrfsic_dump_tree(const struct btrfsic_state *state)
2419 btrfsic_dump_tree_sub(state, state->latest_superblock, 0);
2422 static void btrfsic_dump_tree_sub(const struct btrfsic_state *state,
2423 const struct btrfsic_block *block,
2426 const struct btrfsic_block_link *l;
2428 static char buf[80];
2429 int cursor_position;
2432 * Should better fill an on-stack buffer with a complete line and
2433 * dump it at once when it is time to print a newline character.
2437 * This algorithm is recursive because the amount of used stack space
2438 * is very small and the max recursion depth is limited.
2440 indent_add = sprintf(buf, "%c-%llu(%pg/%llu/%u)",
2441 btrfsic_get_block_type(state, block),
2442 block->logical_bytenr, block->dev_state->bdev,
2443 block->dev_bytenr, block->mirror_num);
2444 if (indent_level + indent_add > BTRFSIC_TREE_DUMP_MAX_INDENT_LEVEL) {
2449 indent_level += indent_add;
2450 if (list_empty(&block->ref_to_list)) {
2454 if (block->mirror_num > 1 &&
2455 !(state->print_mask & BTRFSIC_PRINT_MASK_TREE_WITH_ALL_MIRRORS)) {
2460 cursor_position = indent_level;
2461 list_for_each_entry(l, &block->ref_to_list, node_ref_to) {
2462 while (cursor_position < indent_level) {
2467 indent_add = sprintf(buf, " %d*--> ", l->ref_cnt);
2469 indent_add = sprintf(buf, " --> ");
2470 if (indent_level + indent_add >
2471 BTRFSIC_TREE_DUMP_MAX_INDENT_LEVEL) {
2473 cursor_position = 0;
2479 btrfsic_dump_tree_sub(state, l->block_ref_to,
2480 indent_level + indent_add);
2481 cursor_position = 0;
2485 static struct btrfsic_block_link *btrfsic_block_link_lookup_or_add(
2486 struct btrfsic_state *state,
2487 struct btrfsic_block_data_ctx *next_block_ctx,
2488 struct btrfsic_block *next_block,
2489 struct btrfsic_block *from_block,
2490 u64 parent_generation)
2492 struct btrfsic_block_link *l;
2494 l = btrfsic_block_link_hashtable_lookup(next_block_ctx->dev->bdev,
2495 next_block_ctx->dev_bytenr,
2496 from_block->dev_state->bdev,
2497 from_block->dev_bytenr,
2498 &state->block_link_hashtable);
2500 l = btrfsic_block_link_alloc();
2504 l->block_ref_to = next_block;
2505 l->block_ref_from = from_block;
2507 l->parent_generation = parent_generation;
2509 if (state->print_mask & BTRFSIC_PRINT_MASK_VERBOSE)
2510 btrfsic_print_add_link(state, l);
2512 list_add(&l->node_ref_to, &from_block->ref_to_list);
2513 list_add(&l->node_ref_from, &next_block->ref_from_list);
2515 btrfsic_block_link_hashtable_add(l,
2516 &state->block_link_hashtable);
2519 l->parent_generation = parent_generation;
2520 if (state->print_mask & BTRFSIC_PRINT_MASK_VERBOSE)
2521 btrfsic_print_add_link(state, l);
2527 static struct btrfsic_block *btrfsic_block_lookup_or_add(
2528 struct btrfsic_state *state,
2529 struct btrfsic_block_data_ctx *block_ctx,
2530 const char *additional_string,
2537 struct btrfsic_block *block;
2539 block = btrfsic_block_hashtable_lookup(block_ctx->dev->bdev,
2540 block_ctx->dev_bytenr,
2541 &state->block_hashtable);
2542 if (NULL == block) {
2543 struct btrfsic_dev_state *dev_state;
2545 block = btrfsic_block_alloc();
2549 dev_state = btrfsic_dev_state_lookup(block_ctx->dev->bdev->bd_dev);
2550 if (NULL == dev_state) {
2551 pr_info("btrfsic: error, lookup dev_state failed!\n");
2552 btrfsic_block_free(block);
2555 block->dev_state = dev_state;
2556 block->dev_bytenr = block_ctx->dev_bytenr;
2557 block->logical_bytenr = block_ctx->start;
2558 block->is_metadata = is_metadata;
2559 block->is_iodone = is_iodone;
2560 block->never_written = never_written;
2561 block->mirror_num = mirror_num;
2562 if (state->print_mask & BTRFSIC_PRINT_MASK_VERBOSE)
2563 pr_info("New %s%c-block @%llu (%pg/%llu/%d)\n",
2565 btrfsic_get_block_type(state, block),
2566 block->logical_bytenr, dev_state->bdev,
2567 block->dev_bytenr, mirror_num);
2568 list_add(&block->all_blocks_node, &state->all_blocks_list);
2569 btrfsic_block_hashtable_add(block, &state->block_hashtable);
2570 if (NULL != was_created)
2573 if (NULL != was_created)
2580 static void btrfsic_cmp_log_and_dev_bytenr(struct btrfsic_state *state,
2582 struct btrfsic_dev_state *dev_state,
2585 struct btrfs_fs_info *fs_info = state->fs_info;
2586 struct btrfsic_block_data_ctx block_ctx;
2592 num_copies = btrfs_num_copies(fs_info, bytenr, state->metablock_size);
2594 for (mirror_num = 1; mirror_num <= num_copies; mirror_num++) {
2595 ret = btrfsic_map_block(state, bytenr, state->metablock_size,
2596 &block_ctx, mirror_num);
2598 pr_info("btrfsic: btrfsic_map_block(logical @%llu, mirror %d) failed!\n",
2599 bytenr, mirror_num);
2603 if (dev_state->bdev == block_ctx.dev->bdev &&
2604 dev_bytenr == block_ctx.dev_bytenr) {
2606 btrfsic_release_block_ctx(&block_ctx);
2609 btrfsic_release_block_ctx(&block_ctx);
2612 if (WARN_ON(!match)) {
2614 "btrfs: attempt to write M-block which contains logical bytenr that doesn't map to dev+physical bytenr of submit_bio, buffer->log_bytenr=%llu, submit_bio(bdev=%pg, phys_bytenr=%llu)!\n",
2615 bytenr, dev_state->bdev, dev_bytenr);
2616 for (mirror_num = 1; mirror_num <= num_copies; mirror_num++) {
2617 ret = btrfsic_map_block(state, bytenr,
2618 state->metablock_size,
2619 &block_ctx, mirror_num);
2623 pr_info("read logical bytenr @%llu maps to (%pg/%llu/%d)\n",
2624 bytenr, block_ctx.dev->bdev,
2625 block_ctx.dev_bytenr, mirror_num);
2630 static struct btrfsic_dev_state *btrfsic_dev_state_lookup(dev_t dev)
2632 return btrfsic_dev_state_hashtable_lookup(dev,
2633 &btrfsic_dev_state_hashtable);
2636 static void btrfsic_check_write_bio(struct bio *bio, struct btrfsic_dev_state *dev_state)
2638 unsigned int segs = bio_segments(bio);
2639 u64 dev_bytenr = 512 * bio->bi_iter.bi_sector;
2640 u64 cur_bytenr = dev_bytenr;
2641 struct bvec_iter iter;
2642 struct bio_vec bvec;
2643 char **mapped_datav;
2644 int bio_is_patched = 0;
2647 if (dev_state->state->print_mask & BTRFSIC_PRINT_MASK_SUBMIT_BIO_BH)
2649 "submit_bio(rw=%d,0x%x, bi_vcnt=%u, bi_sector=%llu (bytenr %llu), bi_bdev=%p)\n",
2650 bio_op(bio), bio->bi_opf, segs,
2651 bio->bi_iter.bi_sector, dev_bytenr, bio->bi_bdev);
2653 mapped_datav = kmalloc_array(segs, sizeof(*mapped_datav), GFP_NOFS);
2657 bio_for_each_segment(bvec, bio, iter) {
2658 BUG_ON(bvec.bv_len != PAGE_SIZE);
2659 mapped_datav[i] = page_address(bvec.bv_page);
2662 if (dev_state->state->print_mask &
2663 BTRFSIC_PRINT_MASK_SUBMIT_BIO_BH_VERBOSE)
2664 pr_info("#%u: bytenr=%llu, len=%u, offset=%u\n",
2665 i, cur_bytenr, bvec.bv_len, bvec.bv_offset);
2666 cur_bytenr += bvec.bv_len;
2669 btrfsic_process_written_block(dev_state, dev_bytenr, mapped_datav, segs,
2670 bio, &bio_is_patched, bio->bi_opf);
2671 kfree(mapped_datav);
2674 static void btrfsic_check_flush_bio(struct bio *bio, struct btrfsic_dev_state *dev_state)
2676 if (dev_state->state->print_mask & BTRFSIC_PRINT_MASK_SUBMIT_BIO_BH)
2677 pr_info("submit_bio(rw=%d,0x%x FLUSH, bdev=%p)\n",
2678 bio_op(bio), bio->bi_opf, bio->bi_bdev);
2680 if (dev_state->dummy_block_for_bio_bh_flush.is_iodone) {
2681 struct btrfsic_block *const block =
2682 &dev_state->dummy_block_for_bio_bh_flush;
2684 block->is_iodone = 0;
2685 block->never_written = 0;
2686 block->iodone_w_error = 0;
2687 block->flush_gen = dev_state->last_flush_gen + 1;
2688 block->submit_bio_bh_rw = bio->bi_opf;
2689 block->orig_bio_private = bio->bi_private;
2690 block->orig_bio_end_io = bio->bi_end_io;
2691 block->next_in_same_bio = NULL;
2692 bio->bi_private = block;
2693 bio->bi_end_io = btrfsic_bio_end_io;
2694 } else if ((dev_state->state->print_mask &
2695 (BTRFSIC_PRINT_MASK_SUBMIT_BIO_BH |
2696 BTRFSIC_PRINT_MASK_VERBOSE))) {
2698 "btrfsic_submit_bio(%pg) with FLUSH but dummy block already in use (ignored)!\n",
2703 void btrfsic_check_bio(struct bio *bio)
2705 struct btrfsic_dev_state *dev_state;
2707 if (!btrfsic_is_initialized)
2711 * We can be called before btrfsic_mount, so there might not be a
2714 dev_state = btrfsic_dev_state_lookup(bio->bi_bdev->bd_dev);
2715 mutex_lock(&btrfsic_mutex);
2717 if (bio_op(bio) == REQ_OP_WRITE && bio_has_data(bio))
2718 btrfsic_check_write_bio(bio, dev_state);
2719 else if (bio->bi_opf & REQ_PREFLUSH)
2720 btrfsic_check_flush_bio(bio, dev_state);
2722 mutex_unlock(&btrfsic_mutex);
2725 int btrfsic_mount(struct btrfs_fs_info *fs_info,
2726 struct btrfs_fs_devices *fs_devices,
2727 int including_extent_data, u32 print_mask)
2730 struct btrfsic_state *state;
2731 struct list_head *dev_head = &fs_devices->devices;
2732 struct btrfs_device *device;
2734 if (!PAGE_ALIGNED(fs_info->nodesize)) {
2735 pr_info("btrfsic: cannot handle nodesize %d not being a multiple of PAGE_SIZE %ld!\n",
2736 fs_info->nodesize, PAGE_SIZE);
2739 if (!PAGE_ALIGNED(fs_info->sectorsize)) {
2740 pr_info("btrfsic: cannot handle sectorsize %d not being a multiple of PAGE_SIZE %ld!\n",
2741 fs_info->sectorsize, PAGE_SIZE);
2744 state = kvzalloc(sizeof(*state), GFP_KERNEL);
2748 if (!btrfsic_is_initialized) {
2749 mutex_init(&btrfsic_mutex);
2750 btrfsic_dev_state_hashtable_init(&btrfsic_dev_state_hashtable);
2751 btrfsic_is_initialized = 1;
2753 mutex_lock(&btrfsic_mutex);
2754 state->fs_info = fs_info;
2755 state->print_mask = print_mask;
2756 state->include_extent_data = including_extent_data;
2757 state->metablock_size = fs_info->nodesize;
2758 state->datablock_size = fs_info->sectorsize;
2759 INIT_LIST_HEAD(&state->all_blocks_list);
2760 btrfsic_block_hashtable_init(&state->block_hashtable);
2761 btrfsic_block_link_hashtable_init(&state->block_link_hashtable);
2762 state->max_superblock_generation = 0;
2763 state->latest_superblock = NULL;
2765 list_for_each_entry(device, dev_head, dev_list) {
2766 struct btrfsic_dev_state *ds;
2768 if (!device->bdev || !device->name)
2771 ds = btrfsic_dev_state_alloc();
2773 mutex_unlock(&btrfsic_mutex);
2776 ds->bdev = device->bdev;
2778 btrfsic_dev_state_hashtable_add(ds,
2779 &btrfsic_dev_state_hashtable);
2782 ret = btrfsic_process_superblock(state, fs_devices);
2784 mutex_unlock(&btrfsic_mutex);
2785 btrfsic_unmount(fs_devices);
2789 if (state->print_mask & BTRFSIC_PRINT_MASK_INITIAL_DATABASE)
2790 btrfsic_dump_database(state);
2791 if (state->print_mask & BTRFSIC_PRINT_MASK_INITIAL_TREE)
2792 btrfsic_dump_tree(state);
2794 mutex_unlock(&btrfsic_mutex);
2798 void btrfsic_unmount(struct btrfs_fs_devices *fs_devices)
2800 struct btrfsic_block *b_all, *tmp_all;
2801 struct btrfsic_state *state;
2802 struct list_head *dev_head = &fs_devices->devices;
2803 struct btrfs_device *device;
2805 if (!btrfsic_is_initialized)
2808 mutex_lock(&btrfsic_mutex);
2811 list_for_each_entry(device, dev_head, dev_list) {
2812 struct btrfsic_dev_state *ds;
2814 if (!device->bdev || !device->name)
2817 ds = btrfsic_dev_state_hashtable_lookup(
2818 device->bdev->bd_dev,
2819 &btrfsic_dev_state_hashtable);
2822 btrfsic_dev_state_hashtable_remove(ds);
2823 btrfsic_dev_state_free(ds);
2827 if (NULL == state) {
2828 pr_info("btrfsic: error, cannot find state information on umount!\n");
2829 mutex_unlock(&btrfsic_mutex);
2834 * Don't care about keeping the lists' state up to date,
2835 * just free all memory that was allocated dynamically.
2836 * Free the blocks and the block_links.
2838 list_for_each_entry_safe(b_all, tmp_all, &state->all_blocks_list,
2840 struct btrfsic_block_link *l, *tmp;
2842 list_for_each_entry_safe(l, tmp, &b_all->ref_to_list,
2844 if (state->print_mask & BTRFSIC_PRINT_MASK_VERBOSE)
2845 btrfsic_print_rem_link(state, l);
2848 if (0 == l->ref_cnt)
2849 btrfsic_block_link_free(l);
2852 if (b_all->is_iodone || b_all->never_written)
2853 btrfsic_block_free(b_all);
2856 "btrfs: attempt to free %c-block @%llu (%pg/%llu/%d) on umount which is not yet iodone!\n",
2857 btrfsic_get_block_type(state, b_all),
2858 b_all->logical_bytenr, b_all->dev_state->bdev,
2859 b_all->dev_bytenr, b_all->mirror_num);
2862 mutex_unlock(&btrfsic_mutex);