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

12

/linux-master/fs/btrfs/
H A Dmisc.h59 * Simple bytenr based rb_tree relate structures
61 * Any structure wants to use bytenr as single search index should have their
66 u64 bytenr; member in struct:rb_simple_node
69 static inline struct rb_node *rb_simple_search(struct rb_root *root, u64 bytenr) argument
77 if (bytenr < entry->bytenr)
79 else if (bytenr > entry->bytenr)
88 * Search @root from an entry that starts or comes after @bytenr.
91 * @bytenr
96 rb_simple_search_first(struct rb_root *root, u64 bytenr) argument
122 rb_simple_insert(struct rb_root *root, u64 bytenr, struct rb_node *node) argument
[all...]
H A Dref-verify.c19 * bytenr. This just tracks the number of direct references, no shared
67 u64 bytenr; member in struct:block_entry
88 if (entry->bytenr > be->bytenr)
90 else if (entry->bytenr < be->bytenr)
101 static struct block_entry *lookup_block_entry(struct rb_root *root, u64 bytenr) argument
109 if (entry->bytenr < bytenr)
111 else if (entry->bytenr > byten
263 add_block_entry(struct btrfs_fs_info *fs_info, u64 bytenr, u64 len, u64 root_objectid) argument
312 add_tree_block(struct btrfs_fs_info *fs_info, u64 ref_root, u64 parent, u64 bytenr, int level) argument
357 add_shared_data_ref(struct btrfs_fs_info *fs_info, u64 parent, u32 num_refs, u64 bytenr, u64 num_bytes) 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) argument
503 process_leaf(struct btrfs_root *root, struct btrfs_path *path, u64 *bytenr, u64 *num_bytes, int *tree_block_level) argument
558 walk_down_tree(struct btrfs_root *root, struct btrfs_path *path, int level, u64 *bytenr, u64 *num_bytes, int *tree_block_level) argument
675 u64 bytenr = generic_ref->bytenr; local
989 u64 bytenr = 0, num_bytes = 0; local
[all...]
H A Dbackref.h58 u64 bytenr; member in struct:btrfs_backref_walk_ctx
70 * If true and bytenr corresponds to a data extent, then references from
76 * If true and bytenr corresponds to a data extent, then the inode list
99 * Used to collect the bytenr of metadata extents that point to the
112 * cache which maps the logical address (bytenr) of leaves to an array
135 int (*check_extent_item)(u64 bytenr, const struct btrfs_extent_item *ei,
157 u64 bytenr; member in struct:btrfs_backref_shared_cache_entry
191 * same extent (bytenr) but with different offsets and lengths. This
203 u64 bytenr; member in struct:btrfs_backref_share_check_ctx::__anon1677
251 int btrfs_is_data_extent_shared(struct btrfs_inode *inode, u64 bytenr,
275 u64 bytenr; member in struct:btrfs_backref_iter
318 u64 bytenr; member in struct:btrfs_backref_node::__anon1678
451 btrfs_backref_panic(struct btrfs_fs_info *fs_info, u64 bytenr, int error) argument
[all...]
H A Ddelayed-ref.c308 * compare two delayed tree backrefs with same bytenr and type
328 * compare two delayed data backrefs with same bytenr and type
391 u64 bytenr; local
395 bytenr = ins->bytenr;
401 if (bytenr < entry->bytenr) {
403 } else if (bytenr > entry->bytenr) {
463 * Find a head entry based on bytenr
467 find_ref_head( struct btrfs_delayed_ref_root *dr, u64 bytenr, bool return_bigger) argument
830 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, u64 owning_root) argument
983 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) argument
1007 btrfs_init_generic_ref(struct btrfs_ref *generic_ref, int action, u64 bytenr, u64 len, u64 parent, u64 owning_root) argument
1072 u64 bytenr = generic_ref->bytenr; local
1162 u64 bytenr = generic_ref->bytenr; local
1238 btrfs_add_delayed_extent_op(struct btrfs_trans_handle *trans, u64 bytenr, u64 num_bytes, struct btrfs_delayed_extent_op *extent_op) argument
1293 btrfs_find_delayed_ref_head(struct btrfs_delayed_ref_root *delayed_refs, u64 bytenr) argument
[all...]
H A Dfile-item.c203 u64 bytenr, int cow)
216 file_key.offset = bytenr;
231 csum_offset = (bytenr - found_key.offset) >>
270 * Find checksums for logical bytenr range [disk_bytenr, disk_bytenr + len) and
442 "csum hole found for disk bytenr range [%llu, %llu)",
802 * expects the csum to overlap the range [bytenr, len]
813 u64 bytenr, u64 len)
819 u64 end_byte = bytenr + len;
827 if (key->offset < bytenr && csum_end <= end_byte) {
829 * [ bytenr
200 btrfs_lookup_csum(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, u64 bytenr, int cow) argument
810 truncate_one_csum(struct btrfs_trans_handle *trans, struct btrfs_path *path, struct btrfs_key *key, u64 bytenr, u64 len) argument
860 btrfs_del_csums(struct btrfs_trans_handle *trans, struct btrfs_root *root, u64 bytenr, u64 len) argument
1049 u64 bytenr; local
1269 u64 bytenr; local
[all...]
H A Drelocation.h30 struct btrfs_root *find_reloc_root(struct btrfs_fs_info *fs_info, u64 bytenr);
H A Ddisk-io.h46 struct extent_buffer *read_tree_block(struct btrfs_fs_info *fs_info, u64 bytenr,
50 u64 bytenr, u64 owner_root,
84 struct btrfs_root *btrfs_csum_root(struct btrfs_fs_info *fs_info, u64 bytenr);
85 struct btrfs_root *btrfs_extent_root(struct btrfs_fs_info *fs_info, u64 bytenr);
H A Dfree-space-cache.h131 u64 bytenr, u64 size);
133 u64 bytenr, u64 size);
135 u64 bytenr, u64 size);
137 u64 bytenr, u64 size);
H A Dextent-tree.c101 struct btrfs_fs_info *fs_info, u64 bytenr,
137 key.objectid = bytenr;
144 extent_root = btrfs_extent_root(fs_info, bytenr);
154 if (key.objectid == bytenr &&
196 head = btrfs_find_delayed_ref_head(delayed_refs, bytenr);
442 u64 bytenr, u64 parent,
446 struct btrfs_root *root = btrfs_extent_root(trans->fs_info, bytenr);
455 key.objectid = bytenr;
494 if (key.objectid != bytenr ||
518 u64 bytenr, u6
100 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, u64 *owning_root) argument
440 lookup_extent_data_ref(struct btrfs_trans_handle *trans, struct btrfs_path *path, u64 bytenr, u64 parent, u64 root_objectid, u64 owner, u64 offset) argument
516 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) argument
682 lookup_tree_block_ref(struct btrfs_trans_handle *trans, struct btrfs_path *path, u64 bytenr, u64 parent, u64 root_objectid) argument
706 insert_tree_block_ref(struct btrfs_trans_handle *trans, struct btrfs_path *path, u64 bytenr, u64 parent, u64 root_objectid) argument
781 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) argument
1051 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) argument
1198 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) argument
1368 btrfs_discard_extent(struct btrfs_fs_info *fs_info, u64 bytenr, u64 num_bytes, u64 *actual_bytes) argument
1499 u64 bytenr = node->bytenr; local
2289 check_delayed_ref(struct btrfs_root *root, struct btrfs_path *path, u64 objectid, u64 offset, u64 bytenr) argument
2375 check_committed_ref(struct btrfs_root *root, struct btrfs_path *path, u64 objectid, u64 offset, u64 bytenr, bool strict) argument
2468 btrfs_cross_ref_exist(struct btrfs_root *root, u64 objectid, u64 offset, u64 bytenr, bool strict, struct btrfs_path *path) argument
2495 u64 bytenr; local
2608 u64 bytenr = 0; local
2624 pin_down_extent(struct btrfs_trans_handle *trans, struct btrfs_block_group *cache, u64 bytenr, u64 num_bytes, int reserved) argument
2647 btrfs_pin_extent(struct btrfs_trans_handle *trans, u64 bytenr, u64 num_bytes, int reserved) argument
2992 do_free_extent_accounting(struct btrfs_trans_handle *trans, u64 bytenr, struct btrfs_squota_delta *delta) argument
3122 u64 bytenr = node->bytenr; local
3406 check_ref_cleanup(struct btrfs_trans_handle *trans, u64 bytenr) argument
3860 u64 bytenr = block_group->start; local
4784 alloc_reserved_extent(struct btrfs_trans_handle *trans, u64 bytenr, u64 num_bytes) argument
5055 btrfs_init_new_buffer(struct btrfs_trans_handle *trans, struct btrfs_root *root, u64 bytenr, int level, u64 owner, enum btrfs_lock_nesting nest) argument
5257 u64 bytenr; local
5411 check_ref_exists(struct btrfs_trans_handle *trans, struct btrfs_root *root, u64 bytenr, u64 parent, int level) argument
5453 u64 bytenr; local
[all...]
H A Dfile-item.h53 struct btrfs_root *root, u64 bytenr, u64 len);
61 u64 bytenr, int mod);
H A Ddelayed-ref.h42 /* the starting bytenr of the extent */
43 u64 bytenr; member in struct:btrfs_delayed_ref_node
84 u64 bytenr; member in struct:btrfs_delayed_ref_head
88 * Keep it in the same cache line as 'bytenr' for more efficient
116 * This is the current outstanding mod references for this bytenr. This
118 * for a bytenr, so it is adjusted as delayed refs are run so that any
269 u64 bytenr; member in struct:btrfs_ref
321 void btrfs_init_generic_ref(struct btrfs_ref *generic_ref, int action, u64 bytenr,
366 u64 bytenr, u64 num_bytes,
374 u64 bytenr);
[all...]
H A Dextent-tree.h111 struct btrfs_fs_info *fs_info, u64 bytenr,
114 int btrfs_pin_extent(struct btrfs_trans_handle *trans, u64 bytenr, u64 num,
120 u64 objectid, u64 offset, u64 bytenr, bool strict,
H A Dbackref.c132 if (disk_byte != ctx->bytenr)
443 static int is_shared_data_backref(struct preftrees *preftrees, u64 bytenr) argument
451 target.parent = bytenr;
499 * 2. We are searching for normal backref but bytenr of this leaf
526 * We are searching for normal backref but bytenr of this leaf
933 node->bytenr, count, sc,
944 ref->parent, node->bytenr, count,
976 &key, 0, node->bytenr, count, sc,
987 node->bytenr, count, sc,
1009 * add all inline backrefs for bytenr t
1250 lookup_backref_shared_cache(struct btrfs_backref_share_check_ctx *ctx, struct btrfs_root *root, u64 bytenr, int level, bool *is_shared) argument
1320 store_backref_shared_cache(struct btrfs_backref_share_check_ctx *ctx, struct btrfs_root *root, u64 bytenr, int level, bool is_shared) argument
1853 btrfs_is_data_extent_shared(struct btrfs_inode *inode, u64 bytenr, u64 extent_gen, struct btrfs_backref_share_check_ctx *ctx) argument
2866 btrfs_backref_iter_start(struct btrfs_backref_iter *iter, u64 bytenr) argument
3045 btrfs_backref_alloc_node( struct btrfs_backref_cache *cache, u64 bytenr, int level) argument
[all...]
H A Dblock-group.h296 struct btrfs_fs_info *info, u64 bytenr);
298 struct btrfs_fs_info *info, u64 bytenr);
307 u64 bytenr);
339 u64 bytenr, u64 num_bytes, bool alloc);
H A Drelocation.c94 u64 bytenr; member in struct:mapping_node::__anon1702
110 u64 bytenr; member in struct:tree_block::__anon1703
177 in_range(node->bytenr, rc->block_group->start,
180 set_extent_bit(&rc->processed_blocks, node->bytenr,
181 node->bytenr + blocksize - 1, EXTENT_DIRTY, NULL);
235 struct btrfs_backref_node *node, u64 bytenr)
239 node->bytenr = bytenr;
240 rb_node = rb_simple_insert(&cache->rb_root, node->bytenr, &node->rb_node);
242 btrfs_backref_panic(cache->fs_info, bytenr,
234 update_backref_node(struct btrfs_backref_cache *cache, struct btrfs_backref_node *node, u64 bytenr) argument
357 find_reloc_root(struct btrfs_fs_info *fs_info, u64 bytenr) argument
463 build_backref_tree( struct btrfs_trans_handle *trans, struct reloc_control *rc, struct btrfs_key *node_key, int level, u64 bytenr) argument
1011 get_new_location(struct inode *reloc_inode, u64 *new_bytenr, u64 bytenr, u64 num_bytes) argument
1070 u64 bytenr; local
2413 u64 bytenr; local
2631 tree_block_processed(u64 bytenr, struct reloc_control *rc) argument
3327 __add_tree_block(struct reloc_control *rc, u64 bytenr, u32 blocksize, struct rb_root *blocks) argument
[all...]
H A Dqgroup.h95 * If we are going to COW tree block OB, we check OB's bytenr against
100 * Check NA's bytenr against tree X's swapped_blocks, and get a hit.
130 u64 bytenr; member in struct:btrfs_qgroup_extent_record
152 /* bytenr/generation of the tree block in subvolume tree after swap */
156 /* bytenr/generation of the tree block in reloc tree after swap */
341 int btrfs_qgroup_trace_extent(struct btrfs_trans_handle *trans, u64 bytenr,
348 int btrfs_qgroup_account_extent(struct btrfs_trans_handle *trans, u64 bytenr,
H A Ddisk-io.c437 "tree first key mismatch detected, bytenr=%llu parent_transid=%llu key expected=(%llu,%u,%llu) has=(%llu,%u,%llu)",
605 u64 bytenr, u64 owner_root,
609 return alloc_test_extent_buffer(fs_info, bytenr);
610 return alloc_extent_buffer(fs_info, bytenr, owner_root, level);
614 * Read tree block at logical address @bytenr and do variant basic but critical
620 struct extent_buffer *read_tree_block(struct btrfs_fs_info *fs_info, u64 bytenr, argument
628 buf = btrfs_find_create_tree_block(fs_info, bytenr, check->owner_root,
808 static u64 btrfs_global_root_id(struct btrfs_fs_info *fs_info, u64 bytenr) argument
816 if (bytenr)
817 block_group = btrfs_lookup_block_group(fs_info, bytenr);
603 btrfs_find_create_tree_block( struct btrfs_fs_info *fs_info, u64 bytenr, u64 owner_root, int level) argument
829 btrfs_csum_root(struct btrfs_fs_info *fs_info, u64 bytenr) argument
840 btrfs_extent_root(struct btrfs_fs_info *fs_info, u64 bytenr) argument
2079 u64 bytenr = btrfs_super_log_root(disk_super); local
2582 load_super_root(struct btrfs_root *root, u64 bytenr, u64 gen, int level) argument
2612 u64 gen, bytenr; local
3653 u64 bytenr, bytenr_orig; local
3746 u64 bytenr, bytenr_orig; local
3837 u64 bytenr; local
[all...]
H A Dqgroup.c1902 u64 bytenr = record->bytenr; local
1914 if (bytenr < entry->bytenr) {
1916 } else if (bytenr > entry->bytenr) {
1986 ctx.bytenr = qrecord->bytenr;
2010 * Inform qgroup to trace one dirty extent, specified by @bytenr and
2022 int btrfs_qgroup_trace_extent(struct btrfs_trans_handle *trans, u64 bytenr, argument
2065 u64 bytenr, num_bytes; local
2830 btrfs_qgroup_account_extent(struct btrfs_trans_handle *trans, u64 bytenr, u64 num_bytes, struct ulist *old_roots, struct ulist *new_roots) argument
[all...]
H A Dblock-group.c216 * This will return the block group at or after bytenr if contains is 0, else
217 * it will return the block group that contains the bytenr
220 struct btrfs_fs_info *info, u64 bytenr, int contains)
234 if (bytenr < start) {
238 } else if (bytenr > start) {
239 if (contains && bytenr <= end) {
257 * Return the block group that starts at or after bytenr
260 struct btrfs_fs_info *info, u64 bytenr)
262 return block_group_cache_tree_search(info, bytenr, 0);
266 * Return the block group that contains the given bytenr
219 block_group_cache_tree_search( struct btrfs_fs_info *info, u64 bytenr, int contains) argument
259 btrfs_lookup_first_block_group( struct btrfs_fs_info *info, u64 bytenr) argument
268 btrfs_lookup_block_group( struct btrfs_fs_info *info, u64 bytenr) argument
316 btrfs_inc_nocow_writers(struct btrfs_fs_info *fs_info, u64 bytenr) argument
2068 u64 bytenr; local
2142 u64 bytenr; local
3597 btrfs_update_block_group(struct btrfs_trans_handle *trans, u64 bytenr, u64 num_bytes, bool alloc) argument
[all...]
H A Dtree-checker.c1215 "invalid root bytenr, have %llu expect to be aligned to %u",
1250 u64 bytenr; local
1254 bytenr = key.objectid;
1268 "corrupt %s: block=%llu slot=%d extent bytenr=%llu len=%llu %pV",
1270 eb->start, slot, bytenr, len, &vaf);
1297 /* key->objectid is the bytenr for both key types */
1452 /* Contains parent bytenr */
1457 "invalid tree parent bytenr, have %llu expect aligned to %u",
1483 /* Contains parent bytenr and ref count */
1489 "invalid data parent bytenr, hav
1958 u64 bytenr; local
[all...]
H A Dextent_io.h269 u64 bytenr, u64 owner_root, u64 gen, int level);
H A Daccessors.h686 BTRFS_SETGET_HEADER_FUNCS(header_bytenr, struct btrfs_header, bytenr, 64);
696 BTRFS_SETGET_STACK_FUNCS(stack_header_bytenr, struct btrfs_header, bytenr, 64);
741 BTRFS_SETGET_FUNCS(disk_root_bytenr, struct btrfs_root_item, bytenr, 64);
745 BTRFS_SETGET_STACK_FUNCS(root_bytenr, struct btrfs_root_item, bytenr, 64);
857 BTRFS_SETGET_STACK_FUNCS(super_bytenr, struct btrfs_super_block, bytenr, 64);
/linux-master/fs/btrfs/tests/
H A Dqgroup-tests.c16 static int insert_normal_tree_ref(struct btrfs_root *root, u64 bytenr, argument
31 ins.objectid = bytenr;
68 static int add_tree_ref(struct btrfs_root *root, u64 bytenr, u64 num_bytes, argument
80 key.objectid = bytenr;
103 key.objectid = bytenr;
119 static int remove_extent_item(struct btrfs_root *root, u64 bytenr, argument
129 key.objectid = bytenr;
150 static int remove_extent_ref(struct btrfs_root *root, u64 bytenr, argument
162 key.objectid = bytenr;
185 key.objectid = bytenr;
[all...]
/linux-master/include/trace/events/
H A Dbtrfs.h879 __field( u64, bytenr )
890 __entry->bytenr = ref->bytenr;
900 TP_printk_btrfs("bytenr=%llu num_bytes=%llu action=%s "
903 __entry->bytenr,
942 __field( u64, bytenr )
954 __entry->bytenr = ref->bytenr;
965 TP_printk_btrfs("bytenr=%llu num_bytes=%llu action=%s "
968 __entry->bytenr,
[all...]
/linux-master/include/uapi/linux/
H A Dbtrfs_tree.h487 __le64 bytenr; member in struct:btrfs_header
673 __le64 bytenr; member in struct:btrfs_super_block
928 __le64 bytenr; member in struct:btrfs_root_item

Completed in 560 milliseconds

12