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()
900 struct btrfs_free_space *info; in copy_free_space_cache()
905 info = rb_entry(n, struct btrfs_free_space, offset_index); in copy_free_space_cache()
1096 struct btrfs_free_space *e; in write_cache_extent_entries()
1098 e = rb_entry(node, struct btrfs_free_space, offset_index); in write_cache_extent_entries()
1250 struct btrfs_free_space *entry, *next; in write_bitmap_entries()
1279 struct btrfs_free_space *entry, *next; in cleanup_bitmap_list()
1587 struct btrfs_free_space *new_entry) in tree_insert_offset()
1605 struct btrfs_free_space *info; in tree_insert_offset()
1608 info = rb_entry(parent, struct btrfs_free_space, offset_index); in tree_insert_offset()
1674 static inline u64 get_max_extent_size(const struct btrfs_free_space *entry) in get_max_extent_size()
1687 const struct btrfs_free_space *entry, *exist; in entry_less()
1689 entry = rb_entry(node, struct btrfs_free_space, bytes_index); in entry_less()
1690 exist = rb_entry(parent, struct btrfs_free_space, bytes_index); in entry_less()
1701 static struct btrfs_free_space *
1706 struct btrfs_free_space *entry = NULL, *prev = NULL; in tree_search_offset()
1712 entry = rb_entry(n, struct btrfs_free_space, offset_index); in tree_search_offset()
1738 entry = rb_entry(n, struct btrfs_free_space, offset_index); in tree_search_offset()
1752 prev = rb_entry(n, struct btrfs_free_space, in tree_search_offset()
1770 entry = rb_entry(n, struct btrfs_free_space, in tree_search_offset()
1784 prev = rb_entry(n, struct btrfs_free_space, in tree_search_offset()
1802 entry = rb_entry(n, struct btrfs_free_space, offset_index); in tree_search_offset()
1816 struct btrfs_free_space *info, in unlink_free_space()
1835 struct btrfs_free_space *info) in link_free_space()
1859 struct btrfs_free_space *info) in relink_bitmap_entry()
1877 struct btrfs_free_space *info, in bitmap_clear_bits()
1913 struct btrfs_free_space *info, u64 offset, in bitmap_set_bits()
1954 struct btrfs_free_space *bitmap_info, u64 *offset, in search_bitmap()
2008 static struct btrfs_free_space *
2012 struct btrfs_free_space *entry; in find_free_space()
2033 entry = rb_entry(node, struct btrfs_free_space, in find_free_space()
2036 entry = rb_entry(node, struct btrfs_free_space, in find_free_space()
2116 struct btrfs_free_space *info, u64 offset) in add_new_bitmap()
2128 struct btrfs_free_space *bitmap_info) in free_bitmap()
2150 struct btrfs_free_space *bitmap_info, in remove_from_bitmap()
2196 bitmap_info = rb_entry(next, struct btrfs_free_space, in remove_from_bitmap()
2227 struct btrfs_free_space *info, u64 offset, in add_bytes_to_bitmap()
2257 struct btrfs_free_space *info) in use_bitmap()
2311 struct btrfs_free_space *info) in insert_into_bitmap()
2313 struct btrfs_free_space *bitmap_info; in insert_into_bitmap()
2338 struct btrfs_free_space *entry; in insert_into_bitmap()
2350 entry = rb_entry(node, struct btrfs_free_space, offset_index); in insert_into_bitmap()
2449 struct btrfs_free_space *info, bool update_stat) in try_merge_free_space()
2451 struct btrfs_free_space *left_info = NULL; in try_merge_free_space()
2452 struct btrfs_free_space *right_info; in try_merge_free_space()
2469 left_info = rb_entry(right_prev, struct btrfs_free_space, offset_index); in try_merge_free_space()
2497 struct btrfs_free_space *info, in steal_from_bitmap_to_end()
2500 struct btrfs_free_space *bitmap; in steal_from_bitmap_to_end()
2531 struct btrfs_free_space *info, in steal_from_bitmap_to_front()
2534 struct btrfs_free_space *bitmap; in steal_from_bitmap_to_front()
2596 struct btrfs_free_space *info, in steal_from_bitmap()
2626 struct btrfs_free_space *info; in __btrfs_add_free_space()
2797 struct btrfs_free_space *info; in btrfs_remove_free_space()
2911 struct btrfs_free_space *info; in btrfs_dump_free_space()
2929 info = rb_entry(n, struct btrfs_free_space, offset_index); in btrfs_dump_free_space()
2963 ctl->extents_thresh = (SZ_32K / 2) / sizeof(struct btrfs_free_space); in btrfs_init_free_space_ctl()
2993 struct btrfs_free_space *entry; in __btrfs_return_cluster_to_free_space()
2995 entry = rb_entry(node, struct btrfs_free_space, offset_index); in __btrfs_return_cluster_to_free_space()
3056 struct btrfs_free_space *info; in btrfs_is_free_space_trimmed()
3064 info = rb_entry(node, struct btrfs_free_space, offset_index); in btrfs_is_free_space_trimmed()
3085 struct btrfs_free_space *entry = NULL; in btrfs_find_space_for_alloc()
3184 struct btrfs_free_space *entry, in btrfs_alloc_from_bitmap()
3222 struct btrfs_free_space *entry = NULL; in btrfs_alloc_from_cluster()
3239 entry = rb_entry(node, struct btrfs_free_space, offset_index); in btrfs_alloc_from_cluster()
3250 entry = rb_entry(node, struct btrfs_free_space, in btrfs_alloc_from_cluster()
3264 entry = rb_entry(node, struct btrfs_free_space, in btrfs_alloc_from_cluster()
3315 struct btrfs_free_space *entry, in btrfs_bitmap_cluster()
3414 struct btrfs_free_space *first = NULL; in setup_cluster_no_bitmap()
3415 struct btrfs_free_space *entry = NULL; in setup_cluster_no_bitmap()
3416 struct btrfs_free_space *last; in setup_cluster_no_bitmap()
3438 entry = rb_entry(node, struct btrfs_free_space, offset_index); in setup_cluster_no_bitmap()
3448 entry = rb_entry(node, struct btrfs_free_space, offset_index); in setup_cluster_no_bitmap()
3479 entry = rb_entry(node, struct btrfs_free_space, offset_index); in setup_cluster_no_bitmap()
3507 struct btrfs_free_space *entry = NULL; in setup_cluster_bitmap()
3519 entry = list_first_entry(bitmaps, struct btrfs_free_space, list); in setup_cluster_bitmap()
3557 struct btrfs_free_space *entry, *tmp; in btrfs_find_space_cluster()
3711 struct btrfs_free_space *entry; in trim_no_bitmap()
3739 entry = rb_entry(node, struct btrfs_free_space, in trim_no_bitmap()
3840 struct btrfs_free_space *entry; in reset_trimming_bitmap()
3857 struct btrfs_free_space *entry) in end_trimming_bitmap()
3877 struct btrfs_free_space *entry; in trim_bitmaps()
4156 sizeof(struct btrfs_free_space), 0, in btrfs_free_space_init()
4189 struct btrfs_free_space *info = NULL, *bitmap_info; in test_add_free_space_entry()
4259 struct btrfs_free_space *info; in test_check_exists()
4275 struct btrfs_free_space *tmp; in test_check_exists()
4293 tmp = rb_entry(n, struct btrfs_free_space, in test_check_exists()
4307 tmp = rb_entry(n, struct btrfs_free_space, in test_check_exists()