a1558b6e50
CCCL tuning_radix_sort.cuh teaches: when one kernel in a chain is unavailable, replace ONLY that kernel while keeping downstream native ops alive. Our MoE chain: topk_softmax → moe_align_block_size → invoke_fused_moe_kernel BI-V100 ixformer lacks vllm_moe_topk_softmax, which killed the ENTIRE chain and forced 100% PyTorch fallback (_pure_pytorch_experts: 256x F.linear loop). Fix: Add try/except in topk_softmax with PyTorch fallback (softmax+topk). Now the chain can proceed to native align+invoke kernels if they exist. Also: dont permanently disable native path after first failure — retry once. CCCL source: catch2_test_device_radix_sort_pairs.cu + tuning_radix_sort.cuh Maps to: _custom_ops.py (topk_softmax) + qwen3_5.py (MoE forward)
1171 lines
42 KiB
Python
1171 lines
42 KiB
Python
import contextlib
|
|
import functools
|
|
from typing import TYPE_CHECKING, List, Optional, Tuple, Union, Dict, Any
|
|
|
|
import torch
|
|
import torch.library
|
|
|
|
import vllm.envs as envs
|
|
from vllm._core_ext import ScalarType
|
|
from vllm.logger import init_logger
|
|
from vllm.platforms import current_platform
|
|
# import ixformer.inference.functions as ops
|
|
import ixformer.functions as ixf_F
|
|
from ixformer.distributed import _distributed as cdist
|
|
import torch.nn.functional as F
|
|
|
|
logger = init_logger(__name__)
|
|
|
|
supports_moe_ops = True
|
|
|
|
if TYPE_CHECKING:
|
|
|
|
def register_fake(fn):
|
|
return lambda name: fn
|
|
else:
|
|
try:
|
|
from torch.library import register_fake
|
|
except ImportError:
|
|
try:
|
|
from torch.library import impl_abstract as register_fake
|
|
except:
|
|
def register_fake(fn):
|
|
return lambda name: fn
|
|
|
|
|
|
def hint_on_error(fn):
|
|
|
|
@functools.wraps(fn)
|
|
def wrapper(*args, **kwargs):
|
|
try:
|
|
return fn(*args, **kwargs)
|
|
|
|
except NotImplementedError as e:
|
|
msg = (
|
|
"Error in calling custom op %s: %s\n"
|
|
"Not implemented or built, mostly likely because the current current device "
|
|
"does not support this kernel (less likely TORCH_CUDA_ARCH_LIST was set "
|
|
"incorrectly while building)")
|
|
logger.error(msg, fn.__name__, e)
|
|
raise NotImplementedError(msg % (fn.__name__, e)) from e
|
|
except AttributeError as e:
|
|
msg = (
|
|
"Error in calling custom op %s: %s\n"
|
|
"Possibly you have built or installed an obsolete version of vllm.\n"
|
|
"Please try a clean build and install of vllm,"
|
|
"or remove old built files such as vllm/*cpython*.so and build/ ."
|
|
)
|
|
logger.error(msg, fn.__name__, e)
|
|
raise e
|
|
|
|
return wrapper
|
|
|
|
|
|
# activation ops
|
|
def silu_and_mul(out: torch.Tensor, x: torch.Tensor) -> None:
|
|
ixf_F.silu_and_mul(x, out)
|
|
|
|
|
|
def gelu_and_mul(out: torch.Tensor, x: torch.Tensor) -> None:
|
|
ixf_F.gelu_and_mul(x, out)
|
|
|
|
|
|
def gelu_tanh_and_mul(out: torch.Tensor, x: torch.Tensor) -> None:
|
|
ixf_F.gelu_tanh_and_mul(x, out)
|
|
|
|
|
|
def gelu_fast(out: torch.Tensor, x: torch.Tensor) -> None:
|
|
out.copy_(F.gelu(x,approximate="tanh"))
|
|
return out
|
|
|
|
|
|
def gelu_new(out: torch.Tensor, x: torch.Tensor) -> None:
|
|
out.copy_(F.gelu(x,approximate="tanh"))
|
|
return out
|
|
|
|
|
|
def gelu_quick(out: torch.Tensor, x: torch.Tensor) -> None:
|
|
out.copy_(F.gelu(x,approximate="tanh"))
|
|
return out
|
|
|
|
|
|
|
|
def paged_attention_v1(
|
|
output,
|
|
query,
|
|
key_cache,
|
|
value_cache,
|
|
head_mapping,
|
|
scale,
|
|
block_tables,
|
|
context_lens,
|
|
block_size,
|
|
max_context_len,
|
|
alibi_slopes=None,
|
|
kv_cache_dtype=None,
|
|
):
|
|
return ixf_F.vllm_single_query_cached_kv_attention(
|
|
output,
|
|
query,
|
|
key_cache,
|
|
value_cache,
|
|
head_mapping,
|
|
scale,
|
|
block_tables,
|
|
context_lens,
|
|
block_size,
|
|
max_context_len,
|
|
alibi_slopes,
|
|
)
|
|
|
|
|
|
|
|
def paged_attention_v2(
|
|
out: torch.Tensor,
|
|
exp_sum: torch.Tensor,
|
|
max_logits: torch.Tensor,
|
|
tmp_out: torch.Tensor,
|
|
query: torch.Tensor,
|
|
key_cache: torch.Tensor,
|
|
value_cache: torch.Tensor,
|
|
num_kv_heads: int,
|
|
scale: float,
|
|
block_tables: torch.Tensor,
|
|
seq_lens: torch.Tensor,
|
|
block_size: int,
|
|
max_seq_len: int,
|
|
alibi_slopes: Optional[torch.Tensor],
|
|
kv_cache_dtype: str,
|
|
k_scale: float,
|
|
v_scale: float,
|
|
tp_rank: int = 0,
|
|
blocksparse_local_blocks: int = 0,
|
|
blocksparse_vert_stride: int = 0,
|
|
blocksparse_block_size: int = 64,
|
|
blocksparse_head_sliding_step: int = 0,
|
|
) -> None:
|
|
# CCCL two-pass dispatch pattern (dispatch_reduce.cuh):
|
|
# Pass 1: N CTAs each reduce their tile → d_block_reductions[N]
|
|
# Pass 2: 1 CTA reduces d_block_reductions[N] → d_out
|
|
# Our PyTorch V2 implementation follows the same pattern:
|
|
# Phase 1: partition attention (each partition = one tile)
|
|
# Phase 2: cross-partition log-sum-exp reduction (summary_statistics binary_op)
|
|
# paged_attention_v2_pytorch.py — try multiple import locations
|
|
# In docker: may be at /workspace/, next to vllm package, or in vllm/ itself
|
|
import sys, os
|
|
_pav2 = None
|
|
# Try 1: same package (patch_ops copies it next to _custom_ops.py)
|
|
try:
|
|
from vllm.paged_attention_v2_pytorch import paged_attention_v2_pytorch
|
|
_pav2 = paged_attention_v2_pytorch
|
|
except ImportError:
|
|
pass
|
|
# Try 2: /workspace/ (Dockerfile WORKDIR)
|
|
if _pav2 is None:
|
|
try:
|
|
_ws = '/workspace'
|
|
if _ws not in sys.path:
|
|
sys.path.insert(0, _ws)
|
|
from paged_attention_v2_pytorch import paged_attention_v2_pytorch
|
|
_pav2 = paged_attention_v2_pytorch
|
|
except ImportError:
|
|
pass
|
|
# Try 3: repo root relative to this file
|
|
if _pav2 is None:
|
|
_repo_root = os.path.dirname(os.path.dirname(os.path.abspath(__file__)))
|
|
if _repo_root not in sys.path:
|
|
sys.path.insert(0, _repo_root)
|
|
from paged_attention_v2_pytorch import paged_attention_v2_pytorch
|
|
_pav2 = paged_attention_v2_pytorch
|
|
_pav2(
|
|
out, exp_sum, max_logits, tmp_out,
|
|
query, key_cache, value_cache,
|
|
num_kv_heads, scale, block_tables, seq_lens,
|
|
block_size, max_seq_len, alibi_slopes,
|
|
kv_cache_dtype, k_scale, v_scale, tp_rank,
|
|
blocksparse_local_blocks, blocksparse_vert_stride,
|
|
blocksparse_block_size, blocksparse_head_sliding_step,
|
|
)
|
|
|
|
|
|
def paged_attention_rocm(
|
|
out: torch.Tensor,
|
|
exp_sum: torch.Tensor,
|
|
max_logits: torch.Tensor,
|
|
tmp_out: torch.Tensor,
|
|
query: torch.Tensor,
|
|
key_cache: torch.Tensor,
|
|
value_cache: torch.Tensor,
|
|
num_kv_heads: int,
|
|
scale: float,
|
|
block_tables: torch.Tensor,
|
|
seq_lens: torch.Tensor,
|
|
block_size: int,
|
|
max_seq_len: int,
|
|
alibi_slopes: Optional[torch.Tensor],
|
|
kv_cache_dtype: str,
|
|
k_scale: float,
|
|
v_scale: float,
|
|
) -> None:
|
|
raise NotImplementedError()
|
|
|
|
|
|
# pos encoding ops
|
|
def rotary_embedding(
|
|
positions: torch.Tensor,
|
|
query: torch.Tensor,
|
|
key: torch.Tensor,
|
|
head_size: int,
|
|
cos_sin_cache: torch.Tensor,
|
|
is_neox: bool,
|
|
) -> None:
|
|
ixf_F.vllm_rotary_embedding_neox(positions, query, key, head_size,
|
|
cos_sin_cache, is_neox)
|
|
|
|
|
|
def batched_rotary_embedding(positions: torch.Tensor, query: torch.Tensor,
|
|
key: torch.Tensor, head_size: int,
|
|
cos_sin_cache: torch.Tensor, is_neox: bool,
|
|
rot_dim: int,
|
|
cos_sin_cache_offsets: torch.Tensor) -> None:
|
|
ixf_F.vllm_batched_rotary_embedding(positions, query, key, head_size,
|
|
cos_sin_cache, is_neox, rot_dim,
|
|
cos_sin_cache_offsets)
|
|
|
|
|
|
# layer norm ops
|
|
def rms_norm(out: torch.Tensor, input: torch.Tensor, weight: torch.Tensor,
|
|
epsilon: float) -> None:
|
|
ixf_F.rms_norm(input, weight, out, epsilon)
|
|
|
|
|
|
def fused_add_rms_norm(input: torch.Tensor, residual: torch.Tensor,
|
|
weight: torch.Tensor, epsilon: float,
|
|
residual_alpha: Optional[float] = 1) -> None:
|
|
ixf_F.fused_add_rms_norm(input, residual, weight, epsilon)
|
|
|
|
|
|
def advance_step_flashattn(num_seqs: int, num_queries: int, block_size: int,
|
|
input_tokens: torch.Tensor,
|
|
sampled_token_ids: torch.Tensor,
|
|
input_positions: torch.Tensor,
|
|
seq_lens: torch.Tensor, slot_mapping: torch.Tensor,
|
|
block_tables: torch.Tensor) -> None:
|
|
"""Advance a step on GPU for existing inputs for a multi-step runner"""
|
|
return ixf_F.advance_step_flashattn(num_seqs, num_queries, block_size,
|
|
input_tokens,
|
|
sampled_token_ids,
|
|
input_positions,
|
|
seq_lens, slot_mapping,
|
|
block_tables)
|
|
|
|
|
|
def advance_step_flashinfer(num_seqs: int, num_queries: int, block_size: int,
|
|
input_tokens: torch.Tensor,
|
|
sampled_token_ids: torch.Tensor,
|
|
input_positions: torch.Tensor,
|
|
seq_lens: torch.Tensor, slot_mapping: torch.Tensor,
|
|
block_tables: torch.Tensor,
|
|
paged_kv_indices: torch.Tensor,
|
|
paged_kv_indptr: torch.Tensor,
|
|
paged_kv_last_page_len: torch.Tensor,
|
|
block_table_bound: torch.Tensor) -> None:
|
|
raise NotImplementedError("FIX SOON")
|
|
|
|
|
|
# quantization ops
|
|
# awq
|
|
def awq_dequantize(qweight: torch.Tensor, scales: torch.Tensor,
|
|
zeros: torch.Tensor, split_k_iters: int, thx: int,
|
|
thy: int) -> torch.Tensor:
|
|
raise NotImplementedError()
|
|
|
|
|
|
def awq_gemm(input: torch.Tensor, qweight: torch.Tensor, scales: torch.Tensor, qzeros: torch.Tensor,
|
|
pack_factor, group_size: int = 128) -> torch.Tensor:
|
|
return ixf_F.quantized_linear(input, qweight, scales,"awq",32 // pack_factor,qzeros=qzeros,group_size=group_size)
|
|
|
|
|
|
# gptq
|
|
def gptq_gemm(a: torch.Tensor, b_q_weight: torch.Tensor,
|
|
b_gptq_qzeros: torch.Tensor, b_gptq_scales: torch.Tensor,
|
|
b_g_idx: torch.Tensor, use_exllama: bool,
|
|
bit: int) -> torch.Tensor:
|
|
batch = a.shape[0]
|
|
if batch <= 8:
|
|
return ixf_F.quantized_linear(a,b_q_weight,b_gptq_scales,"gptq",4,b_gptq_qzeros,None,group_size=128)
|
|
o_dtype_str = "fp16" if a.dtype == torch.half else "bf16"
|
|
deq_w = ixf_F.quantized_weight_dequant(b_q_weight,b_gptq_scales,"gptq",o_dtype_str,4,b_gptq_qzeros,group_size=128)
|
|
return torch.matmul(a,deq_w)
|
|
|
|
|
|
if hasattr(torch.ops._C, "gptq_gemm"):
|
|
|
|
@register_fake("_C::gptq_gemm")
|
|
def _gptq_gemm_fake(a: torch.Tensor, b_q_weight: torch.Tensor,
|
|
b_gptq_qzeros: torch.Tensor,
|
|
b_gptq_scales: torch.Tensor, b_g_idx: torch.Tensor,
|
|
use_exllama: bool, bit: int) -> torch.Tensor:
|
|
return torch.empty((a.size(0), b_q_weight.size(1)),
|
|
dtype=a.dtype,
|
|
device=a.device)
|
|
|
|
|
|
def gptq_shuffle(q_weight: torch.Tensor, q_perm: torch.Tensor,
|
|
bit: int) -> None:
|
|
return ixf_F.vllm_gptq_shuffle(q_weight,q_perm)
|
|
|
|
|
|
# marlin
|
|
def marlin_gemm(a: torch.Tensor, b_q_weight: torch.Tensor,
|
|
b_scales: torch.Tensor, workspace: torch.Tensor, size_m: int,
|
|
size_n: int, size_k: int) -> torch.Tensor:
|
|
raise NotImplementedError()
|
|
|
|
|
|
# marlin_24
|
|
def gptq_marlin_24_gemm(a: torch.Tensor, b_q_weight: torch.Tensor,
|
|
b_meta: torch.Tensor, b_scales: torch.Tensor,
|
|
workspace: torch.Tensor, b_q_type: ScalarType,
|
|
size_m: int, size_n: int, size_k: int) -> torch.Tensor:
|
|
raise NotImplementedError()
|
|
|
|
|
|
if hasattr(torch.ops._C, "gptq_marlin_24_gemm"):
|
|
|
|
@register_fake("_C::gptq_marlin_24_gemm")
|
|
def _gptq_marlin_24_gemm_fake(a: torch.Tensor, b_q_weight: torch.Tensor,
|
|
b_meta: torch.Tensor, b_scales: torch.Tensor,
|
|
workspace: torch.Tensor,
|
|
b_q_type: ScalarType, size_m: int,
|
|
size_n: int, size_k: int) -> torch.Tensor:
|
|
return torch.empty((size_m, size_n), device=a.device, dtype=a.dtype)
|
|
|
|
@register_fake("_C::gptq_marlin_gemm")
|
|
def _gptq_marlin_gemm_fake(a: torch.Tensor,
|
|
b_q_weight: torch.Tensor,
|
|
b_scales: torch.Tensor,
|
|
b_zeros: torch.Tensor,
|
|
g_idx: torch.Tensor,
|
|
perm: torch.Tensor,
|
|
workspace: torch.Tensor,
|
|
b_q_type: ScalarType,
|
|
size_m: int,
|
|
size_n: int,
|
|
size_k: int,
|
|
is_k_full: bool,
|
|
has_zp: bool = False,
|
|
use_fp32_reduce: bool = False) -> torch.Tensor:
|
|
return torch.empty((size_m, size_n), device=a.device, dtype=a.dtype)
|
|
|
|
@register_fake("_C::ggml_dequantize")
|
|
def _ggml_dequantize_fake(W: torch.Tensor, quant_type: int, m: int,
|
|
n: int) -> torch.Tensor:
|
|
return torch.empty((m, n), dtype=torch.float16, device=W.device)
|
|
|
|
@register_fake("_C::ggml_mul_mat_vec_a8")
|
|
def _ggml_mul_mat_vec_a8_fake(
|
|
W: torch.Tensor,
|
|
X: torch.Tensor,
|
|
quant_type: int,
|
|
row: int,
|
|
) -> torch.Tensor:
|
|
return torch.empty((1, row), dtype=torch.float16, device=W.device)
|
|
|
|
@register_fake("_C::ggml_mul_mat_a8")
|
|
def _ggml_mul_mat_a8_fake(
|
|
W: torch.Tensor,
|
|
X: torch.Tensor,
|
|
quant_type: int,
|
|
row: int,
|
|
) -> torch.Tensor:
|
|
batch = X.size(0)
|
|
return torch.empty((batch, row), dtype=torch.float16, device=W.device)
|
|
|
|
@register_fake("_C::marlin_qqq_gemm")
|
|
def _marlin_qqq_gemm_fake(a: torch.Tensor, b_q_weight: torch.Tensor,
|
|
s_tok: torch.Tensor, s_ch: torch.Tensor,
|
|
s_group: torch.Tensor, workspace: torch.Tensor,
|
|
size_m: int, size_n: int,
|
|
size_k: int) -> torch.Tensor:
|
|
return torch.empty((size_m, size_n),
|
|
dtype=torch.float16,
|
|
device=a.device)
|
|
|
|
@register_fake("_C::marlin_gemm")
|
|
def _marlin_gemm_fake(a: torch.Tensor, b_q_weight: torch.Tensor,
|
|
b_scales: torch.Tensor, workspace: torch.Tensor,
|
|
size_m: int, size_n: int,
|
|
size_k: int) -> torch.Tensor:
|
|
return torch.empty((size_m, size_n),
|
|
dtype=torch.float16,
|
|
device=a.device)
|
|
|
|
@register_fake("_C::awq_dequantize")
|
|
def _awq_dequantize_fake(qweight: torch.Tensor, scales: torch.Tensor,
|
|
zeros: torch.Tensor, split_k_iters: int, thx: int,
|
|
thy: int) -> torch.Tensor:
|
|
in_c = qweight.size(0)
|
|
qout_c = qweight.size(1)
|
|
out_c = qout_c * 8
|
|
return torch.empty((in_c, out_c),
|
|
dtype=scales.dtype,
|
|
device=scales.device)
|
|
|
|
@register_fake("_C::awq_gemm")
|
|
def _awq_gemm_fake(input: torch.Tensor, qweight: torch.Tensor,
|
|
qzeros: torch.Tensor, scales: torch.Tensor,
|
|
split_k_iters: int) -> torch.Tensor:
|
|
num_in_feats = input.size(0)
|
|
return torch.empty((split_k_iters, num_in_feats, qweight.size(1) * 8),
|
|
dtype=input.dtype,
|
|
device=input.device).sum(0)
|
|
|
|
@register_fake("_C::aqlm_gemm")
|
|
def _aqlm_gemm_fake(input: torch.Tensor, codes: torch.Tensor,
|
|
codebooks: torch.Tensor, scales: torch.Tensor,
|
|
codebook_partition_sizes: List[int],
|
|
bias: Optional[torch.Tensor]) -> torch.Tensor:
|
|
out_features = codes.size(0) * codebooks.size(2)
|
|
flat_input = input.reshape((-1, input.size(-1)))
|
|
flat_output = torch.empty((flat_input.size(0), out_features),
|
|
dtype=input.dtype,
|
|
device=input.device)
|
|
|
|
output_sizes = list(input.shape)
|
|
output_sizes.pop()
|
|
output_sizes.append(-1)
|
|
return flat_output.reshape(tuple(output_sizes))
|
|
|
|
@register_fake("_C::aqlm_dequant")
|
|
def _aqlm_dequant_fake(
|
|
codes: torch.Tensor, codebooks: torch.Tensor,
|
|
codebook_partition_sizes: List[int]) -> torch.Tensor:
|
|
in_features = codes.size(1) * 8
|
|
out_features = codes.size(0)
|
|
return torch.empty((out_features, in_features),
|
|
dtype=codebooks.dtype,
|
|
device=codebooks.device)
|
|
|
|
@register_fake("_C::fp8_marlin_gemm")
|
|
def _fp8_marlin_gemm_fake(a: torch.Tensor, b_q_weight: torch.Tensor,
|
|
b_scales: torch.Tensor, workspace: torch.Tensor,
|
|
num_bits: int, size_m: int, size_n: int,
|
|
size_k: int) -> torch.Tensor:
|
|
return torch.empty((size_m, size_n), dtype=a.dtype, device=a.device)
|
|
|
|
@register_fake("_C::machete_gemm")
|
|
def machete_gemm_fake(
|
|
a: torch.Tensor,
|
|
# Should be the tensor returned by machete_prepack_B
|
|
b_q: torch.Tensor,
|
|
b_type: ScalarType,
|
|
b_scales: Optional[torch.Tensor] = None,
|
|
b_zeros: Optional[torch.Tensor] = None,
|
|
b_group_size: Optional[int] = None,
|
|
c: Optional[torch.Tensor] = None,
|
|
alpha: Optional[float] = None,
|
|
beta: Optional[float] = None,
|
|
schedule: Optional[str] = None,
|
|
) -> torch.Tensor:
|
|
m = a.size(0)
|
|
n = b_q.size(1)
|
|
return torch.empty((m, n), device=a.device, dtype=a.dtype)
|
|
|
|
@register_fake("_C::machete_prepack_B")
|
|
def machete_prepack_B_fake(b_q_weight: torch.Tensor,
|
|
b_type: ScalarType) -> torch.Tensor:
|
|
return torch.empty_like(b_q_weight,
|
|
memory_format=torch.contiguous_format)
|
|
|
|
@register_fake("_C::causal_conv1d_fwd")
|
|
def causal_conv1d_fwd_fake(x: torch.Tensor, weight: torch.Tensor,
|
|
bias_: Optional[torch.Tensor],
|
|
conv_states: Optional[torch.Tensor],
|
|
cu_seq_len: Optional[torch.Tensor],
|
|
cache_indices: Optional[torch.Tensor],
|
|
has_initial_state: Optional[torch.Tensor],
|
|
silu_activation: bool) -> torch.Tensor:
|
|
return torch.empty_like(x)
|
|
|
|
@register_fake("_C::causal_conv1d_update")
|
|
def causal_conv1d_update_fake(
|
|
x: torch.Tensor, conv_state: torch.Tensor, weight: torch.Tensor,
|
|
bias_: Optional[torch.Tensor], silu_activation: bool,
|
|
cache_seqlens: Optional[torch.Tensor],
|
|
conv_state_indices: Optional[torch.Tensor]) -> torch.Tensor:
|
|
return torch.empty_like(x)
|
|
|
|
@register_fake("_C::selective_scan_fwd")
|
|
def selective_scan_fwd_fake(u: torch.Tensor, delta: torch.Tensor,
|
|
A: torch.Tensor, B: torch.Tensor,
|
|
C: torch.Tensor, D_: Optional[torch.Tensor],
|
|
z_: Optional[torch.Tensor],
|
|
delta_bias_: Optional[torch.Tensor],
|
|
delta_softplus: bool,
|
|
cu_seq_len: Optional[torch.Tensor],
|
|
cache_indices: Optional[torch.Tensor],
|
|
has_initial_state: Optional[torch.Tensor],
|
|
ssm_states: Optional[torch.Tensor]) -> None:
|
|
return None
|
|
|
|
|
|
# cutlass
|
|
def cutlass_scaled_mm_supports_fp8(cuda_device_capability: int) -> bool:
|
|
return True
|
|
|
|
|
|
def cutlass_scaled_mm(a: torch.Tensor,
|
|
b: torch.Tensor,
|
|
scale_a: torch.Tensor,
|
|
scale_b: torch.Tensor,
|
|
out_dtype: torch.dtype,
|
|
bias: Optional[torch.Tensor] = None) -> torch.Tensor:
|
|
|
|
m = a.shape[0]
|
|
n = b.shape[1]
|
|
out = torch.empty((m, n), dtype=out_dtype, device=a.device)
|
|
ixf_F.w8a8(a, b.transpose(0,1), scale_a, scale_b, bias, output=out, out_dtype=out_dtype)
|
|
|
|
return out
|
|
|
|
|
|
def cutlass_scaled_mm_azp(a: torch.Tensor,
|
|
b: torch.Tensor,
|
|
scale_a: torch.Tensor,
|
|
scale_b: torch.Tensor,
|
|
out_dtype: torch.dtype,
|
|
azp_adj: torch.Tensor,
|
|
azp: Optional[torch.Tensor] = None,
|
|
bias: Optional[torch.Tensor] = None) -> torch.Tensor:
|
|
raise NotImplementedError()
|
|
|
|
|
|
# aqlm
|
|
def aqlm_gemm(input: torch.Tensor, codes: torch.Tensor,
|
|
codebooks: torch.Tensor, scales: torch.Tensor,
|
|
codebook_partition_sizes: List[int],
|
|
bias: Optional[torch.Tensor]) -> torch.Tensor:
|
|
raise NotImplementedError()
|
|
|
|
|
|
def aqlm_dequant(codes: torch.Tensor, codebooks: torch.Tensor,
|
|
codebook_partition_sizes: List[int]) -> torch.Tensor:
|
|
raise NotImplementedError()
|
|
|
|
|
|
# gptq_marlin
|
|
def gptq_marlin_repack(b_q_weight: torch.Tensor, perm: torch.Tensor,
|
|
size_k: int, size_n: int,
|
|
num_bits: int) -> torch.Tensor:
|
|
raise NotImplementedError()
|
|
|
|
|
|
# gptq_marlin
|
|
def awq_marlin_repack(b_q_weight: torch.Tensor, size_k: int, size_n: int,
|
|
num_bits: int) -> torch.Tensor:
|
|
raise NotImplementedError()
|
|
|
|
|
|
def gptq_marlin_moe_repack(b_q_weight: torch.Tensor, perm: torch.Tensor,
|
|
size_k: int, size_n: int,
|
|
num_bits: int) -> torch.Tensor:
|
|
raise NotImplementedError()
|
|
|
|
|
|
def awq_marlin_moe_repack(b_q_weight: torch.Tensor, perm: torch.Tensor,
|
|
size_k: int, size_n: int,
|
|
num_bits: int) -> torch.Tensor:
|
|
num_experts = b_q_weight.shape[0]
|
|
assert size_k % 16 == 0
|
|
output = torch.empty((num_experts, size_k // 16, size_n * (num_bits // 2)),
|
|
device=b_q_weight.device,
|
|
dtype=b_q_weight.dtype)
|
|
for e in range(num_experts):
|
|
output[e] = torch.ops._C.awq_marlin_repack(b_q_weight[e], size_k,
|
|
size_n, num_bits)
|
|
return output
|
|
|
|
|
|
def gptq_marlin_gemm(a: torch.Tensor,
|
|
b_q_weight: torch.Tensor,
|
|
b_scales: torch.Tensor,
|
|
b_zeros: torch.Tensor,
|
|
g_idx: torch.Tensor,
|
|
perm: torch.Tensor,
|
|
workspace: torch.Tensor,
|
|
b_q_type: ScalarType,
|
|
size_m: int,
|
|
size_n: int,
|
|
size_k: int,
|
|
is_k_full: bool,
|
|
has_zp: bool = False,
|
|
use_fp32_reduce: bool = False) -> torch.Tensor:
|
|
raise NotImplementedError()
|
|
|
|
|
|
# fp8 marlin
|
|
def fp8_marlin_gemm(a: torch.Tensor, b_q_weight: torch.Tensor,
|
|
b_scales: torch.Tensor, workspace: torch.Tensor,
|
|
num_bits: int, size_m: int, size_n: int,
|
|
size_k: int) -> torch.Tensor:
|
|
raise NotImplementedError()
|
|
|
|
|
|
# machete
|
|
def machete_supported_schedules(b_type: ScalarType) -> List[str]:
|
|
raise NotImplementedError()
|
|
|
|
|
|
def machete_gemm(
|
|
a: torch.Tensor,
|
|
b_q: torch.Tensor, # Should be the tensor returned by machete_prepack_B
|
|
b_type: ScalarType,
|
|
b_scales: Optional[torch.Tensor] = None,
|
|
b_zeros: Optional[torch.Tensor] = None,
|
|
b_group_size: Optional[int] = None,
|
|
c: Optional[torch.Tensor] = None,
|
|
alpha: Optional[float] = None,
|
|
beta: Optional[float] = None,
|
|
schedule: Optional[str] = None,
|
|
) -> torch.Tensor:
|
|
raise NotImplementedError()
|
|
|
|
|
|
def machete_prepack_B(b_q_weight: torch.Tensor,
|
|
b_type: ScalarType) -> torch.Tensor:
|
|
raise NotImplementedError()
|
|
|
|
|
|
if hasattr(torch.ops._C, "permute_cols"):
|
|
|
|
@register_fake("_C::permute_cols")
|
|
def _permute_cols_fake(a: torch.Tensor,
|
|
perm: torch.Tensor) -> torch.Tensor:
|
|
return torch.empty_like(a)
|
|
|
|
|
|
def permute_cols(a: torch.Tensor, perm: torch.Tensor) -> torch.Tensor:
|
|
raise NotImplementedError()
|
|
|
|
|
|
# fp8
|
|
def scaled_fp8_quant(
|
|
input: torch.Tensor,
|
|
scale: Optional[torch.Tensor] = None,
|
|
num_token_padding: Optional[int] = None,
|
|
scale_ub: Optional[torch.Tensor] = None,
|
|
use_per_token_if_dynamic: bool = False,
|
|
) -> Tuple[torch.Tensor, torch.Tensor]:
|
|
"""
|
|
Quantize input tensor to FP8 and return quantized tensor and scale.
|
|
|
|
This function supports both static and dynamic quantization: If you
|
|
provide the scale, it will use static scaling and if you omit it,
|
|
the scale will be determined dynamically. The function also allows
|
|
optional padding of the output tensors for downstream kernels that
|
|
will benefit from padding.
|
|
|
|
Args:
|
|
input: The input tensor to be quantized to FP8
|
|
scale: Optional scaling factor for the FP8 quantization
|
|
scale_ub: Optional upper bound for scaling factor in dynamic
|
|
per token case
|
|
num_token_padding: If specified, pad the first dimension
|
|
of the output to at least this value.
|
|
use_per_token_if_dynamic: Whether to do per_tensor or per_token
|
|
in the dynamic quantization case.
|
|
|
|
Returns:
|
|
Tuple[torch.Tensor, torch.Tensor]: The output tensor in FP8 and
|
|
scaling factor.
|
|
"""
|
|
raise NotImplementedError()
|
|
|
|
|
|
# int8
|
|
def scaled_int8_quant(
|
|
input: torch.Tensor,
|
|
scale: Optional[torch.Tensor] = None,
|
|
azp: Optional[torch.Tensor] = None,
|
|
symmetric: bool = True
|
|
) -> Tuple[torch.Tensor, torch.Tensor, Optional[torch.Tensor]]:
|
|
"""
|
|
Quantize the input tensor to int8 and return the quantized tensor and scale, and maybe azp.
|
|
|
|
Args:
|
|
input: The input tensor to be quantized to int8.
|
|
scale: Optional scaling factor for the int8 quantization.
|
|
When not provided, we invoke dynamic-per-token quantization.
|
|
azp: Optional zero-point for the int8 quantization.
|
|
Must be provided for asymmetric quantization if `scale` is provided.
|
|
symmetric: Whether to use symmetric quantization (scale only, azp ignored).
|
|
|
|
Returns:
|
|
Tuple[torch.Tensor, torch.Tensor, Optional[torch.Tensor]] : Output int8 tensor, scales, and optionally azp.
|
|
"""
|
|
output = torch.empty_like(input, dtype=torch.int8)
|
|
if scale is not None:
|
|
# static-per-tensor quantization.
|
|
assert symmetric == (
|
|
azp is
|
|
None), "azp must only be provided for asymmetric quantization."
|
|
ixf_F.static_scaled_int8_quant(output, input, scale)
|
|
return output, scale, None
|
|
|
|
# dynamic-per-token quantization.
|
|
input_scales = torch.empty((input.numel() // input.shape[-1], 1),
|
|
device=input.device,
|
|
dtype=torch.float32)
|
|
input_azp = None if symmetric else torch.empty_like(input_scales,
|
|
dtype=torch.int32)
|
|
ixf_F.dynamic_scaled_int8_quant(output, input, input_scales)
|
|
return output, input_scales, input_azp
|
|
|
|
|
|
# qqq ops
|
|
def marlin_qqq_gemm(a: torch.Tensor, b_q_weight: torch.Tensor,
|
|
s_tok: torch.Tensor, s_ch: torch.Tensor,
|
|
s_group: torch.Tensor, workspace: torch.Tensor,
|
|
size_m: int, size_n: int, size_k: int) -> torch.Tensor:
|
|
raise NotImplementedError()
|
|
|
|
|
|
# gguf
|
|
def ggml_dequantize(W: torch.Tensor, quant_type: int, m: int,
|
|
n: int) -> torch.Tensor:
|
|
raise NotImplementedError()
|
|
|
|
|
|
def ggml_mul_mat_vec_a8(
|
|
W: torch.Tensor,
|
|
X: torch.Tensor,
|
|
quant_type: int,
|
|
row: int,
|
|
) -> torch.Tensor:
|
|
raise NotImplementedError()
|
|
|
|
|
|
def ggml_mul_mat_a8(
|
|
W: torch.Tensor,
|
|
X: torch.Tensor,
|
|
quant_type: int,
|
|
row: int,
|
|
) -> torch.Tensor:
|
|
raise NotImplementedError()
|
|
|
|
|
|
# mamba
|
|
def causal_conv1d_fwd(x: torch.Tensor, weight: torch.Tensor,
|
|
bias_: Optional[torch.Tensor],
|
|
conv_states: Optional[torch.Tensor],
|
|
query_start_loc: Optional[torch.Tensor],
|
|
cache_indices: Optional[torch.Tensor],
|
|
has_initial_state: Optional[torch.Tensor],
|
|
silu_activation: bool) -> torch.Tensor:
|
|
raise NotImplementedError()
|
|
|
|
|
|
def causal_conv1d_update(
|
|
x: torch.Tensor, conv_state: torch.Tensor, weight: torch.Tensor,
|
|
bias_: Optional[torch.Tensor], silu_activation: bool,
|
|
cache_seqlens: Optional[torch.Tensor],
|
|
conv_state_indices: Optional[torch.Tensor]) -> torch.Tensor:
|
|
raise NotImplementedError()
|
|
|
|
|
|
def selective_scan_fwd(
|
|
u: torch.Tensor, delta: torch.Tensor, A: torch.Tensor, B: torch.Tensor,
|
|
C: torch.Tensor, D_: Optional[torch.Tensor],
|
|
z_: Optional[torch.Tensor], delta_bias_: Optional[torch.Tensor],
|
|
delta_softplus: bool, query_start_loc: Optional[torch.Tensor],
|
|
cache_indices: Optional[torch.Tensor],
|
|
has_initial_state: Optional[torch.Tensor], ssm_states: torch.Tensor):
|
|
raise NotImplementedError()
|
|
|
|
|
|
# moe
|
|
def moe_align_block_size(topk_ids: torch.Tensor, num_experts: int,
|
|
block_size: int, sorted_token_ids: torch.Tensor,
|
|
experts_ids: torch.Tensor,
|
|
num_tokens_post_pad: torch.Tensor) -> None:
|
|
ixf_F.vllm_moe_align_block_size(topk_ids, num_experts, block_size,
|
|
sorted_token_ids, experts_ids,
|
|
num_tokens_post_pad)
|
|
|
|
|
|
def invoke_fused_moe_kernel(
|
|
A: torch.Tensor,
|
|
B: torch.Tensor,
|
|
C: torch.Tensor,
|
|
A_scale: Optional[torch.Tensor],
|
|
B_scale: Optional[torch.Tensor],
|
|
topk_weights: torch.Tensor,
|
|
topk_ids: torch.Tensor,
|
|
sorted_token_ids: torch.Tensor,
|
|
expert_ids: torch.Tensor,
|
|
num_tokens_post_padded: torch.Tensor,
|
|
mul_routed_weight: bool,
|
|
top_k: int,
|
|
config: Dict[str, Any],
|
|
compute_type,
|
|
use_fp8_w8a8: bool,
|
|
use_int8_w8a16: bool,
|
|
) -> None:
|
|
ixf_F.vllm_invoke_fused_moe_kernel(
|
|
A,
|
|
B,
|
|
C,
|
|
topk_weights,
|
|
topk_ids,
|
|
sorted_token_ids,
|
|
expert_ids,
|
|
num_tokens_post_padded,
|
|
mul_routed_weight,
|
|
top_k,
|
|
config['BLOCK_SIZE_M']
|
|
)
|
|
|
|
|
|
def topk_softmax(topk_weights: torch.Tensor, topk_ids: torch.Tensor,
|
|
token_expert_indicies: torch.Tensor,
|
|
gating_output: float) -> None:
|
|
# CCCL policy_selector degradation: when one kernel in the chain is
|
|
# unavailable, replace ONLY that kernel with PyTorch while keeping the
|
|
# downstream native kernels (moe_align_block_size, invoke_fused_moe_kernel).
|
|
# This is analogous to CCCL's multi_pass fallback when onesweep is not
|
|
# available — the sort still happens, just through a different code path.
|
|
try:
|
|
ixf_F.vllm_moe_topk_softmax(topk_weights, topk_ids,
|
|
token_expert_indicies, gating_output)
|
|
except (AttributeError, RuntimeError):
|
|
# PyTorch fallback: softmax → topk → write in-place
|
|
# gating_output is already float32 (cast at call site)
|
|
if isinstance(gating_output, torch.Tensor):
|
|
probs = torch.softmax(gating_output, dim=-1)
|
|
else:
|
|
probs = torch.softmax(gating_output, dim=-1)
|
|
topk = topk_weights.shape[1]
|
|
tw, ti = torch.topk(probs, topk, dim=-1)
|
|
topk_weights.copy_(tw)
|
|
topk_ids.copy_(ti.to(topk_ids.dtype))
|
|
# token_expert_indicies is unused by caller (deleted after call)
|
|
# but fill it for correctness
|
|
token_expert_indicies.copy_(
|
|
torch.arange(topk, device=topk_ids.device, dtype=topk_ids.dtype)
|
|
.unsqueeze(0).expand_as(topk_ids))
|
|
|
|
|
|
if supports_moe_ops and hasattr(torch.ops._moe_C, "marlin_gemm_moe"):
|
|
|
|
@register_fake("_moe_C::marlin_gemm_moe")
|
|
def marlin_gemm_moe_fake(a: torch.Tensor, b_q_weights: torch.Tensor,
|
|
sorted_ids: torch.Tensor,
|
|
topk_weights: torch.Tensor,
|
|
topk_ids: torch.Tensor, b_scales: torch.Tensor,
|
|
b_zero_points: torch.Tensor, g_idx: torch.Tensor,
|
|
perm: torch.Tensor, workspace: torch.Tensor,
|
|
b_q_type: ScalarType, size_m: int, size_n: int,
|
|
size_k: int, is_k_full: bool, num_experts: int,
|
|
topk: int, moe_block_size: int,
|
|
replicate_input: bool,
|
|
apply_weights: bool) -> torch.Tensor:
|
|
return torch.empty((size_m, topk, size_n),
|
|
dtype=a.dtype,
|
|
device=a.device)
|
|
|
|
|
|
def reshape_and_cache(
|
|
key: torch.Tensor,
|
|
value: torch.Tensor,
|
|
key_cache: torch.Tensor,
|
|
value_cache: torch.Tensor,
|
|
slot_mapping: torch.Tensor,
|
|
kv_cache_dtype: str,
|
|
k_scale: float,
|
|
v_scale: float,
|
|
) -> None:
|
|
slot_mapping = slot_mapping.to(torch.int32)
|
|
ixf_F.vllm_cache_ops_reshape_and_cache(key, value, key_cache,
|
|
value_cache, slot_mapping)
|
|
|
|
|
|
def reshape_and_cache_flash(
|
|
key: torch.Tensor,
|
|
value: torch.Tensor,
|
|
key_cache: torch.Tensor,
|
|
value_cache: torch.Tensor,
|
|
slot_mapping: torch.Tensor,
|
|
kv_cache_dtype: str,
|
|
k_scale: float,
|
|
v_scale: float,
|
|
) -> None:
|
|
ixf_F.reshape_and_cache_flash(key, value, key_cache,
|
|
value_cache, slot_mapping,
|
|
kv_cache_dtype, k_scale,
|
|
v_scale)
|
|
|
|
def reshape_and_cache_flashinfer(
|
|
key: torch.Tensor,
|
|
value: torch.Tensor,
|
|
key_cache: torch.Tensor,
|
|
value_cache: torch.Tensor,
|
|
slot_mapping: torch.Tensor,
|
|
kv_cache_dtype: str,
|
|
k_scale: float, # for fp8
|
|
v_scale: float, # for fp8
|
|
kv_cache_format: str = "NHD",
|
|
key_cache_scales: torch.Tensor = None, # for int8
|
|
value_cache_scales: torch.Tensor = None, # for int8
|
|
) -> None:
|
|
ixf_F.paged_attention_cache_appended(
|
|
key,
|
|
value,
|
|
key_cache,
|
|
value_cache,
|
|
slot_mapping,
|
|
kv_cache_format,
|
|
key_cache_scales,
|
|
value_cache_scales,
|
|
)
|
|
|
|
def copy_blocks(key_caches: List[torch.Tensor],
|
|
value_caches: List[torch.Tensor],
|
|
block_mapping: torch.Tensor) -> None:
|
|
ixf_F.copy_blocks(key_caches, value_caches, block_mapping)
|
|
|
|
|
|
def swap_blocks(src: torch.Tensor, dst: torch.Tensor,
|
|
block_mapping: torch.Tensor) -> None:
|
|
ixf_F.swap_blocks(src, dst, block_mapping)
|
|
|
|
|
|
def convert_fp8(output: torch.Tensor,
|
|
input: torch.Tensor,
|
|
scale: float = 1.0,
|
|
kv_dtype: str = "fp8") -> None:
|
|
raise NotImplementedError()
|
|
|
|
|
|
def get_device_attribute(attribute: int, device: int) -> int:
|
|
raise NotImplementedError()
|
|
|
|
|
|
def get_max_shared_memory_per_block_device_attribute(device: int) -> int:
|
|
# BI-V100 SMEM = 49152 bytes (48KB), confirmed via ixsmi
|
|
# Was incorrectly hardcoded to 32KB (32768), limiting Triton tile sizes
|
|
# and potentially constraining ixformer internal SMEM allocation.
|
|
return 49152
|
|
|
|
|
|
# custom ar
|
|
def init_custom_ar(meta: torch.Tensor, rank_data: torch.Tensor,
|
|
handles: List[str], offsets: List[int], rank: int,
|
|
full_nvlink: bool) -> int:
|
|
raise NotImplementedError()
|
|
|
|
|
|
def should_custom_ar(inp: torch.Tensor, max_size: int, world_size: int,
|
|
full_nvlink: bool) -> bool:
|
|
raise NotImplementedError()
|
|
|
|
|
|
def all_reduce_reg(fa: int, inp: torch.Tensor, out: torch.Tensor) -> None:
|
|
raise NotImplementedError()
|
|
|
|
|
|
def all_reduce_unreg(fa: int, inp: torch.Tensor, reg_buffer: torch.Tensor,
|
|
out: torch.Tensor) -> None:
|
|
raise NotImplementedError()
|
|
|
|
|
|
def dispose(fa: int) -> None:
|
|
raise NotImplementedError()
|
|
|
|
|
|
def meta_size() -> int:
|
|
raise NotImplementedError()
|
|
|
|
|
|
def register_buffer(fa: int, t: torch.Tensor, handles: List[str],
|
|
offsets: List[int]) -> None:
|
|
raise NotImplementedError()
|
|
|
|
|
|
def get_graph_buffer_ipc_meta(fa: int) -> Tuple[List[str], List[int]]:
|
|
raise NotImplementedError()
|
|
|
|
|
|
def register_graph_buffers(fa: int, handles: List[str],
|
|
offsets: List[List[int]]) -> None:
|
|
raise NotImplementedError()
|
|
|
|
|
|
# Add our new features here..
|
|
|
|
# broadcast
|
|
class Async_helper():
|
|
# For now, the comm and the other kernels are in the same stream, so we can remove the stream wait..
|
|
def wait(self,):
|
|
return True
|
|
|
|
|
|
def broadcast(tensor, src=0, group=None, async_op=False):
|
|
cdist.broadcast(tensor,src,group,async_op=True)
|
|
if async_op:
|
|
return Async_helper()
|
|
else:
|
|
pass
|
|
|
|
# w8a16
|
|
def linear_w8a16(x: torch.Tensor, qweight: torch.Tensor, scales:torch.Tensor,
|
|
group_size: int = -1, format: str = "TN")-> torch.Tensor:
|
|
return ixf_F.w8a16(x, qweight, scales, format="TN", group_size=group_size)
|
|
|
|
|
|
## lora sgmv / bgmv
|
|
def sbgmv_expand(x: torch.Tensor,
|
|
w_t_all: torch.Tensor,
|
|
y: torch.Tensor,
|
|
b_seq_start_loc: torch.Tensor = None,
|
|
seq_len_tensor: torch.Tensor = None,
|
|
lora_indices_tensor: torch.Tensor = None,
|
|
batches: int = -1,
|
|
max_seq_length: int = -1,
|
|
token_nums: int = -1,
|
|
add_input=True,
|
|
):
|
|
'''
|
|
x: inputs
|
|
w_t_all: lora weight
|
|
y: output
|
|
|
|
y += x@wt_t_all
|
|
'''
|
|
assert x.dtype in [torch.float16, torch.bfloat16, torch.float32]
|
|
assert w_t_all.dtype in [
|
|
torch.float16,
|
|
torch.bfloat16,
|
|
]
|
|
|
|
assert x.is_contiguous()
|
|
# assert y.is_contiguous()
|
|
if x.dtype == torch.float:
|
|
x = x.to(w_t_all.dtype)
|
|
|
|
if w_t_all.ndim == 4: # shape:(lora_num,1,size,rank)
|
|
assert w_t_all.size(1) == 1
|
|
w_t_all = w_t_all.squeeze(dim=1)
|
|
else:
|
|
assert w_t_all.ndim == 3 # shape:(lora_num,size,rank)
|
|
assert w_t_all.is_contiguous()
|
|
|
|
assert add_input == True
|
|
|
|
lora_indices = lora_indices_tensor.cpu().tolist()
|
|
lora_num = w_t_all.shape[0]
|
|
|
|
## 单一lora model, 且所有request均使用lora
|
|
if lora_num == 1 and all(x == lora_indices[0] for x in lora_indices):
|
|
if lora_indices[0] != -1:
|
|
w_t = w_t_all[0]
|
|
y += torch.matmul(x, w_t.t())
|
|
## 多个lora model
|
|
else:
|
|
## prefill
|
|
if batches != -1:
|
|
for i, lora_id, start, seq_len in zip(range(batches), lora_indices, b_seq_start_loc, seq_len_tensor):
|
|
if lora_id != -1:
|
|
xi = x[start: start+seq_len]
|
|
w_t = w_t_all[lora_id]
|
|
y[start:start+seq_len] += (xi @ w_t.t())
|
|
## decode
|
|
else:
|
|
batches = x.shape[0]
|
|
for i, lora_id in zip(range(batches), lora_indices):
|
|
if lora_id != -1:
|
|
xi = x[i].unsqueeze(0)
|
|
w_t = w_t_all[lora_id]
|
|
y[i] += (xi @ w_t.t()).squeeze(0)
|
|
|
|
return y
|
|
|
|
|
|
def sbgmv_shrink(x: torch.Tensor,
|
|
w_t_all: torch.Tensor,
|
|
y: torch.Tensor,
|
|
b_seq_start_loc: torch.Tensor = None,
|
|
seq_len_tensor: torch.Tensor = None,
|
|
lora_indices_tensor: torch.Tensor = None,
|
|
batches: int = -1,
|
|
max_seq_length: int = -1,
|
|
token_nums: int = -1,
|
|
scale: float = 1.0,):
|
|
"""
|
|
xx: inputs
|
|
w_t_all: lora weight
|
|
y: output
|
|
scale: float
|
|
|
|
y = x@w_t_all * scale
|
|
"""
|
|
assert x.dtype == w_t_all.dtype
|
|
assert x.dtype in [torch.float16, torch.bfloat16]
|
|
assert x.is_contiguous()
|
|
assert y.is_contiguous()
|
|
|
|
if w_t_all.ndim == 4: # shape:(lora_num,1,size,rank)
|
|
assert w_t_all.size(1) == 1
|
|
w_t_all = w_t_all.squeeze(dim=1)
|
|
else:
|
|
assert w_t_all.ndim == 3 # shape:(lora_num,size,rank)
|
|
assert w_t_all.is_contiguous()
|
|
|
|
lora_num = w_t_all.shape[0]
|
|
lora_indices = lora_indices_tensor.cpu().tolist()
|
|
|
|
## 单一lora model, 且所有request均使用lora
|
|
if lora_num == 1 and all(x == lora_indices[0] for x in lora_indices):
|
|
if lora_indices[0] != -1:
|
|
w_t = w_t_all[0]
|
|
y = torch.matmul(x, w_t.t()) * scale
|
|
## 多个lora model
|
|
else:
|
|
## prefill
|
|
if batches != -1:
|
|
for i, lora_id, start, seq_len in zip(range(batches), lora_indices, b_seq_start_loc, seq_len_tensor):
|
|
if lora_id != -1:
|
|
xi = x[start: start+seq_len]
|
|
w_t = w_t_all[lora_id]
|
|
y[start:start+seq_len] = (xi @ w_t.t())* scale
|
|
## decode
|
|
else:
|
|
batches = x.shape[0]
|
|
for i, lora_id in zip(range(batches), lora_indices):
|
|
if lora_id != -1:
|
|
xi = x[i].unsqueeze(0)
|
|
w_t = w_t_all[lora_id]
|
|
y[i] = (xi @ w_t.t()).squeeze(0) * scale
|
|
|
|
return y
|
|
|
|
# temporary fix for https://github.com/vllm-project/vllm/issues/5456
|
|
# TODO: remove this in v0.6.0
|
|
names_and_values = globals()
|
|
names_and_values_to_update = {}
|
|
# prepare variables to avoid dict size change during iteration
|
|
k, v, arg = None, None, None
|
|
fn_type = type(lambda x: x)
|
|
for k, v in names_and_values.items():
|
|
# find functions that are defined in this file and have torch.Tensor
|
|
# in their annotations. `arg == "torch.Tensor"` is used to handle
|
|
# the case when users use `import __annotations__` to turn type
|
|
# hints into strings.
|
|
if isinstance(v, fn_type) \
|
|
and v.__code__.co_filename == __file__ \
|
|
and any(arg is torch.Tensor or arg == "torch.Tensor"
|
|
for arg in v.__annotations__.values()):
|
|
names_and_values_to_update[k] = hint_on_error(v)
|
|
|
|
names_and_values.update(names_and_values_to_update)
|
|
del names_and_values_to_update, names_and_values, v, k, fn_type |