Home
last modified time | relevance | path

Searched refs:bytenr (Results 1 - 25 of 77) sorted by relevance

1234

/kernel/linux/linux-6.6/fs/btrfs/
H A Dmisc.h57 * Simple bytenr based rb_tree relate structures
59 * Any structure wants to use bytenr as single search index should have their
64 u64 bytenr; member
67 static inline struct rb_node *rb_simple_search(struct rb_root *root, u64 bytenr) in rb_simple_search() argument
75 if (bytenr < entry->bytenr) in rb_simple_search()
77 else if (bytenr > entry->bytenr) in rb_simple_search()
86 * Search @root from an entry that starts or comes after @bytenr.
89 * @bytenr
94 rb_simple_search_first(struct rb_root *root, u64 bytenr) rb_simple_search_first() argument
120 rb_simple_insert(struct rb_root *root, u64 bytenr, struct rb_node *node) rb_simple_insert() argument
[all...]
H A Dref-verify.c19 * bytenr. This just tracks the number of direct references, no shared
67 u64 bytenr; member
88 if (entry->bytenr > be->bytenr) in insert_block_entry()
90 else if (entry->bytenr < be->bytenr) in insert_block_entry()
101 static struct block_entry *lookup_block_entry(struct rb_root *root, u64 bytenr) in lookup_block_entry() argument
109 if (entry->bytenr < bytenr) in lookup_block_entry()
111 else if (entry->bytenr > byten in lookup_block_entry()
263 add_block_entry(struct btrfs_fs_info *fs_info, u64 bytenr, u64 len, u64 root_objectid) add_block_entry() argument
312 add_tree_block(struct btrfs_fs_info *fs_info, u64 ref_root, u64 parent, u64 bytenr, int level) add_tree_block() argument
357 add_shared_data_ref(struct btrfs_fs_info *fs_info, u64 parent, u32 num_refs, u64 bytenr, u64 num_bytes) add_shared_data_ref() argument
386 add_extent_data_ref(struct btrfs_fs_info *fs_info, struct extent_buffer *leaf, struct btrfs_extent_data_ref *dref, u64 bytenr, u64 num_bytes) add_extent_data_ref() argument
500 process_leaf(struct btrfs_root *root, struct btrfs_path *path, u64 *bytenr, u64 *num_bytes, int *tree_block_level) process_leaf() argument
555 walk_down_tree(struct btrfs_root *root, struct btrfs_path *path, int level, u64 *bytenr, u64 *num_bytes, int *tree_block_level) walk_down_tree() argument
672 u64 bytenr = generic_ref->bytenr; btrfs_ref_tree_mod() local
986 u64 bytenr = 0, num_bytes = 0; btrfs_build_ref_tree() local
[all...]
H A Ddelayed-ref.c212 * compare two delayed tree backrefs with same bytenr and type
232 * compare two delayed data backrefs with same bytenr and type
295 u64 bytenr; in htree_insert() local
299 bytenr = ins->bytenr; in htree_insert()
305 if (bytenr < entry->bytenr) { in htree_insert()
307 } else if (bytenr > entry->bytenr) { in htree_insert()
367 * Find a head entry based on bytenr
371 find_ref_head( struct btrfs_delayed_ref_root *dr, u64 bytenr, bool return_bigger) find_ref_head() argument
717 init_delayed_ref_head(struct btrfs_delayed_ref_head *head_ref, struct btrfs_qgroup_extent_record *qrecord, u64 bytenr, u64 num_bytes, u64 ref_root, u64 reserved, int action, bool is_data, bool is_system) init_delayed_ref_head() argument
864 init_delayed_ref_common(struct btrfs_fs_info *fs_info, struct btrfs_delayed_ref_node *ref, u64 bytenr, u64 num_bytes, u64 ref_root, int action, u8 ref_type) init_delayed_ref_common() argument
907 u64 bytenr = generic_ref->bytenr; btrfs_add_delayed_tree_ref() local
998 u64 bytenr = generic_ref->bytenr; btrfs_add_delayed_data_ref() local
1075 btrfs_add_delayed_extent_op(struct btrfs_trans_handle *trans, u64 bytenr, u64 num_bytes, struct btrfs_delayed_extent_op *extent_op) btrfs_add_delayed_extent_op() argument
1111 btrfs_find_delayed_ref_head(struct btrfs_delayed_ref_root *delayed_refs, u64 bytenr) btrfs_find_delayed_ref_head() argument
[all...]
H A Dbackref.h46 u64 bytenr; member
58 * If true and bytenr corresponds to a data extent, then references from
64 * If true and bytenr corresponds to a data extent, then the inode list
87 * Used to collect the bytenr of metadata extents that point to the
100 * cache which maps the logical address (bytenr) of leaves to an array
123 int (*check_extent_item)(u64 bytenr, const struct btrfs_extent_item *ei,
145 u64 bytenr; member
179 * same extent (bytenr) but with different offsets and lengths. This
191 u64 bytenr; member
239 int btrfs_is_data_extent_shared(struct btrfs_inode *inode, u64 bytenr,
263 u64 bytenr; global() member
341 u64 bytenr; global() member
535 btrfs_backref_panic(struct btrfs_fs_info *fs_info, u64 bytenr, int errno) btrfs_backref_panic() argument
[all...]
H A Dextent-tree.c102 struct btrfs_fs_info *fs_info, u64 bytenr, in btrfs_lookup_extent_info()
136 key.objectid = bytenr; in btrfs_lookup_extent_info()
143 extent_root = btrfs_extent_root(fs_info, bytenr); in btrfs_lookup_extent_info()
153 if (key.objectid == bytenr && in btrfs_lookup_extent_info()
193 head = btrfs_find_delayed_ref_head(delayed_refs, bytenr); in btrfs_lookup_extent_info()
432 u64 bytenr, u64 parent, in lookup_extent_data_ref()
436 struct btrfs_root *root = btrfs_extent_root(trans->fs_info, bytenr); in lookup_extent_data_ref()
445 key.objectid = bytenr; in lookup_extent_data_ref()
484 if (key.objectid != bytenr || in lookup_extent_data_ref()
508 u64 bytenr, u6 in insert_extent_data_ref()
101 btrfs_lookup_extent_info(struct btrfs_trans_handle *trans, struct btrfs_fs_info *fs_info, u64 bytenr, u64 offset, int metadata, u64 *refs, u64 *flags) btrfs_lookup_extent_info() argument
430 lookup_extent_data_ref(struct btrfs_trans_handle *trans, struct btrfs_path *path, u64 bytenr, u64 parent, u64 root_objectid, u64 owner, u64 offset) lookup_extent_data_ref() argument
506 insert_extent_data_ref(struct btrfs_trans_handle *trans, struct btrfs_path *path, u64 bytenr, u64 parent, u64 root_objectid, u64 owner, u64 offset, int refs_to_add) insert_extent_data_ref() argument
672 lookup_tree_block_ref(struct btrfs_trans_handle *trans, struct btrfs_path *path, u64 bytenr, u64 parent, u64 root_objectid) lookup_tree_block_ref() argument
696 insert_tree_block_ref(struct btrfs_trans_handle *trans, struct btrfs_path *path, u64 bytenr, u64 parent, u64 root_objectid) insert_tree_block_ref() argument
771 lookup_inline_extent_backref(struct btrfs_trans_handle *trans, struct btrfs_path *path, struct btrfs_extent_inline_ref **ref_ret, u64 bytenr, u64 num_bytes, u64 parent, u64 root_objectid, u64 owner, u64 offset, int insert) lookup_inline_extent_backref() argument
1039 lookup_extent_backref(struct btrfs_trans_handle *trans, struct btrfs_path *path, struct btrfs_extent_inline_ref **ref_ret, u64 bytenr, u64 num_bytes, u64 parent, u64 root_objectid, u64 owner, u64 offset) lookup_extent_backref() argument
1186 insert_inline_extent_backref(struct btrfs_trans_handle *trans, struct btrfs_path *path, u64 bytenr, u64 num_bytes, u64 parent, u64 root_objectid, u64 owner, u64 offset, int refs_to_add, struct btrfs_delayed_extent_op *extent_op) insert_inline_extent_backref() argument
1356 btrfs_discard_extent(struct btrfs_fs_info *fs_info, u64 bytenr, u64 num_bytes, u64 *actual_bytes) btrfs_discard_extent() argument
1489 u64 bytenr = node->bytenr; __btrfs_inc_extent_ref() local
2220 check_delayed_ref(struct btrfs_root *root, struct btrfs_path *path, u64 objectid, u64 offset, u64 bytenr) check_delayed_ref() argument
2306 check_committed_ref(struct btrfs_root *root, struct btrfs_path *path, u64 objectid, u64 offset, u64 bytenr, bool strict) check_committed_ref() argument
2381 btrfs_cross_ref_exist(struct btrfs_root *root, u64 objectid, u64 offset, u64 bytenr, bool strict, struct btrfs_path *path) btrfs_cross_ref_exist() argument
2408 u64 bytenr; __btrfs_mod_ref() local
2520 u64 bytenr = 0; first_logical_byte() local
2536 pin_down_extent(struct btrfs_trans_handle *trans, struct btrfs_block_group *cache, u64 bytenr, u64 num_bytes, int reserved) pin_down_extent() argument
2559 btrfs_pin_extent(struct btrfs_trans_handle *trans, u64 bytenr, u64 num_bytes, int reserved) btrfs_pin_extent() argument
2576 btrfs_pin_extent_for_log_replay(struct btrfs_trans_handle *trans, u64 bytenr, u64 num_bytes) btrfs_pin_extent_for_log_replay() argument
2852 do_free_extent_accounting(struct btrfs_trans_handle *trans, u64 bytenr, u64 num_bytes, bool is_data) do_free_extent_accounting() argument
2967 u64 bytenr = node->bytenr; __btrfs_free_extent() local
3232 check_ref_cleanup(struct btrfs_trans_handle *trans, u64 bytenr) check_ref_cleanup() argument
3688 u64 bytenr = block_group->start; do_allocation_zoned() local
4612 alloc_reserved_extent(struct btrfs_trans_handle *trans, u64 bytenr, u64 num_bytes) alloc_reserved_extent() argument
4836 btrfs_init_new_buffer(struct btrfs_trans_handle *trans, struct btrfs_root *root, u64 bytenr, int level, u64 owner, enum btrfs_lock_nesting nest) btrfs_init_new_buffer() argument
5042 u64 bytenr; reada_walk_down() local
5195 check_ref_exists(struct btrfs_trans_handle *trans, struct btrfs_root *root, u64 bytenr, u64 parent, int level) check_ref_exists() argument
5237 u64 bytenr; do_walk_down() local
[all...]
H A Dfile-item.c207 u64 bytenr, int cow) in btrfs_lookup_csum()
220 file_key.offset = bytenr; in btrfs_lookup_csum()
235 csum_offset = (bytenr - found_key.offset) >> in btrfs_lookup_csum()
274 * Find checksums for logical bytenr range [disk_bytenr, disk_bytenr + len) and
446 "csum hole found for disk bytenr range [%llu, %llu)", in btrfs_lookup_bio_sums()
806 * expects the csum to overlap the range [bytenr, len]
817 u64 bytenr, u64 len) in truncate_one_csum()
823 u64 end_byte = bytenr + len; in truncate_one_csum()
831 if (key->offset < bytenr && csum_end <= end_byte) { in truncate_one_csum()
833 * [ bytenr in truncate_one_csum()
204 btrfs_lookup_csum(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, u64 bytenr, int cow) btrfs_lookup_csum() argument
814 truncate_one_csum(struct btrfs_trans_handle *trans, struct btrfs_path *path, struct btrfs_key *key, u64 bytenr, u64 len) truncate_one_csum() argument
864 btrfs_del_csums(struct btrfs_trans_handle *trans, struct btrfs_root *root, u64 bytenr, u64 len) btrfs_del_csums() argument
1053 u64 bytenr; btrfs_csum_file_blocks() local
1275 u64 bytenr; btrfs_extent_item_to_extent_map() local
[all...]
H A Ddelayed-ref.h26 /* the starting bytenr of the extent */
27 u64 bytenr; member
68 u64 bytenr; member
72 * Keep it in the same cache line as 'bytenr' for more efficient
100 * This is the current outstanding mod references for this bytenr. This
102 * for a bytenr, so it is adjusted as delayed refs are run so that any
240 u64 bytenr; member
281 int action, u64 bytenr, u64 len, u64 parent) in btrfs_init_generic_ref()
284 generic_ref->bytenr = bytenr; in btrfs_init_generic_ref()
280 btrfs_init_generic_ref(struct btrfs_ref *generic_ref, int action, u64 bytenr, u64 len, u64 parent) btrfs_init_generic_ref() argument
[all...]
H A Dbackref.c132 if (disk_byte != ctx->bytenr) in find_extent_in_eb()
446 static int is_shared_data_backref(struct preftrees *preftrees, u64 bytenr) in is_shared_data_backref() argument
454 target.parent = bytenr; in is_shared_data_backref()
502 * 2. We are searching for normal backref but bytenr of this leaf in add_all_parents()
529 * We are searching for normal backref but bytenr of this leaf in add_all_parents()
936 node->bytenr, count, sc, in add_delayed_refs()
947 ref->parent, node->bytenr, count, in add_delayed_refs()
979 &key, 0, node->bytenr, count, sc, in add_delayed_refs()
990 node->bytenr, count, sc, in add_delayed_refs()
1012 * add all inline backrefs for bytenr t
1252 lookup_backref_shared_cache(struct btrfs_backref_share_check_ctx *ctx, struct btrfs_root *root, u64 bytenr, int level, bool *is_shared) lookup_backref_shared_cache() argument
1322 store_backref_shared_cache(struct btrfs_backref_share_check_ctx *ctx, struct btrfs_root *root, u64 bytenr, int level, bool is_shared) store_backref_shared_cache() argument
1853 btrfs_is_data_extent_shared(struct btrfs_inode *inode, u64 bytenr, u64 extent_gen, struct btrfs_backref_share_check_ctx *ctx) btrfs_is_data_extent_shared() argument
2850 btrfs_backref_iter_start(struct btrfs_backref_iter *iter, u64 bytenr) btrfs_backref_iter_start() argument
3017 btrfs_backref_alloc_node( struct btrfs_backref_cache *cache, u64 bytenr, int level) btrfs_backref_alloc_node() argument
[all...]
H A Dfree-space-cache.h117 int __btrfs_add_free_space(struct btrfs_block_group *block_group, u64 bytenr,
120 u64 bytenr, u64 size);
122 u64 bytenr, u64 size);
124 u64 bytenr, u64 size);
126 u64 bytenr, u64 size);
H A Drelocation.c94 u64 bytenr; member
110 u64 bytenr; member
174 in_range(node->bytenr, rc->block_group->start, in mark_block_processed()
177 set_extent_bit(&rc->processed_blocks, node->bytenr, in mark_block_processed()
178 node->bytenr + blocksize - 1, EXTENT_DIRTY, NULL); in mark_block_processed()
239 struct btrfs_backref_node *node, u64 bytenr) in update_backref_node()
243 node->bytenr = bytenr; in update_backref_node()
244 rb_node = rb_simple_insert(&cache->rb_root, node->bytenr, &node->rb_node); in update_backref_node()
246 btrfs_backref_panic(cache->fs_info, bytenr, in update_backref_node()
238 update_backref_node(struct btrfs_backref_cache *cache, struct btrfs_backref_node *node, u64 bytenr) update_backref_node() argument
362 find_reloc_root(struct btrfs_fs_info *fs_info, u64 bytenr) find_reloc_root() argument
468 build_backref_tree( struct btrfs_trans_handle *trans, struct reloc_control *rc, struct btrfs_key *node_key, int level, u64 bytenr) build_backref_tree() argument
1015 get_new_location(struct inode *reloc_inode, u64 *new_bytenr, u64 bytenr, u64 num_bytes) get_new_location() argument
1074 u64 bytenr; replace_file_extents() local
2414 u64 bytenr; do_relocation() local
2631 tree_block_processed(u64 bytenr, struct reloc_control *rc) tree_block_processed() argument
3295 __add_tree_block(struct reloc_control *rc, u64 bytenr, u32 blocksize, struct rb_root *blocks) __add_tree_block() argument
[all...]
H A Dextent-tree.h100 struct btrfs_fs_info *fs_info, u64 bytenr,
102 int btrfs_pin_extent(struct btrfs_trans_handle *trans, u64 bytenr, u64 num,
105 u64 bytenr, u64 num_bytes);
108 u64 objectid, u64 offset, u64 bytenr, bool strict,
H A Ddisk-io.h34 struct extent_buffer *read_tree_block(struct btrfs_fs_info *fs_info, u64 bytenr,
38 u64 bytenr, u64 owner_root,
75 struct btrfs_root *btrfs_csum_root(struct btrfs_fs_info *fs_info, u64 bytenr);
76 struct btrfs_root *btrfs_extent_root(struct btrfs_fs_info *fs_info, u64 bytenr);
/kernel/linux/linux-5.10/fs/btrfs/
H A Dmisc.h63 * Simple bytenr based rb_tree relate structures
65 * Any structure wants to use bytenr as single search index should have their
70 u64 bytenr; member
73 static inline struct rb_node *rb_simple_search(struct rb_root *root, u64 bytenr) in rb_simple_search() argument
81 if (bytenr < entry->bytenr) in rb_simple_search()
83 else if (bytenr > entry->bytenr) in rb_simple_search()
91 static inline struct rb_node *rb_simple_insert(struct rb_root *root, u64 bytenr, in rb_simple_insert() argument
102 if (bytenr < entr in rb_simple_insert()
[all...]
H A Dref-verify.c16 * bytenr. This just tracks the number of direct references, no shared
64 u64 bytenr; member
85 if (entry->bytenr > be->bytenr) in insert_block_entry()
87 else if (entry->bytenr < be->bytenr) in insert_block_entry()
98 static struct block_entry *lookup_block_entry(struct rb_root *root, u64 bytenr) in lookup_block_entry() argument
106 if (entry->bytenr < bytenr) in lookup_block_entry()
108 else if (entry->bytenr > byten in lookup_block_entry()
260 add_block_entry(struct btrfs_fs_info *fs_info, u64 bytenr, u64 len, u64 root_objectid) add_block_entry() argument
309 add_tree_block(struct btrfs_fs_info *fs_info, u64 ref_root, u64 parent, u64 bytenr, int level) add_tree_block() argument
354 add_shared_data_ref(struct btrfs_fs_info *fs_info, u64 parent, u32 num_refs, u64 bytenr, u64 num_bytes) add_shared_data_ref() argument
383 add_extent_data_ref(struct btrfs_fs_info *fs_info, struct extent_buffer *leaf, struct btrfs_extent_data_ref *dref, u64 bytenr, u64 num_bytes) add_extent_data_ref() argument
497 process_leaf(struct btrfs_root *root, struct btrfs_path *path, u64 *bytenr, u64 *num_bytes) process_leaf() argument
551 walk_down_tree(struct btrfs_root *root, struct btrfs_path *path, int level, u64 *bytenr, u64 *num_bytes) walk_down_tree() argument
681 u64 bytenr = generic_ref->bytenr; btrfs_ref_tree_mod() local
997 u64 bytenr = 0, num_bytes = 0; btrfs_build_ref_tree() local
[all...]
H A Dfile-item.c175 u64 bytenr, int cow) in btrfs_lookup_csum()
188 file_key.offset = bytenr; in btrfs_lookup_csum()
203 csum_offset = (bytenr - found_key.offset) >> in btrfs_lookup_csum()
484 sums->bytenr = start; in btrfs_lookup_csums_range()
560 sums->bytenr = (u64)bio->bi_iter.bi_sector << 9; in btrfs_csum_one_bio()
612 sums->bytenr = ((u64)bio->bi_iter.bi_sector << 9) in btrfs_csum_one_bio()
639 * the csum to overlap the range [bytenr, len]
650 u64 bytenr, u64 len) in truncate_one_csum()
655 u64 end_byte = bytenr + len; in truncate_one_csum()
663 if (key->offset < bytenr in truncate_one_csum()
172 btrfs_lookup_csum(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, u64 bytenr, int cow) btrfs_lookup_csum() argument
647 truncate_one_csum(struct btrfs_fs_info *fs_info, struct btrfs_path *path, struct btrfs_key *key, u64 bytenr, u64 len) truncate_one_csum() argument
697 btrfs_del_csums(struct btrfs_trans_handle *trans, struct btrfs_root *root, u64 bytenr, u64 len) btrfs_del_csums() argument
856 u64 bytenr; btrfs_csum_file_blocks() local
1058 u64 bytenr; btrfs_extent_item_to_extent_map() local
[all...]
H A Ddelayed-ref.c201 * compare two delayed tree backrefs with same bytenr and type
221 * compare two delayed data backrefs with same bytenr and type
284 u64 bytenr; in htree_insert() local
288 bytenr = ins->bytenr; in htree_insert()
294 if (bytenr < entry->bytenr) { in htree_insert()
296 } else if (bytenr > entry->bytenr) { in htree_insert()
356 * Find a head entry based on bytenr
360 find_ref_head( struct btrfs_delayed_ref_root *dr, u64 bytenr, bool return_bigger) find_ref_head() argument
749 init_delayed_ref_head(struct btrfs_delayed_ref_head *head_ref, struct btrfs_qgroup_extent_record *qrecord, u64 bytenr, u64 num_bytes, u64 ref_root, u64 reserved, int action, bool is_data, bool is_system) init_delayed_ref_head() argument
897 init_delayed_ref_common(struct btrfs_fs_info *fs_info, struct btrfs_delayed_ref_node *ref, u64 bytenr, u64 num_bytes, u64 ref_root, int action, u8 ref_type) init_delayed_ref_common() argument
942 u64 bytenr = generic_ref->bytenr; btrfs_add_delayed_tree_ref() local
1035 u64 bytenr = generic_ref->bytenr; btrfs_add_delayed_data_ref() local
1114 btrfs_add_delayed_extent_op(struct btrfs_trans_handle *trans, u64 bytenr, u64 num_bytes, struct btrfs_delayed_extent_op *extent_op) btrfs_add_delayed_extent_op() argument
1151 btrfs_find_delayed_ref_head(struct btrfs_delayed_ref_root *delayed_refs, u64 bytenr) btrfs_find_delayed_ref_head() argument
[all...]
H A Ddelayed-ref.h26 /* the starting bytenr of the extent */
27 u64 bytenr; member
72 u64 bytenr; member
98 * This is the current outstanding mod references for this bytenr. This
100 * for a bytenr, so it is adjusted as delayed refs are run so that any
245 u64 bytenr; member
265 int action, u64 bytenr, u64 len, u64 parent) in btrfs_init_generic_ref()
268 generic_ref->bytenr = bytenr; in btrfs_init_generic_ref()
352 u64 bytenr, u6
264 btrfs_init_generic_ref(struct btrfs_ref *generic_ref, int action, u64 bytenr, u64 len, u64 parent) btrfs_init_generic_ref() argument
[all...]
H A Dbackref.h44 struct btrfs_fs_info *fs_info, u64 bytenr,
48 struct btrfs_fs_info *fs_info, u64 bytenr,
64 int btrfs_check_shared(struct btrfs_root *root, u64 inum, u64 bytenr,
87 u64 bytenr; member
130 int btrfs_backref_iter_start(struct btrfs_backref_iter *iter, u64 bytenr);
145 iter->bytenr = 0; in btrfs_backref_iter_release()
166 u64 bytenr; member
274 struct btrfs_backref_cache *cache, u64 bytenr, int level);
361 u64 bytenr, int errno) in btrfs_backref_panic()
365 bytenr); in btrfs_backref_panic()
360 btrfs_backref_panic(struct btrfs_fs_info *fs_info, u64 bytenr, int errno) btrfs_backref_panic() argument
[all...]
H A Dextent-tree.c114 struct btrfs_fs_info *fs_info, u64 bytenr, in btrfs_lookup_extent_info()
147 key.objectid = bytenr; in btrfs_lookup_extent_info()
163 if (key.objectid == bytenr && in btrfs_lookup_extent_info()
201 head = btrfs_find_delayed_ref_head(delayed_refs, bytenr); in btrfs_lookup_extent_info()
440 u64 bytenr, u64 parent, in lookup_extent_data_ref()
453 key.objectid = bytenr; in lookup_extent_data_ref()
492 if (key.objectid != bytenr || in lookup_extent_data_ref()
516 u64 bytenr, u64 parent, in insert_extent_data_ref()
527 key.objectid = bytenr; in insert_extent_data_ref()
683 u64 bytenr, u6 in lookup_tree_block_ref()
113 btrfs_lookup_extent_info(struct btrfs_trans_handle *trans, struct btrfs_fs_info *fs_info, u64 bytenr, u64 offset, int metadata, u64 *refs, u64 *flags) btrfs_lookup_extent_info() argument
438 lookup_extent_data_ref(struct btrfs_trans_handle *trans, struct btrfs_path *path, u64 bytenr, u64 parent, u64 root_objectid, u64 owner, u64 offset) lookup_extent_data_ref() argument
514 insert_extent_data_ref(struct btrfs_trans_handle *trans, struct btrfs_path *path, u64 bytenr, u64 parent, u64 root_objectid, u64 owner, u64 offset, int refs_to_add) insert_extent_data_ref() argument
681 lookup_tree_block_ref(struct btrfs_trans_handle *trans, struct btrfs_path *path, u64 bytenr, u64 parent, u64 root_objectid) lookup_tree_block_ref() argument
705 insert_tree_block_ref(struct btrfs_trans_handle *trans, struct btrfs_path *path, u64 bytenr, u64 parent, u64 root_objectid) insert_tree_block_ref() argument
780 lookup_inline_extent_backref(struct btrfs_trans_handle *trans, struct btrfs_path *path, struct btrfs_extent_inline_ref **ref_ret, u64 bytenr, u64 num_bytes, u64 parent, u64 root_objectid, u64 owner, u64 offset, int insert) lookup_inline_extent_backref() argument
1038 lookup_extent_backref(struct btrfs_trans_handle *trans, struct btrfs_path *path, struct btrfs_extent_inline_ref **ref_ret, u64 bytenr, u64 num_bytes, u64 parent, u64 root_objectid, u64 owner, u64 offset) lookup_extent_backref() argument
1136 insert_inline_extent_backref(struct btrfs_trans_handle *trans, struct btrfs_path *path, u64 bytenr, u64 num_bytes, u64 parent, u64 root_objectid, u64 owner, u64 offset, int refs_to_add, struct btrfs_delayed_extent_op *extent_op) insert_inline_extent_backref() argument
1271 btrfs_discard_extent(struct btrfs_fs_info *fs_info, u64 bytenr, u64 num_bytes, u64 *actual_bytes) btrfs_discard_extent() argument
1428 u64 bytenr = node->bytenr; __btrfs_inc_extent_ref() local
2210 check_delayed_ref(struct btrfs_root *root, struct btrfs_path *path, u64 objectid, u64 offset, u64 bytenr) check_delayed_ref() argument
2290 check_committed_ref(struct btrfs_root *root, struct btrfs_path *path, u64 objectid, u64 offset, u64 bytenr, bool strict) check_committed_ref() argument
2365 btrfs_cross_ref_exist(struct btrfs_root *root, u64 objectid, u64 offset, u64 bytenr, bool strict) btrfs_cross_ref_exist() argument
2397 u64 bytenr; __btrfs_mod_ref() local
2491 btrfs_extent_readonly(struct btrfs_fs_info *fs_info, u64 bytenr) btrfs_extent_readonly() argument
2524 u64 bytenr; first_logical_byte() local
2543 pin_down_extent(struct btrfs_trans_handle *trans, struct btrfs_block_group *cache, u64 bytenr, u64 num_bytes, int reserved) pin_down_extent() argument
2567 btrfs_pin_extent(struct btrfs_trans_handle *trans, u64 bytenr, u64 num_bytes, int reserved) btrfs_pin_extent() argument
2584 btrfs_pin_extent_for_log_replay(struct btrfs_trans_handle *trans, u64 bytenr, u64 num_bytes) btrfs_pin_extent_for_log_replay() argument
2973 u64 bytenr = node->bytenr; __btrfs_free_extent() local
3270 check_ref_cleanup(struct btrfs_trans_handle *trans, u64 bytenr) check_ref_cleanup() argument
4582 btrfs_init_new_buffer(struct btrfs_trans_handle *trans, struct btrfs_root *root, u64 bytenr, int level, u64 owner, enum btrfs_lock_nesting nest) btrfs_init_new_buffer() argument
4764 u64 bytenr; reada_walk_down() local
4918 check_ref_exists(struct btrfs_trans_handle *trans, struct btrfs_root *root, u64 bytenr, u64 parent, int level) check_ref_exists() argument
4960 u64 bytenr; do_walk_down() local
[all...]
H A Dbackref.c393 static int is_shared_data_backref(struct preftrees *preftrees, u64 bytenr) in is_shared_data_backref() argument
401 target.parent = bytenr; in is_shared_data_backref()
449 * 2. We are searching for normal backref but bytenr of this leaf in add_all_parents()
476 * We are searching for normal backref but bytenr of this leaf in add_all_parents()
883 node->bytenr, count, sc, in add_delayed_refs()
894 ref->parent, node->bytenr, count, in add_delayed_refs()
926 &key, 0, node->bytenr, count, sc, in add_delayed_refs()
937 node->bytenr, count, sc, in add_delayed_refs()
959 * add all inline backrefs for bytenr to the list
964 struct btrfs_path *path, u64 bytenr, in add_inline_refs()
963 add_inline_refs(const struct btrfs_fs_info *fs_info, struct btrfs_path *path, u64 bytenr, int *info_level, struct preftrees *preftrees, struct share_check *sc) add_inline_refs() argument
1086 add_keyed_refs(struct btrfs_fs_info *fs_info, struct btrfs_path *path, u64 bytenr, int info_level, struct preftrees *preftrees, struct share_check *sc) add_keyed_refs() argument
1202 find_parent_nodes(struct btrfs_trans_handle *trans, struct btrfs_fs_info *fs_info, u64 bytenr, u64 time_seq, struct ulist *refs, struct ulist *roots, const u64 *extent_item_pos, struct share_check *sc, bool ignore_offset) global() argument
1460 btrfs_find_all_leafs(struct btrfs_trans_handle *trans, struct btrfs_fs_info *fs_info, u64 bytenr, u64 time_seq, struct ulist **leafs, const u64 *extent_item_pos, bool ignore_offset) global() argument
1494 btrfs_find_all_roots_safe(struct btrfs_trans_handle *trans, struct btrfs_fs_info *fs_info, u64 bytenr, u64 time_seq, struct ulist **roots, bool ignore_offset) global() argument
1534 btrfs_find_all_roots(struct btrfs_trans_handle *trans, struct btrfs_fs_info *fs_info, u64 bytenr, u64 time_seq, struct ulist **roots, bool ignore_offset) global() argument
1564 btrfs_check_shared(struct btrfs_root *root, u64 inum, u64 bytenr, struct ulist *roots, struct ulist *tmp) global() argument
2396 btrfs_backref_iter_start(struct btrfs_backref_iter *iter, u64 bytenr) global() argument
2560 btrfs_backref_alloc_node( struct btrfs_backref_cache *cache, u64 bytenr, int level) global() argument
[all...]
H A Drelocation.c83 u64 bytenr; member
99 u64 bytenr; member
162 in_range(node->bytenr, rc->block_group->start, in mark_block_processed()
165 set_extent_bits(&rc->processed_blocks, node->bytenr, in mark_block_processed()
166 node->bytenr + blocksize - 1, EXTENT_DIRTY); in mark_block_processed()
227 struct btrfs_backref_node *node, u64 bytenr) in update_backref_node()
231 node->bytenr = bytenr; in update_backref_node()
232 rb_node = rb_simple_insert(&cache->rb_root, node->bytenr, &node->rb_node); in update_backref_node()
234 btrfs_backref_panic(cache->fs_info, bytenr, in update_backref_node()
226 update_backref_node(struct btrfs_backref_cache *cache, struct btrfs_backref_node *node, u64 bytenr) update_backref_node() argument
350 find_reloc_root(struct btrfs_fs_info *fs_info, u64 bytenr) find_reloc_root() argument
456 build_backref_tree( struct reloc_control *rc, struct btrfs_key *node_key, int level, u64 bytenr) build_backref_tree() argument
994 get_new_location(struct inode *reloc_inode, u64 *new_bytenr, u64 bytenr, u64 num_bytes) get_new_location() argument
1053 u64 bytenr; replace_file_extents() local
1442 u64 bytenr; walk_down_reloc_tree() local
2233 u64 bytenr; do_relocation() local
2452 tree_block_processed(u64 bytenr, struct reloc_control *rc) tree_block_processed() argument
2922 __add_tree_block(struct reloc_control *rc, u64 bytenr, u32 blocksize, struct rb_root *blocks) __add_tree_block() argument
[all...]
H A Dblock-group.h224 struct btrfs_fs_info *info, u64 bytenr);
226 struct btrfs_fs_info *info, u64 bytenr);
234 bool btrfs_inc_nocow_writers(struct btrfs_fs_info *fs_info, u64 bytenr);
235 void btrfs_dec_nocow_writers(struct btrfs_fs_info *fs_info, u64 bytenr);
265 u64 bytenr, u64 num_bytes, int alloc);
H A Dfree-space-cache.h115 u64 bytenr, u64 size,
118 u64 bytenr, u64 size);
120 u64 bytenr, u64 size);
122 u64 bytenr, u64 size);
/kernel/linux/linux-6.6/fs/btrfs/tests/
H A Dqgroup-tests.c16 static int insert_normal_tree_ref(struct btrfs_root *root, u64 bytenr, in insert_normal_tree_ref() argument
31 ins.objectid = bytenr; in insert_normal_tree_ref()
68 static int add_tree_ref(struct btrfs_root *root, u64 bytenr, u64 num_bytes, in add_tree_ref() argument
80 key.objectid = bytenr; in add_tree_ref()
103 key.objectid = bytenr; in add_tree_ref()
119 static int remove_extent_item(struct btrfs_root *root, u64 bytenr, in remove_extent_item() argument
129 key.objectid = bytenr; in remove_extent_item()
150 static int remove_extent_ref(struct btrfs_root *root, u64 bytenr, in remove_extent_ref() argument
162 key.objectid = bytenr; in remove_extent_ref()
185 key.objectid = bytenr; in remove_extent_ref()
[all...]
/kernel/linux/linux-5.10/fs/btrfs/tests/
H A Dqgroup-tests.c14 static int insert_normal_tree_ref(struct btrfs_root *root, u64 bytenr, in insert_normal_tree_ref() argument
29 ins.objectid = bytenr; in insert_normal_tree_ref()
67 static int add_tree_ref(struct btrfs_root *root, u64 bytenr, u64 num_bytes, in add_tree_ref() argument
79 key.objectid = bytenr; in add_tree_ref()
103 key.objectid = bytenr; in add_tree_ref()
119 static int remove_extent_item(struct btrfs_root *root, u64 bytenr, in remove_extent_item() argument
129 key.objectid = bytenr; in remove_extent_item()
151 static int remove_extent_ref(struct btrfs_root *root, u64 bytenr, in remove_extent_ref() argument
163 key.objectid = bytenr; in remove_extent_ref()
187 key.objectid = bytenr; in remove_extent_ref()
[all...]

Completed in 33 milliseconds

1234