RepoMirrors
/
btrfs-progs
mirror of https://github.com/kdave/btrfs-progs
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

btrfs-progs: check: Add support for freespace tree fixing 

Now that all the prerequisite code for proper support of free space
tree repair is in, it's time to wire it in. This is achieved by first
hooking the freespace tree to the __free_extent/alloc_reserved_tree_block
functions. And then introducing a wrapper function to contains the
existing check_space_cache and the newly introduced repair code.
Finally, it's important to note that FST repair code first clears the
existing FST in case of any problem found and rebuilds it from scratch.

Signed-off-by: Nikolay Borisov <nborisov@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
This commit is contained in:
Nikolay Borisov 2018-10-01 17:46:19 +03:00 committed by David Sterba
parent f46b08f3ab
commit be32eb0557
1 changed files with 29 additions and 17 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

46
check/main.c
View File

@ -5400,14 +5400,6 @@ static int check_space_cache(struct btrfs_root *root)
int ret; int ret;
int error = 0; int error = 0;
if (btrfs_super_cache_generation(root->fs_info->super_copy) != -1ULL &&
btrfs_super_generation(root->fs_info->super_copy) !=
btrfs_super_cache_generation(root->fs_info->super_copy)) {
printf("cache and super generation don't match, space cache "
"will be invalidated\n");
return 0;
}
while (1) { while (1) {
ctx.item_count++; ctx.item_count++;
cache = btrfs_lookup_first_block_group(root->fs_info, start); cache = btrfs_lookup_first_block_group(root->fs_info, start);
@ -9425,7 +9417,6 @@ static int do_clear_free_space_cache(struct btrfs_fs_info *fs_info,
ret = 1; ret = 1;
goto close_out; goto close_out;
} }
printf("Clearing free space cache\n");
ret = clear_free_space_cache(fs_info); ret = clear_free_space_cache(fs_info);
if (ret) { if (ret) {
error("failed to clear free space cache"); error("failed to clear free space cache");
@ -9452,6 +9443,34 @@ close_out:
return ret; return ret;
} }
static int validate_free_space_cache(struct btrfs_root *root)
{
int ret;
if (btrfs_super_cache_generation(root->fs_info->super_copy) != -1ULL &&
btrfs_super_generation(root->fs_info->super_copy) !=
btrfs_super_cache_generation(root->fs_info->super_copy)) {
printf(
"cache and super generation don't match, space cache will be invalidated\n");
return 0;
}
ret = check_space_cache(root);
if (ret && btrfs_fs_compat_ro(global_info, FREE_SPACE_TREE) &&
repair) {
ret = do_clear_free_space_cache(global_info, 2);
if (ret)
goto out;
ret = btrfs_create_free_space_tree(global_info);
if (ret)
error("couldn't repair freespace tree");
}
out:
return ret ? -EINVAL : 0;
}
const char * const cmd_check_usage[] = { const char * const cmd_check_usage[] = {
"btrfs check [options] <device>", "btrfs check [options] <device>",
"Check structural integrity of a filesystem (unmounted).", "Check structural integrity of a filesystem (unmounted).",
@ -9885,16 +9904,9 @@ int cmd_check(int argc, char **argv)
task_start(ctx.info, &ctx.start_time, &ctx.item_count); task_start(ctx.info, &ctx.start_time, &ctx.item_count);
} }
ret = check_space_cache(root); ret = validate_free_space_cache(root);
task_stop(ctx.info); task_stop(ctx.info);
err |= !!ret; err |= !!ret;
if (ret) {
if (is_free_space_tree)
error("errors found in free space tree");
else
error("errors found in free space cache");
goto out;
}
/* /*
* We used to have to have these hole extents in between our real * We used to have to have these hole extents in between our real