On Tue, 27 Aug 2024 20:25:46 GMT, Paul Sandoz <psan...@openjdk.org> wrote:
> How fast do we need to be here given we are measuring in a few nanoseconds > per operation? > > What if the goal is not to regress from say explicitly filling in a small > sized segment or a comparable array (e.g., < 8 bytes) then maybe a loop > suffices and the code is simple? Fair question. I have another version (called "patch bits" below) that is based on bit logic (first doing int ops, then short and lastly byte, similar to `ArraySupport::vectorizedMismatch`). This has slightly worse performance but is more scalable and perhaps simpler.  ------------- PR Comment: https://git.openjdk.org/jdk/pull/20712#issuecomment-2314760835
