On Thu, 14 May 2026 12:43:21 GMT, Ferenc Rakoczi <[email protected]> wrote:
>> An aarch64 implementation of the MontgomeryIntegerPolynomial256.mult() >> method and IntegerPolynomial.conditionalAssign(). Since 64-bit >> multiplication is not supported on Neon and manually performing this >> operation with 32-bit limbs is slower than with GPRs, a hybrid neon/gpr >> approach is used. Neon instructions are used to compute intermediate values >> used in the last two iterations of the main "loop", while the GPRs compute >> the first few iterations. At the method level this improves performance by >> ~9% and at the API level roughly 5%. >> >> >> >> --------- >> - [x] I confirm that I make this contribution in accordance with the >> [OpenJDK Interim AI Policy](https://openjdk.org/legal/ai). > > Ferenc Rakoczi has updated the pull request incrementally with one additional > commit since the last revision: > > Added AOT Code Cache related code + some cosmetic changes src/hotspot/cpu/aarch64/stubGenerator_aarch64.cpp line 7820: > 7818: __ mov(c_ptr, sp); > 7819: > 7820: // Calculate limb mask Suggestion: // Calculate (52-bit) limb masks for both gpr and vector registers ------------- PR Review Comment: https://git.openjdk.org/jdk/pull/30941#discussion_r3257445888
