mirror of
https://github.com/kdave/btrfs-progs
synced 2025-04-24 20:17:57 +00:00
btrfs-progs: check: move btrfs_mark_used_tree_blocks to common
This is going to be used for the extent tree v2 stuff more commonly, so move it out so that it is accessible from everywhere that we need it. Signed-off-by: Josef Bacik <josef@toxicpanda.com> Signed-off-by: David Sterba <dsterba@suse.com>
This commit is contained in:
Josef Bacik
David Sterba
parent
17f6374cfa
commit
d67bf1b365
@ -599,110 +599,6 @@ void reset_cached_block_groups()
|
||||
}
|
||||
}
|
||||
|
||||
static int traverse_tree_blocks(struct extent_io_tree *tree,
|
||||
struct extent_buffer *eb, int tree_root)
|
||||
{
|
||||
struct btrfs_fs_info *fs_info = eb->fs_info;
|
||||
struct extent_buffer *tmp;
|
||||
struct btrfs_root_item *ri;
|
||||
struct btrfs_key key;
|
||||
u64 bytenr;
|
||||
int level = btrfs_header_level(eb);
|
||||
int nritems;
|
||||
int ret;
|
||||
int i;
|
||||
u64 end = eb->start + eb->len;
|
||||
bool pin = tree == &fs_info->pinned_extents;
|
||||
|
||||
/*
|
||||
* If we have pinned/excluded this block before, don't do it again.
|
||||
* This can not only avoid forever loop with broken filesystem
|
||||
* but also give us some speedups.
|
||||
*/
|
||||
if (test_range_bit(tree, eb->start, end - 1, EXTENT_DIRTY, 0))
|
||||
return 0;
|
||||
|
||||
if (pin)
|
||||
btrfs_pin_extent(fs_info, eb->start, eb->len);
|
||||
else
|
||||
set_extent_dirty(tree, eb->start, end - 1);
|
||||
|
||||
nritems = btrfs_header_nritems(eb);
|
||||
for (i = 0; i < nritems; i++) {
|
||||
if (level == 0) {
|
||||
bool is_extent_root;
|
||||
btrfs_item_key_to_cpu(eb, &key, i);
|
||||
if (key.type != BTRFS_ROOT_ITEM_KEY)
|
||||
continue;
|
||||
/* Skip the extent root and reloc roots */
|
||||
if (key.objectid == BTRFS_TREE_RELOC_OBJECTID ||
|
||||
key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID)
|
||||
continue;
|
||||
is_extent_root =
|
||||
key.objectid == BTRFS_EXTENT_TREE_OBJECTID;
|
||||
/* If pin, skip the extent root */
|
||||
if (pin && is_extent_root)
|
||||
continue;
|
||||
ri = btrfs_item_ptr(eb, i, struct btrfs_root_item);
|
||||
bytenr = btrfs_disk_root_bytenr(eb, ri);
|
||||
|
||||
/*
|
||||
* If at any point we start needing the real root we
|
||||
* will have to build a stump root for the root we are
|
||||
* in, but for now this doesn't actually use the root so
|
||||
* just pass in extent_root.
|
||||
*/
|
||||
tmp = read_tree_block(fs_info, bytenr, 0);
|
||||
if (!extent_buffer_uptodate(tmp)) {
|
||||
fprintf(stderr, "Error reading root block\n");
|
||||
return -EIO;
|
||||
}
|
||||
ret = traverse_tree_blocks(tree, tmp, 0);
|
||||
free_extent_buffer(tmp);
|
||||
if (ret)
|
||||
return ret;
|
||||
} else {
|
||||
u64 end;
|
||||
|
||||
bytenr = btrfs_node_blockptr(eb, i);
|
||||
end = bytenr + fs_info->nodesize - 1;
|
||||
|
||||
/* If we aren't the tree root don't read the block */
|
||||
if (level == 1 && !tree_root) {
|
||||
if (pin)
|
||||
btrfs_pin_extent(fs_info, bytenr,
|
||||
fs_info->nodesize);
|
||||
else
|
||||
set_extent_dirty(tree, bytenr, end);
|
||||
continue;
|
||||
}
|
||||
|
||||
tmp = read_tree_block(fs_info, bytenr, 0);
|
||||
if (!extent_buffer_uptodate(tmp)) {
|
||||
fprintf(stderr, "Error reading tree block\n");
|
||||
return -EIO;
|
||||
}
|
||||
ret = traverse_tree_blocks(tree, tmp, tree_root);
|
||||
free_extent_buffer(tmp);
|
||||
if (ret)
|
||||
return ret;
|
||||
}
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int btrfs_mark_used_tree_blocks(struct btrfs_fs_info *fs_info,
|
||||
struct extent_io_tree *tree)
|
||||
{
|
||||
int ret;
|
||||
|
||||
ret = traverse_tree_blocks(tree, fs_info->chunk_root->node, 0);
|
||||
if (!ret)
|
||||
ret = traverse_tree_blocks(tree, fs_info->tree_root->node, 1);
|
||||
return ret;
|
||||
}
|
||||
|
||||
int pin_metadata_blocks(void)
|
||||
{
|
||||
return btrfs_mark_used_tree_blocks(gfs_info,
|
||||
|
||||
105
common/repair.c
105
common/repair.c
@ -18,6 +18,7 @@
|
||||
|
||||
#include "kernel-shared/ctree.h"
|
||||
#include "kernel-shared/transaction.h"
|
||||
#include "kernel-shared/disk-io.h"
|
||||
#include "common/extent-cache.h"
|
||||
#include "common/utils.h"
|
||||
#include "common/repair.h"
|
||||
@ -51,6 +52,110 @@ int btrfs_add_corrupt_extent_record(struct btrfs_fs_info *info,
|
||||
return ret;
|
||||
}
|
||||
|
||||
static int traverse_tree_blocks(struct extent_io_tree *tree,
|
||||
struct extent_buffer *eb, int tree_root)
|
||||
{
|
||||
struct btrfs_fs_info *fs_info = eb->fs_info;
|
||||
struct extent_buffer *tmp;
|
||||
struct btrfs_root_item *ri;
|
||||
struct btrfs_key key;
|
||||
u64 bytenr;
|
||||
int level = btrfs_header_level(eb);
|
||||
int nritems;
|
||||
int ret;
|
||||
int i;
|
||||
u64 end = eb->start + eb->len;
|
||||
bool pin = tree == &fs_info->pinned_extents;
|
||||
|
||||
/*
|
||||
* If we have pinned/excluded this block before, don't do it again.
|
||||
* This can not only avoid forever loop with broken filesystem
|
||||
* but also give us some speedups.
|
||||
*/
|
||||
if (test_range_bit(tree, eb->start, end - 1, EXTENT_DIRTY, 0))
|
||||
return 0;
|
||||
|
||||
if (pin)
|
||||
btrfs_pin_extent(fs_info, eb->start, eb->len);
|
||||
else
|
||||
set_extent_dirty(tree, eb->start, end - 1);
|
||||
|
||||
nritems = btrfs_header_nritems(eb);
|
||||
for (i = 0; i < nritems; i++) {
|
||||
if (level == 0) {
|
||||
bool is_extent_root;
|
||||
btrfs_item_key_to_cpu(eb, &key, i);
|
||||
if (key.type != BTRFS_ROOT_ITEM_KEY)
|
||||
continue;
|
||||
/* Skip the extent root and reloc roots */
|
||||
if (key.objectid == BTRFS_TREE_RELOC_OBJECTID ||
|
||||
key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID)
|
||||
continue;
|
||||
is_extent_root =
|
||||
key.objectid == BTRFS_EXTENT_TREE_OBJECTID;
|
||||
/* If pin, skip the extent root */
|
||||
if (pin && is_extent_root)
|
||||
continue;
|
||||
ri = btrfs_item_ptr(eb, i, struct btrfs_root_item);
|
||||
bytenr = btrfs_disk_root_bytenr(eb, ri);
|
||||
|
||||
/*
|
||||
* If at any point we start needing the real root we
|
||||
* will have to build a stump root for the root we are
|
||||
* in, but for now this doesn't actually use the root so
|
||||
* just pass in extent_root.
|
||||
*/
|
||||
tmp = read_tree_block(fs_info, bytenr, 0);
|
||||
if (!extent_buffer_uptodate(tmp)) {
|
||||
fprintf(stderr, "Error reading root block\n");
|
||||
return -EIO;
|
||||
}
|
||||
ret = traverse_tree_blocks(tree, tmp, 0);
|
||||
free_extent_buffer(tmp);
|
||||
if (ret)
|
||||
return ret;
|
||||
} else {
|
||||
u64 end;
|
||||
|
||||
bytenr = btrfs_node_blockptr(eb, i);
|
||||
end = bytenr + fs_info->nodesize - 1;
|
||||
|
||||
/* If we aren't the tree root don't read the block */
|
||||
if (level == 1 && !tree_root) {
|
||||
if (pin)
|
||||
btrfs_pin_extent(fs_info, bytenr,
|
||||
fs_info->nodesize);
|
||||
else
|
||||
set_extent_dirty(tree, bytenr, end);
|
||||
continue;
|
||||
}
|
||||
|
||||
tmp = read_tree_block(fs_info, bytenr, 0);
|
||||
if (!extent_buffer_uptodate(tmp)) {
|
||||
fprintf(stderr, "Error reading tree block\n");
|
||||
return -EIO;
|
||||
}
|
||||
ret = traverse_tree_blocks(tree, tmp, tree_root);
|
||||
free_extent_buffer(tmp);
|
||||
if (ret)
|
||||
return ret;
|
||||
}
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int btrfs_mark_used_tree_blocks(struct btrfs_fs_info *fs_info,
|
||||
struct extent_io_tree *tree)
|
||||
{
|
||||
int ret;
|
||||
|
||||
ret = traverse_tree_blocks(tree, fs_info->chunk_root->node, 0);
|
||||
if (!ret)
|
||||
ret = traverse_tree_blocks(tree, fs_info->tree_root->node, 1);
|
||||
return ret;
|
||||
}
|
||||
|
||||
/*
|
||||
* Fixup block accounting. The initial block accounting created by
|
||||
* make_block_groups isn't accuracy in this case.
|
||||
|
||||
@ -33,5 +33,7 @@ int btrfs_add_corrupt_extent_record(struct btrfs_fs_info *info,
|
||||
struct btrfs_key *first_key,
|
||||
u64 start, u64 len, int level);
|
||||
int btrfs_fix_block_accounting(struct btrfs_trans_handle *trans);
|
||||
int btrfs_mark_used_tree_blocks(struct btrfs_fs_info *fs_info,
|
||||
struct extent_io_tree *tree);
|
||||
|
||||
#endif
|
||||
|
||||
Loading…
Reference in New Issue
Block a user