1 /* 2 * Copyright (c) 2016 Red Hat, Inc. and/or its affiliates. 3 * 4 * This code is free software; you can redistribute it and/or modify it 5 * under the terms of the GNU General Public License version 2 only, as 6 * published by the Free Software Foundation. 7 * 8 * This code is distributed in the hope that it will be useful, but WITHOUT 9 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 10 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 11 * version 2 for more details (a copy is included in the LICENSE file that 12 * accompanied this code). 13 * 14 * You should have received a copy of the GNU General Public License version 15 * 2 along with this work; if not, write to the Free Software Foundation, 16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 17 * 18 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 19 * or visit www.oracle.com if you need additional information or have any 20 * questions. 21 * 22 */ 23 24 /* @test 25 * @summary test C1 vectorized mismatch intrinsic 26 * @run main/othervm -XX:TieredStopAtLevel=1 -XX:+UseShenandoahGC -XX:+UnlockDiagnosticVMOptions -XX:ShenandoahGCHeuristics=aggressive C1VectorizedMismatch 27 */ 28 29 import java.util.Arrays; 30 31 public class C1VectorizedMismatch { 32 33 private static final int NUM_RUNS = 10000; 34 private static final int ARRAY_SIZE=10000; 35 private static int[] a; 36 private static int[] b; 37 38 public static void main(String[] args) { 39 a = new int[ARRAY_SIZE]; 40 b = new int[ARRAY_SIZE]; 41 for (int i = 0; i < NUM_RUNS; i++) { 42 test(); 43 } 44 } 45 46 private static void test() { 47 int[] a1 = new int[ARRAY_SIZE]; 48 int[] b1 = new int[ARRAY_SIZE]; 49 fillArray(a); 50 System.arraycopy(a, 0, b, 0, ARRAY_SIZE); 51 if (! Arrays.equals(a, b)) { 52 throw new RuntimeException("arrays not equal"); 53 } 54 } 55 56 private static void fillArray(int[] array) { 57 for (int i = 0; i < ARRAY_SIZE; i++) { 58 int val = (int) (Math.random() * Integer.MAX_VALUE); 59 array[i] = val; 60 } 61 } 62 }