Lines Matching full:ctl
47 static int link_free_space(struct btrfs_free_space_ctl *ctl,
49 static void unlink_free_space(struct btrfs_free_space_ctl *ctl,
51 static int search_bitmap(struct btrfs_free_space_ctl *ctl,
54 static void free_bitmap(struct btrfs_free_space_ctl *ctl,
56 static void bitmap_clear_bits(struct btrfs_free_space_ctl *ctl,
65 static void __btrfs_remove_free_space_cache(struct btrfs_free_space_ctl *ctl) in __btrfs_remove_free_space_cache() argument
70 while ((node = rb_last(&ctl->free_space_offset)) != NULL) { in __btrfs_remove_free_space_cache()
73 unlink_free_space(ctl, info, true); in __btrfs_remove_free_space_cache()
76 free_bitmap(ctl, info); in __btrfs_remove_free_space_cache()
79 cond_resched_lock(&ctl->tree_lock); in __btrfs_remove_free_space_cache()
694 static void recalculate_thresholds(struct btrfs_free_space_ctl *ctl) in recalculate_thresholds() argument
696 struct btrfs_block_group *block_group = ctl->block_group; in recalculate_thresholds()
701 u64 bytes_per_bg = BITS_PER_BITMAP * ctl->unit; in recalculate_thresholds()
706 if (ctl->total_bitmaps > max_bitmaps) in recalculate_thresholds()
710 ctl->total_bitmaps, ctl->unit, max_bitmaps, in recalculate_thresholds()
712 ASSERT(ctl->total_bitmaps <= max_bitmaps); in recalculate_thresholds()
725 bitmap_bytes = ctl->total_bitmaps * ctl->unit; in recalculate_thresholds()
734 ctl->extents_thresh = in recalculate_thresholds()
739 struct btrfs_free_space_ctl *ctl, in __load_free_space_cache() argument
837 spin_lock(&ctl->tree_lock); in __load_free_space_cache()
838 ret = link_free_space(ctl, e); in __load_free_space_cache()
839 spin_unlock(&ctl->tree_lock); in __load_free_space_cache()
857 spin_lock(&ctl->tree_lock); in __load_free_space_cache()
858 ret = link_free_space(ctl, e); in __load_free_space_cache()
860 spin_unlock(&ctl->tree_lock); in __load_free_space_cache()
866 ctl->total_bitmaps++; in __load_free_space_cache()
867 recalculate_thresholds(ctl); in __load_free_space_cache()
868 spin_unlock(&ctl->tree_lock); in __load_free_space_cache()
896 spin_lock(&ctl->tree_lock); in __load_free_space_cache()
897 __btrfs_remove_free_space_cache(ctl); in __load_free_space_cache()
898 spin_unlock(&ctl->tree_lock); in __load_free_space_cache()
903 struct btrfs_free_space_ctl *ctl) in copy_free_space_cache() argument
909 while (!ret && (n = rb_first(&ctl->free_space_offset)) != NULL) { in copy_free_space_cache()
915 unlink_free_space(ctl, info, true); in copy_free_space_cache()
916 spin_unlock(&ctl->tree_lock); in copy_free_space_cache()
919 spin_lock(&ctl->tree_lock); in copy_free_space_cache()
922 u64 bytes = ctl->unit; in copy_free_space_cache()
924 ret = search_bitmap(ctl, info, &offset, &bytes, false); in copy_free_space_cache()
926 bitmap_clear_bits(ctl, info, offset, bytes, true); in copy_free_space_cache()
927 spin_unlock(&ctl->tree_lock); in copy_free_space_cache()
930 spin_lock(&ctl->tree_lock); in copy_free_space_cache()
932 free_bitmap(ctl, info); in copy_free_space_cache()
936 cond_resched_lock(&ctl->tree_lock); in copy_free_space_cache()
946 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in load_free_space_cache() local
957 * valid copy it all into the actual free space ctl. in load_free_space_cache()
1065 spin_lock(&ctl->tree_lock); in load_free_space_cache()
1067 spin_unlock(&ctl->tree_lock); in load_free_space_cache()
1074 struct btrfs_free_space_ctl *ctl, in write_cache_extent_entries() argument
1082 struct rb_node *node = rb_first(&ctl->free_space_offset); in write_cache_extent_entries()
1134 list_for_each_entry(trim_entry, &ctl->trimming_ranges, list) { in write_cache_extent_entries()
1371 * @ctl: free space cache we are going to write out
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(inode, ctl, block_group, 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()
1589 static int tree_insert_offset(struct btrfs_free_space_ctl *ctl, in tree_insert_offset() argument
1597 lockdep_assert_held(&ctl->tree_lock); in tree_insert_offset()
1603 root = &ctl->free_space_offset; in tree_insert_offset()
1706 tree_search_offset(struct btrfs_free_space_ctl *ctl, in tree_search_offset() argument
1709 struct rb_node *n = ctl->free_space_offset.rb_node; in tree_search_offset()
1712 lockdep_assert_held(&ctl->tree_lock); in tree_search_offset()
1794 if (entry->offset + BITS_PER_BITMAP * ctl->unit > offset) in tree_search_offset()
1809 ctl->unit > offset) in tree_search_offset()
1819 static inline void unlink_free_space(struct btrfs_free_space_ctl *ctl, in unlink_free_space() argument
1823 lockdep_assert_held(&ctl->tree_lock); in unlink_free_space()
1825 rb_erase(&info->offset_index, &ctl->free_space_offset); in unlink_free_space()
1826 rb_erase_cached(&info->bytes_index, &ctl->free_space_bytes); in unlink_free_space()
1827 ctl->free_extents--; in unlink_free_space()
1830 ctl->discardable_extents[BTRFS_STAT_CURR]--; in unlink_free_space()
1831 ctl->discardable_bytes[BTRFS_STAT_CURR] -= info->bytes; in unlink_free_space()
1835 ctl->free_space -= info->bytes; in unlink_free_space()
1838 static int link_free_space(struct btrfs_free_space_ctl *ctl, in link_free_space() argument
1843 lockdep_assert_held(&ctl->tree_lock); in link_free_space()
1846 ret = tree_insert_offset(ctl, NULL, info); in link_free_space()
1850 rb_add_cached(&info->bytes_index, &ctl->free_space_bytes, entry_less); in link_free_space()
1853 ctl->discardable_extents[BTRFS_STAT_CURR]++; in link_free_space()
1854 ctl->discardable_bytes[BTRFS_STAT_CURR] += info->bytes; in link_free_space()
1857 ctl->free_space += info->bytes; in link_free_space()
1858 ctl->free_extents++; in link_free_space()
1862 static void relink_bitmap_entry(struct btrfs_free_space_ctl *ctl, in relink_bitmap_entry() argument
1869 * want to re-link it into our ctl bytes index. in relink_bitmap_entry()
1874 lockdep_assert_held(&ctl->tree_lock); in relink_bitmap_entry()
1876 rb_erase_cached(&info->bytes_index, &ctl->free_space_bytes); in relink_bitmap_entry()
1877 rb_add_cached(&info->bytes_index, &ctl->free_space_bytes, entry_less); in relink_bitmap_entry()
1880 static inline void bitmap_clear_bits(struct btrfs_free_space_ctl *ctl, in bitmap_clear_bits() argument
1887 start = offset_to_bit(info->offset, ctl->unit, offset); in bitmap_clear_bits()
1888 count = bytes_to_bits(bytes, ctl->unit); in bitmap_clear_bits()
1895 if (info->max_extent_size > ctl->unit) in bitmap_clear_bits()
1898 relink_bitmap_entry(ctl, info); in bitmap_clear_bits()
1908 ctl->discardable_extents[BTRFS_STAT_CURR] += extent_delta; in bitmap_clear_bits()
1909 ctl->discardable_bytes[BTRFS_STAT_CURR] -= bytes; in bitmap_clear_bits()
1913 ctl->free_space -= bytes; in bitmap_clear_bits()
1916 static void bitmap_set_bits(struct btrfs_free_space_ctl *ctl, in bitmap_set_bits() argument
1923 start = offset_to_bit(info->offset, ctl->unit, offset); in bitmap_set_bits()
1924 count = bytes_to_bits(bytes, ctl->unit); in bitmap_set_bits()
1936 ctl->free_space += bytes; in bitmap_set_bits()
1938 relink_bitmap_entry(ctl, info); in bitmap_set_bits()
1948 ctl->discardable_extents[BTRFS_STAT_CURR] += extent_delta; in bitmap_set_bits()
1949 ctl->discardable_bytes[BTRFS_STAT_CURR] += bytes; in bitmap_set_bits()
1957 static int search_bitmap(struct btrfs_free_space_ctl *ctl, in search_bitmap() argument
1978 i = offset_to_bit(bitmap_info->offset, ctl->unit, in search_bitmap()
1980 bits = bytes_to_bits(*bytes, ctl->unit); in search_bitmap()
2000 *offset = (u64)(i * ctl->unit) + bitmap_info->offset; in search_bitmap()
2001 *bytes = (u64)(found_bits) * ctl->unit; in search_bitmap()
2005 *bytes = (u64)(max_bits) * ctl->unit; in search_bitmap()
2007 relink_bitmap_entry(ctl, bitmap_info); in search_bitmap()
2013 find_free_space(struct btrfs_free_space_ctl *ctl, u64 *offset, u64 *bytes, in find_free_space() argument
2022 if (!ctl->free_space_offset.rb_node) in find_free_space()
2026 node = rb_first_cached(&ctl->free_space_bytes); in find_free_space()
2028 entry = tree_search_offset(ctl, offset_to_bitmap(ctl, *offset), in find_free_space()
2063 tmp = entry->offset - ctl->start + align - 1; in find_free_space()
2065 tmp = tmp * align + ctl->start; in find_free_space()
2089 ret = search_bitmap(ctl, entry, &tmp, &size, true); in find_free_space()
2119 static void add_new_bitmap(struct btrfs_free_space_ctl *ctl, in add_new_bitmap() argument
2122 info->offset = offset_to_bitmap(ctl, offset); in add_new_bitmap()
2126 link_free_space(ctl, info); in add_new_bitmap()
2127 ctl->total_bitmaps++; in add_new_bitmap()
2128 recalculate_thresholds(ctl); in add_new_bitmap()
2131 static void free_bitmap(struct btrfs_free_space_ctl *ctl, in free_bitmap() argument
2141 ctl->discardable_extents[BTRFS_STAT_CURR] -= in free_bitmap()
2143 ctl->discardable_bytes[BTRFS_STAT_CURR] -= bitmap_info->bytes; in free_bitmap()
2146 unlink_free_space(ctl, bitmap_info, true); in free_bitmap()
2149 ctl->total_bitmaps--; in free_bitmap()
2150 recalculate_thresholds(ctl); in free_bitmap()
2153 static noinline int remove_from_bitmap(struct btrfs_free_space_ctl *ctl, in remove_from_bitmap() argument
2162 end = bitmap_info->offset + (u64)(BITS_PER_BITMAP * ctl->unit) - 1; in remove_from_bitmap()
2171 search_bytes = ctl->unit; in remove_from_bitmap()
2173 ret = search_bitmap(ctl, bitmap_info, &search_start, &search_bytes, in remove_from_bitmap()
2184 bitmap_clear_bits(ctl, bitmap_info, search_start, search_bytes, true); in remove_from_bitmap()
2191 free_bitmap(ctl, bitmap_info); in remove_from_bitmap()
2217 search_bytes = ctl->unit; in remove_from_bitmap()
2218 ret = search_bitmap(ctl, bitmap_info, &search_start, in remove_from_bitmap()
2225 free_bitmap(ctl, bitmap_info); in remove_from_bitmap()
2230 static u64 add_bytes_to_bitmap(struct btrfs_free_space_ctl *ctl, in add_bytes_to_bitmap() argument
2243 ctl->discardable_extents[BTRFS_STAT_CURR] += in add_bytes_to_bitmap()
2245 ctl->discardable_bytes[BTRFS_STAT_CURR] += info->bytes; in add_bytes_to_bitmap()
2250 end = info->offset + (u64)(BITS_PER_BITMAP * ctl->unit); in add_bytes_to_bitmap()
2254 bitmap_set_bits(ctl, info, offset, bytes_to_set); in add_bytes_to_bitmap()
2260 static bool use_bitmap(struct btrfs_free_space_ctl *ctl, in use_bitmap() argument
2263 struct btrfs_block_group *block_group = ctl->block_group; in use_bitmap()
2280 if (!forced && ctl->free_extents < ctl->extents_thresh) { in use_bitmap()
2289 if (ctl->free_extents * 3 <= ctl->extents_thresh) in use_bitmap()
2304 if (((BITS_PER_BITMAP * ctl->unit) >> 1) > block_group->length) in use_bitmap()
2314 static int insert_into_bitmap(struct btrfs_free_space_ctl *ctl, in insert_into_bitmap() argument
2328 if (!ctl->op->use_bitmap(ctl, info)) in insert_into_bitmap()
2331 if (ctl->op == &free_space_op) in insert_into_bitmap()
2332 block_group = ctl->block_group; in insert_into_bitmap()
2360 if (entry->offset == offset_to_bitmap(ctl, offset)) { in insert_into_bitmap()
2361 bytes_added = add_bytes_to_bitmap(ctl, entry, offset, in insert_into_bitmap()
2374 bitmap_info = tree_search_offset(ctl, offset_to_bitmap(ctl, offset), in insert_into_bitmap()
2381 bytes_added = add_bytes_to_bitmap(ctl, bitmap_info, offset, bytes, in insert_into_bitmap()
2395 add_new_bitmap(ctl, info, offset); in insert_into_bitmap()
2400 spin_unlock(&ctl->tree_lock); in insert_into_bitmap()
2407 spin_lock(&ctl->tree_lock); in insert_into_bitmap()
2417 spin_lock(&ctl->tree_lock); in insert_into_bitmap()
2452 static bool try_merge_free_space(struct btrfs_free_space_ctl *ctl, in try_merge_free_space() argument
2468 right_info = tree_search_offset(ctl, offset + bytes, 0, 0); in try_merge_free_space()
2475 left_info = tree_search_offset(ctl, offset - 1, 0, 0); in try_merge_free_space()
2480 unlink_free_space(ctl, right_info, update_stat); in try_merge_free_space()
2490 unlink_free_space(ctl, left_info, update_stat); in try_merge_free_space()
2500 static bool steal_from_bitmap_to_end(struct btrfs_free_space_ctl *ctl, in steal_from_bitmap_to_end() argument
2508 const u64 bitmap_offset = offset_to_bitmap(ctl, end); in steal_from_bitmap_to_end()
2511 bitmap = tree_search_offset(ctl, bitmap_offset, 1, 0); in steal_from_bitmap_to_end()
2515 i = offset_to_bit(bitmap->offset, ctl->unit, end); in steal_from_bitmap_to_end()
2519 bytes = (j - i) * ctl->unit; in steal_from_bitmap_to_end()
2526 bitmap_clear_bits(ctl, bitmap, end, bytes, update_stat); in steal_from_bitmap_to_end()
2529 free_bitmap(ctl, bitmap); in steal_from_bitmap_to_end()
2534 static bool steal_from_bitmap_to_front(struct btrfs_free_space_ctl *ctl, in steal_from_bitmap_to_front() argument
2545 bitmap_offset = offset_to_bitmap(ctl, info->offset); in steal_from_bitmap_to_front()
2550 bitmap_offset = offset_to_bitmap(ctl, info->offset - 1); in steal_from_bitmap_to_front()
2553 bitmap = tree_search_offset(ctl, bitmap_offset, 1, 0); in steal_from_bitmap_to_front()
2557 i = offset_to_bit(bitmap->offset, ctl->unit, info->offset) - 1; in steal_from_bitmap_to_front()
2569 bytes = (i + 1) * ctl->unit; in steal_from_bitmap_to_front()
2571 bytes = (i - prev_j) * ctl->unit; in steal_from_bitmap_to_front()
2580 bitmap_clear_bits(ctl, bitmap, info->offset, bytes, update_stat); in steal_from_bitmap_to_front()
2583 free_bitmap(ctl, bitmap); in steal_from_bitmap_to_front()
2599 static void steal_from_bitmap(struct btrfs_free_space_ctl *ctl, in steal_from_bitmap() argument
2610 if (ctl->total_bitmaps > 0) { in steal_from_bitmap()
2614 stole_end = steal_from_bitmap_to_end(ctl, info, update_stat); in steal_from_bitmap()
2615 if (ctl->total_bitmaps > 0) in steal_from_bitmap()
2616 stole_front = steal_from_bitmap_to_front(ctl, info, in steal_from_bitmap()
2620 try_merge_free_space(ctl, info, update_stat); in steal_from_bitmap()
2629 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in __btrfs_add_free_space() local
2646 spin_lock(&ctl->tree_lock); in __btrfs_add_free_space()
2648 if (try_merge_free_space(ctl, info, true)) in __btrfs_add_free_space()
2656 ret = insert_into_bitmap(ctl, info); in __btrfs_add_free_space()
2670 steal_from_bitmap(ctl, info, true); in __btrfs_add_free_space()
2674 ret = link_free_space(ctl, info); in __btrfs_add_free_space()
2679 spin_unlock(&ctl->tree_lock); in __btrfs_add_free_space()
2698 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in __btrfs_add_free_space_zoned() local
2710 spin_lock(&ctl->tree_lock); in __btrfs_add_free_space_zoned()
2723 ctl->free_space += to_free; in __btrfs_add_free_space_zoned()
2730 spin_unlock(&ctl->tree_lock); in __btrfs_add_free_space_zoned()
2800 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_remove_free_space() local
2825 spin_lock(&ctl->tree_lock); in btrfs_remove_free_space()
2832 info = tree_search_offset(ctl, offset, 0, 0); in btrfs_remove_free_space()
2838 info = tree_search_offset(ctl, offset_to_bitmap(ctl, offset), in btrfs_remove_free_space()
2853 unlink_free_space(ctl, info, true); in btrfs_remove_free_space()
2860 ret = link_free_space(ctl, info); in btrfs_remove_free_space()
2873 ret = link_free_space(ctl, info); in btrfs_remove_free_space()
2887 spin_unlock(&ctl->tree_lock); in btrfs_remove_free_space()
2898 ret = remove_from_bitmap(ctl, info, &offset, &bytes); in btrfs_remove_free_space()
2905 spin_unlock(&ctl->tree_lock); in btrfs_remove_free_space()
2914 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_dump_free_space() local
2931 spin_lock(&ctl->tree_lock); in btrfs_dump_free_space()
2932 for (n = rb_first(&ctl->free_space_offset); n; n = rb_next(n)) { in btrfs_dump_free_space()
2940 spin_unlock(&ctl->tree_lock); in btrfs_dump_free_space()
2949 struct btrfs_free_space_ctl *ctl) in btrfs_init_free_space_ctl() argument
2953 spin_lock_init(&ctl->tree_lock); in btrfs_init_free_space_ctl()
2954 ctl->unit = fs_info->sectorsize; in btrfs_init_free_space_ctl()
2955 ctl->start = block_group->start; in btrfs_init_free_space_ctl()
2956 ctl->block_group = block_group; in btrfs_init_free_space_ctl()
2957 ctl->op = &free_space_op; in btrfs_init_free_space_ctl()
2958 ctl->free_space_bytes = RB_ROOT_CACHED; in btrfs_init_free_space_ctl()
2959 INIT_LIST_HEAD(&ctl->trimming_ranges); in btrfs_init_free_space_ctl()
2960 mutex_init(&ctl->cache_writeout_mutex); in btrfs_init_free_space_ctl()
2967 ctl->extents_thresh = (SZ_32K / 2) / sizeof(struct btrfs_free_space); in btrfs_init_free_space_ctl()
2980 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in __btrfs_return_cluster_to_free_space() local
2983 lockdep_assert_held(&ctl->tree_lock); in __btrfs_return_cluster_to_free_space()
3007 ctl->discardable_extents[BTRFS_STAT_CURR]--; in __btrfs_return_cluster_to_free_space()
3008 ctl->discardable_bytes[BTRFS_STAT_CURR] -= in __btrfs_return_cluster_to_free_space()
3012 try_merge_free_space(ctl, entry, false); in __btrfs_return_cluster_to_free_space()
3013 steal_from_bitmap(ctl, entry, false); in __btrfs_return_cluster_to_free_space()
3017 ctl->discardable_extents[BTRFS_STAT_CURR]++; in __btrfs_return_cluster_to_free_space()
3018 ctl->discardable_bytes[BTRFS_STAT_CURR] += in __btrfs_return_cluster_to_free_space()
3022 tree_insert_offset(ctl, NULL, entry); in __btrfs_return_cluster_to_free_space()
3023 rb_add_cached(&entry->bytes_index, &ctl->free_space_bytes, in __btrfs_return_cluster_to_free_space()
3033 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_remove_free_space_cache() local
3037 spin_lock(&ctl->tree_lock); in btrfs_remove_free_space_cache()
3046 cond_resched_lock(&ctl->tree_lock); in btrfs_remove_free_space_cache()
3048 __btrfs_remove_free_space_cache(ctl); in btrfs_remove_free_space_cache()
3050 spin_unlock(&ctl->tree_lock); in btrfs_remove_free_space_cache()
3059 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_is_free_space_trimmed() local
3064 spin_lock(&ctl->tree_lock); in btrfs_is_free_space_trimmed()
3065 node = rb_first(&ctl->free_space_offset); in btrfs_is_free_space_trimmed()
3078 spin_unlock(&ctl->tree_lock); in btrfs_is_free_space_trimmed()
3086 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_find_space_for_alloc() local
3099 spin_lock(&ctl->tree_lock); in btrfs_find_space_for_alloc()
3100 entry = find_free_space(ctl, &offset, &bytes_search, in btrfs_find_space_for_alloc()
3108 bitmap_clear_bits(ctl, entry, offset, bytes, true); in btrfs_find_space_for_alloc()
3114 free_bitmap(ctl, entry); in btrfs_find_space_for_alloc()
3116 unlink_free_space(ctl, entry, true); in btrfs_find_space_for_alloc()
3131 link_free_space(ctl, entry); in btrfs_find_space_for_alloc()
3135 spin_unlock(&ctl->tree_lock); in btrfs_find_space_for_alloc()
3155 struct btrfs_free_space_ctl *ctl; in btrfs_return_cluster_to_free_space() local
3173 ctl = block_group->free_space_ctl; in btrfs_return_cluster_to_free_space()
3176 spin_lock(&ctl->tree_lock); in btrfs_return_cluster_to_free_space()
3178 spin_unlock(&ctl->tree_lock); in btrfs_return_cluster_to_free_space()
3192 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_alloc_from_bitmap() local
3201 err = search_bitmap(ctl, entry, &search_start, &search_bytes, true); in btrfs_alloc_from_bitmap()
3209 bitmap_clear_bits(ctl, entry, ret, bytes, false); in btrfs_alloc_from_bitmap()
3223 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_alloc_from_cluster() local
3288 spin_lock(&ctl->tree_lock); in btrfs_alloc_from_cluster()
3293 ctl->free_space -= bytes; in btrfs_alloc_from_cluster()
3295 ctl->discardable_bytes[BTRFS_STAT_CURR] -= bytes; in btrfs_alloc_from_cluster()
3300 ctl->free_extents--; in btrfs_alloc_from_cluster()
3304 ctl->total_bitmaps--; in btrfs_alloc_from_cluster()
3305 recalculate_thresholds(ctl); in btrfs_alloc_from_cluster()
3307 ctl->discardable_extents[BTRFS_STAT_CURR]--; in btrfs_alloc_from_cluster()
3313 spin_unlock(&ctl->tree_lock); in btrfs_alloc_from_cluster()
3324 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_bitmap_cluster() local
3335 lockdep_assert_held(&ctl->tree_lock); in btrfs_bitmap_cluster()
3337 i = offset_to_bit(entry->offset, ctl->unit, in btrfs_bitmap_cluster()
3339 want_bits = bytes_to_bits(bytes, ctl->unit); in btrfs_bitmap_cluster()
3340 min_bits = bytes_to_bits(min_bytes, ctl->unit); in btrfs_bitmap_cluster()
3366 entry->max_extent_size = (u64)max_bits * ctl->unit; in btrfs_bitmap_cluster()
3377 if (cluster->max_size < found_bits * ctl->unit) in btrfs_bitmap_cluster()
3378 cluster->max_size = found_bits * ctl->unit; in btrfs_bitmap_cluster()
3385 cluster->window_start = start * ctl->unit + entry->offset; in btrfs_bitmap_cluster()
3386 rb_erase(&entry->offset_index, &ctl->free_space_offset); in btrfs_bitmap_cluster()
3387 rb_erase_cached(&entry->bytes_index, &ctl->free_space_bytes); in btrfs_bitmap_cluster()
3398 ret = tree_insert_offset(ctl, cluster, entry); in btrfs_bitmap_cluster()
3402 total_found * ctl->unit, 1); in btrfs_bitmap_cluster()
3417 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in setup_cluster_no_bitmap() local
3426 lockdep_assert_held(&ctl->tree_lock); in setup_cluster_no_bitmap()
3428 entry = tree_search_offset(ctl, offset, 0, 1); in setup_cluster_no_bitmap()
3488 rb_erase(&entry->offset_index, &ctl->free_space_offset); in setup_cluster_no_bitmap()
3489 rb_erase_cached(&entry->bytes_index, &ctl->free_space_bytes); in setup_cluster_no_bitmap()
3490 ret = tree_insert_offset(ctl, cluster, entry); in setup_cluster_no_bitmap()
3510 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in setup_cluster_bitmap() local
3513 u64 bitmap_offset = offset_to_bitmap(ctl, offset); in setup_cluster_bitmap()
3515 if (ctl->total_bitmaps == 0) in setup_cluster_bitmap()
3526 entry = tree_search_offset(ctl, bitmap_offset, 1, 0); in setup_cluster_bitmap()
3560 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_find_space_cluster() local
3584 spin_lock(&ctl->tree_lock); in btrfs_find_space_cluster()
3590 if (ctl->free_space < bytes) { in btrfs_find_space_cluster()
3591 spin_unlock(&ctl->tree_lock); in btrfs_find_space_cluster()
3628 spin_unlock(&ctl->tree_lock); in btrfs_find_space_cluster()
3655 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in do_trimming() local
3679 mutex_lock(&ctl->cache_writeout_mutex); in do_trimming()
3689 mutex_unlock(&ctl->cache_writeout_mutex); in do_trimming()
3714 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in trim_no_bitmap() local
3727 mutex_lock(&ctl->cache_writeout_mutex); in trim_no_bitmap()
3728 spin_lock(&ctl->tree_lock); in trim_no_bitmap()
3730 if (ctl->free_space < minlen) in trim_no_bitmap()
3733 entry = tree_search_offset(ctl, start, 0, 1); in trim_no_bitmap()
3757 spin_unlock(&ctl->tree_lock); in trim_no_bitmap()
3758 mutex_unlock(&ctl->cache_writeout_mutex); in trim_no_bitmap()
3761 unlink_free_space(ctl, entry, true); in trim_no_bitmap()
3774 link_free_space(ctl, entry); in trim_no_bitmap()
3782 spin_unlock(&ctl->tree_lock); in trim_no_bitmap()
3783 mutex_unlock(&ctl->cache_writeout_mutex); in trim_no_bitmap()
3787 unlink_free_space(ctl, entry, true); in trim_no_bitmap()
3791 spin_unlock(&ctl->tree_lock); in trim_no_bitmap()
3794 list_add_tail(&trim_entry.list, &ctl->trimming_ranges); in trim_no_bitmap()
3795 mutex_unlock(&ctl->cache_writeout_mutex); in trim_no_bitmap()
3822 spin_unlock(&ctl->tree_lock); in trim_no_bitmap()
3823 mutex_unlock(&ctl->cache_writeout_mutex); in trim_no_bitmap()
3842 static void reset_trimming_bitmap(struct btrfs_free_space_ctl *ctl, u64 offset) in reset_trimming_bitmap() argument
3846 spin_lock(&ctl->tree_lock); in reset_trimming_bitmap()
3847 entry = tree_search_offset(ctl, offset, 1, 0); in reset_trimming_bitmap()
3850 ctl->discardable_extents[BTRFS_STAT_CURR] += in reset_trimming_bitmap()
3852 ctl->discardable_bytes[BTRFS_STAT_CURR] += entry->bytes; in reset_trimming_bitmap()
3857 spin_unlock(&ctl->tree_lock); in reset_trimming_bitmap()
3860 static void end_trimming_bitmap(struct btrfs_free_space_ctl *ctl, in end_trimming_bitmap() argument
3865 ctl->discardable_extents[BTRFS_STAT_CURR] -= in end_trimming_bitmap()
3867 ctl->discardable_bytes[BTRFS_STAT_CURR] -= entry->bytes; in end_trimming_bitmap()
3880 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in trim_bitmaps() local
3885 u64 offset = offset_to_bitmap(ctl, start); in trim_bitmaps()
3892 mutex_lock(&ctl->cache_writeout_mutex); in trim_bitmaps()
3893 spin_lock(&ctl->tree_lock); in trim_bitmaps()
3895 if (ctl->free_space < minlen) { in trim_bitmaps()
3898 spin_unlock(&ctl->tree_lock); in trim_bitmaps()
3899 mutex_unlock(&ctl->cache_writeout_mutex); in trim_bitmaps()
3903 entry = tree_search_offset(ctl, offset, 1, 0); in trim_bitmaps()
3914 spin_unlock(&ctl->tree_lock); in trim_bitmaps()
3915 mutex_unlock(&ctl->cache_writeout_mutex); in trim_bitmaps()
3930 ret2 = search_bitmap(ctl, entry, &start, &bytes, false); in trim_bitmaps()
3937 end_trimming_bitmap(ctl, entry); in trim_bitmaps()
3940 spin_unlock(&ctl->tree_lock); in trim_bitmaps()
3941 mutex_unlock(&ctl->cache_writeout_mutex); in trim_bitmaps()
3951 spin_unlock(&ctl->tree_lock); in trim_bitmaps()
3952 mutex_unlock(&ctl->cache_writeout_mutex); in trim_bitmaps()
3958 spin_unlock(&ctl->tree_lock); in trim_bitmaps()
3959 mutex_unlock(&ctl->cache_writeout_mutex); in trim_bitmaps()
3974 bitmap_clear_bits(ctl, entry, start, bytes, true); in trim_bitmaps()
3976 free_bitmap(ctl, entry); in trim_bitmaps()
3978 spin_unlock(&ctl->tree_lock); in trim_bitmaps()
3981 list_add_tail(&trim_entry.list, &ctl->trimming_ranges); in trim_bitmaps()
3982 mutex_unlock(&ctl->cache_writeout_mutex); in trim_bitmaps()
3987 reset_trimming_bitmap(ctl, offset); in trim_bitmaps()
3994 offset += BITS_PER_BITMAP * ctl->unit; in trim_bitmaps()
4003 reset_trimming_bitmap(ctl, offset); in trim_bitmaps()
4021 struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; in btrfs_trim_block_group() local
4042 div64_u64_rem(end, BITS_PER_BITMAP * ctl->unit, &rem); in btrfs_trim_block_group()
4045 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()