RepoMirrors/btrfs-progs
1
0
Fork 0
mirror of https://github.com/kdave/btrfs-progs synced 2025-05-14 22:08:36 +00:00
Code Issues Packages Projects Releases Wiki Activity

btrfs-progs: check: introduce traversal function for fsck

Browse Source 
Introduce a new function traverse_tree_block() to do pre-order
traversal, to co-operate with new fs/subvolume tree skip function.

Signed-off-by: Lu Fengqi <lufq.fnst@cn.fujitsu.com>
Signed-off-by: Qu Wenruo <quwenruo@cn.fujitsu.com>
Reviewed-by: Josef Bacik <jbacik@fb.com>
Signed-off-by: David Sterba <dsterba@suse.com>
This commit is contained in:
Lu Fengqi 2016-04-24 15:35:41 +08:00 committed by David Sterba
parent 3974c9117e
commit dad817d3ba
1 changed files with 77 additions and 0 deletions

77
cmds-check.c
View File

@ -9875,6 +9875,83 @@ need_check:
return 1;
}
/*
* Traversal function for tree block. We will do:
* 1) Skip shared fs/subvolume tree blocks
* 2) Update related bytes accounting
* 3) Pre-order traversal
*/
static int traverse_tree_block(struct btrfs_root *root,
struct extent_buffer *node)
{
struct extent_buffer *eb;
int level;
u64 nr;
int i;
int err = 0;
int ret;
/*
* Skip shared fs/subvolume tree block, in that case they will
* be checked by referencer with lowest rootid
*/
if (is_fstree(root->objectid) && !should_check(root, node))
return 0;
/* Update bytes accounting */
total_btree_bytes += node->len;
if (fs_root_objectid(btrfs_header_owner(node)))
total_fs_tree_bytes += node->len;
if (btrfs_header_owner(node) == BTRFS_EXTENT_TREE_OBJECTID)
total_extent_tree_bytes += node->len;
if (!found_old_backref &&
btrfs_header_owner(node) == BTRFS_TREE_RELOC_OBJECTID &&
btrfs_header_backref_rev(node) == BTRFS_MIXED_BACKREF_REV &&
!btrfs_header_flag(node, BTRFS_HEADER_FLAG_RELOC))
found_old_backref = 1;
/* pre-order tranversal, check itself first */
level = btrfs_header_level(node);
ret = check_tree_block_ref(root, node, btrfs_header_bytenr(node),
btrfs_header_level(node),
btrfs_header_owner(node));
err |= ret;
if (err)
error(
"check %s failed root %llu bytenr %llu level %d, force continue check",
level ? "node":"leaf", root->objectid,
btrfs_header_bytenr(node), btrfs_header_level(node));
if (!level) {
btree_space_waste += btrfs_leaf_free_space(root, node);
ret = check_leaf_items(root, node);
err |= ret;
return err;
}
nr = btrfs_header_nritems(node);
btree_space_waste += (BTRFS_NODEPTRS_PER_BLOCK(root) - nr) *
sizeof(struct btrfs_key_ptr);
/* Then check all its children */
for (i = 0; i < nr; i++) {
u64 blocknr = btrfs_node_blockptr(node, i);
/*
* As a btrfs tree has most 8 levels (0..7), so it's quite safe
* to call the function itself.
*/
eb = read_tree_block(root, blocknr, root->nodesize, 0);
if (extent_buffer_uptodate(eb)) {
ret = traverse_tree_block(root, eb);
err |= ret;
}
free_extent_buffer(eb);
}
return err;
}
static int btrfs_fsck_reinit_root(struct btrfs_trans_handle *trans,
struct btrfs_root *root, int overwrite)
{