Lines Matching refs:ctl
38 static int link_free_space(struct btrfs_free_space_ctl *ctl,
40 static void unlink_free_space(struct btrfs_free_space_ctl *ctl,
42 static int search_bitmap(struct btrfs_free_space_ctl *ctl,
45 static void free_bitmap(struct btrfs_free_space_ctl *ctl,
47 static void bitmap_clear_bits(struct btrfs_free_space_ctl *ctl,
51 static void __btrfs_remove_free_space_cache(struct btrfs_free_space_ctl *ctl) in __btrfs_remove_free_space_cache() argument
56 while ((node = rb_last(&ctl->free_space_offset)) != NULL) { in __btrfs_remove_free_space_cache()
59 unlink_free_space(ctl, info, true); in __btrfs_remove_free_space_cache()
62 free_bitmap(ctl, info); in __btrfs_remove_free_space_cache()
65 cond_resched_lock(&ctl->tree_lock); in __btrfs_remove_free_space_cache()
699 static void recalculate_thresholds(struct btrfs_free_space_ctl *ctl) in recalculate_thresholds() argument
701 struct btrfs_block_group *block_group = ctl->block_group; in recalculate_thresholds()
706 u64 bytes_per_bg = BITS_PER_BITMAP * ctl->unit; in recalculate_thresholds()
711 if (ctl->total_bitmaps > max_bitmaps) in recalculate_thresholds()
715 ctl->total_bitmaps, ctl->unit, max_bitmaps, in recalculate_thresholds()
717 ASSERT(ctl->total_bitmaps <= max_bitmaps); in recalculate_thresholds()
730 bitmap_bytes = ctl->total_bitmaps * ctl->unit; in recalculate_thresholds()
739 ctl->extents_thresh = in recalculate_thresholds()
744 struct btrfs_free_space_ctl *ctl, in __load_free_space_cache() argument
842 spin_lock(&ctl->tree_lock); in __load_free_space_cache()
843 ret = link_free_space(ctl, e); in __load_free_space_cache()
844 spin_unlock(&ctl->tree_lock); in __load_free_space_cache()
862 spin_lock(&ctl->tree_lock); in __load_free_space_cache()
863 ret = link_free_space(ctl, e); 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()
900 spin_lock(&ctl->tree_lock); in __load_free_space_cache()
901 __btrfs_remove_free_space_cache(ctl); in __load_free_space_cache()
902 spin_unlock(&ctl->tree_lock); in __load_free_space_cache()
907 struct btrfs_free_space_ctl *ctl) in copy_free_space_cache() argument
913 while (!ret && (n = rb_first(&ctl->free_space_offset)) != NULL) { in copy_free_space_cache()
916 unlink_free_space(ctl, info, true); in copy_free_space_cache()
922 u64 bytes = ctl->unit; in copy_free_space_cache()
924 while (search_bitmap(ctl, info, &offset, &bytes, in copy_free_space_cache()
930 bitmap_clear_bits(ctl, info, offset, bytes, true); in copy_free_space_cache()
932 bytes = ctl->unit; in copy_free_space_cache()
934 free_bitmap(ctl, info); in copy_free_space_cache()
946 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()
1381 struct btrfs_free_space_ctl *ctl, in __btrfs_write_out_cache() argument
1426 mutex_lock(&ctl->cache_writeout_mutex); in __btrfs_write_out_cache()
1428 spin_lock(&ctl->tree_lock); in __btrfs_write_out_cache()
1429 ret = write_cache_extent_entries(io_ctl, ctl, in __btrfs_write_out_cache()
1453 spin_unlock(&ctl->tree_lock); in __btrfs_write_out_cache()
1454 mutex_unlock(&ctl->cache_writeout_mutex); in __btrfs_write_out_cache()
1496 spin_unlock(&ctl->tree_lock); in __btrfs_write_out_cache()
1497 mutex_unlock(&ctl->cache_writeout_mutex); in __btrfs_write_out_cache()
1524 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_write_out_cache() local
1539 ret = __btrfs_write_out_cache(fs_info->tree_root, inode, ctl, in btrfs_write_out_cache()
1574 static inline u64 offset_to_bitmap(struct btrfs_free_space_ctl *ctl, in offset_to_bitmap() argument
1580 bytes_per_bitmap = BITS_PER_BITMAP * ctl->unit; in offset_to_bitmap()
1581 bitmap_start = offset - ctl->start; in offset_to_bitmap()
1584 bitmap_start += ctl->start; in offset_to_bitmap()
1692 tree_search_offset(struct btrfs_free_space_ctl *ctl, in tree_search_offset() argument
1695 struct rb_node *n = ctl->free_space_offset.rb_node; in tree_search_offset()
1778 if (entry->offset + BITS_PER_BITMAP * ctl->unit > offset) in tree_search_offset()
1793 ctl->unit > offset) in tree_search_offset()
1803 static inline void unlink_free_space(struct btrfs_free_space_ctl *ctl, in unlink_free_space() argument
1807 rb_erase(&info->offset_index, &ctl->free_space_offset); in unlink_free_space()
1808 rb_erase_cached(&info->bytes_index, &ctl->free_space_bytes); in unlink_free_space()
1809 ctl->free_extents--; in unlink_free_space()
1812 ctl->discardable_extents[BTRFS_STAT_CURR]--; in unlink_free_space()
1813 ctl->discardable_bytes[BTRFS_STAT_CURR] -= info->bytes; in unlink_free_space()
1817 ctl->free_space -= info->bytes; in unlink_free_space()
1820 static int link_free_space(struct btrfs_free_space_ctl *ctl, in link_free_space() argument
1826 ret = tree_insert_offset(&ctl->free_space_offset, info->offset, in link_free_space()
1831 rb_add_cached(&info->bytes_index, &ctl->free_space_bytes, entry_less); in link_free_space()
1834 ctl->discardable_extents[BTRFS_STAT_CURR]++; in link_free_space()
1835 ctl->discardable_bytes[BTRFS_STAT_CURR] += info->bytes; in link_free_space()
1838 ctl->free_space += info->bytes; in link_free_space()
1839 ctl->free_extents++; in link_free_space()
1843 static void relink_bitmap_entry(struct btrfs_free_space_ctl *ctl, in relink_bitmap_entry() argument
1855 rb_erase_cached(&info->bytes_index, &ctl->free_space_bytes); in relink_bitmap_entry()
1856 rb_add_cached(&info->bytes_index, &ctl->free_space_bytes, entry_less); in relink_bitmap_entry()
1859 static inline void bitmap_clear_bits(struct btrfs_free_space_ctl *ctl, in bitmap_clear_bits() argument
1866 start = offset_to_bit(info->offset, ctl->unit, offset); in bitmap_clear_bits()
1867 count = bytes_to_bits(bytes, ctl->unit); in bitmap_clear_bits()
1874 if (info->max_extent_size > ctl->unit) in bitmap_clear_bits()
1877 relink_bitmap_entry(ctl, info); in bitmap_clear_bits()
1887 ctl->discardable_extents[BTRFS_STAT_CURR] += extent_delta; in bitmap_clear_bits()
1888 ctl->discardable_bytes[BTRFS_STAT_CURR] -= bytes; in bitmap_clear_bits()
1892 ctl->free_space -= bytes; in bitmap_clear_bits()
1895 static void bitmap_set_bits(struct btrfs_free_space_ctl *ctl, in bitmap_set_bits() argument
1902 start = offset_to_bit(info->offset, ctl->unit, offset); in bitmap_set_bits()
1903 count = bytes_to_bits(bytes, ctl->unit); in bitmap_set_bits()
1915 ctl->free_space += bytes; in bitmap_set_bits()
1917 relink_bitmap_entry(ctl, info); in bitmap_set_bits()
1927 ctl->discardable_extents[BTRFS_STAT_CURR] += extent_delta; in bitmap_set_bits()
1928 ctl->discardable_bytes[BTRFS_STAT_CURR] += bytes; in bitmap_set_bits()
1936 static int search_bitmap(struct btrfs_free_space_ctl *ctl, in search_bitmap() argument
1957 i = offset_to_bit(bitmap_info->offset, ctl->unit, in search_bitmap()
1959 bits = bytes_to_bits(*bytes, ctl->unit); in search_bitmap()
1979 *offset = (u64)(i * ctl->unit) + bitmap_info->offset; in search_bitmap()
1980 *bytes = (u64)(found_bits) * ctl->unit; in search_bitmap()
1984 *bytes = (u64)(max_bits) * ctl->unit; in search_bitmap()
1986 relink_bitmap_entry(ctl, bitmap_info); in search_bitmap()
1992 find_free_space(struct btrfs_free_space_ctl *ctl, u64 *offset, u64 *bytes, in find_free_space() argument
2001 if (!ctl->free_space_offset.rb_node) in find_free_space()
2005 node = rb_first_cached(&ctl->free_space_bytes); in find_free_space()
2007 entry = tree_search_offset(ctl, offset_to_bitmap(ctl, *offset), in find_free_space()
2042 tmp = entry->offset - ctl->start + align - 1; in find_free_space()
2044 tmp = tmp * align + ctl->start; in find_free_space()
2068 ret = search_bitmap(ctl, entry, &tmp, &size, true); in find_free_space()
2098 static void add_new_bitmap(struct btrfs_free_space_ctl *ctl, in add_new_bitmap() argument
2101 info->offset = offset_to_bitmap(ctl, offset); in add_new_bitmap()
2105 link_free_space(ctl, info); in add_new_bitmap()
2106 ctl->total_bitmaps++; in add_new_bitmap()
2107 recalculate_thresholds(ctl); in add_new_bitmap()
2110 static void free_bitmap(struct btrfs_free_space_ctl *ctl, in free_bitmap() argument
2120 ctl->discardable_extents[BTRFS_STAT_CURR] -= in free_bitmap()
2122 ctl->discardable_bytes[BTRFS_STAT_CURR] -= bitmap_info->bytes; in free_bitmap()
2125 unlink_free_space(ctl, bitmap_info, true); in free_bitmap()
2128 ctl->total_bitmaps--; in free_bitmap()
2129 recalculate_thresholds(ctl); in free_bitmap()
2132 static noinline int remove_from_bitmap(struct btrfs_free_space_ctl *ctl, in remove_from_bitmap() argument
2141 end = bitmap_info->offset + (u64)(BITS_PER_BITMAP * ctl->unit) - 1; in remove_from_bitmap()
2150 search_bytes = ctl->unit; in remove_from_bitmap()
2152 ret = search_bitmap(ctl, bitmap_info, &search_start, &search_bytes, in remove_from_bitmap()
2163 bitmap_clear_bits(ctl, bitmap_info, search_start, search_bytes, true); in remove_from_bitmap()
2170 free_bitmap(ctl, bitmap_info); in remove_from_bitmap()
2196 search_bytes = ctl->unit; in remove_from_bitmap()
2197 ret = search_bitmap(ctl, bitmap_info, &search_start, in remove_from_bitmap()
2204 free_bitmap(ctl, bitmap_info); in remove_from_bitmap()
2209 static u64 add_bytes_to_bitmap(struct btrfs_free_space_ctl *ctl, in add_bytes_to_bitmap() argument
2222 ctl->discardable_extents[BTRFS_STAT_CURR] += in add_bytes_to_bitmap()
2224 ctl->discardable_bytes[BTRFS_STAT_CURR] += info->bytes; in add_bytes_to_bitmap()
2229 end = info->offset + (u64)(BITS_PER_BITMAP * ctl->unit); in add_bytes_to_bitmap()
2233 bitmap_set_bits(ctl, info, offset, bytes_to_set); in add_bytes_to_bitmap()
2239 static bool use_bitmap(struct btrfs_free_space_ctl *ctl, in use_bitmap() argument
2242 struct btrfs_block_group *block_group = ctl->block_group; in use_bitmap()
2259 if (!forced && ctl->free_extents < ctl->extents_thresh) { in use_bitmap()
2268 if (ctl->free_extents * 3 <= ctl->extents_thresh) in use_bitmap()
2283 if (((BITS_PER_BITMAP * ctl->unit) >> 1) > block_group->length) in use_bitmap()
2293 static int insert_into_bitmap(struct btrfs_free_space_ctl *ctl, in insert_into_bitmap() argument
2307 if (!ctl->op->use_bitmap(ctl, info)) in insert_into_bitmap()
2310 if (ctl->op == &free_space_op) in insert_into_bitmap()
2311 block_group = ctl->block_group; in insert_into_bitmap()
2339 if (entry->offset == offset_to_bitmap(ctl, offset)) { in insert_into_bitmap()
2340 bytes_added = add_bytes_to_bitmap(ctl, entry, offset, in insert_into_bitmap()
2353 bitmap_info = tree_search_offset(ctl, offset_to_bitmap(ctl, offset), in insert_into_bitmap()
2360 bytes_added = add_bytes_to_bitmap(ctl, bitmap_info, offset, bytes, in insert_into_bitmap()
2374 add_new_bitmap(ctl, info, offset); in insert_into_bitmap()
2379 spin_unlock(&ctl->tree_lock); in insert_into_bitmap()
2386 spin_lock(&ctl->tree_lock); in insert_into_bitmap()
2396 spin_lock(&ctl->tree_lock); in insert_into_bitmap()
2431 static bool try_merge_free_space(struct btrfs_free_space_ctl *ctl, in try_merge_free_space() argument
2446 right_info = tree_search_offset(ctl, offset + bytes, 0, 0); in try_merge_free_space()
2451 left_info = tree_search_offset(ctl, offset - 1, 0, 0); in try_merge_free_space()
2456 unlink_free_space(ctl, right_info, update_stat); in try_merge_free_space()
2466 unlink_free_space(ctl, left_info, update_stat); in try_merge_free_space()
2476 static bool steal_from_bitmap_to_end(struct btrfs_free_space_ctl *ctl, in steal_from_bitmap_to_end() argument
2484 const u64 bitmap_offset = offset_to_bitmap(ctl, end); in steal_from_bitmap_to_end()
2487 bitmap = tree_search_offset(ctl, bitmap_offset, 1, 0); in steal_from_bitmap_to_end()
2491 i = offset_to_bit(bitmap->offset, ctl->unit, end); in steal_from_bitmap_to_end()
2495 bytes = (j - i) * ctl->unit; in steal_from_bitmap_to_end()
2502 bitmap_clear_bits(ctl, bitmap, end, bytes, update_stat); in steal_from_bitmap_to_end()
2505 free_bitmap(ctl, bitmap); in steal_from_bitmap_to_end()
2510 static bool steal_from_bitmap_to_front(struct btrfs_free_space_ctl *ctl, in steal_from_bitmap_to_front() argument
2521 bitmap_offset = offset_to_bitmap(ctl, info->offset); in steal_from_bitmap_to_front()
2526 bitmap_offset = offset_to_bitmap(ctl, info->offset - 1); in steal_from_bitmap_to_front()
2529 bitmap = tree_search_offset(ctl, bitmap_offset, 1, 0); in steal_from_bitmap_to_front()
2533 i = offset_to_bit(bitmap->offset, ctl->unit, info->offset) - 1; in steal_from_bitmap_to_front()
2545 bytes = (i + 1) * ctl->unit; in steal_from_bitmap_to_front()
2547 bytes = (i - prev_j) * ctl->unit; in steal_from_bitmap_to_front()
2556 bitmap_clear_bits(ctl, bitmap, info->offset, bytes, update_stat); in steal_from_bitmap_to_front()
2559 free_bitmap(ctl, bitmap); in steal_from_bitmap_to_front()
2575 static void steal_from_bitmap(struct btrfs_free_space_ctl *ctl, in steal_from_bitmap() argument
2586 if (ctl->total_bitmaps > 0) { in steal_from_bitmap()
2590 stole_end = steal_from_bitmap_to_end(ctl, info, update_stat); in steal_from_bitmap()
2591 if (ctl->total_bitmaps > 0) in steal_from_bitmap()
2592 stole_front = steal_from_bitmap_to_front(ctl, info, in steal_from_bitmap()
2596 try_merge_free_space(ctl, info, update_stat); in steal_from_bitmap()
2605 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in __btrfs_add_free_space() local
2622 spin_lock(&ctl->tree_lock); in __btrfs_add_free_space()
2624 if (try_merge_free_space(ctl, info, true)) in __btrfs_add_free_space()
2632 ret = insert_into_bitmap(ctl, info); in __btrfs_add_free_space()
2646 steal_from_bitmap(ctl, info, true); in __btrfs_add_free_space()
2650 ret = link_free_space(ctl, info); in __btrfs_add_free_space()
2655 spin_unlock(&ctl->tree_lock); in __btrfs_add_free_space()
2674 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in __btrfs_add_free_space_zoned() local
2686 spin_lock(&ctl->tree_lock); in __btrfs_add_free_space_zoned()
2699 ctl->free_space += to_free; in __btrfs_add_free_space_zoned()
2706 spin_unlock(&ctl->tree_lock); in __btrfs_add_free_space_zoned()
2777 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_remove_free_space() local
2802 spin_lock(&ctl->tree_lock); in btrfs_remove_free_space()
2809 info = tree_search_offset(ctl, offset, 0, 0); in btrfs_remove_free_space()
2815 info = tree_search_offset(ctl, offset_to_bitmap(ctl, offset), in btrfs_remove_free_space()
2830 unlink_free_space(ctl, info, true); in btrfs_remove_free_space()
2837 ret = link_free_space(ctl, info); in btrfs_remove_free_space()
2850 ret = link_free_space(ctl, info); in btrfs_remove_free_space()
2864 spin_unlock(&ctl->tree_lock); in btrfs_remove_free_space()
2875 ret = remove_from_bitmap(ctl, info, &offset, &bytes); in btrfs_remove_free_space()
2882 spin_unlock(&ctl->tree_lock); in btrfs_remove_free_space()
2891 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_dump_free_space() local
2908 spin_lock(&ctl->tree_lock); in btrfs_dump_free_space()
2909 for (n = rb_first(&ctl->free_space_offset); n; n = rb_next(n)) { in btrfs_dump_free_space()
2917 spin_unlock(&ctl->tree_lock); in btrfs_dump_free_space()
2925 struct btrfs_free_space_ctl *ctl) in btrfs_init_free_space_ctl() argument
2929 spin_lock_init(&ctl->tree_lock); in btrfs_init_free_space_ctl()
2930 ctl->unit = fs_info->sectorsize; in btrfs_init_free_space_ctl()
2931 ctl->start = block_group->start; in btrfs_init_free_space_ctl()
2932 ctl->block_group = block_group; in btrfs_init_free_space_ctl()
2933 ctl->op = &free_space_op; in btrfs_init_free_space_ctl()
2934 ctl->free_space_bytes = RB_ROOT_CACHED; in btrfs_init_free_space_ctl()
2935 INIT_LIST_HEAD(&ctl->trimming_ranges); in btrfs_init_free_space_ctl()
2936 mutex_init(&ctl->cache_writeout_mutex); in btrfs_init_free_space_ctl()
2943 ctl->extents_thresh = (SZ_32K / 2) / sizeof(struct btrfs_free_space); in btrfs_init_free_space_ctl()
2956 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in __btrfs_return_cluster_to_free_space() local
2983 ctl->discardable_extents[BTRFS_STAT_CURR]--; in __btrfs_return_cluster_to_free_space()
2984 ctl->discardable_bytes[BTRFS_STAT_CURR] -= in __btrfs_return_cluster_to_free_space()
2988 try_merge_free_space(ctl, entry, false); in __btrfs_return_cluster_to_free_space()
2989 steal_from_bitmap(ctl, entry, false); in __btrfs_return_cluster_to_free_space()
2993 ctl->discardable_extents[BTRFS_STAT_CURR]++; in __btrfs_return_cluster_to_free_space()
2994 ctl->discardable_bytes[BTRFS_STAT_CURR] += in __btrfs_return_cluster_to_free_space()
2998 tree_insert_offset(&ctl->free_space_offset, in __btrfs_return_cluster_to_free_space()
3000 rb_add_cached(&entry->bytes_index, &ctl->free_space_bytes, in __btrfs_return_cluster_to_free_space()
3010 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_remove_free_space_cache() local
3014 spin_lock(&ctl->tree_lock); in btrfs_remove_free_space_cache()
3023 cond_resched_lock(&ctl->tree_lock); in btrfs_remove_free_space_cache()
3025 __btrfs_remove_free_space_cache(ctl); in btrfs_remove_free_space_cache()
3027 spin_unlock(&ctl->tree_lock); in btrfs_remove_free_space_cache()
3039 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_is_free_space_trimmed() local
3044 spin_lock(&ctl->tree_lock); in btrfs_is_free_space_trimmed()
3045 node = rb_first(&ctl->free_space_offset); in btrfs_is_free_space_trimmed()
3058 spin_unlock(&ctl->tree_lock); in btrfs_is_free_space_trimmed()
3066 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_find_space_for_alloc() local
3079 spin_lock(&ctl->tree_lock); in btrfs_find_space_for_alloc()
3080 entry = find_free_space(ctl, &offset, &bytes_search, in btrfs_find_space_for_alloc()
3088 bitmap_clear_bits(ctl, entry, offset, bytes, true); in btrfs_find_space_for_alloc()
3094 free_bitmap(ctl, entry); in btrfs_find_space_for_alloc()
3096 unlink_free_space(ctl, entry, true); in btrfs_find_space_for_alloc()
3111 link_free_space(ctl, entry); in btrfs_find_space_for_alloc()
3115 spin_unlock(&ctl->tree_lock); in btrfs_find_space_for_alloc()
3135 struct btrfs_free_space_ctl *ctl; in btrfs_return_cluster_to_free_space() local
3153 ctl = block_group->free_space_ctl; in btrfs_return_cluster_to_free_space()
3156 spin_lock(&ctl->tree_lock); in btrfs_return_cluster_to_free_space()
3158 spin_unlock(&ctl->tree_lock); in btrfs_return_cluster_to_free_space()
3172 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_alloc_from_bitmap() local
3181 err = search_bitmap(ctl, entry, &search_start, &search_bytes, true); in btrfs_alloc_from_bitmap()
3189 bitmap_clear_bits(ctl, entry, ret, bytes, false); in btrfs_alloc_from_bitmap()
3203 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_alloc_from_cluster() local
3268 spin_lock(&ctl->tree_lock); in btrfs_alloc_from_cluster()
3273 ctl->free_space -= bytes; in btrfs_alloc_from_cluster()
3275 ctl->discardable_bytes[BTRFS_STAT_CURR] -= bytes; in btrfs_alloc_from_cluster()
3280 ctl->free_extents--; in btrfs_alloc_from_cluster()
3284 ctl->total_bitmaps--; in btrfs_alloc_from_cluster()
3285 recalculate_thresholds(ctl); in btrfs_alloc_from_cluster()
3287 ctl->discardable_extents[BTRFS_STAT_CURR]--; in btrfs_alloc_from_cluster()
3293 spin_unlock(&ctl->tree_lock); in btrfs_alloc_from_cluster()
3304 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_bitmap_cluster() local
3315 i = offset_to_bit(entry->offset, ctl->unit, in btrfs_bitmap_cluster()
3317 want_bits = bytes_to_bits(bytes, ctl->unit); in btrfs_bitmap_cluster()
3318 min_bits = bytes_to_bits(min_bytes, ctl->unit); in btrfs_bitmap_cluster()
3344 entry->max_extent_size = (u64)max_bits * ctl->unit; in btrfs_bitmap_cluster()
3355 if (cluster->max_size < found_bits * ctl->unit) in btrfs_bitmap_cluster()
3356 cluster->max_size = found_bits * ctl->unit; in btrfs_bitmap_cluster()
3363 cluster->window_start = start * ctl->unit + entry->offset; in btrfs_bitmap_cluster()
3364 rb_erase(&entry->offset_index, &ctl->free_space_offset); in btrfs_bitmap_cluster()
3365 rb_erase_cached(&entry->bytes_index, &ctl->free_space_bytes); in btrfs_bitmap_cluster()
3381 total_found * ctl->unit, 1); in btrfs_bitmap_cluster()
3396 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in setup_cluster_no_bitmap() local
3405 entry = tree_search_offset(ctl, offset, 0, 1); in setup_cluster_no_bitmap()
3465 rb_erase(&entry->offset_index, &ctl->free_space_offset); in setup_cluster_no_bitmap()
3466 rb_erase_cached(&entry->bytes_index, &ctl->free_space_bytes); in setup_cluster_no_bitmap()
3488 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in setup_cluster_bitmap() local
3491 u64 bitmap_offset = offset_to_bitmap(ctl, offset); in setup_cluster_bitmap()
3493 if (ctl->total_bitmaps == 0) in setup_cluster_bitmap()
3504 entry = tree_search_offset(ctl, bitmap_offset, 1, 0); in setup_cluster_bitmap()
3538 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_find_space_cluster() local
3562 spin_lock(&ctl->tree_lock); in btrfs_find_space_cluster()
3568 if (ctl->free_space < bytes) { in btrfs_find_space_cluster()
3569 spin_unlock(&ctl->tree_lock); in btrfs_find_space_cluster()
3606 spin_unlock(&ctl->tree_lock); in btrfs_find_space_cluster()
3633 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in do_trimming() local
3657 mutex_lock(&ctl->cache_writeout_mutex); in do_trimming()
3667 mutex_unlock(&ctl->cache_writeout_mutex); in do_trimming()
3692 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in trim_no_bitmap() local
3705 mutex_lock(&ctl->cache_writeout_mutex); in trim_no_bitmap()
3706 spin_lock(&ctl->tree_lock); in trim_no_bitmap()
3708 if (ctl->free_space < minlen) in trim_no_bitmap()
3711 entry = tree_search_offset(ctl, start, 0, 1); in trim_no_bitmap()
3735 spin_unlock(&ctl->tree_lock); in trim_no_bitmap()
3736 mutex_unlock(&ctl->cache_writeout_mutex); in trim_no_bitmap()
3739 unlink_free_space(ctl, entry, true); in trim_no_bitmap()
3752 link_free_space(ctl, entry); in trim_no_bitmap()
3760 spin_unlock(&ctl->tree_lock); in trim_no_bitmap()
3761 mutex_unlock(&ctl->cache_writeout_mutex); in trim_no_bitmap()
3765 unlink_free_space(ctl, entry, true); in trim_no_bitmap()
3769 spin_unlock(&ctl->tree_lock); in trim_no_bitmap()
3772 list_add_tail(&trim_entry.list, &ctl->trimming_ranges); in trim_no_bitmap()
3773 mutex_unlock(&ctl->cache_writeout_mutex); in trim_no_bitmap()
3800 spin_unlock(&ctl->tree_lock); in trim_no_bitmap()
3801 mutex_unlock(&ctl->cache_writeout_mutex); in trim_no_bitmap()
3820 static void reset_trimming_bitmap(struct btrfs_free_space_ctl *ctl, u64 offset) in reset_trimming_bitmap() argument
3824 spin_lock(&ctl->tree_lock); in reset_trimming_bitmap()
3825 entry = tree_search_offset(ctl, offset, 1, 0); in reset_trimming_bitmap()
3828 ctl->discardable_extents[BTRFS_STAT_CURR] += in reset_trimming_bitmap()
3830 ctl->discardable_bytes[BTRFS_STAT_CURR] += entry->bytes; in reset_trimming_bitmap()
3835 spin_unlock(&ctl->tree_lock); in reset_trimming_bitmap()
3838 static void end_trimming_bitmap(struct btrfs_free_space_ctl *ctl, in end_trimming_bitmap() argument
3843 ctl->discardable_extents[BTRFS_STAT_CURR] -= in end_trimming_bitmap()
3845 ctl->discardable_bytes[BTRFS_STAT_CURR] -= entry->bytes; in end_trimming_bitmap()
3858 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in trim_bitmaps() local
3863 u64 offset = offset_to_bitmap(ctl, start); in trim_bitmaps()
3870 mutex_lock(&ctl->cache_writeout_mutex); in trim_bitmaps()
3871 spin_lock(&ctl->tree_lock); in trim_bitmaps()
3873 if (ctl->free_space < minlen) { in trim_bitmaps()
3876 spin_unlock(&ctl->tree_lock); in trim_bitmaps()
3877 mutex_unlock(&ctl->cache_writeout_mutex); in trim_bitmaps()
3881 entry = tree_search_offset(ctl, offset, 1, 0); in trim_bitmaps()
3892 spin_unlock(&ctl->tree_lock); in trim_bitmaps()
3893 mutex_unlock(&ctl->cache_writeout_mutex); in trim_bitmaps()
3908 ret2 = search_bitmap(ctl, entry, &start, &bytes, false); in trim_bitmaps()
3915 end_trimming_bitmap(ctl, entry); in trim_bitmaps()
3918 spin_unlock(&ctl->tree_lock); in trim_bitmaps()
3919 mutex_unlock(&ctl->cache_writeout_mutex); in trim_bitmaps()
3929 spin_unlock(&ctl->tree_lock); in trim_bitmaps()
3930 mutex_unlock(&ctl->cache_writeout_mutex); in trim_bitmaps()
3936 spin_unlock(&ctl->tree_lock); in trim_bitmaps()
3937 mutex_unlock(&ctl->cache_writeout_mutex); in trim_bitmaps()
3952 bitmap_clear_bits(ctl, entry, start, bytes, true); in trim_bitmaps()
3954 free_bitmap(ctl, entry); in trim_bitmaps()
3956 spin_unlock(&ctl->tree_lock); in trim_bitmaps()
3959 list_add_tail(&trim_entry.list, &ctl->trimming_ranges); in trim_bitmaps()
3960 mutex_unlock(&ctl->cache_writeout_mutex); in trim_bitmaps()
3965 reset_trimming_bitmap(ctl, offset); in trim_bitmaps()
3972 offset += BITS_PER_BITMAP * ctl->unit; in trim_bitmaps()
3981 reset_trimming_bitmap(ctl, offset); in trim_bitmaps()
3999 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_trim_block_group() local
4020 div64_u64_rem(end, BITS_PER_BITMAP * ctl->unit, &rem); in btrfs_trim_block_group()
4023 reset_trimming_bitmap(ctl, offset_to_bitmap(ctl, end)); in btrfs_trim_block_group()
4145 struct btrfs_free_space_ctl *ctl = cache->free_space_ctl; in test_add_free_space_entry() local
4160 spin_lock(&ctl->tree_lock); in test_add_free_space_entry()
4164 ret = link_free_space(ctl, info); in test_add_free_space_entry()
4165 spin_unlock(&ctl->tree_lock); in test_add_free_space_entry()
4179 spin_lock(&ctl->tree_lock); in test_add_free_space_entry()
4180 bitmap_info = tree_search_offset(ctl, offset_to_bitmap(ctl, offset), in test_add_free_space_entry()
4185 add_new_bitmap(ctl, info, offset); in test_add_free_space_entry()
4190 bytes_added = add_bytes_to_bitmap(ctl, bitmap_info, offset, bytes, in test_add_free_space_entry()
4195 spin_unlock(&ctl->tree_lock); in test_add_free_space_entry()
4215 struct btrfs_free_space_ctl *ctl = cache->free_space_ctl; in test_check_exists() local
4219 spin_lock(&ctl->tree_lock); in test_check_exists()
4220 info = tree_search_offset(ctl, offset, 0, 0); in test_check_exists()
4222 info = tree_search_offset(ctl, offset_to_bitmap(ctl, offset), in test_check_exists()
4235 bit_bytes = ctl->unit; in test_check_exists()
4236 ret = search_bitmap(ctl, info, &bit_off, &bit_bytes, false); in test_check_exists()
4288 spin_unlock(&ctl->tree_lock); in test_check_exists()