Btrfs: create a helper for getting chunk map

We have similar code here and there, this merges them into a helper.

Signed-off-by: Liu Bo <bo.li.liu@oracle.com>
Reviewed-by: Qu Wenruo <quwenruo@cn.fujitsu.com>
Signed-off-by: David Sterba <dsterba@suse.com>
This commit is contained in:
Liu Bo 2017-03-14 13:33:55 -07:00 committed by David Sterba
parent 09ed2f165c
commit 592d92eeab
3 changed files with 57 additions and 111 deletions

View File

@ -2004,14 +2004,13 @@ int repair_io_failure(struct btrfs_inode *inode, u64 start, u64 length,
u64 map_length = 0; u64 map_length = 0;
u64 sector; u64 sector;
struct btrfs_bio *bbio = NULL; struct btrfs_bio *bbio = NULL;
struct btrfs_mapping_tree *map_tree = &fs_info->mapping_tree;
int ret; int ret;
ASSERT(!(fs_info->sb->s_flags & MS_RDONLY)); ASSERT(!(fs_info->sb->s_flags & MS_RDONLY));
BUG_ON(!mirror_num); BUG_ON(!mirror_num);
/* we can't repair anything in raid56 yet */ /* we can't repair anything in raid56 yet */
if (btrfs_is_parity_mirror(map_tree, logical, length, mirror_num)) if (btrfs_is_parity_mirror(fs_info, logical, length, mirror_num))
return 0; return 0;
bio = btrfs_io_bio_alloc(GFP_NOFS, 1); bio = btrfs_io_bio_alloc(GFP_NOFS, 1);

View File

@ -2795,10 +2795,38 @@ static int btrfs_del_sys_chunk(struct btrfs_fs_info *fs_info,
return ret; return ret;
} }
static struct extent_map *get_chunk_map(struct btrfs_fs_info *fs_info,
u64 logical, u64 length)
{
struct extent_map_tree *em_tree;
struct extent_map *em;
em_tree = &fs_info->mapping_tree.map_tree;
read_lock(&em_tree->lock);
em = lookup_extent_mapping(em_tree, logical, length);
read_unlock(&em_tree->lock);
if (!em) {
btrfs_crit(fs_info, "unable to find logical %llu length %llu",
logical, length);
return ERR_PTR(-EINVAL);
}
if (em->start > logical || em->start + em->len < logical) {
btrfs_crit(fs_info,
"found a bad mapping, wanted %llu-%llu, found %llu-%llu",
logical, length, em->start, em->start + em->len);
free_extent_map(em);
return ERR_PTR(-EINVAL);
}
/* callers are responsible for dropping em's ref. */
return em;
}
int btrfs_remove_chunk(struct btrfs_trans_handle *trans, int btrfs_remove_chunk(struct btrfs_trans_handle *trans,
struct btrfs_fs_info *fs_info, u64 chunk_offset) struct btrfs_fs_info *fs_info, u64 chunk_offset)
{ {
struct extent_map_tree *em_tree;
struct extent_map *em; struct extent_map *em;
struct map_lookup *map; struct map_lookup *map;
u64 dev_extent_len = 0; u64 dev_extent_len = 0;
@ -2806,23 +2834,15 @@ int btrfs_remove_chunk(struct btrfs_trans_handle *trans,
int i, ret = 0; int i, ret = 0;
struct btrfs_fs_devices *fs_devices = fs_info->fs_devices; struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
em_tree = &fs_info->mapping_tree.map_tree; em = get_chunk_map(fs_info, chunk_offset, 1);
if (IS_ERR(em)) {
read_lock(&em_tree->lock);
em = lookup_extent_mapping(em_tree, chunk_offset, 1);
read_unlock(&em_tree->lock);
if (!em || em->start > chunk_offset ||
em->start + em->len < chunk_offset) {
/* /*
* This is a logic error, but we don't want to just rely on the * This is a logic error, but we don't want to just rely on the
* user having built with ASSERT enabled, so if ASSERT doesn't * user having built with ASSERT enabled, so if ASSERT doesn't
* do anything we still error out. * do anything we still error out.
*/ */
ASSERT(0); ASSERT(0);
if (em) return PTR_ERR(em);
free_extent_map(em);
return -EINVAL;
} }
map = em->map_lookup; map = em->map_lookup;
mutex_lock(&fs_info->chunk_mutex); mutex_lock(&fs_info->chunk_mutex);
@ -4894,7 +4914,6 @@ int btrfs_finish_chunk_alloc(struct btrfs_trans_handle *trans,
struct btrfs_device *device; struct btrfs_device *device;
struct btrfs_chunk *chunk; struct btrfs_chunk *chunk;
struct btrfs_stripe *stripe; struct btrfs_stripe *stripe;
struct extent_map_tree *em_tree;
struct extent_map *em; struct extent_map *em;
struct map_lookup *map; struct map_lookup *map;
size_t item_size; size_t item_size;
@ -4903,24 +4922,9 @@ int btrfs_finish_chunk_alloc(struct btrfs_trans_handle *trans,
int i = 0; int i = 0;
int ret = 0; int ret = 0;
em_tree = &fs_info->mapping_tree.map_tree; em = get_chunk_map(fs_info, chunk_offset, chunk_size);
read_lock(&em_tree->lock); if (IS_ERR(em))
em = lookup_extent_mapping(em_tree, chunk_offset, chunk_size); return PTR_ERR(em);
read_unlock(&em_tree->lock);
if (!em) {
btrfs_crit(fs_info, "unable to find logical %Lu len %Lu",
chunk_offset, chunk_size);
return -EINVAL;
}
if (em->start != chunk_offset || em->len != chunk_size) {
btrfs_crit(fs_info,
"found a bad mapping, wanted %Lu-%Lu, found %Lu-%Lu",
chunk_offset, chunk_size, em->start, em->len);
free_extent_map(em);
return -EINVAL;
}
map = em->map_lookup; map = em->map_lookup;
item_size = btrfs_chunk_item_size(map->num_stripes); item_size = btrfs_chunk_item_size(map->num_stripes);
@ -5061,15 +5065,12 @@ int btrfs_chunk_readonly(struct btrfs_fs_info *fs_info, u64 chunk_offset)
{ {
struct extent_map *em; struct extent_map *em;
struct map_lookup *map; struct map_lookup *map;
struct btrfs_mapping_tree *map_tree = &fs_info->mapping_tree;
int readonly = 0; int readonly = 0;
int miss_ndevs = 0; int miss_ndevs = 0;
int i; int i;
read_lock(&map_tree->map_tree.lock); em = get_chunk_map(fs_info, chunk_offset, 1);
em = lookup_extent_mapping(&map_tree->map_tree, chunk_offset, 1); if (IS_ERR(em))
read_unlock(&map_tree->map_tree.lock);
if (!em)
return 1; return 1;
map = em->map_lookup; map = em->map_lookup;
@ -5123,34 +5124,19 @@ void btrfs_mapping_tree_free(struct btrfs_mapping_tree *tree)
int btrfs_num_copies(struct btrfs_fs_info *fs_info, u64 logical, u64 len) int btrfs_num_copies(struct btrfs_fs_info *fs_info, u64 logical, u64 len)
{ {
struct btrfs_mapping_tree *map_tree = &fs_info->mapping_tree;
struct extent_map *em; struct extent_map *em;
struct map_lookup *map; struct map_lookup *map;
struct extent_map_tree *em_tree = &map_tree->map_tree;
int ret; int ret;
read_lock(&em_tree->lock); em = get_chunk_map(fs_info, logical, len);
em = lookup_extent_mapping(em_tree, logical, len); if (IS_ERR(em))
read_unlock(&em_tree->lock); /*
* We could return errors for these cases, but that could get
/* * ugly and we'd probably do the same thing which is just not do
* We could return errors for these cases, but that could get ugly and * anything else and exit, so return 1 so the callers don't try
* we'd probably do the same thing which is just not do anything else * to use other copies.
* and exit, so return 1 so the callers don't try to use other copies. */
*/
if (!em) {
btrfs_crit(fs_info, "No mapping for %Lu-%Lu", logical,
logical+len);
return 1; return 1;
}
if (em->start > logical || em->start + em->len < logical) {
btrfs_crit(fs_info, "Invalid mapping for %Lu-%Lu, got %Lu-%Lu",
logical, logical+len, em->start,
em->start + em->len);
free_extent_map(em);
return 1;
}
map = em->map_lookup; map = em->map_lookup;
if (map->type & (BTRFS_BLOCK_GROUP_DUP | BTRFS_BLOCK_GROUP_RAID1)) if (map->type & (BTRFS_BLOCK_GROUP_DUP | BTRFS_BLOCK_GROUP_RAID1))
@ -5179,15 +5165,11 @@ unsigned long btrfs_full_stripe_len(struct btrfs_fs_info *fs_info,
{ {
struct extent_map *em; struct extent_map *em;
struct map_lookup *map; struct map_lookup *map;
struct extent_map_tree *em_tree = &map_tree->map_tree;
unsigned long len = fs_info->sectorsize; unsigned long len = fs_info->sectorsize;
read_lock(&em_tree->lock); em = get_chunk_map(fs_info, logical, len);
em = lookup_extent_mapping(em_tree, logical, len); BUG_ON(IS_ERR(em));
read_unlock(&em_tree->lock);
BUG_ON(!em);
BUG_ON(em->start > logical || em->start + em->len < logical);
map = em->map_lookup; map = em->map_lookup;
if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK)
len = map->stripe_len * nr_data_stripes(map); len = map->stripe_len * nr_data_stripes(map);
@ -5195,20 +5177,16 @@ unsigned long btrfs_full_stripe_len(struct btrfs_fs_info *fs_info,
return len; return len;
} }
int btrfs_is_parity_mirror(struct btrfs_mapping_tree *map_tree, int btrfs_is_parity_mirror(struct btrfs_fs_info *fs_info,
u64 logical, u64 len, int mirror_num) u64 logical, u64 len, int mirror_num)
{ {
struct extent_map *em; struct extent_map *em;
struct map_lookup *map; struct map_lookup *map;
struct extent_map_tree *em_tree = &map_tree->map_tree;
int ret = 0; int ret = 0;
read_lock(&em_tree->lock); em = get_chunk_map(fs_info, logical, len);
em = lookup_extent_mapping(em_tree, logical, len); BUG_ON(IS_ERR(em));
read_unlock(&em_tree->lock);
BUG_ON(!em);
BUG_ON(em->start > logical || em->start + em->len < logical);
map = em->map_lookup; map = em->map_lookup;
if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK)
ret = 1; ret = 1;
@ -5328,8 +5306,6 @@ static int __btrfs_map_block(struct btrfs_fs_info *fs_info,
{ {
struct extent_map *em; struct extent_map *em;
struct map_lookup *map; struct map_lookup *map;
struct btrfs_mapping_tree *map_tree = &fs_info->mapping_tree;
struct extent_map_tree *em_tree = &map_tree->map_tree;
u64 offset; u64 offset;
u64 stripe_offset; u64 stripe_offset;
u64 stripe_end_offset; u64 stripe_end_offset;
@ -5351,23 +5327,9 @@ static int __btrfs_map_block(struct btrfs_fs_info *fs_info,
u64 physical_to_patch_in_first_stripe = 0; u64 physical_to_patch_in_first_stripe = 0;
u64 raid56_full_stripe_start = (u64)-1; u64 raid56_full_stripe_start = (u64)-1;
read_lock(&em_tree->lock); em = get_chunk_map(fs_info, logical, *length);
em = lookup_extent_mapping(em_tree, logical, *length); if (IS_ERR(em))
read_unlock(&em_tree->lock); return PTR_ERR(em);
if (!em) {
btrfs_crit(fs_info, "unable to find logical %llu len %llu",
logical, *length);
return -EINVAL;
}
if (em->start > logical || em->start + em->len < logical) {
btrfs_crit(fs_info,
"found a bad mapping, wanted %Lu, found %Lu-%Lu",
logical, em->start, em->start + em->len);
free_extent_map(em);
return -EINVAL;
}
map = em->map_lookup; map = em->map_lookup;
offset = logical - em->start; offset = logical - em->start;
@ -5903,8 +5865,6 @@ int btrfs_rmap_block(struct btrfs_fs_info *fs_info,
u64 chunk_start, u64 physical, u64 devid, u64 chunk_start, u64 physical, u64 devid,
u64 **logical, int *naddrs, int *stripe_len) u64 **logical, int *naddrs, int *stripe_len)
{ {
struct btrfs_mapping_tree *map_tree = &fs_info->mapping_tree;
struct extent_map_tree *em_tree = &map_tree->map_tree;
struct extent_map *em; struct extent_map *em;
struct map_lookup *map; struct map_lookup *map;
u64 *buf; u64 *buf;
@ -5914,24 +5874,11 @@ int btrfs_rmap_block(struct btrfs_fs_info *fs_info,
u64 rmap_len; u64 rmap_len;
int i, j, nr = 0; int i, j, nr = 0;
read_lock(&em_tree->lock); em = get_chunk_map(fs_info, chunk_start, 1);
em = lookup_extent_mapping(em_tree, chunk_start, 1); if (IS_ERR(em))
read_unlock(&em_tree->lock);
if (!em) {
btrfs_err(fs_info, "couldn't find em for chunk %Lu",
chunk_start);
return -EIO; return -EIO;
}
if (em->start != chunk_start) {
btrfs_err(fs_info, "bad chunk start, em=%Lu, wanted=%Lu",
em->start, chunk_start);
free_extent_map(em);
return -EIO;
}
map = em->map_lookup; map = em->map_lookup;
length = em->len; length = em->len;
rmap_len = map->stripe_len; rmap_len = map->stripe_len;

View File

@ -475,7 +475,7 @@ void btrfs_destroy_dev_replace_tgtdev(struct btrfs_fs_info *fs_info,
void btrfs_init_dev_replace_tgtdev_for_resume(struct btrfs_fs_info *fs_info, void btrfs_init_dev_replace_tgtdev_for_resume(struct btrfs_fs_info *fs_info,
struct btrfs_device *tgtdev); struct btrfs_device *tgtdev);
void btrfs_scratch_superblocks(struct block_device *bdev, const char *device_path); void btrfs_scratch_superblocks(struct block_device *bdev, const char *device_path);
int btrfs_is_parity_mirror(struct btrfs_mapping_tree *map_tree, int btrfs_is_parity_mirror(struct btrfs_fs_info *fs_info,
u64 logical, u64 len, int mirror_num); u64 logical, u64 len, int mirror_num);
unsigned long btrfs_full_stripe_len(struct btrfs_fs_info *fs_info, unsigned long btrfs_full_stripe_len(struct btrfs_fs_info *fs_info,
struct btrfs_mapping_tree *map_tree, struct btrfs_mapping_tree *map_tree,