infernap12/jdk
1
0
Fork 0
mirror of https://github.com/openjdk/jdk.git synced 2026-01-28 12:09:14 +00:00
Code Issues Packages Projects Releases Wiki Activity

findMinIndex

Browse Source
This commit is contained in:
Emanuel Peter 2025-12-04 19:16:14 +01:00
parent 578c12aa56
commit 35c52fe35e
4 changed files with 64 additions and 17 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
test/hotspot/jtreg/compiler/vectorization/TestVectorAlgorithms.java
View File

@ -115,7 +115,7 @@ public class TestVectorAlgorithms {
int size = 100_000 + RANDOM.nextInt(10_000);
aI = new int[size];
G.fill(INT_GEN, aI);
for (int i = 0; i < aI.length; i++) { aI[i] = i; }
//for (int i = 0; i < aI.length; i++) { aI[i] = i; }
rI1 = new int[size];
rI2 = new int[size];
rI3 = new int[size];

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

@ -168,25 +168,23 @@ public class VectorAlgorithmsImpl {
}
public static int findMinIndex_VectorAPI(int[] a) {
var mins = IntVector.broadcast(SPECIES_I, a[0]);
var idxs = IntVector.broadcast(SPECIES_I, 0);
var iota = IntVector.broadcast(SPECIES_I, 1).addIndex(1);
// Main approach: have partial results in mins and idxs.
var mins = IntVector.broadcast(SPECIES_I512, a[0]);
var idxs = IntVector.broadcast(SPECIES_I512, 0);
var iota = IntVector.broadcast(SPECIES_I512, 0).addIndex(1);
int i = 0;
for (; i < SPECIES_I.loopBound(a.length); i += SPECIES_I.length()) {
IntVector v = IntVector.fromArray(SPECIES_I, a, i);
for (; i < SPECIES_I512.loopBound(a.length); i += SPECIES_I512.length()) {
IntVector v = IntVector.fromArray(SPECIES_I512, a, i);
var mask = v.compare(VectorOperators.LT, mins);
mins = mins.blend(v, mask);
idxs = idxs.blend(iota, mask);
iota = iota.add(SPECIES_I.length());
}
int min = mins.lane(0);
int index = idxs.lane(0);
for (int j = 1; j < SPECIES_I.length(); j++) {
if (mins.lane(j) < min) {
min = mins.lane(j);
index = idxs.lane(j);
}
iota = iota.add(SPECIES_I512.length());
}
// Reduce the vectors down
int min = mins.reduceLanes(VectorOperators.MIN);
var not_min_mask = mins.compare(VectorOperators.NE, min);
int index = idxs.blend(a.length, not_min_mask).reduceLanes(VectorOperators.MIN);
// Tail loop
for (; i < a.length; i++) {
int ai = a[i];
if (ai < min) {
@ -196,6 +194,4 @@ public class VectorAlgorithmsImpl {
}
return index;
}
}

10
test/micro/org/openjdk/bench/vm/compiler/VectorAlgorithms.java
View File

@ -97,4 +97,14 @@ public class VectorAlgorithms {
public Object scanAddI_VectorAPI_permute_add() {
return VectorAlgorithmsImpl.scanAddI_VectorAPI_permute_add(aI, rI);
}
@Benchmark
public int findMinIndex_loop() {
return VectorAlgorithmsImpl.findMinIndex_loop(aI);
}
@Benchmark
public int findMinIndex_VectorAPI() {
return VectorAlgorithmsImpl.findMinIndex_VectorAPI(aI);
}
}

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

@ -153,4 +153,45 @@ public class VectorAlgorithmsImpl {
}
return r;
}
public static int findMinIndex_loop(int[] a) {
int min = a[0];
int index = 0;
for (int i = 1; i < a.length; i++) {
int ai = a[i];
if (ai < min) {
min = ai;
index = i;
}
}
return index;
}
public static int findMinIndex_VectorAPI(int[] a) {
// Main approach: have partial results in mins and idxs.
var mins = IntVector.broadcast(SPECIES_I512, a[0]);
var idxs = IntVector.broadcast(SPECIES_I512, 0);
var iota = IntVector.broadcast(SPECIES_I512, 0).addIndex(1);
int i = 0;
for (; i < SPECIES_I512.loopBound(a.length); i += SPECIES_I512.length()) {
IntVector v = IntVector.fromArray(SPECIES_I512, a, i);
var mask = v.compare(VectorOperators.LT, mins);
mins = mins.blend(v, mask);
idxs = idxs.blend(iota, mask);
iota = iota.add(SPECIES_I512.length());
}
// Reduce the vectors down
int min = mins.reduceLanes(VectorOperators.MIN);
var not_min_mask = mins.compare(VectorOperators.NE, min);
int index = idxs.blend(a.length, not_min_mask).reduceLanes(VectorOperators.MIN);
// Tail loop
for (; i < a.length; i++) {
int ai = a[i];
if (ai < min) {
min = ai;
index = i;
}
}
return index;
}
}