Lines Matching refs:btrfs_free_space
48 struct btrfs_free_space *info);
50 struct btrfs_free_space *info, bool update_stat);
52 struct btrfs_free_space *bitmap_info, u64 *offset,
55 struct btrfs_free_space *bitmap_info);
57 struct btrfs_free_space *info, u64 offset,
62 struct btrfs_free_space *info; in __btrfs_remove_free_space_cache()
66 info = rb_entry(node, struct btrfs_free_space, offset_index); in __btrfs_remove_free_space_cache()
648 struct btrfs_free_space *entry, u8 *type) in io_ctl_read_entry()
675 struct btrfs_free_space *entry) in io_ctl_read_bitmap()
730 div_u64(extent_bytes, sizeof(struct btrfs_free_space)); in recalculate_thresholds()
742 struct btrfs_free_space *e, *n; in __load_free_space_cache()
901 struct btrfs_free_space *info; in copy_free_space_cache()
906 info = rb_entry(n, struct btrfs_free_space, offset_index); in copy_free_space_cache()
1097 struct btrfs_free_space *e; in write_cache_extent_entries()
1099 e = rb_entry(node, struct btrfs_free_space, offset_index); in write_cache_extent_entries()
1251 struct btrfs_free_space *entry, *next; in write_bitmap_entries()
1280 struct btrfs_free_space *entry, *next; in cleanup_bitmap_list()
1588 struct btrfs_free_space *new_entry) in tree_insert_offset()
1606 struct btrfs_free_space *info; in tree_insert_offset()
1609 info = rb_entry(parent, struct btrfs_free_space, offset_index); in tree_insert_offset()
1675 static inline u64 get_max_extent_size(const struct btrfs_free_space *entry) in get_max_extent_size()
1688 const struct btrfs_free_space *entry, *exist; in entry_less()
1690 entry = rb_entry(node, struct btrfs_free_space, bytes_index); in entry_less()
1691 exist = rb_entry(parent, struct btrfs_free_space, bytes_index); in entry_less()
1702 static struct btrfs_free_space *
1707 struct btrfs_free_space *entry = NULL, *prev = NULL; in tree_search_offset()
1713 entry = rb_entry(n, struct btrfs_free_space, offset_index); in tree_search_offset()
1739 entry = rb_entry(n, struct btrfs_free_space, offset_index); in tree_search_offset()
1753 prev = rb_entry(n, struct btrfs_free_space, in tree_search_offset()
1771 entry = rb_entry(n, struct btrfs_free_space, in tree_search_offset()
1785 prev = rb_entry(n, struct btrfs_free_space, in tree_search_offset()
1803 entry = rb_entry(n, struct btrfs_free_space, offset_index); in tree_search_offset()
1817 struct btrfs_free_space *info, in unlink_free_space()
1836 struct btrfs_free_space *info) in link_free_space()
1860 struct btrfs_free_space *info) in relink_bitmap_entry()
1878 struct btrfs_free_space *info, in bitmap_clear_bits()
1914 struct btrfs_free_space *info, u64 offset, in btrfs_bitmap_set_bits()
1955 struct btrfs_free_space *bitmap_info, u64 *offset, in search_bitmap()
2009 static struct btrfs_free_space *
2013 struct btrfs_free_space *entry; in find_free_space()
2034 entry = rb_entry(node, struct btrfs_free_space, in find_free_space()
2037 entry = rb_entry(node, struct btrfs_free_space, in find_free_space()
2117 struct btrfs_free_space *info, u64 offset) in add_new_bitmap()
2129 struct btrfs_free_space *bitmap_info) in free_bitmap()
2151 struct btrfs_free_space *bitmap_info, in remove_from_bitmap()
2197 bitmap_info = rb_entry(next, struct btrfs_free_space, in remove_from_bitmap()
2228 struct btrfs_free_space *info, u64 offset, in add_bytes_to_bitmap()
2258 struct btrfs_free_space *info) in use_bitmap()
2312 struct btrfs_free_space *info) in insert_into_bitmap()
2314 struct btrfs_free_space *bitmap_info; in insert_into_bitmap()
2339 struct btrfs_free_space *entry; in insert_into_bitmap()
2351 entry = rb_entry(node, struct btrfs_free_space, offset_index); in insert_into_bitmap()
2450 struct btrfs_free_space *info, bool update_stat) in try_merge_free_space()
2452 struct btrfs_free_space *left_info = NULL; in try_merge_free_space()
2453 struct btrfs_free_space *right_info; in try_merge_free_space()
2470 left_info = rb_entry(right_prev, struct btrfs_free_space, offset_index); in try_merge_free_space()
2498 struct btrfs_free_space *info, in steal_from_bitmap_to_end()
2501 struct btrfs_free_space *bitmap; in steal_from_bitmap_to_end()
2532 struct btrfs_free_space *info, in steal_from_bitmap_to_front()
2535 struct btrfs_free_space *bitmap; in steal_from_bitmap_to_front()
2597 struct btrfs_free_space *info, in steal_from_bitmap()
2627 struct btrfs_free_space *info; in __btrfs_add_free_space()
2802 struct btrfs_free_space *info; in btrfs_remove_free_space()
2916 struct btrfs_free_space *info; in btrfs_dump_free_space()
2934 info = rb_entry(n, struct btrfs_free_space, offset_index); in btrfs_dump_free_space()
2968 ctl->extents_thresh = (SZ_32K / 2) / sizeof(struct btrfs_free_space); in btrfs_init_free_space_ctl()
2998 struct btrfs_free_space *entry; in __btrfs_return_cluster_to_free_space()
3000 entry = rb_entry(node, struct btrfs_free_space, offset_index); in __btrfs_return_cluster_to_free_space()
3061 struct btrfs_free_space *info; in btrfs_is_free_space_trimmed()
3069 info = rb_entry(node, struct btrfs_free_space, offset_index); in btrfs_is_free_space_trimmed()
3090 struct btrfs_free_space *entry = NULL; in btrfs_find_space_for_alloc()
3189 struct btrfs_free_space *entry, in btrfs_alloc_from_bitmap()
3227 struct btrfs_free_space *entry = NULL; in btrfs_alloc_from_cluster()
3244 entry = rb_entry(node, struct btrfs_free_space, offset_index); in btrfs_alloc_from_cluster()
3255 entry = rb_entry(node, struct btrfs_free_space, in btrfs_alloc_from_cluster()
3269 entry = rb_entry(node, struct btrfs_free_space, in btrfs_alloc_from_cluster()
3320 struct btrfs_free_space *entry, in btrfs_bitmap_cluster()
3419 struct btrfs_free_space *first = NULL; in setup_cluster_no_bitmap()
3420 struct btrfs_free_space *entry = NULL; in setup_cluster_no_bitmap()
3421 struct btrfs_free_space *last; in setup_cluster_no_bitmap()
3443 entry = rb_entry(node, struct btrfs_free_space, offset_index); in setup_cluster_no_bitmap()
3453 entry = rb_entry(node, struct btrfs_free_space, offset_index); in setup_cluster_no_bitmap()
3484 entry = rb_entry(node, struct btrfs_free_space, offset_index); in setup_cluster_no_bitmap()
3512 struct btrfs_free_space *entry = NULL; in setup_cluster_bitmap()
3524 entry = list_first_entry(bitmaps, struct btrfs_free_space, list); in setup_cluster_bitmap()
3562 struct btrfs_free_space *entry, *tmp; in btrfs_find_space_cluster()
3716 struct btrfs_free_space *entry; in trim_no_bitmap()
3744 entry = rb_entry(node, struct btrfs_free_space, in trim_no_bitmap()
3845 struct btrfs_free_space *entry; in reset_trimming_bitmap()
3862 struct btrfs_free_space *entry) in end_trimming_bitmap()
3882 struct btrfs_free_space *entry; in trim_bitmaps()
4161 sizeof(struct btrfs_free_space), 0, in btrfs_free_space_init()
4194 struct btrfs_free_space *info = NULL, *bitmap_info; in test_add_free_space_entry()
4264 struct btrfs_free_space *info; in test_check_exists()
4280 struct btrfs_free_space *tmp; in test_check_exists()
4298 tmp = rb_entry(n, struct btrfs_free_space, in test_check_exists()
4312 tmp = rb_entry(n, struct btrfs_free_space, in test_check_exists()