385 	struct bkey_cached *ck = (void *) path->l[0].b;  in btree_key_can_insert_cached_slowpath()  local
406 	memcpy(new_k, ck->k, ck->u64s * sizeof(u64));  in btree_key_can_insert_cached_slowpath()
409 		if (i->old_v == &ck->k->v)  in btree_key_can_insert_cached_slowpath()
412 	kfree(ck->k);  in btree_key_can_insert_cached_slowpath()
413 	ck->u64s	= new_u64s;  in btree_key_can_insert_cached_slowpath()
414 	ck->k		= new_k;  in btree_key_can_insert_cached_slowpath()
422 	struct bkey_cached *ck = (void *) path->l[0].b;  in btree_key_can_insert_cached()  local
430 	    !test_bit(BKEY_CACHED_DIRTY, &ck->flags) &&  in btree_key_can_insert_cached()
440 	if (u64s <= ck->u64s)  in btree_key_can_insert_cached()
444 	new_k		= krealloc(ck->k, new_u64s * sizeof(u64), GFP_NOWAIT|__GFP_NOWARN);  in btree_key_can_insert_cached()
449 		if (i->old_v == &ck->k->v)  in btree_key_can_insert_cached()
452 	ck->u64s	= new_u64s;  in btree_key_can_insert_cached()
453 	ck->k		= new_k;  in btree_key_can_insert_cached()