| /linux/fs/bcachefs/ |
| A D | btree_iter.h | 274 struct btree_iter *, struct bpos);
403 bool bch2_btree_iter_rewind(struct btree_iter *);
482 struct btree_iter *iter, in bch2_trans_iter_init_common()
510 struct btree_iter *iter, in bch2_trans_iter_init()
526 void bch2_trans_copy_iter(struct btree_iter *, struct btree_iter *);
568 struct btree_iter *iter, in __bch2_bkey_get_iter()
585 struct btree_iter *iter, in bch2_bkey_get_iter()
610 struct btree_iter iter; in __bch2_bkey_get_val_typed()
641 struct btree_iter _iter; \
778 struct btree_iter _iter; \
[all …]
|
| A D | btree_update.h | 50 int bch2_btree_delete_extent_at(struct btree_trans *, struct btree_iter *,
52 int bch2_btree_delete_at(struct btree_trans *, struct btree_iter *, unsigned);
100 int bch2_trans_update_extent_overwrite(struct btree_trans *, struct btree_iter *,
104 int bch2_bkey_get_empty_slot(struct btree_trans *, struct btree_iter *,
107 int __must_check bch2_trans_update(struct btree_trans *, struct btree_iter *,
275 struct btree_iter *iter, in __bch2_bkey_get_mut_noupdate()
290 struct btree_iter *iter, in bch2_bkey_get_mut_noupdate()
298 struct btree_iter *iter, in __bch2_bkey_get_mut()
319 struct btree_iter *iter, in bch2_bkey_get_mut_minsize()
327 struct btree_iter *iter, in bch2_bkey_get_mut()
[all …]
|
| A D | str_hash.h | 153 struct btree_iter *iter, in bch2_hash_lookup_in_snapshot()
184 struct btree_iter *iter, in bch2_hash_lookup()
200 struct btree_iter *iter, in bch2_hash_hole()
228 struct btree_iter *start) in bch2_hash_needs_whiteout()
230 struct btree_iter iter; in bch2_hash_needs_whiteout()
256 struct btree_iter *iter, in bch2_hash_set_or_get_in_snapshot()
263 struct btree_iter slot = {}; in bch2_hash_set_or_get_in_snapshot()
322 struct btree_iter iter; in bch2_hash_set_in_snapshot()
356 struct btree_iter *iter, in bch2_hash_delete_at()
384 struct btree_iter iter; in bch2_hash_delete()
|
| A D | fs-common.c | 31 struct btree_iter dir_iter = { NULL }; in bch2_create_trans()
32 struct btree_iter inode_iter = { NULL }; in bch2_create_trans()
192 struct btree_iter dir_iter = { NULL }; in bch2_link_trans()
193 struct btree_iter inode_iter = { NULL }; in bch2_link_trans()
250 struct btree_iter dir_iter = { NULL }; in bch2_unlink_trans()
251 struct btree_iter dirent_iter = { NULL }; in bch2_unlink_trans()
252 struct btree_iter inode_iter = { NULL }; in bch2_unlink_trans()
363 struct btree_iter iter; in subvol_update_parent()
387 struct btree_iter src_dir_iter = { NULL }; in bch2_rename_trans()
388 struct btree_iter dst_dir_iter = { NULL }; in bch2_rename_trans()
[all …]
|
| A D | inode.h | 111 int __bch2_inode_peek(struct btree_trans *, struct btree_iter *,
115 struct btree_iter *iter, in bch2_inode_peek_nowarn()
123 struct btree_iter *iter, in bch2_inode_peek()
132 int bch2_inode_write_flags(struct btree_trans *, struct btree_iter *,
136 struct btree_iter *iter, in bch2_inode_write()
154 int bch2_inode_create(struct btree_trans *, struct btree_iter *,
|
| A D | btree_update.c | 32 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()
472 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()
700 struct btree_iter iter; in bch2_btree_delete()
719 struct btree_iter iter; in bch2_btree_delete_range_trans()
[all …]
|
| A D | extent_update.c | 70 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()
|
| A D | extent_update.h | 7 int bch2_extent_atomic_end(struct btree_trans *, struct btree_iter *,
9 int bch2_extent_trim_atomic(struct btree_trans *, struct btree_iter *,
|
| A D | fsck.c | 120 struct btree_iter iter; in lookup_first_inode()
143 struct btree_iter iter; in lookup_inode()
166 struct btree_iter iter; in lookup_dirent_in_snapshot()
183 struct btree_iter iter; in __remove_dirent()
234 struct btree_iter iter; in lookup_lostfound()
340 struct btree_iter iter; in maybe_delete_dirent()
437 struct btree_iter iter; in reattach_inode()
492 struct btree_iter iter; in remove_backpointer()
575 struct btree_iter iter; in reconstruct_subvol()
812 struct btree_iter iter; in get_inodes_all_snapshots()
[all …]
|
| A D | subvolume.c | 28 struct btree_iter *iter, in check_subvol()
33 struct btree_iter subvol_children_iter = {}; in check_subvol()
173 struct btree_iter *child_iter, in check_subvol_child()
275 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()
414 struct btree_iter iter; in __bch2_subvolume_delete()
506 struct btree_iter iter; in bch2_subvolume_unlink()
543 struct btree_iter dst_iter, src_iter = (struct btree_iter) { NULL }; in bch2_subvolume_create()
647 struct btree_iter iter; in __bch2_fs_upgrade_for_subvolumes()
|
| A D | io_misc.h | 5 int bch2_extent_fallocate(struct btree_trans *, subvol_inum, struct btree_iter *,
8 int bch2_fpunch_at(struct btree_trans *, struct btree_iter *,
|
| A D | data_update.h | 41 struct btree_iter *,
47 int bch2_data_update_init(struct btree_trans *, struct btree_iter *,
|
| A D | rebalance.c | 38 struct btree_iter iter; in __bch2_set_rebalance_needs_scan()
88 struct btree_iter iter; in bch2_clear_rebalance_needs_scan()
113 struct btree_iter *work_iter) in next_rebalance_entry()
121 struct btree_iter *iter, in bch2_bkey_clear_needs_rebalance()
136 struct btree_iter *extent_iter, in next_rebalance_extent()
198 struct btree_iter *extent_iter) in do_rebalance_extent()
327 struct btree_iter rebalance_work_iter, extent_iter = { NULL }; in do_rebalance()
|
| A D | btree_iter.c | 247 static void bch2_btree_iter_verify(struct btree_iter *iter) in bch2_btree_iter_verify()
280 struct btree_iter copy; in bch2_btree_iter_verify_ret()
1862 __bch2_btree_iter_traverse(struct btree_iter *iter) in __bch2_btree_iter_traverse()
1868 bch2_btree_iter_traverse(struct btree_iter *iter) in bch2_btree_iter_traverse()
2099 struct btree_iter *iter, in bch2_btree_journal_peek()
2113 struct btree_iter *iter) in btree_trans_peek_slot_journal()
2128 struct btree_iter *iter, in btree_trans_peek_journal()
2671 struct btree_iter iter2; in bch2_btree_iter_peek_slot()
2900 struct btree_iter *iter, in bch2_trans_iter_init_outlined()
2910 struct btree_iter *iter, in bch2_trans_node_iter_init()
[all …]
|
| A D | snapshot.c | 61 struct btree_iter iter; in __bch2_snapshot_tree_create()
490 struct btree_iter iter; in bch2_snapshot_tree_master_subvol()
909 struct btree_iter iter; in check_snapshot_exists()
1079 struct btree_iter *iter, in bch2_check_key_has_snapshot()
1102 struct btree_iter iter; in bch2_snapshot_node_set_deleted()
1137 struct btree_iter iter, p_iter = (struct btree_iter) { NULL }; in bch2_snapshot_node_delete()
1138 struct btree_iter c_iter = (struct btree_iter) { NULL }; in bch2_snapshot_node_delete()
1139 struct btree_iter tree_iter = (struct btree_iter) { NULL }; in bch2_snapshot_node_delete()
1247 struct btree_iter iter; in create_snapids()
1315 struct btree_iter iter; in bch2_snapshot_node_create_children()
[all …]
|
| A D | io_misc.c | 25 struct btree_iter *iter, in bch2_extent_fallocate()
138 int bch2_fpunch_at(struct btree_trans *trans, struct btree_iter *iter, in bch2_fpunch_at()
196 struct btree_iter iter; in bch2_fpunch()
230 struct btree_iter iter = { NULL }; in truncate_set_isize()
247 struct btree_iter fpunch_iter; in __bch2_resume_logged_op_truncate()
321 struct btree_iter iter; in adjust_i_size()
358 struct btree_iter iter; in __bch2_resume_logged_op_finsert()
|
| A D | alloc_background.c | 486 struct btree_iter iter; in bch2_trans_start_alloc_update()
674 struct btree_iter iter; in bch2_bucket_do_index()
741 struct btree_iter iter; in bch2_bucket_gen_update()
1033 struct btree_iter iter2; in bch2_get_key_or_hole()
1124 struct btree_iter *alloc_iter, in bch2_check_alloc_key()
1375 struct btree_iter alloc_iter; in bch2_check_discard_freespace_key()
1928 struct btree_iter iter; in bch2_clear_bucket_needs_discard()
2018 struct btree_iter *lru_iter, in invalidate_one_bucket()
2127 struct btree_iter iter; in bch2_do_invalidates_work()
2189 struct btree_iter iter; in bch2_dev_freespace_init()
[all …]
|
| A D | inode.c | 336 struct btree_iter *iter, in __bch2_inode_peek()
370 struct btree_iter *iter, in bch2_inode_write_flags()
651 struct btree_iter iter; in __bch2_inode_has_child_snapshots()
688 struct btree_iter iter; in update_parent_inode_has_children()
865 struct btree_iter *iter, in bch2_inode_create()
946 struct btree_iter iter; in bch2_inode_delete_keys()
1069 struct btree_iter iter; in bch2_inode_find_by_inum_nowarn_trans()
1082 struct btree_iter iter; in bch2_inode_find_by_inum_trans()
1234 struct btree_iter iter; in delete_ancestor_snapshot_inodes()
1267 struct btree_iter *iter, in may_delete_deleted_inode()
[all …]
|
| A D | subvolume.h | 37 bch2_btree_iter_peek_in_subvolume_upto_type(struct btree_iter *iter, struct bpos end, in bch2_btree_iter_peek_in_subvolume_upto_type()
73 struct btree_iter _iter; \
|
| A D | backpointers.c | 176 struct btree_iter bp_iter; in bch2_bucket_backpointer_mod_nowritebuffer()
230 struct btree_iter alloc_iter = { NULL }, bp_iter = { NULL }; in bch2_get_next_backpointer()
310 struct btree_iter *iter, in bch2_backpointer_get_key()
351 struct btree_iter *iter, in bch2_backpointer_get_node()
395 struct btree_iter alloc_iter = { NULL }; in bch2_check_btree_backpointer()
532 struct btree_iter bp_iter = {}; in check_bp_exists()
533 struct btree_iter other_extent_iter = {}; in check_bp_exists()
702 struct btree_iter iter; in check_btree_root_to_backpointers()
835 struct btree_iter *iter, in progress_update_iter()
880 struct btree_iter iter; in bch2_check_extents_to_backpointers_pass()
[all …]
|
| A D | lru.c | 87 struct btree_iter lru_iter; in bch2_lru_check_set()
120 struct btree_iter *lru_iter, in bch2_check_lru_key()
125 struct btree_iter iter; in bch2_check_lru_key()
|
| A D | tests.c | 35 struct btree_iter iter; in test_delete()
76 struct btree_iter iter; in test_delete_written()
346 struct btree_iter iter; in test_peek_end()
366 struct btree_iter iter; in test_peek_end_extents()
477 struct btree_iter iter; in test_snapshot_filter()
596 struct btree_iter iter; in rand_lookup()
619 struct btree_iter *iter, in rand_mixed_trans()
646 struct btree_iter iter; in rand_mixed()
669 struct btree_iter iter; in __do_delete()
|
| A D | io_write.h | 59 int bch2_sum_sector_overwrites(struct btree_trans *, struct btree_iter *,
62 struct btree_iter *, struct bkey_i *,
|
| /linux/drivers/md/bcache/ |
| A D | bset.h | 151 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,
|
| A D | bset.c | 57 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()
1125 struct btree_iter *iter, in __bch_btree_iter_init()
1147 struct btree_iter *iter, in bch_btree_iter_init()
1187 struct bkey *bch_btree_iter_next(struct btree_iter *iter) in bch_btree_iter_next()
1224 struct btree_iter *iter, in btree_mergesort()
1327 struct btree_iter iter; in bch_btree_sort_partial()
1348 struct btree_iter *iter, in bch_btree_sort_and_fix_extents()
[all …]
|