Home
last modified time | relevance | path

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

/linux/fs/bcachefs/
H A Dbtree_iter.c251 BUG_ON(!!(iter->flags & BTREE_ITER_cached) != btree_iter_path(trans, iter)->cached); in bch2_btree_iter_verify()
262 bch2_btree_path_verify(trans, btree_iter_path(trans, iter)); in bch2_btree_iter_verify()
1887 struct btree_path *path = btree_iter_path(trans, iter); in bch2_set_btree_iter_dontneed()
1917 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_iter_traverse()
1938 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_iter_peek_node()
1951 btree_path_set_should_be_locked(trans, btree_iter_path(trans, iter)); in bch2_btree_iter_peek_node()
1989 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_iter_next_node()
2028 path = btree_iter_path(trans, iter); in bch2_btree_iter_next_node()
2035 path = btree_iter_path(trans, iter); in bch2_btree_iter_next_node()
2045 btree_path_set_should_be_locked(trans, btree_iter_path(trans, iter)); in bch2_btree_iter_next_node()
[all …]
H A Dbtree_key_cache.c319 ret = btree_key_cache_create(trans, btree_iter_path(trans, &iter), ck_path, k); in btree_key_cache_fill()
419 ck = (void *) btree_iter_path(trans, &c_iter)->l[0].b; in btree_key_cache_flush_pos()
474 struct btree_path *path = btree_iter_path(trans, &c_iter); in btree_key_cache_flush_pos()
H A Dbtree_update_interior.c2142 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_node_rewrite()
2166 ret = bch2_btree_set_root(as, trans, btree_iter_path(trans, iter), n, false); in bch2_btree_node_rewrite()
2177 bch2_btree_node_free_inmem(trans, btree_iter_path(trans, iter), b); in bch2_btree_node_rewrite()
2377 parent = btree_node_parent(btree_iter_path(trans, iter), b); in __bch2_btree_node_update_key()
2385 struct btree_path *path2 = btree_iter_path(trans, &iter2); in __bch2_btree_node_update_key()
2416 bch2_btree_node_lock_write_nofail(trans, btree_iter_path(trans, iter), &b->c); in __bch2_btree_node_update_key()
2432 bch2_btree_node_unlock_write(trans, btree_iter_path(trans, iter), b); in __bch2_btree_node_update_key()
2451 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_node_update_key()
2507 if (btree_iter_path(trans, &iter)->l[b->c.level].b != b) { in bch2_btree_node_update_key_get_iter()
H A Dbackpointers.c763 struct btree *b = path_l(btree_iter_path(trans, iter))->b; in progress_update_iter()
1014 struct btree_path *path = btree_iter_path(trans, &iter); in bch2_pin_backpointer_nodes_with_missing()
1038 struct btree_path *path = btree_iter_path(trans, &iter); in bch2_pin_backpointer_nodes_with_missing()
H A Dbtree_types.h562 static inline struct btree_path *btree_iter_path(struct btree_trans *trans, struct btree_iter *iter) in btree_iter_path() function
H A Ddisk_accounting.c717 struct bkey_s_c k = bch2_btree_path_peek_slot_exact(btree_iter_path(trans, &iter), &u); in bch2_accounting_read()
H A Ddebug.c446 &btree_iter_path(trans, &iter)->l[0]; in bch2_read_bfloat_failed()
H A Dbtree_gc.c589 struct btree_path *path = btree_iter_path(trans, iter); in bch2_gc_mark_key()
H A Dalloc_background.c1060 struct btree_path *path = btree_iter_path(iter->trans, iter); in bch2_get_key_or_hole()