> 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: Accepting more suggestions from Andrew Dinn. ------------- Changes: - all: https://git.openjdk.org/jdk/pull/30941/files - new: https://git.openjdk.org/jdk/pull/30941/files/c1d649b2..01baecea Webrevs: - full: https://webrevs.openjdk.org/?repo=jdk&pr=30941&range=04 - incr: https://webrevs.openjdk.org/?repo=jdk&pr=30941&range=03-04 Stats: 3 lines in 1 file changed: 0 ins; 0 del; 3 mod Patch: https://git.openjdk.org/jdk/pull/30941.diff Fetch: git fetch https://git.openjdk.org/jdk.git pull/30941/head:pull/30941 PR: https://git.openjdk.org/jdk/pull/30941
