Lines Matching refs:ctl
45 static int link_free_space(struct btrfs_free_space_ctl *ctl,
47 static void unlink_free_space(struct btrfs_free_space_ctl *ctl,
49 static int search_bitmap(struct btrfs_free_space_ctl *ctl,
52 static void free_bitmap(struct btrfs_free_space_ctl *ctl,
54 static void bitmap_clear_bits(struct btrfs_free_space_ctl *ctl,
63 static void __btrfs_remove_free_space_cache(struct btrfs_free_space_ctl *ctl) in __btrfs_remove_free_space_cache() argument
68 while ((node = rb_last(&ctl->free_space_offset)) != NULL) { in __btrfs_remove_free_space_cache()
71 unlink_free_space(ctl, info, true); in __btrfs_remove_free_space_cache()
74 free_bitmap(ctl, info); in __btrfs_remove_free_space_cache()
77 cond_resched_lock(&ctl->tree_lock); in __btrfs_remove_free_space_cache()
691 static void recalculate_thresholds(struct btrfs_free_space_ctl *ctl) in recalculate_thresholds() argument
693 struct btrfs_block_group *block_group = ctl->block_group; in recalculate_thresholds()
698 u64 bytes_per_bg = BITS_PER_BITMAP * ctl->unit; in recalculate_thresholds()
703 if (ctl->total_bitmaps > max_bitmaps) in recalculate_thresholds()
707 ctl->total_bitmaps, ctl->unit, max_bitmaps, in recalculate_thresholds()
709 ASSERT(ctl->total_bitmaps <= max_bitmaps); in recalculate_thresholds()
722 bitmap_bytes = ctl->total_bitmaps * ctl->unit; in recalculate_thresholds()
731 ctl->extents_thresh = in recalculate_thresholds()
736 struct btrfs_free_space_ctl *ctl, in __load_free_space_cache() argument
834 spin_lock(&ctl->tree_lock); in __load_free_space_cache()
835 ret = link_free_space(ctl, e); in __load_free_space_cache()
836 spin_unlock(&ctl->tree_lock); in __load_free_space_cache()
854 spin_lock(&ctl->tree_lock); in __load_free_space_cache()
855 ret = link_free_space(ctl, e); in __load_free_space_cache()
857 spin_unlock(&ctl->tree_lock); in __load_free_space_cache()
864 ctl->total_bitmaps++; in __load_free_space_cache()
865 recalculate_thresholds(ctl); in __load_free_space_cache()
866 spin_unlock(&ctl->tree_lock); in __load_free_space_cache()
894 spin_lock(&ctl->tree_lock); in __load_free_space_cache()
895 __btrfs_remove_free_space_cache(ctl); in __load_free_space_cache()
896 spin_unlock(&ctl->tree_lock); in __load_free_space_cache()
901 struct btrfs_free_space_ctl *ctl) in copy_free_space_cache() argument
907 while (!ret && (n = rb_first(&ctl->free_space_offset)) != NULL) { in copy_free_space_cache()
913 unlink_free_space(ctl, info, true); in copy_free_space_cache()
914 spin_unlock(&ctl->tree_lock); in copy_free_space_cache()
917 spin_lock(&ctl->tree_lock); in copy_free_space_cache()
920 u64 bytes = ctl->unit; in copy_free_space_cache()
922 ret = search_bitmap(ctl, info, &offset, &bytes, false); in copy_free_space_cache()
924 bitmap_clear_bits(ctl, info, offset, bytes, true); in copy_free_space_cache()
925 spin_unlock(&ctl->tree_lock); in copy_free_space_cache()
928 spin_lock(&ctl->tree_lock); in copy_free_space_cache()
930 free_bitmap(ctl, info); in copy_free_space_cache()
934 cond_resched_lock(&ctl->tree_lock); in copy_free_space_cache()
944 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in load_free_space_cache() local
1063 spin_lock(&ctl->tree_lock); in load_free_space_cache()
1065 spin_unlock(&ctl->tree_lock); in load_free_space_cache()
1072 struct btrfs_free_space_ctl *ctl, in write_cache_extent_entries() argument
1080 struct rb_node *node = rb_first(&ctl->free_space_offset); in write_cache_extent_entries()
1132 list_for_each_entry(trim_entry, &ctl->trimming_ranges, list) { in write_cache_extent_entries()
1379 struct btrfs_free_space_ctl *ctl, in __btrfs_write_out_cache() argument
1424 mutex_lock(&ctl->cache_writeout_mutex); in __btrfs_write_out_cache()
1426 spin_lock(&ctl->tree_lock); in __btrfs_write_out_cache()
1427 ret = write_cache_extent_entries(io_ctl, ctl, in __btrfs_write_out_cache()
1451 spin_unlock(&ctl->tree_lock); in __btrfs_write_out_cache()
1452 mutex_unlock(&ctl->cache_writeout_mutex); in __btrfs_write_out_cache()
1494 spin_unlock(&ctl->tree_lock); in __btrfs_write_out_cache()
1495 mutex_unlock(&ctl->cache_writeout_mutex); in __btrfs_write_out_cache()
1522 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_write_out_cache() local
1537 ret = __btrfs_write_out_cache(inode, ctl, block_group, in btrfs_write_out_cache()
1572 static inline u64 offset_to_bitmap(struct btrfs_free_space_ctl *ctl, in offset_to_bitmap() argument
1578 bytes_per_bitmap = BITS_PER_BITMAP * ctl->unit; in offset_to_bitmap()
1579 bitmap_start = offset - ctl->start; in offset_to_bitmap()
1582 bitmap_start += ctl->start; in offset_to_bitmap()
1587 static int tree_insert_offset(struct btrfs_free_space_ctl *ctl, in tree_insert_offset() argument
1595 lockdep_assert_held(&ctl->tree_lock); in tree_insert_offset()
1601 root = &ctl->free_space_offset; in tree_insert_offset()
1704 tree_search_offset(struct btrfs_free_space_ctl *ctl, in tree_search_offset() argument
1707 struct rb_node *n = ctl->free_space_offset.rb_node; in tree_search_offset()
1710 lockdep_assert_held(&ctl->tree_lock); in tree_search_offset()
1792 if (entry->offset + BITS_PER_BITMAP * ctl->unit > offset) in tree_search_offset()
1807 ctl->unit > offset) in tree_search_offset()
1817 static inline void unlink_free_space(struct btrfs_free_space_ctl *ctl, in unlink_free_space() argument
1821 lockdep_assert_held(&ctl->tree_lock); in unlink_free_space()
1823 rb_erase(&info->offset_index, &ctl->free_space_offset); in unlink_free_space()
1824 rb_erase_cached(&info->bytes_index, &ctl->free_space_bytes); in unlink_free_space()
1825 ctl->free_extents--; in unlink_free_space()
1828 ctl->discardable_extents[BTRFS_STAT_CURR]--; in unlink_free_space()
1829 ctl->discardable_bytes[BTRFS_STAT_CURR] -= info->bytes; in unlink_free_space()
1833 ctl->free_space -= info->bytes; in unlink_free_space()
1836 static int link_free_space(struct btrfs_free_space_ctl *ctl, in link_free_space() argument
1841 lockdep_assert_held(&ctl->tree_lock); in link_free_space()
1844 ret = tree_insert_offset(ctl, NULL, info); in link_free_space()
1848 rb_add_cached(&info->bytes_index, &ctl->free_space_bytes, entry_less); in link_free_space()
1851 ctl->discardable_extents[BTRFS_STAT_CURR]++; in link_free_space()
1852 ctl->discardable_bytes[BTRFS_STAT_CURR] += info->bytes; in link_free_space()
1855 ctl->free_space += info->bytes; in link_free_space()
1856 ctl->free_extents++; in link_free_space()
1860 static void relink_bitmap_entry(struct btrfs_free_space_ctl *ctl, in relink_bitmap_entry() argument
1872 lockdep_assert_held(&ctl->tree_lock); in relink_bitmap_entry()
1874 rb_erase_cached(&info->bytes_index, &ctl->free_space_bytes); in relink_bitmap_entry()
1875 rb_add_cached(&info->bytes_index, &ctl->free_space_bytes, entry_less); in relink_bitmap_entry()
1878 static inline void bitmap_clear_bits(struct btrfs_free_space_ctl *ctl, in bitmap_clear_bits() argument
1885 start = offset_to_bit(info->offset, ctl->unit, offset); in bitmap_clear_bits()
1886 count = bytes_to_bits(bytes, ctl->unit); in bitmap_clear_bits()
1893 if (info->max_extent_size > ctl->unit) in bitmap_clear_bits()
1896 relink_bitmap_entry(ctl, info); in bitmap_clear_bits()
1906 ctl->discardable_extents[BTRFS_STAT_CURR] += extent_delta; in bitmap_clear_bits()
1907 ctl->discardable_bytes[BTRFS_STAT_CURR] -= bytes; in bitmap_clear_bits()
1911 ctl->free_space -= bytes; in bitmap_clear_bits()
1914 static void btrfs_bitmap_set_bits(struct btrfs_free_space_ctl *ctl, in btrfs_bitmap_set_bits() argument
1921 start = offset_to_bit(info->offset, ctl->unit, offset); in btrfs_bitmap_set_bits()
1922 count = bytes_to_bits(bytes, ctl->unit); in btrfs_bitmap_set_bits()
1934 ctl->free_space += bytes; in btrfs_bitmap_set_bits()
1936 relink_bitmap_entry(ctl, info); in btrfs_bitmap_set_bits()
1946 ctl->discardable_extents[BTRFS_STAT_CURR] += extent_delta; in btrfs_bitmap_set_bits()
1947 ctl->discardable_bytes[BTRFS_STAT_CURR] += bytes; in btrfs_bitmap_set_bits()
1955 static int search_bitmap(struct btrfs_free_space_ctl *ctl, in search_bitmap() argument
1976 i = offset_to_bit(bitmap_info->offset, ctl->unit, in search_bitmap()
1978 bits = bytes_to_bits(*bytes, ctl->unit); in search_bitmap()
1998 *offset = (u64)(i * ctl->unit) + bitmap_info->offset; in search_bitmap()
1999 *bytes = (u64)(found_bits) * ctl->unit; in search_bitmap()
2003 *bytes = (u64)(max_bits) * ctl->unit; in search_bitmap()
2005 relink_bitmap_entry(ctl, bitmap_info); in search_bitmap()
2011 find_free_space(struct btrfs_free_space_ctl *ctl, u64 *offset, u64 *bytes, in find_free_space() argument
2020 if (!ctl->free_space_offset.rb_node) in find_free_space()
2024 node = rb_first_cached(&ctl->free_space_bytes); in find_free_space()
2026 entry = tree_search_offset(ctl, offset_to_bitmap(ctl, *offset), in find_free_space()
2061 tmp = entry->offset - ctl->start + align - 1; in find_free_space()
2063 tmp = tmp * align + ctl->start; in find_free_space()
2087 ret = search_bitmap(ctl, entry, &tmp, &size, true); in find_free_space()
2117 static void add_new_bitmap(struct btrfs_free_space_ctl *ctl, in add_new_bitmap() argument
2120 info->offset = offset_to_bitmap(ctl, offset); in add_new_bitmap()
2124 link_free_space(ctl, info); in add_new_bitmap()
2125 ctl->total_bitmaps++; in add_new_bitmap()
2126 recalculate_thresholds(ctl); in add_new_bitmap()
2129 static void free_bitmap(struct btrfs_free_space_ctl *ctl, in free_bitmap() argument
2139 ctl->discardable_extents[BTRFS_STAT_CURR] -= in free_bitmap()
2141 ctl->discardable_bytes[BTRFS_STAT_CURR] -= bitmap_info->bytes; in free_bitmap()
2144 unlink_free_space(ctl, bitmap_info, true); in free_bitmap()
2147 ctl->total_bitmaps--; in free_bitmap()
2148 recalculate_thresholds(ctl); in free_bitmap()
2151 static noinline int remove_from_bitmap(struct btrfs_free_space_ctl *ctl, in remove_from_bitmap() argument
2160 end = bitmap_info->offset + (u64)(BITS_PER_BITMAP * ctl->unit) - 1; in remove_from_bitmap()
2169 search_bytes = ctl->unit; in remove_from_bitmap()
2171 ret = search_bitmap(ctl, bitmap_info, &search_start, &search_bytes, in remove_from_bitmap()
2182 bitmap_clear_bits(ctl, bitmap_info, search_start, search_bytes, true); in remove_from_bitmap()
2189 free_bitmap(ctl, bitmap_info); in remove_from_bitmap()
2215 search_bytes = ctl->unit; in remove_from_bitmap()
2216 ret = search_bitmap(ctl, bitmap_info, &search_start, in remove_from_bitmap()
2223 free_bitmap(ctl, bitmap_info); in remove_from_bitmap()
2228 static u64 add_bytes_to_bitmap(struct btrfs_free_space_ctl *ctl, in add_bytes_to_bitmap() argument
2241 ctl->discardable_extents[BTRFS_STAT_CURR] += in add_bytes_to_bitmap()
2243 ctl->discardable_bytes[BTRFS_STAT_CURR] += info->bytes; in add_bytes_to_bitmap()
2248 end = info->offset + (u64)(BITS_PER_BITMAP * ctl->unit); in add_bytes_to_bitmap()
2252 btrfs_bitmap_set_bits(ctl, info, offset, bytes_to_set); in add_bytes_to_bitmap()
2258 static bool use_bitmap(struct btrfs_free_space_ctl *ctl, in use_bitmap() argument
2261 struct btrfs_block_group *block_group = ctl->block_group; in use_bitmap()
2278 if (!forced && ctl->free_extents < ctl->extents_thresh) { in use_bitmap()
2287 if (ctl->free_extents * 3 <= ctl->extents_thresh) in use_bitmap()
2302 if (((BITS_PER_BITMAP * ctl->unit) >> 1) > block_group->length) in use_bitmap()
2312 static int insert_into_bitmap(struct btrfs_free_space_ctl *ctl, in insert_into_bitmap() argument
2326 if (!ctl->op->use_bitmap(ctl, info)) in insert_into_bitmap()
2329 if (ctl->op == &free_space_op) in insert_into_bitmap()
2330 block_group = ctl->block_group; in insert_into_bitmap()
2358 if (entry->offset == offset_to_bitmap(ctl, offset)) { in insert_into_bitmap()
2359 bytes_added = add_bytes_to_bitmap(ctl, entry, offset, in insert_into_bitmap()
2372 bitmap_info = tree_search_offset(ctl, offset_to_bitmap(ctl, offset), in insert_into_bitmap()
2379 bytes_added = add_bytes_to_bitmap(ctl, bitmap_info, offset, bytes, in insert_into_bitmap()
2393 add_new_bitmap(ctl, info, offset); in insert_into_bitmap()
2398 spin_unlock(&ctl->tree_lock); in insert_into_bitmap()
2405 spin_lock(&ctl->tree_lock); in insert_into_bitmap()
2415 spin_lock(&ctl->tree_lock); in insert_into_bitmap()
2450 static bool try_merge_free_space(struct btrfs_free_space_ctl *ctl, in try_merge_free_space() argument
2466 right_info = tree_search_offset(ctl, offset + bytes, 0, 0); in try_merge_free_space()
2473 left_info = tree_search_offset(ctl, offset - 1, 0, 0); in try_merge_free_space()
2478 unlink_free_space(ctl, right_info, update_stat); in try_merge_free_space()
2488 unlink_free_space(ctl, left_info, update_stat); in try_merge_free_space()
2498 static bool steal_from_bitmap_to_end(struct btrfs_free_space_ctl *ctl, in steal_from_bitmap_to_end() argument
2506 const u64 bitmap_offset = offset_to_bitmap(ctl, end); in steal_from_bitmap_to_end()
2509 bitmap = tree_search_offset(ctl, bitmap_offset, 1, 0); in steal_from_bitmap_to_end()
2513 i = offset_to_bit(bitmap->offset, ctl->unit, end); in steal_from_bitmap_to_end()
2517 bytes = (j - i) * ctl->unit; in steal_from_bitmap_to_end()
2524 bitmap_clear_bits(ctl, bitmap, end, bytes, update_stat); in steal_from_bitmap_to_end()
2527 free_bitmap(ctl, bitmap); in steal_from_bitmap_to_end()
2532 static bool steal_from_bitmap_to_front(struct btrfs_free_space_ctl *ctl, in steal_from_bitmap_to_front() argument
2543 bitmap_offset = offset_to_bitmap(ctl, info->offset); in steal_from_bitmap_to_front()
2548 bitmap_offset = offset_to_bitmap(ctl, info->offset - 1); in steal_from_bitmap_to_front()
2551 bitmap = tree_search_offset(ctl, bitmap_offset, 1, 0); in steal_from_bitmap_to_front()
2555 i = offset_to_bit(bitmap->offset, ctl->unit, info->offset) - 1; in steal_from_bitmap_to_front()
2567 bytes = (i + 1) * ctl->unit; in steal_from_bitmap_to_front()
2569 bytes = (i - prev_j) * ctl->unit; in steal_from_bitmap_to_front()
2578 bitmap_clear_bits(ctl, bitmap, info->offset, bytes, update_stat); in steal_from_bitmap_to_front()
2581 free_bitmap(ctl, bitmap); in steal_from_bitmap_to_front()
2597 static void steal_from_bitmap(struct btrfs_free_space_ctl *ctl, in steal_from_bitmap() argument
2608 if (ctl->total_bitmaps > 0) { in steal_from_bitmap()
2612 stole_end = steal_from_bitmap_to_end(ctl, info, update_stat); in steal_from_bitmap()
2613 if (ctl->total_bitmaps > 0) in steal_from_bitmap()
2614 stole_front = steal_from_bitmap_to_front(ctl, info, in steal_from_bitmap()
2618 try_merge_free_space(ctl, info, update_stat); in steal_from_bitmap()
2627 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in __btrfs_add_free_space() local
2644 spin_lock(&ctl->tree_lock); in __btrfs_add_free_space()
2646 if (try_merge_free_space(ctl, info, true)) in __btrfs_add_free_space()
2654 ret = insert_into_bitmap(ctl, info); in __btrfs_add_free_space()
2668 steal_from_bitmap(ctl, info, true); in __btrfs_add_free_space()
2672 ret = link_free_space(ctl, info); in __btrfs_add_free_space()
2677 spin_unlock(&ctl->tree_lock); in __btrfs_add_free_space()
2696 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in __btrfs_add_free_space_zoned() local
2722 spin_lock(&ctl->tree_lock); in __btrfs_add_free_space_zoned()
2723 ctl->free_space += to_free; in __btrfs_add_free_space_zoned()
2724 spin_unlock(&ctl->tree_lock); in __btrfs_add_free_space_zoned()
2802 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_remove_free_space() local
2827 spin_lock(&ctl->tree_lock); in btrfs_remove_free_space()
2834 info = tree_search_offset(ctl, offset, 0, 0); in btrfs_remove_free_space()
2840 info = tree_search_offset(ctl, offset_to_bitmap(ctl, offset), in btrfs_remove_free_space()
2855 unlink_free_space(ctl, info, true); in btrfs_remove_free_space()
2862 ret = link_free_space(ctl, info); in btrfs_remove_free_space()
2875 ret = link_free_space(ctl, info); in btrfs_remove_free_space()
2889 spin_unlock(&ctl->tree_lock); in btrfs_remove_free_space()
2900 ret = remove_from_bitmap(ctl, info, &offset, &bytes); in btrfs_remove_free_space()
2907 spin_unlock(&ctl->tree_lock); in btrfs_remove_free_space()
2916 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_dump_free_space() local
2933 spin_lock(&ctl->tree_lock); in btrfs_dump_free_space()
2934 for (n = rb_first(&ctl->free_space_offset); n; n = rb_next(n)) { in btrfs_dump_free_space()
2942 spin_unlock(&ctl->tree_lock); in btrfs_dump_free_space()
2951 struct btrfs_free_space_ctl *ctl) in btrfs_init_free_space_ctl() argument
2955 spin_lock_init(&ctl->tree_lock); in btrfs_init_free_space_ctl()
2956 ctl->unit = fs_info->sectorsize; in btrfs_init_free_space_ctl()
2957 ctl->start = block_group->start; in btrfs_init_free_space_ctl()
2958 ctl->block_group = block_group; in btrfs_init_free_space_ctl()
2959 ctl->op = &free_space_op; in btrfs_init_free_space_ctl()
2960 ctl->free_space_bytes = RB_ROOT_CACHED; in btrfs_init_free_space_ctl()
2961 INIT_LIST_HEAD(&ctl->trimming_ranges); in btrfs_init_free_space_ctl()
2962 mutex_init(&ctl->cache_writeout_mutex); in btrfs_init_free_space_ctl()
2969 ctl->extents_thresh = (SZ_32K / 2) / sizeof(struct btrfs_free_space); in btrfs_init_free_space_ctl()
2982 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in __btrfs_return_cluster_to_free_space() local
2985 lockdep_assert_held(&ctl->tree_lock); in __btrfs_return_cluster_to_free_space()
3009 ctl->discardable_extents[BTRFS_STAT_CURR]--; in __btrfs_return_cluster_to_free_space()
3010 ctl->discardable_bytes[BTRFS_STAT_CURR] -= in __btrfs_return_cluster_to_free_space()
3014 try_merge_free_space(ctl, entry, false); in __btrfs_return_cluster_to_free_space()
3015 steal_from_bitmap(ctl, entry, false); in __btrfs_return_cluster_to_free_space()
3019 ctl->discardable_extents[BTRFS_STAT_CURR]++; in __btrfs_return_cluster_to_free_space()
3020 ctl->discardable_bytes[BTRFS_STAT_CURR] += in __btrfs_return_cluster_to_free_space()
3024 tree_insert_offset(ctl, NULL, entry); in __btrfs_return_cluster_to_free_space()
3025 rb_add_cached(&entry->bytes_index, &ctl->free_space_bytes, in __btrfs_return_cluster_to_free_space()
3035 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_remove_free_space_cache() local
3039 spin_lock(&ctl->tree_lock); in btrfs_remove_free_space_cache()
3048 cond_resched_lock(&ctl->tree_lock); in btrfs_remove_free_space_cache()
3050 __btrfs_remove_free_space_cache(ctl); in btrfs_remove_free_space_cache()
3052 spin_unlock(&ctl->tree_lock); in btrfs_remove_free_space_cache()
3061 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_is_free_space_trimmed() local
3066 spin_lock(&ctl->tree_lock); in btrfs_is_free_space_trimmed()
3067 node = rb_first(&ctl->free_space_offset); in btrfs_is_free_space_trimmed()
3080 spin_unlock(&ctl->tree_lock); in btrfs_is_free_space_trimmed()
3088 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_find_space_for_alloc() local
3101 spin_lock(&ctl->tree_lock); in btrfs_find_space_for_alloc()
3102 entry = find_free_space(ctl, &offset, &bytes_search, in btrfs_find_space_for_alloc()
3110 bitmap_clear_bits(ctl, entry, offset, bytes, true); in btrfs_find_space_for_alloc()
3116 free_bitmap(ctl, entry); in btrfs_find_space_for_alloc()
3118 unlink_free_space(ctl, entry, true); in btrfs_find_space_for_alloc()
3133 link_free_space(ctl, entry); in btrfs_find_space_for_alloc()
3137 spin_unlock(&ctl->tree_lock); in btrfs_find_space_for_alloc()
3157 struct btrfs_free_space_ctl *ctl; in btrfs_return_cluster_to_free_space() local
3175 ctl = block_group->free_space_ctl; in btrfs_return_cluster_to_free_space()
3178 spin_lock(&ctl->tree_lock); in btrfs_return_cluster_to_free_space()
3180 spin_unlock(&ctl->tree_lock); in btrfs_return_cluster_to_free_space()
3194 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_alloc_from_bitmap() local
3203 err = search_bitmap(ctl, entry, &search_start, &search_bytes, true); in btrfs_alloc_from_bitmap()
3211 bitmap_clear_bits(ctl, entry, ret, bytes, false); in btrfs_alloc_from_bitmap()
3225 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_alloc_from_cluster() local
3290 spin_lock(&ctl->tree_lock); in btrfs_alloc_from_cluster()
3295 ctl->free_space -= bytes; in btrfs_alloc_from_cluster()
3297 ctl->discardable_bytes[BTRFS_STAT_CURR] -= bytes; in btrfs_alloc_from_cluster()
3302 ctl->free_extents--; in btrfs_alloc_from_cluster()
3306 ctl->total_bitmaps--; in btrfs_alloc_from_cluster()
3307 recalculate_thresholds(ctl); in btrfs_alloc_from_cluster()
3309 ctl->discardable_extents[BTRFS_STAT_CURR]--; in btrfs_alloc_from_cluster()
3315 spin_unlock(&ctl->tree_lock); in btrfs_alloc_from_cluster()
3326 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_bitmap_cluster() local
3337 lockdep_assert_held(&ctl->tree_lock); in btrfs_bitmap_cluster()
3339 i = offset_to_bit(entry->offset, ctl->unit, in btrfs_bitmap_cluster()
3341 want_bits = bytes_to_bits(bytes, ctl->unit); in btrfs_bitmap_cluster()
3342 min_bits = bytes_to_bits(min_bytes, ctl->unit); in btrfs_bitmap_cluster()
3368 entry->max_extent_size = (u64)max_bits * ctl->unit; in btrfs_bitmap_cluster()
3379 if (cluster->max_size < found_bits * ctl->unit) in btrfs_bitmap_cluster()
3380 cluster->max_size = found_bits * ctl->unit; in btrfs_bitmap_cluster()
3387 cluster->window_start = start * ctl->unit + entry->offset; in btrfs_bitmap_cluster()
3388 rb_erase(&entry->offset_index, &ctl->free_space_offset); in btrfs_bitmap_cluster()
3389 rb_erase_cached(&entry->bytes_index, &ctl->free_space_bytes); in btrfs_bitmap_cluster()
3400 ret = tree_insert_offset(ctl, cluster, entry); in btrfs_bitmap_cluster()
3404 total_found * ctl->unit, 1); in btrfs_bitmap_cluster()
3419 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in setup_cluster_no_bitmap() local
3428 lockdep_assert_held(&ctl->tree_lock); in setup_cluster_no_bitmap()
3430 entry = tree_search_offset(ctl, offset, 0, 1); in setup_cluster_no_bitmap()
3490 rb_erase(&entry->offset_index, &ctl->free_space_offset); in setup_cluster_no_bitmap()
3491 rb_erase_cached(&entry->bytes_index, &ctl->free_space_bytes); in setup_cluster_no_bitmap()
3492 ret = tree_insert_offset(ctl, cluster, entry); in setup_cluster_no_bitmap()
3512 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in setup_cluster_bitmap() local
3515 u64 bitmap_offset = offset_to_bitmap(ctl, offset); in setup_cluster_bitmap()
3517 if (ctl->total_bitmaps == 0) in setup_cluster_bitmap()
3528 entry = tree_search_offset(ctl, bitmap_offset, 1, 0); in setup_cluster_bitmap()
3562 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_find_space_cluster() local
3586 spin_lock(&ctl->tree_lock); in btrfs_find_space_cluster()
3592 if (ctl->free_space < bytes) { in btrfs_find_space_cluster()
3593 spin_unlock(&ctl->tree_lock); in btrfs_find_space_cluster()
3630 spin_unlock(&ctl->tree_lock); in btrfs_find_space_cluster()
3657 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in do_trimming() local
3681 mutex_lock(&ctl->cache_writeout_mutex); in do_trimming()
3691 mutex_unlock(&ctl->cache_writeout_mutex); in do_trimming()
3716 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in trim_no_bitmap() local
3729 mutex_lock(&ctl->cache_writeout_mutex); in trim_no_bitmap()
3730 spin_lock(&ctl->tree_lock); in trim_no_bitmap()
3732 if (ctl->free_space < minlen) in trim_no_bitmap()
3735 entry = tree_search_offset(ctl, start, 0, 1); in trim_no_bitmap()
3759 spin_unlock(&ctl->tree_lock); in trim_no_bitmap()
3760 mutex_unlock(&ctl->cache_writeout_mutex); in trim_no_bitmap()
3763 unlink_free_space(ctl, entry, true); in trim_no_bitmap()
3776 link_free_space(ctl, entry); in trim_no_bitmap()
3784 spin_unlock(&ctl->tree_lock); in trim_no_bitmap()
3785 mutex_unlock(&ctl->cache_writeout_mutex); in trim_no_bitmap()
3789 unlink_free_space(ctl, entry, true); in trim_no_bitmap()
3793 spin_unlock(&ctl->tree_lock); in trim_no_bitmap()
3796 list_add_tail(&trim_entry.list, &ctl->trimming_ranges); in trim_no_bitmap()
3797 mutex_unlock(&ctl->cache_writeout_mutex); in trim_no_bitmap()
3824 spin_unlock(&ctl->tree_lock); in trim_no_bitmap()
3825 mutex_unlock(&ctl->cache_writeout_mutex); in trim_no_bitmap()
3844 static void reset_trimming_bitmap(struct btrfs_free_space_ctl *ctl, u64 offset) in reset_trimming_bitmap() argument
3848 spin_lock(&ctl->tree_lock); in reset_trimming_bitmap()
3849 entry = tree_search_offset(ctl, offset, 1, 0); in reset_trimming_bitmap()
3852 ctl->discardable_extents[BTRFS_STAT_CURR] += in reset_trimming_bitmap()
3854 ctl->discardable_bytes[BTRFS_STAT_CURR] += entry->bytes; in reset_trimming_bitmap()
3859 spin_unlock(&ctl->tree_lock); in reset_trimming_bitmap()
3862 static void end_trimming_bitmap(struct btrfs_free_space_ctl *ctl, in end_trimming_bitmap() argument
3867 ctl->discardable_extents[BTRFS_STAT_CURR] -= in end_trimming_bitmap()
3869 ctl->discardable_bytes[BTRFS_STAT_CURR] -= entry->bytes; in end_trimming_bitmap()
3882 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in trim_bitmaps() local
3887 u64 offset = offset_to_bitmap(ctl, start); in trim_bitmaps()
3894 mutex_lock(&ctl->cache_writeout_mutex); in trim_bitmaps()
3895 spin_lock(&ctl->tree_lock); in trim_bitmaps()
3897 if (ctl->free_space < minlen) { in trim_bitmaps()
3900 spin_unlock(&ctl->tree_lock); in trim_bitmaps()
3901 mutex_unlock(&ctl->cache_writeout_mutex); in trim_bitmaps()
3905 entry = tree_search_offset(ctl, offset, 1, 0); in trim_bitmaps()
3916 spin_unlock(&ctl->tree_lock); in trim_bitmaps()
3917 mutex_unlock(&ctl->cache_writeout_mutex); in trim_bitmaps()
3932 ret2 = search_bitmap(ctl, entry, &start, &bytes, false); in trim_bitmaps()
3939 end_trimming_bitmap(ctl, entry); in trim_bitmaps()
3942 spin_unlock(&ctl->tree_lock); in trim_bitmaps()
3943 mutex_unlock(&ctl->cache_writeout_mutex); in trim_bitmaps()
3953 spin_unlock(&ctl->tree_lock); in trim_bitmaps()
3954 mutex_unlock(&ctl->cache_writeout_mutex); in trim_bitmaps()
3960 spin_unlock(&ctl->tree_lock); in trim_bitmaps()
3961 mutex_unlock(&ctl->cache_writeout_mutex); in trim_bitmaps()
3976 bitmap_clear_bits(ctl, entry, start, bytes, true); in trim_bitmaps()
3978 free_bitmap(ctl, entry); in trim_bitmaps()
3980 spin_unlock(&ctl->tree_lock); in trim_bitmaps()
3983 list_add_tail(&trim_entry.list, &ctl->trimming_ranges); in trim_bitmaps()
3984 mutex_unlock(&ctl->cache_writeout_mutex); in trim_bitmaps()
3989 reset_trimming_bitmap(ctl, offset); in trim_bitmaps()
3996 offset += BITS_PER_BITMAP * ctl->unit; in trim_bitmaps()
4005 reset_trimming_bitmap(ctl, offset); in trim_bitmaps()
4023 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_trim_block_group() local
4044 div64_u64_rem(end, BITS_PER_BITMAP * ctl->unit, &rem); in btrfs_trim_block_group()
4047 reset_trimming_bitmap(ctl, offset_to_bitmap(ctl, end)); in btrfs_trim_block_group()
4192 struct btrfs_free_space_ctl *ctl = cache->free_space_ctl; in test_add_free_space_entry() local
4207 spin_lock(&ctl->tree_lock); in test_add_free_space_entry()
4211 ret = link_free_space(ctl, info); in test_add_free_space_entry()
4212 spin_unlock(&ctl->tree_lock); in test_add_free_space_entry()
4226 spin_lock(&ctl->tree_lock); in test_add_free_space_entry()
4227 bitmap_info = tree_search_offset(ctl, offset_to_bitmap(ctl, offset), in test_add_free_space_entry()
4232 add_new_bitmap(ctl, info, offset); in test_add_free_space_entry()
4237 bytes_added = add_bytes_to_bitmap(ctl, bitmap_info, offset, bytes, in test_add_free_space_entry()
4242 spin_unlock(&ctl->tree_lock); in test_add_free_space_entry()
4262 struct btrfs_free_space_ctl *ctl = cache->free_space_ctl; in test_check_exists() local
4266 spin_lock(&ctl->tree_lock); in test_check_exists()
4267 info = tree_search_offset(ctl, offset, 0, 0); in test_check_exists()
4269 info = tree_search_offset(ctl, offset_to_bitmap(ctl, offset), in test_check_exists()
4282 bit_bytes = ctl->unit; in test_check_exists()
4283 ret = search_bitmap(ctl, info, &bit_off, &bit_bytes, false); in test_check_exists()
4335 spin_unlock(&ctl->tree_lock); in test_check_exists()