Commit 1b984508 authored by Forrest Liu's avatar Forrest Liu Committed by Chris Mason

Btrfs: fix find_free_dev_extent() malfunction in case device tree has hole

If device tree has hole, find_free_dev_extent() cannot find available
address properly.

The problem can be reproduce by following script.

    mntpath=/btrfs
    loopdev=/dev/loop0
    filepath=/home/forrest/image

    umount $mntpath
    losetup -d $loopdev
    truncate --size 100g $filepath
    losetup $loopdev $filepath
    mkfs.btrfs -f $loopdev
    mount $loopdev $mntpath

    # make device tree with one big hole
    for i in `seq 1 1 100`; do
        fallocate -l 1g $mntpath/$i
    done
    sync
    for i in `seq 1 1 95`; do
        rm $mntpath/$i
    done
    sync

    # wait cleaner thread remove unused block group
    sleep 300

    fallocate -l 1g $mntpath/aaa

    # failed to allocate new chunk
    fallocate -l 1g $mntpath/bbb

Above script will make device tree with one big hole, and can only allocate
just one chunk in a transaction, so failed to allocate new chunk for $mntpath/bbb

    item 8 key (1 DEV_EXTENT 2185232384) itemoff 15859 itemsize 48
        dev extent chunk_tree 3
        chunk objectid 256 chunk offset 106292051968 length 1073741824
    item 9 key (1 DEV_EXTENT 104190705664) itemoff 15811 itemsize 48
        dev extent chunk_tree 3
        chunk objectid 256 chunk offset 103108575232 length 1073741824
Signed-off-by: default avatarForrest Liu <forrestl@synology.com>
Reviewed-by: default avatarLiu Bo <bo.li.liu@oracle.com>
Signed-off-by: default avatarChris Mason <clm@fb.com>
parent e4c88f00
...@@ -1058,6 +1058,7 @@ static int contains_pending_extent(struct btrfs_trans_handle *trans, ...@@ -1058,6 +1058,7 @@ static int contains_pending_extent(struct btrfs_trans_handle *trans,
struct extent_map *em; struct extent_map *em;
struct list_head *search_list = &trans->transaction->pending_chunks; struct list_head *search_list = &trans->transaction->pending_chunks;
int ret = 0; int ret = 0;
u64 physical_start = *start;
again: again:
list_for_each_entry(em, search_list, list) { list_for_each_entry(em, search_list, list) {
...@@ -1068,9 +1069,9 @@ static int contains_pending_extent(struct btrfs_trans_handle *trans, ...@@ -1068,9 +1069,9 @@ static int contains_pending_extent(struct btrfs_trans_handle *trans,
for (i = 0; i < map->num_stripes; i++) { for (i = 0; i < map->num_stripes; i++) {
if (map->stripes[i].dev != device) if (map->stripes[i].dev != device)
continue; continue;
if (map->stripes[i].physical >= *start + len || if (map->stripes[i].physical >= physical_start + len ||
map->stripes[i].physical + em->orig_block_len <= map->stripes[i].physical + em->orig_block_len <=
*start) physical_start)
continue; continue;
*start = map->stripes[i].physical + *start = map->stripes[i].physical +
em->orig_block_len; em->orig_block_len;
...@@ -1193,8 +1194,14 @@ int find_free_dev_extent(struct btrfs_trans_handle *trans, ...@@ -1193,8 +1194,14 @@ int find_free_dev_extent(struct btrfs_trans_handle *trans,
*/ */
if (contains_pending_extent(trans, device, if (contains_pending_extent(trans, device,
&search_start, &search_start,
hole_size)) hole_size)) {
hole_size = 0; if (key.offset >= search_start) {
hole_size = key.offset - search_start;
} else {
WARN_ON_ONCE(1);
hole_size = 0;
}
}
if (hole_size > max_hole_size) { if (hole_size > max_hole_size) {
max_hole_start = search_start; max_hole_start = search_start;
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment