360 	struct bkey_cached *ck = (void *) path->l[0].b;  in btree_key_can_insert_cached_slowpath()  local
381 	memcpy(new_k, ck->k, ck->u64s * sizeof(u64));  in btree_key_can_insert_cached_slowpath()
384 		if (i->old_v == &ck->k->v)  in btree_key_can_insert_cached_slowpath()
387 	kfree(ck->k);  in btree_key_can_insert_cached_slowpath()
388 	ck->u64s	= new_u64s;  in btree_key_can_insert_cached_slowpath()
389 	ck->k		= new_k;  in btree_key_can_insert_cached_slowpath()
397 	struct bkey_cached *ck = (void *) path->l[0].b;  in btree_key_can_insert_cached()  local
403 	if (!test_bit(BKEY_CACHED_DIRTY, &ck->flags) &&  in btree_key_can_insert_cached()
414 	if (u64s <= ck->u64s)  in btree_key_can_insert_cached()
418 	new_k		= krealloc(ck->k, new_u64s * sizeof(u64), GFP_NOWAIT|__GFP_NOWARN);  in btree_key_can_insert_cached()
423 		if (i->old_v == &ck->k->v)  in btree_key_can_insert_cached()
426 	ck->u64s	= new_u64s;  in btree_key_can_insert_cached()
427 	ck->k		= new_k;  in btree_key_can_insert_cached()