optimize phi3 again: use sdp if possible (#10951)

This commit is contained in:
Yishuo Wang 2024-05-07 15:53:08 +08:00 committed by GitHub
parent c11170b96f
commit aa2fa9fde1
No known key found for this signature in database
GPG key ID: B5690EEEBB952194

View file

@ -39,7 +39,7 @@ from ipex_llm.transformers.models.utils import (
rotate_half, should_use_fuse_rope, rotate_half, should_use_fuse_rope,
apply_rotary_pos_emb_cache_freq_xpu apply_rotary_pos_emb_cache_freq_xpu
) )
from ipex_llm.transformers.models.utils import mlp_fusion_check, SILU from ipex_llm.transformers.models.utils import mlp_fusion_check, SILU, use_new_esimd_sdp_fp16
from ipex_llm.transformers.kv import DynamicNormalCache from ipex_llm.transformers.kv import DynamicNormalCache
from typing import Optional, Tuple, List from typing import Optional, Tuple, List
@ -93,6 +93,10 @@ def attention_forward(
key_states, value_states = past_key_value.update(key_states, value_states, key_states, value_states = past_key_value.update(key_states, value_states,
self.layer_idx, None) self.layer_idx, None)
if use_new_esimd_sdp_fp16(q_len, kv_seq_len, self.head_dim, query_states):
import linear_q4_0
attn_output = linear_q4_0.sdp_fp16(query_states, key_states, value_states, attention_mask)
else:
# repeat k/v heads if n_kv_heads < n_heads # repeat k/v heads if n_kv_heads < n_heads
key_states = repeat_kv(key_states, self.num_key_value_groups) key_states = repeat_kv(key_states, self.num_key_value_groups)
value_states = repeat_kv(value_states, self.num_key_value_groups) value_states = repeat_kv(value_states, self.num_key_value_groups)