Co-authored-by: drproduck <drproduck@MacBook-Air-2.local> Co-authored-by: BBuf <1182563586@qq.com>
419 lines
18 KiB
Python
419 lines
18 KiB
Python
from __future__ import annotations
|
|
|
|
import dataclasses
|
|
import logging
|
|
import re
|
|
from dataclasses import dataclass
|
|
from typing import TYPE_CHECKING, Any, List, Optional, Union
|
|
|
|
import msgspec
|
|
import torch
|
|
|
|
from sglang.srt.constants import HEALTH_CHECK_RID_PREFIX
|
|
from sglang.srt.eplb.expert_distribution import ExpertDistributionMetrics
|
|
from sglang.srt.layers.logits_processor import LogitsProcessorOutput
|
|
from sglang.srt.managers import io_struct
|
|
from sglang.srt.managers.schedule_batch import Req
|
|
from sglang.srt.model_executor.forward_batch_info import PPProxyTensors
|
|
from sglang.srt.runtime_context import get_spec, max_speculative_num_draft_tokens
|
|
from sglang.srt.speculative.spec_info import SpeculativeAlgorithm
|
|
from sglang.srt.state_capturer.base import TopkCaptureOutput
|
|
|
|
if TYPE_CHECKING:
|
|
from sglang.srt.managers.scheduler import GenerationBatchResult
|
|
from sglang.srt.sampling.sampling_observer import HostAuxiliaryOutput
|
|
from sglang.srt.speculative.spec_info import SpecInput
|
|
|
|
|
|
logger = logging.getLogger(__name__)
|
|
|
|
|
|
def _async_d2h(t: torch.Tensor) -> torch.Tensor:
|
|
"""Async D2H copy for overlap scheduling. On CUDA the dest is pinned (a D2H
|
|
to pageable host memory blocks the caller until done) and record_stream keeps
|
|
the source alive until the copy stream drains, so the caching allocator can't
|
|
recycle it early. Non-CUDA falls back to a plain copy."""
|
|
if not t.is_cuda:
|
|
return t.to("cpu", non_blocking=True)
|
|
cpu_t = torch.empty(t.shape, dtype=t.dtype, pin_memory=True)
|
|
cpu_t.copy_(t, non_blocking=True)
|
|
t.record_stream(torch.cuda.current_stream(t.device))
|
|
return cpu_t
|
|
|
|
|
|
@dataclasses.dataclass
|
|
class GenerationBatchResult:
|
|
logits_output: Optional[LogitsProcessorOutput] = None
|
|
pp_hidden_states_proxy_tensors: Optional[PPProxyTensors] = None
|
|
next_token_ids: Optional[
|
|
Union[torch.Tensor, List[torch.Tensor], List[List[int]]]
|
|
] = None
|
|
num_correct_drafts: int = 0 # no bonus included
|
|
num_correct_drafts_per_req_cpu: Optional[List[int]] = None
|
|
num_block_accept_tokens: int = 0
|
|
num_cap_tokens: int = 0
|
|
# FDFO dLLM batching: per-request accepted block length and carried algo state.
|
|
accept_length_per_req_cpu: Optional[List[int]] = None
|
|
dllm_algo_state: Optional[List[Any]] = None
|
|
can_run_cuda_graph: bool = False
|
|
|
|
# PP skip output comm: True when output send/recv was skipped and
|
|
# next_token_ids are placeholder zeros. Used by process_batch_result_prefill
|
|
# to validate that skipped output is never consumed.
|
|
skipped_output_comm: bool = False
|
|
|
|
# For output processing
|
|
extend_input_len_per_req: Optional[List[int]] = None
|
|
extend_logprob_start_len_per_req: Optional[List[int]] = None
|
|
|
|
# For overlap scheduling
|
|
copy_done: Optional[torch.cuda.Event] = None
|
|
delay_sample_func: Optional[callable] = None
|
|
future_indices: Optional[torch.Tensor] = None
|
|
speculative_num_draft_tokens: Optional[int] = None
|
|
# Padded row width in flattened speculative output. Existing algorithms
|
|
# default to speculative_num_draft_tokens; linear UNO emits F + 1 columns.
|
|
speculative_output_stride: Optional[int] = None
|
|
# Valid output tokens that are not accepted draft proposals. Existing
|
|
# algorithms have one bonus token; UNO also emits its clean root.
|
|
num_non_draft_tokens_per_req: int = 1
|
|
|
|
# Grammar FSM advance memoization (spec-v2 overlap). advance_grammar_fsm sets
|
|
# these once — eagerly via the scheduler's grammar barrier inside verify(), or
|
|
# lazily in _resolve_spec_v2_tokens — and the latter consumes
|
|
# grammar_retained_tokens instead of re-advancing the FSM.
|
|
grammar_advanced: bool = False
|
|
grammar_retained_tokens: Optional[list] = None
|
|
|
|
# FIXME(lsyin): maybe move to a better place?
|
|
# sync path: forward stream -> output processor
|
|
accept_lens: Optional[torch.Tensor] = None
|
|
|
|
block_accept_lens: Optional[torch.Tensor] = None
|
|
|
|
cap_lens: Optional[torch.Tensor] = None
|
|
|
|
# Next-iter seq_lens; published via on_publish.
|
|
new_seq_lens: Optional[torch.Tensor] = None
|
|
|
|
# relay path: forward stream -> next step forward
|
|
next_draft_input: Optional[SpecInput] = None
|
|
|
|
# Refs the worker wants scheduler to keep alive for the same 2-iter window
|
|
# as batch_record_buf. Used for cross-stream tensor lifetime (e.g. a spec
|
|
# V2 verify ForwardBatch whose tensors must outlive mid-iter SB rebinds).
|
|
extra_keep_alive_refs: Optional[List[Any]] = None
|
|
|
|
# Routed experts: pending async D2H for overlap scheduling
|
|
routed_experts_output: Optional[TopkCaptureOutput] = None
|
|
indexer_topk_output: Optional[TopkCaptureOutput] = None
|
|
|
|
# metrics
|
|
expert_distribution_metrics: Optional[ExpertDistributionMetrics] = None
|
|
|
|
# Forward pass metrics (FPM) — GPU-accurate timing via CUDA events
|
|
fpm_start_event: Optional[torch.cuda.Event] = None
|
|
fpm_end_event: Optional[torch.cuda.Event] = None
|
|
|
|
auxiliary_host_output: Optional[HostAuxiliaryOutput] = None
|
|
|
|
@property
|
|
def has_sampled_token_ids(self) -> bool:
|
|
"""True when this iter sampled token ids; False when none were produced
|
|
this rank/split (a non-last PP rank or a non-final prefill split)."""
|
|
return isinstance(self.next_token_ids, torch.Tensor)
|
|
|
|
def get_num_generated_tokens(self, batch_size: int) -> int:
|
|
return self.num_correct_drafts + batch_size * self.num_non_draft_tokens_per_req
|
|
|
|
@torch.profiler.record_function("copy_result_to_cpu")
|
|
def copy_to_cpu(self, return_logprob: bool, return_hidden_states: bool = True):
|
|
"""Copy tensors to CPU in overlap scheduling.
|
|
Only the tensors which are needed for processing results are copied,
|
|
e.g., next_token_ids, logits outputs
|
|
"""
|
|
if return_logprob:
|
|
if self.logits_output.next_token_logprobs is not None:
|
|
self.logits_output.next_token_logprobs = _async_d2h(
|
|
self.logits_output.next_token_logprobs
|
|
)
|
|
if self.logits_output.input_token_logprobs is not None:
|
|
self.logits_output.input_token_logprobs = _async_d2h(
|
|
self.logits_output.input_token_logprobs
|
|
)
|
|
if self.logits_output.next_token_top_logprobs_val is not None:
|
|
self.logits_output.next_token_top_logprobs_val = [
|
|
_async_d2h(v) if torch.is_tensor(v) else v
|
|
for v in self.logits_output.next_token_top_logprobs_val
|
|
]
|
|
if self.logits_output.next_token_top_logprobs_idx is not None:
|
|
self.logits_output.next_token_top_logprobs_idx = [
|
|
_async_d2h(x) if torch.is_tensor(x) else x
|
|
for x in self.logits_output.next_token_top_logprobs_idx
|
|
]
|
|
if self.logits_output.next_token_token_ids_logprobs_val is not None:
|
|
self.logits_output.next_token_token_ids_logprobs_val = [
|
|
_async_d2h(v) if torch.is_tensor(v) else v
|
|
for v in self.logits_output.next_token_token_ids_logprobs_val
|
|
]
|
|
if return_hidden_states and self.logits_output.hidden_states is not None:
|
|
self.logits_output.hidden_states = _async_d2h(
|
|
self.logits_output.hidden_states
|
|
)
|
|
self.next_token_ids = _async_d2h(self.next_token_ids)
|
|
|
|
if self.accept_lens is not None:
|
|
self.accept_lens = _async_d2h(self.accept_lens)
|
|
|
|
if self.block_accept_lens is not None:
|
|
self.block_accept_lens = _async_d2h(self.block_accept_lens)
|
|
|
|
if self.cap_lens is not None:
|
|
self.cap_lens = _async_d2h(self.cap_lens)
|
|
|
|
# Sub-objects only declare their device fields; the single copy+safety
|
|
# primitive (_async_d2h: pinned D2H + record_stream) is injected here so
|
|
# all device->host copying and lifetime safety lives in one place.
|
|
for holder in (
|
|
self.routed_experts_output,
|
|
self.indexer_topk_output,
|
|
self.expert_distribution_metrics,
|
|
):
|
|
if holder is not None:
|
|
holder.map_device_tensors(_async_d2h)
|
|
|
|
self.copy_auxiliary_output_to_cpu()
|
|
|
|
self.copy_done.record()
|
|
|
|
def copy_auxiliary_output_to_cpu(self) -> None:
|
|
if self.logits_output is None or self.auxiliary_host_output is not None:
|
|
return
|
|
device_output = self.logits_output.auxiliary_device_output
|
|
if device_output is not None:
|
|
self.auxiliary_host_output = device_output.copy_to_host(_async_d2h)
|
|
self.logits_output.auxiliary_device_output = None
|
|
|
|
@classmethod
|
|
def from_pp_proxy(
|
|
cls, logits_output, next_pp_outputs: PPProxyTensors, can_run_cuda_graph
|
|
):
|
|
# TODO(lsyin): refactor PP and avoid using dict
|
|
proxy_dict = next_pp_outputs.tensors
|
|
return cls(
|
|
logits_output=logits_output,
|
|
pp_hidden_states_proxy_tensors=None,
|
|
next_token_ids=next_pp_outputs["next_token_ids"],
|
|
extend_input_len_per_req=proxy_dict.get("extend_input_len_per_req", None),
|
|
extend_logprob_start_len_per_req=proxy_dict.get(
|
|
"extend_logprob_start_len_per_req", None
|
|
),
|
|
can_run_cuda_graph=can_run_cuda_graph,
|
|
)
|
|
|
|
|
|
def validate_input_length(
|
|
req: Req, max_req_input_len: int, allow_auto_truncate: bool
|
|
) -> Optional[str]:
|
|
"""Validate and potentially truncate input length.
|
|
|
|
Args:
|
|
req: The request containing input_ids to validate
|
|
max_req_input_len: Maximum allowed input length
|
|
allow_auto_truncate: Whether to truncate long inputs
|
|
|
|
Returns:
|
|
Error message if validation fails, None if successful
|
|
"""
|
|
if len(req.origin_input_ids) >= max_req_input_len:
|
|
if allow_auto_truncate:
|
|
logger.warning(
|
|
"Request length is longer than the KV cache pool size or "
|
|
"the max context length. Truncated. "
|
|
f"{len(req.origin_input_ids)=}, {max_req_input_len=}."
|
|
)
|
|
req.origin_input_ids = req.origin_input_ids[:max_req_input_len]
|
|
return None
|
|
else:
|
|
error_msg = (
|
|
f"Input length ({len(req.origin_input_ids)} tokens) exceeds "
|
|
f"the maximum allowed length ({max_req_input_len} tokens). "
|
|
f"Use a shorter input or enable --allow-auto-truncate."
|
|
)
|
|
return error_msg
|
|
|
|
return None
|
|
|
|
|
|
def get_logprob_dict_from_result(result: GenerationBatchResult) -> dict:
|
|
|
|
logits_output = result.logits_output
|
|
assert logits_output is not None
|
|
|
|
return {
|
|
"extend_input_len_per_req": result.extend_input_len_per_req,
|
|
"extend_logprob_start_len_per_req": result.extend_logprob_start_len_per_req,
|
|
"next_token_logprobs": result.logits_output.next_token_logprobs,
|
|
"next_token_top_logprobs_val": result.logits_output.next_token_top_logprobs_val,
|
|
"next_token_top_logprobs_idx": result.logits_output.next_token_top_logprobs_idx,
|
|
"next_token_token_ids_logprobs_val": result.logits_output.next_token_token_ids_logprobs_val,
|
|
"next_token_token_ids_logprobs_idx": result.logits_output.next_token_token_ids_logprobs_idx,
|
|
"next_token_sampling_mask_idx": result.logits_output.next_token_sampling_mask_idx,
|
|
"next_token_sampling_logprobs": result.logits_output.next_token_sampling_logprobs,
|
|
"input_token_logprobs": result.logits_output.input_token_logprobs,
|
|
"input_top_logprobs_val": result.logits_output.input_top_logprobs_val,
|
|
"input_top_logprobs_idx": result.logits_output.input_top_logprobs_idx,
|
|
"input_token_ids_logprobs_val": result.logits_output.input_token_ids_logprobs_val,
|
|
"input_token_ids_logprobs_idx": result.logits_output.input_token_ids_logprobs_idx,
|
|
}
|
|
|
|
|
|
def get_logprob_from_pp_outputs(
|
|
next_pp_outputs: PPProxyTensors,
|
|
) -> tuple[LogitsProcessorOutput, list[int], list[int]]:
|
|
logits_output = LogitsProcessorOutput(
|
|
# Do not send logits and hidden states because they are large
|
|
next_token_logits=None,
|
|
hidden_states=None,
|
|
next_token_logprobs=next_pp_outputs["next_token_logprobs"],
|
|
next_token_top_logprobs_val=next_pp_outputs["next_token_top_logprobs_val"],
|
|
next_token_top_logprobs_idx=next_pp_outputs["next_token_top_logprobs_idx"],
|
|
next_token_token_ids_logprobs_val=next_pp_outputs[
|
|
"next_token_token_ids_logprobs_val"
|
|
],
|
|
next_token_token_ids_logprobs_idx=next_pp_outputs[
|
|
"next_token_token_ids_logprobs_idx"
|
|
],
|
|
next_token_sampling_mask_idx=next_pp_outputs["next_token_sampling_mask_idx"],
|
|
next_token_sampling_logprobs=next_pp_outputs["next_token_sampling_logprobs"],
|
|
input_token_logprobs=next_pp_outputs["input_token_logprobs"],
|
|
input_top_logprobs_val=next_pp_outputs["input_top_logprobs_val"],
|
|
input_top_logprobs_idx=next_pp_outputs["input_top_logprobs_idx"],
|
|
input_token_ids_logprobs_val=next_pp_outputs["input_token_ids_logprobs_val"],
|
|
input_token_ids_logprobs_idx=next_pp_outputs["input_token_ids_logprobs_idx"],
|
|
)
|
|
extend_input_len_per_req = next_pp_outputs["extend_input_len_per_req"]
|
|
extend_logprob_start_len_per_req = next_pp_outputs[
|
|
"extend_logprob_start_len_per_req"
|
|
]
|
|
|
|
return logits_output, extend_input_len_per_req, extend_logprob_start_len_per_req
|
|
|
|
|
|
@dataclass
|
|
class EmbeddingBatchResult:
|
|
"""Result from an embedding/classification forward pass.
|
|
|
|
Attributes:
|
|
embeddings: Model output — pooled embeddings or classification logits.
|
|
pooled_hidden_states: Raw hidden states before the task head. Present
|
|
only when the batch contained ``return_pooled_hidden_states=True``
|
|
requests. Tensor (uniform shapes) or list of tensors (MIS).
|
|
copy_done: CUDA event recorded after the async CPU copy completes.
|
|
"""
|
|
|
|
embeddings: torch.Tensor
|
|
pooled_hidden_states: Optional[torch.Tensor] = None
|
|
copy_done: Optional[torch.cuda.Event] = None
|
|
can_run_cuda_graph: bool = False
|
|
|
|
@torch.profiler.record_function("copy_embedding_to_cpu")
|
|
def copy_to_cpu(self):
|
|
"""Copy embeddings and pooled hidden states to CPU for overlap scheduling."""
|
|
if isinstance(self.embeddings, torch.Tensor):
|
|
self.copy_done = torch.get_device_module(self.embeddings.device).Event()
|
|
self.embeddings = _async_d2h(self.embeddings)
|
|
else:
|
|
assert isinstance(self.embeddings, list)
|
|
if len(self.embeddings) == 0:
|
|
return
|
|
|
|
self.copy_done = torch.get_device_module(self.embeddings[0].device).Event()
|
|
self.embeddings = [_async_d2h(emb) for emb in self.embeddings]
|
|
|
|
if self.pooled_hidden_states is not None:
|
|
if isinstance(self.pooled_hidden_states, list):
|
|
self.pooled_hidden_states = [
|
|
_async_d2h(t) for t in self.pooled_hidden_states
|
|
]
|
|
else:
|
|
self.pooled_hidden_states = _async_d2h(self.pooled_hidden_states)
|
|
|
|
self.copy_done.record()
|
|
|
|
|
|
def is_health_check_generate_req(recv_req):
|
|
rid = getattr(recv_req, "rid", None)
|
|
return rid is not None and rid.startswith(HEALTH_CHECK_RID_PREFIX)
|
|
|
|
|
|
class MsgpackDecodeError(ValueError):
|
|
"""A msgpack frame the typed decoder rejected, with the failure explained:
|
|
``rid`` (when recoverable from the raw tagged array) and a human-readable
|
|
``reason`` whose leading ``$[<n>]`` array index is resolved to the struct
|
|
field name.
|
|
"""
|
|
|
|
def __init__(self, rid: Optional[str], reason: str):
|
|
super().__init__(reason)
|
|
self.rid = rid
|
|
self.reason = reason
|
|
|
|
|
|
def msgpack_decode_explained(data: bytes) -> Any:
|
|
"""`io_struct.msgpack_decode`, but a rejected frame raises
|
|
`MsgpackDecodeError` carrying the rid (recovered via an untyped re-decode of
|
|
the tagged array) and a reason with the failing field named — for callers
|
|
that must report the failure back to a client (e.g. the rust ingress)
|
|
instead of just crashing."""
|
|
# TODO: the hook_custom_types() currently only apply for unit tests, once it
|
|
# esclate to the main code, we can provide a function to access the _all_types
|
|
|
|
try:
|
|
return io_struct.msgpack_decode(data)
|
|
except Exception as e:
|
|
msg = str(e)
|
|
try:
|
|
arr = msgspec.msgpack.decode(data)
|
|
except Exception:
|
|
arr = None
|
|
if not (isinstance(arr, (list, tuple)) and arr):
|
|
raise MsgpackDecodeError(None, msg) from e
|
|
# Tagged array_like layout is [tag, *fields]; rid is the first field of
|
|
# every BaseReq struct.
|
|
rid = str(arr[1]) if len(arr) > 1 and arr[1] is not None else None
|
|
tag_to_fields = {
|
|
cls.__struct_config__.tag: cls.__struct_fields__
|
|
for cls in io_struct._all_types
|
|
if isinstance(cls, type) and issubclass(cls, msgspec.Struct)
|
|
}
|
|
fields = tag_to_fields.get(arr[0])
|
|
if fields is not None:
|
|
# Leading ``$[<n>]`` in a msgspec ValidationError path, e.g.
|
|
# ``$[12][0]``.
|
|
m = re.search(r"\$\[(\d+)\]", msg)
|
|
if m is not None:
|
|
idx = int(m.group(1))
|
|
if 1 <= idx <= len(fields):
|
|
msg = f"{msg[: m.start()]}$.{fields[idx - 1]}{msg[m.end() :]}"
|
|
raise MsgpackDecodeError(rid, msg) from e
|
|
|
|
|
|
def compute_num_reserved_tokens() -> int:
|
|
"""Output token slots reserved per request, on top of its input.
|
|
|
|
The current eagle implementation stores draft tokens in the output token
|
|
slots, so the context budget has to account for them; every other algorithm
|
|
reserves nothing. Shared by `TokenizerManager` and the rust server's
|
|
`server_args` handoff (`RustServer._build_server_args`), which needs the same
|
|
number to run the total-token check in Rust.
|
|
"""
|
|
spec = get_spec()
|
|
algorithm = SpeculativeAlgorithm.from_string(spec.speculative_algorithm)
|
|
if not algorithm.is_eagle():
|
|
return 0
|
|
return max(
|
|
spec.speculative_eagle_topk * spec.speculative_num_steps,
|
|
max_speculative_num_draft_tokens(),
|
|
)
|