diff options
Diffstat (limited to 'fs/btrfs/volumes.c')
| -rw-r--r-- | fs/btrfs/volumes.c | 46 |
1 files changed, 19 insertions, 27 deletions
diff --git a/fs/btrfs/volumes.c b/fs/btrfs/volumes.c index 3ab80e9cd767..5dbefd11b4af 100644 --- a/fs/btrfs/volumes.c +++ b/fs/btrfs/volumes.c | |||
| @@ -721,7 +721,8 @@ error: | |||
| 721 | */ | 721 | */ |
| 722 | static noinline int find_free_dev_extent(struct btrfs_trans_handle *trans, | 722 | static noinline int find_free_dev_extent(struct btrfs_trans_handle *trans, |
| 723 | struct btrfs_device *device, | 723 | struct btrfs_device *device, |
| 724 | u64 num_bytes, u64 *start) | 724 | u64 num_bytes, u64 *start, |
| 725 | u64 *max_avail) | ||
| 725 | { | 726 | { |
| 726 | struct btrfs_key key; | 727 | struct btrfs_key key; |
| 727 | struct btrfs_root *root = device->dev_root; | 728 | struct btrfs_root *root = device->dev_root; |
| @@ -758,9 +759,13 @@ static noinline int find_free_dev_extent(struct btrfs_trans_handle *trans, | |||
| 758 | ret = btrfs_search_slot(trans, root, &key, path, 0, 0); | 759 | ret = btrfs_search_slot(trans, root, &key, path, 0, 0); |
| 759 | if (ret < 0) | 760 | if (ret < 0) |
| 760 | goto error; | 761 | goto error; |
| 761 | ret = btrfs_previous_item(root, path, 0, key.type); | 762 | if (ret > 0) { |
| 762 | if (ret < 0) | 763 | ret = btrfs_previous_item(root, path, key.objectid, key.type); |
| 763 | goto error; | 764 | if (ret < 0) |
| 765 | goto error; | ||
| 766 | if (ret > 0) | ||
| 767 | start_found = 1; | ||
| 768 | } | ||
| 764 | l = path->nodes[0]; | 769 | l = path->nodes[0]; |
| 765 | btrfs_item_key_to_cpu(l, &key, path->slots[0]); | 770 | btrfs_item_key_to_cpu(l, &key, path->slots[0]); |
| 766 | while (1) { | 771 | while (1) { |
| @@ -803,6 +808,10 @@ no_more_items: | |||
| 803 | if (last_byte < search_start) | 808 | if (last_byte < search_start) |
| 804 | last_byte = search_start; | 809 | last_byte = search_start; |
| 805 | hole_size = key.offset - last_byte; | 810 | hole_size = key.offset - last_byte; |
| 811 | |||
| 812 | if (hole_size > *max_avail) | ||
| 813 | *max_avail = hole_size; | ||
| 814 | |||
| 806 | if (key.offset > last_byte && | 815 | if (key.offset > last_byte && |
| 807 | hole_size >= num_bytes) { | 816 | hole_size >= num_bytes) { |
| 808 | *start = last_byte; | 817 | *start = last_byte; |
| @@ -1621,6 +1630,7 @@ static int __btrfs_grow_device(struct btrfs_trans_handle *trans, | |||
| 1621 | device->fs_devices->total_rw_bytes += diff; | 1630 | device->fs_devices->total_rw_bytes += diff; |
| 1622 | 1631 | ||
| 1623 | device->total_bytes = new_size; | 1632 | device->total_bytes = new_size; |
| 1633 | device->disk_total_bytes = new_size; | ||
| 1624 | btrfs_clear_space_info_full(device->dev_root->fs_info); | 1634 | btrfs_clear_space_info_full(device->dev_root->fs_info); |
| 1625 | 1635 | ||
| 1626 | return btrfs_update_device(trans, device); | 1636 | return btrfs_update_device(trans, device); |
| @@ -2007,7 +2017,7 @@ int btrfs_shrink_device(struct btrfs_device *device, u64 new_size) | |||
| 2007 | goto done; | 2017 | goto done; |
| 2008 | if (ret) { | 2018 | if (ret) { |
| 2009 | ret = 0; | 2019 | ret = 0; |
| 2010 | goto done; | 2020 | break; |
| 2011 | } | 2021 | } |
| 2012 | 2022 | ||
| 2013 | l = path->nodes[0]; | 2023 | l = path->nodes[0]; |
| @@ -2015,7 +2025,7 @@ int btrfs_shrink_device(struct btrfs_device *device, u64 new_size) | |||
| 2015 | btrfs_item_key_to_cpu(l, &key, path->slots[0]); | 2025 | btrfs_item_key_to_cpu(l, &key, path->slots[0]); |
| 2016 | 2026 | ||
| 2017 | if (key.objectid != device->devid) | 2027 | if (key.objectid != device->devid) |
| 2018 | goto done; | 2028 | break; |
| 2019 | 2029 | ||
| 2020 | dev_extent = btrfs_item_ptr(l, slot, struct btrfs_dev_extent); | 2030 | dev_extent = btrfs_item_ptr(l, slot, struct btrfs_dev_extent); |
| 2021 | length = btrfs_dev_extent_length(l, dev_extent); | 2031 | length = btrfs_dev_extent_length(l, dev_extent); |
| @@ -2171,6 +2181,7 @@ static int __btrfs_alloc_chunk(struct btrfs_trans_handle *trans, | |||
| 2171 | max_chunk_size); | 2181 | max_chunk_size); |
| 2172 | 2182 | ||
| 2173 | again: | 2183 | again: |
| 2184 | max_avail = 0; | ||
| 2174 | if (!map || map->num_stripes != num_stripes) { | 2185 | if (!map || map->num_stripes != num_stripes) { |
| 2175 | kfree(map); | 2186 | kfree(map); |
| 2176 | map = kmalloc(map_lookup_size(num_stripes), GFP_NOFS); | 2187 | map = kmalloc(map_lookup_size(num_stripes), GFP_NOFS); |
| @@ -2219,7 +2230,8 @@ again: | |||
| 2219 | 2230 | ||
| 2220 | if (device->in_fs_metadata && avail >= min_free) { | 2231 | if (device->in_fs_metadata && avail >= min_free) { |
| 2221 | ret = find_free_dev_extent(trans, device, | 2232 | ret = find_free_dev_extent(trans, device, |
| 2222 | min_free, &dev_offset); | 2233 | min_free, &dev_offset, |
| 2234 | &max_avail); | ||
| 2223 | if (ret == 0) { | 2235 | if (ret == 0) { |
| 2224 | list_move_tail(&device->dev_alloc_list, | 2236 | list_move_tail(&device->dev_alloc_list, |
| 2225 | &private_devs); | 2237 | &private_devs); |
| @@ -2795,26 +2807,6 @@ int btrfs_rmap_block(struct btrfs_mapping_tree *map_tree, | |||
| 2795 | } | 2807 | } |
| 2796 | } | 2808 | } |
| 2797 | 2809 | ||
| 2798 | for (i = 0; i > nr; i++) { | ||
| 2799 | struct btrfs_multi_bio *multi; | ||
| 2800 | struct btrfs_bio_stripe *stripe; | ||
| 2801 | int ret; | ||
| 2802 | |||
| 2803 | length = 1; | ||
| 2804 | ret = btrfs_map_block(map_tree, WRITE, buf[i], | ||
| 2805 | &length, &multi, 0); | ||
| 2806 | BUG_ON(ret); | ||
| 2807 | |||
| 2808 | stripe = multi->stripes; | ||
| 2809 | for (j = 0; j < multi->num_stripes; j++) { | ||
| 2810 | if (stripe->physical >= physical && | ||
| 2811 | physical < stripe->physical + length) | ||
| 2812 | break; | ||
| 2813 | } | ||
| 2814 | BUG_ON(j >= multi->num_stripes); | ||
| 2815 | kfree(multi); | ||
| 2816 | } | ||
| 2817 | |||
| 2818 | *logical = buf; | 2810 | *logical = buf; |
| 2819 | *naddrs = nr; | 2811 | *naddrs = nr; |
| 2820 | *stripe_len = map->stripe_len; | 2812 | *stripe_len = map->stripe_len; |
