Home
last modified time | relevance | path

Searched refs:btree_iter (Results 1 – 25 of 72) sorted by relevance

123

/linux-6.15/fs/bcachefs/
H A Dbtree_iter.h499 struct btree_iter *iter, in bch2_trans_iter_init_common()
526 struct btree_iter *iter, in bch2_trans_iter_init()
542 void bch2_trans_copy_iter(struct btree_trans *, struct btree_iter *, struct btree_iter *);
584 struct btree_iter *iter, in __bch2_bkey_get_iter()
601 struct btree_iter *iter, in bch2_bkey_get_iter()
631 struct btree_iter iter; in __bch2_bkey_get_val_typed()
655 struct btree_iter _iter; \
689 struct btree_iter *iter, in bch2_btree_iter_peek_type()
795 struct btree_iter _iter; \
810 struct btree_iter _iter; \
[all …]
H A Dbtree_update.h49 int bch2_btree_delete_at(struct btree_trans *, struct btree_iter *, unsigned);
66 int bch2_btree_bit_mod_iter(struct btree_trans *, struct btree_iter *, bool);
98 int bch2_trans_update_extent_overwrite(struct btree_trans *, struct btree_iter *,
102 int bch2_bkey_get_empty_slot(struct btree_trans *, struct btree_iter *,
105 int __must_check bch2_trans_update(struct btree_trans *, struct btree_iter *,
277 struct btree_iter *iter, struct bkey_s_c *k, in bch2_bkey_make_mut()
288 struct btree_iter *iter, in __bch2_bkey_get_mut_noupdate()
304 struct btree_iter *iter, in bch2_bkey_get_mut_noupdate()
312 struct btree_iter *iter, in __bch2_bkey_get_mut()
334 struct btree_iter *iter, in bch2_bkey_get_mut_minsize()
[all …]
H A Dstr_hash.h152 struct btree_iter *iter, in bch2_hash_lookup_in_snapshot()
183 struct btree_iter *iter, in bch2_hash_lookup()
199 struct btree_iter *iter, in bch2_hash_hole()
227 struct btree_iter *start) in bch2_hash_needs_whiteout()
229 struct btree_iter iter; in bch2_hash_needs_whiteout()
255 struct btree_iter *iter, in bch2_hash_set_or_get_in_snapshot()
262 struct btree_iter slot = {}; in bch2_hash_set_or_get_in_snapshot()
321 struct btree_iter iter; in bch2_hash_set_in_snapshot()
355 struct btree_iter *iter, in bch2_hash_delete_at()
383 struct btree_iter iter; in bch2_hash_delete()
[all …]
H A Dnamei.c31 struct btree_iter dir_iter = {}; in bch2_create_trans()
32 struct btree_iter inode_iter = {}; in bch2_create_trans()
191 struct btree_iter dir_iter = {}; in bch2_link_trans()
192 struct btree_iter inode_iter = {}; in bch2_link_trans()
250 struct btree_iter dir_iter = {}; in bch2_unlink_trans()
251 struct btree_iter dirent_iter = {}; in bch2_unlink_trans()
252 struct btree_iter inode_iter = {}; in bch2_unlink_trans()
366 struct btree_iter iter; in subvol_update_parent()
390 struct btree_iter src_dir_iter = {}; in bch2_rename_trans()
622 struct btree_iter d_iter; in bch2_inum_to_path()
[all …]
H A Dinode.h120 int __bch2_inode_peek(struct btree_trans *, struct btree_iter *,
124 struct btree_iter *iter, in bch2_inode_peek_nowarn()
132 struct btree_iter *iter, in bch2_inode_peek()
141 int bch2_inode_write_flags(struct btree_trans *, struct btree_iter *,
145 struct btree_iter *iter, in bch2_inode_write()
163 int bch2_inode_create(struct btree_trans *, struct btree_iter *,
H A Dextent_update.c70 struct btree_iter iter; in count_iters_for_insert()
106 struct btree_iter *iter, in bch2_extent_atomic_end()
110 struct btree_iter copy; in bch2_extent_atomic_end()
161 struct btree_iter *iter, in bch2_extent_trim_atomic()
H A Dextent_update.h7 int bch2_extent_atomic_end(struct btree_trans *, struct btree_iter *,
9 int bch2_extent_trim_atomic(struct btree_trans *, struct btree_iter *,
H A Dbtree_update.c32 struct btree_iter *iter, in extent_front_merge()
68 struct btree_iter *iter, in extent_back_merge()
96 struct btree_iter iter; in need_whiteout_for_snapshot()
187 struct btree_iter *iter, in bch2_trans_update_extent_overwrite()
290 struct btree_iter iter; in bch2_trans_update_extent()
473 struct btree_iter *iter, in bch2_trans_update_get_key_cache()
630 struct btree_iter iter; in bch2_btree_insert_nonextent()
646 struct btree_iter iter; in bch2_btree_insert_trans()
692 struct btree_iter iter; in bch2_btree_delete()
711 struct btree_iter iter; in bch2_btree_delete_range_trans()
[all …]
H A Dio_misc.h5 int bch2_extent_fallocate(struct btree_trans *, subvol_inum, struct btree_iter *,
8 int bch2_fpunch_at(struct btree_trans *, struct btree_iter *,
H A Dfsck.c115 struct btree_iter iter; in lookup_inode()
138 struct btree_iter iter; in lookup_dirent_in_snapshot()
159 struct btree_iter iter; in find_snapshot_tree_subvol()
215 struct btree_iter iter; in lookup_lostfound()
355 struct btree_iter iter; in maybe_delete_dirent()
453 struct btree_iter iter; in reattach_inode()
517 struct btree_iter iter; in remove_backpointer()
598 struct btree_iter iter; in reconstruct_subvol()
837 struct btree_iter iter; in get_inodes_all_snapshots()
933 struct btree_iter iter; in get_visible_inodes()
[all …]
H A Ddata_update.h61 struct btree_iter *,
70 int bch2_data_update_init(struct btree_trans *, struct btree_iter *,
H A Dnamei.h48 struct btree_iter *,
60 struct btree_iter *dirent_iter, in bch2_check_dirent_target()
H A Dalloc_background.c480 struct btree_iter iter; in bch2_trans_start_alloc_update()
723 struct btree_iter iter; in bch2_bucket_do_index()
743 struct btree_iter iter; in bch2_bucket_gen_update()
1053 struct btree_iter iter2; in bch2_get_key_or_hole()
1112 struct btree_iter *iter, in bch2_get_key_or_real_bucket_hole()
1364 struct btree_iter iter; in bch2_recheck_discard_freespace_key()
1401 struct btree_iter alloc_iter; in bch2_check_discard_freespace_key()
1831 struct btree_iter iter = {}; in bch2_discard_one_bucket()
2234 struct btree_iter iter; in bch2_do_invalidates_work()
2297 struct btree_iter iter; in bch2_dev_freespace_init()
[all …]
H A Dstr_hash.c21 struct btree_iter iter; in bch2_dirent_has_target()
107 struct btree_iter iter; in repair_inode_hash_info()
149 struct btree_iter iter; in check_inode_hash_info_matches_root()
195 struct btree_iter *k_iter, struct bkey_s_c hash_k) in __bch2_str_hash_check_key()
198 struct btree_iter iter = {}; in __bch2_str_hash_check_key()
H A Dsubvolume.c29 struct btree_iter *iter, in check_subvol()
34 struct btree_iter subvol_children_iter = {}; in check_subvol()
174 struct btree_iter *child_iter, in check_subvol_child()
276 struct btree_iter iter; in bch2_subvol_has_children()
337 struct btree_iter iter; in __bch2_subvolume_get_snapshot()
363 struct btree_iter *iter, in bch2_subvolume_reparent()
413 struct btree_iter subvol_iter = {}, snapshot_iter = {}, snapshot_tree_iter = {}; in __bch2_subvolume_delete()
540 struct btree_iter iter; in bch2_subvolume_unlink()
578 struct btree_iter dst_iter, src_iter = {}; in bch2_subvolume_create()
682 struct btree_iter iter; in __bch2_fs_upgrade_for_subvolumes()
H A Dbtree_iter.c280 struct btree_iter copy; in bch2_btree_iter_verify_ret()
367 struct btree_iter *iter) {} in bch2_btree_iter_verify()
1899 struct btree_iter *iter) in bch2_btree_iter_peek_node()
1937 struct btree_iter *iter) in bch2_btree_iter_peek_node_and_restart()
2111 struct btree_iter *iter, in bch2_btree_journal_peek()
2140 struct btree_iter *iter, in btree_trans_peek_journal()
2168 struct btree_iter *iter, in btree_trans_peek_prev_journal()
2822 struct btree_iter iter2; in bch2_btree_iter_peek_slot()
3048 struct btree_iter *iter, in bch2_trans_iter_init_outlined()
3058 struct btree_iter *iter, in bch2_trans_node_iter_init()
[all …]
H A Drebalance.c180 struct btree_iter *iter, in bch2_get_update_rebalance_opts()
227 struct btree_iter iter; in bch2_set_rebalance_needs_scan_trans()
276 struct btree_iter iter; in bch2_clear_rebalance_needs_scan()
301 struct btree_iter *work_iter) in next_rebalance_entry()
309 struct btree_iter *iter, in bch2_bkey_clear_needs_rebalance()
327 struct btree_iter *extent_iter, in next_rebalance_extent()
401 struct btree_iter *extent_iter) in do_rebalance_extent()
514 struct btree_iter rebalance_work_iter, extent_iter = {}; in do_rebalance()
H A Dinode.c338 struct btree_iter *iter, in __bch2_inode_peek()
372 struct btree_iter *iter, in bch2_inode_write_flags()
653 struct btree_iter iter; in __bch2_inode_has_child_snapshots()
690 struct btree_iter iter; in update_parent_inode_has_children()
880 struct btree_iter iter; in bch2_inode_alloc_cursor_get()
992 struct btree_iter iter; in bch2_inode_delete_keys()
1046 struct btree_iter iter = {}; in bch2_inode_rm()
1107 struct btree_iter iter; in bch2_inode_find_by_inum_nowarn_trans()
1120 struct btree_iter iter; in bch2_inode_find_by_inum_trans()
1246 struct btree_iter iter = {}; in __bch2_inode_rm_snapshot()
[all …]
H A Dio_misc.c25 struct btree_iter *iter, in bch2_extent_fallocate()
141 int bch2_fpunch_at(struct btree_trans *trans, struct btree_iter *iter, in bch2_fpunch_at()
199 struct btree_iter iter; in bch2_fpunch()
233 struct btree_iter iter = {}; in truncate_set_isize()
250 struct btree_iter fpunch_iter; in __bch2_resume_logged_op_truncate()
324 struct btree_iter iter; in adjust_i_size()
361 struct btree_iter iter; in __bch2_resume_logged_op_finsert()
H A Dsnapshot.c62 struct btree_iter iter; in __bch2_snapshot_tree_create()
416 struct btree_iter iter; in bch2_snapshot_tree_master_subvol()
633 struct btree_iter root_iter; in snapshot_tree_ptr_repair()
682 struct btree_iter *iter, in check_snapshot()
847 struct btree_iter iter; in check_snapshot_exists()
1016 struct btree_iter *iter, in bch2_check_key_has_snapshot()
1041 struct btree_iter iter; in bch2_snapshot_node_set_deleted()
1184 struct btree_iter iter; in create_snapids()
1248 struct btree_iter iter; in bch2_snapshot_node_create_children()
1408 struct btree_iter dst_iter; in delete_dead_snapshots_process_key()
[all …]
H A Dsubvolume.h36 bch2_btree_iter_peek_in_subvolume_max_type(struct btree_trans *trans, struct btree_iter *iter, in bch2_btree_iter_peek_in_subvolume_max_type()
72 struct btree_iter _iter; \
H A Dbackpointers.c145 struct btree_iter bp_iter; in bch2_bucket_backpointer_mod_nowritebuffer()
261 struct btree_iter *iter, in __bch2_backpointer_get_node()
355 struct btree_iter *iter, in bch2_backpointer_get_node()
363 struct btree_iter *iter, in bch2_backpointer_get_key()
536 struct btree_iter bp_iter; in check_bp_exists()
699 struct btree_iter iter; in check_btree_root_to_backpointers()
812 struct btree_iter iter; in bch2_check_extents_to_backpointers_pass()
876 struct btree_iter iter; in check_bucket_backpointer_mismatch()
988 struct btree_iter iter; in btree_node_get_and_pin()
1016 struct btree_iter iter; in bch2_pin_backpointer_nodes_with_missing()
[all …]
H A Dio_write.h55 int bch2_sum_sector_overwrites(struct btree_trans *, struct btree_iter *,
58 struct btree_iter *, struct bkey_i *,
/linux-6.15/drivers/md/bcache/
H A Dbset.h151 struct btree_iter;
193 struct bkey *(*sort_fixup)(struct btree_iter *iter,
197 struct btree_iter *iter,
322 struct btree_iter { struct
331 struct bkey *bch_btree_iter_next(struct btree_iter *iter); argument
332 struct bkey *bch_btree_iter_next_filter(struct btree_iter *iter,
336 void bch_btree_iter_push(struct btree_iter *iter, struct bkey *k,
339 struct btree_iter *iter,
381 struct btree_iter *iter,
H A Dbset.c57 struct btree_iter iter; in __bch_count_data()
72 struct btree_iter iter; in __bch_check_keys()
115 static void bch_btree_iter_next_check(struct btree_iter *iter) in bch_btree_iter_next_check()
886 struct btree_iter iter; in bch_btree_insert_key()
1117 struct btree_iter *iter, in __bch_btree_iter_init()
1139 struct btree_iter *iter, in bch_btree_iter_init()
1179 struct bkey *bch_btree_iter_next(struct btree_iter *iter) in bch_btree_iter_next()
1216 struct btree_iter *iter, in btree_mergesort()
1319 struct btree_iter iter; in bch_btree_sort_partial()
1340 struct btree_iter *iter, in bch_btree_sort_and_fix_extents()
[all …]

123