Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
PojavLauncherTeam
GitHub Repository: PojavLauncherTeam/mobile
Path: blob/master/test/hotspot/jtreg/gc/shenandoah/compiler/TestC1VectorizedMismatch.java
41153 views
1
/*
2
* Copyright (c) 2016, 2018, Red Hat, Inc. All rights reserved.
3
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4
*
5
* This code is free software; you can redistribute it and/or modify it
6
* under the terms of the GNU General Public License version 2 only, as
7
* published by the Free Software Foundation.
8
*
9
* This code is distributed in the hope that it will be useful, but WITHOUT
10
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12
* version 2 for more details (a copy is included in the LICENSE file that
13
* accompanied this code).
14
*
15
* You should have received a copy of the GNU General Public License version
16
* 2 along with this work; if not, write to the Free Software Foundation,
17
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18
*
19
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20
* or visit www.oracle.com if you need additional information or have any
21
* questions.
22
*
23
*/
24
25
/* @test TestC1VectorizedMismatch
26
* @summary test C1 vectorized mismatch intrinsic
27
* @key randomness
28
* @requires vm.gc.Shenandoah
29
* @library /test/lib
30
*
31
* @run main/othervm -XX:TieredStopAtLevel=1 -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions -XX:+UseShenandoahGC -XX:ShenandoahGCHeuristics=aggressive TestC1VectorizedMismatch
32
*/
33
34
import java.util.Arrays;
35
import java.util.Random;
36
import jdk.test.lib.Utils;
37
38
public class TestC1VectorizedMismatch {
39
40
private static final int NUM_RUNS = 10000;
41
private static final int ARRAY_SIZE = 10000;
42
private static int[] a;
43
private static int[] b;
44
45
public static void main(String[] args) {
46
a = new int[ARRAY_SIZE];
47
b = new int[ARRAY_SIZE];
48
for (int i = 0; i < NUM_RUNS; i++) {
49
test();
50
}
51
}
52
53
private static void test() {
54
int[] a1 = new int[ARRAY_SIZE];
55
int[] b1 = new int[ARRAY_SIZE];
56
fillArray(a);
57
System.arraycopy(a, 0, b, 0, ARRAY_SIZE);
58
if (!Arrays.equals(a, b)) {
59
throw new RuntimeException("arrays not equal");
60
}
61
}
62
63
private static void fillArray(int[] array) {
64
Random r = Utils.getRandomInstance();
65
for (int i = 0; i < ARRAY_SIZE; i++) {
66
int val = (int) (r.nextDouble() * Integer.MAX_VALUE);
67
array[i] = val;
68
}
69
}
70
}
71
72