< prev index next > test/jdk/jdk/incubator/vector/Short256VectorTests.java
Print this page
/*
! * Copyright (c) 2018, 2024, 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.
/*
! * Copyright (c) 2018, 2025, 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.
static final VectorSpecies<Short> SPECIES =
ShortVector.SPECIES_256;
static final int INVOC_COUNT = Integer.getInteger("jdk.incubator.vector.test.loop-iterations", 100);
+ static ShortVector bcast_vec = ShortVector.broadcast(SPECIES, (short)10);
+
private static final short CONST_SHIFT = Short.SIZE / 2;
static final int BUFFER_REPS = Integer.getInteger("jdk.incubator.vector.test.buffer-vectors", 25000 / 256);
assertShiftConstEquals(r, a, mask, Short256VectorTests::ROL_binary_const);
}
- static ShortVector bv_MIN = ShortVector.broadcast(SPECIES, (short)10);
-
@Test(dataProvider = "shortUnaryOpProvider")
static void MINShort256VectorTestsWithMemOp(IntFunction<short[]> fa) {
short[] a = fa.apply(SPECIES.length());
short[] r = fr.apply(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ShortVector av = ShortVector.fromArray(SPECIES, a, i);
! av.lanewise(VectorOperators.MIN, bv_MIN).intoArray(r, i);
}
}
assertArraysEquals(r, a, (short)10, Short256VectorTests::MIN);
}
- static ShortVector bv_min = ShortVector.broadcast(SPECIES, (short)10);
-
@Test(dataProvider = "shortUnaryOpProvider")
static void minShort256VectorTestsWithMemOp(IntFunction<short[]> fa) {
short[] a = fa.apply(SPECIES.length());
short[] r = fr.apply(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ShortVector av = ShortVector.fromArray(SPECIES, a, i);
! av.min(bv_min).intoArray(r, i);
}
}
assertArraysEquals(r, a, (short)10, Short256VectorTests::min);
}
- static ShortVector bv_MIN_M = ShortVector.broadcast(SPECIES, (short)10);
-
@Test(dataProvider = "shortUnaryOpMaskProvider")
static void MINShort256VectorTestsMaskedWithMemOp(IntFunction<short[]> fa, IntFunction<boolean[]> fm) {
short[] a = fa.apply(SPECIES.length());
short[] r = fr.apply(SPECIES.length());
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Short> vmask = VectorMask.fromArray(SPECIES, mask, 0);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ShortVector av = ShortVector.fromArray(SPECIES, a, i);
! av.lanewise(VectorOperators.MIN, bv_MIN_M, vmask).intoArray(r, i);
}
}
assertArraysEquals(r, a, (short)10, mask, Short256VectorTests::MIN);
}
- static ShortVector bv_MAX = ShortVector.broadcast(SPECIES, (short)10);
-
@Test(dataProvider = "shortUnaryOpProvider")
static void MAXShort256VectorTestsWithMemOp(IntFunction<short[]> fa) {
short[] a = fa.apply(SPECIES.length());
short[] r = fr.apply(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ShortVector av = ShortVector.fromArray(SPECIES, a, i);
! av.lanewise(VectorOperators.MAX, bv_MAX).intoArray(r, i);
}
}
assertArraysEquals(r, a, (short)10, Short256VectorTests::MAX);
}
- static ShortVector bv_max = ShortVector.broadcast(SPECIES, (short)10);
-
@Test(dataProvider = "shortUnaryOpProvider")
static void maxShort256VectorTestsWithMemOp(IntFunction<short[]> fa) {
short[] a = fa.apply(SPECIES.length());
short[] r = fr.apply(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ShortVector av = ShortVector.fromArray(SPECIES, a, i);
! av.max(bv_max).intoArray(r, i);
}
}
assertArraysEquals(r, a, (short)10, Short256VectorTests::max);
}
- static ShortVector bv_MAX_M = ShortVector.broadcast(SPECIES, (short)10);
-
@Test(dataProvider = "shortUnaryOpMaskProvider")
static void MAXShort256VectorTestsMaskedWithMemOp(IntFunction<short[]> fa, IntFunction<boolean[]> fm) {
short[] a = fa.apply(SPECIES.length());
short[] r = fr.apply(SPECIES.length());
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Short> vmask = VectorMask.fromArray(SPECIES, mask, 0);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ShortVector av = ShortVector.fromArray(SPECIES, a, i);
! av.lanewise(VectorOperators.MAX, bv_MAX_M, vmask).intoArray(r, i);
}
}
assertArraysEquals(r, a, (short)10, mask, Short256VectorTests::MAX);
}
assertShiftConstEquals(r, a, mask, Short256VectorTests::ROL_binary_const);
}
@Test(dataProvider = "shortUnaryOpProvider")
static void MINShort256VectorTestsWithMemOp(IntFunction<short[]> fa) {
short[] a = fa.apply(SPECIES.length());
short[] r = fr.apply(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ShortVector av = ShortVector.fromArray(SPECIES, a, i);
! av.lanewise(VectorOperators.MIN, bcast_vec).intoArray(r, i);
}
}
assertArraysEquals(r, a, (short)10, Short256VectorTests::MIN);
}
@Test(dataProvider = "shortUnaryOpProvider")
static void minShort256VectorTestsWithMemOp(IntFunction<short[]> fa) {
short[] a = fa.apply(SPECIES.length());
short[] r = fr.apply(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ShortVector av = ShortVector.fromArray(SPECIES, a, i);
! av.min(bcast_vec).intoArray(r, i);
}
}
assertArraysEquals(r, a, (short)10, Short256VectorTests::min);
}
@Test(dataProvider = "shortUnaryOpMaskProvider")
static void MINShort256VectorTestsMaskedWithMemOp(IntFunction<short[]> fa, IntFunction<boolean[]> fm) {
short[] a = fa.apply(SPECIES.length());
short[] r = fr.apply(SPECIES.length());
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Short> vmask = VectorMask.fromArray(SPECIES, mask, 0);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ShortVector av = ShortVector.fromArray(SPECIES, a, i);
! av.lanewise(VectorOperators.MIN, bcast_vec, vmask).intoArray(r, i);
}
}
assertArraysEquals(r, a, (short)10, mask, Short256VectorTests::MIN);
}
@Test(dataProvider = "shortUnaryOpProvider")
static void MAXShort256VectorTestsWithMemOp(IntFunction<short[]> fa) {
short[] a = fa.apply(SPECIES.length());
short[] r = fr.apply(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ShortVector av = ShortVector.fromArray(SPECIES, a, i);
! av.lanewise(VectorOperators.MAX, bcast_vec).intoArray(r, i);
}
}
assertArraysEquals(r, a, (short)10, Short256VectorTests::MAX);
}
@Test(dataProvider = "shortUnaryOpProvider")
static void maxShort256VectorTestsWithMemOp(IntFunction<short[]> fa) {
short[] a = fa.apply(SPECIES.length());
short[] r = fr.apply(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ShortVector av = ShortVector.fromArray(SPECIES, a, i);
! av.max(bcast_vec).intoArray(r, i);
}
}
assertArraysEquals(r, a, (short)10, Short256VectorTests::max);
}
@Test(dataProvider = "shortUnaryOpMaskProvider")
static void MAXShort256VectorTestsMaskedWithMemOp(IntFunction<short[]> fa, IntFunction<boolean[]> fm) {
short[] a = fa.apply(SPECIES.length());
short[] r = fr.apply(SPECIES.length());
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Short> vmask = VectorMask.fromArray(SPECIES, mask, 0);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ShortVector av = ShortVector.fromArray(SPECIES, a, i);
! av.lanewise(VectorOperators.MAX, bcast_vec, vmask).intoArray(r, i);
}
}
assertArraysEquals(r, a, (short)10, mask, Short256VectorTests::MAX);
}
< prev index next >