< prev index next > test/jdk/jdk/incubator/vector/Int256VectorTests.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<Integer> SPECIES =
IntVector.SPECIES_256;
static final int INVOC_COUNT = Integer.getInteger("jdk.incubator.vector.test.loop-iterations", 100);
+ static IntVector bcast_vec = IntVector.broadcast(SPECIES, (int)10);
+
private static final int CONST_SHIFT = Integer.SIZE / 2;
static final int BUFFER_REPS = Integer.getInteger("jdk.incubator.vector.test.buffer-vectors", 25000 / 256);
assertShiftConstEquals(r, a, mask, Int256VectorTests::ROL_binary_const);
}
- static IntVector bv_MIN = IntVector.broadcast(SPECIES, (int)10);
-
@Test(dataProvider = "intUnaryOpProvider")
static void MINInt256VectorTestsWithMemOp(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.lanewise(VectorOperators.MIN, bv_MIN).intoArray(r, i);
}
}
assertArraysEquals(r, a, (int)10, Int256VectorTests::MIN);
}
- static IntVector bv_min = IntVector.broadcast(SPECIES, (int)10);
-
@Test(dataProvider = "intUnaryOpProvider")
static void minInt256VectorTestsWithMemOp(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.min(bv_min).intoArray(r, i);
}
}
assertArraysEquals(r, a, (int)10, Int256VectorTests::min);
}
- static IntVector bv_MIN_M = IntVector.broadcast(SPECIES, (int)10);
-
@Test(dataProvider = "intUnaryOpMaskProvider")
static void MINInt256VectorTestsMaskedWithMemOp(IntFunction<int[]> fa, IntFunction<boolean[]> fm) {
int[] a = fa.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 ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
IntVector av = IntVector.fromArray(SPECIES, a, i);
! av.lanewise(VectorOperators.MIN, bv_MIN_M, vmask).intoArray(r, i);
}
}
assertArraysEquals(r, a, (int)10, mask, Int256VectorTests::MIN);
}
- static IntVector bv_MAX = IntVector.broadcast(SPECIES, (int)10);
-
@Test(dataProvider = "intUnaryOpProvider")
static void MAXInt256VectorTestsWithMemOp(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.lanewise(VectorOperators.MAX, bv_MAX).intoArray(r, i);
}
}
assertArraysEquals(r, a, (int)10, Int256VectorTests::MAX);
}
- static IntVector bv_max = IntVector.broadcast(SPECIES, (int)10);
-
@Test(dataProvider = "intUnaryOpProvider")
static void maxInt256VectorTestsWithMemOp(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.max(bv_max).intoArray(r, i);
}
}
assertArraysEquals(r, a, (int)10, Int256VectorTests::max);
}
- static IntVector bv_MAX_M = IntVector.broadcast(SPECIES, (int)10);
-
@Test(dataProvider = "intUnaryOpMaskProvider")
static void MAXInt256VectorTestsMaskedWithMemOp(IntFunction<int[]> fa, IntFunction<boolean[]> fm) {
int[] a = fa.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 ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
IntVector av = IntVector.fromArray(SPECIES, a, i);
! av.lanewise(VectorOperators.MAX, bv_MAX_M, vmask).intoArray(r, i);
}
}
assertArraysEquals(r, a, (int)10, mask, Int256VectorTests::MAX);
}
assertShiftConstEquals(r, a, mask, Int256VectorTests::ROL_binary_const);
}
@Test(dataProvider = "intUnaryOpProvider")
static void MINInt256VectorTestsWithMemOp(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.lanewise(VectorOperators.MIN, bcast_vec).intoArray(r, i);
}
}
assertArraysEquals(r, a, (int)10, Int256VectorTests::MIN);
}
@Test(dataProvider = "intUnaryOpProvider")
static void minInt256VectorTestsWithMemOp(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.min(bcast_vec).intoArray(r, i);
}
}
assertArraysEquals(r, a, (int)10, Int256VectorTests::min);
}
@Test(dataProvider = "intUnaryOpMaskProvider")
static void MINInt256VectorTestsMaskedWithMemOp(IntFunction<int[]> fa, IntFunction<boolean[]> fm) {
int[] a = fa.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 ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
IntVector av = IntVector.fromArray(SPECIES, a, i);
! av.lanewise(VectorOperators.MIN, bcast_vec, vmask).intoArray(r, i);
}
}
assertArraysEquals(r, a, (int)10, mask, Int256VectorTests::MIN);
}
@Test(dataProvider = "intUnaryOpProvider")
static void MAXInt256VectorTestsWithMemOp(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.lanewise(VectorOperators.MAX, bcast_vec).intoArray(r, i);
}
}
assertArraysEquals(r, a, (int)10, Int256VectorTests::MAX);
}
@Test(dataProvider = "intUnaryOpProvider")
static void maxInt256VectorTestsWithMemOp(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.max(bcast_vec).intoArray(r, i);
}
}
assertArraysEquals(r, a, (int)10, Int256VectorTests::max);
}
@Test(dataProvider = "intUnaryOpMaskProvider")
static void MAXInt256VectorTestsMaskedWithMemOp(IntFunction<int[]> fa, IntFunction<boolean[]> fm) {
int[] a = fa.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 ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
IntVector av = IntVector.fromArray(SPECIES, a, i);
! av.lanewise(VectorOperators.MAX, bcast_vec, vmask).intoArray(r, i);
}
}
assertArraysEquals(r, a, (int)10, mask, Int256VectorTests::MAX);
}
< prev index next >