Home
last modified time | relevance | path

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

/linux/fs/bcachefs/
A Dbtree_iter.c1854 struct btree_path *path = btree_iter_path(trans, iter); in bch2_set_btree_iter_dontneed()
1884 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_iter_traverse()
1905 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_iter_peek_node()
1995 path = btree_iter_path(trans, iter); in bch2_btree_iter_next_node()
2002 path = btree_iter_path(trans, iter); in bch2_btree_iter_next_node()
2013 EBUG_ON(btree_iter_path(trans, iter)->uptodate); in bch2_btree_iter_next_node()
2200 EBUG_ON(btree_iter_path(trans, iter)->cached); in __bch2_btree_iter_peek()
2472 EBUG_ON(btree_iter_path(trans, iter)->cached || in bch2_btree_iter_peek_prev()
2473 btree_iter_path(trans, iter)->level); in bch2_btree_iter_peek_prev()
2539 path = btree_iter_path(trans, iter); in bch2_btree_iter_peek_prev()
[all …]
A Dbtree_write_buffer.c121 struct btree_path *path = btree_iter_path(trans, iter); in wb_flush_one_slowpath()
155 struct bkey_s_c k = bch2_btree_path_peek_slot_exact(btree_iter_path(trans, iter), &u); in wb_flush_one()
167 if (btree_iter_path(trans, iter)->ref > 1) in wb_flush_one()
170 path = btree_iter_path(trans, iter); in wb_flush_one()
344 struct btree_path *path = btree_iter_path(trans, &iter); in bch2_btree_write_buffer_flush_locked()
370 btree_iter_path(trans, &iter)->preserve = false; in bch2_btree_write_buffer_flush_locked()
395 struct btree_path *path = btree_iter_path(trans, &iter); in bch2_btree_write_buffer_flush_locked()
A Dbtree_update_interior.c2146 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_node_rewrite()
2172 ret = bch2_btree_set_root(as, trans, btree_iter_path(trans, iter), n, false); in bch2_btree_node_rewrite()
2181 bch2_btree_node_free_inmem(trans, btree_iter_path(trans, iter), b); in bch2_btree_node_rewrite()
2357 parent = btree_node_parent(btree_iter_path(trans, iter), b); in __bch2_btree_node_update_key()
2365 struct btree_path *path2 = btree_iter_path(trans, &iter2); in __bch2_btree_node_update_key()
2396 bch2_btree_node_lock_write_nofail(trans, btree_iter_path(trans, iter), &b->c); in __bch2_btree_node_update_key()
2412 bch2_btree_node_unlock_write(trans, btree_iter_path(trans, iter), b); in __bch2_btree_node_update_key()
2431 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_node_update_key()
2487 if (btree_iter_path(trans, &iter)->l[b->c.level].b != b) { in bch2_btree_node_update_key_get_iter()
A Dbtree_key_cache.c399 ck = (void *) btree_iter_path(trans, &c_iter)->l[0].b; in btree_key_cache_flush_pos()
447 struct btree_path *path = btree_iter_path(trans, &c_iter); in btree_key_cache_flush_pos()
A Drecovery.c150 struct bkey_s_c old = bch2_btree_path_peek_slot(btree_iter_path(trans, &iter), &u); in bch2_journal_replay_accounting_key()
212 struct btree_path *path = btree_iter_path(trans, &iter); in bch2_journal_replay_key()
A Dbtree_types.h556 static inline struct btree_path *btree_iter_path(struct btree_trans *trans, struct btree_iter *iter) in btree_iter_path() function
A Ddebug.c445 &btree_iter_path(trans, &iter)->l[0]; in bch2_read_bfloat_failed()
A Ddisk_accounting.c706 struct bkey_s_c k = bch2_btree_path_peek_slot_exact(btree_iter_path(trans, &iter), &u); in bch2_accounting_read()
A Dbackpointers.c839 struct btree *b = path_l(btree_iter_path(trans, iter))->b; in progress_update_iter()
A Dbtree_gc.c584 struct btree_path *path = btree_iter_path(trans, iter); in bch2_gc_mark_key()
A Dalloc_background.c1038 struct btree_path *path = btree_iter_path(iter->trans, iter); in bch2_get_key_or_hole()

Completed in 191 milliseconds