Searched refs:bch2_btree_iter_traverse (Results 1 – 14 of 14) sorted by relevance
| /linux-6.15/fs/bcachefs/ |
| H A D | tests.c | 46 bch2_btree_iter_traverse(trans, &iter) ?: in test_delete() 54 bch2_btree_iter_traverse(trans, &iter) ?: in test_delete() 62 bch2_btree_iter_traverse(trans, &iter) ?: in test_delete() 87 bch2_btree_iter_traverse(trans, &iter) ?: in test_delete_written() 97 bch2_btree_iter_traverse(trans, &iter) ?: in test_delete_written()
|
| H A D | extent_update.c | 115 ret = bch2_btree_iter_traverse(trans, iter); in bch2_extent_atomic_end()
|
| H A D | btree_update.c | 637 ret = bch2_btree_iter_traverse(trans, &iter) ?: in bch2_btree_insert_nonextent() 649 int ret = bch2_btree_iter_traverse(trans, &iter) ?: in bch2_btree_insert_trans() 698 ret = bch2_btree_iter_traverse(trans, &iter) ?: in bch2_btree_delete() 811 int ret = bch2_btree_iter_traverse(trans, &iter) ?: in bch2_btree_bit_mod()
|
| H A D | namei.c | 127 ret = bch2_btree_iter_traverse(trans, &dir_iter); in bch2_create_trans() 177 ret = bch2_btree_iter_traverse(trans, &inode_iter) ?: in bch2_create_trans() 308 ret = bch2_btree_iter_traverse(trans, &dirent_iter); in bch2_unlink_trans()
|
| H A D | dirent.c | 575 ret = bch2_btree_iter_traverse(trans, &src_iter) ?: in bch2_dirent_rename() 583 ret = bch2_btree_iter_traverse(trans, &dst_iter) ?: in bch2_dirent_rename() 759 ret = bch2_btree_iter_traverse(trans, &iter) ?: in bch2_fsck_remove_dirent()
|
| H A D | btree_write_buffer.c | 147 ret = bch2_btree_iter_traverse(trans, iter); in wb_flush_one() 211 ret = bch2_btree_iter_traverse(trans, &iter) ?: in btree_write_buffered_insert() 371 bch2_btree_iter_traverse(trans, &iter) ?: in bch2_btree_write_buffer_flush_locked()
|
| H A D | recovery.c | 202 int ret = bch2_btree_iter_traverse(trans, &iter); in bch2_journal_replay_accounting_key() 265 ret = bch2_btree_iter_traverse(trans, &iter); in bch2_journal_replay_key() 274 ret = bch2_btree_iter_traverse(trans, &iter) ?: in bch2_journal_replay_key()
|
| H A D | fsck.c | 299 ret = bch2_btree_iter_traverse(trans, &lostfound_iter); in lookup_lostfound() 574 bch2_btree_iter_traverse(trans, &inode_iter) ?: in reconstruct_subvol() 1840 ret = bch2_btree_iter_traverse(trans, &iter2) ?: in check_extent() 2267 ret = bch2_btree_iter_traverse(trans, &delete_iter) ?: in check_dirent()
|
| H A D | btree_key_cache.c | 430 ret = bch2_btree_iter_traverse(trans, &c_iter); in btree_key_cache_flush_pos()
|
| H A D | reflink.c | 662 ret = bch2_btree_iter_traverse(trans, &dst_iter); in bch2_remap_range()
|
| H A D | btree_iter.h | 397 int __must_check bch2_btree_iter_traverse(struct btree_trans *, struct btree_iter *);
|
| H A D | buckets.c | 375 ret = bch2_btree_iter_traverse(trans, &iter) ?: in bch2_check_fix_ptrs()
|
| H A D | btree_update_interior.c | 2165 int ret = bch2_btree_iter_traverse(trans, iter); in get_iter_to_node() 2462 ret = bch2_btree_iter_traverse(trans, &iter2) ?: in __bch2_btree_node_update_key()
|
| H A D | btree_iter.c | 1877 bch2_btree_iter_traverse(struct btree_trans *trans, struct btree_iter *iter) in bch2_btree_iter_traverse() function
|