New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
8257436: [aarch64] Regressions in ArrayCopyUnalignedDst.testByte/testChar for 65-78 bytes when UseSIMDForMemoryOps is on #1558
Conversation
|
Webrevs
|
@theRealAph could please check if it causes any issues on ThunderX 2? Thanks, |
Is there some script you use that generates the comparison? Otherwise it'll take some time. |
Unfortunately, no. I have scripts that do runs. Then I pull all results in Excel. |
b7bd38d
to
3d9d919
Compare
I updated the attached data. It now includes the following:
The fix is narrowed to be used for byte and char arraycopies. They have the most problems with unaligned accesses. Int arraycopies are at least 4 byte aligned. Long arraycopies are always 8 byte aligned. |
Mailing list message from Andrew Haley on hotspot-compiler-dev: On 02/12/2020 11:14, Evgeny Astigeevich wrote:
Given the nature of the change, I don't expect to see regressions on -- |
I am attaching performance data for int arraycopy to show the impact of the patch on it: |
Hi Evegeny,
thanks for fixing this. Your change looks good to me. Thanks especially for measuring all the different cases.
I only have two minor request regarding the comments. Once fixed I'll sponsor this change.
Best regards,
Volker
…Char for 65-78 bytes when UseSIMDForMemoryOps is on On Graviton 2 ArrayCopyUnaligned of data range 65 - 78 bytes with the sequence of 'ldpq,ldpq,ldp,stpq,stpq,stp' is faster than with the sequence of 'ldpq,ldpq,ldpq,stpq,stpq,stpq'.
@eastig This change now passes all automated pre-integration checks. After integration, the commit message for the final commit will be:
You can use pull request commands such as /summary, /contributor and /issue to adjust it as needed. At the time when this comment was updated there had been 51 new commits pushed to the
As there are no conflicts, your changes will automatically be rebased on top of these commits when integrating. If you prefer to avoid this automatic rebasing, please check the documentation for the /integrate command for further details. As you do not have Committer status in this project an existing Committer must agree to sponsor your change. Possible candidates are the reviewers of this PR (@simonis) but any other Committer may sponsor as well.
|
/integrate |
/sponsor |
@simonis @eastig Since your change was applied there have been 53 commits pushed to the
Your commit was automatically rebased without conflicts. Pushed as commit e836396. |
Copying data in range 65 - 80 bytes with
is faster than with
when pointers involved are not properly aligned. This mostly affects byte and char arraycopy.
This patch fixes regressions of ArrayCopyUnalignedDst.testByte/testChar when UseSIMDForMemoryOps is on.
See the attached results for performance data
test_byte_results.txt
test_char_results.txt
Progress
Issue
Reviewers
Download
$ git fetch https://git.openjdk.java.net/jdk pull/1558/head:pull/1558
$ git checkout pull/1558