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