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