Home
last modified time | relevance | path

Searched refs:btree_iter_path (Results 1 – 11 of 11) sorted by relevance

/linux/fs/bcachefs/ !
H A Dbtree_write_buffer.c120 struct btree_path *path = btree_iter_path(trans, iter); in wb_flush_one_slowpath()
154 struct bkey_s_c k = bch2_btree_path_peek_slot_exact(btree_iter_path(trans, iter), &u); in wb_flush_one()
166 if (btree_iter_path(trans, iter)->ref > 1) in wb_flush_one()
169 path = btree_iter_path(trans, iter); in wb_flush_one()
365 struct btree_path *path = btree_iter_path(trans, &iter); in bch2_btree_write_buffer_flush_locked()
391 btree_iter_path(trans, &iter)->preserve = false; in bch2_btree_write_buffer_flush_locked()
416 struct btree_path *path = btree_iter_path(trans, &iter); in bch2_btree_write_buffer_flush_locked()
H A Dprogress.c43 struct btree *b = path_l(btree_iter_path(trans, iter))->b; in bch2_progress_update_iter()
H A Dbtree_key_cache.c344 ret = btree_key_cache_create(trans, btree_iter_path(trans, &iter), ck_path, k); in btree_key_cache_fill()
443 ck = (void *) btree_iter_path(trans, &c_iter)->l[0].b; in btree_key_cache_flush_pos()
498 struct btree_path *path = btree_iter_path(trans, &c_iter); in btree_key_cache_flush_pos()
H A Dbtree_update_interior.c2216 if (btree_iter_path(trans, iter)->l[b->c.level].b != b) { in get_iter_to_node()
2244 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_node_rewrite()
2269 ret = bch2_btree_set_root(as, trans, btree_iter_path(trans, iter), n, false); in bch2_btree_node_rewrite()
2280 bch2_btree_node_free_inmem(trans, btree_iter_path(trans, iter), b); in bch2_btree_node_rewrite()
2495 parent = btree_node_parent(btree_iter_path(trans, iter), b); in __bch2_btree_node_update_key()
2503 struct btree_path *path2 = btree_iter_path(trans, &iter2); in __bch2_btree_node_update_key()
2534 bch2_btree_node_lock_write_nofail(trans, btree_iter_path(trans, iter), &b->c); in __bch2_btree_node_update_key()
2550 bch2_btree_node_unlock_write(trans, btree_iter_path(trans, iter), b); in __bch2_btree_node_update_key()
2569 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_node_update_key()
H A Dbtree_types.h576 static inline struct btree_path *btree_iter_path(struct btree_trans *trans, struct btree_iter *iter) in btree_iter_path() function
H A Drecovery.c213 struct bkey_s_c old = bch2_btree_path_peek_slot(btree_iter_path(trans, &iter), &u); in bch2_journal_replay_accounting_key()
275 struct btree_path *path = btree_iter_path(trans, &iter); in bch2_journal_replay_key()
H A Dbackpointers.c1065 struct btree_path *path = btree_iter_path(trans, &iter); in bch2_pin_backpointer_nodes_with_missing()
1089 struct btree_path *path = btree_iter_path(trans, &iter); in bch2_pin_backpointer_nodes_with_missing()
H A Ddebug.c440 &btree_iter_path(trans, &iter)->l[0]; in bch2_read_bfloat_failed()
H A Ddisk_accounting.c779 struct bkey_s_c k = bch2_btree_path_peek_slot_exact(btree_iter_path(trans, &iter), &u); in bch2_accounting_read()
H A Dbtree_gc.c641 struct btree_path *path = btree_iter_path(trans, iter); in bch2_gc_mark_key()
H A Dalloc_background.c1071 struct btree_path *path = btree_iter_path(trans, iter); in bch2_get_key_or_hole()