< prev index next >
test/jdk/jdk/incubator/vector/Short256VectorLoadStoreTests.java
Print this page
rev 54658 : refactored mask and shuffle creation methods, moved classes to top-level
*** 26,37 ****
* @modules jdk.incubator.vector
* @run testng Short256VectorLoadStoreTests
*
*/
! import jdk.incubator.vector.Vector.Shape;
! import jdk.incubator.vector.Vector.Species;
import jdk.incubator.vector.Vector;
import jdk.incubator.vector.ShortVector;
import org.testng.Assert;
--- 26,38 ----
* @modules jdk.incubator.vector
* @run testng Short256VectorLoadStoreTests
*
*/
! import jdk.incubator.vector.VectorShape;
! import jdk.incubator.vector.VectorSpecies;
! import jdk.incubator.vector.VectorMask;
import jdk.incubator.vector.Vector;
import jdk.incubator.vector.ShortVector;
import org.testng.Assert;
*** 44,54 ****
import java.util.List;
import java.util.function.IntFunction;
@Test
public class Short256VectorLoadStoreTests extends AbstractVectorTest {
! static final Species<Short> SPECIES =
ShortVector.SPECIES_256;
static final int INVOC_COUNT = Integer.getInteger("jdk.incubator.vector.test.loop-iterations", 10);
static void assertArraysEquals(short[] a, short[] r, boolean[] mask) {
--- 45,55 ----
import java.util.List;
import java.util.function.IntFunction;
@Test
public class Short256VectorLoadStoreTests extends AbstractVectorTest {
! static final VectorSpecies<Short> SPECIES =
ShortVector.SPECIES_256;
static final int INVOC_COUNT = Integer.getInteger("jdk.incubator.vector.test.loop-iterations", 10);
static void assertArraysEquals(short[] a, short[] r, boolean[] mask) {
*** 197,207 ****
static void loadStoreMaskArray(IntFunction<short[]> fa,
IntFunction<boolean[]> fm) {
short[] a = fa.apply(SPECIES.length());
short[] r = new short[a.length];
boolean[] mask = fm.apply(SPECIES.length());
! Vector.Mask<Short> vmask = ShortVector.maskFromValues(SPECIES, mask);
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, vmask);
av.intoArray(r, i);
--- 198,208 ----
static void loadStoreMaskArray(IntFunction<short[]> fa,
IntFunction<boolean[]> fm) {
short[] a = fa.apply(SPECIES.length());
short[] r = new short[a.length];
boolean[] mask = fm.apply(SPECIES.length());
! VectorMask<Short> vmask = VectorMask.fromValues(SPECIES, mask);
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, vmask);
av.intoArray(r, i);
*** 271,281 ****
IntFunction<ByteBuffer> fb,
IntFunction<boolean[]> fm) {
ByteBuffer a = toBuffer(fa.apply(SPECIES.length()), fb);
ByteBuffer r = fb.apply(a.limit());
boolean[] mask = fm.apply(SPECIES.length());
! Vector.Mask<Short> vmask = ShortVector.maskFromValues(SPECIES, mask);
int l = a.limit();
int s = SPECIES.length() * SPECIES.elementSize() / 8;
for (int ic = 0; ic < INVOC_COUNT; ic++) {
--- 272,282 ----
IntFunction<ByteBuffer> fb,
IntFunction<boolean[]> fm) {
ByteBuffer a = toBuffer(fa.apply(SPECIES.length()), fb);
ByteBuffer r = fb.apply(a.limit());
boolean[] mask = fm.apply(SPECIES.length());
! VectorMask<Short> vmask = VectorMask.fromValues(SPECIES, mask);
int l = a.limit();
int s = SPECIES.length() * SPECIES.elementSize() / 8;
for (int ic = 0; ic < INVOC_COUNT; ic++) {
*** 311,321 ****
IntFunction<boolean[]> fm) {
ByteBuffer a = toBuffer(fa.apply(SPECIES.length()), fb);
a = a.asReadOnlyBuffer().order(a.order());
ByteBuffer r = fb.apply(a.limit());
boolean[] mask = fm.apply(SPECIES.length());
! Vector.Mask<Short> vmask = ShortVector.maskFromValues(SPECIES, mask);
int l = a.limit();
int s = SPECIES.length() * SPECIES.elementSize() / 8;
for (int ic = 0; ic < INVOC_COUNT; ic++) {
--- 312,322 ----
IntFunction<boolean[]> fm) {
ByteBuffer a = toBuffer(fa.apply(SPECIES.length()), fb);
a = a.asReadOnlyBuffer().order(a.order());
ByteBuffer r = fb.apply(a.limit());
boolean[] mask = fm.apply(SPECIES.length());
! VectorMask<Short> vmask = VectorMask.fromValues(SPECIES, mask);
int l = a.limit();
int s = SPECIES.length() * SPECIES.elementSize() / 8;
for (int ic = 0; ic < INVOC_COUNT; ic++) {
< prev index next >