Repository navigation
Conversation
Run each partitioner’s edge transforms after caller-supplied passes so backends can use the standard lowering entry point. QNN contributes its existing transforms through the new hook.
Reserve names for constant tensors already present in the exported program before lifting new constants, so methods with folded tables retain distinct constants.
Choose the registered IOManager and its logits, method names and step sizes, rejecting unknown contracts and invalid metadata. Load and reset the selected methods; route prompt tails to decode with a side-effect-free capacity check. Preserve module and I/O-buffer lifetimes and expose a backend-neutral allocator hook.
Route backend options through QnnPartitioner.from_options and register an allocator that supplies QNN shared-memory buffers through the generic IOManager hook. The LLM runner remains backend-neutral.
Encode graph output positions and restore their order at both runtime tensor-allocation entry points. Preserve context-binary order and legacy mutable outputs, and ignore malformed or overflowing position labels without throwing. This runtime change needs Qualcomm review.
On QNN SDK 2.48 an HTP execute that binds some tensors as registered rpcmem and others as plain client buffers fails (prefill DMA error 1100, decode transport error 1003) or produces wrong results; 2.50 and 2.51 runtimes run the same binding correctly. LLM runners place their caches, masks, positions and logits in rpcmem through the I/O buffer allocator, but delegate inputs and outputs that ExecuTorch plans internally (CPU-computed masks and RoPE tables, new K/V rows) stay in planned memory. When any tensor of an execute is shared, the backend now copies the remaining ones through persistent rpcmem staging buffers, one block per graph owned by the QnnManager and registered once, so each execute is all shared or all client memory. Executes without shared tensors are unchanged. Authored with AI assistance (Metamate / agentcloud).
Move backend-neutral static-cache rewriting into the LLM extension and keep QNN partitioning and tuning in the backend. Detect sliding layers from model configuration, write every cache and counter in place on the caller buffer (export fails otherwise, since a missed write becomes full-cache CPU copies), and register a versioned runner that handles fixed chunks, padding, counters and reset. Quantized caches, sha attention and full-length sliding mode are excluded. Authored with AI assistance (Metamate / agentcloud).
Use authoritative positions, float-cache version and dtype checks, exact buffer geometry and selected methods. Bind optional HF state outputs to existing buffers, preserve input aliases and register each concrete IOManager from its own implementation. Float-only fixtures cover reset, padding, malformed metadata and near-context tails.
Define fixed methods, cache metadata, padding, absolute counters and state-output bindings, and link the contract from the Qualcomm guide. State float-cache support and CPU-tested sliding correctness without claiming unmeasured device performance or a zero-copy Python host API.
A static-cache step writes its new rows at consecutive positions. With keys stored [1, H, D, L] each written element lands in its own position along the last dimension, so the in-place kernel issued one memcpy per element (917k per Qwen3 prefill chunk, 11.9 ms on a Galaxy S25). Rows bound for consecutive positions are now copied together, which keeps the result identical for any index order, duplicates included, and cuts that write to well under a millisecond. Authored with AI assistance (Metamate / agentcloud).
get_llm_metadata replaced the program's get_vocab_size with the tokenizer's size, and the sampler reads that many logits per row. Gemma 3's tokenizer has 262145 entries for 262144 logits, so greedy decoding read one float past the logits buffer and crashed (SIGSEGV in Sampler::sample_argmax once the buffer ended on a page boundary). The runner now samples over the smaller of the two when the program reports its vocabulary. Authored with AI assistance (Metamate / agentcloud).
…head attention
Contract version 2 lets a program store each key cache as [1, H, D, L] (get_key_layout = "transposed") and hold integer caches whose contents a runner treats as opaque. NPUs read keys as the scores' right-hand side in that layout; on a Galaxy S25 a quantized Qwen3-0.6B decodes 59.9 instead of 45.7 tok/s with it. The step writes its key rows along the last dimension, attention reads the cache without a per-step transpose, and the rest of HF's per-step signature is unchanged. Sliding-window layers may also take context-length caches with the window masked (specialize(sliding="full")), which needs no per-step shift and works with either key layout; window-sized caches keep HF's layout. A per-head attention form ("sha") writes out the single-head graph QNN's mha2sha makes of the concat form, for programs whose quantized K/V cannot be expanded for grouped-query heads, and the embedding can gather by int32 ids converted on CPU (the input stays int64). The Python runner accepts versions 1 and 2. Exporters keep writing version 1 until a backend opts in.
Authored with AI assistance (Metamate / agentcloud).
🔗 Helpful Links🧪 See artifacts and rendered test results at hud.pytorch.org/pr/pytorch/executorch/25348
Note: Links to docs will display an error until the docs builds have been completed. ❌ 3 New Failures, 1 Unrelated Failure, 5 Unclassified FailuresAs of commit 092050c with merge base 765e973 ( NEW FAILURES - The following jobs have failed:
UNCLASSIFIED FAILURES - DrCI could not classify the following jobs because the workflow did not run on the merge base. The failures may be pre-existing on trunk or introduced by this PR:
BROKEN TRUNK - The following job failed but were present on the merge base:👉 Rebase onto the `viable/strict` branch to avoid these failures
This comment was automatically generated by Dr. CI and updates every 15 minutes. |
This PR needs a
|
Graph rewrites for the NPU cache layout (contract v2): keys are stored transposed as [1, H, D, L] with each new row written as a column, sliding-window layers keep a context-length cache with the window applied by the mask, and prefill attends per head. v1 programs are unchanged.
Related PRs (review in order)
Each PR includes the commits of the ones above it; review only its own top commit.