< prev index next >
test/jdk/jdk/incubator/vector/DoubleMaxVectorTests.java
Print this page
@@ -244,10 +244,21 @@
} catch (AssertionError e) {
Assert.assertEquals(r[i], f.apply(a[i], b[i]), "(" + a[i] + ", " + b[i] + ") at index #" + i);
}
}
+ static void assertBroadcastArraysEquals(double[] a, double[] b, double[] 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(double[] a, double[] b, double[] r, boolean[] mask, FBinOp f) {
assertArraysEquals(a, b, r, mask, FBinMaskOp.lift(f));
}
static void assertArraysEquals(double[] a, double[] b, double[] r, boolean[] mask, FBinMaskOp f) {
@@ -259,10 +270,25 @@
} 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(double[] a, double[] b, double[] r, boolean[] mask, FBinOp f) {
+ assertBroadcastArraysEquals(a, b, r, mask, FBinMaskOp.lift(f));
+ }
+
+ static void assertBroadcastArraysEquals(double[] a, double[] b, double[] 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(double[] a, double[] b, double[] r, FBinOp f) {
int i = 0;
int j = 0;
try {
for (; j < a.length; j += SPECIES.length()) {
@@ -1268,10 +1294,142 @@
+ @Test(dataProvider = "doubleBinaryOpProvider")
+ static void addDoubleMaxVectorTestsBroadcastSmokeTest(IntFunction<double[]> fa, IntFunction<double[]> fb) {
+ double[] a = fa.apply(SPECIES.length());
+ double[] b = fb.apply(SPECIES.length());
+ double[] r = fr.apply(SPECIES.length());
+
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
+ av.add(b[i]).intoArray(r, i);
+ }
+
+ assertBroadcastArraysEquals(a, b, r, DoubleMaxVectorTests::add);
+ }
+
+ @Test(dataProvider = "doubleBinaryOpMaskProvider")
+ static void addDoubleMaxVectorTestsBroadcastMaskedSmokeTest(IntFunction<double[]> fa, IntFunction<double[]> fb,
+ IntFunction<boolean[]> fm) {
+ double[] a = fa.apply(SPECIES.length());
+ double[] b = fb.apply(SPECIES.length());
+ double[] r = fr.apply(SPECIES.length());
+ boolean[] mask = fm.apply(SPECIES.length());
+ VectorMask<Double> vmask = VectorMask.fromArray(SPECIES, mask, 0);
+
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
+ av.add(b[i], vmask).intoArray(r, i);
+ }
+
+ assertBroadcastArraysEquals(a, b, r, mask, DoubleMaxVectorTests::add);
+ }
+
+ @Test(dataProvider = "doubleBinaryOpProvider")
+ static void subDoubleMaxVectorTestsBroadcastSmokeTest(IntFunction<double[]> fa, IntFunction<double[]> fb) {
+ double[] a = fa.apply(SPECIES.length());
+ double[] b = fb.apply(SPECIES.length());
+ double[] r = fr.apply(SPECIES.length());
+
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
+ av.sub(b[i]).intoArray(r, i);
+ }
+
+ assertBroadcastArraysEquals(a, b, r, DoubleMaxVectorTests::sub);
+ }
+
+ @Test(dataProvider = "doubleBinaryOpMaskProvider")
+ static void subDoubleMaxVectorTestsBroadcastMaskedSmokeTest(IntFunction<double[]> fa, IntFunction<double[]> fb,
+ IntFunction<boolean[]> fm) {
+ double[] a = fa.apply(SPECIES.length());
+ double[] b = fb.apply(SPECIES.length());
+ double[] r = fr.apply(SPECIES.length());
+ boolean[] mask = fm.apply(SPECIES.length());
+ VectorMask<Double> vmask = VectorMask.fromArray(SPECIES, mask, 0);
+
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
+ av.sub(b[i], vmask).intoArray(r, i);
+ }
+
+ assertBroadcastArraysEquals(a, b, r, mask, DoubleMaxVectorTests::sub);
+ }
+
+ @Test(dataProvider = "doubleBinaryOpProvider")
+ static void mulDoubleMaxVectorTestsBroadcastSmokeTest(IntFunction<double[]> fa, IntFunction<double[]> fb) {
+ double[] a = fa.apply(SPECIES.length());
+ double[] b = fb.apply(SPECIES.length());
+ double[] r = fr.apply(SPECIES.length());
+
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
+ av.mul(b[i]).intoArray(r, i);
+ }
+
+ assertBroadcastArraysEquals(a, b, r, DoubleMaxVectorTests::mul);
+ }
+
+ @Test(dataProvider = "doubleBinaryOpMaskProvider")
+ static void mulDoubleMaxVectorTestsBroadcastMaskedSmokeTest(IntFunction<double[]> fa, IntFunction<double[]> fb,
+ IntFunction<boolean[]> fm) {
+ double[] a = fa.apply(SPECIES.length());
+ double[] b = fb.apply(SPECIES.length());
+ double[] r = fr.apply(SPECIES.length());
+ boolean[] mask = fm.apply(SPECIES.length());
+ VectorMask<Double> vmask = VectorMask.fromArray(SPECIES, mask, 0);
+
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
+ av.mul(b[i], vmask).intoArray(r, i);
+ }
+
+ assertBroadcastArraysEquals(a, b, r, mask, DoubleMaxVectorTests::mul);
+ }
+
+
+ @Test(dataProvider = "doubleBinaryOpProvider")
+ static void divDoubleMaxVectorTestsBroadcastSmokeTest(IntFunction<double[]> fa, IntFunction<double[]> fb) {
+ double[] a = fa.apply(SPECIES.length());
+ double[] b = fb.apply(SPECIES.length());
+ double[] r = fr.apply(SPECIES.length());
+
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
+ av.div(b[i]).intoArray(r, i);
+ }
+
+ assertBroadcastArraysEquals(a, b, r, DoubleMaxVectorTests::div);
+ }
+
+
+
+ @Test(dataProvider = "doubleBinaryOpMaskProvider")
+ static void divDoubleMaxVectorTestsBroadcastMaskedSmokeTest(IntFunction<double[]> fa, IntFunction<double[]> fb,
+ IntFunction<boolean[]> fm) {
+ double[] a = fa.apply(SPECIES.length());
+ double[] b = fb.apply(SPECIES.length());
+ double[] r = fr.apply(SPECIES.length());
+ boolean[] mask = fm.apply(SPECIES.length());
+ VectorMask<Double> vmask = VectorMask.fromArray(SPECIES, mask, 0);
+
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
+ av.div(b[i], vmask).intoArray(r, i);
+ }
+
+ assertBroadcastArraysEquals(a, b, r, mask, DoubleMaxVectorTests::div);
+ }
+
+
+
+
+
+
@@ -1384,10 +1542,66 @@
}
assertArraysEquals(a, b, r, DoubleMaxVectorTests::max);
}
+ @Test(dataProvider = "doubleBinaryOpProvider")
+ static void MINDoubleMaxVectorTestsBroadcastSmokeTest(IntFunction<double[]> fa, IntFunction<double[]> fb) {
+ double[] a = fa.apply(SPECIES.length());
+ double[] b = fb.apply(SPECIES.length());
+ double[] r = fr.apply(SPECIES.length());
+
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
+ av.lanewise(VectorOperators.MIN, b[i]).intoArray(r, i);
+ }
+
+ assertBroadcastArraysEquals(a, b, r, DoubleMaxVectorTests::MIN);
+ }
+
+ @Test(dataProvider = "doubleBinaryOpProvider")
+ static void minDoubleMaxVectorTestsBroadcastSmokeTest(IntFunction<double[]> fa, IntFunction<double[]> fb) {
+ double[] a = fa.apply(SPECIES.length());
+ double[] b = fb.apply(SPECIES.length());
+ double[] r = fr.apply(SPECIES.length());
+
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
+ av.min(b[i]).intoArray(r, i);
+ }
+
+ assertBroadcastArraysEquals(a, b, r, DoubleMaxVectorTests::min);
+ }
+
+ @Test(dataProvider = "doubleBinaryOpProvider")
+ static void MAXDoubleMaxVectorTestsBroadcastSmokeTest(IntFunction<double[]> fa, IntFunction<double[]> fb) {
+ double[] a = fa.apply(SPECIES.length());
+ double[] b = fb.apply(SPECIES.length());
+ double[] r = fr.apply(SPECIES.length());
+
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
+ av.lanewise(VectorOperators.MAX, b[i]).intoArray(r, i);
+ }
+
+ assertBroadcastArraysEquals(a, b, r, DoubleMaxVectorTests::MAX);
+ }
+
+ @Test(dataProvider = "doubleBinaryOpProvider")
+ static void maxDoubleMaxVectorTestsBroadcastSmokeTest(IntFunction<double[]> fa, IntFunction<double[]> fb) {
+ double[] a = fa.apply(SPECIES.length());
+ double[] b = fb.apply(SPECIES.length());
+ double[] r = fr.apply(SPECIES.length());
+
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
+ av.max(b[i]).intoArray(r, i);
+ }
+
+ assertBroadcastArraysEquals(a, b, r, DoubleMaxVectorTests::max);
+ }
+
@@ -2998,10 +3212,14 @@
static double NEG(double a) {
return (double)(-((double)a));
}
+ static double neg(double a) {
+ return (double)(-((double)a));
+ }
+
@Test(dataProvider = "doubleUnaryOpProvider")
static void NEGDoubleMaxVectorTests(IntFunction<double[]> fa) {
double[] a = fa.apply(SPECIES.length());
double[] r = fr.apply(SPECIES.length());
@@ -3013,10 +3231,25 @@
}
assertArraysEquals(a, r, DoubleMaxVectorTests::NEG);
}
+ @Test(dataProvider = "doubleUnaryOpProvider")
+ static void negDoubleMaxVectorTests(IntFunction<double[]> fa) {
+ double[] a = fa.apply(SPECIES.length());
+ double[] r = fr.apply(SPECIES.length());
+
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
+ for (int i = 0; i < a.length; i += SPECIES.length()) {
+ DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
+ av.neg().intoArray(r, i);
+ }
+ }
+
+ assertArraysEquals(a, r, DoubleMaxVectorTests::neg);
+ }
+
@Test(dataProvider = "doubleUnaryOpMaskProvider")
static void NEGMaskedDoubleMaxVectorTests(IntFunction<double[]> fa,
IntFunction<boolean[]> fm) {
double[] a = fa.apply(SPECIES.length());
double[] r = fr.apply(SPECIES.length());
< prev index next >