---- Public turnkey forward step ---------------------------------------- Pinned host staging for per-step graph inputs. ggml_backend_tensor_set from

Sub-batch size for the reduced-hot-stack routed mul_mat_id. The MMQ path (n_tokens > 8) illegal-accesses on a REDUCED expert stack for sparse/ imbalan

Normalize Anthropic's `system` field (top-level on /v1/messages and /v1/messages/count_tokens) into a leading `{role:"system", content:...}` entry on

Recall a chunk into the pool (used by reselect / tests).

Force a chunk out of the pool (host backing + zeroed slots).

Parse optional inline-snap suffix: ` snap=<pos>:<slot>`.

Parse {"name": ..., "arguments": ...} or {"function": {"name": ..., "arguments": ...}}

Run prompt prefill and return the first generated token id.

Project draft hidden states through the target lm_head and return full f32 logits with vocab as the fastest-changing dimension. Default false (unsuppo

Q4_K_M bytes per row: approximate as 0.5625 bytes/element (4.5 bits)

Like raxAddChild() but does not allocate the child node. Instead it * returns in 'parentlink' the address of the new child pointer, so that the * ca

Turn the node 'n', that must be a node without any children, into a * compressed node representing a set of nodes linked one after the other * and h

Append characters at the current key string of the defragmentation * iterator. Like the normal iterator, the key is rebuilt incrementally as * the w

Build the flags associated with the current item returned by the * defragmentation iterator. */

Push a new node into the defragmentation iterator stack. The parent_child * argument is the child index of this node in its parent, or -1 for the *

Return the memory address where the 'parent' node stores the specified * 'child' pointer, so that the caller can update the pointer with another * o

Insert the element 's' of size 'len', setting as auxiliary data * the pointer 'data'. If the element is already present, the associated * data is up

Create a standalone leaf node storing the specified value. */

Return the position where the edge 'c' should be inserted in order to * preserve lexicographic ordering. */

Low level child removal from node. 'childptr' must point to the child * pointer stored inside the parent node, and is used directly instead of * sea

Free the useless node 'h' that was left after a deletion, and keep moving * upward while the parent would also become a non-key single-child node. *

Initialize the stack. */

Return the stack item at the top of the stack without actually consuming * it. */

Read a prompt file: raw int32 stream (file size implies token count).

Laguna honors only the explicit per-axis --cache-type-k/v overrides. The DFLASH27B_KV_F16/_Q4/_TQ3 shorthands are qwen-family toggles - the server aut

POST to /v1/chat/completions with stream=true. Return (n_tok, wall_secs, decode_secs) where decode_secs starts at the first streamed token (after

Spin up server with --prefix-cache-slots=slots, replay turns, return latencies.

Score `ids` with allocation-failure resilience: try the full forward; on failure split into two equal halves, score each with the TRUE query tail (las

Get tensor pointers into the GPU scratch buffer after a successful stream. Valid until next stream call. Tensors are transient (not owned by any conte

kvflash: route verify writes through the pool (slots allocated here, slot-space mask inside gemma4_verify_batch). Non-owning.

── Routing data collection ────────────────────────────────────── Set an external routing collector that the backend will call for each token/layer du