infernap12/jdk
1
0
Fork 0
mirror of https://github.com/openjdk/jdk.git synced 2026-03-19 04:13:07 +00:00
Code Issues Packages Projects Releases Wiki Activity

8325659: Normalize Random usage by incubator vector tests

Browse Source 
Reviewed-by: psandoz
This commit is contained in:
Evgeny Nikitin 2024-04-09 15:39:51 +00:00 committed by Paul Sandoz
parent 6736792b9a
commit 4bba445d83
69 changed files with 469 additions and 281 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
test/jdk/jdk/incubator/vector/AbstractVectorTest.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2021, Oracle and/or its affiliates. All rights reserved.
* 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
@ -35,11 +35,13 @@ import java.util.function.IntUnaryOperator;
import java.util.stream.Stream;
import java.util.stream.Collectors;
import jdk.test.lib.Utils;
import org.testng.Assert;
public class AbstractVectorTest {
static final Random RAND = new Random(Integer.getInteger("jdk.incubator.vector.test.random-seed", 1337));
static final Random RAND = Utils.getRandomInstance();
interface ToBoolF {
boolean apply(int i);

3
test/jdk/jdk/incubator/vector/Byte128VectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm -XX:-TieredCompilation Byte128VectorLoadStoreTests
*

21
test/jdk/jdk/incubator/vector/Byte128VectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation Byte128VectorTests
*/
@ -4741,7 +4744,7 @@ public class Byte128VectorTests extends AbstractVectorTest {
static void sliceUnaryByte128VectorTests(IntFunction<byte[]> fa) {
byte[] a = fa.apply(SPECIES.length());
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);
@ -4770,7 +4773,7 @@ public class Byte128VectorTests extends AbstractVectorTest {
byte[] a = fa.apply(SPECIES.length());
byte[] b = fb.apply(SPECIES.length());
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);
@ -4804,7 +4807,7 @@ public class Byte128VectorTests extends AbstractVectorTest {
VectorMask<Byte> vmask = VectorMask.fromArray(SPECIES, mask, 0);
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);
@ -4833,7 +4836,7 @@ public class Byte128VectorTests extends AbstractVectorTest {
static void unsliceUnaryByte128VectorTests(IntFunction<byte[]> fa) {
byte[] a = fa.apply(SPECIES.length());
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);
@ -4871,8 +4874,8 @@ public class Byte128VectorTests extends AbstractVectorTest {
byte[] a = fa.apply(SPECIES.length());
byte[] b = fb.apply(SPECIES.length());
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);
@ -4928,8 +4931,8 @@ public class Byte128VectorTests extends AbstractVectorTest {
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Byte> vmask = VectorMask.fromArray(SPECIES, mask, 0);
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);

3
test/jdk/jdk/incubator/vector/Byte256VectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm -XX:-TieredCompilation Byte256VectorLoadStoreTests
*

21
test/jdk/jdk/incubator/vector/Byte256VectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation Byte256VectorTests
*/
@ -4741,7 +4744,7 @@ public class Byte256VectorTests extends AbstractVectorTest {
static void sliceUnaryByte256VectorTests(IntFunction<byte[]> fa) {
byte[] a = fa.apply(SPECIES.length());
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);
@ -4770,7 +4773,7 @@ public class Byte256VectorTests extends AbstractVectorTest {
byte[] a = fa.apply(SPECIES.length());
byte[] b = fb.apply(SPECIES.length());
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);
@ -4804,7 +4807,7 @@ public class Byte256VectorTests extends AbstractVectorTest {
VectorMask<Byte> vmask = VectorMask.fromArray(SPECIES, mask, 0);
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);
@ -4833,7 +4836,7 @@ public class Byte256VectorTests extends AbstractVectorTest {
static void unsliceUnaryByte256VectorTests(IntFunction<byte[]> fa) {
byte[] a = fa.apply(SPECIES.length());
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);
@ -4871,8 +4874,8 @@ public class Byte256VectorTests extends AbstractVectorTest {
byte[] a = fa.apply(SPECIES.length());
byte[] b = fb.apply(SPECIES.length());
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);
@ -4928,8 +4931,8 @@ public class Byte256VectorTests extends AbstractVectorTest {
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Byte> vmask = VectorMask.fromArray(SPECIES, mask, 0);
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);

3
test/jdk/jdk/incubator/vector/Byte512VectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm -XX:-TieredCompilation Byte512VectorLoadStoreTests
*

21
test/jdk/jdk/incubator/vector/Byte512VectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation Byte512VectorTests
*/
@ -4741,7 +4744,7 @@ public class Byte512VectorTests extends AbstractVectorTest {
static void sliceUnaryByte512VectorTests(IntFunction<byte[]> fa) {
byte[] a = fa.apply(SPECIES.length());
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);
@ -4770,7 +4773,7 @@ public class Byte512VectorTests extends AbstractVectorTest {
byte[] a = fa.apply(SPECIES.length());
byte[] b = fb.apply(SPECIES.length());
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);
@ -4804,7 +4807,7 @@ public class Byte512VectorTests extends AbstractVectorTest {
VectorMask<Byte> vmask = VectorMask.fromArray(SPECIES, mask, 0);
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);
@ -4833,7 +4836,7 @@ public class Byte512VectorTests extends AbstractVectorTest {
static void unsliceUnaryByte512VectorTests(IntFunction<byte[]> fa) {
byte[] a = fa.apply(SPECIES.length());
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);
@ -4871,8 +4874,8 @@ public class Byte512VectorTests extends AbstractVectorTest {
byte[] a = fa.apply(SPECIES.length());
byte[] b = fb.apply(SPECIES.length());
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);
@ -4928,8 +4931,8 @@ public class Byte512VectorTests extends AbstractVectorTest {
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Byte> vmask = VectorMask.fromArray(SPECIES, mask, 0);
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);

3
test/jdk/jdk/incubator/vector/Byte64VectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm -XX:-TieredCompilation Byte64VectorLoadStoreTests
*

21
test/jdk/jdk/incubator/vector/Byte64VectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation Byte64VectorTests
*/
@ -4741,7 +4744,7 @@ public class Byte64VectorTests extends AbstractVectorTest {
static void sliceUnaryByte64VectorTests(IntFunction<byte[]> fa) {
byte[] a = fa.apply(SPECIES.length());
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);
@ -4770,7 +4773,7 @@ public class Byte64VectorTests extends AbstractVectorTest {
byte[] a = fa.apply(SPECIES.length());
byte[] b = fb.apply(SPECIES.length());
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);
@ -4804,7 +4807,7 @@ public class Byte64VectorTests extends AbstractVectorTest {
VectorMask<Byte> vmask = VectorMask.fromArray(SPECIES, mask, 0);
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);
@ -4833,7 +4836,7 @@ public class Byte64VectorTests extends AbstractVectorTest {
static void unsliceUnaryByte64VectorTests(IntFunction<byte[]> fa) {
byte[] a = fa.apply(SPECIES.length());
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);
@ -4871,8 +4874,8 @@ public class Byte64VectorTests extends AbstractVectorTest {
byte[] a = fa.apply(SPECIES.length());
byte[] b = fb.apply(SPECIES.length());
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);
@ -4928,8 +4931,8 @@ public class Byte64VectorTests extends AbstractVectorTest {
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Byte> vmask = VectorMask.fromArray(SPECIES, mask, 0);
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);

3
test/jdk/jdk/incubator/vector/ByteMaxVectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm --add-opens jdk.incubator.vector/jdk.incubator.vector=ALL-UNNAMED
* -XX:-TieredCompilation ByteMaxVectorLoadStoreTests

21
test/jdk/jdk/incubator/vector/ByteMaxVectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation ByteMaxVectorTests
*/
@ -4746,7 +4749,7 @@ public class ByteMaxVectorTests extends AbstractVectorTest {
static void sliceUnaryByteMaxVectorTests(IntFunction<byte[]> fa) {
byte[] a = fa.apply(SPECIES.length());
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);
@ -4775,7 +4778,7 @@ public class ByteMaxVectorTests extends AbstractVectorTest {
byte[] a = fa.apply(SPECIES.length());
byte[] b = fb.apply(SPECIES.length());
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);
@ -4809,7 +4812,7 @@ public class ByteMaxVectorTests extends AbstractVectorTest {
VectorMask<Byte> vmask = VectorMask.fromArray(SPECIES, mask, 0);
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);
@ -4838,7 +4841,7 @@ public class ByteMaxVectorTests extends AbstractVectorTest {
static void unsliceUnaryByteMaxVectorTests(IntFunction<byte[]> fa) {
byte[] a = fa.apply(SPECIES.length());
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);
@ -4876,8 +4879,8 @@ public class ByteMaxVectorTests extends AbstractVectorTest {
byte[] a = fa.apply(SPECIES.length());
byte[] b = fb.apply(SPECIES.length());
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);
@ -4933,8 +4936,8 @@ public class ByteMaxVectorTests extends AbstractVectorTest {
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Byte> vmask = VectorMask.fromArray(SPECIES, mask, 0);
byte[] r = new byte[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
ByteVector av = ByteVector.fromArray(SPECIES, a, i);

3
test/jdk/jdk/incubator/vector/Double128VectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm -XX:-TieredCompilation Double128VectorLoadStoreTests
*

21
test/jdk/jdk/incubator/vector/Double128VectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation Double128VectorTests
*/
@ -3547,7 +3550,7 @@ relativeError));
static void sliceUnaryDouble128VectorTests(IntFunction<double[]> fa) {
double[] a = fa.apply(SPECIES.length());
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -3576,7 +3579,7 @@ relativeError));
double[] a = fa.apply(SPECIES.length());
double[] b = fb.apply(SPECIES.length());
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -3610,7 +3613,7 @@ relativeError));
VectorMask<Double> vmask = VectorMask.fromArray(SPECIES, mask, 0);
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -3639,7 +3642,7 @@ relativeError));
static void unsliceUnaryDouble128VectorTests(IntFunction<double[]> fa) {
double[] a = fa.apply(SPECIES.length());
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -3677,8 +3680,8 @@ relativeError));
double[] a = fa.apply(SPECIES.length());
double[] b = fb.apply(SPECIES.length());
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);
@ -3734,8 +3737,8 @@ relativeError));
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Double> vmask = VectorMask.fromArray(SPECIES, mask, 0);
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);

3
test/jdk/jdk/incubator/vector/Double256VectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm -XX:-TieredCompilation Double256VectorLoadStoreTests
*

21
test/jdk/jdk/incubator/vector/Double256VectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation Double256VectorTests
*/
@ -3547,7 +3550,7 @@ relativeError));
static void sliceUnaryDouble256VectorTests(IntFunction<double[]> fa) {
double[] a = fa.apply(SPECIES.length());
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -3576,7 +3579,7 @@ relativeError));
double[] a = fa.apply(SPECIES.length());
double[] b = fb.apply(SPECIES.length());
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -3610,7 +3613,7 @@ relativeError));
VectorMask<Double> vmask = VectorMask.fromArray(SPECIES, mask, 0);
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -3639,7 +3642,7 @@ relativeError));
static void unsliceUnaryDouble256VectorTests(IntFunction<double[]> fa) {
double[] a = fa.apply(SPECIES.length());
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -3677,8 +3680,8 @@ relativeError));
double[] a = fa.apply(SPECIES.length());
double[] b = fb.apply(SPECIES.length());
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);
@ -3734,8 +3737,8 @@ relativeError));
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Double> vmask = VectorMask.fromArray(SPECIES, mask, 0);
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);

3
test/jdk/jdk/incubator/vector/Double512VectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm -XX:-TieredCompilation Double512VectorLoadStoreTests
*

21
test/jdk/jdk/incubator/vector/Double512VectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation Double512VectorTests
*/
@ -3547,7 +3550,7 @@ relativeError));
static void sliceUnaryDouble512VectorTests(IntFunction<double[]> fa) {
double[] a = fa.apply(SPECIES.length());
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -3576,7 +3579,7 @@ relativeError));
double[] a = fa.apply(SPECIES.length());
double[] b = fb.apply(SPECIES.length());
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -3610,7 +3613,7 @@ relativeError));
VectorMask<Double> vmask = VectorMask.fromArray(SPECIES, mask, 0);
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -3639,7 +3642,7 @@ relativeError));
static void unsliceUnaryDouble512VectorTests(IntFunction<double[]> fa) {
double[] a = fa.apply(SPECIES.length());
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -3677,8 +3680,8 @@ relativeError));
double[] a = fa.apply(SPECIES.length());
double[] b = fb.apply(SPECIES.length());
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);
@ -3734,8 +3737,8 @@ relativeError));
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Double> vmask = VectorMask.fromArray(SPECIES, mask, 0);
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);

3
test/jdk/jdk/incubator/vector/Double64VectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm -XX:-TieredCompilation Double64VectorLoadStoreTests
*

21
test/jdk/jdk/incubator/vector/Double64VectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation Double64VectorTests
*/
@ -3547,7 +3550,7 @@ relativeError));
static void sliceUnaryDouble64VectorTests(IntFunction<double[]> fa) {
double[] a = fa.apply(SPECIES.length());
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -3576,7 +3579,7 @@ relativeError));
double[] a = fa.apply(SPECIES.length());
double[] b = fb.apply(SPECIES.length());
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -3610,7 +3613,7 @@ relativeError));
VectorMask<Double> vmask = VectorMask.fromArray(SPECIES, mask, 0);
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -3639,7 +3642,7 @@ relativeError));
static void unsliceUnaryDouble64VectorTests(IntFunction<double[]> fa) {
double[] a = fa.apply(SPECIES.length());
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -3677,8 +3680,8 @@ relativeError));
double[] a = fa.apply(SPECIES.length());
double[] b = fb.apply(SPECIES.length());
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);
@ -3734,8 +3737,8 @@ relativeError));
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Double> vmask = VectorMask.fromArray(SPECIES, mask, 0);
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);

3
test/jdk/jdk/incubator/vector/DoubleMaxVectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm --add-opens jdk.incubator.vector/jdk.incubator.vector=ALL-UNNAMED
* -XX:-TieredCompilation DoubleMaxVectorLoadStoreTests

21
test/jdk/jdk/incubator/vector/DoubleMaxVectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation DoubleMaxVectorTests
*/
@ -3552,7 +3555,7 @@ relativeError));
static void sliceUnaryDoubleMaxVectorTests(IntFunction<double[]> fa) {
double[] a = fa.apply(SPECIES.length());
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -3581,7 +3584,7 @@ relativeError));
double[] a = fa.apply(SPECIES.length());
double[] b = fb.apply(SPECIES.length());
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -3615,7 +3618,7 @@ relativeError));
VectorMask<Double> vmask = VectorMask.fromArray(SPECIES, mask, 0);
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -3644,7 +3647,7 @@ relativeError));
static void unsliceUnaryDoubleMaxVectorTests(IntFunction<double[]> fa) {
double[] a = fa.apply(SPECIES.length());
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -3682,8 +3685,8 @@ relativeError));
double[] a = fa.apply(SPECIES.length());
double[] b = fb.apply(SPECIES.length());
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);
@ -3739,8 +3742,8 @@ relativeError));
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Double> vmask = VectorMask.fromArray(SPECIES, mask, 0);
double[] r = new double[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);

3
test/jdk/jdk/incubator/vector/Float128VectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm -XX:-TieredCompilation Float128VectorLoadStoreTests
*

21
test/jdk/jdk/incubator/vector/Float128VectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation Float128VectorTests
*/
@ -3558,7 +3561,7 @@ relativeError));
static void sliceUnaryFloat128VectorTests(IntFunction<float[]> fa) {
float[] a = fa.apply(SPECIES.length());
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);
@ -3587,7 +3590,7 @@ relativeError));
float[] a = fa.apply(SPECIES.length());
float[] b = fb.apply(SPECIES.length());
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);
@ -3621,7 +3624,7 @@ relativeError));
VectorMask<Float> vmask = VectorMask.fromArray(SPECIES, mask, 0);
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);
@ -3650,7 +3653,7 @@ relativeError));
static void unsliceUnaryFloat128VectorTests(IntFunction<float[]> fa) {
float[] a = fa.apply(SPECIES.length());
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);
@ -3688,8 +3691,8 @@ relativeError));
float[] a = fa.apply(SPECIES.length());
float[] b = fb.apply(SPECIES.length());
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);
@ -3745,8 +3748,8 @@ relativeError));
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Float> vmask = VectorMask.fromArray(SPECIES, mask, 0);
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);

3
test/jdk/jdk/incubator/vector/Float256VectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm -XX:-TieredCompilation Float256VectorLoadStoreTests
*

21
test/jdk/jdk/incubator/vector/Float256VectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation Float256VectorTests
*/
@ -3558,7 +3561,7 @@ relativeError));
static void sliceUnaryFloat256VectorTests(IntFunction<float[]> fa) {
float[] a = fa.apply(SPECIES.length());
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);
@ -3587,7 +3590,7 @@ relativeError));
float[] a = fa.apply(SPECIES.length());
float[] b = fb.apply(SPECIES.length());
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);
@ -3621,7 +3624,7 @@ relativeError));
VectorMask<Float> vmask = VectorMask.fromArray(SPECIES, mask, 0);
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);
@ -3650,7 +3653,7 @@ relativeError));
static void unsliceUnaryFloat256VectorTests(IntFunction<float[]> fa) {
float[] a = fa.apply(SPECIES.length());
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);
@ -3688,8 +3691,8 @@ relativeError));
float[] a = fa.apply(SPECIES.length());
float[] b = fb.apply(SPECIES.length());
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);
@ -3745,8 +3748,8 @@ relativeError));
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Float> vmask = VectorMask.fromArray(SPECIES, mask, 0);
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);

3
test/jdk/jdk/incubator/vector/Float512VectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm -XX:-TieredCompilation Float512VectorLoadStoreTests
*

21
test/jdk/jdk/incubator/vector/Float512VectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation Float512VectorTests
*/
@ -3558,7 +3561,7 @@ relativeError));
static void sliceUnaryFloat512VectorTests(IntFunction<float[]> fa) {
float[] a = fa.apply(SPECIES.length());
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);
@ -3587,7 +3590,7 @@ relativeError));
float[] a = fa.apply(SPECIES.length());
float[] b = fb.apply(SPECIES.length());
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);
@ -3621,7 +3624,7 @@ relativeError));
VectorMask<Float> vmask = VectorMask.fromArray(SPECIES, mask, 0);
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);
@ -3650,7 +3653,7 @@ relativeError));
static void unsliceUnaryFloat512VectorTests(IntFunction<float[]> fa) {
float[] a = fa.apply(SPECIES.length());
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);
@ -3688,8 +3691,8 @@ relativeError));
float[] a = fa.apply(SPECIES.length());
float[] b = fb.apply(SPECIES.length());
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);
@ -3745,8 +3748,8 @@ relativeError));
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Float> vmask = VectorMask.fromArray(SPECIES, mask, 0);
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);

3
test/jdk/jdk/incubator/vector/Float64VectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm -XX:-TieredCompilation Float64VectorLoadStoreTests
*

21
test/jdk/jdk/incubator/vector/Float64VectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation Float64VectorTests
*/
@ -3558,7 +3561,7 @@ relativeError));
static void sliceUnaryFloat64VectorTests(IntFunction<float[]> fa) {
float[] a = fa.apply(SPECIES.length());
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);
@ -3587,7 +3590,7 @@ relativeError));
float[] a = fa.apply(SPECIES.length());
float[] b = fb.apply(SPECIES.length());
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);
@ -3621,7 +3624,7 @@ relativeError));
VectorMask<Float> vmask = VectorMask.fromArray(SPECIES, mask, 0);
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);
@ -3650,7 +3653,7 @@ relativeError));
static void unsliceUnaryFloat64VectorTests(IntFunction<float[]> fa) {
float[] a = fa.apply(SPECIES.length());
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);
@ -3688,8 +3691,8 @@ relativeError));
float[] a = fa.apply(SPECIES.length());
float[] b = fb.apply(SPECIES.length());
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);
@ -3745,8 +3748,8 @@ relativeError));
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Float> vmask = VectorMask.fromArray(SPECIES, mask, 0);
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);

3
test/jdk/jdk/incubator/vector/FloatMaxVectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm --add-opens jdk.incubator.vector/jdk.incubator.vector=ALL-UNNAMED
* -XX:-TieredCompilation FloatMaxVectorLoadStoreTests

21
test/jdk/jdk/incubator/vector/FloatMaxVectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation FloatMaxVectorTests
*/
@ -3563,7 +3566,7 @@ relativeError));
static void sliceUnaryFloatMaxVectorTests(IntFunction<float[]> fa) {
float[] a = fa.apply(SPECIES.length());
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);
@ -3592,7 +3595,7 @@ relativeError));
float[] a = fa.apply(SPECIES.length());
float[] b = fb.apply(SPECIES.length());
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);
@ -3626,7 +3629,7 @@ relativeError));
VectorMask<Float> vmask = VectorMask.fromArray(SPECIES, mask, 0);
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);
@ -3655,7 +3658,7 @@ relativeError));
static void unsliceUnaryFloatMaxVectorTests(IntFunction<float[]> fa) {
float[] a = fa.apply(SPECIES.length());
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);
@ -3693,8 +3696,8 @@ relativeError));
float[] a = fa.apply(SPECIES.length());
float[] b = fb.apply(SPECIES.length());
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);
@ -3750,8 +3753,8 @@ relativeError));
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Float> vmask = VectorMask.fromArray(SPECIES, mask, 0);
float[] r = new float[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
FloatVector av = FloatVector.fromArray(SPECIES, a, i);

3
test/jdk/jdk/incubator/vector/Int128VectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm -XX:-TieredCompilation Int128VectorLoadStoreTests
*

21
test/jdk/jdk/incubator/vector/Int128VectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation Int128VectorTests
*/
@ -4785,7 +4788,7 @@ public class Int128VectorTests extends AbstractVectorTest {
static void sliceUnaryInt128VectorTests(IntFunction<int[]> fa) {
int[] a = fa.apply(SPECIES.length());
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4814,7 +4817,7 @@ public class Int128VectorTests extends AbstractVectorTest {
int[] a = fa.apply(SPECIES.length());
int[] b = fb.apply(SPECIES.length());
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4848,7 +4851,7 @@ public class Int128VectorTests extends AbstractVectorTest {
VectorMask<Integer> vmask = VectorMask.fromArray(SPECIES, mask, 0);
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4877,7 +4880,7 @@ public class Int128VectorTests extends AbstractVectorTest {
static void unsliceUnaryInt128VectorTests(IntFunction<int[]> fa) {
int[] a = fa.apply(SPECIES.length());
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4915,8 +4918,8 @@ public class Int128VectorTests extends AbstractVectorTest {
int[] a = fa.apply(SPECIES.length());
int[] b = fb.apply(SPECIES.length());
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);
@ -4972,8 +4975,8 @@ public class Int128VectorTests extends AbstractVectorTest {
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Integer> vmask = VectorMask.fromArray(SPECIES, mask, 0);
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);

3
test/jdk/jdk/incubator/vector/Int256VectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm -XX:-TieredCompilation Int256VectorLoadStoreTests
*

21
test/jdk/jdk/incubator/vector/Int256VectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation Int256VectorTests
*/
@ -4785,7 +4788,7 @@ public class Int256VectorTests extends AbstractVectorTest {
static void sliceUnaryInt256VectorTests(IntFunction<int[]> fa) {
int[] a = fa.apply(SPECIES.length());
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4814,7 +4817,7 @@ public class Int256VectorTests extends AbstractVectorTest {
int[] a = fa.apply(SPECIES.length());
int[] b = fb.apply(SPECIES.length());
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4848,7 +4851,7 @@ public class Int256VectorTests extends AbstractVectorTest {
VectorMask<Integer> vmask = VectorMask.fromArray(SPECIES, mask, 0);
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4877,7 +4880,7 @@ public class Int256VectorTests extends AbstractVectorTest {
static void unsliceUnaryInt256VectorTests(IntFunction<int[]> fa) {
int[] a = fa.apply(SPECIES.length());
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4915,8 +4918,8 @@ public class Int256VectorTests extends AbstractVectorTest {
int[] a = fa.apply(SPECIES.length());
int[] b = fb.apply(SPECIES.length());
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);
@ -4972,8 +4975,8 @@ public class Int256VectorTests extends AbstractVectorTest {
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Integer> vmask = VectorMask.fromArray(SPECIES, mask, 0);
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);

3
test/jdk/jdk/incubator/vector/Int512VectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm -XX:-TieredCompilation Int512VectorLoadStoreTests
*

21
test/jdk/jdk/incubator/vector/Int512VectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation Int512VectorTests
*/
@ -4785,7 +4788,7 @@ public class Int512VectorTests extends AbstractVectorTest {
static void sliceUnaryInt512VectorTests(IntFunction<int[]> fa) {
int[] a = fa.apply(SPECIES.length());
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4814,7 +4817,7 @@ public class Int512VectorTests extends AbstractVectorTest {
int[] a = fa.apply(SPECIES.length());
int[] b = fb.apply(SPECIES.length());
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4848,7 +4851,7 @@ public class Int512VectorTests extends AbstractVectorTest {
VectorMask<Integer> vmask = VectorMask.fromArray(SPECIES, mask, 0);
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4877,7 +4880,7 @@ public class Int512VectorTests extends AbstractVectorTest {
static void unsliceUnaryInt512VectorTests(IntFunction<int[]> fa) {
int[] a = fa.apply(SPECIES.length());
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4915,8 +4918,8 @@ public class Int512VectorTests extends AbstractVectorTest {
int[] a = fa.apply(SPECIES.length());
int[] b = fb.apply(SPECIES.length());
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);
@ -4972,8 +4975,8 @@ public class Int512VectorTests extends AbstractVectorTest {
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Integer> vmask = VectorMask.fromArray(SPECIES, mask, 0);
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);

3
test/jdk/jdk/incubator/vector/Int64VectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm -XX:-TieredCompilation Int64VectorLoadStoreTests
*

21
test/jdk/jdk/incubator/vector/Int64VectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation Int64VectorTests
*/
@ -4785,7 +4788,7 @@ public class Int64VectorTests extends AbstractVectorTest {
static void sliceUnaryInt64VectorTests(IntFunction<int[]> fa) {
int[] a = fa.apply(SPECIES.length());
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4814,7 +4817,7 @@ public class Int64VectorTests extends AbstractVectorTest {
int[] a = fa.apply(SPECIES.length());
int[] b = fb.apply(SPECIES.length());
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4848,7 +4851,7 @@ public class Int64VectorTests extends AbstractVectorTest {
VectorMask<Integer> vmask = VectorMask.fromArray(SPECIES, mask, 0);
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4877,7 +4880,7 @@ public class Int64VectorTests extends AbstractVectorTest {
static void unsliceUnaryInt64VectorTests(IntFunction<int[]> fa) {
int[] a = fa.apply(SPECIES.length());
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4915,8 +4918,8 @@ public class Int64VectorTests extends AbstractVectorTest {
int[] a = fa.apply(SPECIES.length());
int[] b = fb.apply(SPECIES.length());
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);
@ -4972,8 +4975,8 @@ public class Int64VectorTests extends AbstractVectorTest {
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Integer> vmask = VectorMask.fromArray(SPECIES, mask, 0);
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);

3
test/jdk/jdk/incubator/vector/IntMaxVectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm --add-opens jdk.incubator.vector/jdk.incubator.vector=ALL-UNNAMED
* -XX:-TieredCompilation IntMaxVectorLoadStoreTests

21
test/jdk/jdk/incubator/vector/IntMaxVectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation IntMaxVectorTests
*/
@ -4790,7 +4793,7 @@ public class IntMaxVectorTests extends AbstractVectorTest {
static void sliceUnaryIntMaxVectorTests(IntFunction<int[]> fa) {
int[] a = fa.apply(SPECIES.length());
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4819,7 +4822,7 @@ public class IntMaxVectorTests extends AbstractVectorTest {
int[] a = fa.apply(SPECIES.length());
int[] b = fb.apply(SPECIES.length());
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4853,7 +4856,7 @@ public class IntMaxVectorTests extends AbstractVectorTest {
VectorMask<Integer> vmask = VectorMask.fromArray(SPECIES, mask, 0);
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4882,7 +4885,7 @@ public class IntMaxVectorTests extends AbstractVectorTest {
static void unsliceUnaryIntMaxVectorTests(IntFunction<int[]> fa) {
int[] a = fa.apply(SPECIES.length());
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4920,8 +4923,8 @@ public class IntMaxVectorTests extends AbstractVectorTest {
int[] a = fa.apply(SPECIES.length());
int[] b = fb.apply(SPECIES.length());
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);
@ -4977,8 +4980,8 @@ public class IntMaxVectorTests extends AbstractVectorTest {
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Integer> vmask = VectorMask.fromArray(SPECIES, mask, 0);
int[] r = new int[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);

3
test/jdk/jdk/incubator/vector/Long128VectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm -XX:-TieredCompilation Long128VectorLoadStoreTests
*

21
test/jdk/jdk/incubator/vector/Long128VectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation Long128VectorTests
*/
@ -4737,7 +4740,7 @@ public class Long128VectorTests extends AbstractVectorTest {
static void sliceUnaryLong128VectorTests(IntFunction<long[]> fa) {
long[] a = fa.apply(SPECIES.length());
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);
@ -4766,7 +4769,7 @@ public class Long128VectorTests extends AbstractVectorTest {
long[] a = fa.apply(SPECIES.length());
long[] b = fb.apply(SPECIES.length());
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);
@ -4800,7 +4803,7 @@ public class Long128VectorTests extends AbstractVectorTest {
VectorMask<Long> vmask = VectorMask.fromArray(SPECIES, mask, 0);
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);
@ -4829,7 +4832,7 @@ public class Long128VectorTests extends AbstractVectorTest {
static void unsliceUnaryLong128VectorTests(IntFunction<long[]> fa) {
long[] a = fa.apply(SPECIES.length());
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);
@ -4867,8 +4870,8 @@ public class Long128VectorTests extends AbstractVectorTest {
long[] a = fa.apply(SPECIES.length());
long[] b = fb.apply(SPECIES.length());
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);
@ -4924,8 +4927,8 @@ public class Long128VectorTests extends AbstractVectorTest {
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Long> vmask = VectorMask.fromArray(SPECIES, mask, 0);
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);

3
test/jdk/jdk/incubator/vector/Long256VectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm -XX:-TieredCompilation Long256VectorLoadStoreTests
*

21
test/jdk/jdk/incubator/vector/Long256VectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation Long256VectorTests
*/
@ -4737,7 +4740,7 @@ public class Long256VectorTests extends AbstractVectorTest {
static void sliceUnaryLong256VectorTests(IntFunction<long[]> fa) {
long[] a = fa.apply(SPECIES.length());
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);
@ -4766,7 +4769,7 @@ public class Long256VectorTests extends AbstractVectorTest {
long[] a = fa.apply(SPECIES.length());
long[] b = fb.apply(SPECIES.length());
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);
@ -4800,7 +4803,7 @@ public class Long256VectorTests extends AbstractVectorTest {
VectorMask<Long> vmask = VectorMask.fromArray(SPECIES, mask, 0);
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);
@ -4829,7 +4832,7 @@ public class Long256VectorTests extends AbstractVectorTest {
static void unsliceUnaryLong256VectorTests(IntFunction<long[]> fa) {
long[] a = fa.apply(SPECIES.length());
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);
@ -4867,8 +4870,8 @@ public class Long256VectorTests extends AbstractVectorTest {
long[] a = fa.apply(SPECIES.length());
long[] b = fb.apply(SPECIES.length());
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);
@ -4924,8 +4927,8 @@ public class Long256VectorTests extends AbstractVectorTest {
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Long> vmask = VectorMask.fromArray(SPECIES, mask, 0);
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);

3
test/jdk/jdk/incubator/vector/Long512VectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm -XX:-TieredCompilation Long512VectorLoadStoreTests
*

21
test/jdk/jdk/incubator/vector/Long512VectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation Long512VectorTests
*/
@ -4737,7 +4740,7 @@ public class Long512VectorTests extends AbstractVectorTest {
static void sliceUnaryLong512VectorTests(IntFunction<long[]> fa) {
long[] a = fa.apply(SPECIES.length());
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);
@ -4766,7 +4769,7 @@ public class Long512VectorTests extends AbstractVectorTest {
long[] a = fa.apply(SPECIES.length());
long[] b = fb.apply(SPECIES.length());
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);
@ -4800,7 +4803,7 @@ public class Long512VectorTests extends AbstractVectorTest {
VectorMask<Long> vmask = VectorMask.fromArray(SPECIES, mask, 0);
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);
@ -4829,7 +4832,7 @@ public class Long512VectorTests extends AbstractVectorTest {
static void unsliceUnaryLong512VectorTests(IntFunction<long[]> fa) {
long[] a = fa.apply(SPECIES.length());
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);
@ -4867,8 +4870,8 @@ public class Long512VectorTests extends AbstractVectorTest {
long[] a = fa.apply(SPECIES.length());
long[] b = fb.apply(SPECIES.length());
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);
@ -4924,8 +4927,8 @@ public class Long512VectorTests extends AbstractVectorTest {
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Long> vmask = VectorMask.fromArray(SPECIES, mask, 0);
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);

3
test/jdk/jdk/incubator/vector/Long64VectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm -XX:-TieredCompilation Long64VectorLoadStoreTests
*

21
test/jdk/jdk/incubator/vector/Long64VectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation Long64VectorTests
*/
@ -4737,7 +4740,7 @@ public class Long64VectorTests extends AbstractVectorTest {
static void sliceUnaryLong64VectorTests(IntFunction<long[]> fa) {
long[] a = fa.apply(SPECIES.length());
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);
@ -4766,7 +4769,7 @@ public class Long64VectorTests extends AbstractVectorTest {
long[] a = fa.apply(SPECIES.length());
long[] b = fb.apply(SPECIES.length());
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);
@ -4800,7 +4803,7 @@ public class Long64VectorTests extends AbstractVectorTest {
VectorMask<Long> vmask = VectorMask.fromArray(SPECIES, mask, 0);
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);
@ -4829,7 +4832,7 @@ public class Long64VectorTests extends AbstractVectorTest {
static void unsliceUnaryLong64VectorTests(IntFunction<long[]> fa) {
long[] a = fa.apply(SPECIES.length());
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);
@ -4867,8 +4870,8 @@ public class Long64VectorTests extends AbstractVectorTest {
long[] a = fa.apply(SPECIES.length());
long[] b = fb.apply(SPECIES.length());
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);
@ -4924,8 +4927,8 @@ public class Long64VectorTests extends AbstractVectorTest {
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Long> vmask = VectorMask.fromArray(SPECIES, mask, 0);
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);

3
test/jdk/jdk/incubator/vector/LongMaxVectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm --add-opens jdk.incubator.vector/jdk.incubator.vector=ALL-UNNAMED
* -XX:-TieredCompilation LongMaxVectorLoadStoreTests

21
test/jdk/jdk/incubator/vector/LongMaxVectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation LongMaxVectorTests
*/
@ -4742,7 +4745,7 @@ public class LongMaxVectorTests extends AbstractVectorTest {
static void sliceUnaryLongMaxVectorTests(IntFunction<long[]> fa) {
long[] a = fa.apply(SPECIES.length());
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);
@ -4771,7 +4774,7 @@ public class LongMaxVectorTests extends AbstractVectorTest {
long[] a = fa.apply(SPECIES.length());
long[] b = fb.apply(SPECIES.length());
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);
@ -4805,7 +4808,7 @@ public class LongMaxVectorTests extends AbstractVectorTest {
VectorMask<Long> vmask = VectorMask.fromArray(SPECIES, mask, 0);
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);
@ -4834,7 +4837,7 @@ public class LongMaxVectorTests extends AbstractVectorTest {
static void unsliceUnaryLongMaxVectorTests(IntFunction<long[]> fa) {
long[] a = fa.apply(SPECIES.length());
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);
@ -4872,8 +4875,8 @@ public class LongMaxVectorTests extends AbstractVectorTest {
long[] a = fa.apply(SPECIES.length());
long[] b = fb.apply(SPECIES.length());
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);
@ -4929,8 +4932,8 @@ public class LongMaxVectorTests extends AbstractVectorTest {
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Long> vmask = VectorMask.fromArray(SPECIES, mask, 0);
long[] r = new long[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
LongVector av = LongVector.fromArray(SPECIES, a, i);

3
test/jdk/jdk/incubator/vector/Short128VectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm -XX:-TieredCompilation Short128VectorLoadStoreTests
*

21
test/jdk/jdk/incubator/vector/Short128VectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation Short128VectorTests
*/
@ -4732,7 +4735,7 @@ public class Short128VectorTests extends AbstractVectorTest {
static void sliceUnaryShort128VectorTests(IntFunction<short[]> fa) {
short[] a = fa.apply(SPECIES.length());
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4761,7 +4764,7 @@ public class Short128VectorTests extends AbstractVectorTest {
short[] a = fa.apply(SPECIES.length());
short[] b = fb.apply(SPECIES.length());
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4795,7 +4798,7 @@ public class Short128VectorTests extends AbstractVectorTest {
VectorMask<Short> vmask = VectorMask.fromArray(SPECIES, mask, 0);
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4824,7 +4827,7 @@ public class Short128VectorTests extends AbstractVectorTest {
static void unsliceUnaryShort128VectorTests(IntFunction<short[]> fa) {
short[] a = fa.apply(SPECIES.length());
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4862,8 +4865,8 @@ public class Short128VectorTests extends AbstractVectorTest {
short[] a = fa.apply(SPECIES.length());
short[] b = fb.apply(SPECIES.length());
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);
@ -4919,8 +4922,8 @@ public class Short128VectorTests extends AbstractVectorTest {
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Short> vmask = VectorMask.fromArray(SPECIES, mask, 0);
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);

3
test/jdk/jdk/incubator/vector/Short256VectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm -XX:-TieredCompilation Short256VectorLoadStoreTests
*

21
test/jdk/jdk/incubator/vector/Short256VectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation Short256VectorTests
*/
@ -4732,7 +4735,7 @@ public class Short256VectorTests extends AbstractVectorTest {
static void sliceUnaryShort256VectorTests(IntFunction<short[]> fa) {
short[] a = fa.apply(SPECIES.length());
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4761,7 +4764,7 @@ public class Short256VectorTests extends AbstractVectorTest {
short[] a = fa.apply(SPECIES.length());
short[] b = fb.apply(SPECIES.length());
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4795,7 +4798,7 @@ public class Short256VectorTests extends AbstractVectorTest {
VectorMask<Short> vmask = VectorMask.fromArray(SPECIES, mask, 0);
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4824,7 +4827,7 @@ public class Short256VectorTests extends AbstractVectorTest {
static void unsliceUnaryShort256VectorTests(IntFunction<short[]> fa) {
short[] a = fa.apply(SPECIES.length());
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4862,8 +4865,8 @@ public class Short256VectorTests extends AbstractVectorTest {
short[] a = fa.apply(SPECIES.length());
short[] b = fb.apply(SPECIES.length());
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);
@ -4919,8 +4922,8 @@ public class Short256VectorTests extends AbstractVectorTest {
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Short> vmask = VectorMask.fromArray(SPECIES, mask, 0);
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);

3
test/jdk/jdk/incubator/vector/Short512VectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm -XX:-TieredCompilation Short512VectorLoadStoreTests
*

21
test/jdk/jdk/incubator/vector/Short512VectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation Short512VectorTests
*/
@ -4732,7 +4735,7 @@ public class Short512VectorTests extends AbstractVectorTest {
static void sliceUnaryShort512VectorTests(IntFunction<short[]> fa) {
short[] a = fa.apply(SPECIES.length());
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4761,7 +4764,7 @@ public class Short512VectorTests extends AbstractVectorTest {
short[] a = fa.apply(SPECIES.length());
short[] b = fb.apply(SPECIES.length());
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4795,7 +4798,7 @@ public class Short512VectorTests extends AbstractVectorTest {
VectorMask<Short> vmask = VectorMask.fromArray(SPECIES, mask, 0);
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4824,7 +4827,7 @@ public class Short512VectorTests extends AbstractVectorTest {
static void unsliceUnaryShort512VectorTests(IntFunction<short[]> fa) {
short[] a = fa.apply(SPECIES.length());
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4862,8 +4865,8 @@ public class Short512VectorTests extends AbstractVectorTest {
short[] a = fa.apply(SPECIES.length());
short[] b = fb.apply(SPECIES.length());
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);
@ -4919,8 +4922,8 @@ public class Short512VectorTests extends AbstractVectorTest {
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Short> vmask = VectorMask.fromArray(SPECIES, mask, 0);
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);

3
test/jdk/jdk/incubator/vector/Short64VectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm -XX:-TieredCompilation Short64VectorLoadStoreTests
*

21
test/jdk/jdk/incubator/vector/Short64VectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation Short64VectorTests
*/
@ -4732,7 +4735,7 @@ public class Short64VectorTests extends AbstractVectorTest {
static void sliceUnaryShort64VectorTests(IntFunction<short[]> fa) {
short[] a = fa.apply(SPECIES.length());
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4761,7 +4764,7 @@ public class Short64VectorTests extends AbstractVectorTest {
short[] a = fa.apply(SPECIES.length());
short[] b = fb.apply(SPECIES.length());
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4795,7 +4798,7 @@ public class Short64VectorTests extends AbstractVectorTest {
VectorMask<Short> vmask = VectorMask.fromArray(SPECIES, mask, 0);
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4824,7 +4827,7 @@ public class Short64VectorTests extends AbstractVectorTest {
static void unsliceUnaryShort64VectorTests(IntFunction<short[]> fa) {
short[] a = fa.apply(SPECIES.length());
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4862,8 +4865,8 @@ public class Short64VectorTests extends AbstractVectorTest {
short[] a = fa.apply(SPECIES.length());
short[] b = fb.apply(SPECIES.length());
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);
@ -4919,8 +4922,8 @@ public class Short64VectorTests extends AbstractVectorTest {
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Short> vmask = VectorMask.fromArray(SPECIES, mask, 0);
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);

3
test/jdk/jdk/incubator/vector/ShortMaxVectorLoadStoreTests.java
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
* @run testng/othervm --add-opens jdk.incubator.vector/jdk.incubator.vector=ALL-UNNAMED
* -XX:-TieredCompilation ShortMaxVectorLoadStoreTests

21
test/jdk/jdk/incubator/vector/ShortMaxVectorTests.java
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation ShortMaxVectorTests
*/
@ -4737,7 +4740,7 @@ public class ShortMaxVectorTests extends AbstractVectorTest {
static void sliceUnaryShortMaxVectorTests(IntFunction<short[]> fa) {
short[] a = fa.apply(SPECIES.length());
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4766,7 +4769,7 @@ public class ShortMaxVectorTests extends AbstractVectorTest {
short[] a = fa.apply(SPECIES.length());
short[] b = fb.apply(SPECIES.length());
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4800,7 +4803,7 @@ public class ShortMaxVectorTests extends AbstractVectorTest {
VectorMask<Short> vmask = VectorMask.fromArray(SPECIES, mask, 0);
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4829,7 +4832,7 @@ public class ShortMaxVectorTests extends AbstractVectorTest {
static void unsliceUnaryShortMaxVectorTests(IntFunction<short[]> fa) {
short[] a = fa.apply(SPECIES.length());
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(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);
@ -4867,8 +4870,8 @@ public class ShortMaxVectorTests extends AbstractVectorTest {
short[] a = fa.apply(SPECIES.length());
short[] b = fb.apply(SPECIES.length());
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);
@ -4924,8 +4927,8 @@ public class ShortMaxVectorTests extends AbstractVectorTest {
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<Short> vmask = VectorMask.fromArray(SPECIES, mask, 0);
short[] r = new short[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
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);

2
test/jdk/jdk/incubator/vector/templates/Kernel-Slice-Masked-bop.template
View File

@ -4,7 +4,7 @@
VectorMask<$Wideboxtype$> vmask = VectorMask.fromArray(SPECIES, mask, 0);
$type$[] r = new $type$[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
$abstractvectortype$ av = $abstractvectortype$.fromArray(SPECIES, a, i);

2
test/jdk/jdk/incubator/vector/templates/Kernel-Slice-bop.template
View File

@ -1,7 +1,7 @@
$type$[] a = fa.apply(SPECIES.length());
$type$[] b = fb.apply(SPECIES.length());
$type$[] r = new $type$[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
$abstractvectortype$ av = $abstractvectortype$.fromArray(SPECIES, a, i);

2
test/jdk/jdk/incubator/vector/templates/Kernel-Slice-op.template
View File

@ -1,6 +1,6 @@
$type$[] a = fa.apply(SPECIES.length());
$type$[] r = new $type$[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
$abstractvectortype$ av = $abstractvectortype$.fromArray(SPECIES, a, i);

4
test/jdk/jdk/incubator/vector/templates/Kernel-Unslice-Masked-bop.template
View File

@ -3,8 +3,8 @@
boolean[] mask = fm.apply(SPECIES.length());
VectorMask<$Wideboxtype$> vmask = VectorMask.fromArray(SPECIES, mask, 0);
$type$[] r = new $type$[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
$abstractvectortype$ av = $abstractvectortype$.fromArray(SPECIES, a, i);

4
test/jdk/jdk/incubator/vector/templates/Kernel-Unslice-bop.template
View File

@ -1,8 +1,8 @@
$type$[] a = fa.apply(SPECIES.length());
$type$[] b = fb.apply(SPECIES.length());
$type$[] r = new $type$[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int part = (new java.util.Random()).nextInt(2);
int origin = RAND.nextInt(SPECIES.length());
int part = RAND.nextInt(2);
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
$abstractvectortype$ av = $abstractvectortype$.fromArray(SPECIES, a, i);

2
test/jdk/jdk/incubator/vector/templates/Kernel-Unslice-op.template
View File

@ -1,6 +1,6 @@
$type$[] a = fa.apply(SPECIES.length());
$type$[] r = new $type$[a.length];
int origin = (new java.util.Random()).nextInt(SPECIES.length());
int origin = RAND.nextInt(SPECIES.length());
for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < a.length; i += SPECIES.length()) {
$abstractvectortype$ av = $abstractvectortype$.fromArray(SPECIES, a, i);

5
test/jdk/jdk/incubator/vector/templates/Unit-header.template
View File

@ -1,5 +1,5 @@
/*
* Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
* 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
@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector
* @run testng/othervm/timeout=300 -ea -esa -Xbatch -XX:-TieredCompilation $vectorteststype$
*/

3
test/jdk/jdk/incubator/vector/templates/X-LoadStoreTest.java.template
View File

@ -23,6 +23,9 @@
/*
* @test
* @key randomness
*
* @library /test/lib
* @modules jdk.incubator.vector java.base/jdk.internal.vm.annotation
#if[MaxBit]
* @run testng/othervm --add-opens jdk.incubator.vector/jdk.incubator.vector=ALL-UNNAMED