ggml-org/llama.cpp b12094

on GitHub

hexagon: faster TOP_K for the backend sampler (#31279)

• hexagon: faster TOP_K for the backend sampler (skip tiles, then block scan)

Skip the bitonic sort for tiles whose max cannot reach the running k-th
best value, then replace the tile sort with top_k_scan(): reject 256-float
blocks with one HVX max-reduce and insert only surviving elements into a
sorted k-entry list. Used for k in 2..64 and rows wider than 1024, in both
the single-row and multi-row paths.

Ties keep the first-seen index. NaN is treated as -INF.

• hex-top-k: eliminate scalar reads from vtcm

Co-authored-by: Max Krasnyansky maxk@qti.qualcomm.com