-
Notifications
You must be signed in to change notification settings - Fork 6.1k
8290322: Optimize Vector.rearrange over byte vectors for AVX512BW targets. #9498
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
Closed
Closed
Changes from all commits
Commits
Show all changes
6 commits
Select commit
Hold shift + click to select a range
8e80f63
8290322: Optimize Vector.rearrange over byte vectors for AVX512BW tar…
71a8436
Merge branch 'master' of http://github.com/openjdk/jdk into JDK-8290322
9be66f7
Merge branch 'master' of http://github.com/openjdk/jdk into JDK-8290322
61c83c9
8290322: Review comments resolution.
c7f7dd1
8290322: Review comments resolution.
664926f
8290322: Further optimization based on review comments.
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
111 changes: 111 additions & 0 deletions
111
test/micro/org/openjdk/bench/jdk/incubator/vector/RearrangeBytesBenchmark.java
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,111 @@ | ||
/* | ||
* Copyright (c) 2022, Oracle and/or its affiliates. All rights reserved. | ||
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. | ||
* | ||
* This code is free software; you can redistribute it and/or modify it | ||
* under the terms of the GNU General Public License version 2 only, as | ||
* published by the Free Software Foundation. | ||
* | ||
* This code is distributed in the hope that it will be useful, but WITHOUT | ||
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | ||
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | ||
* version 2 for more details (a copy is included in the LICENSE file that | ||
* accompanied this code). | ||
* | ||
* You should have received a copy of the GNU General Public License version | ||
* 2 along with this work; if not, write to the Free Software Foundation, | ||
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | ||
* | ||
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA | ||
* or visit www.oracle.com if you need additional information or have any | ||
* questions. | ||
* | ||
*/ | ||
|
||
package org.openjdk.bench.jdk.incubator.vector; | ||
|
||
import java.util.Random; | ||
import jdk.incubator.vector.*; | ||
import java.util.concurrent.TimeUnit; | ||
import org.openjdk.jmh.annotations.*; | ||
import org.openjdk.jmh.infra.Blackhole; | ||
|
||
@OutputTimeUnit(TimeUnit.MILLISECONDS) | ||
@State(Scope.Thread) | ||
@Fork(jvmArgsPrepend = {"--add-modules=jdk.incubator.vector"}) | ||
public class RearrangeBytesBenchmark { | ||
@Param({"256", "512", "1024"}) | ||
int size; | ||
|
||
int [][] shuffles; | ||
byte[] byteinp; | ||
byte[] byteres; | ||
|
||
static final VectorSpecies<Byte> bspecies64 = ByteVector.SPECIES_64; | ||
static final VectorSpecies<Byte> bspecies128 = ByteVector.SPECIES_128; | ||
static final VectorSpecies<Byte> bspecies256 = ByteVector.SPECIES_256; | ||
static final VectorSpecies<Byte> bspecies512 = ByteVector.SPECIES_512; | ||
|
||
static final byte[] specialvalsbyte = {0, -0, Byte.MIN_VALUE, Byte.MAX_VALUE}; | ||
|
||
@Setup(Level.Trial) | ||
public void BmSetup() { | ||
Random r = new Random(1024); | ||
int [] bits = {64, 128, 256, 512}; | ||
byteinp = new byte[size]; | ||
byteres = new byte[size]; | ||
|
||
for (int i = 4; i < size; i++) { | ||
byteinp[i] = (byte)i; | ||
} | ||
for (int i = 0; i < specialvalsbyte.length; i++) { | ||
byteinp[i] = specialvalsbyte[i]; | ||
} | ||
|
||
shuffles = new int[4][]; | ||
for (int i = 0; i < bits.length; i++) { | ||
int bytes = bits[i] >> 3; | ||
shuffles[i] = new int[bytes]; | ||
for (int j = 0; j < bytes ; j++) { | ||
shuffles[i][j] = r.nextInt(bytes - 1); | ||
} | ||
} | ||
} | ||
|
||
@Benchmark | ||
public void testRearrangeBytes64() { | ||
VectorShuffle<Byte> shuffle = VectorShuffle.fromArray(bspecies512, shuffles[3], 0); | ||
for (int j = 0; j < bspecies512.loopBound(size); j += bspecies512.length()) { | ||
ByteVector.fromArray(bspecies512, byteinp, j) | ||
.rearrange(shuffle) | ||
.intoArray(byteres, j); | ||
} | ||
} | ||
@Benchmark | ||
public void testRearrangeBytes32() { | ||
VectorShuffle<Byte> shuffle = VectorShuffle.fromArray(bspecies256, shuffles[2], 0); | ||
for (int j = 0; j < bspecies256.loopBound(size); j += bspecies256.length()) { | ||
ByteVector.fromArray(bspecies256, byteinp, j) | ||
.rearrange(shuffle) | ||
.intoArray(byteres, j); | ||
} | ||
} | ||
@Benchmark | ||
public void testRearrangeBytes16() { | ||
VectorShuffle<Byte> shuffle = VectorShuffle.fromArray(bspecies128, shuffles[1], 0); | ||
for (int j = 0; j < bspecies128.loopBound(size); j += bspecies128.length()) { | ||
ByteVector.fromArray(bspecies128, byteinp, j) | ||
.rearrange(shuffle) | ||
.intoArray(byteres, j); | ||
} | ||
} | ||
@Benchmark | ||
public void testRearrangeBytes8() { | ||
VectorShuffle<Byte> shuffle = VectorShuffle.fromArray(bspecies64, shuffles[0], 0); | ||
for (int j = 0; j < bspecies64.loopBound(size); j += bspecies64.length()) { | ||
ByteVector.fromArray(bspecies64, byteinp, j) | ||
.rearrange(shuffle) | ||
.intoArray(byteres, j); | ||
} | ||
} | ||
} |
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Uh oh!
There was an error while loading. Please reload this page.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Can we use the same approach as that used for 256-bit vector. Something similar to:
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Actually, it is my bad, this should not work. Sorry for the noise.