Home
last modified time | relevance | path

Searched refs:bytenr (Results 1 – 25 of 29) sorted by relevance

12

/linux/fs/btrfs/
H A Dmisc.h132 u64 bytenr; member
135 static inline struct rb_node *rb_simple_search(const struct rb_root *root, u64 bytenr) in rb_simple_search() argument
143 if (bytenr < entry->bytenr) in rb_simple_search()
145 else if (bytenr > entry->bytenr) in rb_simple_search()
163 u64 bytenr) in rb_simple_search_first() argument
171 if (bytenr < entry->bytenr) { in rb_simple_search_first()
172 if (!ret || entry->bytenr < ret_entry->bytenr) { in rb_simple_search_first()
178 } else if (bytenr > entry->bytenr) { in rb_simple_search_first()
193 if (new_entry->bytenr < existing_entry->bytenr) in rb_simple_node_bytenr_cmp()
195 else if (new_entry->bytenr > existing_entry->bytenr) in rb_simple_node_bytenr_cmp()
H A Dref-verify.c67 u64 bytenr; member
80 const u64 *bytenr = key; in block_entry_bytenr_key_cmp() local
83 if (entry->bytenr < *bytenr) in block_entry_bytenr_key_cmp()
85 else if (entry->bytenr > *bytenr) in block_entry_bytenr_key_cmp()
95 return block_entry_bytenr_key_cmp(&new_entry->bytenr, existing); in block_entry_bytenr_cmp()
107 static struct block_entry *lookup_block_entry(struct rb_root *root, u64 bytenr) in lookup_block_entry() argument
111 node = rb_find(&bytenr, root, block_entry_bytenr_key_cmp); in lookup_block_entry()
246 u64 bytenr, u64 len, in add_block_entry() argument
259 be->bytenr = bytenr; in add_block_entry()
295 u64 parent, u64 bytenr, int level) in add_tree_block() argument
[all …]
H A Dbackref.c132 if (disk_byte != ctx->bytenr) in find_extent_in_eb()
442 static int is_shared_data_backref(struct preftrees *preftrees, u64 bytenr) in is_shared_data_backref() argument
450 target.parent = bytenr; in is_shared_data_backref()
498 * 2. We are searching for normal backref but bytenr of this leaf in add_all_parents()
525 * We are searching for normal backref but bytenr of this leaf in add_all_parents()
925 key_ptr, level + 1, node->bytenr, in add_delayed_refs()
938 node->parent, node->bytenr, count, in add_delayed_refs()
967 &key, 0, node->bytenr, count, sc, in add_delayed_refs()
974 node->bytenr, count, sc, in add_delayed_refs()
996 * add all inline backrefs for bytenr t
1239 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
1309 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
1843 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
2840 btrfs_backref_iter_start(struct btrfs_fs_info * fs_info,struct btrfs_backref_iter * iter,u64 bytenr) btrfs_backref_iter_start() argument
3031 btrfs_backref_alloc_node(struct btrfs_backref_cache * cache,u64 bytenr,int level) btrfs_backref_alloc_node() argument
[all...]
H A Dextent-tree.c80 "missing extent root for extent at bytenr %llu", start); in btrfs_lookup_data_extent()
104 struct btrfs_fs_info *fs_info, u64 bytenr, in btrfs_lookup_extent_info() argument
132 key.objectid = bytenr; in btrfs_lookup_extent_info()
139 extent_root = btrfs_extent_root(fs_info, bytenr); in btrfs_lookup_extent_info()
142 "missing extent root for extent at bytenr %llu", bytenr); in btrfs_lookup_extent_info()
155 if (key.objectid == bytenr && in btrfs_lookup_extent_info()
196 head = btrfs_find_delayed_ref_head(fs_info, delayed_refs, bytenr); in btrfs_lookup_extent_info()
439 u64 bytenr, u64 parent, in lookup_extent_data_ref() argument
443 struct btrfs_root *root = btrfs_extent_root(trans->fs_info, bytenr); in lookup_extent_data_ref()
520 insert_extent_data_ref(struct btrfs_trans_handle * trans,struct btrfs_path * path,const struct btrfs_delayed_ref_node * node,u64 bytenr) insert_extent_data_ref() argument
688 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
719 insert_tree_block_ref(struct btrfs_trans_handle * trans,struct btrfs_path * path,const struct btrfs_delayed_ref_node * node,u64 bytenr) insert_tree_block_ref() argument
800 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
1095 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
1240 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
1424 btrfs_discard_extent(struct btrfs_fs_info * fs_info,u64 bytenr,u64 num_bytes,u64 * actual_bytes,bool do_remap) btrfs_discard_extent() argument
1534 u64 bytenr = node->bytenr; __btrfs_inc_extent_ref() local
1602 u64 bytenr = node->bytenr; drop_remap_tree_ref() local
2292 check_delayed_ref(struct btrfs_inode * inode,struct btrfs_path * path,u64 offset,u64 bytenr) check_delayed_ref() argument
2423 check_committed_ref(struct btrfs_inode * inode,struct btrfs_path * path,u64 offset,u64 bytenr) check_committed_ref() argument
2506 btrfs_cross_ref_exist(struct btrfs_inode * inode,u64 offset,u64 bytenr,struct btrfs_path * path) btrfs_cross_ref_exist() argument
2671 u64 bytenr = 0; first_logical_byte() local
2689 pin_down_extent(struct btrfs_trans_handle * trans,struct btrfs_block_group * bg,u64 bytenr,u64 num_bytes,bool reserved) pin_down_extent() argument
2708 btrfs_pin_extent(struct btrfs_trans_handle * trans,u64 bytenr,u64 num_bytes) btrfs_pin_extent() argument
3141 do_free_extent_accounting(struct btrfs_trans_handle * trans,u64 bytenr,struct btrfs_squota_delta * delta,struct btrfs_path * path) do_free_extent_accounting() argument
3291 u64 bytenr = node->bytenr; __btrfs_free_extent() local
3572 check_ref_cleanup(struct btrfs_trans_handle * trans,u64 bytenr) check_ref_cleanup() argument
4038 u64 bytenr = block_group->start; do_allocation_zoned() local
4970 alloc_reserved_extent(struct btrfs_trans_handle * trans,u64 bytenr,u64 num_bytes) alloc_reserved_extent() argument
5259 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
5556 u64 bytenr; reada_walk_down() local
5712 check_ref_exists(struct btrfs_trans_handle * trans,struct btrfs_root * root,u64 bytenr,u64 parent,int level) check_ref_exists() argument
5922 u64 bytenr; do_walk_down() local
[all...]
H A Dfile-item.c202 u64 bytenr, int cow) in btrfs_lookup_csum() argument
216 file_key.offset = bytenr; in btrfs_lookup_csum()
230 csum_offset = (bytenr - found_key.offset) >> in btrfs_lookup_csum()
269 * Find checksums for logical bytenr range [disk_bytenr, disk_bytenr + len) and
313 "missing csum root for extent at bytenr %llu", in search_csum_tree()
477 * is deleted in the same transaction and its bytenr is not in btrfs_lookup_bio_sums()
501 "csum hole found for disk bytenr range [%llu, %llu)", in btrfs_lookup_bio_sums()
883 * expects the csum to overlap the range [bytenr, len] in btrfs_alloc_dummy_sum()
894 u64 bytenr, u64 len)
900 u64 end_byte = bytenr
905 truncate_one_csum(struct btrfs_trans_handle * trans,struct btrfs_path * path,struct btrfs_key * key,u64 bytenr,u64 len) truncate_one_csum() argument
953 btrfs_del_csums(struct btrfs_trans_handle * trans,struct btrfs_root * root,u64 bytenr,u64 len) btrfs_del_csums() argument
1140 u64 bytenr; btrfs_insert_data_csums() local
[all...]
H A Ddelayed-ref.h72 u64 bytenr; member
126 u64 bytenr; member
279 u64 bytenr; member
384 u64 bytenr, u64 num_bytes, u8 level,
393 u64 bytenr);
H A Ddisk-io.h48 struct extent_buffer *read_tree_block(struct btrfs_fs_info *fs_info, u64 bytenr,
53 u64 bytenr, u64 owner_root,
82 struct btrfs_root *btrfs_csum_root(struct btrfs_fs_info *fs_info, u64 bytenr);
83 struct btrfs_root *btrfs_extent_root(struct btrfs_fs_info *fs_info, u64 bytenr);
H A Drelocation.c98 u64 bytenr; member
119 u64 bytenr; member
282 in_range(node->bytenr, rc->block_group->start, in mark_block_processed()
285 btrfs_set_extent_bit(&rc->processed_blocks, node->bytenr, in mark_block_processed()
286 node->bytenr + blocksize - 1, EXTENT_DIRTY, in mark_block_processed()
400 struct btrfs_root *find_reloc_root(struct btrfs_fs_info *fs_info, u64 bytenr) in find_reloc_root() argument
409 rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root, bytenr); in find_reloc_root()
502 int level, u64 bytenr) in build_backref_tree() argument
522 node = btrfs_backref_alloc_node(cache, bytenr, level); in build_backref_tree()
582 node->bytenr in __add_reloc_root()
871 get_new_location(struct inode * reloc_inode,u64 * new_bytenr,u64 bytenr,u64 num_bytes) get_new_location() argument
943 u64 bytenr; replace_file_extents() local
2328 u64 bytenr; do_relocation() local
2548 tree_block_processed(u64 bytenr,struct reloc_control * rc) tree_block_processed() argument
3266 __add_tree_block(struct reloc_control * rc,u64 bytenr,u32 blocksize,struct rb_root * blocks) __add_tree_block() argument
6209 btrfs_remove_extent_from_remap_tree(struct btrfs_trans_handle * trans,struct btrfs_path * path,u64 bytenr,u64 num_bytes) btrfs_remove_extent_from_remap_tree() argument
[all...]
H A Dblock-group.h328 struct btrfs_fs_info *info, u64 bytenr);
330 struct btrfs_fs_info *info, u64 bytenr);
339 u64 bytenr);
373 u64 bytenr, u64 num_bytes, bool alloc);
H A Ddisk-io.c441 "tree first key mismatch detected, bytenr=%llu parent_transid=%llu key expected=(%llu,%u,%llu) has=(%llu,%u,%llu)", in btrfs_validate_extent_buffer()
604 u64 bytenr, u64 owner_root,
608 return alloc_test_extent_buffer(fs_info, bytenr);
609 return alloc_extent_buffer(fs_info, pa, bytenr, owner_root, level);
613 * Read tree block at logical address @bytenr and do variant basic but critical in read_tree_block()
619 struct extent_buffer *read_tree_block(struct btrfs_fs_info *fs_info, u64 bytenr, in read_tree_block()
628 buf = btrfs_find_create_tree_block(fs_info, &pa, bytenr, check->owner_root, in read_tree_block()
783 static u64 btrfs_global_root_id(struct btrfs_fs_info *fs_info, u64 bytenr) in btrfs_global_root_id()
791 if (bytenr) in btrfs_global_root_id()
792 block_group = btrfs_lookup_block_group(fs_info, bytenr); in btrfs_global_root_id()
595 btrfs_find_create_tree_block(struct btrfs_fs_info * fs_info,struct btrfs_eb_prealloc * pa,u64 bytenr,u64 owner_root,int level) btrfs_find_create_tree_block() argument
610 read_tree_block(struct btrfs_fs_info * fs_info,u64 bytenr,struct btrfs_tree_parent_check * check) read_tree_block() argument
774 btrfs_global_root_id(struct btrfs_fs_info * fs_info,u64 bytenr) btrfs_global_root_id() argument
795 btrfs_csum_root(struct btrfs_fs_info * fs_info,u64 bytenr) btrfs_csum_root() argument
806 btrfs_extent_root(struct btrfs_fs_info * fs_info,u64 bytenr) btrfs_extent_root() argument
2035 u64 bytenr = btrfs_super_log_root(disk_super); btrfs_replay_log() local
2647 load_super_root(struct btrfs_root * root,u64 bytenr,u64 gen,int level) load_super_root() argument
2672 u64 gen, bytenr; load_important_roots() local
3880 u64 bytenr, bytenr_orig; write_dev_supers() local
3966 u64 bytenr; wait_dev_supers() local
[all...]
H A Dqgroup.c2053 u64 bytenr) in btrfs_qgroup_trace_extent_nolock()
2056 const unsigned long index = (bytenr >> fs_info->sectorsize_bits); in btrfs_qgroup_trace_extent_nolock()
2062 if (bytenr >= MAX_LFS_FILESIZE) { in btrfs_qgroup_trace_extent_nolock()
2065 bytenr); in btrfs_qgroup_trace_extent_nolock()
2071 trace_btrfs_qgroup_trace_extent(fs_info, record, bytenr);
2117 u64 bytenr) in btrfs_qgroup_trace_extent_post()
2121 .bytenr = bytenr, in btrfs_qgroup_trace_extent_post()
2171 * Inform qgroup to trace one dirty extent, specified by @bytenr and in btrfs_qgroup_trace_extent()
2183 int btrfs_qgroup_trace_extent(struct btrfs_trans_handle *trans, u64 bytenr, in btrfs_qgroup_trace_extent()
2027 btrfs_qgroup_trace_extent_nolock(struct btrfs_fs_info * fs_info,struct btrfs_delayed_ref_root * delayed_refs,struct btrfs_qgroup_extent_record * record,u64 bytenr) btrfs_qgroup_trace_extent_nolock() argument
2091 btrfs_qgroup_trace_extent_post(struct btrfs_trans_handle * trans,struct btrfs_qgroup_extent_record * qrecord,u64 bytenr) btrfs_qgroup_trace_extent_post() argument
2157 btrfs_qgroup_trace_extent(struct btrfs_trans_handle * trans,u64 bytenr,u64 num_bytes) btrfs_qgroup_trace_extent() argument
2203 u64 bytenr, num_bytes; btrfs_qgroup_trace_leaf_items() local
2948 btrfs_qgroup_account_extent(struct btrfs_trans_handle * trans,u64 bytenr,u64 num_bytes,struct ulist * old_roots,struct ulist * new_roots) btrfs_qgroup_account_extent() argument
3042 const u64 bytenr = (((u64)index) << fs_info->sectorsize_bits); btrfs_qgroup_account_extents() local
4731 const u64 *bytenr = key; qgroup_swapped_block_bytenr_key_cmp() local
[all...]
H A Dblock-group.c255 * This will return the block group at or after bytenr if contains is 0, else
256 * it will return the block group that contains the bytenr
259 struct btrfs_fs_info *info, u64 bytenr, int contains) in block_group_cache_tree_search() argument
273 if (bytenr < start) { in block_group_cache_tree_search()
277 } else if (bytenr > start) { in block_group_cache_tree_search()
278 if (contains && bytenr <= end) { in block_group_cache_tree_search()
296 * Return the block group that starts at or after bytenr
299 struct btrfs_fs_info *info, u64 bytenr) in btrfs_lookup_first_block_group() argument
301 return block_group_cache_tree_search(info, bytenr, 0); in btrfs_lookup_first_block_group()
305 * Return the block group that contains the given bytenr
308 btrfs_lookup_block_group(struct btrfs_fs_info * info,u64 bytenr) btrfs_lookup_block_group() argument
356 btrfs_inc_nocow_writers(struct btrfs_fs_info * fs_info,u64 bytenr) btrfs_inc_nocow_writers() argument
2279 u64 bytenr; btrfs_rmap_block() local
2353 u64 bytenr; exclude_super_stripes() local
3877 btrfs_update_block_group(struct btrfs_trans_handle * trans,u64 bytenr,u64 num_bytes,bool alloc) btrfs_update_block_group() argument
[all...]
H A Dfile.c303 .bytenr = disk_bytenr, in btrfs_drop_extents()
402 .bytenr = disk_bytenr, in btrfs_drop_extents()
494 u64 bytenr, u64 orig_offset, u64 *start, u64 *end) in extent_mergeable() argument
509 btrfs_file_extent_disk_bytenr(leaf, fi) != bytenr || in extent_mergeable()
542 u64 bytenr; in btrfs_mark_extent_written() local
592 bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); in btrfs_mark_extent_written()
601 ino, bytenr, orig_offset, in btrfs_mark_extent_written()
627 ino, bytenr, orig_offset, in btrfs_mark_extent_written()
682 ref.bytenr = bytenr; in btrfs_mark_extent_written()
712 ref.bytenr = bytenr; in btrfs_mark_extent_written()
[all …]
H A Dtree-checker.c1400 "invalid root bytenr, have %llu expect to be aligned to %u",
1483 u64 bytenr; in check_extent_item()
1487 bytenr = key.objectid; in check_extent_item()
1501 "corrupt %s: block=%llu slot=%d extent bytenr=%llu len=%llu %pV", in check_extent_item()
1503 eb->start, slot, bytenr, len, &vaf); in check_extent_item()
1543 /* key->objectid is the bytenr for both key types */ in check_extent_item()
1700 /* Contains parent bytenr */ in check_extent_item()
1705 "invalid tree parent bytenr, have %llu expect aligned to %u", in check_extent_item()
1751 /* Contains parent bytenr and ref count */ in check_extent_item()
1757 "invalid data parent bytenr, hav in check_extent_item()
1440 u64 bytenr; extent_err() local
2601 u64 bytenr; __btrfs_check_node() local
[all...]
H A Dfree-space-cache.c2691 u64 bytenr, u64 size, bool used) in __btrfs_add_free_space_zoned() argument
2695 u64 offset = bytenr - block_group->start; in __btrfs_add_free_space_zoned()
2752 u64 bytenr, u64 size) in btrfs_add_free_space() argument
2760 return __btrfs_add_free_space_zoned(block_group, bytenr, size, in btrfs_add_free_space()
2766 return __btrfs_add_free_space(block_group, bytenr, size, trim_state); in btrfs_add_free_space()
2770 u64 bytenr, u64 size) in btrfs_add_free_space_unused() argument
2773 return __btrfs_add_free_space_zoned(block_group, bytenr, size, in btrfs_add_free_space_unused()
2776 return btrfs_add_free_space(block_group, bytenr, size); in btrfs_add_free_space_unused()
2785 u64 bytenr, u64 size) in btrfs_add_free_space_async_trimmed() argument
2790 return __btrfs_add_free_space_zoned(block_group, bytenr, size, in btrfs_add_free_space_async_trimmed()
[all …]
H A Dextent_io.h317 u64 bytenr, u64 owner_root, u64 gen, int level,
H A Dscrub.c640 ctx.bytenr = found_key.objectid; in scrub_print_common_warning()
2948 u64 bytenr; in scrub_supers() local
2972 ret = btrfs_sb_log_location(scrub_dev, i, 0, &bytenr); in scrub_supers()
2983 if (bytenr + BTRFS_SUPER_INFO_SIZE > in scrub_supers()
2986 if (!btrfs_check_super_location(scrub_dev, bytenr)) in scrub_supers()
2989 ret = scrub_one_super(sctx, scrub_dev, page, bytenr, gen); in scrub_supers()
H A Dextent_io.c379 * @start: The original start bytenr to search.
380 * Will store the extent range start bytenr.
381 * @end: The original end bytenr of the search range
382 * Will store the extent range end bytenr.
734 * For compression, all IO should have its logical bytenr set in btrfs_bio_is_contig()
735 * to the starting bytenr of the compressed extent. in btrfs_bio_is_contig()
800 * @disk_bytenr: logical bytenr where the read/write will be
3575 * to insert two ebs for the same bytenr. So here we always return NULL in grab_extent_buffer()
4406 "access to eb bytenr %llu len %u out of range start %lu len %lu", in read_extent_buffer_pages()
4770 static u8 *extent_buffer_get_byte(const struct extent_buffer *eb, unsigned long bytenr) in extent_buffer_test_bit()
4779 extent_buffer_get_byte(const struct extent_buffer * eb,unsigned long bytenr) extent_buffer_get_byte() argument
5071 btrfs_readahead_tree_block(struct btrfs_fs_info * fs_info,u64 bytenr,u64 owner_root,u64 gen,int level,const struct btrfs_key * first_key) btrfs_readahead_tree_block() argument
[all...]
H A Dtransaction.c2031 super->chunk_root = root_item->bytenr; in btrfs_commit_transaction_async()
2036 super->root = root_item->bytenr; in btrfs_commit_transaction_async()
2048 super->remap_root = root_item->bytenr;
H A Dvolumes.c1367 u64 bytenr, bytenr_orig; in btrfs_read_disk_super()
1372 ret = btrfs_sb_log_location_bdev(bdev, copy_num, READ, &bytenr); in btrfs_read_disk_super()
1379 if (bytenr + BTRFS_SUPER_INFO_SIZE >= bdev_nr_bytes(bdev)) in btrfs_read_disk_super()
1390 invalidate_inode_pages2_range(mapping, bytenr >> PAGE_SHIFT, in btrfs_read_disk_super()
1391 (bytenr + BTRFS_SUPER_INFO_SIZE) >> PAGE_SHIFT); in btrfs_read_disk_super()
1395 folio = mapping_read_folio_gfp(mapping, bytenr >> PAGE_SHIFT, GFP_NOFS); in btrfs_read_disk_super()
1400 super = folio_address(folio) + offset_in_folio(folio, bytenr); in btrfs_read_disk_super()
2280 const u64 bytenr = btrfs_sb_offset(copy_num); in btrfs_scratch_superblock()
2291 ret = sync_blockdev_range(bdev, bytenr, bytenr in btrfs_scratch_superblock()
1371 u64 bytenr, bytenr_orig; btrfs_read_disk_super() local
2284 const u64 bytenr = btrfs_sb_offset(copy_num); btrfs_scratch_superblock() local
[all...]
H A Dsend.c1265 /* The bytenr the file extent item we are processing refers to. */
1266 u64 bytenr; member
1482 static int check_extent_item(u64 bytenr, const struct btrfs_extent_item *ei, in check_extent_item() argument
1489 if (bytenr == bctx->bytenr) { in check_extent_item()
1594 backref_ctx.bytenr = disk_byte; in find_extent_clone()
1615 backref_walk_ctx.bytenr = disk_byte; in find_extent_clone()
/linux/fs/btrfs/tests/
H A Ddelayed-refs-tests.c16 u64 bytenr; member
24 u64 bytenr; member
73 if (head->bytenr != check->bytenr) { in validate_ref_head()
74 test_err("invalid bytenr have: %llu want: %llu", head->bytenr, in validate_ref_head()
75 check->bytenr); in validate_ref_head()
109 if (node->bytenr != check->bytenr) { in validate_ref_node()
110 test_err("invalid bytenr have: %llu want: %llu", node->bytenr, in validate_ref_node()
111 check->bytenr); in validate_ref_node()
180 .bytenr = node_check->bytenr, in simple_test()
240 .bytenr = FAKE_BYTENR, in simple_tests()
[all …]
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()
66 static int add_tree_ref(struct btrfs_root *root, u64 bytenr, u64 num_bytes, in add_tree_ref() argument
78 key.objectid = bytenr; in add_tree_ref()
100 key.objectid = bytenr; in add_tree_ref()
115 static int remove_extent_item(struct btrfs_root *root, u64 bytenr, in remove_extent_item() argument
125 key.objectid = bytenr; in remove_extent_item()
144 static int remove_extent_ref(struct btrfs_root *root, u64 bytenr, in remove_extent_ref() argument
156 key.objectid = bytenr; in remove_extent_ref()
178 key.objectid = bytenr; in remove_extent_ref()
[all …]
/linux/include/trace/events/
H A Dbtrfs.h1742 __field( u64, bytenr )
1753 __entry->bytenr = ref->bytenr;
1766 __entry->bytenr,
1799 __field( u64, bytenr )
1811 __entry->bytenr = ref->bytenr;
1825 __entry->bytenr,
1861 __field( u64, bytenr )
1868 __entry->bytenr = head_ref->bytenr;
1875 __entry->bytenr,
2612 u64 bytenr),
[all …]
/linux/drivers/hwmon/
H A Dw83791d.c452 int bytenr = bitnr / 8; in store_beep() local
464 data->beep_mask &= ~(0xff << (bytenr * 8)); in store_beep()
465 data->beep_mask |= w83791d_read(client, W83791D_REG_BEEP_CTRL[bytenr]) in store_beep()
466 << (bytenr * 8); in store_beep()
471 w83791d_write(client, W83791D_REG_BEEP_CTRL[bytenr], in store_beep()
472 (data->beep_mask >> (bytenr * 8)) & 0xff); in store_beep()

12