RFR: 8323582: C2 SuperWord AlignVector: misaligned vector memory access with unaligned native memory

Emanuel Peter epeter at openjdk.org
Tue Feb 18 19:26:18 UTC 2025


On Tue, 18 Feb 2025 18:29:42 GMT, Vladimir Kozlov <kvn at openjdk.org> wrote:

> What probabilities for multi-version loops branches? Did non-vectorized version is move out of hot path in generated code?

I'm not sure what you are asking. Are you asking what probability I'm setting for the multi-version branch?

This is the loop selector, which later gets copied for each of the checks.
`const LoopSelector loop_selector(lpt, opaque, PROB_FAIR, COUNT_UNKNOWN);`

So 50%. But maybe you are suggesting it should really be biased towards the fast-path, right? What probability would you suggest? It should probably be fairly low, since there can be multiple checks added, and each one lowers the probability of arriving at the true-loop. So for scheduling, we should keep the probability high, so the true-loop is scheduled closer, right?

Is that what you meant?

-------------

PR Comment: https://git.openjdk.org/jdk/pull/22016#issuecomment-2666602599


More information about the hotspot-dev mailing list