fs/btrfs/disk-io.c

212  * @check:		expected tree parentness check, see the comments of the
216 			     struct btrfs_tree_parent_check *check)
225 	ASSERT(check);
229 		ret = read_extent_buffer_pages(eb, WAIT_COMPLETE, mirror_num, check);
305 	 * Also check the generation, the eb reached here must be newer than
361 				 struct btrfs_tree_parent_check *check)
371 	ASSERT(check);
411 	if (found_level != check->level) {
414 			  eb->start, eb->read_mirror, check->level, found_level);
418 	if (unlikely(check->transid &&
419 		     btrfs_header_generation(eb) != check->transid)) {
422 				eb->start, eb->read_mirror, check->transid,
427 	if (check->has_first_key) {
428 		struct btrfs_key *expect_key = &check->first_key;
438 				  eb->start, check->transid,
447 	if (check->owner_root) {
448 		ret = btrfs_check_eb_owner(eb, check->owner_root);
617  * @check:		expected tree parentness check, see comments of the
621 				      struct btrfs_tree_parent_check *check)
626 	ASSERT(check);
628 	buf = btrfs_find_create_tree_block(fs_info, bytenr, check->owner_root,
629 					   check->level);
633 	ret = btrfs_read_extent_buffer(buf, check);
638 	if (btrfs_check_eb_owner(buf, check->owner_root)) {
1040 	struct btrfs_tree_parent_check check = { 0 };
1060 	check.level = level;
1061 	check.transid = generation;
1062 	check.owner_root = key->objectid;
1064 				     &check);
1301  * For subvolume trees, we check the cached filesystem roots first. If not
1312  * @check_ref:	whether to check root item references, If true, return -ENOENT
1512 		 * during the above check and trylock.
1630  * We check to make sure the array is valid by comparing the
2076 	struct btrfs_tree_parent_check check = { 0 };
2092 	check.level = level;
2093 	check.transid = fs_info->generation + 1;
2094 	check.owner_root = BTRFS_TREE_LOG_OBJECTID;
2095 	log_tree_root->node = read_tree_block(fs_info, bytenr, &check);
2343  * @sb:		super block to check
2344  * @mirror_num:	the super block number to check its bytenr:
2347  * 	       -1	skip bytenr check
2382 	 * Check sectorsize and nodesize first, other check will need it.
2417 	/* Root alignment check */
2549  * Some checks like bytenr check will be skipped as their values will be
2584 	struct btrfs_tree_parent_check check = {
2591 	root->node = read_tree_block(root->fs_info, bytenr, &check);
3234 	 * Read super block and check the signature bytes only
3265 	 * We want to check superblock checksum, the type is stored inside.
3301 	/* check FS state, whether FS is broken. */
3425 	 * check the generation here so we can set the
3560 				"failed to check the UUID tree: %d", ret);
3705 	/* we would like to check all the supers, but that would make
4403 	 * This is a fast path so only do this check if we have sanity tests