Home
last modified time | relevance | path

Searched refs:empty_size (Results 1 - 12 of 12) sorted by relevance

/kernel/linux/linux-6.6/fs/btrfs/
H A Dextent-tree.h21 u64 empty_size; member
115 u64 empty_size,
129 u64 min_alloc_size, u64 empty_size, u64 hint_byte,
H A Dfree-space-cache.h130 u64 offset, u64 bytes, u64 empty_size,
136 u64 offset, u64 bytes, u64 empty_size);
H A Dfree-space-cache.c3079 u64 offset, u64 bytes, u64 empty_size, in btrfs_find_space_for_alloc()
3086 u64 bytes_search = bytes + empty_size; in btrfs_find_space_for_alloc()
3545 * is to find at least bytes+empty_size.
3553 u64 offset, u64 bytes, u64 empty_size) in btrfs_find_space_cluster()
3570 cont1_bytes = bytes + empty_size; in btrfs_find_space_cluster()
3576 cont1_bytes = max(bytes, (bytes + empty_size) >> 2); in btrfs_find_space_cluster()
3599 trace_btrfs_find_cluster(block_group, offset, bytes, empty_size, in btrfs_find_space_cluster()
3603 bytes + empty_size, in btrfs_find_space_cluster()
3607 offset, bytes + empty_size, in btrfs_find_space_cluster()
3078 btrfs_find_space_for_alloc(struct btrfs_block_group *block_group, u64 offset, u64 bytes, u64 empty_size, u64 *max_extent_size) btrfs_find_space_for_alloc() argument
3551 btrfs_find_space_cluster(struct btrfs_block_group *block_group, struct btrfs_free_cluster *cluster, u64 offset, u64 bytes, u64 empty_size) btrfs_find_space_cluster() argument
H A Dextent-tree.c3567 ffe_ctl->empty_cluster + ffe_ctl->empty_size, in find_free_extent_clustered()
3621 ffe_ctl->empty_size) { in find_free_extent_unclustered()
3632 ffe_ctl->num_bytes, ffe_ctl->empty_size, in find_free_extent_unclustered()
4062 * Don't loop again if we already have no empty_size and in find_free_extent_update_loop()
4065 if (ffe_ctl->empty_size == 0 && in find_free_extent_update_loop()
4068 ffe_ctl->empty_size = 0; in find_free_extent_update_loop()
4444 ffe_ctl->empty_size); in find_free_extent()
4492 * @empty_size - A hint that you plan on doing more COW. This is the
4520 u64 empty_size, u64 hint_byte, in btrfs_reserve_extent()
4538 ffe_ctl.empty_size in btrfs_reserve_extent()
4518 btrfs_reserve_extent(struct btrfs_root *root, u64 ram_bytes, u64 num_bytes, u64 min_alloc_size, u64 empty_size, u64 hint_byte, struct btrfs_key *ins, int is_data, int delalloc) btrfs_reserve_extent() argument
4927 btrfs_alloc_tree_block(struct btrfs_trans_handle *trans, struct btrfs_root *root, u64 parent, u64 root_objectid, const struct btrfs_disk_key *key, int level, u64 hint, u64 empty_size, enum btrfs_lock_nesting nest) btrfs_alloc_tree_block() argument
[all...]
H A Dctree.c517 * empty_size -- a hint that you plan on doing more cow. This is the size in
526 u64 search_start, u64 empty_size, in __btrfs_cow_block()
559 search_start, empty_size, nest); in __btrfs_cow_block()
521 __btrfs_cow_block(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct extent_buffer *buf, struct extent_buffer *parent, int parent_slot, struct extent_buffer **cow_ret, u64 search_start, u64 empty_size, enum btrfs_lock_nesting nest) __btrfs_cow_block() argument
/kernel/linux/linux-5.10/fs/btrfs/
H A Dfree-space-cache.h127 u64 offset, u64 bytes, u64 empty_size,
134 u64 offset, u64 bytes, u64 empty_size);
H A Dextent-tree.c3490 u64 empty_size; member
3615 ffe_ctl->empty_cluster + ffe_ctl->empty_size, in find_free_extent_clustered()
3639 ffe_ctl->empty_cluster + ffe_ctl->empty_size); in find_free_extent_clustered()
3680 ffe_ctl->empty_size) { in find_free_extent_unclustered()
3691 ffe_ctl->num_bytes, ffe_ctl->empty_size, in find_free_extent_unclustered()
3706 ffe_ctl->empty_size); in find_free_extent_unclustered()
3836 * LOOP_NO_EMPTY_SIZE, set empty_size and empty_cluster to 0 and try in find_free_extent_update_loop()
3891 * Don't loop again if we already have no empty_size and in find_free_extent_update_loop()
3894 if (ffe_ctl->empty_size == 0 && in find_free_extent_update_loop()
3897 ffe_ctl->empty_size in find_free_extent_update_loop()
3995 find_free_extent(struct btrfs_root *root, u64 ram_bytes, u64 num_bytes, u64 empty_size, u64 hint_byte_orig, struct btrfs_key *ins, u64 flags, int delalloc) find_free_extent() argument
4271 btrfs_reserve_extent(struct btrfs_root *root, u64 ram_bytes, u64 num_bytes, u64 min_alloc_size, u64 empty_size, u64 hint_byte, struct btrfs_key *ins, int is_data, int delalloc) btrfs_reserve_extent() argument
4648 btrfs_alloc_tree_block(struct btrfs_trans_handle *trans, struct btrfs_root *root, u64 parent, u64 root_objectid, const struct btrfs_disk_key *key, int level, u64 hint, u64 empty_size, enum btrfs_lock_nesting nest) btrfs_alloc_tree_block() argument
[all...]
H A Dfree-space-cache.c2846 u64 offset, u64 bytes, u64 empty_size, in btrfs_find_space_for_alloc()
2853 u64 bytes_search = bytes + empty_size; in btrfs_find_space_for_alloc()
3293 * is to find at least bytes+empty_size.
3301 u64 offset, u64 bytes, u64 empty_size) in btrfs_find_space_cluster()
3318 cont1_bytes = min_bytes = bytes + empty_size; in btrfs_find_space_cluster()
3323 cont1_bytes = max(bytes, (bytes + empty_size) >> 2); in btrfs_find_space_cluster()
3346 trace_btrfs_find_cluster(block_group, offset, bytes, empty_size, in btrfs_find_space_cluster()
3350 bytes + empty_size, in btrfs_find_space_cluster()
3354 offset, bytes + empty_size, in btrfs_find_space_cluster()
2845 btrfs_find_space_for_alloc(struct btrfs_block_group *block_group, u64 offset, u64 bytes, u64 empty_size, u64 *max_extent_size) btrfs_find_space_for_alloc() argument
3299 btrfs_find_space_cluster(struct btrfs_block_group *block_group, struct btrfs_free_cluster *cluster, u64 offset, u64 bytes, u64 empty_size) btrfs_find_space_cluster() argument
H A Dctree.c964 u64 empty_size, in alloc_tree_block_no_bg_flush()
994 hint, empty_size, nest); in alloc_tree_block_no_bg_flush()
1008 * empty_size -- a hint that you plan on doing more cow. This is the size in
1017 u64 search_start, u64 empty_size, in __btrfs_cow_block()
1049 level, search_start, empty_size, nest); in __btrfs_cow_block()
957 alloc_tree_block_no_bg_flush( struct btrfs_trans_handle *trans, struct btrfs_root *root, u64 parent_start, const struct btrfs_disk_key *disk_key, int level, u64 hint, u64 empty_size, enum btrfs_lock_nesting nest) alloc_tree_block_no_bg_flush() argument
1012 __btrfs_cow_block(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct extent_buffer *buf, struct extent_buffer *parent, int parent_slot, struct extent_buffer **cow_ret, u64 search_start, u64 empty_size, enum btrfs_lock_nesting nest) __btrfs_cow_block() argument
H A Dctree.h2573 u64 empty_size,
2587 u64 min_alloc_size, u64 empty_size, u64 hint_byte,
/kernel/linux/linux-6.6/include/trace/events/
H A Dbtrfs.h1281 __field( u64, empty_size )
1288 __entry->empty_size = ffe_ctl->empty_size;
1292 TP_printk_btrfs("root=%llu(%s) len=%llu empty_size=%llu flags=%llu(%s)",
1294 __entry->num_bytes, __entry->empty_size, __entry->flags,
1309 __field( u64, empty_size )
1317 __entry->empty_size = ffe_ctl->empty_size;
1322 TP_printk_btrfs("root=%llu(%s) len=%llu empty_size=%llu flags=%llu(%s) loop=%llu",
1324 __entry->num_bytes, __entry->empty_size, __entr
[all...]
/kernel/linux/linux-5.10/include/trace/events/
H A Dbtrfs.h1180 u64 empty_size, u64 data),
1182 TP_ARGS(root, num_bytes, empty_size, data),
1187 __field( u64, empty_size )
1194 __entry->empty_size = empty_size;
1198 TP_printk_btrfs("root=%llu(%s) len=%llu empty_size=%llu flags=%llu(%s)",
1200 __entry->num_bytes, __entry->empty_size, __entry->data,
1254 u64 bytes, u64 empty_size, u64 min_bytes),
1256 TP_ARGS(block_group, start, bytes, empty_size, min_bytes),
1263 __field( u64, empty_size )
[all...]

Completed in 42 milliseconds