Home
last modified time | relevance | path

Searched refs:new_k (Results 1 – 3 of 3) sorted by relevance

/linux/fs/bcachefs/
H A Dbtree_trans_commit.c384 struct bkey_i *new_k; in btree_key_can_insert_cached_slowpath() local
390 new_k = kmalloc(new_u64s * sizeof(u64), GFP_KERNEL); in btree_key_can_insert_cached_slowpath()
391 if (!new_k) { in btree_key_can_insert_cached_slowpath()
400 kfree(new_k); in btree_key_can_insert_cached_slowpath()
404 memcpy(new_k, ck->k, ck->u64s * sizeof(u64)); in btree_key_can_insert_cached_slowpath()
408 i->old_v = &new_k->v; in btree_key_can_insert_cached_slowpath()
412 ck->k = new_k; in btree_key_can_insert_cached_slowpath()
422 struct bkey_i *new_k; in btree_key_can_insert_cached() local
442 new_k = krealloc(ck->k, new_u64s * sizeof(u64), GFP_NOWAIT|__GFP_NOWARN); in btree_key_can_insert_cached()
443 if (unlikely(!new_k)) in btree_key_can_insert_cached()
[all …]
H A Dbtree_key_cache.c245 struct bkey_i *new_k = allocate_dropping_locks(trans, ret, in btree_key_cache_create() local
247 if (unlikely(!new_k)) { in btree_key_cache_create()
252 kfree(new_k); in btree_key_cache_create()
257 ck->k = new_k; in btree_key_cache_create()
H A Dbtree_update.c130 struct bkey_s_c old_k, new_k; in __bch2_insert_snapshot_whiteouts() local
153 new_k = bch2_bkey_get_iter(trans, &new_iter, id, whiteout_pos, in __bch2_insert_snapshot_whiteouts()
156 ret = bkey_err(new_k); in __bch2_insert_snapshot_whiteouts()
160 if (new_k.k->type == KEY_TYPE_deleted) { in __bch2_insert_snapshot_whiteouts()