clef / code /models /common /sampling /generator.py
tt-hous's picture
Add files using upload-large-folder tool
b025706 verified
Raw History Blame Contribute Delete
64.7 kB
# SPDX-FileCopyrightText: © 2025 Tenstorrent USA, Inc.
# SPDX-License-Identifier: Apache-2.0
import copy
import itertools
import random
import secrets
from dataclasses import dataclass, fields, replace
from typing import List, Optional
import torch
from loguru import logger
from ttnn.tools import trace_allocation_tracker
import ttnn
from ._utils import clamp, is_default_value, split_list
from .tt_penalties import TTPenalties
from .tt_sampling import TTSampling
MAX_UINT32 = 2**32 - 1
# MAX_UINT32 is reserved as the device skip sentinel; keep real seeds in a bounded positive range.
DEVICE_SEED_MAX = 1_000_000
_UINT64_MASK = (1 << 64) - 1
def _acknowledge_trace_buffers_corruptible(bucket, value):
"""Acknowledge bucketed trace I/O that another live trace may overwrite."""
if bucket is None or value is None:
return
if isinstance(value, (list, tuple)):
for item in value:
_acknowledge_trace_buffers_corruptible(bucket, item)
return
trace_allocation_tracker.acknowledge_corruptible(value)
def _hash_request_seed_to_device_seed(seed: int, counter: int, salt: int = 0) -> int:
"""Derive a stable per-token device seed from a request seed.
The device sampling op accepts bounded positive seeds, while vLLM
request seeds can be any integer and must be reproducible regardless
of batch slot. Hashing (request seed, token counter) gives each token
a deterministic but well-mixed device seed without relying on mutable
per-slot RNG state. The constants below are the SplitMix64 finalizer.
``salt`` separates concurrent requests that carry the same request seed
(e.g. n>1 completions of one prompt with a fixed seed): without it every
such request derives the identical device seed at the identical token
position and the completions come out byte-identical (#53077). A request
with a unique seed always has salt 0, so its stream is unchanged.
"""
value = (int(seed) & _UINT64_MASK) ^ ((int(counter) + 0x9E3779B97F4A7C15) & _UINT64_MASK)
value ^= (int(salt) * 0xD1B54A32D192ED03) & _UINT64_MASK
value = ((value ^ (value >> 30)) * 0xBF58476D1CE4E5B9) & _UINT64_MASK
value = ((value ^ (value >> 27)) * 0x94D049BB133111EB) & _UINT64_MASK
value = (value ^ (value >> 31)) & _UINT64_MASK
return (value % DEVICE_SEED_MAX) + 1
@dataclass(frozen=True)
class SamplingParams:
"""
Sampling parameters for on-device greedy decoding / sampling.
Used by Generator decode/prefill functions. vLLM has its own duck-type-compatible
TTSamplingParams (in vllm/worker/tt_model_runner.py) that works with the same
format_sampling_params / chunk_sampling_params functions.
"""
temperature: float | list[float]
top_k: int | list[int]
top_p: float | list[float]
presence_penalty: float | list[float] = 0.0
frequency_penalty: float | list[float] = 0.0
repetition_penalty: float | list[float] = 1.0
seed: int | list[int] | None = None
enable_log_probs: bool | list[bool] = False
num_logprobs: int | list[int] = 0
SAMPLING_PARAM_FIELDS = tuple(f.name for f in fields(SamplingParams))
@dataclass(frozen=True)
class _TraceKey:
penalties_on: bool
log_probs_on: bool
force_argmax: bool
bucket: int | None = None
# precompile(all_configs=True) enumerates every combination of the bool fields above. Derive the
# count so a new flag breaks the unpacking there instead of silently leaving its programs
# uncompiled -- which reopens TT_FATAL !is_capturing_trace on the first request needing it.
_TRACE_KEY_FLAGS = sum(f.type in (bool, "bool") for f in fields(_TraceKey))
class SamplingGenerator:
"""
High-level sampling helper that owns both `TTSampling` and `TTPenalties`
modules and optionally manages TTNN trace capture/execution for sampling.
Typical usage:
generator = SamplingGenerator(args=args, mesh_device=mesh_device, tt_ccl=tt_ccl)
generator.reset_sampling_params(k=..., p=..., temp=...)
tokens = generator.sample(logits, enable_trace=True)
"""
_DEFAULT_PENALTIES = {
"presence": 0.0,
"frequency": 0.0,
"repetition": 1.0,
}
def __init__(
self,
*,
args,
mesh_device,
tt_ccl,
cq_id: int = 0,
):
self.mesh_device = mesh_device
self.cq_id = cq_id
self.args = args
self.sub_core_grids = getattr(args, "sub_core_grids", None)
self.tt_sampling = TTSampling(mesh_device=mesh_device, tt_ccl=tt_ccl, args=args)
self.tt_penalties = TTPenalties(mesh_device=mesh_device, args=args)
self._penalties_active = False
self._trace_states: dict[_TraceKey, dict] = {}
self._active_trace_bucket = None
seed_batch_size = self.tt_sampling.max_batch_size * self.tt_sampling._sampling_dp
self.seed_manager = SeedManager(
self.tt_sampling,
max_batch_size=seed_batch_size,
salt_duplicate_seeds=getattr(args, "salt_duplicate_seeds", True),
)
self._slot_state_requires_authoritative_reload = False
def _new_trace_state(self):
return {"id": None, "input": None, "output": None, "kwargs": {}}
def set_trace_bucket(self, bucket: int | None):
"""Select the trace namespace for subsequent capture/replay. Callers that multiplex the
decode-output logits tensor per batch width (decode bucketing) set this to the width, so a
sampling trace captured at width B is only ever replayed against width-B logits."""
self._active_trace_bucket = bucket
def _trace_slot(self, penalties_on: bool, log_probs_on: bool, force_argmax: bool):
key = _TraceKey(
penalties_on=penalties_on,
log_probs_on=log_probs_on,
force_argmax=force_argmax,
bucket=self._active_trace_bucket,
)
slot = self._trace_states.get(key)
if slot is None:
slot = self._new_trace_state()
self._trace_states[key] = slot
return key, slot
def reset_trace(self):
"""
Drop any cached trace metadata for all sampling configurations and bucket widths.
"""
for key, slot in self._trace_states.items():
if slot["id"] is None:
continue
logger.debug(
f"Resetting sampling trace (bucket={key.bucket}, penalties={key.penalties_on}, log_probs={key.log_probs_on}, force_argmax={key.force_argmax}, trace_id={slot['id']})"
)
try:
ttnn.release_trace(self.mesh_device, slot["id"])
except Exception as e:
logger.warning(f"Failed to release trace {slot['id']} : {e}")
continue
self._trace_states.clear()
def reset_prompt_tokens(self, prompt_tokens, slots: list[int] | None = None):
if not self._penalties_active:
return
self.tt_penalties.reset_prompt_tokens(prompt_tokens, slots=slots)
def reset_output_state(self, tokens=None, slots: list[int] | None = None):
if not self._penalties_active:
return
self.tt_penalties.reset_output_tokens(tokens, slots=slots)
def apply_slot_remap(self, remap) -> None:
"""Move host RNG state and invalidate device state that cannot be permuted safely.
Sampling parameter and penalty buffers can be sharded across mesh rows, so a
scheduler remap is not necessarily a rank-local device gather. The next device
sampling step must rebuild those buffers from authoritative host state instead
of silently using rows that still belong to the old layout.
"""
remap = [int(slot) for slot in torch.as_tensor(remap).reshape(-1).tolist()]
expected_size = self.seed_manager.max_batch_size
if len(remap) != expected_size:
raise ValueError(f"Sampling slot remap has {len(remap)} entries; expected {expected_size}")
if any(slot < 0 or slot >= expected_size for slot in remap):
raise ValueError(f"Sampling slot remap must stay within [0, {expected_size}), got {remap}")
self.seed_manager.apply_slot_remap(remap)
if any(source != destination for destination, source in enumerate(remap)):
self._slot_state_requires_authoritative_reload = True
def validate_decode_state_commands(
self,
*,
reload_sampling_params: bool,
reset_sampling_state: bool,
) -> None:
if self._slot_state_requires_authoritative_reload and not (reload_sampling_params and reset_sampling_state):
raise ValueError(
"A non-identity slot remap invalidated device sampling parameters and penalty history; "
"the next device sampling step requires reload_sampling_params=True and reset_sampling_state=True"
)
def commit_decode_state_commands(
self,
*,
reload_sampling_params: bool,
reset_sampling_state: bool,
sampling_state_slots: list[int] | None,
) -> None:
"""Clear whole-device invalidation only after a whole-device rebuild."""
if reload_sampling_params and reset_sampling_state and sampling_state_slots is None:
self._slot_state_requires_authoritative_reload = False
# ---------------------------------------------------------------------
# Prefill / decode state helpers
# ---------------------------------------------------------------------
def apply_prefill_state(
self,
*,
sampling_params,
prompt_tokens: torch.Tensor | None,
empty_slots: list[int],
replicate_seeds: bool = True,
):
"""Prepare sampling state for a prefill request.
Resets params, seeds, prompt tokens, and output state in the correct order.
"""
self.reset_sampling_params(sampling_params, empty_slots=empty_slots)
seed = getattr(sampling_params, "seed", None)
# assert on condition that seed is not None
assert seed is not None, "sampling_params must be formatted (seed should be a list, not None)"
self.seed_manager.reset_seed(seed, empty_slots)
self.seed_manager.get_new_values(empty_slots, replicate_seeds=replicate_seeds)
if prompt_tokens is not None:
self.reset_prompt_tokens(prompt_tokens)
self.reset_output_state()
def apply_decode_state(
self,
sampling_params_chunks: list,
*,
reload_sampling_params: bool,
reset_sampling_state: bool,
prompt_tokens: torch.Tensor | None = None,
output_tokens: torch.Tensor | None = None,
sampling_state_slots: list[int] | None = None,
):
"""Apply the explicitly requested parts of decode sampling state.
Args:
sampling_params_chunks: List of SamplingParams assigned to this instance.
Length-1 for simple cases; >1 for row-sharded (sampling_dp > data_parallel).
reload_sampling_params: Upload temperature/top-k/top-p/etc.
reset_sampling_state: Rebuild prompt/output penalty state.
prompt_tokens: Prompt tokens for penalty tracking.
output_tokens: Output tokens for penalty tracking.
sampling_state_slots: If provided, reset penalty history only for
these device slots and preserve every other slot.
Does NOT call ``seed_manager.get_new_values()`` — callers manage seed
advancement separately since generators call it at different points.
"""
self.validate_decode_state_commands(
reload_sampling_params=reload_sampling_params,
reset_sampling_state=reset_sampling_state,
)
if reload_sampling_params:
chunks_per_model = len(sampling_params_chunks)
max_batch_size = self.tt_sampling.max_batch_size
if chunks_per_model == 1:
formatted_params = format_sampling_params(sampling_params_chunks[0], max_batch_size)
self.reset_sampling_params(formatted_params)
else:
# Row-sharded case: format each chunk to max_batch_size,
# concatenate, then upload one merged parameter set.
formatted_chunks = [format_sampling_params(chunk, max_batch_size) for chunk in sampling_params_chunks]
concat_fields = {}
for field in SAMPLING_PARAM_FIELDS:
lists = [getattr(fc, field) for fc in formatted_chunks]
if all(v is None for v in lists):
concat_fields[field] = None
else:
concat_fields[field] = sum(
(v if isinstance(v, list) else [v] for v in lists),
[],
)
formatted_params = SamplingParams(**concat_fields)
self.reset_sampling_params(formatted_params)
if reset_sampling_state:
self.reset_prompt_tokens(prompt_tokens, slots=sampling_state_slots)
self.reset_output_state(output_tokens, slots=sampling_state_slots)
self.commit_decode_state_commands(
reload_sampling_params=reload_sampling_params,
reset_sampling_state=reset_sampling_state,
sampling_state_slots=sampling_state_slots,
)
# ---------------------------------------------------------------------
# Sampling helpers
# ---------------------------------------------------------------------
def reset_sampling_params(self, sampling_params, empty_slots: list[int] | None = None):
old_force_argmax_sampling = self.tt_sampling.force_argmax_sampling
num_logprobs = getattr(sampling_params, "num_logprobs", None)
self.tt_sampling.reset_params(
k=sampling_params.top_k,
p=sampling_params.top_p,
temp=sampling_params.temperature,
enable_log_probs=sampling_params.enable_log_probs,
num_logprobs=num_logprobs,
empty_slots=empty_slots,
)
if self.tt_sampling.force_argmax_sampling != old_force_argmax_sampling:
self.reset_trace()
old_penalties_active = self._penalties_active
self._penalties_active = not (
is_default_value(sampling_params.presence_penalty, self._DEFAULT_PENALTIES["presence"])
and is_default_value(sampling_params.frequency_penalty, self._DEFAULT_PENALTIES["frequency"])
and is_default_value(sampling_params.repetition_penalty, self._DEFAULT_PENALTIES["repetition"])
)
if (
not self.tt_sampling.force_argmax_sampling
or self._penalties_active
or self._penalties_active != old_penalties_active
):
self.tt_penalties.reset_params(
sampling_params.presence_penalty, sampling_params.frequency_penalty, sampling_params.repetition_penalty
)
self._log_probs_active = self.tt_sampling.log_probs_calculator.enable_log_probs
def _validate_trace_inputs(self, slot, logits: ttnn.Tensor, tt_out_tok: Optional[ttnn.Tensor]):
if slot["input"] is None or slot["output"] is None:
raise RuntimeError("Trace metadata missing. Call capture_trace first.")
if logits is not slot["input"]:
raise ValueError(
"The provided logits tensor does not match the tensor used during trace capture. "
"Call `reset_trace()` before tracing with new tensors."
)
if isinstance(slot["output"], tuple):
if tt_out_tok is not None and tt_out_tok is not slot["output"][0]:
raise ValueError(
"The provided output tensor does not match the tensor used during trace capture. "
"Call `reset_trace()` before tracing with new tensors."
)
else:
if tt_out_tok is not None and tt_out_tok is not slot["output"]:
raise ValueError(
"The provided output tensor does not match the tensor used during trace capture. "
"Call `reset_trace()` before tracing with new tensors."
)
def _run_sampling(
self,
logits,
*,
penalties_on: bool,
tt_out_tok: Optional[ttnn.Tensor],
count_tokens: bool = True,
):
if penalties_on:
logits = self.tt_penalties.apply(logits)
tt_tokens, tt_log_probs = self.tt_sampling(logits, tt_out_tok=tt_out_tok)
if penalties_on and count_tokens:
# Fold the penalty bookkeeping into the sampled step rather than running it afterwards in
# sample(). The order is unchanged -- penalties are applied to this step's logits from the
# previous steps' counts, then the new token is counted -- but doing it here means it is part
# of whatever trace captures this, instead of a handful of scatter/tilize/reshape allocations
# on every decode step behind a live trace. Those ops take no preallocated output tensor, so
# tracing them is the only way to stop them allocating.
self.tt_penalties.update_output_tokens(tt_out_tok if tt_out_tok is not None else tt_tokens)
return tt_tokens, tt_log_probs
def reset_penalty_counts(self):
"""Zero the output-token penalty counters, if penalties are active.
Eager pre-compile passes pass ``count_tokens=False`` to _run_sampling instead, so they never add
phantom tokens and nothing needs undoing. Passes inside a trace-capture window must NOT disable
counting: capture records rather than executes, so nothing is counted at capture time, and
disabling it there would drop the update from every replay -- the real sampled token would never
be penalized. This remains for callers that genuinely want the counters cleared. In-place, so it
allocates nothing.
"""
if self._penalties_active:
self.tt_penalties.reset_output_tokens()
def _copy_warmup_logits(self, logits: ttnn.Tensor) -> ttnn.Tensor:
# clone chooses its own core grid, which can cross the prefetcher/worker
# sub-device boundary on Galaxy.
if self.sub_core_grids is not None:
return ttnn.identity(logits, sub_core_grids=self.sub_core_grids)
return ttnn.clone(logits)
def precompile(
self,
logits: ttnn.Tensor,
*,
tt_out_tok: Optional[ttnn.Tensor] = None,
all_configs: bool = False,
) -> None:
"""Run the sampling pipeline once without capturing, to compile it and size its scratch.
This is the pre-compile step :meth:`capture_trace` would otherwise do inline. Callers that capture
the sampling trace behind another trace (e.g. right after the decode trace) should run it earlier,
while no trace is live on device, and then pass ``skip_precompile=True`` to :meth:`capture_trace`;
left inline, this pass allocates device buffers that a live trace can corrupt on replay.
``logits`` only has to match the spec of the tensor that will later be captured, not be it.
``all_configs`` compiles every ``_TraceKey`` flag combination rather than just the one active
now. Traces are keyed on (penalties, log_probs, force_argmax), but warmup only ever runs one of
those, so a request asking for logprobs or penalties later finds an uncaptured slot and, because
callers pass ``skip_precompile=True``, executes its program for the first time inside a live
trace capture -- TT_FATAL !is_capturing_trace, which kills the engine rather than erroring.
"""
# Capture's penalty precompile uses a copy because penalties rewrite
# logits in place. Warm that copy program before any trace is live too.
if all_configs or self._penalties_active:
logits = self._copy_warmup_logits(logits)
if not all_configs:
self._run_sampling(
logits,
penalties_on=self._penalties_active,
tt_out_tok=tt_out_tok,
count_tokens=False,
)
return
log_probs = self.tt_sampling.log_probs_calculator
saved_penalties = self._penalties_active
saved_force_argmax = self.tt_sampling._force_argmax_sampling
saved_enabled = list(log_probs.logprobs_enabled)
saved_num_logprobs = list(log_probs.num_logprobs)
try:
for penalties_on, log_probs_on, force_argmax in itertools.product((False, True), repeat=_TRACE_KEY_FLAGS):
# Models that disable force-argmax never reach that program, and it is not runnable
# under their sub-device config (untilize with sub_core_grids=None).
if force_argmax and not self.tt_sampling._allow_force_argmax_sampling:
continue
self._penalties_active = penalties_on
# Set the flag directly: reset_params() would re-derive it from k/p/temp and overwrite
# the live request params, and only the flag selects the program being compiled.
self.tt_sampling._force_argmax_sampling = force_argmax
log_probs.set_log_probs_mode(log_probs_on, num_logprobs=0)
self._run_sampling(
logits,
penalties_on=penalties_on,
tt_out_tok=tt_out_tok,
count_tokens=False,
)
finally:
self._penalties_active = saved_penalties
self.tt_sampling._force_argmax_sampling = saved_force_argmax
# Restore through the setter that owns the derived flags rather than re-deriving them here.
log_probs.set_log_probs_mode(saved_enabled, num_logprobs=saved_num_logprobs)
self._log_probs_active = log_probs.enable_log_probs
def capture_trace(
self,
logits: ttnn.Tensor,
*,
tt_out_tok: Optional[ttnn.Tensor] = None,
skip_precompile: bool = False,
) -> ttnn.Tensor:
"""
Capture a trace of the sampling pipeline for the given configuration.
"""
penalties_on = self._penalties_active
log_probs_on = getattr(self, "_log_probs_active", False)
force_argmax = self.tt_sampling.force_argmax_sampling
key, slot = self._trace_slot(penalties_on, log_probs_on, force_argmax)
if not skip_precompile:
logger.debug(
f"Pre-compiling sampling path before trace capture (penalties={penalties_on},log_probs_on={log_probs_on},force_argmax={force_argmax})"
)
# TTPenalties.apply() rewrites its input in place, so compiling on `logits` itself would
# leave the capture buffer already penalized and make the first replay penalize it twice.
scratch = self._copy_warmup_logits(logits) if penalties_on else logits
self._run_sampling(
scratch,
penalties_on=penalties_on,
tt_out_tok=tt_out_tok,
count_tokens=False,
)
if scratch is not logits:
ttnn.deallocate(scratch)
# Whatever sampling allocates inside the capture window (e.g. the argmax output when no
# feedback buffer is supplied) belongs to the trace being recorded and must stay allocated
# for replay. Acknowledge the window (no-op unless TT_METAL_TRACE_ALLOC_TRACKING=1), as the
# model decode capture does; measured: 1 buffer left live across every replay on Qwen2.5-VL.
with trace_allocation_tracker.corruptible_allocation_scope(self.mesh_device):
trace_id = ttnn.begin_trace_capture(self.mesh_device, cq_id=self.cq_id)
sampled = self._run_sampling(
logits,
penalties_on=penalties_on,
tt_out_tok=tt_out_tok,
)
ttnn.end_trace_capture(self.mesh_device, trace_id, cq_id=self.cq_id)
ttnn.synchronize_device(self.mesh_device)
if tt_out_tok is not None:
if isinstance(sampled, tuple):
output = (tt_out_tok, sampled[-1])
else:
output = (tt_out_tok, sampled)
else:
output = sampled
slot["id"] = trace_id
slot["input"] = logits
slot["output"] = output
slot["kwargs"] = {"tt_out_tok": tt_out_tok}
_acknowledge_trace_buffers_corruptible(self._active_trace_bucket, (logits, output))
return slot["output"]
def _execute_trace(self, key: _TraceKey) -> ttnn.Tensor:
slot = self._trace_states.get(key)
if slot is None:
raise RuntimeError("Trace has not been captured yet.")
if slot["id"] is None or slot["output"] is None:
raise RuntimeError("Trace has not been captured yet.")
ttnn.execute_trace(self.mesh_device, slot["id"], cq_id=self.cq_id, blocking=False)
return slot["output"]
def sample(
self,
logits: ttnn.Tensor,
*,
enable_trace: bool = True,
tt_out_tok: Optional[ttnn.Tensor] = None,
skip_precompile: bool = False,
count_tokens: bool = True,
) -> ttnn.Tensor:
"""
Convenience wrapper that either runs the sampling module directly or
replays a captured trace.
``count_tokens`` only applies to the untraced path: the token-count update is recorded into
the trace at capture time, so a replay always performs it.
"""
penalties_on = self._penalties_active
log_probs_on = getattr(self, "_log_probs_active", False)
force_argmax = self.tt_sampling.force_argmax_sampling
# Explicit request seeds update a persistent seed tensor every token;
# run them directly so trace replay cannot observe stale seed state.
use_internal_trace = enable_trace and not self.seed_manager.has_active_request_seed()
if use_internal_trace and not count_tokens:
raise ValueError("count_tokens=False cannot be honoured on a traced sample(); pass enable_trace=False.")
if not use_internal_trace:
tt_out = self._run_sampling(
logits,
penalties_on=penalties_on,
tt_out_tok=tt_out_tok,
count_tokens=count_tokens,
)
else:
key, slot = self._trace_slot(penalties_on, log_probs_on, force_argmax)
if slot["id"] is None:
self.capture_trace(
logits,
tt_out_tok=tt_out_tok,
skip_precompile=skip_precompile,
)
# begin/end_trace_capture only records the ops, so the captured output buffer
# still holds the previous step's token; replay before returning it as this
# step's sample. Callers that only capture (warmup) must not pay for this.
return self._execute_trace(key)
self._validate_trace_inputs(slot, logits, tt_out_tok)
tt_out = self._execute_trace(key)
# The penalty update now runs inside _run_sampling, so it is captured with the rest of the sampled
# step and replayed with it -- there is nothing to do here.
return tt_out
def format_sampling_params(sampling_params, max_batch_size):
"""
Format sampling parameters for on-device use.
Converts scalar fields to lists, pads all lists to ``max_batch_size``, inverts
temperature, clamps top-p/top-k, and normalises penalties.
``temperature`` defines the ACTIVE lane count: ``active_len = len(temperature)`` after
the scalar->list normalisation below. Three field groups, each with its own rule:
* **Per-user fields** — ``temperature``, ``top_p``, ``top_k``, and the three penalties.
A scalar broadcasts across the active lanes; a list is used as given. Inactive lanes
(``active_len..max_batch_size``) are padded with the field default. A list that is
neither length 1 nor long enough to cover the active lanes is rejected: silently
padding it with defaults would turn real lanes greedy (``top_k`` -> 1) or drop their
penalties, which is invisible at the call site.
* **Log-probs fields** — ``enable_log_probs`` / ``num_logprobs``. A scalar or a
single-element list broadcasts to ``max_batch_size``, not to ``active_len``: these
select an output format rather than shaping a lane's distribution, so an inactive
lane carrying the flag is harmless.
* **``seed``** — lane-scoped, deliberately NOT broadcast. A scalar seed lands on lane 0
and every other lane stays unseeded, because broadcasting one seed to every lane
means "all lanes draw the same token", which a caller must ask for explicitly.
Returns a **new** SamplingParams — the input is never mutated.
"""
if not isinstance(sampling_params.temperature, List):
update_dict = {field.name: [getattr(sampling_params, field.name)] for field in fields(sampling_params)}
sampling_params = replace(sampling_params, **update_dict)
target_len = max_batch_size
assert target_len % 32 == 0, f"Sampling batch size must be a multiple of 32, got {target_len}"
# Defaults used when padding short lists to target_len
defaults = {
"temperature": 0.0,
"top_p": 1.0,
"top_k": 1,
"presence_penalty": 0.0,
"frequency_penalty": 0.0,
"repetition_penalty": 1.0,
"seed": None,
"num_logprobs": 0,
"enable_log_probs": False,
}
def _pad(lst, name):
"""Return a new list padded to target_len with the default for *name*."""
if len(lst) >= target_len:
return list(lst)
return list(lst) + [defaults[name]] * (target_len - len(lst))
# Number of lanes the caller is actually describing. temperature is the reference
# because it is the field that decides whether a lane samples at all.
active_len = len(sampling_params.temperature)
def _pad_per_user(value, name):
"""Normalise one per-user field to a target_len list. See the docstring."""
if value is None:
# Only reachable for the penalties, whose defaults are no-ops.
return _pad([defaults[name]], name)
if not isinstance(value, List):
# Scalar: the caller means "this value, for every lane I am describing".
return _pad([value] * active_len, name)
lst = list(value)
# A single-element list stays lane-scoped: callers that pass [x] for a one-user
# batch have always meant lane 0, and reinterpreting it as a broadcast would
# silently change sampling for their other lanes. (#45400 / Copilot review)
if len(lst) != 1 and len(lst) < active_len:
raise ValueError(
f"sampling_params.{name} has {len(lst)} entries but temperature describes "
f"{active_len} active lanes. Pass one value per active lane, a single scalar to "
f"apply one value to all of them, or a 1-element list to target lane 0 only. "
f"Padding the gap with the {name} default ({defaults[name]!r}) would silently "
f"change how lanes {len(lst)}..{active_len - 1} sample."
)
return _pad(lst, name)
temperature = _pad_per_user(sampling_params.temperature, "temperature")
top_p = _pad_per_user(sampling_params.top_p, "top_p")
top_k = _pad_per_user(sampling_params.top_k, "top_k")
# enable_log_probs / num_logprobs: scalar → broadcast to all users.
# Multi-element list → pad with default (False/0) for inactive slots.
# Single-element list (from scalar→list conversion) → broadcast to all.
def _broadcast_pad(lst, name):
if not isinstance(lst, list):
return [lst] * target_len
if len(lst) == 1:
return lst * target_len
return _pad(lst, name)
enable_log_probs = _broadcast_pad(sampling_params.enable_log_probs, "enable_log_probs")
if getattr(sampling_params, "num_logprobs", None) is not None:
num_logprobs = _broadcast_pad(sampling_params.num_logprobs, "num_logprobs")
else:
num_logprobs = None
# Penalties follow the same per-user rule as temperature/top_p/top_k. They used to be
# lane-scoped, so a scalar penalty alongside a per-user temperature landed on lane 0 and
# left every other lane on the no-op default (0.0 / 0.0 / 1.0) with no diagnostic -- the
# same silent-wrong-lane bug that scalar top_k had. Note the SamplingParams defaults for
# these three ARE the padding defaults, so a caller who never sets them is unaffected.
presence_penalty = _pad_per_user(getattr(sampling_params, "presence_penalty", None), "presence_penalty")
frequency_penalty = _pad_per_user(getattr(sampling_params, "frequency_penalty", None), "frequency_penalty")
repetition_penalty = _pad_per_user(getattr(sampling_params, "repetition_penalty", None), "repetition_penalty")
# seed stays lane-scoped on purpose: broadcasting one seed across the batch means every
# lane draws the same token, which is a different request than "seed this request".
seed_value = getattr(sampling_params, "seed", None)
if seed_value is None:
seed = _pad([defaults["seed"]], "seed")
elif isinstance(seed_value, List):
seed = _pad(list(seed_value), "seed")
else:
seed = _pad([seed_value], "seed")
# Clamp / transform values in the new lists (no mutation of the input)
TOP_P_MIN = 0.0
TOP_P_MAX = 1.0
for i in range(len(temperature)):
top_p[i] = clamp(top_p[i], TOP_P_MIN, TOP_P_MAX)
if temperature[i] == 0:
temperature[i] = 1.0
top_k[i] = 1
# Device sampling treats p=0 as a first-token cutoff; with k=1
# this is the compact argmax representation for greedy rows.
top_p[i] = 0.0
else:
temperature[i] = 1 / temperature[i]
# top_k contract: TT sampling supports up to 32 today.
# k < 1 means "no restriction" → max (32); k > 32 → capped to 32.
if top_k[i] < 1:
top_k[i] = 32
if top_k[i] > 32:
top_k[i] = 32
if repetition_penalty[i] == 0:
repetition_penalty[i] = defaults["repetition_penalty"]
kwargs = dict(
temperature=temperature,
top_p=top_p,
top_k=top_k,
presence_penalty=presence_penalty,
frequency_penalty=frequency_penalty,
repetition_penalty=repetition_penalty,
seed=seed,
)
# Only include logprobs fields if the input dataclass has them
# (vLLM's TTSamplingParams may not have these fields)
input_fields = {f.name for f in fields(sampling_params)}
if "num_logprobs" in input_fields:
kwargs["num_logprobs"] = num_logprobs
if "enable_log_probs" in input_fields:
kwargs["enable_log_probs"] = enable_log_probs
return replace(sampling_params, **kwargs)
def broadcast_sampling_params(
formatted_sampling_params,
idx: int,
slot_len: int = 32,
):
"""
Create a new SamplingParams where each list field is broadcast to a full list of length
``slot_len``, taking the value from ``idx``. Does not mutate the input.
"""
kwargs = {}
for f in fields(formatted_sampling_params):
value = getattr(formatted_sampling_params, f.name)
value_is_list = isinstance(value, List)
if value_is_list:
chosen = value[idx] if idx < len(value) else value[0]
else:
chosen = value
if value_is_list:
# Preserve list fields as lists even when the selected value is None.
kwargs[f.name] = [chosen] * slot_len
elif chosen is None:
kwargs[f.name] = None
else:
kwargs[f.name] = [chosen] * slot_len
return SamplingParams(**kwargs)
def scatter_sampling_params_to_slots(
formatted_sampling_params,
empty_slots,
slot_len: int = 32,
):
"""Move each request's params from its prefill position to its slot row.
A batched prefill lays its device rows out by physical slot, so the sampling
rows must be too: row ``empty_slots[i]`` samples request ``i``'s logits and
needs request ``i``'s temperature/top_k/top_p/penalties. Callers receive
params in prefill order, which only coincides with the slot order when the
slots happen to be ``range(len(empty_slots))``.
``seed`` is left in prefill order: ``SeedManager.reset_seed`` takes the slot
list separately and does its own mapping. Rows no request occupies inherit the
last real request's values rather than the formatter's padding, so they stay
valid instead of sampling from a default row. Does not mutate the input.
"""
if not empty_slots:
return formatted_sampling_params
slots = [int(s) for s in empty_slots]
def _scatter(values):
if not isinstance(values, List):
return values
values = list(values)
if len(values) == 1 and len(slots) > 1:
values = values * len(slots)
request_values = values[: len(slots)]
if not request_values:
return values
filler = request_values[-1]
scattered = [filler] * slot_len
for value, slot in zip(request_values, slots):
if 0 <= slot < slot_len:
scattered[slot] = value
return scattered
kwargs = {}
for f in fields(formatted_sampling_params):
value = getattr(formatted_sampling_params, f.name)
kwargs[f.name] = value if f.name == "seed" else _scatter(value)
return SamplingParams(**kwargs)
def slice_sampling_params(sampling_params, start: int, stop: int):
"""Take the ``[start, stop)`` requests out of a prefill-ordered SamplingParams.
For callers that split one prefill batch into several forward passes: each pass
must carry its own requests' params, not the first ``stop - start`` of the batch.
List fields are sliced, scalars are shared. Falls back to dataclass defaults for
missing attributes so vLLM's ``TTSamplingParams`` works transparently.
"""
if sampling_params is None:
return None
sliced = {}
for field_name in SAMPLING_PARAM_FIELDS:
try:
value = getattr(sampling_params, field_name)
except AttributeError:
if hasattr(SamplingParams, field_name):
value = getattr(SamplingParams, field_name)
else:
raise
sliced[field_name] = value[start:stop] if isinstance(value, list) else value
return SamplingParams(**sliced)
def chunk_sampling_params(sampling_params, sampling_dp: int) -> list:
"""
Chunk a SamplingParams (or duck-type-compatible object) into ``sampling_dp`` pieces.
List fields are split evenly (length must be divisible by ``sampling_dp``).
Scalar fields are replicated to all chunks. Falls back to dataclass defaults
for missing attributes so that vLLM's TTSamplingParams works transparently.
Returns a list of SamplingParams.
"""
if sampling_dp == 1:
return [sampling_params]
chunked_fields = {}
for field_name in SAMPLING_PARAM_FIELDS:
try:
val = getattr(sampling_params, field_name)
except AttributeError:
if hasattr(SamplingParams, field_name):
val = getattr(SamplingParams, field_name)
else:
raise
if isinstance(val, list):
assert (
len(val) % sampling_dp == 0
), f"Sampling param '{field_name}' length {len(val)} not divisible by sampling_dp {sampling_dp}"
chunked_fields[field_name] = split_list(val, sampling_dp)
else:
chunked_fields[field_name] = [val] * sampling_dp
return [
SamplingParams(**{field: chunked_fields[field][i] for field in SAMPLING_PARAM_FIELDS})
for i in range(sampling_dp)
]
class SeedManager:
"""Manage per-user RNG state and writes to the on-device seed tensor.
Tracks which users have explicit seeds set (``_seed_active``) and avoids
unnecessary host-to-device copies during decode when no seeds are active.
On the first call after a reset with no active seeds, pushes varied
per-user entropy-derived seed values; the next call pushes MAX_UINT32
(SKIP) so the device advances via ``rand_tile`` on its own, then skips all
subsequent decode pushes until the next ``reset_seed``.
`reset_seed` updates host RNGs only. `get_new_values` advances RNGs and
writes to device. `write_device_seed_values` writes explicit seeds only.
"""
def __init__(self, tt_sampling=None, max_batch_size=32, salt_duplicate_seeds=True, *, seed_buffer=None):
if tt_sampling is None and seed_buffer is None:
raise TypeError("SeedManager requires tt_sampling or a mutable seed_buffer")
if tt_sampling is not None and seed_buffer is not None:
raise TypeError("SeedManager accepts exactly one device seed sink")
self.max_batch_size = max_batch_size
# When False, concurrent slots sharing a request seed keep salt 0, so two independent
# requests carrying the same seed stay bit-identical (the OpenAI/vLLM reproducibility
# contract, asserted by the vLLM TT sampling suite).
#
# #53077 added salting for "n>1 completions of one prompt with a fixed seed occupy
# several slots with the same request seed". That premise does not hold on the vLLM v1
# path: ParentRequest._get_child_sampling_params already gives child i `seed + i`
# (vllm/v1/engine/parallel_sampling.py), so n>1 children never reach the backend
# sharing a seed. There, every duplicate seed is genuinely independent requests that
# MUST match, and salting them is a regression. Demo paths that do replicate one seed
# across slots (e.g. simple_text_demo.py) keep the default and are unaffected.
self.salt_duplicate_seeds = salt_duplicate_seeds
self.seeds = [None for _ in range(max_batch_size)]
self.seed_counters = [0 for _ in range(max_batch_size)]
# Last per-slot device seeds pushed by get_new_values; the Python sampler turns these
# into its per-user uniforms so it draws from the same stream as the device PRNG path.
# Disambiguates concurrent slots that carry the SAME explicit request
# seed (n>1 completions of one prompt with a fixed seed). A slot whose
# seed is unique among active slots always has salt 0, preserving the
# slot-independent reproducibility of single-sample seeded requests.
self.seed_salts = [0 for _ in range(max_batch_size)]
# Pre-allocate RNG objects; actual request seeds are set via reset_seed().
self.rngs = [random.Random(secrets.randbits(64)) for _ in range(max_batch_size)]
self.tt_sampling = tt_sampling
self._seed_buffer = seed_buffer
self._seed_buffer_source = None
if seed_buffer is not None:
source = getattr(seed_buffer, "source", None)
if source is None or not callable(getattr(seed_buffer, "update", None)):
raise TypeError("seed_buffer must expose source and update()")
self._seed_buffer_source = source.clone() if callable(getattr(source, "clone", None)) else copy.copy(source)
# True when at least one user slot has a non-None request seed.
self._seed_active = False
# Set to True by reset_seed() so the next get_new_values() pushes
# fresh values to the device. When _seed_active is True this pushes
# per-user seeds; when False it pushes varied per-user
# values to diversify the device RNG state. Cleared after the push.
self._reseted = False
# When True, the next get_new_values() must push MAX_UINT32 (SKIP) so
# the device transitions from rand_tile_init to rand_tile advance.
self._needs_skip = False
# True only for the most recent get_new_values() call when at least
# one active slot used an explicit request seed.
self._active_request_seed = False
# Sampling1D runtime state. The all-unseeded path is deliberately
# untouched until an explicit request seed overlays model defaults.
self._runtime_seed_buffer_managed = False
# Mesh mapper for sharding seeds across rows when sampling_dp > 1.
sampling_dp = 1 if tt_sampling is None else tt_sampling._sampling_dp
if sampling_dp > 1:
self._seed_mapper = ttnn.ShardTensor2dMesh(
tt_sampling.mesh_device, dims=tt_sampling._param_dims, mesh_shape=tt_sampling.cluster_shape
)
else:
self._seed_mapper = None
def restore_default_device_values(self) -> None:
"""Restore a model-owned seed buffer after an explicitly seeded request.
``LazyBuffer.update`` also replaces its future materialization source. Runtime
request seeds are invocation state, not model configuration, so preserve the
construction-time source across updates and restore it when execution returns
to the legacy ``seed=None`` path.
"""
if self._seed_buffer is None or self._seed_buffer_source is None:
return
source = (
self._seed_buffer_source.clone()
if callable(getattr(self._seed_buffer_source, "clone", None))
else copy.copy(self._seed_buffer_source)
)
self._seed_buffer.update(source)
self._seed_buffer.source = source
self.seeds = [None for _ in range(self.max_batch_size)]
self.seed_counters = [0 for _ in range(self.max_batch_size)]
self._seed_active = False
self._active_request_seed = False
self._reseted = False
self._needs_skip = False
self._runtime_seed_buffer_managed = False
@property
def seed_buffer(self):
"""Return the borrowed model-owned seed buffer, if this manager uses one."""
return self._seed_buffer
def get_seed_device_buffer(self):
"""Return the stable model-owned device handle used by Sampling1D traces."""
get_device_buffer = getattr(self._seed_buffer, "get_device_buffer", None)
return get_device_buffer() if callable(get_device_buffer) else None
def refresh_absolute_request_seeds(self, seeds, active_slots, positions, *, reset_batch: bool):
"""Refresh a model-owned seed buffer for one Sampling1D decode step.
Explicit slots use the stable ``hash(request_seed, absolute_position)``
stream. Every unseeded and inactive slot retains its exact
construction-default value. The initial all-unseeded path remains
untouched; after a mixed/seeded request, the first all-unseeded call
restores the complete default tensor. Explicit seeds remain stable
across slot remaps through their absolute-position hash.
"""
if self._seed_buffer is None:
raise RuntimeError("absolute request-seed refresh requires a model-owned seed buffer")
active = {int(slot) for slot in active_slots}
if any(slot < 0 or slot >= self.max_batch_size for slot in active):
raise ValueError("active seed slot is outside the seed-buffer capacity")
requested = {slot: self._seed_from_slot_params(seeds, slot) for slot in active}
explicit = {slot: seed for slot, seed in requested.items() if seed is not None}
if not explicit:
if self._runtime_seed_buffer_managed:
self.restore_default_device_values()
return tuple(int(value) for value in self._seed_buffer_source.reshape(-1).tolist())
return None
values = [int(value) for value in self._seed_buffer_source.reshape(-1).tolist()]
if len(values) != self.max_batch_size:
raise ValueError("seed-buffer default source does not match its declared capacity")
for slot, request_seed in explicit.items():
position = self._position_for_slot(positions, slot)
if position is None or position < 0:
raise ValueError("explicit request seed requires a nonnegative absolute decode position")
self.seeds[slot] = request_seed
self.seed_counters[slot] = position + 1
values[slot] = _hash_request_seed_to_device_seed(request_seed, position + 1)
for slot in set(range(self.max_batch_size)) - set(explicit):
self.seeds[slot] = None
self.seed_counters[slot] = 0
self._seed_active = True
self._active_request_seed = True
self._runtime_seed_buffer_managed = True
self._write_model_seed_values(values)
return tuple(values)
@staticmethod
def _position_for_slot(positions, slot: int):
if isinstance(positions, torch.Tensor):
flat = positions.reshape(-1)
return None if slot >= flat.numel() else int(flat[slot].item())
if isinstance(positions, (list, tuple)):
return None if slot >= len(positions) else int(positions[slot])
return None if positions is None else int(positions)
def _write_model_seed_values(self, values) -> None:
source = torch.tensor(values, dtype=self._seed_buffer_source.dtype).reshape(self._seed_buffer_source.shape)
self._seed_buffer.update(source)
# Request state must not become the LazyBuffer's rematerialization
# default after model cleanup.
self._seed_buffer.source = self._seed_buffer_source
def _next_unseeded_rng_seed(self) -> int:
return secrets.randbits(64)
def _next_unseeded_device_seed(self) -> int:
return secrets.randbelow(DEVICE_SEED_MAX) + 1
def _next_device_seed_from_rng(self, rng: random.Random) -> int:
return rng.randint(1, DEVICE_SEED_MAX)
def _next_device_seed_for_slot(self, slot: int) -> int:
request_seed = self.seeds[slot]
if request_seed is None:
return self._next_device_seed_from_rng(self.rngs[slot])
device_seed = _hash_request_seed_to_device_seed(
int(request_seed), self.seed_counters[slot], self.seed_salts[slot]
)
self.seed_counters[slot] += 1
return device_seed
def _next_free_salt(self, slot: int, seed: int) -> int:
"""Smallest salt not used by another active slot holding the same request seed.
The first slot to carry a given seed gets salt 0 (identical stream to
today), the second gets 1, and so on. Using the smallest free value --
rather than a running count -- avoids re-colliding with a surviving
duplicate after an earlier one finished and vacated its slot.
"""
if not self.salt_duplicate_seeds:
return 0
taken = {
self.seed_salts[other]
for other in range(self.max_batch_size)
if other != slot and self.seeds[other] == seed
}
salt = 0
while salt in taken:
salt += 1
return salt
def _set_slot_seed(self, slot: int, seed, *, keep_existing_salt: bool):
"""Single writer for a slot's (seed, counter, salt, rng) state.
With ``keep_existing_salt`` (decode-path re-registration of a running
request), a slot that already holds the same request seed is left
untouched: salts are collision-free among live same-seed slots by
construction, and recomputing one mid-generation (the unconditional
re-registration on the first decode after any admission) would splice
the request onto a finished sibling's RNG stream. Without it (prefill
admission of a new request) the slot is fully reset, including a fresh
smallest-free salt, so a unique-seed request always lands on salt 0.
"""
if keep_existing_salt and seed is not None and self.seeds[slot] == seed:
return
self.seeds[slot] = seed
self.seed_counters[slot] = 0
if seed is None:
self.seed_salts[slot] = 0
self.rngs[slot].seed(self._next_unseeded_rng_seed())
else:
self.seed_salts[slot] = self._next_free_salt(slot, seed)
self.rngs[slot].seed(int(seed))
def release_slot(self, slot: int) -> None:
"""Release a finished request before another prefill can reuse its seed.
Waiting for decode's live-slot reconciliation is too late.
Live siblings keep their salts and counters unchanged.
"""
if not 0 <= slot < self.max_batch_size:
raise ValueError(f"Seed slot {slot} is outside capacity {self.max_batch_size}")
self.deactivate_slots_except(user for user in range(self.max_batch_size) if user != slot)
def deactivate_slots_except(self, live_slots) -> None:
"""Drop seed state of slots that are no longer live.
Nothing else clears a finished request's slot when condense has no
move to make (a request finishing at the tail of the batch leaves its
seed behind), so the ghost would keep counting toward _next_free_salt
and hand a later unique-seed request a salt > 0, breaking seeded
reproducibility. Callers pass the current live-slot set (decode
positions >= 0).
"""
if not self._seed_active:
return
live = {int(slot) for slot in live_slots}
for slot in range(self.max_batch_size):
if slot not in live and self.seeds[slot] is not None:
self.seeds[slot] = None
self.seed_counters[slot] = 0
self.seed_salts[slot] = 0
self._seed_active = any(s is not None for s in self.seeds)
if not self._seed_active:
# Re-enter the unseeded three-state machine. The device still holds
# the seeded path's non-SKIP reinit values; without a fresh init+SKIP
# push, get_new_values early-returns and the device reinitializes
# every user's PRNG to the same stale seed on every token.
self._reseted = True
def _seed_from_slot_params(self, seeds, slot: int):
if seeds is None:
return None
if isinstance(seeds, torch.Tensor):
flat = seeds.reshape(-1)
if slot < 0 or slot >= flat.numel():
return None
seed = flat[slot]
elif isinstance(seeds, (list, tuple)):
if slot < 0 or slot >= len(seeds):
return None
seed = seeds[slot]
else:
seed = seeds
if seed is None:
return None
if isinstance(seed, torch.Tensor):
if seed.numel() == 0:
return None
seed = seed.reshape(-1)[0].item()
return int(seed)
def reset_seed_from_slots(self, seeds, user_ids):
"""Reset decode seed state from slot-indexed sampling params."""
if user_ids is None:
user_ids = range(self.max_batch_size)
for user in user_ids:
slot = int(user)
seed = self._seed_from_slot_params(seeds, slot)
self._set_slot_seed(slot, seed, keep_existing_salt=True)
self._seed_active = any(s is not None for s in self.seeds)
self._reseted = True
def reset_seed_from_slots_if_needed(self, seeds, user_ids) -> list[int]:
"""Reset only active slots whose slot-indexed seed changed.
Returns the reset slots: they hold newly admitted requests, so their host
position is authoritative even when the rest of the batch's is not.
"""
if user_ids is None:
user_ids = range(self.max_batch_size)
reset_slots = []
for user in user_ids:
slot = int(user)
if self._seed_from_slot_params(seeds, slot) != self.seeds[slot]:
reset_slots.append(slot)
if reset_slots:
self.reset_seed_from_slots(seeds, reset_slots)
return reset_slots
def align_seed_counters_to_positions(self, seeds, user_ids, positions, offset: int = 1):
"""Make explicit-seed decode independent of persistent slot lifetime.
vLLM can temporarily remove running requests from the persistent batch
while admitting another prefill batch, then re-add them in different
slots. For explicit request seeds, deriving the per-token device seed
from the absolute decode position keeps the stream reproducible even
when the Python-side slot counter was reset or moved.
``positions`` MUST be authoritative for the slots being aligned: the
counter self-advances per token, so aligning to a position that lags
under async scheduling makes the stream timing-dependent (#51981).
"""
if positions is None:
return
if user_ids is None:
user_ids = range(self.max_batch_size)
if isinstance(positions, torch.Tensor):
flat_positions = positions.reshape(-1)
def _position(slot):
if slot < 0 or slot >= flat_positions.numel():
return None
pos = flat_positions[slot]
return int(pos.item())
elif isinstance(positions, list):
def _position(slot):
if slot < 0 or slot >= len(positions):
return None
return int(positions[slot])
else:
def _position(_slot):
return int(positions)
for user in user_ids:
slot = int(user)
seed = self._seed_from_slot_params(seeds, slot)
if seed is None:
continue
position = _position(slot)
if position is None or position < 0:
continue
self.seed_counters[slot] = max(0, position + offset)
def has_active_request_seed(self) -> bool:
return self._active_request_seed
def apply_slot_remap(self, remap):
"""Reindex RNG state after batch condense.
``remap`` is a 1-D int tensor of length ``max_batch_size`` where
``remap[i] = j`` means slot *i* now holds the request that was
previously at slot *j*. Identity entries (``remap[i] == i``) are
no-ops. Only non-identity entries trigger a move.
"""
if not self._seed_active:
return
moves = [(int(remap[i]), i) for i in range(len(remap)) if int(remap[i]) != i]
if not moves:
return
# Snapshot the state we're about to overwrite.
old_seeds = list(self.seeds)
old_counters = list(self.seed_counters)
old_salts = list(self.seed_salts)
old_rngs = list(self.rngs)
moved_sources = {old_slot for old_slot, _ in moves}
moved_destinations = {new_slot for _, new_slot in moves}
for old_slot, new_slot in moves:
self.seeds[new_slot] = old_seeds[old_slot]
self.seed_counters[new_slot] = old_counters[old_slot]
# The salt travels with the request so its stream survives the move.
self.seed_salts[new_slot] = old_salts[old_slot]
# copy.copy preserves internal RNG state but creates an
# independent object so the old slot reference does not alias
# the new one.
self.rngs[new_slot] = copy.copy(old_rngs[old_slot])
# A condense moves the highest live request down into the lowest empty
# slot, so a source that is not itself a destination has been vacated.
for old_slot in moved_sources - moved_destinations:
self.seeds[old_slot] = None
self.seed_counters[old_slot] = 0
self.seed_salts[old_slot] = 0
self._seed_active = any(s is not None for s in self.seeds)
if not self._seed_active:
# Same re-arm as deactivate_slots_except: a remap that overwrites the
# last seeded slot must push init+SKIP or the device PRNG freezes.
self._reseted = True
def reset_seed(self, seeds, user_ids):
"""Update RNG state for the given user slots after a prefill.
Args:
seeds: Seed values in request order. Accepts a list, tensor, scalar,
or None (treated as all unseeded).
user_ids: Batch slot indices being prefilled.
"""
user_ids = [int(user) for user in user_ids]
for i, user in enumerate(user_ids):
slot = int(user)
seed = self._seed_from_slot_params(seeds, i)
self._set_slot_seed(slot, seed, keep_existing_salt=False)
self._seed_active = any(s is not None for s in self.seeds)
self._reseted = True
def write_device_seed_values(self, seed_values):
if len(seed_values) != self.max_batch_size:
raise ValueError(f"Expected {self.max_batch_size} seed values, got {len(seed_values)}")
try:
wrapped = [int(seed) & 0xFFFFFFFF for seed in seed_values]
except (TypeError, ValueError) as exc:
raise ValueError("seed_values must contain integer-like values") from exc
if self._seed_buffer is not None:
self._write_model_seed_values(wrapped)
return
seed_tt = ttnn.from_torch(
torch.tensor(wrapped, dtype=torch.uint32),
dtype=ttnn.uint32,
layout=ttnn.ROW_MAJOR_LAYOUT,
mesh_mapper=self._seed_mapper,
)
ttnn.copy_host_to_device_tensor(seed_tt, self.tt_sampling.seeds_tt_tensor)
def get_new_values(self, empty_slots=None, replicate_seeds=False):
"""Generate and push new seed values to the device.
**Seeded path** (``_seed_active=True``):
Advances each active slot seed state and copies the new values to
the device every step. Explicit request seeds produce slot-independent
device seeds derived from the request seed and the slot counter. Some
decode callers align that counter to the absolute token position so
vLLM batch-layout changes cannot reset a request's random stream.
**Unseeded path** (``_seed_active=False``):
Uses a three-state machine to ensure each user gets a unique device
RNG state without redundant host-to-device copies during decode:
State 1 - **init** (``_reseted=True``):
Push varied per-user values from system entropy.
State 2 - **transition** (``_needs_skip=True``):
Push MAX_UINT32 (SKIP) so the device stops reinitializing and
starts advancing via rand_tile().
State 3 - **steady** (both flags clear):
Early-return with no device copy.
"""
if empty_slots is None:
empty_slots = list(range(self.max_batch_size))
else:
empty_slots = [int(slot) for slot in empty_slots]
empty_slot_set = set(empty_slots)
self._active_request_seed = any(self.seeds[i] is not None for i in empty_slot_set)
if not self._seed_active:
self._active_request_seed = False
if self._reseted:
new_seeds = [self._next_unseeded_device_seed() for _ in range(self.max_batch_size)]
self._needs_skip = True
elif self._needs_skip:
new_seeds = [MAX_UINT32] * self.max_batch_size
self._needs_skip = False
else:
# State 3 (steady): device already has SKIP, rand_tile
# advances on its own, so no host-to-device copy is needed.
return
else:
new_seeds = [
self._next_device_seed_for_slot(i) if i in empty_slot_set else MAX_UINT32
for i in range(self.max_batch_size)
]
if replicate_seeds:
assert len(empty_slots) == 1, "Cannot replicate seeds if empty_slots is not length 1"
new_seeds = self.max_batch_size * [new_seeds[empty_slots[0]]]
self.write_device_seed_values(new_seeds)
self._reseted = False
return tuple(new_seeds)