mirror of
https://mirrors.bfsu.edu.cn/git/linux.git
synced 2024-11-11 04:18:39 +08:00
btrfs: fix corrupt read due to bad offset of a compressed extent map
If we attempt to insert a compressed extent map that has a range that
overlaps another extent map we have in the inode's extent map tree, we
can end up with an incorrect offset after adjusting the new extent map at
merge_extent_mapping() because we don't update the extent map's offset.
For example consider the following scenario:
1) We have a file extent item for a compressed extent covering the file
range [108K, 144K) and currently there's no corresponding extent map
in the inode's extent map tree;
2) The inode's size is 141K;
3) We have an encoded write (compressed) into the file range [120K, 128K),
which overlaps the existing file extent item. The encoded write creates
a matching extent map, adds it to the inode's extent map tree and
creates an ordered extent for it.
Note that the corresponding file extent item is added to the subvolume
tree only when the ordered extent completes (when executing
btrfs_finish_one_ordered());
4) We have a write into the file range [160K, 164K).
This writes increases the i_size of the file, and there's a hole
between the current i_size (141K) and the start offset of this write,
and since the old i_size is in the middle of the block [140K, 144K),
we have to write zeroes to the range [141K, 144K) (3072 bytes) and
therefore dirty that page.
We then call btrfs_set_extent_delalloc() with a start offset of 140K.
We then end up at btrfs_find_new_delalloc_bytes() which will call
btrfs_get_extent() for the range [140K, 144K);
5) The btrfs_get_extent() doesn't find any extent map in the inode's
extent map tree covering the range [140K, 144K), so it searches the
subvolume tree for any file extent items covering that range.
There it finds the file extent item for the range [108K, 144K),
creates a compressed extent map for that range and then calls
btrfs_add_extent_mapping() with that extent map and passes the
range [140K, 144K) via the "start" and "len" parameters;
6) The call to add_extent_mapping() done by btrfs_add_extent_mapping()
fails with -EEXIST because there's an extent map, created at step 2
for the [120K, 128K) range, that covers that overlaps with the range
of the given extent map ([108K, 144K)).
Then it does a lookup for extent map from step 2 add calls
merge_extent_mapping() to adjust the input extent map ([108K, 144K)).
That adjust the extent map to a start offset of 128K and a length
of 16K (starting just after the extent map from step 2), but it does
not update the offset field of the extent map, leaving it with a value
of zero instead of updating to a value of 20K (128K - 108K = 20K).
As a result any read for the range [128K, 144K) can return
incorrect data since we read from a wrong section of the extent (unless
both the correct and incorrect ranges happen to have the same data).
So fix this by changing merge_extent_mapping() to update the extent map's
offset even if it's compressed. Also add a test case to the self tests.
This didn't happen before the patchset that does big changes in the extent
map structure (which includes the commit in the Fixes tag below) because
we kept track of the original start offset in the extent map (member
"orig_start") so we could always calculate the correct offset by
subtracting that offset from the start offset.
A test case for fstests that triggered this problem using send/receive
with compressed writes will be added soon.
Fixes: 3d2ac99224
("btrfs: introduce new members for extent_map")
Reviewed-by: Qu Wenruo <wqu@suse.com>
Signed-off-by: Filipe Manana <fdmanana@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
This commit is contained in:
parent
f333a3c7e8
commit
de9f46cb00
@ -664,7 +664,7 @@ static noinline int merge_extent_mapping(struct btrfs_inode *inode,
|
||||
start_diff = start - em->start;
|
||||
em->start = start;
|
||||
em->len = end - start;
|
||||
if (em->disk_bytenr < EXTENT_MAP_LAST_BYTE && !extent_map_is_compressed(em))
|
||||
if (em->disk_bytenr < EXTENT_MAP_LAST_BYTE)
|
||||
em->offset += start_diff;
|
||||
return add_extent_mapping(inode, em, 0);
|
||||
}
|
||||
|
@ -900,6 +900,102 @@ out:
|
||||
return ret;
|
||||
}
|
||||
|
||||
/*
|
||||
* Test a regression for compressed extent map adjustment when we attempt to
|
||||
* add an extent map that is partially overlapped by another existing extent
|
||||
* map. The resulting extent map offset was left unchanged despite having
|
||||
* incremented its start offset.
|
||||
*/
|
||||
static int test_case_8(struct btrfs_fs_info *fs_info, struct btrfs_inode *inode)
|
||||
{
|
||||
struct extent_map_tree *em_tree = &inode->extent_tree;
|
||||
struct extent_map *em;
|
||||
int ret;
|
||||
int ret2;
|
||||
|
||||
em = alloc_extent_map();
|
||||
if (!em) {
|
||||
test_std_err(TEST_ALLOC_EXTENT_MAP);
|
||||
return -ENOMEM;
|
||||
}
|
||||
|
||||
/* Compressed extent for the file range [120K, 128K). */
|
||||
em->start = SZ_1K * 120;
|
||||
em->len = SZ_8K;
|
||||
em->disk_num_bytes = SZ_4K;
|
||||
em->ram_bytes = SZ_8K;
|
||||
em->flags |= EXTENT_FLAG_COMPRESS_ZLIB;
|
||||
write_lock(&em_tree->lock);
|
||||
ret = btrfs_add_extent_mapping(inode, &em, em->start, em->len);
|
||||
write_unlock(&em_tree->lock);
|
||||
free_extent_map(em);
|
||||
if (ret < 0) {
|
||||
test_err("couldn't add extent map for range [120K, 128K)");
|
||||
goto out;
|
||||
}
|
||||
|
||||
em = alloc_extent_map();
|
||||
if (!em) {
|
||||
test_std_err(TEST_ALLOC_EXTENT_MAP);
|
||||
ret = -ENOMEM;
|
||||
goto out;
|
||||
}
|
||||
|
||||
/*
|
||||
* Compressed extent for the file range [108K, 144K), which overlaps
|
||||
* with the [120K, 128K) we previously inserted.
|
||||
*/
|
||||
em->start = SZ_1K * 108;
|
||||
em->len = SZ_1K * 36;
|
||||
em->disk_num_bytes = SZ_4K;
|
||||
em->ram_bytes = SZ_1K * 36;
|
||||
em->flags |= EXTENT_FLAG_COMPRESS_ZLIB;
|
||||
|
||||
/*
|
||||
* Try to add the extent map but with a search range of [140K, 144K),
|
||||
* this should succeed and adjust the extent map to the range
|
||||
* [128K, 144K), with a length of 16K and an offset of 20K.
|
||||
*
|
||||
* This simulates a scenario where in the subvolume tree of an inode we
|
||||
* have a compressed file extent item for the range [108K, 144K) and we
|
||||
* have an overlapping compressed extent map for the range [120K, 128K),
|
||||
* which was created by an encoded write, but its ordered extent was not
|
||||
* yet completed, so the subvolume tree doesn't have yet the file extent
|
||||
* item for that range - we only have the extent map in the inode's
|
||||
* extent map tree.
|
||||
*/
|
||||
write_lock(&em_tree->lock);
|
||||
ret = btrfs_add_extent_mapping(inode, &em, SZ_1K * 140, SZ_4K);
|
||||
write_unlock(&em_tree->lock);
|
||||
free_extent_map(em);
|
||||
if (ret < 0) {
|
||||
test_err("couldn't add extent map for range [108K, 144K)");
|
||||
goto out;
|
||||
}
|
||||
|
||||
if (em->start != SZ_128K) {
|
||||
test_err("unexpected extent map start %llu (should be 128K)", em->start);
|
||||
ret = -EINVAL;
|
||||
goto out;
|
||||
}
|
||||
if (em->len != SZ_16K) {
|
||||
test_err("unexpected extent map length %llu (should be 16K)", em->len);
|
||||
ret = -EINVAL;
|
||||
goto out;
|
||||
}
|
||||
if (em->offset != SZ_1K * 20) {
|
||||
test_err("unexpected extent map offset %llu (should be 20K)", em->offset);
|
||||
ret = -EINVAL;
|
||||
goto out;
|
||||
}
|
||||
out:
|
||||
ret2 = free_extent_map_tree(inode);
|
||||
if (ret == 0)
|
||||
ret = ret2;
|
||||
|
||||
return ret;
|
||||
}
|
||||
|
||||
struct rmap_test_vector {
|
||||
u64 raid_type;
|
||||
u64 physical_start;
|
||||
@ -1076,6 +1172,9 @@ int btrfs_test_extent_map(void)
|
||||
if (ret)
|
||||
goto out;
|
||||
ret = test_case_7(fs_info, BTRFS_I(inode));
|
||||
if (ret)
|
||||
goto out;
|
||||
ret = test_case_8(fs_info, BTRFS_I(inode));
|
||||
if (ret)
|
||||
goto out;
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user