383 	struct bkey_cached *ck = (void *) path->l[0].b;  in btree_key_can_insert_cached_slowpath()  local
404 	memcpy(new_k, ck->k, ck->u64s * sizeof(u64));  in btree_key_can_insert_cached_slowpath()
407 		if (i->old_v == &ck->k->v)  in btree_key_can_insert_cached_slowpath()
410 	kfree(ck->k);  in btree_key_can_insert_cached_slowpath()
411 	ck->u64s	= new_u64s;  in btree_key_can_insert_cached_slowpath()
412 	ck->k		= new_k;  in btree_key_can_insert_cached_slowpath()
420 	struct bkey_cached *ck = (void *) path->l[0].b;  in btree_key_can_insert_cached()  local
428 	    !test_bit(BKEY_CACHED_DIRTY, &ck->flags) &&  in btree_key_can_insert_cached()
438 	if (u64s <= ck->u64s)  in btree_key_can_insert_cached()
442 	new_k		= krealloc(ck->k, new_u64s * sizeof(u64), GFP_NOWAIT|__GFP_NOWARN);  in btree_key_can_insert_cached()
447 		if (i->old_v == &ck->k->v)  in btree_key_can_insert_cached()
450 	ck->u64s	= new_u64s;  in btree_key_can_insert_cached()
451 	ck->k		= new_k;  in btree_key_can_insert_cached()