Lines Matching refs:ck_path
211 struct btree_path *ck_path, in btree_key_cache_create() argument
231 struct bkey_cached *ck = bkey_cached_alloc(trans, ck_path, key_u64s); in btree_key_cache_create()
240 bch2_btree_id_str(ck_path->btree_id)); in btree_key_cache_create()
246 ck->c.btree_id = ck_path->btree_id; in btree_key_cache_create()
247 ck->key.btree_id = ck_path->btree_id; in btree_key_cache_create()
248 ck->key.pos = ck_path->pos; in btree_key_cache_create()
252 mark_btree_node_locked_noreset(ck_path, 0, BTREE_NODE_UNLOCKED); in btree_key_cache_create()
286 enum six_lock_type lock_want = __btree_lock_want(ck_path, 0); in btree_key_cache_create()
289 btree_path_cached_set(trans, ck_path, ck, (enum btree_node_locked_type) lock_want); in btree_key_cache_create()
290 ck_path->uptodate = BTREE_ITER_UPTODATE; in btree_key_cache_create()
294 mark_btree_node_locked_noreset(ck_path, 0, BTREE_NODE_UNLOCKED); in btree_key_cache_create()
300 struct btree_path *ck_path, in do_trace_key_cache_fill() argument
305 bch2_bpos_to_text(&buf, ck_path->pos); in do_trace_key_cache_fill()
316 struct btree_path *ck_path = trans->paths + ck_path_idx; in btree_key_cache_fill() local
319 ck_path->l[0].b = NULL; in btree_key_cache_fill()
328 bch2_trans_iter_init(trans, &iter, ck_path->btree_id, ck_path->pos, in btree_key_cache_fill()
339 ck_path = trans->paths + ck_path_idx; in btree_key_cache_fill()
340 ret = bch2_btree_key_cache_find(c, ck_path->btree_id, ck_path->pos) ? -EEXIST : 0; in btree_key_cache_fill()
344 ret = btree_key_cache_create(trans, btree_iter_path(trans, &iter), ck_path, k); in btree_key_cache_fill()
349 do_trace_key_cache_fill(trans, ck_path, k); in btree_key_cache_fill()