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_block_group_cache *block_group, 48a5ed9182SOmar Sandoval struct btrfs_path *path) 49a5ed9182SOmar Sandoval { 5066afee18SNikolay Borisov struct btrfs_root *root = trans->fs_info->free_space_root; 51a5ed9182SOmar Sandoval struct btrfs_free_space_info *info; 52a5ed9182SOmar Sandoval struct btrfs_key key; 53a5ed9182SOmar Sandoval struct extent_buffer *leaf; 54a5ed9182SOmar Sandoval int ret; 55a5ed9182SOmar Sandoval 56a5ed9182SOmar Sandoval key.objectid = block_group->key.objectid; 57a5ed9182SOmar Sandoval key.type = BTRFS_FREE_SPACE_INFO_KEY; 58a5ed9182SOmar Sandoval key.offset = block_group->key.offset; 59a5ed9182SOmar Sandoval 60a5ed9182SOmar Sandoval ret = btrfs_insert_empty_item(trans, root, path, &key, sizeof(*info)); 61a5ed9182SOmar Sandoval if (ret) 62a5ed9182SOmar Sandoval goto out; 63a5ed9182SOmar Sandoval 64a5ed9182SOmar Sandoval leaf = path->nodes[0]; 65a5ed9182SOmar Sandoval info = btrfs_item_ptr(leaf, path->slots[0], 66a5ed9182SOmar Sandoval struct btrfs_free_space_info); 67a5ed9182SOmar Sandoval btrfs_set_free_space_extent_count(leaf, info, 0); 68a5ed9182SOmar Sandoval btrfs_set_free_space_flags(leaf, info, 0); 69a5ed9182SOmar Sandoval btrfs_mark_buffer_dirty(leaf); 70a5ed9182SOmar Sandoval 71a5ed9182SOmar Sandoval ret = 0; 72a5ed9182SOmar Sandoval out: 73a5ed9182SOmar Sandoval btrfs_release_path(path); 74a5ed9182SOmar Sandoval return ret; 75a5ed9182SOmar Sandoval } 76a5ed9182SOmar Sandoval 77a5ed9182SOmar Sandoval struct btrfs_free_space_info * 78a5ed9182SOmar Sandoval search_free_space_info(struct btrfs_trans_handle *trans, 79a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info, 80a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group, 81a5ed9182SOmar Sandoval struct btrfs_path *path, int cow) 82a5ed9182SOmar Sandoval { 83a5ed9182SOmar Sandoval struct btrfs_root *root = fs_info->free_space_root; 84a5ed9182SOmar Sandoval struct btrfs_key key; 85a5ed9182SOmar Sandoval int ret; 86a5ed9182SOmar Sandoval 87a5ed9182SOmar Sandoval key.objectid = block_group->key.objectid; 88a5ed9182SOmar Sandoval key.type = BTRFS_FREE_SPACE_INFO_KEY; 89a5ed9182SOmar Sandoval key.offset = block_group->key.offset; 90a5ed9182SOmar Sandoval 91a5ed9182SOmar Sandoval ret = btrfs_search_slot(trans, root, &key, path, 0, cow); 92a5ed9182SOmar Sandoval if (ret < 0) 93a5ed9182SOmar Sandoval return ERR_PTR(ret); 94a5ed9182SOmar Sandoval if (ret != 0) { 95ab8d0fc4SJeff Mahoney btrfs_warn(fs_info, "missing free space info for %llu", 96a5ed9182SOmar Sandoval block_group->key.objectid); 97a5ed9182SOmar Sandoval ASSERT(0); 98a5ed9182SOmar Sandoval return ERR_PTR(-ENOENT); 99a5ed9182SOmar Sandoval } 100a5ed9182SOmar Sandoval 101a5ed9182SOmar Sandoval return btrfs_item_ptr(path->nodes[0], path->slots[0], 102a5ed9182SOmar Sandoval struct btrfs_free_space_info); 103a5ed9182SOmar Sandoval } 104a5ed9182SOmar Sandoval 105a5ed9182SOmar Sandoval /* 106a5ed9182SOmar Sandoval * btrfs_search_slot() but we're looking for the greatest key less than the 107a5ed9182SOmar Sandoval * passed key. 108a5ed9182SOmar Sandoval */ 109a5ed9182SOmar Sandoval static int btrfs_search_prev_slot(struct btrfs_trans_handle *trans, 110a5ed9182SOmar Sandoval struct btrfs_root *root, 111a5ed9182SOmar Sandoval struct btrfs_key *key, struct btrfs_path *p, 112a5ed9182SOmar Sandoval int ins_len, int cow) 113a5ed9182SOmar Sandoval { 114a5ed9182SOmar Sandoval int ret; 115a5ed9182SOmar Sandoval 116a5ed9182SOmar Sandoval ret = btrfs_search_slot(trans, root, key, p, ins_len, cow); 117a5ed9182SOmar Sandoval if (ret < 0) 118a5ed9182SOmar Sandoval return ret; 119a5ed9182SOmar Sandoval 120a5ed9182SOmar Sandoval if (ret == 0) { 121a5ed9182SOmar Sandoval ASSERT(0); 122a5ed9182SOmar Sandoval return -EIO; 123a5ed9182SOmar Sandoval } 124a5ed9182SOmar Sandoval 125a5ed9182SOmar Sandoval if (p->slots[0] == 0) { 126a5ed9182SOmar Sandoval ASSERT(0); 127a5ed9182SOmar Sandoval return -EIO; 128a5ed9182SOmar Sandoval } 129a5ed9182SOmar Sandoval p->slots[0]--; 130a5ed9182SOmar Sandoval 131a5ed9182SOmar Sandoval return 0; 132a5ed9182SOmar Sandoval } 133a5ed9182SOmar Sandoval 134a5ed9182SOmar Sandoval static inline u32 free_space_bitmap_size(u64 size, u32 sectorsize) 135a5ed9182SOmar Sandoval { 136a5ed9182SOmar Sandoval return DIV_ROUND_UP((u32)div_u64(size, sectorsize), BITS_PER_BYTE); 137a5ed9182SOmar Sandoval } 138a5ed9182SOmar Sandoval 139a565971fSHoward McLauchlan static unsigned long *alloc_bitmap(u32 bitmap_size) 140a5ed9182SOmar Sandoval { 141a565971fSHoward McLauchlan unsigned long *ret; 14225ff17e8SOmar Sandoval unsigned int nofs_flag; 143a565971fSHoward McLauchlan u32 bitmap_rounded_size = round_up(bitmap_size, sizeof(unsigned long)); 14479b134a2SDavid Sterba 14579b134a2SDavid Sterba /* 14625ff17e8SOmar Sandoval * GFP_NOFS doesn't work with kvmalloc(), but we really can't recurse 14725ff17e8SOmar Sandoval * into the filesystem as the free space bitmap can be modified in the 14825ff17e8SOmar Sandoval * critical section of a transaction commit. 14925ff17e8SOmar Sandoval * 15025ff17e8SOmar Sandoval * TODO: push the memalloc_nofs_{save,restore}() to the caller where we 15125ff17e8SOmar Sandoval * know that recursion is unsafe. 15279b134a2SDavid Sterba */ 15325ff17e8SOmar Sandoval nofs_flag = memalloc_nofs_save(); 154a565971fSHoward McLauchlan ret = kvzalloc(bitmap_rounded_size, GFP_KERNEL); 15525ff17e8SOmar Sandoval memalloc_nofs_restore(nofs_flag); 15625ff17e8SOmar Sandoval return ret; 157a5ed9182SOmar Sandoval } 158a5ed9182SOmar Sandoval 159a565971fSHoward McLauchlan static void le_bitmap_set(unsigned long *map, unsigned int start, int len) 1606faa8f47SHoward McLauchlan { 161a565971fSHoward McLauchlan u8 *p = ((u8 *)map) + BIT_BYTE(start); 1626faa8f47SHoward McLauchlan const unsigned int size = start + len; 1636faa8f47SHoward McLauchlan int bits_to_set = BITS_PER_BYTE - (start % BITS_PER_BYTE); 1646faa8f47SHoward McLauchlan u8 mask_to_set = BITMAP_FIRST_BYTE_MASK(start); 1656faa8f47SHoward McLauchlan 1666faa8f47SHoward McLauchlan while (len - bits_to_set >= 0) { 1676faa8f47SHoward McLauchlan *p |= mask_to_set; 1686faa8f47SHoward McLauchlan len -= bits_to_set; 1696faa8f47SHoward McLauchlan bits_to_set = BITS_PER_BYTE; 1706faa8f47SHoward McLauchlan mask_to_set = ~0; 1716faa8f47SHoward McLauchlan p++; 1726faa8f47SHoward McLauchlan } 1736faa8f47SHoward McLauchlan if (len) { 1746faa8f47SHoward McLauchlan mask_to_set &= BITMAP_LAST_BYTE_MASK(size); 1756faa8f47SHoward McLauchlan *p |= mask_to_set; 1766faa8f47SHoward McLauchlan } 1776faa8f47SHoward McLauchlan } 1786faa8f47SHoward McLauchlan 179a5ed9182SOmar Sandoval int convert_free_space_to_bitmaps(struct btrfs_trans_handle *trans, 180a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info, 181a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group, 182a5ed9182SOmar Sandoval struct btrfs_path *path) 183a5ed9182SOmar Sandoval { 184a5ed9182SOmar Sandoval struct btrfs_root *root = fs_info->free_space_root; 185a5ed9182SOmar Sandoval struct btrfs_free_space_info *info; 186a5ed9182SOmar Sandoval struct btrfs_key key, found_key; 187a5ed9182SOmar Sandoval struct extent_buffer *leaf; 188a565971fSHoward McLauchlan unsigned long *bitmap; 189a565971fSHoward McLauchlan char *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 278a565971fSHoward McLauchlan bitmap_cursor = (char *)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; 327a565971fSHoward McLauchlan unsigned long *bitmap; 328a5ed9182SOmar Sandoval u64 start, end; 329a5ed9182SOmar Sandoval u32 bitmap_size, flags, expected_extent_count; 330a565971fSHoward McLauchlan unsigned long nrbits, start_bit, end_bit; 331a5ed9182SOmar Sandoval u32 extent_count = 0; 332a5ed9182SOmar Sandoval int done = 0, nr; 333a5ed9182SOmar Sandoval int ret; 334a5ed9182SOmar Sandoval 335a5ed9182SOmar Sandoval bitmap_size = free_space_bitmap_size(block_group->key.offset, 3360b246afaSJeff Mahoney fs_info->sectorsize); 337a5ed9182SOmar Sandoval bitmap = alloc_bitmap(bitmap_size); 338a5ed9182SOmar Sandoval if (!bitmap) { 339a5ed9182SOmar Sandoval ret = -ENOMEM; 340a5ed9182SOmar Sandoval goto out; 341a5ed9182SOmar Sandoval } 342a5ed9182SOmar Sandoval 343a5ed9182SOmar Sandoval start = block_group->key.objectid; 344a5ed9182SOmar Sandoval end = block_group->key.objectid + block_group->key.offset; 345a5ed9182SOmar Sandoval 346a5ed9182SOmar Sandoval key.objectid = end - 1; 347a5ed9182SOmar Sandoval key.type = (u8)-1; 348a5ed9182SOmar Sandoval key.offset = (u64)-1; 349a5ed9182SOmar Sandoval 350a5ed9182SOmar Sandoval while (!done) { 351a5ed9182SOmar Sandoval ret = btrfs_search_prev_slot(trans, root, &key, path, -1, 1); 352a5ed9182SOmar Sandoval if (ret) 353a5ed9182SOmar Sandoval goto out; 354a5ed9182SOmar Sandoval 355a5ed9182SOmar Sandoval leaf = path->nodes[0]; 356a5ed9182SOmar Sandoval nr = 0; 357a5ed9182SOmar Sandoval path->slots[0]++; 358a5ed9182SOmar Sandoval while (path->slots[0] > 0) { 359a5ed9182SOmar Sandoval btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0] - 1); 360a5ed9182SOmar Sandoval 361a5ed9182SOmar Sandoval if (found_key.type == BTRFS_FREE_SPACE_INFO_KEY) { 362a5ed9182SOmar Sandoval ASSERT(found_key.objectid == block_group->key.objectid); 363a5ed9182SOmar Sandoval ASSERT(found_key.offset == block_group->key.offset); 364a5ed9182SOmar Sandoval done = 1; 365a5ed9182SOmar Sandoval break; 366a5ed9182SOmar Sandoval } else if (found_key.type == BTRFS_FREE_SPACE_BITMAP_KEY) { 367a5ed9182SOmar Sandoval unsigned long ptr; 368a565971fSHoward McLauchlan char *bitmap_cursor; 369a5ed9182SOmar Sandoval u32 bitmap_pos, data_size; 370a5ed9182SOmar Sandoval 371a5ed9182SOmar Sandoval ASSERT(found_key.objectid >= start); 372a5ed9182SOmar Sandoval ASSERT(found_key.objectid < end); 373a5ed9182SOmar Sandoval ASSERT(found_key.objectid + found_key.offset <= end); 374a5ed9182SOmar Sandoval 375a5ed9182SOmar Sandoval bitmap_pos = div_u64(found_key.objectid - start, 3760b246afaSJeff Mahoney fs_info->sectorsize * 377a5ed9182SOmar Sandoval BITS_PER_BYTE); 378a565971fSHoward McLauchlan bitmap_cursor = ((char *)bitmap) + bitmap_pos; 379a5ed9182SOmar Sandoval data_size = free_space_bitmap_size(found_key.offset, 3800b246afaSJeff Mahoney fs_info->sectorsize); 381a5ed9182SOmar Sandoval 382a5ed9182SOmar Sandoval ptr = btrfs_item_ptr_offset(leaf, path->slots[0] - 1); 383a5ed9182SOmar Sandoval read_extent_buffer(leaf, bitmap_cursor, ptr, 384a5ed9182SOmar Sandoval data_size); 385a5ed9182SOmar Sandoval 386a5ed9182SOmar Sandoval nr++; 387a5ed9182SOmar Sandoval path->slots[0]--; 388a5ed9182SOmar Sandoval } else { 389a5ed9182SOmar Sandoval ASSERT(0); 390a5ed9182SOmar Sandoval } 391a5ed9182SOmar Sandoval } 392a5ed9182SOmar Sandoval 393a5ed9182SOmar Sandoval ret = btrfs_del_items(trans, root, path, path->slots[0], nr); 394a5ed9182SOmar Sandoval if (ret) 395a5ed9182SOmar Sandoval goto out; 396a5ed9182SOmar Sandoval btrfs_release_path(path); 397a5ed9182SOmar Sandoval } 398a5ed9182SOmar Sandoval 399a5ed9182SOmar Sandoval info = search_free_space_info(trans, fs_info, block_group, path, 1); 400a5ed9182SOmar Sandoval if (IS_ERR(info)) { 401a5ed9182SOmar Sandoval ret = PTR_ERR(info); 402a5ed9182SOmar Sandoval goto out; 403a5ed9182SOmar Sandoval } 404a5ed9182SOmar Sandoval leaf = path->nodes[0]; 405a5ed9182SOmar Sandoval flags = btrfs_free_space_flags(leaf, info); 406a5ed9182SOmar Sandoval flags &= ~BTRFS_FREE_SPACE_USING_BITMAPS; 407a5ed9182SOmar Sandoval btrfs_set_free_space_flags(leaf, info, flags); 408a5ed9182SOmar Sandoval expected_extent_count = btrfs_free_space_extent_count(leaf, info); 409a5ed9182SOmar Sandoval btrfs_mark_buffer_dirty(leaf); 410a5ed9182SOmar Sandoval btrfs_release_path(path); 411a5ed9182SOmar Sandoval 412a565971fSHoward McLauchlan nrbits = div_u64(block_group->key.offset, block_group->fs_info->sectorsize); 413a565971fSHoward McLauchlan start_bit = find_next_bit_le(bitmap, nrbits, 0); 414a565971fSHoward McLauchlan 415a565971fSHoward McLauchlan while (start_bit < nrbits) { 416a565971fSHoward McLauchlan end_bit = find_next_zero_bit_le(bitmap, nrbits, start_bit); 417a565971fSHoward McLauchlan ASSERT(start_bit < end_bit); 418a565971fSHoward McLauchlan 419a565971fSHoward McLauchlan key.objectid = start + start_bit * block_group->fs_info->sectorsize; 420a5ed9182SOmar Sandoval key.type = BTRFS_FREE_SPACE_EXTENT_KEY; 421a565971fSHoward McLauchlan key.offset = (end_bit - start_bit) * block_group->fs_info->sectorsize; 422a5ed9182SOmar Sandoval 423a5ed9182SOmar Sandoval ret = btrfs_insert_empty_item(trans, root, path, &key, 0); 424a5ed9182SOmar Sandoval if (ret) 425a5ed9182SOmar Sandoval goto out; 426a5ed9182SOmar Sandoval btrfs_release_path(path); 427a5ed9182SOmar Sandoval 428a5ed9182SOmar Sandoval extent_count++; 429a5ed9182SOmar Sandoval 430a565971fSHoward McLauchlan start_bit = find_next_bit_le(bitmap, nrbits, end_bit); 431a5ed9182SOmar Sandoval } 432a5ed9182SOmar Sandoval 433a5ed9182SOmar Sandoval if (extent_count != expected_extent_count) { 4345d163e0eSJeff Mahoney btrfs_err(fs_info, 4355d163e0eSJeff Mahoney "incorrect extent count for %llu; counted %u, expected %u", 436a5ed9182SOmar Sandoval block_group->key.objectid, extent_count, 437a5ed9182SOmar Sandoval expected_extent_count); 438a5ed9182SOmar Sandoval ASSERT(0); 439a5ed9182SOmar Sandoval ret = -EIO; 440a5ed9182SOmar Sandoval goto out; 441a5ed9182SOmar Sandoval } 442a5ed9182SOmar Sandoval 443a5ed9182SOmar Sandoval ret = 0; 444a5ed9182SOmar Sandoval out: 44579b134a2SDavid Sterba kvfree(bitmap); 446a5ed9182SOmar Sandoval if (ret) 44766642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 448a5ed9182SOmar Sandoval return ret; 449a5ed9182SOmar Sandoval } 450a5ed9182SOmar Sandoval 451a5ed9182SOmar Sandoval static int update_free_space_extent_count(struct btrfs_trans_handle *trans, 452a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info, 453a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group, 454a5ed9182SOmar Sandoval struct btrfs_path *path, 455a5ed9182SOmar Sandoval int new_extents) 456a5ed9182SOmar Sandoval { 457a5ed9182SOmar Sandoval struct btrfs_free_space_info *info; 458a5ed9182SOmar Sandoval u32 flags; 459a5ed9182SOmar Sandoval u32 extent_count; 460a5ed9182SOmar Sandoval int ret = 0; 461a5ed9182SOmar Sandoval 462a5ed9182SOmar Sandoval if (new_extents == 0) 463a5ed9182SOmar Sandoval return 0; 464a5ed9182SOmar Sandoval 465a5ed9182SOmar Sandoval info = search_free_space_info(trans, fs_info, block_group, path, 1); 466a5ed9182SOmar Sandoval if (IS_ERR(info)) { 467a5ed9182SOmar Sandoval ret = PTR_ERR(info); 468a5ed9182SOmar Sandoval goto out; 469a5ed9182SOmar Sandoval } 470a5ed9182SOmar Sandoval flags = btrfs_free_space_flags(path->nodes[0], info); 471a5ed9182SOmar Sandoval extent_count = btrfs_free_space_extent_count(path->nodes[0], info); 472a5ed9182SOmar Sandoval 473a5ed9182SOmar Sandoval extent_count += new_extents; 474a5ed9182SOmar Sandoval btrfs_set_free_space_extent_count(path->nodes[0], info, extent_count); 475a5ed9182SOmar Sandoval btrfs_mark_buffer_dirty(path->nodes[0]); 476a5ed9182SOmar Sandoval btrfs_release_path(path); 477a5ed9182SOmar Sandoval 478a5ed9182SOmar Sandoval if (!(flags & BTRFS_FREE_SPACE_USING_BITMAPS) && 479a5ed9182SOmar Sandoval extent_count > block_group->bitmap_high_thresh) { 480a5ed9182SOmar Sandoval ret = convert_free_space_to_bitmaps(trans, fs_info, block_group, 481a5ed9182SOmar Sandoval path); 482a5ed9182SOmar Sandoval } else if ((flags & BTRFS_FREE_SPACE_USING_BITMAPS) && 483a5ed9182SOmar Sandoval extent_count < block_group->bitmap_low_thresh) { 484a5ed9182SOmar Sandoval ret = convert_free_space_to_extents(trans, fs_info, block_group, 485a5ed9182SOmar Sandoval path); 486a5ed9182SOmar Sandoval } 487a5ed9182SOmar Sandoval 488a5ed9182SOmar Sandoval out: 489a5ed9182SOmar Sandoval return ret; 490a5ed9182SOmar Sandoval } 491a5ed9182SOmar Sandoval 492a5ed9182SOmar Sandoval int free_space_test_bit(struct btrfs_block_group_cache *block_group, 493a5ed9182SOmar Sandoval struct btrfs_path *path, u64 offset) 494a5ed9182SOmar Sandoval { 495a5ed9182SOmar Sandoval struct extent_buffer *leaf; 496a5ed9182SOmar Sandoval struct btrfs_key key; 497a5ed9182SOmar Sandoval u64 found_start, found_end; 498a5ed9182SOmar Sandoval unsigned long ptr, i; 499a5ed9182SOmar Sandoval 500a5ed9182SOmar Sandoval leaf = path->nodes[0]; 501a5ed9182SOmar Sandoval btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 502a5ed9182SOmar Sandoval ASSERT(key.type == BTRFS_FREE_SPACE_BITMAP_KEY); 503a5ed9182SOmar Sandoval 504a5ed9182SOmar Sandoval found_start = key.objectid; 505a5ed9182SOmar Sandoval found_end = key.objectid + key.offset; 506a5ed9182SOmar Sandoval ASSERT(offset >= found_start && offset < found_end); 507a5ed9182SOmar Sandoval 508a5ed9182SOmar Sandoval ptr = btrfs_item_ptr_offset(leaf, path->slots[0]); 509da17066cSJeff Mahoney i = div_u64(offset - found_start, 510da17066cSJeff Mahoney block_group->fs_info->sectorsize); 511a5ed9182SOmar Sandoval return !!extent_buffer_test_bit(leaf, ptr, i); 512a5ed9182SOmar Sandoval } 513a5ed9182SOmar Sandoval 514a5ed9182SOmar Sandoval static void free_space_set_bits(struct btrfs_block_group_cache *block_group, 515a5ed9182SOmar Sandoval struct btrfs_path *path, u64 *start, u64 *size, 516a5ed9182SOmar Sandoval int bit) 517a5ed9182SOmar Sandoval { 5180b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = block_group->fs_info; 519a5ed9182SOmar Sandoval struct extent_buffer *leaf; 520a5ed9182SOmar Sandoval struct btrfs_key key; 521a5ed9182SOmar Sandoval u64 end = *start + *size; 522a5ed9182SOmar Sandoval u64 found_start, found_end; 523a5ed9182SOmar Sandoval unsigned long ptr, first, last; 524a5ed9182SOmar Sandoval 525a5ed9182SOmar Sandoval leaf = path->nodes[0]; 526a5ed9182SOmar Sandoval btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 527a5ed9182SOmar Sandoval ASSERT(key.type == BTRFS_FREE_SPACE_BITMAP_KEY); 528a5ed9182SOmar Sandoval 529a5ed9182SOmar Sandoval found_start = key.objectid; 530a5ed9182SOmar Sandoval found_end = key.objectid + key.offset; 531a5ed9182SOmar Sandoval ASSERT(*start >= found_start && *start < found_end); 532a5ed9182SOmar Sandoval ASSERT(end > found_start); 533a5ed9182SOmar Sandoval 534a5ed9182SOmar Sandoval if (end > found_end) 535a5ed9182SOmar Sandoval end = found_end; 536a5ed9182SOmar Sandoval 537a5ed9182SOmar Sandoval ptr = btrfs_item_ptr_offset(leaf, path->slots[0]); 5380b246afaSJeff Mahoney first = div_u64(*start - found_start, fs_info->sectorsize); 5390b246afaSJeff Mahoney last = div_u64(end - found_start, fs_info->sectorsize); 540a5ed9182SOmar Sandoval if (bit) 541a5ed9182SOmar Sandoval extent_buffer_bitmap_set(leaf, ptr, first, last - first); 542a5ed9182SOmar Sandoval else 543a5ed9182SOmar Sandoval extent_buffer_bitmap_clear(leaf, ptr, first, last - first); 544a5ed9182SOmar Sandoval btrfs_mark_buffer_dirty(leaf); 545a5ed9182SOmar Sandoval 546a5ed9182SOmar Sandoval *size -= end - *start; 547a5ed9182SOmar Sandoval *start = end; 548a5ed9182SOmar Sandoval } 549a5ed9182SOmar Sandoval 550a5ed9182SOmar Sandoval /* 551a5ed9182SOmar Sandoval * We can't use btrfs_next_item() in modify_free_space_bitmap() because 552a5ed9182SOmar Sandoval * btrfs_next_leaf() doesn't get the path for writing. We can forgo the fancy 553a5ed9182SOmar Sandoval * tree walking in btrfs_next_leaf() anyways because we know exactly what we're 554a5ed9182SOmar Sandoval * looking for. 555a5ed9182SOmar Sandoval */ 556a5ed9182SOmar Sandoval static int free_space_next_bitmap(struct btrfs_trans_handle *trans, 557a5ed9182SOmar Sandoval struct btrfs_root *root, struct btrfs_path *p) 558a5ed9182SOmar Sandoval { 559a5ed9182SOmar Sandoval struct btrfs_key key; 560a5ed9182SOmar Sandoval 561a5ed9182SOmar Sandoval if (p->slots[0] + 1 < btrfs_header_nritems(p->nodes[0])) { 562a5ed9182SOmar Sandoval p->slots[0]++; 563a5ed9182SOmar Sandoval return 0; 564a5ed9182SOmar Sandoval } 565a5ed9182SOmar Sandoval 566a5ed9182SOmar Sandoval btrfs_item_key_to_cpu(p->nodes[0], &key, p->slots[0]); 567a5ed9182SOmar Sandoval btrfs_release_path(p); 568a5ed9182SOmar Sandoval 569a5ed9182SOmar Sandoval key.objectid += key.offset; 570a5ed9182SOmar Sandoval key.type = (u8)-1; 571a5ed9182SOmar Sandoval key.offset = (u64)-1; 572a5ed9182SOmar Sandoval 573a5ed9182SOmar Sandoval return btrfs_search_prev_slot(trans, root, &key, p, 0, 1); 574a5ed9182SOmar Sandoval } 575a5ed9182SOmar Sandoval 576a5ed9182SOmar Sandoval /* 577a5ed9182SOmar Sandoval * If remove is 1, then we are removing free space, thus clearing bits in the 578a5ed9182SOmar Sandoval * bitmap. If remove is 0, then we are adding free space, thus setting bits in 579a5ed9182SOmar Sandoval * the bitmap. 580a5ed9182SOmar Sandoval */ 581a5ed9182SOmar Sandoval static int modify_free_space_bitmap(struct btrfs_trans_handle *trans, 582a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info, 583a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group, 584a5ed9182SOmar Sandoval struct btrfs_path *path, 585a5ed9182SOmar Sandoval u64 start, u64 size, int remove) 586a5ed9182SOmar Sandoval { 587a5ed9182SOmar Sandoval struct btrfs_root *root = fs_info->free_space_root; 588a5ed9182SOmar Sandoval struct btrfs_key key; 589a5ed9182SOmar Sandoval u64 end = start + size; 590a5ed9182SOmar Sandoval u64 cur_start, cur_size; 591a5ed9182SOmar Sandoval int prev_bit, next_bit; 592a5ed9182SOmar Sandoval int new_extents; 593a5ed9182SOmar Sandoval int ret; 594a5ed9182SOmar Sandoval 595a5ed9182SOmar Sandoval /* 596a5ed9182SOmar Sandoval * Read the bit for the block immediately before the extent of space if 597a5ed9182SOmar Sandoval * that block is within the block group. 598a5ed9182SOmar Sandoval */ 599a5ed9182SOmar Sandoval if (start > block_group->key.objectid) { 600da17066cSJeff Mahoney u64 prev_block = start - block_group->fs_info->sectorsize; 601a5ed9182SOmar Sandoval 602a5ed9182SOmar Sandoval key.objectid = prev_block; 603a5ed9182SOmar Sandoval key.type = (u8)-1; 604a5ed9182SOmar Sandoval key.offset = (u64)-1; 605a5ed9182SOmar Sandoval 606a5ed9182SOmar Sandoval ret = btrfs_search_prev_slot(trans, root, &key, path, 0, 1); 607a5ed9182SOmar Sandoval if (ret) 608a5ed9182SOmar Sandoval goto out; 609a5ed9182SOmar Sandoval 610a5ed9182SOmar Sandoval prev_bit = free_space_test_bit(block_group, path, prev_block); 611a5ed9182SOmar Sandoval 612a5ed9182SOmar Sandoval /* The previous block may have been in the previous bitmap. */ 613a5ed9182SOmar Sandoval btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 614a5ed9182SOmar Sandoval if (start >= key.objectid + key.offset) { 615a5ed9182SOmar Sandoval ret = free_space_next_bitmap(trans, root, path); 616a5ed9182SOmar Sandoval if (ret) 617a5ed9182SOmar Sandoval goto out; 618a5ed9182SOmar Sandoval } 619a5ed9182SOmar Sandoval } else { 620a5ed9182SOmar Sandoval key.objectid = start; 621a5ed9182SOmar Sandoval key.type = (u8)-1; 622a5ed9182SOmar Sandoval key.offset = (u64)-1; 623a5ed9182SOmar Sandoval 624a5ed9182SOmar Sandoval ret = btrfs_search_prev_slot(trans, root, &key, path, 0, 1); 625a5ed9182SOmar Sandoval if (ret) 626a5ed9182SOmar Sandoval goto out; 627a5ed9182SOmar Sandoval 628a5ed9182SOmar Sandoval prev_bit = -1; 629a5ed9182SOmar Sandoval } 630a5ed9182SOmar Sandoval 631a5ed9182SOmar Sandoval /* 632a5ed9182SOmar Sandoval * Iterate over all of the bitmaps overlapped by the extent of space, 633a5ed9182SOmar Sandoval * clearing/setting bits as required. 634a5ed9182SOmar Sandoval */ 635a5ed9182SOmar Sandoval cur_start = start; 636a5ed9182SOmar Sandoval cur_size = size; 637a5ed9182SOmar Sandoval while (1) { 638a5ed9182SOmar Sandoval free_space_set_bits(block_group, path, &cur_start, &cur_size, 639a5ed9182SOmar Sandoval !remove); 640a5ed9182SOmar Sandoval if (cur_size == 0) 641a5ed9182SOmar Sandoval break; 642a5ed9182SOmar Sandoval ret = free_space_next_bitmap(trans, root, path); 643a5ed9182SOmar Sandoval if (ret) 644a5ed9182SOmar Sandoval goto out; 645a5ed9182SOmar Sandoval } 646a5ed9182SOmar Sandoval 647a5ed9182SOmar Sandoval /* 648a5ed9182SOmar Sandoval * Read the bit for the block immediately after the extent of space if 649a5ed9182SOmar Sandoval * that block is within the block group. 650a5ed9182SOmar Sandoval */ 651a5ed9182SOmar Sandoval if (end < block_group->key.objectid + block_group->key.offset) { 652a5ed9182SOmar Sandoval /* The next block may be in the next bitmap. */ 653a5ed9182SOmar Sandoval btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 654a5ed9182SOmar Sandoval if (end >= key.objectid + key.offset) { 655a5ed9182SOmar Sandoval ret = free_space_next_bitmap(trans, root, path); 656a5ed9182SOmar Sandoval if (ret) 657a5ed9182SOmar Sandoval goto out; 658a5ed9182SOmar Sandoval } 659a5ed9182SOmar Sandoval 660a5ed9182SOmar Sandoval next_bit = free_space_test_bit(block_group, path, end); 661a5ed9182SOmar Sandoval } else { 662a5ed9182SOmar Sandoval next_bit = -1; 663a5ed9182SOmar Sandoval } 664a5ed9182SOmar Sandoval 665a5ed9182SOmar Sandoval if (remove) { 666a5ed9182SOmar Sandoval new_extents = -1; 667a5ed9182SOmar Sandoval if (prev_bit == 1) { 668a5ed9182SOmar Sandoval /* Leftover on the left. */ 669a5ed9182SOmar Sandoval new_extents++; 670a5ed9182SOmar Sandoval } 671a5ed9182SOmar Sandoval if (next_bit == 1) { 672a5ed9182SOmar Sandoval /* Leftover on the right. */ 673a5ed9182SOmar Sandoval new_extents++; 674a5ed9182SOmar Sandoval } 675a5ed9182SOmar Sandoval } else { 676a5ed9182SOmar Sandoval new_extents = 1; 677a5ed9182SOmar Sandoval if (prev_bit == 1) { 678a5ed9182SOmar Sandoval /* Merging with neighbor on the left. */ 679a5ed9182SOmar Sandoval new_extents--; 680a5ed9182SOmar Sandoval } 681a5ed9182SOmar Sandoval if (next_bit == 1) { 682a5ed9182SOmar Sandoval /* Merging with neighbor on the right. */ 683a5ed9182SOmar Sandoval new_extents--; 684a5ed9182SOmar Sandoval } 685a5ed9182SOmar Sandoval } 686a5ed9182SOmar Sandoval 687a5ed9182SOmar Sandoval btrfs_release_path(path); 688a5ed9182SOmar Sandoval ret = update_free_space_extent_count(trans, fs_info, block_group, path, 689a5ed9182SOmar Sandoval new_extents); 690a5ed9182SOmar Sandoval 691a5ed9182SOmar Sandoval out: 692a5ed9182SOmar Sandoval return ret; 693a5ed9182SOmar Sandoval } 694a5ed9182SOmar Sandoval 695a5ed9182SOmar Sandoval static int remove_free_space_extent(struct btrfs_trans_handle *trans, 696a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info, 697a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group, 698a5ed9182SOmar Sandoval struct btrfs_path *path, 699a5ed9182SOmar Sandoval u64 start, u64 size) 700a5ed9182SOmar Sandoval { 701a5ed9182SOmar Sandoval struct btrfs_root *root = fs_info->free_space_root; 702a5ed9182SOmar Sandoval struct btrfs_key key; 703a5ed9182SOmar Sandoval u64 found_start, found_end; 704a5ed9182SOmar Sandoval u64 end = start + size; 705a5ed9182SOmar Sandoval int new_extents = -1; 706a5ed9182SOmar Sandoval int ret; 707a5ed9182SOmar Sandoval 708a5ed9182SOmar Sandoval key.objectid = start; 709a5ed9182SOmar Sandoval key.type = (u8)-1; 710a5ed9182SOmar Sandoval key.offset = (u64)-1; 711a5ed9182SOmar Sandoval 712a5ed9182SOmar Sandoval ret = btrfs_search_prev_slot(trans, root, &key, path, -1, 1); 713a5ed9182SOmar Sandoval if (ret) 714a5ed9182SOmar Sandoval goto out; 715a5ed9182SOmar Sandoval 716a5ed9182SOmar Sandoval btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 717a5ed9182SOmar Sandoval 718a5ed9182SOmar Sandoval ASSERT(key.type == BTRFS_FREE_SPACE_EXTENT_KEY); 719a5ed9182SOmar Sandoval 720a5ed9182SOmar Sandoval found_start = key.objectid; 721a5ed9182SOmar Sandoval found_end = key.objectid + key.offset; 722a5ed9182SOmar Sandoval ASSERT(start >= found_start && end <= found_end); 723a5ed9182SOmar Sandoval 724a5ed9182SOmar Sandoval /* 725a5ed9182SOmar Sandoval * Okay, now that we've found the free space extent which contains the 726a5ed9182SOmar Sandoval * free space that we are removing, there are four cases: 727a5ed9182SOmar Sandoval * 728a5ed9182SOmar Sandoval * 1. We're using the whole extent: delete the key we found and 729a5ed9182SOmar Sandoval * decrement the free space extent count. 730a5ed9182SOmar Sandoval * 2. We are using part of the extent starting at the beginning: delete 731a5ed9182SOmar Sandoval * the key we found and insert a new key representing the leftover at 732a5ed9182SOmar Sandoval * the end. There is no net change in the number of extents. 733a5ed9182SOmar Sandoval * 3. We are using part of the extent ending at the end: delete the key 734a5ed9182SOmar Sandoval * we found and insert a new key representing the leftover at the 735a5ed9182SOmar Sandoval * beginning. There is no net change in the number of extents. 736a5ed9182SOmar Sandoval * 4. We are using part of the extent in the middle: delete the key we 737a5ed9182SOmar Sandoval * found and insert two new keys representing the leftovers on each 738a5ed9182SOmar Sandoval * side. Where we used to have one extent, we now have two, so increment 739a5ed9182SOmar Sandoval * the extent count. We may need to convert the block group to bitmaps 740a5ed9182SOmar Sandoval * as a result. 741a5ed9182SOmar Sandoval */ 742a5ed9182SOmar Sandoval 743a5ed9182SOmar Sandoval /* Delete the existing key (cases 1-4). */ 744a5ed9182SOmar Sandoval ret = btrfs_del_item(trans, root, path); 745a5ed9182SOmar Sandoval if (ret) 746a5ed9182SOmar Sandoval goto out; 747a5ed9182SOmar Sandoval 748a5ed9182SOmar Sandoval /* Add a key for leftovers at the beginning (cases 3 and 4). */ 749a5ed9182SOmar Sandoval if (start > found_start) { 750a5ed9182SOmar Sandoval key.objectid = found_start; 751a5ed9182SOmar Sandoval key.type = BTRFS_FREE_SPACE_EXTENT_KEY; 752a5ed9182SOmar Sandoval key.offset = start - found_start; 753a5ed9182SOmar Sandoval 754a5ed9182SOmar Sandoval btrfs_release_path(path); 755a5ed9182SOmar Sandoval ret = btrfs_insert_empty_item(trans, root, path, &key, 0); 756a5ed9182SOmar Sandoval if (ret) 757a5ed9182SOmar Sandoval goto out; 758a5ed9182SOmar Sandoval new_extents++; 759a5ed9182SOmar Sandoval } 760a5ed9182SOmar Sandoval 761a5ed9182SOmar Sandoval /* Add a key for leftovers at the end (cases 2 and 4). */ 762a5ed9182SOmar Sandoval if (end < found_end) { 763a5ed9182SOmar Sandoval key.objectid = end; 764a5ed9182SOmar Sandoval key.type = BTRFS_FREE_SPACE_EXTENT_KEY; 765a5ed9182SOmar Sandoval key.offset = found_end - end; 766a5ed9182SOmar Sandoval 767a5ed9182SOmar Sandoval btrfs_release_path(path); 768a5ed9182SOmar Sandoval ret = btrfs_insert_empty_item(trans, root, path, &key, 0); 769a5ed9182SOmar Sandoval if (ret) 770a5ed9182SOmar Sandoval goto out; 771a5ed9182SOmar Sandoval new_extents++; 772a5ed9182SOmar Sandoval } 773a5ed9182SOmar Sandoval 774a5ed9182SOmar Sandoval btrfs_release_path(path); 775a5ed9182SOmar Sandoval ret = update_free_space_extent_count(trans, fs_info, block_group, path, 776a5ed9182SOmar Sandoval new_extents); 777a5ed9182SOmar Sandoval 778a5ed9182SOmar Sandoval out: 779a5ed9182SOmar Sandoval return ret; 780a5ed9182SOmar Sandoval } 781a5ed9182SOmar Sandoval 782a5ed9182SOmar Sandoval int __remove_from_free_space_tree(struct btrfs_trans_handle *trans, 783a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info, 784a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group, 785a5ed9182SOmar Sandoval struct btrfs_path *path, u64 start, u64 size) 786a5ed9182SOmar Sandoval { 787a5ed9182SOmar Sandoval struct btrfs_free_space_info *info; 788a5ed9182SOmar Sandoval u32 flags; 789a5ed9182SOmar Sandoval int ret; 790a5ed9182SOmar Sandoval 791a5ed9182SOmar Sandoval if (block_group->needs_free_space) { 7929a7e0f92SNikolay Borisov ret = __add_block_group_free_space(trans, block_group, path); 793a5ed9182SOmar Sandoval if (ret) 794a5ed9182SOmar Sandoval return ret; 795a5ed9182SOmar Sandoval } 796a5ed9182SOmar Sandoval 797a5ed9182SOmar Sandoval info = search_free_space_info(NULL, fs_info, block_group, path, 0); 798a5ed9182SOmar Sandoval if (IS_ERR(info)) 799a5ed9182SOmar Sandoval return PTR_ERR(info); 800a5ed9182SOmar Sandoval flags = btrfs_free_space_flags(path->nodes[0], info); 801a5ed9182SOmar Sandoval btrfs_release_path(path); 802a5ed9182SOmar Sandoval 803a5ed9182SOmar Sandoval if (flags & BTRFS_FREE_SPACE_USING_BITMAPS) { 804a5ed9182SOmar Sandoval return modify_free_space_bitmap(trans, fs_info, block_group, 805a5ed9182SOmar Sandoval path, start, size, 1); 806a5ed9182SOmar Sandoval } else { 807a5ed9182SOmar Sandoval return remove_free_space_extent(trans, fs_info, block_group, 808a5ed9182SOmar Sandoval path, start, size); 809a5ed9182SOmar Sandoval } 810a5ed9182SOmar Sandoval } 811a5ed9182SOmar Sandoval 812a5ed9182SOmar Sandoval int remove_from_free_space_tree(struct btrfs_trans_handle *trans, 813a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info, 814a5ed9182SOmar Sandoval u64 start, u64 size) 815a5ed9182SOmar Sandoval { 816a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group; 817a5ed9182SOmar Sandoval struct btrfs_path *path; 818a5ed9182SOmar Sandoval int ret; 819a5ed9182SOmar Sandoval 820a5ed9182SOmar Sandoval if (!btrfs_fs_compat_ro(fs_info, FREE_SPACE_TREE)) 821a5ed9182SOmar Sandoval return 0; 822a5ed9182SOmar Sandoval 823a5ed9182SOmar Sandoval path = btrfs_alloc_path(); 824a5ed9182SOmar Sandoval if (!path) { 825a5ed9182SOmar Sandoval ret = -ENOMEM; 826a5ed9182SOmar Sandoval goto out; 827a5ed9182SOmar Sandoval } 828a5ed9182SOmar Sandoval 829a5ed9182SOmar Sandoval block_group = btrfs_lookup_block_group(fs_info, start); 830a5ed9182SOmar Sandoval if (!block_group) { 831a5ed9182SOmar Sandoval ASSERT(0); 832a5ed9182SOmar Sandoval ret = -ENOENT; 833a5ed9182SOmar Sandoval goto out; 834a5ed9182SOmar Sandoval } 835a5ed9182SOmar Sandoval 836a5ed9182SOmar Sandoval mutex_lock(&block_group->free_space_lock); 837a5ed9182SOmar Sandoval ret = __remove_from_free_space_tree(trans, fs_info, block_group, path, 838a5ed9182SOmar Sandoval start, size); 839a5ed9182SOmar Sandoval mutex_unlock(&block_group->free_space_lock); 840a5ed9182SOmar Sandoval 841a5ed9182SOmar Sandoval btrfs_put_block_group(block_group); 842a5ed9182SOmar Sandoval out: 843a5ed9182SOmar Sandoval btrfs_free_path(path); 844a5ed9182SOmar Sandoval if (ret) 84566642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 846a5ed9182SOmar Sandoval return ret; 847a5ed9182SOmar Sandoval } 848a5ed9182SOmar Sandoval 849a5ed9182SOmar Sandoval static int add_free_space_extent(struct btrfs_trans_handle *trans, 850a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info, 851a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group, 852a5ed9182SOmar Sandoval struct btrfs_path *path, 853a5ed9182SOmar Sandoval u64 start, u64 size) 854a5ed9182SOmar Sandoval { 855a5ed9182SOmar Sandoval struct btrfs_root *root = fs_info->free_space_root; 856a5ed9182SOmar Sandoval struct btrfs_key key, new_key; 857a5ed9182SOmar Sandoval u64 found_start, found_end; 858a5ed9182SOmar Sandoval u64 end = start + size; 859a5ed9182SOmar Sandoval int new_extents = 1; 860a5ed9182SOmar Sandoval int ret; 861a5ed9182SOmar Sandoval 862a5ed9182SOmar Sandoval /* 863a5ed9182SOmar Sandoval * We are adding a new extent of free space, but we need to merge 864a5ed9182SOmar Sandoval * extents. There are four cases here: 865a5ed9182SOmar Sandoval * 866a5ed9182SOmar Sandoval * 1. The new extent does not have any immediate neighbors to merge 867a5ed9182SOmar Sandoval * with: add the new key and increment the free space extent count. We 868a5ed9182SOmar Sandoval * may need to convert the block group to bitmaps as a result. 869a5ed9182SOmar Sandoval * 2. The new extent has an immediate neighbor before it: remove the 870a5ed9182SOmar Sandoval * previous key and insert a new key combining both of them. There is no 871a5ed9182SOmar Sandoval * net change in the number of extents. 872a5ed9182SOmar Sandoval * 3. The new extent has an immediate neighbor after it: remove the next 873a5ed9182SOmar Sandoval * key and insert a new key combining both of them. There is no net 874a5ed9182SOmar Sandoval * change in the number of extents. 875a5ed9182SOmar Sandoval * 4. The new extent has immediate neighbors on both sides: remove both 876a5ed9182SOmar Sandoval * of the keys and insert a new key combining all of them. Where we used 877a5ed9182SOmar Sandoval * to have two extents, we now have one, so decrement the extent count. 878a5ed9182SOmar Sandoval */ 879a5ed9182SOmar Sandoval 880a5ed9182SOmar Sandoval new_key.objectid = start; 881a5ed9182SOmar Sandoval new_key.type = BTRFS_FREE_SPACE_EXTENT_KEY; 882a5ed9182SOmar Sandoval new_key.offset = size; 883a5ed9182SOmar Sandoval 884a5ed9182SOmar Sandoval /* Search for a neighbor on the left. */ 885a5ed9182SOmar Sandoval if (start == block_group->key.objectid) 886a5ed9182SOmar Sandoval goto right; 887a5ed9182SOmar Sandoval key.objectid = start - 1; 888a5ed9182SOmar Sandoval key.type = (u8)-1; 889a5ed9182SOmar Sandoval key.offset = (u64)-1; 890a5ed9182SOmar Sandoval 891a5ed9182SOmar Sandoval ret = btrfs_search_prev_slot(trans, root, &key, path, -1, 1); 892a5ed9182SOmar Sandoval if (ret) 893a5ed9182SOmar Sandoval goto out; 894a5ed9182SOmar Sandoval 895a5ed9182SOmar Sandoval btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 896a5ed9182SOmar Sandoval 897a5ed9182SOmar Sandoval if (key.type != BTRFS_FREE_SPACE_EXTENT_KEY) { 898a5ed9182SOmar Sandoval ASSERT(key.type == BTRFS_FREE_SPACE_INFO_KEY); 899a5ed9182SOmar Sandoval btrfs_release_path(path); 900a5ed9182SOmar Sandoval goto right; 901a5ed9182SOmar Sandoval } 902a5ed9182SOmar Sandoval 903a5ed9182SOmar Sandoval found_start = key.objectid; 904a5ed9182SOmar Sandoval found_end = key.objectid + key.offset; 905a5ed9182SOmar Sandoval ASSERT(found_start >= block_group->key.objectid && 906a5ed9182SOmar Sandoval found_end > block_group->key.objectid); 907a5ed9182SOmar Sandoval ASSERT(found_start < start && found_end <= start); 908a5ed9182SOmar Sandoval 909a5ed9182SOmar Sandoval /* 910a5ed9182SOmar Sandoval * Delete the neighbor on the left and absorb it into the new key (cases 911a5ed9182SOmar Sandoval * 2 and 4). 912a5ed9182SOmar Sandoval */ 913a5ed9182SOmar Sandoval if (found_end == start) { 914a5ed9182SOmar Sandoval ret = btrfs_del_item(trans, root, path); 915a5ed9182SOmar Sandoval if (ret) 916a5ed9182SOmar Sandoval goto out; 917a5ed9182SOmar Sandoval new_key.objectid = found_start; 918a5ed9182SOmar Sandoval new_key.offset += key.offset; 919a5ed9182SOmar Sandoval new_extents--; 920a5ed9182SOmar Sandoval } 921a5ed9182SOmar Sandoval btrfs_release_path(path); 922a5ed9182SOmar Sandoval 923a5ed9182SOmar Sandoval right: 924a5ed9182SOmar Sandoval /* Search for a neighbor on the right. */ 925a5ed9182SOmar Sandoval if (end == block_group->key.objectid + block_group->key.offset) 926a5ed9182SOmar Sandoval goto insert; 927a5ed9182SOmar Sandoval key.objectid = end; 928a5ed9182SOmar Sandoval key.type = (u8)-1; 929a5ed9182SOmar Sandoval key.offset = (u64)-1; 930a5ed9182SOmar Sandoval 931a5ed9182SOmar Sandoval ret = btrfs_search_prev_slot(trans, root, &key, path, -1, 1); 932a5ed9182SOmar Sandoval if (ret) 933a5ed9182SOmar Sandoval goto out; 934a5ed9182SOmar Sandoval 935a5ed9182SOmar Sandoval btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 936a5ed9182SOmar Sandoval 937a5ed9182SOmar Sandoval if (key.type != BTRFS_FREE_SPACE_EXTENT_KEY) { 938a5ed9182SOmar Sandoval ASSERT(key.type == BTRFS_FREE_SPACE_INFO_KEY); 939a5ed9182SOmar Sandoval btrfs_release_path(path); 940a5ed9182SOmar Sandoval goto insert; 941a5ed9182SOmar Sandoval } 942a5ed9182SOmar Sandoval 943a5ed9182SOmar Sandoval found_start = key.objectid; 944a5ed9182SOmar Sandoval found_end = key.objectid + key.offset; 945a5ed9182SOmar Sandoval ASSERT(found_start >= block_group->key.objectid && 946a5ed9182SOmar Sandoval found_end > block_group->key.objectid); 947a5ed9182SOmar Sandoval ASSERT((found_start < start && found_end <= start) || 948a5ed9182SOmar Sandoval (found_start >= end && found_end > end)); 949a5ed9182SOmar Sandoval 950a5ed9182SOmar Sandoval /* 951a5ed9182SOmar Sandoval * Delete the neighbor on the right and absorb it into the new key 952a5ed9182SOmar Sandoval * (cases 3 and 4). 953a5ed9182SOmar Sandoval */ 954a5ed9182SOmar Sandoval if (found_start == end) { 955a5ed9182SOmar Sandoval ret = btrfs_del_item(trans, root, path); 956a5ed9182SOmar Sandoval if (ret) 957a5ed9182SOmar Sandoval goto out; 958a5ed9182SOmar Sandoval new_key.offset += key.offset; 959a5ed9182SOmar Sandoval new_extents--; 960a5ed9182SOmar Sandoval } 961a5ed9182SOmar Sandoval btrfs_release_path(path); 962a5ed9182SOmar Sandoval 963a5ed9182SOmar Sandoval insert: 964a5ed9182SOmar Sandoval /* Insert the new key (cases 1-4). */ 965a5ed9182SOmar Sandoval ret = btrfs_insert_empty_item(trans, root, path, &new_key, 0); 966a5ed9182SOmar Sandoval if (ret) 967a5ed9182SOmar Sandoval goto out; 968a5ed9182SOmar Sandoval 969a5ed9182SOmar Sandoval btrfs_release_path(path); 970a5ed9182SOmar Sandoval ret = update_free_space_extent_count(trans, fs_info, block_group, path, 971a5ed9182SOmar Sandoval new_extents); 972a5ed9182SOmar Sandoval 973a5ed9182SOmar Sandoval out: 974a5ed9182SOmar Sandoval return ret; 975a5ed9182SOmar Sandoval } 976a5ed9182SOmar Sandoval 977a5ed9182SOmar Sandoval int __add_to_free_space_tree(struct btrfs_trans_handle *trans, 978a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group, 979a5ed9182SOmar Sandoval struct btrfs_path *path, u64 start, u64 size) 980a5ed9182SOmar Sandoval { 9812d5cffa1SNikolay Borisov struct btrfs_fs_info *fs_info = trans->fs_info; 982a5ed9182SOmar Sandoval struct btrfs_free_space_info *info; 983a5ed9182SOmar Sandoval u32 flags; 984a5ed9182SOmar Sandoval int ret; 985a5ed9182SOmar Sandoval 986a5ed9182SOmar Sandoval if (block_group->needs_free_space) { 9879a7e0f92SNikolay Borisov ret = __add_block_group_free_space(trans, block_group, path); 988a5ed9182SOmar Sandoval if (ret) 989a5ed9182SOmar Sandoval return ret; 990a5ed9182SOmar Sandoval } 991a5ed9182SOmar Sandoval 992a5ed9182SOmar Sandoval info = search_free_space_info(NULL, fs_info, block_group, path, 0); 993a5ed9182SOmar Sandoval if (IS_ERR(info)) 994a5ed9182SOmar Sandoval return PTR_ERR(info); 995a5ed9182SOmar Sandoval flags = btrfs_free_space_flags(path->nodes[0], info); 996a5ed9182SOmar Sandoval btrfs_release_path(path); 997a5ed9182SOmar Sandoval 998a5ed9182SOmar Sandoval if (flags & BTRFS_FREE_SPACE_USING_BITMAPS) { 999a5ed9182SOmar Sandoval return modify_free_space_bitmap(trans, fs_info, block_group, 1000a5ed9182SOmar Sandoval path, start, size, 0); 1001a5ed9182SOmar Sandoval } else { 1002a5ed9182SOmar Sandoval return add_free_space_extent(trans, fs_info, block_group, path, 1003a5ed9182SOmar Sandoval start, size); 1004a5ed9182SOmar Sandoval } 1005a5ed9182SOmar Sandoval } 1006a5ed9182SOmar Sandoval 1007a5ed9182SOmar Sandoval int add_to_free_space_tree(struct btrfs_trans_handle *trans, 1008a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info, 1009a5ed9182SOmar Sandoval u64 start, u64 size) 1010a5ed9182SOmar Sandoval { 1011a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group; 1012a5ed9182SOmar Sandoval struct btrfs_path *path; 1013a5ed9182SOmar Sandoval int ret; 1014a5ed9182SOmar Sandoval 1015a5ed9182SOmar Sandoval if (!btrfs_fs_compat_ro(fs_info, FREE_SPACE_TREE)) 1016a5ed9182SOmar Sandoval return 0; 1017a5ed9182SOmar Sandoval 1018a5ed9182SOmar Sandoval path = btrfs_alloc_path(); 1019a5ed9182SOmar Sandoval if (!path) { 1020a5ed9182SOmar Sandoval ret = -ENOMEM; 1021a5ed9182SOmar Sandoval goto out; 1022a5ed9182SOmar Sandoval } 1023a5ed9182SOmar Sandoval 1024a5ed9182SOmar Sandoval block_group = btrfs_lookup_block_group(fs_info, start); 1025a5ed9182SOmar Sandoval if (!block_group) { 1026a5ed9182SOmar Sandoval ASSERT(0); 1027a5ed9182SOmar Sandoval ret = -ENOENT; 1028a5ed9182SOmar Sandoval goto out; 1029a5ed9182SOmar Sandoval } 1030a5ed9182SOmar Sandoval 1031a5ed9182SOmar Sandoval mutex_lock(&block_group->free_space_lock); 10322d5cffa1SNikolay Borisov ret = __add_to_free_space_tree(trans, block_group, path, start, size); 1033a5ed9182SOmar Sandoval mutex_unlock(&block_group->free_space_lock); 1034a5ed9182SOmar Sandoval 1035a5ed9182SOmar Sandoval btrfs_put_block_group(block_group); 1036a5ed9182SOmar Sandoval out: 1037a5ed9182SOmar Sandoval btrfs_free_path(path); 1038a5ed9182SOmar Sandoval if (ret) 103966642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 1040a5ed9182SOmar Sandoval return ret; 1041a5ed9182SOmar Sandoval } 1042a5ed9182SOmar Sandoval 1043a5ed9182SOmar Sandoval /* 1044a5ed9182SOmar Sandoval * Populate the free space tree by walking the extent tree. Operations on the 1045a5ed9182SOmar Sandoval * extent tree that happen as a result of writes to the free space tree will go 1046a5ed9182SOmar Sandoval * through the normal add/remove hooks. 1047a5ed9182SOmar Sandoval */ 1048a5ed9182SOmar Sandoval static int populate_free_space_tree(struct btrfs_trans_handle *trans, 1049a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info, 1050a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group) 1051a5ed9182SOmar Sandoval { 1052a5ed9182SOmar Sandoval struct btrfs_root *extent_root = fs_info->extent_root; 1053a5ed9182SOmar Sandoval struct btrfs_path *path, *path2; 1054a5ed9182SOmar Sandoval struct btrfs_key key; 1055a5ed9182SOmar Sandoval u64 start, end; 1056a5ed9182SOmar Sandoval int ret; 1057a5ed9182SOmar Sandoval 1058a5ed9182SOmar Sandoval path = btrfs_alloc_path(); 1059a5ed9182SOmar Sandoval if (!path) 1060a5ed9182SOmar Sandoval return -ENOMEM; 1061019599adSGu Jinxiang path->reada = READA_FORWARD; 1062a5ed9182SOmar Sandoval 1063a5ed9182SOmar Sandoval path2 = btrfs_alloc_path(); 1064a5ed9182SOmar Sandoval if (!path2) { 1065a5ed9182SOmar Sandoval btrfs_free_path(path); 1066a5ed9182SOmar Sandoval return -ENOMEM; 1067a5ed9182SOmar Sandoval } 1068a5ed9182SOmar Sandoval 106966afee18SNikolay Borisov ret = add_new_free_space_info(trans, block_group, path2); 1070a5ed9182SOmar Sandoval if (ret) 1071a5ed9182SOmar Sandoval goto out; 1072a5ed9182SOmar Sandoval 1073511711afSChris Mason mutex_lock(&block_group->free_space_lock); 1074511711afSChris Mason 1075a5ed9182SOmar Sandoval /* 1076a5ed9182SOmar Sandoval * Iterate through all of the extent and metadata items in this block 1077a5ed9182SOmar Sandoval * group, adding the free space between them and the free space at the 1078a5ed9182SOmar Sandoval * end. Note that EXTENT_ITEM and METADATA_ITEM are less than 1079a5ed9182SOmar Sandoval * BLOCK_GROUP_ITEM, so an extent may precede the block group that it's 1080a5ed9182SOmar Sandoval * contained in. 1081a5ed9182SOmar Sandoval */ 1082a5ed9182SOmar Sandoval key.objectid = block_group->key.objectid; 1083a5ed9182SOmar Sandoval key.type = BTRFS_EXTENT_ITEM_KEY; 1084a5ed9182SOmar Sandoval key.offset = 0; 1085a5ed9182SOmar Sandoval 1086a5ed9182SOmar Sandoval ret = btrfs_search_slot_for_read(extent_root, &key, path, 1, 0); 1087a5ed9182SOmar Sandoval if (ret < 0) 1088511711afSChris Mason goto out_locked; 1089a5ed9182SOmar Sandoval ASSERT(ret == 0); 1090a5ed9182SOmar Sandoval 1091a5ed9182SOmar Sandoval start = block_group->key.objectid; 1092a5ed9182SOmar Sandoval end = block_group->key.objectid + block_group->key.offset; 1093a5ed9182SOmar Sandoval while (1) { 1094a5ed9182SOmar Sandoval btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 1095a5ed9182SOmar Sandoval 1096a5ed9182SOmar Sandoval if (key.type == BTRFS_EXTENT_ITEM_KEY || 1097a5ed9182SOmar Sandoval key.type == BTRFS_METADATA_ITEM_KEY) { 1098a5ed9182SOmar Sandoval if (key.objectid >= end) 1099a5ed9182SOmar Sandoval break; 1100a5ed9182SOmar Sandoval 1101a5ed9182SOmar Sandoval if (start < key.objectid) { 11022d5cffa1SNikolay Borisov ret = __add_to_free_space_tree(trans, 1103a5ed9182SOmar Sandoval block_group, 1104a5ed9182SOmar Sandoval path2, start, 1105a5ed9182SOmar Sandoval key.objectid - 1106a5ed9182SOmar Sandoval start); 1107a5ed9182SOmar Sandoval if (ret) 1108511711afSChris Mason goto out_locked; 1109a5ed9182SOmar Sandoval } 1110a5ed9182SOmar Sandoval start = key.objectid; 1111a5ed9182SOmar Sandoval if (key.type == BTRFS_METADATA_ITEM_KEY) 1112da17066cSJeff Mahoney start += fs_info->nodesize; 1113a5ed9182SOmar Sandoval else 1114a5ed9182SOmar Sandoval start += key.offset; 1115a5ed9182SOmar Sandoval } else if (key.type == BTRFS_BLOCK_GROUP_ITEM_KEY) { 1116a5ed9182SOmar Sandoval if (key.objectid != block_group->key.objectid) 1117a5ed9182SOmar Sandoval break; 1118a5ed9182SOmar Sandoval } 1119a5ed9182SOmar Sandoval 1120a5ed9182SOmar Sandoval ret = btrfs_next_item(extent_root, path); 1121a5ed9182SOmar Sandoval if (ret < 0) 1122511711afSChris Mason goto out_locked; 1123a5ed9182SOmar Sandoval if (ret) 1124a5ed9182SOmar Sandoval break; 1125a5ed9182SOmar Sandoval } 1126a5ed9182SOmar Sandoval if (start < end) { 11272d5cffa1SNikolay Borisov ret = __add_to_free_space_tree(trans, block_group, path2, 11282d5cffa1SNikolay Borisov start, end - start); 1129a5ed9182SOmar Sandoval if (ret) 1130511711afSChris Mason goto out_locked; 1131a5ed9182SOmar Sandoval } 1132a5ed9182SOmar Sandoval 1133a5ed9182SOmar Sandoval ret = 0; 1134511711afSChris Mason out_locked: 1135511711afSChris Mason mutex_unlock(&block_group->free_space_lock); 1136a5ed9182SOmar Sandoval out: 1137a5ed9182SOmar Sandoval btrfs_free_path(path2); 1138a5ed9182SOmar Sandoval btrfs_free_path(path); 1139a5ed9182SOmar Sandoval return ret; 1140a5ed9182SOmar Sandoval } 1141a5ed9182SOmar Sandoval 1142a5ed9182SOmar Sandoval int btrfs_create_free_space_tree(struct btrfs_fs_info *fs_info) 1143a5ed9182SOmar Sandoval { 1144a5ed9182SOmar Sandoval struct btrfs_trans_handle *trans; 1145a5ed9182SOmar Sandoval struct btrfs_root *tree_root = fs_info->tree_root; 1146a5ed9182SOmar Sandoval struct btrfs_root *free_space_root; 1147a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group; 1148a5ed9182SOmar Sandoval struct rb_node *node; 1149a5ed9182SOmar Sandoval int ret; 1150a5ed9182SOmar Sandoval 1151a5ed9182SOmar Sandoval trans = btrfs_start_transaction(tree_root, 0); 1152a5ed9182SOmar Sandoval if (IS_ERR(trans)) 1153a5ed9182SOmar Sandoval return PTR_ERR(trans); 1154a5ed9182SOmar Sandoval 1155afcdd129SJosef Bacik set_bit(BTRFS_FS_CREATING_FREE_SPACE_TREE, &fs_info->flags); 1156a5ed9182SOmar Sandoval free_space_root = btrfs_create_tree(trans, fs_info, 1157a5ed9182SOmar Sandoval BTRFS_FREE_SPACE_TREE_OBJECTID); 1158a5ed9182SOmar Sandoval if (IS_ERR(free_space_root)) { 1159a5ed9182SOmar Sandoval ret = PTR_ERR(free_space_root); 1160a5ed9182SOmar Sandoval goto abort; 1161a5ed9182SOmar Sandoval } 1162a5ed9182SOmar Sandoval fs_info->free_space_root = free_space_root; 1163a5ed9182SOmar Sandoval 1164a5ed9182SOmar Sandoval node = rb_first(&fs_info->block_group_cache_tree); 1165a5ed9182SOmar Sandoval while (node) { 1166a5ed9182SOmar Sandoval block_group = rb_entry(node, struct btrfs_block_group_cache, 1167a5ed9182SOmar Sandoval cache_node); 1168a5ed9182SOmar Sandoval ret = populate_free_space_tree(trans, fs_info, block_group); 1169a5ed9182SOmar Sandoval if (ret) 1170a5ed9182SOmar Sandoval goto abort; 1171a5ed9182SOmar Sandoval node = rb_next(node); 1172a5ed9182SOmar Sandoval } 1173a5ed9182SOmar Sandoval 1174a5ed9182SOmar Sandoval btrfs_set_fs_compat_ro(fs_info, FREE_SPACE_TREE); 11756675df31SOmar Sandoval btrfs_set_fs_compat_ro(fs_info, FREE_SPACE_TREE_VALID); 1176afcdd129SJosef Bacik clear_bit(BTRFS_FS_CREATING_FREE_SPACE_TREE, &fs_info->flags); 1177a5ed9182SOmar Sandoval 11780bef7109SSahil Kang return btrfs_commit_transaction(trans); 1179a5ed9182SOmar Sandoval 1180a5ed9182SOmar Sandoval abort: 1181afcdd129SJosef Bacik clear_bit(BTRFS_FS_CREATING_FREE_SPACE_TREE, &fs_info->flags); 118266642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 11833a45bb20SJeff Mahoney btrfs_end_transaction(trans); 1184a5ed9182SOmar Sandoval return ret; 1185a5ed9182SOmar Sandoval } 1186a5ed9182SOmar Sandoval 1187a5ed9182SOmar Sandoval static int clear_free_space_tree(struct btrfs_trans_handle *trans, 1188a5ed9182SOmar Sandoval struct btrfs_root *root) 1189a5ed9182SOmar Sandoval { 1190a5ed9182SOmar Sandoval struct btrfs_path *path; 1191a5ed9182SOmar Sandoval struct btrfs_key key; 1192a5ed9182SOmar Sandoval int nr; 1193a5ed9182SOmar Sandoval int ret; 1194a5ed9182SOmar Sandoval 1195a5ed9182SOmar Sandoval path = btrfs_alloc_path(); 1196a5ed9182SOmar Sandoval if (!path) 1197a5ed9182SOmar Sandoval return -ENOMEM; 1198a5ed9182SOmar Sandoval 1199a5ed9182SOmar Sandoval path->leave_spinning = 1; 1200a5ed9182SOmar Sandoval 1201a5ed9182SOmar Sandoval key.objectid = 0; 1202a5ed9182SOmar Sandoval key.type = 0; 1203a5ed9182SOmar Sandoval key.offset = 0; 1204a5ed9182SOmar Sandoval 1205a5ed9182SOmar Sandoval while (1) { 1206a5ed9182SOmar Sandoval ret = btrfs_search_slot(trans, root, &key, path, -1, 1); 1207a5ed9182SOmar Sandoval if (ret < 0) 1208a5ed9182SOmar Sandoval goto out; 1209a5ed9182SOmar Sandoval 1210a5ed9182SOmar Sandoval nr = btrfs_header_nritems(path->nodes[0]); 1211a5ed9182SOmar Sandoval if (!nr) 1212a5ed9182SOmar Sandoval break; 1213a5ed9182SOmar Sandoval 1214a5ed9182SOmar Sandoval path->slots[0] = 0; 1215a5ed9182SOmar Sandoval ret = btrfs_del_items(trans, root, path, 0, nr); 1216a5ed9182SOmar Sandoval if (ret) 1217a5ed9182SOmar Sandoval goto out; 1218a5ed9182SOmar Sandoval 1219a5ed9182SOmar Sandoval btrfs_release_path(path); 1220a5ed9182SOmar Sandoval } 1221a5ed9182SOmar Sandoval 1222a5ed9182SOmar Sandoval ret = 0; 1223a5ed9182SOmar Sandoval out: 1224a5ed9182SOmar Sandoval btrfs_free_path(path); 1225a5ed9182SOmar Sandoval return ret; 1226a5ed9182SOmar Sandoval } 1227a5ed9182SOmar Sandoval 1228a5ed9182SOmar Sandoval int btrfs_clear_free_space_tree(struct btrfs_fs_info *fs_info) 1229a5ed9182SOmar Sandoval { 1230a5ed9182SOmar Sandoval struct btrfs_trans_handle *trans; 1231a5ed9182SOmar Sandoval struct btrfs_root *tree_root = fs_info->tree_root; 1232a5ed9182SOmar Sandoval struct btrfs_root *free_space_root = fs_info->free_space_root; 1233a5ed9182SOmar Sandoval int ret; 1234a5ed9182SOmar Sandoval 1235a5ed9182SOmar Sandoval trans = btrfs_start_transaction(tree_root, 0); 1236a5ed9182SOmar Sandoval if (IS_ERR(trans)) 1237a5ed9182SOmar Sandoval return PTR_ERR(trans); 1238a5ed9182SOmar Sandoval 1239a5ed9182SOmar Sandoval btrfs_clear_fs_compat_ro(fs_info, FREE_SPACE_TREE); 12406675df31SOmar Sandoval btrfs_clear_fs_compat_ro(fs_info, FREE_SPACE_TREE_VALID); 1241a5ed9182SOmar Sandoval fs_info->free_space_root = NULL; 1242a5ed9182SOmar Sandoval 1243a5ed9182SOmar Sandoval ret = clear_free_space_tree(trans, free_space_root); 1244a5ed9182SOmar Sandoval if (ret) 1245a5ed9182SOmar Sandoval goto abort; 1246a5ed9182SOmar Sandoval 12471cd5447eSJeff Mahoney ret = btrfs_del_root(trans, fs_info, &free_space_root->root_key); 1248a5ed9182SOmar Sandoval if (ret) 1249a5ed9182SOmar Sandoval goto abort; 1250a5ed9182SOmar Sandoval 1251a5ed9182SOmar Sandoval list_del(&free_space_root->dirty_list); 1252a5ed9182SOmar Sandoval 1253a5ed9182SOmar Sandoval btrfs_tree_lock(free_space_root->node); 12547c302b49SDavid Sterba clean_tree_block(fs_info, free_space_root->node); 1255a5ed9182SOmar Sandoval btrfs_tree_unlock(free_space_root->node); 1256a5ed9182SOmar Sandoval btrfs_free_tree_block(trans, free_space_root, free_space_root->node, 1257a5ed9182SOmar Sandoval 0, 1); 1258a5ed9182SOmar Sandoval 1259a5ed9182SOmar Sandoval free_extent_buffer(free_space_root->node); 1260a5ed9182SOmar Sandoval free_extent_buffer(free_space_root->commit_root); 1261a5ed9182SOmar Sandoval kfree(free_space_root); 1262a5ed9182SOmar Sandoval 12630bef7109SSahil Kang return btrfs_commit_transaction(trans); 1264a5ed9182SOmar Sandoval 1265a5ed9182SOmar Sandoval abort: 126666642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 12673a45bb20SJeff Mahoney btrfs_end_transaction(trans); 1268a5ed9182SOmar Sandoval return ret; 1269a5ed9182SOmar Sandoval } 1270a5ed9182SOmar Sandoval 1271a5ed9182SOmar Sandoval static int __add_block_group_free_space(struct btrfs_trans_handle *trans, 1272a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group, 1273a5ed9182SOmar Sandoval struct btrfs_path *path) 1274a5ed9182SOmar Sandoval { 1275a5ed9182SOmar Sandoval int ret; 1276a5ed9182SOmar Sandoval 1277a5ed9182SOmar Sandoval block_group->needs_free_space = 0; 1278a5ed9182SOmar Sandoval 127966afee18SNikolay Borisov ret = add_new_free_space_info(trans, block_group, path); 1280a5ed9182SOmar Sandoval if (ret) 1281a5ed9182SOmar Sandoval return ret; 1282a5ed9182SOmar Sandoval 12832d5cffa1SNikolay Borisov return __add_to_free_space_tree(trans, block_group, path, 1284a5ed9182SOmar Sandoval block_group->key.objectid, 1285a5ed9182SOmar Sandoval block_group->key.offset); 1286a5ed9182SOmar Sandoval } 1287a5ed9182SOmar Sandoval 1288a5ed9182SOmar Sandoval int add_block_group_free_space(struct btrfs_trans_handle *trans, 1289a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group) 1290a5ed9182SOmar Sandoval { 1291e4e0711cSNikolay Borisov struct btrfs_fs_info *fs_info = trans->fs_info; 1292a5ed9182SOmar Sandoval struct btrfs_path *path = NULL; 1293a5ed9182SOmar Sandoval int ret = 0; 1294a5ed9182SOmar Sandoval 1295a5ed9182SOmar Sandoval if (!btrfs_fs_compat_ro(fs_info, FREE_SPACE_TREE)) 1296a5ed9182SOmar Sandoval return 0; 1297a5ed9182SOmar Sandoval 1298a5ed9182SOmar Sandoval mutex_lock(&block_group->free_space_lock); 1299a5ed9182SOmar Sandoval if (!block_group->needs_free_space) 1300a5ed9182SOmar Sandoval goto out; 1301a5ed9182SOmar Sandoval 1302a5ed9182SOmar Sandoval path = btrfs_alloc_path(); 1303a5ed9182SOmar Sandoval if (!path) { 1304a5ed9182SOmar Sandoval ret = -ENOMEM; 1305a5ed9182SOmar Sandoval goto out; 1306a5ed9182SOmar Sandoval } 1307a5ed9182SOmar Sandoval 13089a7e0f92SNikolay Borisov ret = __add_block_group_free_space(trans, block_group, path); 1309a5ed9182SOmar Sandoval 1310a5ed9182SOmar Sandoval out: 1311a5ed9182SOmar Sandoval btrfs_free_path(path); 1312a5ed9182SOmar Sandoval mutex_unlock(&block_group->free_space_lock); 1313a5ed9182SOmar Sandoval if (ret) 131466642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 1315a5ed9182SOmar Sandoval return ret; 1316a5ed9182SOmar Sandoval } 1317a5ed9182SOmar Sandoval 1318a5ed9182SOmar Sandoval int remove_block_group_free_space(struct btrfs_trans_handle *trans, 1319a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group) 1320a5ed9182SOmar Sandoval { 1321f3f72779SNikolay Borisov struct btrfs_root *root = trans->fs_info->free_space_root; 1322a5ed9182SOmar Sandoval struct btrfs_path *path; 1323a5ed9182SOmar Sandoval struct btrfs_key key, found_key; 1324a5ed9182SOmar Sandoval struct extent_buffer *leaf; 1325a5ed9182SOmar Sandoval u64 start, end; 1326a5ed9182SOmar Sandoval int done = 0, nr; 1327a5ed9182SOmar Sandoval int ret; 1328a5ed9182SOmar Sandoval 1329f3f72779SNikolay Borisov if (!btrfs_fs_compat_ro(trans->fs_info, FREE_SPACE_TREE)) 1330a5ed9182SOmar Sandoval return 0; 1331a5ed9182SOmar Sandoval 1332a5ed9182SOmar Sandoval if (block_group->needs_free_space) { 1333a5ed9182SOmar Sandoval /* We never added this block group to the free space tree. */ 1334a5ed9182SOmar Sandoval return 0; 1335a5ed9182SOmar Sandoval } 1336a5ed9182SOmar Sandoval 1337a5ed9182SOmar Sandoval path = btrfs_alloc_path(); 1338a5ed9182SOmar Sandoval if (!path) { 1339a5ed9182SOmar Sandoval ret = -ENOMEM; 1340a5ed9182SOmar Sandoval goto out; 1341a5ed9182SOmar Sandoval } 1342a5ed9182SOmar Sandoval 1343a5ed9182SOmar Sandoval start = block_group->key.objectid; 1344a5ed9182SOmar Sandoval end = block_group->key.objectid + block_group->key.offset; 1345a5ed9182SOmar Sandoval 1346a5ed9182SOmar Sandoval key.objectid = end - 1; 1347a5ed9182SOmar Sandoval key.type = (u8)-1; 1348a5ed9182SOmar Sandoval key.offset = (u64)-1; 1349a5ed9182SOmar Sandoval 1350a5ed9182SOmar Sandoval while (!done) { 1351a5ed9182SOmar Sandoval ret = btrfs_search_prev_slot(trans, root, &key, path, -1, 1); 1352a5ed9182SOmar Sandoval if (ret) 1353a5ed9182SOmar Sandoval goto out; 1354a5ed9182SOmar Sandoval 1355a5ed9182SOmar Sandoval leaf = path->nodes[0]; 1356a5ed9182SOmar Sandoval nr = 0; 1357a5ed9182SOmar Sandoval path->slots[0]++; 1358a5ed9182SOmar Sandoval while (path->slots[0] > 0) { 1359a5ed9182SOmar Sandoval btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0] - 1); 1360a5ed9182SOmar Sandoval 1361a5ed9182SOmar Sandoval if (found_key.type == BTRFS_FREE_SPACE_INFO_KEY) { 1362a5ed9182SOmar Sandoval ASSERT(found_key.objectid == block_group->key.objectid); 1363a5ed9182SOmar Sandoval ASSERT(found_key.offset == block_group->key.offset); 1364a5ed9182SOmar Sandoval done = 1; 1365a5ed9182SOmar Sandoval nr++; 1366a5ed9182SOmar Sandoval path->slots[0]--; 1367a5ed9182SOmar Sandoval break; 1368a5ed9182SOmar Sandoval } else if (found_key.type == BTRFS_FREE_SPACE_EXTENT_KEY || 1369a5ed9182SOmar Sandoval found_key.type == BTRFS_FREE_SPACE_BITMAP_KEY) { 1370a5ed9182SOmar Sandoval ASSERT(found_key.objectid >= start); 1371a5ed9182SOmar Sandoval ASSERT(found_key.objectid < end); 1372a5ed9182SOmar Sandoval ASSERT(found_key.objectid + found_key.offset <= end); 1373a5ed9182SOmar Sandoval nr++; 1374a5ed9182SOmar Sandoval path->slots[0]--; 1375a5ed9182SOmar Sandoval } else { 1376a5ed9182SOmar Sandoval ASSERT(0); 1377a5ed9182SOmar Sandoval } 1378a5ed9182SOmar Sandoval } 1379a5ed9182SOmar Sandoval 1380a5ed9182SOmar Sandoval ret = btrfs_del_items(trans, root, path, path->slots[0], nr); 1381a5ed9182SOmar Sandoval if (ret) 1382a5ed9182SOmar Sandoval goto out; 1383a5ed9182SOmar Sandoval btrfs_release_path(path); 1384a5ed9182SOmar Sandoval } 1385a5ed9182SOmar Sandoval 1386a5ed9182SOmar Sandoval ret = 0; 1387a5ed9182SOmar Sandoval out: 1388a5ed9182SOmar Sandoval btrfs_free_path(path); 1389a5ed9182SOmar Sandoval if (ret) 139066642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 1391a5ed9182SOmar Sandoval return ret; 1392a5ed9182SOmar Sandoval } 1393a5ed9182SOmar Sandoval 1394a5ed9182SOmar Sandoval static int load_free_space_bitmaps(struct btrfs_caching_control *caching_ctl, 1395a5ed9182SOmar Sandoval struct btrfs_path *path, 1396a5ed9182SOmar Sandoval u32 expected_extent_count) 1397a5ed9182SOmar Sandoval { 1398a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group; 1399a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info; 1400a5ed9182SOmar Sandoval struct btrfs_root *root; 1401a5ed9182SOmar Sandoval struct btrfs_key key; 1402a5ed9182SOmar Sandoval int prev_bit = 0, bit; 1403a5ed9182SOmar Sandoval /* Initialize to silence GCC. */ 1404a5ed9182SOmar Sandoval u64 extent_start = 0; 1405a5ed9182SOmar Sandoval u64 end, offset; 1406a5ed9182SOmar Sandoval u64 total_found = 0; 1407a5ed9182SOmar Sandoval u32 extent_count = 0; 1408a5ed9182SOmar Sandoval int ret; 1409a5ed9182SOmar Sandoval 1410a5ed9182SOmar Sandoval block_group = caching_ctl->block_group; 1411a5ed9182SOmar Sandoval fs_info = block_group->fs_info; 1412a5ed9182SOmar Sandoval root = fs_info->free_space_root; 1413a5ed9182SOmar Sandoval 1414a5ed9182SOmar Sandoval end = block_group->key.objectid + block_group->key.offset; 1415a5ed9182SOmar Sandoval 1416a5ed9182SOmar Sandoval while (1) { 1417a5ed9182SOmar Sandoval ret = btrfs_next_item(root, path); 1418a5ed9182SOmar Sandoval if (ret < 0) 1419a5ed9182SOmar Sandoval goto out; 1420a5ed9182SOmar Sandoval if (ret) 1421a5ed9182SOmar Sandoval break; 1422a5ed9182SOmar Sandoval 1423a5ed9182SOmar Sandoval btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 1424a5ed9182SOmar Sandoval 1425a5ed9182SOmar Sandoval if (key.type == BTRFS_FREE_SPACE_INFO_KEY) 1426a5ed9182SOmar Sandoval break; 1427a5ed9182SOmar Sandoval 1428a5ed9182SOmar Sandoval ASSERT(key.type == BTRFS_FREE_SPACE_BITMAP_KEY); 1429a5ed9182SOmar Sandoval ASSERT(key.objectid < end && key.objectid + key.offset <= end); 1430a5ed9182SOmar Sandoval 1431a5ed9182SOmar Sandoval caching_ctl->progress = key.objectid; 1432a5ed9182SOmar Sandoval 1433a5ed9182SOmar Sandoval offset = key.objectid; 1434a5ed9182SOmar Sandoval while (offset < key.objectid + key.offset) { 1435a5ed9182SOmar Sandoval bit = free_space_test_bit(block_group, path, offset); 1436a5ed9182SOmar Sandoval if (prev_bit == 0 && bit == 1) { 1437a5ed9182SOmar Sandoval extent_start = offset; 1438a5ed9182SOmar Sandoval } else if (prev_bit == 1 && bit == 0) { 1439a5ed9182SOmar Sandoval total_found += add_new_free_space(block_group, 1440a5ed9182SOmar Sandoval extent_start, 1441a5ed9182SOmar Sandoval offset); 1442a5ed9182SOmar Sandoval if (total_found > CACHING_CTL_WAKE_UP) { 1443a5ed9182SOmar Sandoval total_found = 0; 1444a5ed9182SOmar Sandoval wake_up(&caching_ctl->wait); 1445a5ed9182SOmar Sandoval } 1446a5ed9182SOmar Sandoval extent_count++; 1447a5ed9182SOmar Sandoval } 1448a5ed9182SOmar Sandoval prev_bit = bit; 14490b246afaSJeff Mahoney offset += fs_info->sectorsize; 1450a5ed9182SOmar Sandoval } 1451a5ed9182SOmar Sandoval } 1452a5ed9182SOmar Sandoval if (prev_bit == 1) { 14534457c1c7SNikolay Borisov total_found += add_new_free_space(block_group, extent_start, 14544457c1c7SNikolay Borisov end); 1455a5ed9182SOmar Sandoval extent_count++; 1456a5ed9182SOmar Sandoval } 1457a5ed9182SOmar Sandoval 1458a5ed9182SOmar Sandoval if (extent_count != expected_extent_count) { 14595d163e0eSJeff Mahoney btrfs_err(fs_info, 14605d163e0eSJeff Mahoney "incorrect extent count for %llu; counted %u, expected %u", 1461a5ed9182SOmar Sandoval block_group->key.objectid, extent_count, 1462a5ed9182SOmar Sandoval expected_extent_count); 1463a5ed9182SOmar Sandoval ASSERT(0); 1464a5ed9182SOmar Sandoval ret = -EIO; 1465a5ed9182SOmar Sandoval goto out; 1466a5ed9182SOmar Sandoval } 1467a5ed9182SOmar Sandoval 1468a5ed9182SOmar Sandoval caching_ctl->progress = (u64)-1; 1469a5ed9182SOmar Sandoval 1470a5ed9182SOmar Sandoval ret = 0; 1471a5ed9182SOmar Sandoval out: 1472a5ed9182SOmar Sandoval return ret; 1473a5ed9182SOmar Sandoval } 1474a5ed9182SOmar Sandoval 1475a5ed9182SOmar Sandoval static int load_free_space_extents(struct btrfs_caching_control *caching_ctl, 1476a5ed9182SOmar Sandoval struct btrfs_path *path, 1477a5ed9182SOmar Sandoval u32 expected_extent_count) 1478a5ed9182SOmar Sandoval { 1479a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group; 1480a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info; 1481a5ed9182SOmar Sandoval struct btrfs_root *root; 1482a5ed9182SOmar Sandoval struct btrfs_key key; 1483a5ed9182SOmar Sandoval u64 end; 1484a5ed9182SOmar Sandoval u64 total_found = 0; 1485a5ed9182SOmar Sandoval u32 extent_count = 0; 1486a5ed9182SOmar Sandoval int ret; 1487a5ed9182SOmar Sandoval 1488a5ed9182SOmar Sandoval block_group = caching_ctl->block_group; 1489a5ed9182SOmar Sandoval fs_info = block_group->fs_info; 1490a5ed9182SOmar Sandoval root = fs_info->free_space_root; 1491a5ed9182SOmar Sandoval 1492a5ed9182SOmar Sandoval end = block_group->key.objectid + block_group->key.offset; 1493a5ed9182SOmar Sandoval 1494a5ed9182SOmar Sandoval while (1) { 1495a5ed9182SOmar Sandoval ret = btrfs_next_item(root, path); 1496a5ed9182SOmar Sandoval if (ret < 0) 1497a5ed9182SOmar Sandoval goto out; 1498a5ed9182SOmar Sandoval if (ret) 1499a5ed9182SOmar Sandoval break; 1500a5ed9182SOmar Sandoval 1501a5ed9182SOmar Sandoval btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 1502a5ed9182SOmar Sandoval 1503a5ed9182SOmar Sandoval if (key.type == BTRFS_FREE_SPACE_INFO_KEY) 1504a5ed9182SOmar Sandoval break; 1505a5ed9182SOmar Sandoval 1506a5ed9182SOmar Sandoval ASSERT(key.type == BTRFS_FREE_SPACE_EXTENT_KEY); 1507a5ed9182SOmar Sandoval ASSERT(key.objectid < end && key.objectid + key.offset <= end); 1508a5ed9182SOmar Sandoval 1509a5ed9182SOmar Sandoval caching_ctl->progress = key.objectid; 1510a5ed9182SOmar Sandoval 15114457c1c7SNikolay Borisov total_found += add_new_free_space(block_group, key.objectid, 1512a5ed9182SOmar Sandoval key.objectid + key.offset); 1513a5ed9182SOmar Sandoval if (total_found > CACHING_CTL_WAKE_UP) { 1514a5ed9182SOmar Sandoval total_found = 0; 1515a5ed9182SOmar Sandoval wake_up(&caching_ctl->wait); 1516a5ed9182SOmar Sandoval } 1517a5ed9182SOmar Sandoval extent_count++; 1518a5ed9182SOmar Sandoval } 1519a5ed9182SOmar Sandoval 1520a5ed9182SOmar Sandoval if (extent_count != expected_extent_count) { 15215d163e0eSJeff Mahoney btrfs_err(fs_info, 15225d163e0eSJeff Mahoney "incorrect extent count for %llu; counted %u, expected %u", 1523a5ed9182SOmar Sandoval block_group->key.objectid, extent_count, 1524a5ed9182SOmar Sandoval expected_extent_count); 1525a5ed9182SOmar Sandoval ASSERT(0); 1526a5ed9182SOmar Sandoval ret = -EIO; 1527a5ed9182SOmar Sandoval goto out; 1528a5ed9182SOmar Sandoval } 1529a5ed9182SOmar Sandoval 1530a5ed9182SOmar Sandoval caching_ctl->progress = (u64)-1; 1531a5ed9182SOmar Sandoval 1532a5ed9182SOmar Sandoval ret = 0; 1533a5ed9182SOmar Sandoval out: 1534a5ed9182SOmar Sandoval return ret; 1535a5ed9182SOmar Sandoval } 1536a5ed9182SOmar Sandoval 1537a5ed9182SOmar Sandoval int load_free_space_tree(struct btrfs_caching_control *caching_ctl) 1538a5ed9182SOmar Sandoval { 1539a5ed9182SOmar Sandoval struct btrfs_block_group_cache *block_group; 1540a5ed9182SOmar Sandoval struct btrfs_fs_info *fs_info; 1541a5ed9182SOmar Sandoval struct btrfs_free_space_info *info; 1542a5ed9182SOmar Sandoval struct btrfs_path *path; 1543a5ed9182SOmar Sandoval u32 extent_count, flags; 1544a5ed9182SOmar Sandoval int ret; 1545a5ed9182SOmar Sandoval 1546a5ed9182SOmar Sandoval block_group = caching_ctl->block_group; 1547a5ed9182SOmar Sandoval fs_info = block_group->fs_info; 1548a5ed9182SOmar Sandoval 1549a5ed9182SOmar Sandoval path = btrfs_alloc_path(); 1550a5ed9182SOmar Sandoval if (!path) 1551a5ed9182SOmar Sandoval return -ENOMEM; 1552a5ed9182SOmar Sandoval 1553a5ed9182SOmar Sandoval /* 1554a5ed9182SOmar Sandoval * Just like caching_thread() doesn't want to deadlock on the extent 1555a5ed9182SOmar Sandoval * tree, we don't want to deadlock on the free space tree. 1556a5ed9182SOmar Sandoval */ 1557a5ed9182SOmar Sandoval path->skip_locking = 1; 1558a5ed9182SOmar Sandoval path->search_commit_root = 1; 15597ce311d5SGu JinXiang path->reada = READA_FORWARD; 1560a5ed9182SOmar Sandoval 1561a5ed9182SOmar Sandoval info = search_free_space_info(NULL, fs_info, block_group, path, 0); 1562a5ed9182SOmar Sandoval if (IS_ERR(info)) { 1563a5ed9182SOmar Sandoval ret = PTR_ERR(info); 1564a5ed9182SOmar Sandoval goto out; 1565a5ed9182SOmar Sandoval } 1566a5ed9182SOmar Sandoval extent_count = btrfs_free_space_extent_count(path->nodes[0], info); 1567a5ed9182SOmar Sandoval flags = btrfs_free_space_flags(path->nodes[0], info); 1568a5ed9182SOmar Sandoval 1569a5ed9182SOmar Sandoval /* 1570a5ed9182SOmar Sandoval * We left path pointing to the free space info item, so now 1571a5ed9182SOmar Sandoval * load_free_space_foo can just iterate through the free space tree from 1572a5ed9182SOmar Sandoval * there. 1573a5ed9182SOmar Sandoval */ 1574a5ed9182SOmar Sandoval if (flags & BTRFS_FREE_SPACE_USING_BITMAPS) 1575a5ed9182SOmar Sandoval ret = load_free_space_bitmaps(caching_ctl, path, extent_count); 1576a5ed9182SOmar Sandoval else 1577a5ed9182SOmar Sandoval ret = load_free_space_extents(caching_ctl, path, extent_count); 1578a5ed9182SOmar Sandoval 1579a5ed9182SOmar Sandoval out: 1580a5ed9182SOmar Sandoval btrfs_free_path(path); 1581a5ed9182SOmar Sandoval return ret; 1582a5ed9182SOmar Sandoval } 1583