< prev index next >
test/jdk/jdk/incubator/vector/IntMaxVectorTests.java
Print this page
@@ -244,10 +244,22 @@
} catch (AssertionError e) {
Assert.assertEquals(r[i], f.apply(a[i], b[i]), "(" + a[i] + ", " + b[i] + ") at index #" + i);
}
}
+ static void assertBroadcastArraysEquals(int[] a, int[] b, int[] r, FBinOp f) {
+ int i = 0;
+ try {
+ for (; i < a.length; i++) {
+ Assert.assertEquals(r[i], f.apply(a[i], b[(i / SPECIES.length()) * SPECIES.length()]));
+ }
+ } catch (AssertionError e) {
+ Assert.assertEquals(r[i], f.apply(a[i], b[(i / SPECIES.length()) * SPECIES.length()]),
+ "(" + a[i] + ", " + b[(i / SPECIES.length()) * SPECIES.length()] + ") at index #" + i);
+ }
+ }
+
static void assertArraysEquals(int[] a, int[] b, int[] r, boolean[] mask, FBinOp f) {
assertArraysEquals(a, b, r, mask, FBinMaskOp.lift(f));
}
static void assertArraysEquals(int[] a, int[] b, int[] r, boolean[] mask, FBinMaskOp f) {
@@ -259,10 +271,28 @@
} catch (AssertionError err) {
Assert.assertEquals(r[i], f.apply(a[i], b[i], mask[i % SPECIES.length()]), "at index #" + i + ", input1 = " + a[i] + ", input2 = " + b[i] + ", mask = " + mask[i % SPECIES.length()]);
}
}
+ static void assertBroadcastArraysEquals(int[] a, int[] b, int[] r, boolean[] mask, FBinOp f) {
+ assertBroadcastArraysEquals(a, b, r, mask, FBinMaskOp.lift(f));
+ }
+
+ static void assertBroadcastArraysEquals(int[] a, int[] b, int[] r, boolean[] mask, FBinMaskOp f) {
+ int i = 0;
+ try {
+ for (; i < a.length; i++) {
+ Assert.assertEquals(r[i], f.apply(a[i], b[(i / SPECIES.length()) * SPECIES.length()], mask[i % SPECIES.length()]));
+ }
+ } catch (AssertionError err) {
+ Assert.assertEquals(r[i], f.apply(a[i], b[(i / SPECIES.length()) * SPECIES.length()],
+ mask[i % SPECIES.length()]), "at index #" + i + ", input1 = " + a[i] +
+ ", input2 = " + b[(i / SPECIES.length()) * SPECIES.length()] + ", mask = " +
+ mask[i % SPECIES.length()]);
+ }
+ }
+
static void assertShiftArraysEquals(int[] a, int[] b, int[] r, FBinOp f) {
int i = 0;
int j = 0;
try {
for (; j < a.length; j += SPECIES.length()) {
@@ -1377,10 +1407,30 @@
}
}
assertArraysEquals(a, b, r, IntMaxVectorTests::OR);
}
+ static int or(int a, int b) {
+ return (int)(a | b);
+ }
+
+ @Test(dataProvider = "intBinaryOpProvider")
+ static void orIntMaxVectorTests(IntFunction<int[]> fa, IntFunction<int[]> fb) {
+ int[] a = fa.apply(SPECIES.length());
+ int[] b = fb.apply(SPECIES.length());
+ int[] r = fr.apply(SPECIES.length());
+
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ IntVector av = IntVector.fromArray(SPECIES, a, i);
+ IntVector bv = IntVector.fromArray(SPECIES, b, i);
+ av.or(bv).intoArray(r, i);
+ }
+ }
+
+ assertArraysEquals(a, b, r, IntMaxVectorTests::or);
+ }
@Test(dataProvider = "intBinaryOpMaskProvider")
static void ORIntMaxVectorTestsMasked(IntFunction<int[]> fa, IntFunction<int[]> fb,
@@ -1445,10 +1495,193 @@
assertArraysEquals(a, b, r, mask, IntMaxVectorTests::XOR);
}
+ @Test(dataProvider = "intBinaryOpProvider")
+ static void addIntMaxVectorTestsBroadcastSmokeTest(IntFunction<int[]> fa, IntFunction<int[]> fb) {
+ int[] a = fa.apply(SPECIES.length());
+ int[] b = fb.apply(SPECIES.length());
+ int[] r = fr.apply(SPECIES.length());
+
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ IntVector av = IntVector.fromArray(SPECIES, a, i);
+ av.add(b[i]).intoArray(r, i);
+ }
+
+ assertBroadcastArraysEquals(a, b, r, IntMaxVectorTests::add);
+ }
+
+ @Test(dataProvider = "intBinaryOpMaskProvider")
+ static void addIntMaxVectorTestsBroadcastMaskedSmokeTest(IntFunction<int[]> fa, IntFunction<int[]> fb,
+ IntFunction<boolean[]> fm) {
+ int[] a = fa.apply(SPECIES.length());
+ int[] b = fb.apply(SPECIES.length());
+ int[] r = fr.apply(SPECIES.length());
+ boolean[] mask = fm.apply(SPECIES.length());
+ VectorMask<Integer> vmask = VectorMask.fromArray(SPECIES, mask, 0);
+
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ IntVector av = IntVector.fromArray(SPECIES, a, i);
+ av.add(b[i], vmask).intoArray(r, i);
+ }
+
+ assertBroadcastArraysEquals(a, b, r, mask, IntMaxVectorTests::add);
+ }
+
+ @Test(dataProvider = "intBinaryOpProvider")
+ static void subIntMaxVectorTestsBroadcastSmokeTest(IntFunction<int[]> fa, IntFunction<int[]> fb) {
+ int[] a = fa.apply(SPECIES.length());
+ int[] b = fb.apply(SPECIES.length());
+ int[] r = fr.apply(SPECIES.length());
+
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ IntVector av = IntVector.fromArray(SPECIES, a, i);
+ av.sub(b[i]).intoArray(r, i);
+ }
+
+ assertBroadcastArraysEquals(a, b, r, IntMaxVectorTests::sub);
+ }
+
+ @Test(dataProvider = "intBinaryOpMaskProvider")
+ static void subIntMaxVectorTestsBroadcastMaskedSmokeTest(IntFunction<int[]> fa, IntFunction<int[]> fb,
+ IntFunction<boolean[]> fm) {
+ int[] a = fa.apply(SPECIES.length());
+ int[] b = fb.apply(SPECIES.length());
+ int[] r = fr.apply(SPECIES.length());
+ boolean[] mask = fm.apply(SPECIES.length());
+ VectorMask<Integer> vmask = VectorMask.fromArray(SPECIES, mask, 0);
+
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ IntVector av = IntVector.fromArray(SPECIES, a, i);
+ av.sub(b[i], vmask).intoArray(r, i);
+ }
+
+ assertBroadcastArraysEquals(a, b, r, mask, IntMaxVectorTests::sub);
+ }
+
+ @Test(dataProvider = "intBinaryOpProvider")
+ static void mulIntMaxVectorTestsBroadcastSmokeTest(IntFunction<int[]> fa, IntFunction<int[]> fb) {
+ int[] a = fa.apply(SPECIES.length());
+ int[] b = fb.apply(SPECIES.length());
+ int[] r = fr.apply(SPECIES.length());
+
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ IntVector av = IntVector.fromArray(SPECIES, a, i);
+ av.mul(b[i]).intoArray(r, i);
+ }
+
+ assertBroadcastArraysEquals(a, b, r, IntMaxVectorTests::mul);
+ }
+
+ @Test(dataProvider = "intBinaryOpMaskProvider")
+ static void mulIntMaxVectorTestsBroadcastMaskedSmokeTest(IntFunction<int[]> fa, IntFunction<int[]> fb,
+ IntFunction<boolean[]> fm) {
+ int[] a = fa.apply(SPECIES.length());
+ int[] b = fb.apply(SPECIES.length());
+ int[] r = fr.apply(SPECIES.length());
+ boolean[] mask = fm.apply(SPECIES.length());
+ VectorMask<Integer> vmask = VectorMask.fromArray(SPECIES, mask, 0);
+
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ IntVector av = IntVector.fromArray(SPECIES, a, i);
+ av.mul(b[i], vmask).intoArray(r, i);
+ }
+
+ assertBroadcastArraysEquals(a, b, r, mask, IntMaxVectorTests::mul);
+ }
+
+
+
+
+ @Test(dataProvider = "intBinaryOpProvider")
+ static void divIntMaxVectorTestsBroadcastSmokeTest(IntFunction<int[]> fa, IntFunction<int[]> fb) {
+ int[] a = fa.apply(SPECIES.length());
+ int[] b = fb.apply(SPECIES.length());
+ int[] r = fr.apply(SPECIES.length());
+
+ replaceZero(b, (int) 1);
+
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ IntVector av = IntVector.fromArray(SPECIES, a, i);
+ av.div(b[i]).intoArray(r, i);
+ }
+
+ assertBroadcastArraysEquals(a, b, r, IntMaxVectorTests::div);
+ }
+
+
+
+ @Test(dataProvider = "intBinaryOpMaskProvider")
+ static void divIntMaxVectorTestsBroadcastMaskedSmokeTest(IntFunction<int[]> fa, IntFunction<int[]> fb,
+ IntFunction<boolean[]> fm) {
+ int[] a = fa.apply(SPECIES.length());
+ int[] b = fb.apply(SPECIES.length());
+ int[] r = fr.apply(SPECIES.length());
+ boolean[] mask = fm.apply(SPECIES.length());
+ VectorMask<Integer> vmask = VectorMask.fromArray(SPECIES, mask, 0);
+
+ replaceZero(b, (int) 1);
+
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ IntVector av = IntVector.fromArray(SPECIES, a, i);
+ av.div(b[i], vmask).intoArray(r, i);
+ }
+
+ assertBroadcastArraysEquals(a, b, r, mask, IntMaxVectorTests::div);
+ }
+
+
+
+ @Test(dataProvider = "intBinaryOpProvider")
+ static void ORIntMaxVectorTestsBroadcastSmokeTest(IntFunction<int[]> fa, IntFunction<int[]> fb) {
+ int[] a = fa.apply(SPECIES.length());
+ int[] b = fb.apply(SPECIES.length());
+ int[] r = fr.apply(SPECIES.length());
+
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ IntVector av = IntVector.fromArray(SPECIES, a, i);
+ av.lanewise(VectorOperators.OR, b[i]).intoArray(r, i);
+ }
+
+ assertBroadcastArraysEquals(a, b, r, IntMaxVectorTests::OR);
+ }
+
+ @Test(dataProvider = "intBinaryOpProvider")
+ static void orIntMaxVectorTestsBroadcastSmokeTest(IntFunction<int[]> fa, IntFunction<int[]> fb) {
+ int[] a = fa.apply(SPECIES.length());
+ int[] b = fb.apply(SPECIES.length());
+ int[] r = fr.apply(SPECIES.length());
+
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ IntVector av = IntVector.fromArray(SPECIES, a, i);
+ av.or(b[i]).intoArray(r, i);
+ }
+
+ assertBroadcastArraysEquals(a, b, r, IntMaxVectorTests::or);
+ }
+
+
+
+ @Test(dataProvider = "intBinaryOpMaskProvider")
+ static void ORIntMaxVectorTestsBroadcastMaskedSmokeTest(IntFunction<int[]> fa, IntFunction<int[]> fb,
+ IntFunction<boolean[]> fm) {
+ int[] a = fa.apply(SPECIES.length());
+ int[] b = fb.apply(SPECIES.length());
+ int[] r = fr.apply(SPECIES.length());
+ boolean[] mask = fm.apply(SPECIES.length());
+ VectorMask<Integer> vmask = VectorMask.fromArray(SPECIES, mask, 0);
+
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ IntVector av = IntVector.fromArray(SPECIES, a, i);
+ av.lanewise(VectorOperators.OR, b[i], vmask).intoArray(r, i);
+ }
+
+ assertBroadcastArraysEquals(a, b, r, mask, IntMaxVectorTests::OR);
+ }
+
+
static int LSHL(int a, int b) {
return (int)((a << b));
}
@Test(dataProvider = "intBinaryOpProvider")
@@ -1807,10 +2040,66 @@
}
assertArraysEquals(a, b, r, IntMaxVectorTests::max);
}
+ @Test(dataProvider = "intBinaryOpProvider")
+ static void MINIntMaxVectorTestsBroadcastSmokeTest(IntFunction<int[]> fa, IntFunction<int[]> fb) {
+ int[] a = fa.apply(SPECIES.length());
+ int[] b = fb.apply(SPECIES.length());
+ int[] r = fr.apply(SPECIES.length());
+
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ IntVector av = IntVector.fromArray(SPECIES, a, i);
+ av.lanewise(VectorOperators.MIN, b[i]).intoArray(r, i);
+ }
+
+ assertBroadcastArraysEquals(a, b, r, IntMaxVectorTests::MIN);
+ }
+
+ @Test(dataProvider = "intBinaryOpProvider")
+ static void minIntMaxVectorTestsBroadcastSmokeTest(IntFunction<int[]> fa, IntFunction<int[]> fb) {
+ int[] a = fa.apply(SPECIES.length());
+ int[] b = fb.apply(SPECIES.length());
+ int[] r = fr.apply(SPECIES.length());
+
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ IntVector av = IntVector.fromArray(SPECIES, a, i);
+ av.min(b[i]).intoArray(r, i);
+ }
+
+ assertBroadcastArraysEquals(a, b, r, IntMaxVectorTests::min);
+ }
+
+ @Test(dataProvider = "intBinaryOpProvider")
+ static void MAXIntMaxVectorTestsBroadcastSmokeTest(IntFunction<int[]> fa, IntFunction<int[]> fb) {
+ int[] a = fa.apply(SPECIES.length());
+ int[] b = fb.apply(SPECIES.length());
+ int[] r = fr.apply(SPECIES.length());
+
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ IntVector av = IntVector.fromArray(SPECIES, a, i);
+ av.lanewise(VectorOperators.MAX, b[i]).intoArray(r, i);
+ }
+
+ assertBroadcastArraysEquals(a, b, r, IntMaxVectorTests::MAX);
+ }
+
+ @Test(dataProvider = "intBinaryOpProvider")
+ static void maxIntMaxVectorTestsBroadcastSmokeTest(IntFunction<int[]> fa, IntFunction<int[]> fb) {
+ int[] a = fa.apply(SPECIES.length());
+ int[] b = fb.apply(SPECIES.length());
+ int[] r = fr.apply(SPECIES.length());
+
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ IntVector av = IntVector.fromArray(SPECIES, a, i);
+ av.max(b[i]).intoArray(r, i);
+ }
+
+ assertBroadcastArraysEquals(a, b, r, IntMaxVectorTests::max);
+ }
+
static int AND(int[] a, int idx) {
int res = -1;
for (int i = idx; i < (idx + SPECIES.length()); i++) {
res &= a[i];
}
@@ -3251,10 +3540,14 @@
static int NEG(int a) {
return (int)(-((int)a));
}
+ static int neg(int a) {
+ return (int)(-((int)a));
+ }
+
@Test(dataProvider = "intUnaryOpProvider")
static void NEGIntMaxVectorTests(IntFunction<int[]> fa) {
int[] a = fa.apply(SPECIES.length());
int[] r = fr.apply(SPECIES.length());
@@ -3266,10 +3559,25 @@
}
assertArraysEquals(a, r, IntMaxVectorTests::NEG);
}
+ @Test(dataProvider = "intUnaryOpProvider")
+ static void negIntMaxVectorTests(IntFunction<int[]> fa) {
+ int[] a = fa.apply(SPECIES.length());
+ int[] r = fr.apply(SPECIES.length());
+
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ IntVector av = IntVector.fromArray(SPECIES, a, i);
+ av.neg().intoArray(r, i);
+ }
+ }
+
+ assertArraysEquals(a, r, IntMaxVectorTests::neg);
+ }
+
@Test(dataProvider = "intUnaryOpMaskProvider")
static void NEGMaskedIntMaxVectorTests(IntFunction<int[]> fa,
IntFunction<boolean[]> fm) {
int[] a = fa.apply(SPECIES.length());
int[] r = fr.apply(SPECIES.length());
@@ -3345,10 +3653,14 @@
static int NOT(int a) {
return (int)(~((int)a));
}
+ static int not(int a) {
+ return (int)(~((int)a));
+ }
+
@Test(dataProvider = "intUnaryOpProvider")
static void NOTIntMaxVectorTests(IntFunction<int[]> fa) {
int[] a = fa.apply(SPECIES.length());
@@ -3362,10 +3674,25 @@
}
assertArraysEquals(a, r, IntMaxVectorTests::NOT);
}
+ @Test(dataProvider = "intUnaryOpProvider")
+ static void notIntMaxVectorTests(IntFunction<int[]> fa) {
+ int[] a = fa.apply(SPECIES.length());
+ int[] r = fr.apply(SPECIES.length());
+
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ IntVector av = IntVector.fromArray(SPECIES, a, i);
+ av.not().intoArray(r, i);
+ }
+ }
+
+ assertArraysEquals(a, r, IntMaxVectorTests::not);
+ }
+
@Test(dataProvider = "intUnaryOpMaskProvider")
static void NOTMaskedIntMaxVectorTests(IntFunction<int[]> fa,
IntFunction<boolean[]> fm) {
< prev index next >