infernap12/jdk
1
0
Fork 0
mirror of https://github.com/openjdk/jdk.git synced 2026-07-02 15:20:27 +00:00
Code Issues Packages Projects Releases Wiki Activity

8376803: Jtreg test compiler/vectorization/TestVectorAlgorithms.java fails after JDK-8373026

Browse Source 
Reviewed-by: amitkumar, epeter
This commit is contained in:
Sorna Sarathi N 2026-06-22 08:17:10 +00:00 committed by Amit Kumar
parent 1fa4eb1b6a
commit b16d8fa414
3 changed files with 44 additions and 22 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
test/hotspot/jtreg/ProblemList.txt
View File

@ -58,10 +58,6 @@ compiler/codecache/jmx/PoolsIndependenceTest.java 8264632 macosx-all
compiler/vectorapi/VectorRebracket128Test.java 8330538 generic-all
compiler/vectorization/TestVectorAlgorithms.java#noSuperWord 8376803 aix-ppc64,linux-s390x
compiler/vectorization/TestVectorAlgorithms.java#vanilla 8376803 aix-ppc64,linux-s390x
compiler/vectorization/TestVectorAlgorithms.java#noOptimizeFill 8376803 aix-ppc64,linux-s390x
compiler/floatingpoint/TestSubnormalFloat.java 8317810 generic-i586
compiler/floatingpoint/TestSubnormalDouble.java 8317810 generic-i586

31
test/hotspot/jtreg/compiler/vectorization/VectorAlgorithmsImpl.java
View File

@ -541,21 +541,34 @@ public class VectorAlgorithmsImpl {
int next = REVERSE_POWERS_OF_31_STEP_4[0]; // 31^L
var vcoef = IntVector.fromArray(SPECIES_I, REVERSE_POWERS_OF_31_STEP_4, 1); // W
var vresult = IntVector.zero(SPECIES_I);
final boolean isLE = java.nio.ByteOrder.nativeOrder() == java.nio.ByteOrder.LITTLE_ENDIAN;
int i;
for (i = 0; i < SPECIES_B.loopBound(a.length); i += SPECIES_B.length()) {
var vb = ByteVector.fromArray(SPECIES_B, a, i);
// Add 128 to each byte.
var vs = vb.lanewise(VectorOperators.XOR, (byte)0x80)
.reinterpretAsShorts();
// Each short lane contains 2 bytes, crunch them.
var vi = vs.and((short)0xff) // lower byte
.mul((short)31)
.add(vs.lanewise(VectorOperators.LSHR, 8)) // upper byte
.reinterpretAsInts();
// Each int contains 2 shorts, crunch them.
var v = vi.and(0xffff) // lower short
.mul(31 * 31)
.add(vi.lanewise(VectorOperators.LSHR, 16)); // upper short
// Each short lane contains 2 bytes.
// Extract them in logical byte order (b0, b1), independent of platform endianness.
ShortVector firstByte = isLE ? vs.and((short)0xff) // b0
: vs.lanewise(VectorOperators.LSHR, 8); // b0 on BE
ShortVector secondByte = isLE ? vs.lanewise(VectorOperators.LSHR, 8) // b1
: vs.and((short)0xff); // b1 on BE
// Combine each byte pair into a pairwise hash value.
var vi = firstByte.mul((short)31)
.add(secondByte)
.reinterpretAsInts();
// Each int lane contains two pairwise hash chunks:
// p0 = b0 * 31 + b1
// p1 = b2 * 31 + b3
// Extract them in logical order, independent of platform endianness.
IntVector firstPair = isLE ? vi.and(0xffff) // p0
: vi.lanewise(VectorOperators.LSHR, 16); // p0 on BE
IntVector secondPair = isLE ? vi.lanewise(VectorOperators.LSHR, 16) // p1
: vi.and(0xffff); // p1 on BE
// Crunch the pairwise results into one value.
var v = firstPair.mul(31 * 31)
.add(secondPair);
// Add the correction for the 128 additions above.
v = v.add(-128 * (31*31*31 + 31*31 + 31 + 1));
// Every element of v now contains a crunched int-package of 4 bytes.

31
test/micro/org/openjdk/bench/vm/compiler/VectorAlgorithmsImpl.java
View File

@ -541,21 +541,34 @@ public class VectorAlgorithmsImpl {
int next = REVERSE_POWERS_OF_31_STEP_4[0]; // 31^L
var vcoef = IntVector.fromArray(SPECIES_I, REVERSE_POWERS_OF_31_STEP_4, 1); // W
var vresult = IntVector.zero(SPECIES_I);
final boolean isLE = java.nio.ByteOrder.nativeOrder() == java.nio.ByteOrder.LITTLE_ENDIAN;
int i;
for (i = 0; i < SPECIES_B.loopBound(a.length); i += SPECIES_B.length()) {
var vb = ByteVector.fromArray(SPECIES_B, a, i);
// Add 128 to each byte.
var vs = vb.lanewise(VectorOperators.XOR, (byte)0x80)
.reinterpretAsShorts();
// Each short lane contains 2 bytes, crunch them.
var vi = vs.and((short)0xff) // lower byte
.mul((short)31)
.add(vs.lanewise(VectorOperators.LSHR, 8)) // upper byte
.reinterpretAsInts();
// Each int contains 2 shorts, crunch them.
var v = vi.and(0xffff) // lower short
.mul(31 * 31)
.add(vi.lanewise(VectorOperators.LSHR, 16)); // upper short
// Each short lane contains 2 bytes.
// Extract them in logical byte order (b0, b1), independent of platform endianness.
ShortVector firstByte = isLE ? vs.and((short)0xff) // b0
: vs.lanewise(VectorOperators.LSHR, 8); // b0 on BE
ShortVector secondByte = isLE ? vs.lanewise(VectorOperators.LSHR, 8) // b1
: vs.and((short)0xff); // b1 on BE
// Combine each byte pair into a pairwise hash value.
var vi = firstByte.mul((short)31)
.add(secondByte)
.reinterpretAsInts();
// Each int lane contains two pairswise hash chunks:
// p0 = b0 * 31 + b1
// p1 = b2 * 31 + b3
// Extract them in logical order, independent of platform endianness.
IntVector pair0 = isLE ? vi.and(0xffff) // p0
: vi.lanewise(VectorOperators.LSHR, 16); // p0 on BE
IntVector pair1 = isLE ? vi.lanewise(VectorOperators.LSHR, 16) // p1
: vi.and(0xffff); // p1 on BE
// Crunch the pairwise results into one value.
var v = pair0.mul(31 * 31)
.add(pair1);
// Add the correction for the 128 additions above.
v = v.add(-128 * (31*31*31 + 31*31 + 31 + 1));
// Every element of v now contains a crunched int-package of 4 bytes.