1c1d7c514SDavid Sterba // SPDX-License-Identifier: GPL-2.0 2a5ed9182SOmar Sandoval /* 3a5ed9182SOmar Sandoval * Copyright (C) 2015 Facebook. All rights reserved. 4a5ed9182SOmar Sandoval */ 5a5ed9182SOmar Sandoval 6a5ed9182SOmar Sandoval #include <linux/kernel.h> 725ff17e8SOmar Sandoval #include <linux/sched/mm.h> 8a5ed9182SOmar Sandoval #include "ctree.h" 9a5ed9182SOmar Sandoval #include "disk-io.h" 10a5ed9182SOmar Sandoval #include "locking.h" 11a5ed9182SOmar Sandoval #include "free-space-tree.h" 12a5ed9182SOmar Sandoval #include "transaction.h" 13a5ed9182SOmar Sandoval 14a5ed9182SOmar Sandoval static int __add_block_group_free_space(struct btrfs_trans_handle *trans, 15a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info, 16a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group, 17a5ed9182SOmar Sandoval struct btrfs_path *path); 18a5ed9182SOmar Sandoval 19a5ed9182SOmar Sandoval void set_free_space_tree_thresholds(struct btrfs_block_group_cache *cache) 20a5ed9182SOmar Sandoval { 21a5ed9182SOmar Sandoval u32 bitmap_range; 22a5ed9182SOmar Sandoval size_t bitmap_size; 23a5ed9182SOmar Sandoval u64 num_bitmaps, total_bitmap_size; 24a5ed9182SOmar Sandoval 25a5ed9182SOmar Sandoval /* 26a5ed9182SOmar Sandoval * We convert to bitmaps when the disk space required for using extents 27a5ed9182SOmar Sandoval * exceeds that required for using bitmaps. 28a5ed9182SOmar Sandoval */ 29da17066cSJeff Mahoney bitmap_range = cache->fs_info->sectorsize * BTRFS_FREE_SPACE_BITMAP_BITS; 30a5ed9182SOmar Sandoval num_bitmaps = div_u64(cache->key.offset + bitmap_range - 1, 31a5ed9182SOmar Sandoval bitmap_range); 32a5ed9182SOmar Sandoval bitmap_size = sizeof(struct btrfs_item) + BTRFS_FREE_SPACE_BITMAP_SIZE; 33a5ed9182SOmar Sandoval total_bitmap_size = num_bitmaps * bitmap_size; 34a5ed9182SOmar Sandoval cache->bitmap_high_thresh = div_u64(total_bitmap_size, 35a5ed9182SOmar Sandoval sizeof(struct btrfs_item)); 36a5ed9182SOmar Sandoval 37a5ed9182SOmar Sandoval /* 38a5ed9182SOmar Sandoval * We allow for a small buffer between the high threshold and low 39a5ed9182SOmar Sandoval * threshold to avoid thrashing back and forth between the two formats. 40a5ed9182SOmar Sandoval */ 41a5ed9182SOmar Sandoval if (cache->bitmap_high_thresh > 100) 42a5ed9182SOmar Sandoval cache->bitmap_low_thresh = cache->bitmap_high_thresh - 100; 43a5ed9182SOmar Sandoval else 44a5ed9182SOmar Sandoval cache->bitmap_low_thresh = 0; 45a5ed9182SOmar Sandoval } 46a5ed9182SOmar Sandoval 47a5ed9182SOmar Sandoval static int add_new_free_space_info(struct btrfs_trans_handle *trans, 48a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info, 49a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group, 50a5ed9182SOmar Sandoval struct btrfs_path *path) 51a5ed9182SOmar Sandoval { 52a5ed9182SOmar Sandoval struct btrfs_root *root = fs_info->free_space_root; 53a5ed9182SOmar Sandoval struct btrfs_free_space_info *info; 54a5ed9182SOmar Sandoval struct btrfs_key key; 55a5ed9182SOmar Sandoval struct extent_buffer *leaf; 56a5ed9182SOmar Sandoval int ret; 57a5ed9182SOmar Sandoval 58a5ed9182SOmar Sandoval key.objectid = block_group->key.objectid; 59a5ed9182SOmar Sandoval key.type = BTRFS_FREE_SPACE_INFO_KEY; 60a5ed9182SOmar Sandoval key.offset = block_group->key.offset; 61a5ed9182SOmar Sandoval 62a5ed9182SOmar Sandoval ret = btrfs_insert_empty_item(trans, root, path, &key, sizeof(*info)); 63a5ed9182SOmar Sandoval if (ret) 64a5ed9182SOmar Sandoval goto out; 65a5ed9182SOmar Sandoval 66a5ed9182SOmar Sandoval leaf = path->nodes[0]; 67a5ed9182SOmar Sandoval info = btrfs_item_ptr(leaf, path->slots[0], 68a5ed9182SOmar Sandoval struct btrfs_free_space_info); 69a5ed9182SOmar Sandoval btrfs_set_free_space_extent_count(leaf, info, 0); 70a5ed9182SOmar Sandoval btrfs_set_free_space_flags(leaf, info, 0); 71a5ed9182SOmar Sandoval btrfs_mark_buffer_dirty(leaf); 72a5ed9182SOmar Sandoval 73a5ed9182SOmar Sandoval ret = 0; 74a5ed9182SOmar Sandoval out: 75a5ed9182SOmar Sandoval btrfs_release_path(path); 76a5ed9182SOmar Sandoval return ret; 77a5ed9182SOmar Sandoval } 78a5ed9182SOmar Sandoval 79a5ed9182SOmar Sandoval struct btrfs_free_space_info * 80a5ed9182SOmar Sandoval search_free_space_info(struct btrfs_trans_handle *trans, 81a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info, 82a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group, 83a5ed9182SOmar Sandoval struct btrfs_path *path, int cow) 84a5ed9182SOmar Sandoval { 85a5ed9182SOmar Sandoval struct btrfs_root *root = fs_info->free_space_root; 86a5ed9182SOmar Sandoval struct btrfs_key key; 87a5ed9182SOmar Sandoval int ret; 88a5ed9182SOmar Sandoval 89a5ed9182SOmar Sandoval key.objectid = block_group->key.objectid; 90a5ed9182SOmar Sandoval key.type = BTRFS_FREE_SPACE_INFO_KEY; 91a5ed9182SOmar Sandoval key.offset = block_group->key.offset; 92a5ed9182SOmar Sandoval 93a5ed9182SOmar Sandoval ret = btrfs_search_slot(trans, root, &key, path, 0, cow); 94a5ed9182SOmar Sandoval if (ret < 0) 95a5ed9182SOmar Sandoval return ERR_PTR(ret); 96a5ed9182SOmar Sandoval if (ret != 0) { 97ab8d0fc4SJeff Mahoney btrfs_warn(fs_info, "missing free space info for %llu", 98a5ed9182SOmar Sandoval block_group->key.objectid); 99a5ed9182SOmar Sandoval ASSERT(0); 100a5ed9182SOmar Sandoval return ERR_PTR(-ENOENT); 101a5ed9182SOmar Sandoval } 102a5ed9182SOmar Sandoval 103a5ed9182SOmar Sandoval return btrfs_item_ptr(path->nodes[0], path->slots[0], 104a5ed9182SOmar Sandoval struct btrfs_free_space_info); 105a5ed9182SOmar Sandoval } 106a5ed9182SOmar Sandoval 107a5ed9182SOmar Sandoval /* 108a5ed9182SOmar Sandoval * btrfs_search_slot() but we're looking for the greatest key less than the 109a5ed9182SOmar Sandoval * passed key. 110a5ed9182SOmar Sandoval */ 111a5ed9182SOmar Sandoval static int btrfs_search_prev_slot(struct btrfs_trans_handle *trans, 112a5ed9182SOmar Sandoval struct btrfs_root *root, 113a5ed9182SOmar Sandoval struct btrfs_key *key, struct btrfs_path *p, 114a5ed9182SOmar Sandoval int ins_len, int cow) 115a5ed9182SOmar Sandoval { 116a5ed9182SOmar Sandoval int ret; 117a5ed9182SOmar Sandoval 118a5ed9182SOmar Sandoval ret = btrfs_search_slot(trans, root, key, p, ins_len, cow); 119a5ed9182SOmar Sandoval if (ret < 0) 120a5ed9182SOmar Sandoval return ret; 121a5ed9182SOmar Sandoval 122a5ed9182SOmar Sandoval if (ret == 0) { 123a5ed9182SOmar Sandoval ASSERT(0); 124a5ed9182SOmar Sandoval return -EIO; 125a5ed9182SOmar Sandoval } 126a5ed9182SOmar Sandoval 127a5ed9182SOmar Sandoval if (p->slots[0] == 0) { 128a5ed9182SOmar Sandoval ASSERT(0); 129a5ed9182SOmar Sandoval return -EIO; 130a5ed9182SOmar Sandoval } 131a5ed9182SOmar Sandoval p->slots[0]--; 132a5ed9182SOmar Sandoval 133a5ed9182SOmar Sandoval return 0; 134a5ed9182SOmar Sandoval } 135a5ed9182SOmar Sandoval 136a5ed9182SOmar Sandoval static inline u32 free_space_bitmap_size(u64 size, u32 sectorsize) 137a5ed9182SOmar Sandoval { 138a5ed9182SOmar Sandoval return DIV_ROUND_UP((u32)div_u64(size, sectorsize), BITS_PER_BYTE); 139a5ed9182SOmar Sandoval } 140a5ed9182SOmar Sandoval 1412fe1d551SOmar Sandoval static u8 *alloc_bitmap(u32 bitmap_size) 142a5ed9182SOmar Sandoval { 14325ff17e8SOmar Sandoval u8 *ret; 14425ff17e8SOmar Sandoval unsigned int nofs_flag; 14579b134a2SDavid Sterba 14679b134a2SDavid Sterba /* 14725ff17e8SOmar Sandoval * GFP_NOFS doesn't work with kvmalloc(), but we really can't recurse 14825ff17e8SOmar Sandoval * into the filesystem as the free space bitmap can be modified in the 14925ff17e8SOmar Sandoval * critical section of a transaction commit. 15025ff17e8SOmar Sandoval * 15125ff17e8SOmar Sandoval * TODO: push the memalloc_nofs_{save,restore}() to the caller where we 15225ff17e8SOmar Sandoval * know that recursion is unsafe. 15379b134a2SDavid Sterba */ 15425ff17e8SOmar Sandoval nofs_flag = memalloc_nofs_save(); 15525ff17e8SOmar Sandoval ret = kvzalloc(bitmap_size, GFP_KERNEL); 15625ff17e8SOmar Sandoval memalloc_nofs_restore(nofs_flag); 15725ff17e8SOmar Sandoval return ret; 158a5ed9182SOmar Sandoval } 159a5ed9182SOmar Sandoval 1606faa8f47SHoward McLauchlan static void le_bitmap_set(u8 *map, unsigned int start, int len) 1616faa8f47SHoward McLauchlan { 1626faa8f47SHoward McLauchlan u8 *p = map + BIT_BYTE(start); 1636faa8f47SHoward McLauchlan const unsigned int size = start + len; 1646faa8f47SHoward McLauchlan int bits_to_set = BITS_PER_BYTE - (start % BITS_PER_BYTE); 1656faa8f47SHoward McLauchlan u8 mask_to_set = BITMAP_FIRST_BYTE_MASK(start); 1666faa8f47SHoward McLauchlan 1676faa8f47SHoward McLauchlan while (len - bits_to_set >= 0) { 1686faa8f47SHoward McLauchlan *p |= mask_to_set; 1696faa8f47SHoward McLauchlan len -= bits_to_set; 1706faa8f47SHoward McLauchlan bits_to_set = BITS_PER_BYTE; 1716faa8f47SHoward McLauchlan mask_to_set = ~0; 1726faa8f47SHoward McLauchlan p++; 1736faa8f47SHoward McLauchlan } 1746faa8f47SHoward McLauchlan if (len) { 1756faa8f47SHoward McLauchlan mask_to_set &= BITMAP_LAST_BYTE_MASK(size); 1766faa8f47SHoward McLauchlan *p |= mask_to_set; 1776faa8f47SHoward McLauchlan } 1786faa8f47SHoward McLauchlan } 1796faa8f47SHoward McLauchlan 180a5ed9182SOmar Sandoval int convert_free_space_to_bitmaps(struct btrfs_trans_handle *trans, 181a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info, 182a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group, 183a5ed9182SOmar Sandoval struct btrfs_path *path) 184a5ed9182SOmar Sandoval { 185a5ed9182SOmar Sandoval struct btrfs_root *root = fs_info->free_space_root; 186a5ed9182SOmar Sandoval struct btrfs_free_space_info *info; 187a5ed9182SOmar Sandoval struct btrfs_key key, found_key; 188a5ed9182SOmar Sandoval struct extent_buffer *leaf; 1892fe1d551SOmar Sandoval u8 *bitmap, *bitmap_cursor; 190a5ed9182SOmar Sandoval u64 start, end; 191a5ed9182SOmar Sandoval u64 bitmap_range, i; 192a5ed9182SOmar Sandoval u32 bitmap_size, flags, expected_extent_count; 193a5ed9182SOmar Sandoval u32 extent_count = 0; 194a5ed9182SOmar Sandoval int done = 0, nr; 195a5ed9182SOmar Sandoval int ret; 196a5ed9182SOmar Sandoval 197a5ed9182SOmar Sandoval bitmap_size = free_space_bitmap_size(block_group->key.offset, 1980b246afaSJeff Mahoney fs_info->sectorsize); 199a5ed9182SOmar Sandoval bitmap = alloc_bitmap(bitmap_size); 200a5ed9182SOmar Sandoval if (!bitmap) { 201a5ed9182SOmar Sandoval ret = -ENOMEM; 202a5ed9182SOmar Sandoval goto out; 203a5ed9182SOmar Sandoval } 204a5ed9182SOmar Sandoval 205a5ed9182SOmar Sandoval start = block_group->key.objectid; 206a5ed9182SOmar Sandoval end = block_group->key.objectid + block_group->key.offset; 207a5ed9182SOmar Sandoval 208a5ed9182SOmar Sandoval key.objectid = end - 1; 209a5ed9182SOmar Sandoval key.type = (u8)-1; 210a5ed9182SOmar Sandoval key.offset = (u64)-1; 211a5ed9182SOmar Sandoval 212a5ed9182SOmar Sandoval while (!done) { 213a5ed9182SOmar Sandoval ret = btrfs_search_prev_slot(trans, root, &key, path, -1, 1); 214a5ed9182SOmar Sandoval if (ret) 215a5ed9182SOmar Sandoval goto out; 216a5ed9182SOmar Sandoval 217a5ed9182SOmar Sandoval leaf = path->nodes[0]; 218a5ed9182SOmar Sandoval nr = 0; 219a5ed9182SOmar Sandoval path->slots[0]++; 220a5ed9182SOmar Sandoval while (path->slots[0] > 0) { 221a5ed9182SOmar Sandoval btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0] - 1); 222a5ed9182SOmar Sandoval 223a5ed9182SOmar Sandoval if (found_key.type == BTRFS_FREE_SPACE_INFO_KEY) { 224a5ed9182SOmar Sandoval ASSERT(found_key.objectid == block_group->key.objectid); 225a5ed9182SOmar Sandoval ASSERT(found_key.offset == block_group->key.offset); 226a5ed9182SOmar Sandoval done = 1; 227a5ed9182SOmar Sandoval break; 228a5ed9182SOmar Sandoval } else if (found_key.type == BTRFS_FREE_SPACE_EXTENT_KEY) { 229a5ed9182SOmar Sandoval u64 first, last; 230a5ed9182SOmar Sandoval 231a5ed9182SOmar Sandoval ASSERT(found_key.objectid >= start); 232a5ed9182SOmar Sandoval ASSERT(found_key.objectid < end); 233a5ed9182SOmar Sandoval ASSERT(found_key.objectid + found_key.offset <= end); 234a5ed9182SOmar Sandoval 235a5ed9182SOmar Sandoval first = div_u64(found_key.objectid - start, 2360b246afaSJeff Mahoney fs_info->sectorsize); 237a5ed9182SOmar Sandoval last = div_u64(found_key.objectid + found_key.offset - start, 2380b246afaSJeff Mahoney fs_info->sectorsize); 2392fe1d551SOmar Sandoval le_bitmap_set(bitmap, first, last - first); 240a5ed9182SOmar Sandoval 241a5ed9182SOmar Sandoval extent_count++; 242a5ed9182SOmar Sandoval nr++; 243a5ed9182SOmar Sandoval path->slots[0]--; 244a5ed9182SOmar Sandoval } else { 245a5ed9182SOmar Sandoval ASSERT(0); 246a5ed9182SOmar Sandoval } 247a5ed9182SOmar Sandoval } 248a5ed9182SOmar Sandoval 249a5ed9182SOmar Sandoval ret = btrfs_del_items(trans, root, path, path->slots[0], nr); 250a5ed9182SOmar Sandoval if (ret) 251a5ed9182SOmar Sandoval goto out; 252a5ed9182SOmar Sandoval btrfs_release_path(path); 253a5ed9182SOmar Sandoval } 254a5ed9182SOmar Sandoval 255a5ed9182SOmar Sandoval info = search_free_space_info(trans, fs_info, block_group, path, 1); 256a5ed9182SOmar Sandoval if (IS_ERR(info)) { 257a5ed9182SOmar Sandoval ret = PTR_ERR(info); 258a5ed9182SOmar Sandoval goto out; 259a5ed9182SOmar Sandoval } 260a5ed9182SOmar Sandoval leaf = path->nodes[0]; 261a5ed9182SOmar Sandoval flags = btrfs_free_space_flags(leaf, info); 262a5ed9182SOmar Sandoval flags |= BTRFS_FREE_SPACE_USING_BITMAPS; 263a5ed9182SOmar Sandoval btrfs_set_free_space_flags(leaf, info, flags); 264a5ed9182SOmar Sandoval expected_extent_count = btrfs_free_space_extent_count(leaf, info); 265a5ed9182SOmar Sandoval btrfs_mark_buffer_dirty(leaf); 266a5ed9182SOmar Sandoval btrfs_release_path(path); 267a5ed9182SOmar Sandoval 268a5ed9182SOmar Sandoval if (extent_count != expected_extent_count) { 2695d163e0eSJeff Mahoney btrfs_err(fs_info, 2705d163e0eSJeff Mahoney "incorrect extent count for %llu; counted %u, expected %u", 271a5ed9182SOmar Sandoval block_group->key.objectid, extent_count, 272a5ed9182SOmar Sandoval expected_extent_count); 273a5ed9182SOmar Sandoval ASSERT(0); 274a5ed9182SOmar Sandoval ret = -EIO; 275a5ed9182SOmar Sandoval goto out; 276a5ed9182SOmar Sandoval } 277a5ed9182SOmar Sandoval 2782fe1d551SOmar Sandoval bitmap_cursor = bitmap; 2790b246afaSJeff Mahoney bitmap_range = fs_info->sectorsize * BTRFS_FREE_SPACE_BITMAP_BITS; 280a5ed9182SOmar Sandoval i = start; 281a5ed9182SOmar Sandoval while (i < end) { 282a5ed9182SOmar Sandoval unsigned long ptr; 283a5ed9182SOmar Sandoval u64 extent_size; 284a5ed9182SOmar Sandoval u32 data_size; 285a5ed9182SOmar Sandoval 286a5ed9182SOmar Sandoval extent_size = min(end - i, bitmap_range); 287a5ed9182SOmar Sandoval data_size = free_space_bitmap_size(extent_size, 2880b246afaSJeff Mahoney fs_info->sectorsize); 289a5ed9182SOmar Sandoval 290a5ed9182SOmar Sandoval key.objectid = i; 291a5ed9182SOmar Sandoval key.type = BTRFS_FREE_SPACE_BITMAP_KEY; 292a5ed9182SOmar Sandoval key.offset = extent_size; 293a5ed9182SOmar Sandoval 294a5ed9182SOmar Sandoval ret = btrfs_insert_empty_item(trans, root, path, &key, 295a5ed9182SOmar Sandoval data_size); 296a5ed9182SOmar Sandoval if (ret) 297a5ed9182SOmar Sandoval goto out; 298a5ed9182SOmar Sandoval 299a5ed9182SOmar Sandoval leaf = path->nodes[0]; 300a5ed9182SOmar Sandoval ptr = btrfs_item_ptr_offset(leaf, path->slots[0]); 301a5ed9182SOmar Sandoval write_extent_buffer(leaf, bitmap_cursor, ptr, 302a5ed9182SOmar Sandoval data_size); 303a5ed9182SOmar Sandoval btrfs_mark_buffer_dirty(leaf); 304a5ed9182SOmar Sandoval btrfs_release_path(path); 305a5ed9182SOmar Sandoval 306a5ed9182SOmar Sandoval i += extent_size; 307a5ed9182SOmar Sandoval bitmap_cursor += data_size; 308a5ed9182SOmar Sandoval } 309a5ed9182SOmar Sandoval 310a5ed9182SOmar Sandoval ret = 0; 311a5ed9182SOmar Sandoval out: 31279b134a2SDavid Sterba kvfree(bitmap); 313a5ed9182SOmar Sandoval if (ret) 31466642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 315a5ed9182SOmar Sandoval return ret; 316a5ed9182SOmar Sandoval } 317a5ed9182SOmar Sandoval 318a5ed9182SOmar Sandoval int convert_free_space_to_extents(struct btrfs_trans_handle *trans, 319a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info, 320a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group, 321a5ed9182SOmar Sandoval struct btrfs_path *path) 322a5ed9182SOmar Sandoval { 323a5ed9182SOmar Sandoval struct btrfs_root *root = fs_info->free_space_root; 324a5ed9182SOmar Sandoval struct btrfs_free_space_info *info; 325a5ed9182SOmar Sandoval struct btrfs_key key, found_key; 326a5ed9182SOmar Sandoval struct extent_buffer *leaf; 3272fe1d551SOmar Sandoval u8 *bitmap; 328a5ed9182SOmar Sandoval u64 start, end; 329a5ed9182SOmar Sandoval /* Initialize to silence GCC. */ 330a5ed9182SOmar Sandoval u64 extent_start = 0; 331a5ed9182SOmar Sandoval u64 offset; 332a5ed9182SOmar Sandoval u32 bitmap_size, flags, expected_extent_count; 333a5ed9182SOmar Sandoval int prev_bit = 0, bit, bitnr; 334a5ed9182SOmar Sandoval u32 extent_count = 0; 335a5ed9182SOmar Sandoval int done = 0, nr; 336a5ed9182SOmar Sandoval int ret; 337a5ed9182SOmar Sandoval 338a5ed9182SOmar Sandoval bitmap_size = free_space_bitmap_size(block_group->key.offset, 3390b246afaSJeff Mahoney fs_info->sectorsize); 340a5ed9182SOmar Sandoval bitmap = alloc_bitmap(bitmap_size); 341a5ed9182SOmar Sandoval if (!bitmap) { 342a5ed9182SOmar Sandoval ret = -ENOMEM; 343a5ed9182SOmar Sandoval goto out; 344a5ed9182SOmar Sandoval } 345a5ed9182SOmar Sandoval 346a5ed9182SOmar Sandoval start = block_group->key.objectid; 347a5ed9182SOmar Sandoval end = block_group->key.objectid + block_group->key.offset; 348a5ed9182SOmar Sandoval 349a5ed9182SOmar Sandoval key.objectid = end - 1; 350a5ed9182SOmar Sandoval key.type = (u8)-1; 351a5ed9182SOmar Sandoval key.offset = (u64)-1; 352a5ed9182SOmar Sandoval 353a5ed9182SOmar Sandoval while (!done) { 354a5ed9182SOmar Sandoval ret = btrfs_search_prev_slot(trans, root, &key, path, -1, 1); 355a5ed9182SOmar Sandoval if (ret) 356a5ed9182SOmar Sandoval goto out; 357a5ed9182SOmar Sandoval 358a5ed9182SOmar Sandoval leaf = path->nodes[0]; 359a5ed9182SOmar Sandoval nr = 0; 360a5ed9182SOmar Sandoval path->slots[0]++; 361a5ed9182SOmar Sandoval while (path->slots[0] > 0) { 362a5ed9182SOmar Sandoval btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0] - 1); 363a5ed9182SOmar Sandoval 364a5ed9182SOmar Sandoval if (found_key.type == BTRFS_FREE_SPACE_INFO_KEY) { 365a5ed9182SOmar Sandoval ASSERT(found_key.objectid == block_group->key.objectid); 366a5ed9182SOmar Sandoval ASSERT(found_key.offset == block_group->key.offset); 367a5ed9182SOmar Sandoval done = 1; 368a5ed9182SOmar Sandoval break; 369a5ed9182SOmar Sandoval } else if (found_key.type == BTRFS_FREE_SPACE_BITMAP_KEY) { 370a5ed9182SOmar Sandoval unsigned long ptr; 3712fe1d551SOmar Sandoval u8 *bitmap_cursor; 372a5ed9182SOmar Sandoval u32 bitmap_pos, data_size; 373a5ed9182SOmar Sandoval 374a5ed9182SOmar Sandoval ASSERT(found_key.objectid >= start); 375a5ed9182SOmar Sandoval ASSERT(found_key.objectid < end); 376a5ed9182SOmar Sandoval ASSERT(found_key.objectid + found_key.offset <= end); 377a5ed9182SOmar Sandoval 378a5ed9182SOmar Sandoval bitmap_pos = div_u64(found_key.objectid - start, 3790b246afaSJeff Mahoney fs_info->sectorsize * 380a5ed9182SOmar Sandoval BITS_PER_BYTE); 3812fe1d551SOmar Sandoval bitmap_cursor = bitmap + bitmap_pos; 382a5ed9182SOmar Sandoval data_size = free_space_bitmap_size(found_key.offset, 3830b246afaSJeff Mahoney fs_info->sectorsize); 384a5ed9182SOmar Sandoval 385a5ed9182SOmar Sandoval ptr = btrfs_item_ptr_offset(leaf, path->slots[0] - 1); 386a5ed9182SOmar Sandoval read_extent_buffer(leaf, bitmap_cursor, ptr, 387a5ed9182SOmar Sandoval data_size); 388a5ed9182SOmar Sandoval 389a5ed9182SOmar Sandoval nr++; 390a5ed9182SOmar Sandoval path->slots[0]--; 391a5ed9182SOmar Sandoval } else { 392a5ed9182SOmar Sandoval ASSERT(0); 393a5ed9182SOmar Sandoval } 394a5ed9182SOmar Sandoval } 395a5ed9182SOmar Sandoval 396a5ed9182SOmar Sandoval ret = btrfs_del_items(trans, root, path, path->slots[0], nr); 397a5ed9182SOmar Sandoval if (ret) 398a5ed9182SOmar Sandoval goto out; 399a5ed9182SOmar Sandoval btrfs_release_path(path); 400a5ed9182SOmar Sandoval } 401a5ed9182SOmar Sandoval 402a5ed9182SOmar Sandoval info = search_free_space_info(trans, fs_info, block_group, path, 1); 403a5ed9182SOmar Sandoval if (IS_ERR(info)) { 404a5ed9182SOmar Sandoval ret = PTR_ERR(info); 405a5ed9182SOmar Sandoval goto out; 406a5ed9182SOmar Sandoval } 407a5ed9182SOmar Sandoval leaf = path->nodes[0]; 408a5ed9182SOmar Sandoval flags = btrfs_free_space_flags(leaf, info); 409a5ed9182SOmar Sandoval flags &= ~BTRFS_FREE_SPACE_USING_BITMAPS; 410a5ed9182SOmar Sandoval btrfs_set_free_space_flags(leaf, info, flags); 411a5ed9182SOmar Sandoval expected_extent_count = btrfs_free_space_extent_count(leaf, info); 412a5ed9182SOmar Sandoval btrfs_mark_buffer_dirty(leaf); 413a5ed9182SOmar Sandoval btrfs_release_path(path); 414a5ed9182SOmar Sandoval 415a5ed9182SOmar Sandoval offset = start; 416a5ed9182SOmar Sandoval bitnr = 0; 417a5ed9182SOmar Sandoval while (offset < end) { 4182fe1d551SOmar Sandoval bit = !!le_test_bit(bitnr, bitmap); 419a5ed9182SOmar Sandoval if (prev_bit == 0 && bit == 1) { 420a5ed9182SOmar Sandoval extent_start = offset; 421a5ed9182SOmar Sandoval } else if (prev_bit == 1 && bit == 0) { 422a5ed9182SOmar Sandoval key.objectid = extent_start; 423a5ed9182SOmar Sandoval key.type = BTRFS_FREE_SPACE_EXTENT_KEY; 424a5ed9182SOmar Sandoval key.offset = offset - extent_start; 425a5ed9182SOmar Sandoval 426a5ed9182SOmar Sandoval ret = btrfs_insert_empty_item(trans, root, path, &key, 0); 427a5ed9182SOmar Sandoval if (ret) 428a5ed9182SOmar Sandoval goto out; 429a5ed9182SOmar Sandoval btrfs_release_path(path); 430a5ed9182SOmar Sandoval 431a5ed9182SOmar Sandoval extent_count++; 432a5ed9182SOmar Sandoval } 433a5ed9182SOmar Sandoval prev_bit = bit; 4340b246afaSJeff Mahoney offset += fs_info->sectorsize; 435a5ed9182SOmar Sandoval bitnr++; 436a5ed9182SOmar Sandoval } 437a5ed9182SOmar Sandoval if (prev_bit == 1) { 438a5ed9182SOmar Sandoval key.objectid = extent_start; 439a5ed9182SOmar Sandoval key.type = BTRFS_FREE_SPACE_EXTENT_KEY; 440a5ed9182SOmar Sandoval key.offset = end - extent_start; 441a5ed9182SOmar Sandoval 442a5ed9182SOmar Sandoval ret = btrfs_insert_empty_item(trans, root, path, &key, 0); 443a5ed9182SOmar Sandoval if (ret) 444a5ed9182SOmar Sandoval goto out; 445a5ed9182SOmar Sandoval btrfs_release_path(path); 446a5ed9182SOmar Sandoval 447a5ed9182SOmar Sandoval extent_count++; 448a5ed9182SOmar Sandoval } 449a5ed9182SOmar Sandoval 450a5ed9182SOmar Sandoval if (extent_count != expected_extent_count) { 4515d163e0eSJeff Mahoney btrfs_err(fs_info, 4525d163e0eSJeff Mahoney "incorrect extent count for %llu; counted %u, expected %u", 453a5ed9182SOmar Sandoval block_group->key.objectid, extent_count, 454a5ed9182SOmar Sandoval expected_extent_count); 455a5ed9182SOmar Sandoval ASSERT(0); 456a5ed9182SOmar Sandoval ret = -EIO; 457a5ed9182SOmar Sandoval goto out; 458a5ed9182SOmar Sandoval } 459a5ed9182SOmar Sandoval 460a5ed9182SOmar Sandoval ret = 0; 461a5ed9182SOmar Sandoval out: 46279b134a2SDavid Sterba kvfree(bitmap); 463a5ed9182SOmar Sandoval if (ret) 46466642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 465a5ed9182SOmar Sandoval return ret; 466a5ed9182SOmar Sandoval } 467a5ed9182SOmar Sandoval 468a5ed9182SOmar Sandoval static int update_free_space_extent_count(struct btrfs_trans_handle *trans, 469a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info, 470a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group, 471a5ed9182SOmar Sandoval struct btrfs_path *path, 472a5ed9182SOmar Sandoval int new_extents) 473a5ed9182SOmar Sandoval { 474a5ed9182SOmar Sandoval struct btrfs_free_space_info *info; 475a5ed9182SOmar Sandoval u32 flags; 476a5ed9182SOmar Sandoval u32 extent_count; 477a5ed9182SOmar Sandoval int ret = 0; 478a5ed9182SOmar Sandoval 479a5ed9182SOmar Sandoval if (new_extents == 0) 480a5ed9182SOmar Sandoval return 0; 481a5ed9182SOmar Sandoval 482a5ed9182SOmar Sandoval info = search_free_space_info(trans, fs_info, block_group, path, 1); 483a5ed9182SOmar Sandoval if (IS_ERR(info)) { 484a5ed9182SOmar Sandoval ret = PTR_ERR(info); 485a5ed9182SOmar Sandoval goto out; 486a5ed9182SOmar Sandoval } 487a5ed9182SOmar Sandoval flags = btrfs_free_space_flags(path->nodes[0], info); 488a5ed9182SOmar Sandoval extent_count = btrfs_free_space_extent_count(path->nodes[0], info); 489a5ed9182SOmar Sandoval 490a5ed9182SOmar Sandoval extent_count += new_extents; 491a5ed9182SOmar Sandoval btrfs_set_free_space_extent_count(path->nodes[0], info, extent_count); 492a5ed9182SOmar Sandoval btrfs_mark_buffer_dirty(path->nodes[0]); 493a5ed9182SOmar Sandoval btrfs_release_path(path); 494a5ed9182SOmar Sandoval 495a5ed9182SOmar Sandoval if (!(flags & BTRFS_FREE_SPACE_USING_BITMAPS) && 496a5ed9182SOmar Sandoval extent_count > block_group->bitmap_high_thresh) { 497a5ed9182SOmar Sandoval ret = convert_free_space_to_bitmaps(trans, fs_info, block_group, 498a5ed9182SOmar Sandoval path); 499a5ed9182SOmar Sandoval } else if ((flags & BTRFS_FREE_SPACE_USING_BITMAPS) && 500a5ed9182SOmar Sandoval extent_count < block_group->bitmap_low_thresh) { 501a5ed9182SOmar Sandoval ret = convert_free_space_to_extents(trans, fs_info, block_group, 502a5ed9182SOmar Sandoval path); 503a5ed9182SOmar Sandoval } 504a5ed9182SOmar Sandoval 505a5ed9182SOmar Sandoval out: 506a5ed9182SOmar Sandoval return ret; 507a5ed9182SOmar Sandoval } 508a5ed9182SOmar Sandoval 509a5ed9182SOmar Sandoval int free_space_test_bit(struct btrfs_block_group_cache *block_group, 510a5ed9182SOmar Sandoval struct btrfs_path *path, u64 offset) 511a5ed9182SOmar Sandoval { 512a5ed9182SOmar Sandoval struct extent_buffer *leaf; 513a5ed9182SOmar Sandoval struct btrfs_key key; 514a5ed9182SOmar Sandoval u64 found_start, found_end; 515a5ed9182SOmar Sandoval unsigned long ptr, i; 516a5ed9182SOmar Sandoval 517a5ed9182SOmar Sandoval leaf = path->nodes[0]; 518a5ed9182SOmar Sandoval btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 519a5ed9182SOmar Sandoval ASSERT(key.type == BTRFS_FREE_SPACE_BITMAP_KEY); 520a5ed9182SOmar Sandoval 521a5ed9182SOmar Sandoval found_start = key.objectid; 522a5ed9182SOmar Sandoval found_end = key.objectid + key.offset; 523a5ed9182SOmar Sandoval ASSERT(offset >= found_start && offset < found_end); 524a5ed9182SOmar Sandoval 525a5ed9182SOmar Sandoval ptr = btrfs_item_ptr_offset(leaf, path->slots[0]); 526da17066cSJeff Mahoney i = div_u64(offset - found_start, 527da17066cSJeff Mahoney block_group->fs_info->sectorsize); 528a5ed9182SOmar Sandoval return !!extent_buffer_test_bit(leaf, ptr, i); 529a5ed9182SOmar Sandoval } 530a5ed9182SOmar Sandoval 531a5ed9182SOmar Sandoval static void free_space_set_bits(struct btrfs_block_group_cache *block_group, 532a5ed9182SOmar Sandoval struct btrfs_path *path, u64 *start, u64 *size, 533a5ed9182SOmar Sandoval int bit) 534a5ed9182SOmar Sandoval { 5350b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = block_group->fs_info; 536a5ed9182SOmar Sandoval struct extent_buffer *leaf; 537a5ed9182SOmar Sandoval struct btrfs_key key; 538a5ed9182SOmar Sandoval u64 end = *start + *size; 539a5ed9182SOmar Sandoval u64 found_start, found_end; 540a5ed9182SOmar Sandoval unsigned long ptr, first, last; 541a5ed9182SOmar Sandoval 542a5ed9182SOmar Sandoval leaf = path->nodes[0]; 543a5ed9182SOmar Sandoval btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 544a5ed9182SOmar Sandoval ASSERT(key.type == BTRFS_FREE_SPACE_BITMAP_KEY); 545a5ed9182SOmar Sandoval 546a5ed9182SOmar Sandoval found_start = key.objectid; 547a5ed9182SOmar Sandoval found_end = key.objectid + key.offset; 548a5ed9182SOmar Sandoval ASSERT(*start >= found_start && *start < found_end); 549a5ed9182SOmar Sandoval ASSERT(end > found_start); 550a5ed9182SOmar Sandoval 551a5ed9182SOmar Sandoval if (end > found_end) 552a5ed9182SOmar Sandoval end = found_end; 553a5ed9182SOmar Sandoval 554a5ed9182SOmar Sandoval ptr = btrfs_item_ptr_offset(leaf, path->slots[0]); 5550b246afaSJeff Mahoney first = div_u64(*start - found_start, fs_info->sectorsize); 5560b246afaSJeff Mahoney last = div_u64(end - found_start, fs_info->sectorsize); 557a5ed9182SOmar Sandoval if (bit) 558a5ed9182SOmar Sandoval extent_buffer_bitmap_set(leaf, ptr, first, last - first); 559a5ed9182SOmar Sandoval else 560a5ed9182SOmar Sandoval extent_buffer_bitmap_clear(leaf, ptr, first, last - first); 561a5ed9182SOmar Sandoval btrfs_mark_buffer_dirty(leaf); 562a5ed9182SOmar Sandoval 563a5ed9182SOmar Sandoval *size -= end - *start; 564a5ed9182SOmar Sandoval *start = end; 565a5ed9182SOmar Sandoval } 566a5ed9182SOmar Sandoval 567a5ed9182SOmar Sandoval /* 568a5ed9182SOmar Sandoval * We can't use btrfs_next_item() in modify_free_space_bitmap() because 569a5ed9182SOmar Sandoval * btrfs_next_leaf() doesn't get the path for writing. We can forgo the fancy 570a5ed9182SOmar Sandoval * tree walking in btrfs_next_leaf() anyways because we know exactly what we're 571a5ed9182SOmar Sandoval * looking for. 572a5ed9182SOmar Sandoval */ 573a5ed9182SOmar Sandoval static int free_space_next_bitmap(struct btrfs_trans_handle *trans, 574a5ed9182SOmar Sandoval struct btrfs_root *root, struct btrfs_path *p) 575a5ed9182SOmar Sandoval { 576a5ed9182SOmar Sandoval struct btrfs_key key; 577a5ed9182SOmar Sandoval 578a5ed9182SOmar Sandoval if (p->slots[0] + 1 < btrfs_header_nritems(p->nodes[0])) { 579a5ed9182SOmar Sandoval p->slots[0]++; 580a5ed9182SOmar Sandoval return 0; 581a5ed9182SOmar Sandoval } 582a5ed9182SOmar Sandoval 583a5ed9182SOmar Sandoval btrfs_item_key_to_cpu(p->nodes[0], &key, p->slots[0]); 584a5ed9182SOmar Sandoval btrfs_release_path(p); 585a5ed9182SOmar Sandoval 586a5ed9182SOmar Sandoval key.objectid += key.offset; 587a5ed9182SOmar Sandoval key.type = (u8)-1; 588a5ed9182SOmar Sandoval key.offset = (u64)-1; 589a5ed9182SOmar Sandoval 590a5ed9182SOmar Sandoval return btrfs_search_prev_slot(trans, root, &key, p, 0, 1); 591a5ed9182SOmar Sandoval } 592a5ed9182SOmar Sandoval 593a5ed9182SOmar Sandoval /* 594a5ed9182SOmar Sandoval * If remove is 1, then we are removing free space, thus clearing bits in the 595a5ed9182SOmar Sandoval * bitmap. If remove is 0, then we are adding free space, thus setting bits in 596a5ed9182SOmar Sandoval * the bitmap. 597a5ed9182SOmar Sandoval */ 598a5ed9182SOmar Sandoval static int modify_free_space_bitmap(struct btrfs_trans_handle *trans, 599a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info, 600a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group, 601a5ed9182SOmar Sandoval struct btrfs_path *path, 602a5ed9182SOmar Sandoval u64 start, u64 size, int remove) 603a5ed9182SOmar Sandoval { 604a5ed9182SOmar Sandoval struct btrfs_root *root = fs_info->free_space_root; 605a5ed9182SOmar Sandoval struct btrfs_key key; 606a5ed9182SOmar Sandoval u64 end = start + size; 607a5ed9182SOmar Sandoval u64 cur_start, cur_size; 608a5ed9182SOmar Sandoval int prev_bit, next_bit; 609a5ed9182SOmar Sandoval int new_extents; 610a5ed9182SOmar Sandoval int ret; 611a5ed9182SOmar Sandoval 612a5ed9182SOmar Sandoval /* 613a5ed9182SOmar Sandoval * Read the bit for the block immediately before the extent of space if 614a5ed9182SOmar Sandoval * that block is within the block group. 615a5ed9182SOmar Sandoval */ 616a5ed9182SOmar Sandoval if (start > block_group->key.objectid) { 617da17066cSJeff Mahoney u64 prev_block = start - block_group->fs_info->sectorsize; 618a5ed9182SOmar Sandoval 619a5ed9182SOmar Sandoval key.objectid = prev_block; 620a5ed9182SOmar Sandoval key.type = (u8)-1; 621a5ed9182SOmar Sandoval key.offset = (u64)-1; 622a5ed9182SOmar Sandoval 623a5ed9182SOmar Sandoval ret = btrfs_search_prev_slot(trans, root, &key, path, 0, 1); 624a5ed9182SOmar Sandoval if (ret) 625a5ed9182SOmar Sandoval goto out; 626a5ed9182SOmar Sandoval 627a5ed9182SOmar Sandoval prev_bit = free_space_test_bit(block_group, path, prev_block); 628a5ed9182SOmar Sandoval 629a5ed9182SOmar Sandoval /* The previous block may have been in the previous bitmap. */ 630a5ed9182SOmar Sandoval btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 631a5ed9182SOmar Sandoval if (start >= key.objectid + key.offset) { 632a5ed9182SOmar Sandoval ret = free_space_next_bitmap(trans, root, path); 633a5ed9182SOmar Sandoval if (ret) 634a5ed9182SOmar Sandoval goto out; 635a5ed9182SOmar Sandoval } 636a5ed9182SOmar Sandoval } else { 637a5ed9182SOmar Sandoval key.objectid = start; 638a5ed9182SOmar Sandoval key.type = (u8)-1; 639a5ed9182SOmar Sandoval key.offset = (u64)-1; 640a5ed9182SOmar Sandoval 641a5ed9182SOmar Sandoval ret = btrfs_search_prev_slot(trans, root, &key, path, 0, 1); 642a5ed9182SOmar Sandoval if (ret) 643a5ed9182SOmar Sandoval goto out; 644a5ed9182SOmar Sandoval 645a5ed9182SOmar Sandoval prev_bit = -1; 646a5ed9182SOmar Sandoval } 647a5ed9182SOmar Sandoval 648a5ed9182SOmar Sandoval /* 649a5ed9182SOmar Sandoval * Iterate over all of the bitmaps overlapped by the extent of space, 650a5ed9182SOmar Sandoval * clearing/setting bits as required. 651a5ed9182SOmar Sandoval */ 652a5ed9182SOmar Sandoval cur_start = start; 653a5ed9182SOmar Sandoval cur_size = size; 654a5ed9182SOmar Sandoval while (1) { 655a5ed9182SOmar Sandoval free_space_set_bits(block_group, path, &cur_start, &cur_size, 656a5ed9182SOmar Sandoval !remove); 657a5ed9182SOmar Sandoval if (cur_size == 0) 658a5ed9182SOmar Sandoval break; 659a5ed9182SOmar Sandoval ret = free_space_next_bitmap(trans, root, path); 660a5ed9182SOmar Sandoval if (ret) 661a5ed9182SOmar Sandoval goto out; 662a5ed9182SOmar Sandoval } 663a5ed9182SOmar Sandoval 664a5ed9182SOmar Sandoval /* 665a5ed9182SOmar Sandoval * Read the bit for the block immediately after the extent of space if 666a5ed9182SOmar Sandoval * that block is within the block group. 667a5ed9182SOmar Sandoval */ 668a5ed9182SOmar Sandoval if (end < block_group->key.objectid + block_group->key.offset) { 669a5ed9182SOmar Sandoval /* The next block may be in the next bitmap. */ 670a5ed9182SOmar Sandoval btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 671a5ed9182SOmar Sandoval if (end >= key.objectid + key.offset) { 672a5ed9182SOmar Sandoval ret = free_space_next_bitmap(trans, root, path); 673a5ed9182SOmar Sandoval if (ret) 674a5ed9182SOmar Sandoval goto out; 675a5ed9182SOmar Sandoval } 676a5ed9182SOmar Sandoval 677a5ed9182SOmar Sandoval next_bit = free_space_test_bit(block_group, path, end); 678a5ed9182SOmar Sandoval } else { 679a5ed9182SOmar Sandoval next_bit = -1; 680a5ed9182SOmar Sandoval } 681a5ed9182SOmar Sandoval 682a5ed9182SOmar Sandoval if (remove) { 683a5ed9182SOmar Sandoval new_extents = -1; 684a5ed9182SOmar Sandoval if (prev_bit == 1) { 685a5ed9182SOmar Sandoval /* Leftover on the left. */ 686a5ed9182SOmar Sandoval new_extents++; 687a5ed9182SOmar Sandoval } 688a5ed9182SOmar Sandoval if (next_bit == 1) { 689a5ed9182SOmar Sandoval /* Leftover on the right. */ 690a5ed9182SOmar Sandoval new_extents++; 691a5ed9182SOmar Sandoval } 692a5ed9182SOmar Sandoval } else { 693a5ed9182SOmar Sandoval new_extents = 1; 694a5ed9182SOmar Sandoval if (prev_bit == 1) { 695a5ed9182SOmar Sandoval /* Merging with neighbor on the left. */ 696a5ed9182SOmar Sandoval new_extents--; 697a5ed9182SOmar Sandoval } 698a5ed9182SOmar Sandoval if (next_bit == 1) { 699a5ed9182SOmar Sandoval /* Merging with neighbor on the right. */ 700a5ed9182SOmar Sandoval new_extents--; 701a5ed9182SOmar Sandoval } 702a5ed9182SOmar Sandoval } 703a5ed9182SOmar Sandoval 704a5ed9182SOmar Sandoval btrfs_release_path(path); 705a5ed9182SOmar Sandoval ret = update_free_space_extent_count(trans, fs_info, block_group, path, 706a5ed9182SOmar Sandoval new_extents); 707a5ed9182SOmar Sandoval 708a5ed9182SOmar Sandoval out: 709a5ed9182SOmar Sandoval return ret; 710a5ed9182SOmar Sandoval } 711a5ed9182SOmar Sandoval 712a5ed9182SOmar Sandoval static int remove_free_space_extent(struct btrfs_trans_handle *trans, 713a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info, 714a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group, 715a5ed9182SOmar Sandoval struct btrfs_path *path, 716a5ed9182SOmar Sandoval u64 start, u64 size) 717a5ed9182SOmar Sandoval { 718a5ed9182SOmar Sandoval struct btrfs_root *root = fs_info->free_space_root; 719a5ed9182SOmar Sandoval struct btrfs_key key; 720a5ed9182SOmar Sandoval u64 found_start, found_end; 721a5ed9182SOmar Sandoval u64 end = start + size; 722a5ed9182SOmar Sandoval int new_extents = -1; 723a5ed9182SOmar Sandoval int ret; 724a5ed9182SOmar Sandoval 725a5ed9182SOmar Sandoval key.objectid = start; 726a5ed9182SOmar Sandoval key.type = (u8)-1; 727a5ed9182SOmar Sandoval key.offset = (u64)-1; 728a5ed9182SOmar Sandoval 729a5ed9182SOmar Sandoval ret = btrfs_search_prev_slot(trans, root, &key, path, -1, 1); 730a5ed9182SOmar Sandoval if (ret) 731a5ed9182SOmar Sandoval goto out; 732a5ed9182SOmar Sandoval 733a5ed9182SOmar Sandoval btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 734a5ed9182SOmar Sandoval 735a5ed9182SOmar Sandoval ASSERT(key.type == BTRFS_FREE_SPACE_EXTENT_KEY); 736a5ed9182SOmar Sandoval 737a5ed9182SOmar Sandoval found_start = key.objectid; 738a5ed9182SOmar Sandoval found_end = key.objectid + key.offset; 739a5ed9182SOmar Sandoval ASSERT(start >= found_start && end <= found_end); 740a5ed9182SOmar Sandoval 741a5ed9182SOmar Sandoval /* 742a5ed9182SOmar Sandoval * Okay, now that we've found the free space extent which contains the 743a5ed9182SOmar Sandoval * free space that we are removing, there are four cases: 744a5ed9182SOmar Sandoval * 745a5ed9182SOmar Sandoval * 1. We're using the whole extent: delete the key we found and 746a5ed9182SOmar Sandoval * decrement the free space extent count. 747a5ed9182SOmar Sandoval * 2. We are using part of the extent starting at the beginning: delete 748a5ed9182SOmar Sandoval * the key we found and insert a new key representing the leftover at 749a5ed9182SOmar Sandoval * the end. There is no net change in the number of extents. 750a5ed9182SOmar Sandoval * 3. We are using part of the extent ending at the end: delete the key 751a5ed9182SOmar Sandoval * we found and insert a new key representing the leftover at the 752a5ed9182SOmar Sandoval * beginning. There is no net change in the number of extents. 753a5ed9182SOmar Sandoval * 4. We are using part of the extent in the middle: delete the key we 754a5ed9182SOmar Sandoval * found and insert two new keys representing the leftovers on each 755a5ed9182SOmar Sandoval * side. Where we used to have one extent, we now have two, so increment 756a5ed9182SOmar Sandoval * the extent count. We may need to convert the block group to bitmaps 757a5ed9182SOmar Sandoval * as a result. 758a5ed9182SOmar Sandoval */ 759a5ed9182SOmar Sandoval 760a5ed9182SOmar Sandoval /* Delete the existing key (cases 1-4). */ 761a5ed9182SOmar Sandoval ret = btrfs_del_item(trans, root, path); 762a5ed9182SOmar Sandoval if (ret) 763a5ed9182SOmar Sandoval goto out; 764a5ed9182SOmar Sandoval 765a5ed9182SOmar Sandoval /* Add a key for leftovers at the beginning (cases 3 and 4). */ 766a5ed9182SOmar Sandoval if (start > found_start) { 767a5ed9182SOmar Sandoval key.objectid = found_start; 768a5ed9182SOmar Sandoval key.type = BTRFS_FREE_SPACE_EXTENT_KEY; 769a5ed9182SOmar Sandoval key.offset = start - found_start; 770a5ed9182SOmar Sandoval 771a5ed9182SOmar Sandoval btrfs_release_path(path); 772a5ed9182SOmar Sandoval ret = btrfs_insert_empty_item(trans, root, path, &key, 0); 773a5ed9182SOmar Sandoval if (ret) 774a5ed9182SOmar Sandoval goto out; 775a5ed9182SOmar Sandoval new_extents++; 776a5ed9182SOmar Sandoval } 777a5ed9182SOmar Sandoval 778a5ed9182SOmar Sandoval /* Add a key for leftovers at the end (cases 2 and 4). */ 779a5ed9182SOmar Sandoval if (end < found_end) { 780a5ed9182SOmar Sandoval key.objectid = end; 781a5ed9182SOmar Sandoval key.type = BTRFS_FREE_SPACE_EXTENT_KEY; 782a5ed9182SOmar Sandoval key.offset = found_end - end; 783a5ed9182SOmar Sandoval 784a5ed9182SOmar Sandoval btrfs_release_path(path); 785a5ed9182SOmar Sandoval ret = btrfs_insert_empty_item(trans, root, path, &key, 0); 786a5ed9182SOmar Sandoval if (ret) 787a5ed9182SOmar Sandoval goto out; 788a5ed9182SOmar Sandoval new_extents++; 789a5ed9182SOmar Sandoval } 790a5ed9182SOmar Sandoval 791a5ed9182SOmar Sandoval btrfs_release_path(path); 792a5ed9182SOmar Sandoval ret = update_free_space_extent_count(trans, fs_info, block_group, path, 793a5ed9182SOmar Sandoval new_extents); 794a5ed9182SOmar Sandoval 795a5ed9182SOmar Sandoval out: 796a5ed9182SOmar Sandoval return ret; 797a5ed9182SOmar Sandoval } 798a5ed9182SOmar Sandoval 799a5ed9182SOmar Sandoval int __remove_from_free_space_tree(struct btrfs_trans_handle *trans, 800a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info, 801a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group, 802a5ed9182SOmar Sandoval struct btrfs_path *path, u64 start, u64 size) 803a5ed9182SOmar Sandoval { 804a5ed9182SOmar Sandoval struct btrfs_free_space_info *info; 805a5ed9182SOmar Sandoval u32 flags; 806a5ed9182SOmar Sandoval int ret; 807a5ed9182SOmar Sandoval 808a5ed9182SOmar Sandoval if (block_group->needs_free_space) { 809a5ed9182SOmar Sandoval ret = __add_block_group_free_space(trans, fs_info, block_group, 810a5ed9182SOmar Sandoval path); 811a5ed9182SOmar Sandoval if (ret) 812a5ed9182SOmar Sandoval return ret; 813a5ed9182SOmar Sandoval } 814a5ed9182SOmar Sandoval 815a5ed9182SOmar Sandoval info = search_free_space_info(NULL, fs_info, block_group, path, 0); 816a5ed9182SOmar Sandoval if (IS_ERR(info)) 817a5ed9182SOmar Sandoval return PTR_ERR(info); 818a5ed9182SOmar Sandoval flags = btrfs_free_space_flags(path->nodes[0], info); 819a5ed9182SOmar Sandoval btrfs_release_path(path); 820a5ed9182SOmar Sandoval 821a5ed9182SOmar Sandoval if (flags & BTRFS_FREE_SPACE_USING_BITMAPS) { 822a5ed9182SOmar Sandoval return modify_free_space_bitmap(trans, fs_info, block_group, 823a5ed9182SOmar Sandoval path, start, size, 1); 824a5ed9182SOmar Sandoval } else { 825a5ed9182SOmar Sandoval return remove_free_space_extent(trans, fs_info, block_group, 826a5ed9182SOmar Sandoval path, start, size); 827a5ed9182SOmar Sandoval } 828a5ed9182SOmar Sandoval } 829a5ed9182SOmar Sandoval 830a5ed9182SOmar Sandoval int remove_from_free_space_tree(struct btrfs_trans_handle *trans, 831a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info, 832a5ed9182SOmar Sandoval u64 start, u64 size) 833a5ed9182SOmar Sandoval { 834a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group; 835a5ed9182SOmar Sandoval struct btrfs_path *path; 836a5ed9182SOmar Sandoval int ret; 837a5ed9182SOmar Sandoval 838a5ed9182SOmar Sandoval if (!btrfs_fs_compat_ro(fs_info, FREE_SPACE_TREE)) 839a5ed9182SOmar Sandoval return 0; 840a5ed9182SOmar Sandoval 841a5ed9182SOmar Sandoval path = btrfs_alloc_path(); 842a5ed9182SOmar Sandoval if (!path) { 843a5ed9182SOmar Sandoval ret = -ENOMEM; 844a5ed9182SOmar Sandoval goto out; 845a5ed9182SOmar Sandoval } 846a5ed9182SOmar Sandoval 847a5ed9182SOmar Sandoval block_group = btrfs_lookup_block_group(fs_info, start); 848a5ed9182SOmar Sandoval if (!block_group) { 849a5ed9182SOmar Sandoval ASSERT(0); 850a5ed9182SOmar Sandoval ret = -ENOENT; 851a5ed9182SOmar Sandoval goto out; 852a5ed9182SOmar Sandoval } 853a5ed9182SOmar Sandoval 854a5ed9182SOmar Sandoval mutex_lock(&block_group->free_space_lock); 855a5ed9182SOmar Sandoval ret = __remove_from_free_space_tree(trans, fs_info, block_group, path, 856a5ed9182SOmar Sandoval start, size); 857a5ed9182SOmar Sandoval mutex_unlock(&block_group->free_space_lock); 858a5ed9182SOmar Sandoval 859a5ed9182SOmar Sandoval btrfs_put_block_group(block_group); 860a5ed9182SOmar Sandoval out: 861a5ed9182SOmar Sandoval btrfs_free_path(path); 862a5ed9182SOmar Sandoval if (ret) 86366642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 864a5ed9182SOmar Sandoval return ret; 865a5ed9182SOmar Sandoval } 866a5ed9182SOmar Sandoval 867a5ed9182SOmar Sandoval static int add_free_space_extent(struct btrfs_trans_handle *trans, 868a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info, 869a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group, 870a5ed9182SOmar Sandoval struct btrfs_path *path, 871a5ed9182SOmar Sandoval u64 start, u64 size) 872a5ed9182SOmar Sandoval { 873a5ed9182SOmar Sandoval struct btrfs_root *root = fs_info->free_space_root; 874a5ed9182SOmar Sandoval struct btrfs_key key, new_key; 875a5ed9182SOmar Sandoval u64 found_start, found_end; 876a5ed9182SOmar Sandoval u64 end = start + size; 877a5ed9182SOmar Sandoval int new_extents = 1; 878a5ed9182SOmar Sandoval int ret; 879a5ed9182SOmar Sandoval 880a5ed9182SOmar Sandoval /* 881a5ed9182SOmar Sandoval * We are adding a new extent of free space, but we need to merge 882a5ed9182SOmar Sandoval * extents. There are four cases here: 883a5ed9182SOmar Sandoval * 884a5ed9182SOmar Sandoval * 1. The new extent does not have any immediate neighbors to merge 885a5ed9182SOmar Sandoval * with: add the new key and increment the free space extent count. We 886a5ed9182SOmar Sandoval * may need to convert the block group to bitmaps as a result. 887a5ed9182SOmar Sandoval * 2. The new extent has an immediate neighbor before it: remove the 888a5ed9182SOmar Sandoval * previous key and insert a new key combining both of them. There is no 889a5ed9182SOmar Sandoval * net change in the number of extents. 890a5ed9182SOmar Sandoval * 3. The new extent has an immediate neighbor after it: remove the next 891a5ed9182SOmar Sandoval * key and insert a new key combining both of them. There is no net 892a5ed9182SOmar Sandoval * change in the number of extents. 893a5ed9182SOmar Sandoval * 4. The new extent has immediate neighbors on both sides: remove both 894a5ed9182SOmar Sandoval * of the keys and insert a new key combining all of them. Where we used 895a5ed9182SOmar Sandoval * to have two extents, we now have one, so decrement the extent count. 896a5ed9182SOmar Sandoval */ 897a5ed9182SOmar Sandoval 898a5ed9182SOmar Sandoval new_key.objectid = start; 899a5ed9182SOmar Sandoval new_key.type = BTRFS_FREE_SPACE_EXTENT_KEY; 900a5ed9182SOmar Sandoval new_key.offset = size; 901a5ed9182SOmar Sandoval 902a5ed9182SOmar Sandoval /* Search for a neighbor on the left. */ 903a5ed9182SOmar Sandoval if (start == block_group->key.objectid) 904a5ed9182SOmar Sandoval goto right; 905a5ed9182SOmar Sandoval key.objectid = start - 1; 906a5ed9182SOmar Sandoval key.type = (u8)-1; 907a5ed9182SOmar Sandoval key.offset = (u64)-1; 908a5ed9182SOmar Sandoval 909a5ed9182SOmar Sandoval ret = btrfs_search_prev_slot(trans, root, &key, path, -1, 1); 910a5ed9182SOmar Sandoval if (ret) 911a5ed9182SOmar Sandoval goto out; 912a5ed9182SOmar Sandoval 913a5ed9182SOmar Sandoval btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 914a5ed9182SOmar Sandoval 915a5ed9182SOmar Sandoval if (key.type != BTRFS_FREE_SPACE_EXTENT_KEY) { 916a5ed9182SOmar Sandoval ASSERT(key.type == BTRFS_FREE_SPACE_INFO_KEY); 917a5ed9182SOmar Sandoval btrfs_release_path(path); 918a5ed9182SOmar Sandoval goto right; 919a5ed9182SOmar Sandoval } 920a5ed9182SOmar Sandoval 921a5ed9182SOmar Sandoval found_start = key.objectid; 922a5ed9182SOmar Sandoval found_end = key.objectid + key.offset; 923a5ed9182SOmar Sandoval ASSERT(found_start >= block_group->key.objectid && 924a5ed9182SOmar Sandoval found_end > block_group->key.objectid); 925a5ed9182SOmar Sandoval ASSERT(found_start < start && found_end <= start); 926a5ed9182SOmar Sandoval 927a5ed9182SOmar Sandoval /* 928a5ed9182SOmar Sandoval * Delete the neighbor on the left and absorb it into the new key (cases 929a5ed9182SOmar Sandoval * 2 and 4). 930a5ed9182SOmar Sandoval */ 931a5ed9182SOmar Sandoval if (found_end == start) { 932a5ed9182SOmar Sandoval ret = btrfs_del_item(trans, root, path); 933a5ed9182SOmar Sandoval if (ret) 934a5ed9182SOmar Sandoval goto out; 935a5ed9182SOmar Sandoval new_key.objectid = found_start; 936a5ed9182SOmar Sandoval new_key.offset += key.offset; 937a5ed9182SOmar Sandoval new_extents--; 938a5ed9182SOmar Sandoval } 939a5ed9182SOmar Sandoval btrfs_release_path(path); 940a5ed9182SOmar Sandoval 941a5ed9182SOmar Sandoval right: 942a5ed9182SOmar Sandoval /* Search for a neighbor on the right. */ 943a5ed9182SOmar Sandoval if (end == block_group->key.objectid + block_group->key.offset) 944a5ed9182SOmar Sandoval goto insert; 945a5ed9182SOmar Sandoval key.objectid = end; 946a5ed9182SOmar Sandoval key.type = (u8)-1; 947a5ed9182SOmar Sandoval key.offset = (u64)-1; 948a5ed9182SOmar Sandoval 949a5ed9182SOmar Sandoval ret = btrfs_search_prev_slot(trans, root, &key, path, -1, 1); 950a5ed9182SOmar Sandoval if (ret) 951a5ed9182SOmar Sandoval goto out; 952a5ed9182SOmar Sandoval 953a5ed9182SOmar Sandoval btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 954a5ed9182SOmar Sandoval 955a5ed9182SOmar Sandoval if (key.type != BTRFS_FREE_SPACE_EXTENT_KEY) { 956a5ed9182SOmar Sandoval ASSERT(key.type == BTRFS_FREE_SPACE_INFO_KEY); 957a5ed9182SOmar Sandoval btrfs_release_path(path); 958a5ed9182SOmar Sandoval goto insert; 959a5ed9182SOmar Sandoval } 960a5ed9182SOmar Sandoval 961a5ed9182SOmar Sandoval found_start = key.objectid; 962a5ed9182SOmar Sandoval found_end = key.objectid + key.offset; 963a5ed9182SOmar Sandoval ASSERT(found_start >= block_group->key.objectid && 964a5ed9182SOmar Sandoval found_end > block_group->key.objectid); 965a5ed9182SOmar Sandoval ASSERT((found_start < start && found_end <= start) || 966a5ed9182SOmar Sandoval (found_start >= end && found_end > end)); 967a5ed9182SOmar Sandoval 968a5ed9182SOmar Sandoval /* 969a5ed9182SOmar Sandoval * Delete the neighbor on the right and absorb it into the new key 970a5ed9182SOmar Sandoval * (cases 3 and 4). 971a5ed9182SOmar Sandoval */ 972a5ed9182SOmar Sandoval if (found_start == end) { 973a5ed9182SOmar Sandoval ret = btrfs_del_item(trans, root, path); 974a5ed9182SOmar Sandoval if (ret) 975a5ed9182SOmar Sandoval goto out; 976a5ed9182SOmar Sandoval new_key.offset += key.offset; 977a5ed9182SOmar Sandoval new_extents--; 978a5ed9182SOmar Sandoval } 979a5ed9182SOmar Sandoval btrfs_release_path(path); 980a5ed9182SOmar Sandoval 981a5ed9182SOmar Sandoval insert: 982a5ed9182SOmar Sandoval /* Insert the new key (cases 1-4). */ 983a5ed9182SOmar Sandoval ret = btrfs_insert_empty_item(trans, root, path, &new_key, 0); 984a5ed9182SOmar Sandoval if (ret) 985a5ed9182SOmar Sandoval goto out; 986a5ed9182SOmar Sandoval 987a5ed9182SOmar Sandoval btrfs_release_path(path); 988a5ed9182SOmar Sandoval ret = update_free_space_extent_count(trans, fs_info, block_group, path, 989a5ed9182SOmar Sandoval new_extents); 990a5ed9182SOmar Sandoval 991a5ed9182SOmar Sandoval out: 992a5ed9182SOmar Sandoval return ret; 993a5ed9182SOmar Sandoval } 994a5ed9182SOmar Sandoval 995a5ed9182SOmar Sandoval int __add_to_free_space_tree(struct btrfs_trans_handle *trans, 996a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info, 997a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group, 998a5ed9182SOmar Sandoval struct btrfs_path *path, u64 start, u64 size) 999a5ed9182SOmar Sandoval { 1000a5ed9182SOmar Sandoval struct btrfs_free_space_info *info; 1001a5ed9182SOmar Sandoval u32 flags; 1002a5ed9182SOmar Sandoval int ret; 1003a5ed9182SOmar Sandoval 1004a5ed9182SOmar Sandoval if (block_group->needs_free_space) { 1005a5ed9182SOmar Sandoval ret = __add_block_group_free_space(trans, fs_info, block_group, 1006a5ed9182SOmar Sandoval path); 1007a5ed9182SOmar Sandoval if (ret) 1008a5ed9182SOmar Sandoval return ret; 1009a5ed9182SOmar Sandoval } 1010a5ed9182SOmar Sandoval 1011a5ed9182SOmar Sandoval info = search_free_space_info(NULL, fs_info, block_group, path, 0); 1012a5ed9182SOmar Sandoval if (IS_ERR(info)) 1013a5ed9182SOmar Sandoval return PTR_ERR(info); 1014a5ed9182SOmar Sandoval flags = btrfs_free_space_flags(path->nodes[0], info); 1015a5ed9182SOmar Sandoval btrfs_release_path(path); 1016a5ed9182SOmar Sandoval 1017a5ed9182SOmar Sandoval if (flags & BTRFS_FREE_SPACE_USING_BITMAPS) { 1018a5ed9182SOmar Sandoval return modify_free_space_bitmap(trans, fs_info, block_group, 1019a5ed9182SOmar Sandoval path, start, size, 0); 1020a5ed9182SOmar Sandoval } else { 1021a5ed9182SOmar Sandoval return add_free_space_extent(trans, fs_info, block_group, path, 1022a5ed9182SOmar Sandoval start, size); 1023a5ed9182SOmar Sandoval } 1024a5ed9182SOmar Sandoval } 1025a5ed9182SOmar Sandoval 1026a5ed9182SOmar Sandoval int add_to_free_space_tree(struct btrfs_trans_handle *trans, 1027a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info, 1028a5ed9182SOmar Sandoval u64 start, u64 size) 1029a5ed9182SOmar Sandoval { 1030a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group; 1031a5ed9182SOmar Sandoval struct btrfs_path *path; 1032a5ed9182SOmar Sandoval int ret; 1033a5ed9182SOmar Sandoval 1034a5ed9182SOmar Sandoval if (!btrfs_fs_compat_ro(fs_info, FREE_SPACE_TREE)) 1035a5ed9182SOmar Sandoval return 0; 1036a5ed9182SOmar Sandoval 1037a5ed9182SOmar Sandoval path = btrfs_alloc_path(); 1038a5ed9182SOmar Sandoval if (!path) { 1039a5ed9182SOmar Sandoval ret = -ENOMEM; 1040a5ed9182SOmar Sandoval goto out; 1041a5ed9182SOmar Sandoval } 1042a5ed9182SOmar Sandoval 1043a5ed9182SOmar Sandoval block_group = btrfs_lookup_block_group(fs_info, start); 1044a5ed9182SOmar Sandoval if (!block_group) { 1045a5ed9182SOmar Sandoval ASSERT(0); 1046a5ed9182SOmar Sandoval ret = -ENOENT; 1047a5ed9182SOmar Sandoval goto out; 1048a5ed9182SOmar Sandoval } 1049a5ed9182SOmar Sandoval 1050a5ed9182SOmar Sandoval mutex_lock(&block_group->free_space_lock); 1051a5ed9182SOmar Sandoval ret = __add_to_free_space_tree(trans, fs_info, block_group, path, start, 1052a5ed9182SOmar Sandoval size); 1053a5ed9182SOmar Sandoval mutex_unlock(&block_group->free_space_lock); 1054a5ed9182SOmar Sandoval 1055a5ed9182SOmar Sandoval btrfs_put_block_group(block_group); 1056a5ed9182SOmar Sandoval out: 1057a5ed9182SOmar Sandoval btrfs_free_path(path); 1058a5ed9182SOmar Sandoval if (ret) 105966642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 1060a5ed9182SOmar Sandoval return ret; 1061a5ed9182SOmar Sandoval } 1062a5ed9182SOmar Sandoval 1063a5ed9182SOmar Sandoval /* 1064a5ed9182SOmar Sandoval * Populate the free space tree by walking the extent tree. Operations on the 1065a5ed9182SOmar Sandoval * extent tree that happen as a result of writes to the free space tree will go 1066a5ed9182SOmar Sandoval * through the normal add/remove hooks. 1067a5ed9182SOmar Sandoval */ 1068a5ed9182SOmar Sandoval static int populate_free_space_tree(struct btrfs_trans_handle *trans, 1069a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info, 1070a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group) 1071a5ed9182SOmar Sandoval { 1072a5ed9182SOmar Sandoval struct btrfs_root *extent_root = fs_info->extent_root; 1073a5ed9182SOmar Sandoval struct btrfs_path *path, *path2; 1074a5ed9182SOmar Sandoval struct btrfs_key key; 1075a5ed9182SOmar Sandoval u64 start, end; 1076a5ed9182SOmar Sandoval int ret; 1077a5ed9182SOmar Sandoval 1078a5ed9182SOmar Sandoval path = btrfs_alloc_path(); 1079a5ed9182SOmar Sandoval if (!path) 1080a5ed9182SOmar Sandoval return -ENOMEM; 1081019599adSGu Jinxiang path->reada = READA_FORWARD; 1082a5ed9182SOmar Sandoval 1083a5ed9182SOmar Sandoval path2 = btrfs_alloc_path(); 1084a5ed9182SOmar Sandoval if (!path2) { 1085a5ed9182SOmar Sandoval btrfs_free_path(path); 1086a5ed9182SOmar Sandoval return -ENOMEM; 1087a5ed9182SOmar Sandoval } 1088a5ed9182SOmar Sandoval 1089a5ed9182SOmar Sandoval ret = add_new_free_space_info(trans, fs_info, block_group, path2); 1090a5ed9182SOmar Sandoval if (ret) 1091a5ed9182SOmar Sandoval goto out; 1092a5ed9182SOmar Sandoval 1093511711afSChris Mason mutex_lock(&block_group->free_space_lock); 1094511711afSChris Mason 1095a5ed9182SOmar Sandoval /* 1096a5ed9182SOmar Sandoval * Iterate through all of the extent and metadata items in this block 1097a5ed9182SOmar Sandoval * group, adding the free space between them and the free space at the 1098a5ed9182SOmar Sandoval * end. Note that EXTENT_ITEM and METADATA_ITEM are less than 1099a5ed9182SOmar Sandoval * BLOCK_GROUP_ITEM, so an extent may precede the block group that it's 1100a5ed9182SOmar Sandoval * contained in. 1101a5ed9182SOmar Sandoval */ 1102a5ed9182SOmar Sandoval key.objectid = block_group->key.objectid; 1103a5ed9182SOmar Sandoval key.type = BTRFS_EXTENT_ITEM_KEY; 1104a5ed9182SOmar Sandoval key.offset = 0; 1105a5ed9182SOmar Sandoval 1106a5ed9182SOmar Sandoval ret = btrfs_search_slot_for_read(extent_root, &key, path, 1, 0); 1107a5ed9182SOmar Sandoval if (ret < 0) 1108511711afSChris Mason goto out_locked; 1109a5ed9182SOmar Sandoval ASSERT(ret == 0); 1110a5ed9182SOmar Sandoval 1111a5ed9182SOmar Sandoval start = block_group->key.objectid; 1112a5ed9182SOmar Sandoval end = block_group->key.objectid + block_group->key.offset; 1113a5ed9182SOmar Sandoval while (1) { 1114a5ed9182SOmar Sandoval btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 1115a5ed9182SOmar Sandoval 1116a5ed9182SOmar Sandoval if (key.type == BTRFS_EXTENT_ITEM_KEY || 1117a5ed9182SOmar Sandoval key.type == BTRFS_METADATA_ITEM_KEY) { 1118a5ed9182SOmar Sandoval if (key.objectid >= end) 1119a5ed9182SOmar Sandoval break; 1120a5ed9182SOmar Sandoval 1121a5ed9182SOmar Sandoval if (start < key.objectid) { 1122a5ed9182SOmar Sandoval ret = __add_to_free_space_tree(trans, fs_info, 1123a5ed9182SOmar Sandoval block_group, 1124a5ed9182SOmar Sandoval path2, start, 1125a5ed9182SOmar Sandoval key.objectid - 1126a5ed9182SOmar Sandoval start); 1127a5ed9182SOmar Sandoval if (ret) 1128511711afSChris Mason goto out_locked; 1129a5ed9182SOmar Sandoval } 1130a5ed9182SOmar Sandoval start = key.objectid; 1131a5ed9182SOmar Sandoval if (key.type == BTRFS_METADATA_ITEM_KEY) 1132da17066cSJeff Mahoney start += fs_info->nodesize; 1133a5ed9182SOmar Sandoval else 1134a5ed9182SOmar Sandoval start += key.offset; 1135a5ed9182SOmar Sandoval } else if (key.type == BTRFS_BLOCK_GROUP_ITEM_KEY) { 1136a5ed9182SOmar Sandoval if (key.objectid != block_group->key.objectid) 1137a5ed9182SOmar Sandoval break; 1138a5ed9182SOmar Sandoval } 1139a5ed9182SOmar Sandoval 1140a5ed9182SOmar Sandoval ret = btrfs_next_item(extent_root, path); 1141a5ed9182SOmar Sandoval if (ret < 0) 1142511711afSChris Mason goto out_locked; 1143a5ed9182SOmar Sandoval if (ret) 1144a5ed9182SOmar Sandoval break; 1145a5ed9182SOmar Sandoval } 1146a5ed9182SOmar Sandoval if (start < end) { 1147a5ed9182SOmar Sandoval ret = __add_to_free_space_tree(trans, fs_info, block_group, 1148a5ed9182SOmar Sandoval path2, start, end - start); 1149a5ed9182SOmar Sandoval if (ret) 1150511711afSChris Mason goto out_locked; 1151a5ed9182SOmar Sandoval } 1152a5ed9182SOmar Sandoval 1153a5ed9182SOmar Sandoval ret = 0; 1154511711afSChris Mason out_locked: 1155511711afSChris Mason mutex_unlock(&block_group->free_space_lock); 1156a5ed9182SOmar Sandoval out: 1157a5ed9182SOmar Sandoval btrfs_free_path(path2); 1158a5ed9182SOmar Sandoval btrfs_free_path(path); 1159a5ed9182SOmar Sandoval return ret; 1160a5ed9182SOmar Sandoval } 1161a5ed9182SOmar Sandoval 1162a5ed9182SOmar Sandoval int btrfs_create_free_space_tree(struct btrfs_fs_info *fs_info) 1163a5ed9182SOmar Sandoval { 1164a5ed9182SOmar Sandoval struct btrfs_trans_handle *trans; 1165a5ed9182SOmar Sandoval struct btrfs_root *tree_root = fs_info->tree_root; 1166a5ed9182SOmar Sandoval struct btrfs_root *free_space_root; 1167a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group; 1168a5ed9182SOmar Sandoval struct rb_node *node; 1169a5ed9182SOmar Sandoval int ret; 1170a5ed9182SOmar Sandoval 1171a5ed9182SOmar Sandoval trans = btrfs_start_transaction(tree_root, 0); 1172a5ed9182SOmar Sandoval if (IS_ERR(trans)) 1173a5ed9182SOmar Sandoval return PTR_ERR(trans); 1174a5ed9182SOmar Sandoval 1175afcdd129SJosef Bacik set_bit(BTRFS_FS_CREATING_FREE_SPACE_TREE, &fs_info->flags); 1176a5ed9182SOmar Sandoval free_space_root = btrfs_create_tree(trans, fs_info, 1177a5ed9182SOmar Sandoval BTRFS_FREE_SPACE_TREE_OBJECTID); 1178a5ed9182SOmar Sandoval if (IS_ERR(free_space_root)) { 1179a5ed9182SOmar Sandoval ret = PTR_ERR(free_space_root); 1180a5ed9182SOmar Sandoval goto abort; 1181a5ed9182SOmar Sandoval } 1182a5ed9182SOmar Sandoval fs_info->free_space_root = free_space_root; 1183a5ed9182SOmar Sandoval 1184a5ed9182SOmar Sandoval node = rb_first(&fs_info->block_group_cache_tree); 1185a5ed9182SOmar Sandoval while (node) { 1186a5ed9182SOmar Sandoval block_group = rb_entry(node, struct btrfs_block_group_cache, 1187a5ed9182SOmar Sandoval cache_node); 1188a5ed9182SOmar Sandoval ret = populate_free_space_tree(trans, fs_info, block_group); 1189a5ed9182SOmar Sandoval if (ret) 1190a5ed9182SOmar Sandoval goto abort; 1191a5ed9182SOmar Sandoval node = rb_next(node); 1192a5ed9182SOmar Sandoval } 1193a5ed9182SOmar Sandoval 1194a5ed9182SOmar Sandoval btrfs_set_fs_compat_ro(fs_info, FREE_SPACE_TREE); 11956675df31SOmar Sandoval btrfs_set_fs_compat_ro(fs_info, FREE_SPACE_TREE_VALID); 1196afcdd129SJosef Bacik clear_bit(BTRFS_FS_CREATING_FREE_SPACE_TREE, &fs_info->flags); 1197a5ed9182SOmar Sandoval 11980bef7109SSahil Kang return btrfs_commit_transaction(trans); 1199a5ed9182SOmar Sandoval 1200a5ed9182SOmar Sandoval abort: 1201afcdd129SJosef Bacik clear_bit(BTRFS_FS_CREATING_FREE_SPACE_TREE, &fs_info->flags); 120266642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 12033a45bb20SJeff Mahoney btrfs_end_transaction(trans); 1204a5ed9182SOmar Sandoval return ret; 1205a5ed9182SOmar Sandoval } 1206a5ed9182SOmar Sandoval 1207a5ed9182SOmar Sandoval static int clear_free_space_tree(struct btrfs_trans_handle *trans, 1208a5ed9182SOmar Sandoval struct btrfs_root *root) 1209a5ed9182SOmar Sandoval { 1210a5ed9182SOmar Sandoval struct btrfs_path *path; 1211a5ed9182SOmar Sandoval struct btrfs_key key; 1212a5ed9182SOmar Sandoval int nr; 1213a5ed9182SOmar Sandoval int ret; 1214a5ed9182SOmar Sandoval 1215a5ed9182SOmar Sandoval path = btrfs_alloc_path(); 1216a5ed9182SOmar Sandoval if (!path) 1217a5ed9182SOmar Sandoval return -ENOMEM; 1218a5ed9182SOmar Sandoval 1219a5ed9182SOmar Sandoval path->leave_spinning = 1; 1220a5ed9182SOmar Sandoval 1221a5ed9182SOmar Sandoval key.objectid = 0; 1222a5ed9182SOmar Sandoval key.type = 0; 1223a5ed9182SOmar Sandoval key.offset = 0; 1224a5ed9182SOmar Sandoval 1225a5ed9182SOmar Sandoval while (1) { 1226a5ed9182SOmar Sandoval ret = btrfs_search_slot(trans, root, &key, path, -1, 1); 1227a5ed9182SOmar Sandoval if (ret < 0) 1228a5ed9182SOmar Sandoval goto out; 1229a5ed9182SOmar Sandoval 1230a5ed9182SOmar Sandoval nr = btrfs_header_nritems(path->nodes[0]); 1231a5ed9182SOmar Sandoval if (!nr) 1232a5ed9182SOmar Sandoval break; 1233a5ed9182SOmar Sandoval 1234a5ed9182SOmar Sandoval path->slots[0] = 0; 1235a5ed9182SOmar Sandoval ret = btrfs_del_items(trans, root, path, 0, nr); 1236a5ed9182SOmar Sandoval if (ret) 1237a5ed9182SOmar Sandoval goto out; 1238a5ed9182SOmar Sandoval 1239a5ed9182SOmar Sandoval btrfs_release_path(path); 1240a5ed9182SOmar Sandoval } 1241a5ed9182SOmar Sandoval 1242a5ed9182SOmar Sandoval ret = 0; 1243a5ed9182SOmar Sandoval out: 1244a5ed9182SOmar Sandoval btrfs_free_path(path); 1245a5ed9182SOmar Sandoval return ret; 1246a5ed9182SOmar Sandoval } 1247a5ed9182SOmar Sandoval 1248a5ed9182SOmar Sandoval int btrfs_clear_free_space_tree(struct btrfs_fs_info *fs_info) 1249a5ed9182SOmar Sandoval { 1250a5ed9182SOmar Sandoval struct btrfs_trans_handle *trans; 1251a5ed9182SOmar Sandoval struct btrfs_root *tree_root = fs_info->tree_root; 1252a5ed9182SOmar Sandoval struct btrfs_root *free_space_root = fs_info->free_space_root; 1253a5ed9182SOmar Sandoval int ret; 1254a5ed9182SOmar Sandoval 1255a5ed9182SOmar Sandoval trans = btrfs_start_transaction(tree_root, 0); 1256a5ed9182SOmar Sandoval if (IS_ERR(trans)) 1257a5ed9182SOmar Sandoval return PTR_ERR(trans); 1258a5ed9182SOmar Sandoval 1259a5ed9182SOmar Sandoval btrfs_clear_fs_compat_ro(fs_info, FREE_SPACE_TREE); 12606675df31SOmar Sandoval btrfs_clear_fs_compat_ro(fs_info, FREE_SPACE_TREE_VALID); 1261a5ed9182SOmar Sandoval fs_info->free_space_root = NULL; 1262a5ed9182SOmar Sandoval 1263a5ed9182SOmar Sandoval ret = clear_free_space_tree(trans, free_space_root); 1264a5ed9182SOmar Sandoval if (ret) 1265a5ed9182SOmar Sandoval goto abort; 1266a5ed9182SOmar Sandoval 12671cd5447eSJeff Mahoney ret = btrfs_del_root(trans, fs_info, &free_space_root->root_key); 1268a5ed9182SOmar Sandoval if (ret) 1269a5ed9182SOmar Sandoval goto abort; 1270a5ed9182SOmar Sandoval 1271a5ed9182SOmar Sandoval list_del(&free_space_root->dirty_list); 1272a5ed9182SOmar Sandoval 1273a5ed9182SOmar Sandoval btrfs_tree_lock(free_space_root->node); 12747c302b49SDavid Sterba clean_tree_block(fs_info, free_space_root->node); 1275a5ed9182SOmar Sandoval btrfs_tree_unlock(free_space_root->node); 1276a5ed9182SOmar Sandoval btrfs_free_tree_block(trans, free_space_root, free_space_root->node, 1277a5ed9182SOmar Sandoval 0, 1); 1278a5ed9182SOmar Sandoval 1279a5ed9182SOmar Sandoval free_extent_buffer(free_space_root->node); 1280a5ed9182SOmar Sandoval free_extent_buffer(free_space_root->commit_root); 1281a5ed9182SOmar Sandoval kfree(free_space_root); 1282a5ed9182SOmar Sandoval 12830bef7109SSahil Kang return btrfs_commit_transaction(trans); 1284a5ed9182SOmar Sandoval 1285a5ed9182SOmar Sandoval abort: 128666642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 12873a45bb20SJeff Mahoney btrfs_end_transaction(trans); 1288a5ed9182SOmar Sandoval return ret; 1289a5ed9182SOmar Sandoval } 1290a5ed9182SOmar Sandoval 1291a5ed9182SOmar Sandoval static int __add_block_group_free_space(struct btrfs_trans_handle *trans, 1292a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info, 1293a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group, 1294a5ed9182SOmar Sandoval struct btrfs_path *path) 1295a5ed9182SOmar Sandoval { 1296a5ed9182SOmar Sandoval int ret; 1297a5ed9182SOmar Sandoval 1298a5ed9182SOmar Sandoval block_group->needs_free_space = 0; 1299a5ed9182SOmar Sandoval 1300a5ed9182SOmar Sandoval ret = add_new_free_space_info(trans, fs_info, block_group, path); 1301a5ed9182SOmar Sandoval if (ret) 1302a5ed9182SOmar Sandoval return ret; 1303a5ed9182SOmar Sandoval 1304a5ed9182SOmar Sandoval return __add_to_free_space_tree(trans, fs_info, block_group, path, 1305a5ed9182SOmar Sandoval block_group->key.objectid, 1306a5ed9182SOmar Sandoval block_group->key.offset); 1307a5ed9182SOmar Sandoval } 1308a5ed9182SOmar Sandoval 1309a5ed9182SOmar Sandoval int add_block_group_free_space(struct btrfs_trans_handle *trans, 1310a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info, 1311a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group) 1312a5ed9182SOmar Sandoval { 1313a5ed9182SOmar Sandoval struct btrfs_path *path = NULL; 1314a5ed9182SOmar Sandoval int ret = 0; 1315a5ed9182SOmar Sandoval 1316a5ed9182SOmar Sandoval if (!btrfs_fs_compat_ro(fs_info, FREE_SPACE_TREE)) 1317a5ed9182SOmar Sandoval return 0; 1318a5ed9182SOmar Sandoval 1319a5ed9182SOmar Sandoval mutex_lock(&block_group->free_space_lock); 1320a5ed9182SOmar Sandoval if (!block_group->needs_free_space) 1321a5ed9182SOmar Sandoval goto out; 1322a5ed9182SOmar Sandoval 1323a5ed9182SOmar Sandoval path = btrfs_alloc_path(); 1324a5ed9182SOmar Sandoval if (!path) { 1325a5ed9182SOmar Sandoval ret = -ENOMEM; 1326a5ed9182SOmar Sandoval goto out; 1327a5ed9182SOmar Sandoval } 1328a5ed9182SOmar Sandoval 1329a5ed9182SOmar Sandoval ret = __add_block_group_free_space(trans, fs_info, block_group, path); 1330a5ed9182SOmar Sandoval 1331a5ed9182SOmar Sandoval out: 1332a5ed9182SOmar Sandoval btrfs_free_path(path); 1333a5ed9182SOmar Sandoval mutex_unlock(&block_group->free_space_lock); 1334a5ed9182SOmar Sandoval if (ret) 133566642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 1336a5ed9182SOmar Sandoval return ret; 1337a5ed9182SOmar Sandoval } 1338a5ed9182SOmar Sandoval 1339a5ed9182SOmar Sandoval int remove_block_group_free_space(struct btrfs_trans_handle *trans, 1340a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info, 1341a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group) 1342a5ed9182SOmar Sandoval { 1343a5ed9182SOmar Sandoval struct btrfs_root *root = fs_info->free_space_root; 1344a5ed9182SOmar Sandoval struct btrfs_path *path; 1345a5ed9182SOmar Sandoval struct btrfs_key key, found_key; 1346a5ed9182SOmar Sandoval struct extent_buffer *leaf; 1347a5ed9182SOmar Sandoval u64 start, end; 1348a5ed9182SOmar Sandoval int done = 0, nr; 1349a5ed9182SOmar Sandoval int ret; 1350a5ed9182SOmar Sandoval 1351a5ed9182SOmar Sandoval if (!btrfs_fs_compat_ro(fs_info, FREE_SPACE_TREE)) 1352a5ed9182SOmar Sandoval return 0; 1353a5ed9182SOmar Sandoval 1354a5ed9182SOmar Sandoval if (block_group->needs_free_space) { 1355a5ed9182SOmar Sandoval /* We never added this block group to the free space tree. */ 1356a5ed9182SOmar Sandoval return 0; 1357a5ed9182SOmar Sandoval } 1358a5ed9182SOmar Sandoval 1359a5ed9182SOmar Sandoval path = btrfs_alloc_path(); 1360a5ed9182SOmar Sandoval if (!path) { 1361a5ed9182SOmar Sandoval ret = -ENOMEM; 1362a5ed9182SOmar Sandoval goto out; 1363a5ed9182SOmar Sandoval } 1364a5ed9182SOmar Sandoval 1365a5ed9182SOmar Sandoval start = block_group->key.objectid; 1366a5ed9182SOmar Sandoval end = block_group->key.objectid + block_group->key.offset; 1367a5ed9182SOmar Sandoval 1368a5ed9182SOmar Sandoval key.objectid = end - 1; 1369a5ed9182SOmar Sandoval key.type = (u8)-1; 1370a5ed9182SOmar Sandoval key.offset = (u64)-1; 1371a5ed9182SOmar Sandoval 1372a5ed9182SOmar Sandoval while (!done) { 1373a5ed9182SOmar Sandoval ret = btrfs_search_prev_slot(trans, root, &key, path, -1, 1); 1374a5ed9182SOmar Sandoval if (ret) 1375a5ed9182SOmar Sandoval goto out; 1376a5ed9182SOmar Sandoval 1377a5ed9182SOmar Sandoval leaf = path->nodes[0]; 1378a5ed9182SOmar Sandoval nr = 0; 1379a5ed9182SOmar Sandoval path->slots[0]++; 1380a5ed9182SOmar Sandoval while (path->slots[0] > 0) { 1381a5ed9182SOmar Sandoval btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0] - 1); 1382a5ed9182SOmar Sandoval 1383a5ed9182SOmar Sandoval if (found_key.type == BTRFS_FREE_SPACE_INFO_KEY) { 1384a5ed9182SOmar Sandoval ASSERT(found_key.objectid == block_group->key.objectid); 1385a5ed9182SOmar Sandoval ASSERT(found_key.offset == block_group->key.offset); 1386a5ed9182SOmar Sandoval done = 1; 1387a5ed9182SOmar Sandoval nr++; 1388a5ed9182SOmar Sandoval path->slots[0]--; 1389a5ed9182SOmar Sandoval break; 1390a5ed9182SOmar Sandoval } else if (found_key.type == BTRFS_FREE_SPACE_EXTENT_KEY || 1391a5ed9182SOmar Sandoval found_key.type == BTRFS_FREE_SPACE_BITMAP_KEY) { 1392a5ed9182SOmar Sandoval ASSERT(found_key.objectid >= start); 1393a5ed9182SOmar Sandoval ASSERT(found_key.objectid < end); 1394a5ed9182SOmar Sandoval ASSERT(found_key.objectid + found_key.offset <= end); 1395a5ed9182SOmar Sandoval nr++; 1396a5ed9182SOmar Sandoval path->slots[0]--; 1397a5ed9182SOmar Sandoval } else { 1398a5ed9182SOmar Sandoval ASSERT(0); 1399a5ed9182SOmar Sandoval } 1400a5ed9182SOmar Sandoval } 1401a5ed9182SOmar Sandoval 1402a5ed9182SOmar Sandoval ret = btrfs_del_items(trans, root, path, path->slots[0], nr); 1403a5ed9182SOmar Sandoval if (ret) 1404a5ed9182SOmar Sandoval goto out; 1405a5ed9182SOmar Sandoval btrfs_release_path(path); 1406a5ed9182SOmar Sandoval } 1407a5ed9182SOmar Sandoval 1408a5ed9182SOmar Sandoval ret = 0; 1409a5ed9182SOmar Sandoval out: 1410a5ed9182SOmar Sandoval btrfs_free_path(path); 1411a5ed9182SOmar Sandoval if (ret) 141266642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 1413a5ed9182SOmar Sandoval return ret; 1414a5ed9182SOmar Sandoval } 1415a5ed9182SOmar Sandoval 1416a5ed9182SOmar Sandoval static int load_free_space_bitmaps(struct btrfs_caching_control *caching_ctl, 1417a5ed9182SOmar Sandoval struct btrfs_path *path, 1418a5ed9182SOmar Sandoval u32 expected_extent_count) 1419a5ed9182SOmar Sandoval { 1420a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group; 1421a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info; 1422a5ed9182SOmar Sandoval struct btrfs_root *root; 1423a5ed9182SOmar Sandoval struct btrfs_key key; 1424a5ed9182SOmar Sandoval int prev_bit = 0, bit; 1425a5ed9182SOmar Sandoval /* Initialize to silence GCC. */ 1426a5ed9182SOmar Sandoval u64 extent_start = 0; 1427a5ed9182SOmar Sandoval u64 end, offset; 1428a5ed9182SOmar Sandoval u64 total_found = 0; 1429a5ed9182SOmar Sandoval u32 extent_count = 0; 1430a5ed9182SOmar Sandoval int ret; 1431a5ed9182SOmar Sandoval 1432a5ed9182SOmar Sandoval block_group = caching_ctl->block_group; 1433a5ed9182SOmar Sandoval fs_info = block_group->fs_info; 1434a5ed9182SOmar Sandoval root = fs_info->free_space_root; 1435a5ed9182SOmar Sandoval 1436a5ed9182SOmar Sandoval end = block_group->key.objectid + block_group->key.offset; 1437a5ed9182SOmar Sandoval 1438a5ed9182SOmar Sandoval while (1) { 1439a5ed9182SOmar Sandoval ret = btrfs_next_item(root, path); 1440a5ed9182SOmar Sandoval if (ret < 0) 1441a5ed9182SOmar Sandoval goto out; 1442a5ed9182SOmar Sandoval if (ret) 1443a5ed9182SOmar Sandoval break; 1444a5ed9182SOmar Sandoval 1445a5ed9182SOmar Sandoval btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 1446a5ed9182SOmar Sandoval 1447a5ed9182SOmar Sandoval if (key.type == BTRFS_FREE_SPACE_INFO_KEY) 1448a5ed9182SOmar Sandoval break; 1449a5ed9182SOmar Sandoval 1450a5ed9182SOmar Sandoval ASSERT(key.type == BTRFS_FREE_SPACE_BITMAP_KEY); 1451a5ed9182SOmar Sandoval ASSERT(key.objectid < end && key.objectid + key.offset <= end); 1452a5ed9182SOmar Sandoval 1453a5ed9182SOmar Sandoval caching_ctl->progress = key.objectid; 1454a5ed9182SOmar Sandoval 1455a5ed9182SOmar Sandoval offset = key.objectid; 1456a5ed9182SOmar Sandoval while (offset < key.objectid + key.offset) { 1457a5ed9182SOmar Sandoval bit = free_space_test_bit(block_group, path, offset); 1458a5ed9182SOmar Sandoval if (prev_bit == 0 && bit == 1) { 1459a5ed9182SOmar Sandoval extent_start = offset; 1460a5ed9182SOmar Sandoval } else if (prev_bit == 1 && bit == 0) { 1461a5ed9182SOmar Sandoval total_found += add_new_free_space(block_group, 1462a5ed9182SOmar Sandoval fs_info, 1463a5ed9182SOmar Sandoval extent_start, 1464a5ed9182SOmar Sandoval offset); 1465a5ed9182SOmar Sandoval if (total_found > CACHING_CTL_WAKE_UP) { 1466a5ed9182SOmar Sandoval total_found = 0; 1467a5ed9182SOmar Sandoval wake_up(&caching_ctl->wait); 1468a5ed9182SOmar Sandoval } 1469a5ed9182SOmar Sandoval extent_count++; 1470a5ed9182SOmar Sandoval } 1471a5ed9182SOmar Sandoval prev_bit = bit; 14720b246afaSJeff Mahoney offset += fs_info->sectorsize; 1473a5ed9182SOmar Sandoval } 1474a5ed9182SOmar Sandoval } 1475a5ed9182SOmar Sandoval if (prev_bit == 1) { 1476a5ed9182SOmar Sandoval total_found += add_new_free_space(block_group, fs_info, 1477a5ed9182SOmar Sandoval extent_start, end); 1478a5ed9182SOmar Sandoval extent_count++; 1479a5ed9182SOmar Sandoval } 1480a5ed9182SOmar Sandoval 1481a5ed9182SOmar Sandoval if (extent_count != expected_extent_count) { 14825d163e0eSJeff Mahoney btrfs_err(fs_info, 14835d163e0eSJeff Mahoney "incorrect extent count for %llu; counted %u, expected %u", 1484a5ed9182SOmar Sandoval block_group->key.objectid, extent_count, 1485a5ed9182SOmar Sandoval expected_extent_count); 1486a5ed9182SOmar Sandoval ASSERT(0); 1487a5ed9182SOmar Sandoval ret = -EIO; 1488a5ed9182SOmar Sandoval goto out; 1489a5ed9182SOmar Sandoval } 1490a5ed9182SOmar Sandoval 1491a5ed9182SOmar Sandoval caching_ctl->progress = (u64)-1; 1492a5ed9182SOmar Sandoval 1493a5ed9182SOmar Sandoval ret = 0; 1494a5ed9182SOmar Sandoval out: 1495a5ed9182SOmar Sandoval return ret; 1496a5ed9182SOmar Sandoval } 1497a5ed9182SOmar Sandoval 1498a5ed9182SOmar Sandoval static int load_free_space_extents(struct btrfs_caching_control *caching_ctl, 1499a5ed9182SOmar Sandoval struct btrfs_path *path, 1500a5ed9182SOmar Sandoval u32 expected_extent_count) 1501a5ed9182SOmar Sandoval { 1502a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group; 1503a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info; 1504a5ed9182SOmar Sandoval struct btrfs_root *root; 1505a5ed9182SOmar Sandoval struct btrfs_key key; 1506a5ed9182SOmar Sandoval u64 end; 1507a5ed9182SOmar Sandoval u64 total_found = 0; 1508a5ed9182SOmar Sandoval u32 extent_count = 0; 1509a5ed9182SOmar Sandoval int ret; 1510a5ed9182SOmar Sandoval 1511a5ed9182SOmar Sandoval block_group = caching_ctl->block_group; 1512a5ed9182SOmar Sandoval fs_info = block_group->fs_info; 1513a5ed9182SOmar Sandoval root = fs_info->free_space_root; 1514a5ed9182SOmar Sandoval 1515a5ed9182SOmar Sandoval end = block_group->key.objectid + block_group->key.offset; 1516a5ed9182SOmar Sandoval 1517a5ed9182SOmar Sandoval while (1) { 1518a5ed9182SOmar Sandoval ret = btrfs_next_item(root, path); 1519a5ed9182SOmar Sandoval if (ret < 0) 1520a5ed9182SOmar Sandoval goto out; 1521a5ed9182SOmar Sandoval if (ret) 1522a5ed9182SOmar Sandoval break; 1523a5ed9182SOmar Sandoval 1524a5ed9182SOmar Sandoval btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 1525a5ed9182SOmar Sandoval 1526a5ed9182SOmar Sandoval if (key.type == BTRFS_FREE_SPACE_INFO_KEY) 1527a5ed9182SOmar Sandoval break; 1528a5ed9182SOmar Sandoval 1529a5ed9182SOmar Sandoval ASSERT(key.type == BTRFS_FREE_SPACE_EXTENT_KEY); 1530a5ed9182SOmar Sandoval ASSERT(key.objectid < end && key.objectid + key.offset <= end); 1531a5ed9182SOmar Sandoval 1532a5ed9182SOmar Sandoval caching_ctl->progress = key.objectid; 1533a5ed9182SOmar Sandoval 1534a5ed9182SOmar Sandoval total_found += add_new_free_space(block_group, fs_info, 1535a5ed9182SOmar Sandoval key.objectid, 1536a5ed9182SOmar Sandoval key.objectid + key.offset); 1537a5ed9182SOmar Sandoval if (total_found > CACHING_CTL_WAKE_UP) { 1538a5ed9182SOmar Sandoval total_found = 0; 1539a5ed9182SOmar Sandoval wake_up(&caching_ctl->wait); 1540a5ed9182SOmar Sandoval } 1541a5ed9182SOmar Sandoval extent_count++; 1542a5ed9182SOmar Sandoval } 1543a5ed9182SOmar Sandoval 1544a5ed9182SOmar Sandoval if (extent_count != expected_extent_count) { 15455d163e0eSJeff Mahoney btrfs_err(fs_info, 15465d163e0eSJeff Mahoney "incorrect extent count for %llu; counted %u, expected %u", 1547a5ed9182SOmar Sandoval block_group->key.objectid, extent_count, 1548a5ed9182SOmar Sandoval expected_extent_count); 1549a5ed9182SOmar Sandoval ASSERT(0); 1550a5ed9182SOmar Sandoval ret = -EIO; 1551a5ed9182SOmar Sandoval goto out; 1552a5ed9182SOmar Sandoval } 1553a5ed9182SOmar Sandoval 1554a5ed9182SOmar Sandoval caching_ctl->progress = (u64)-1; 1555a5ed9182SOmar Sandoval 1556a5ed9182SOmar Sandoval ret = 0; 1557a5ed9182SOmar Sandoval out: 1558a5ed9182SOmar Sandoval return ret; 1559a5ed9182SOmar Sandoval } 1560a5ed9182SOmar Sandoval 1561a5ed9182SOmar Sandoval int load_free_space_tree(struct btrfs_caching_control *caching_ctl) 1562a5ed9182SOmar Sandoval { 1563a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group; 1564a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info; 1565a5ed9182SOmar Sandoval struct btrfs_free_space_info *info; 1566a5ed9182SOmar Sandoval struct btrfs_path *path; 1567a5ed9182SOmar Sandoval u32 extent_count, flags; 1568a5ed9182SOmar Sandoval int ret; 1569a5ed9182SOmar Sandoval 1570a5ed9182SOmar Sandoval block_group = caching_ctl->block_group; 1571a5ed9182SOmar Sandoval fs_info = block_group->fs_info; 1572a5ed9182SOmar Sandoval 1573a5ed9182SOmar Sandoval path = btrfs_alloc_path(); 1574a5ed9182SOmar Sandoval if (!path) 1575a5ed9182SOmar Sandoval return -ENOMEM; 1576a5ed9182SOmar Sandoval 1577a5ed9182SOmar Sandoval /* 1578a5ed9182SOmar Sandoval * Just like caching_thread() doesn't want to deadlock on the extent 1579a5ed9182SOmar Sandoval * tree, we don't want to deadlock on the free space tree. 1580a5ed9182SOmar Sandoval */ 1581a5ed9182SOmar Sandoval path->skip_locking = 1; 1582a5ed9182SOmar Sandoval path->search_commit_root = 1; 15837ce311d5SGu JinXiang path->reada = READA_FORWARD; 1584a5ed9182SOmar Sandoval 1585a5ed9182SOmar Sandoval info = search_free_space_info(NULL, fs_info, block_group, path, 0); 1586a5ed9182SOmar Sandoval if (IS_ERR(info)) { 1587a5ed9182SOmar Sandoval ret = PTR_ERR(info); 1588a5ed9182SOmar Sandoval goto out; 1589a5ed9182SOmar Sandoval } 1590a5ed9182SOmar Sandoval extent_count = btrfs_free_space_extent_count(path->nodes[0], info); 1591a5ed9182SOmar Sandoval flags = btrfs_free_space_flags(path->nodes[0], info); 1592a5ed9182SOmar Sandoval 1593a5ed9182SOmar Sandoval /* 1594a5ed9182SOmar Sandoval * We left path pointing to the free space info item, so now 1595a5ed9182SOmar Sandoval * load_free_space_foo can just iterate through the free space tree from 1596a5ed9182SOmar Sandoval * there. 1597a5ed9182SOmar Sandoval */ 1598a5ed9182SOmar Sandoval if (flags & BTRFS_FREE_SPACE_USING_BITMAPS) 1599a5ed9182SOmar Sandoval ret = load_free_space_bitmaps(caching_ctl, path, extent_count); 1600a5ed9182SOmar Sandoval else 1601a5ed9182SOmar Sandoval ret = load_free_space_extents(caching_ctl, path, extent_count); 1602a5ed9182SOmar Sandoval 1603a5ed9182SOmar Sandoval out: 1604a5ed9182SOmar Sandoval btrfs_free_path(path); 1605a5ed9182SOmar Sandoval return ret; 1606a5ed9182SOmar Sandoval } 1607