1 /* 2 * Copyright (c) 2020, 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 8238385 26 * @summary CTW: C2 (Shenandoah) compilation fails with "Range check dependent CastII node was not removed" 27 * @requires vm.gc.Shenandoah 28 * @modules java.base/jdk.internal.misc:+open 29 * 30 * @run main/othervm -XX:-UseOnStackReplacement -XX:-BackgroundCompilation -XX:-TieredCompilation -XX:+UnlockExperimentalVMOptions -XX:+UseShenandoahGC 31 * FoldIfAfterExpansion 32 * 33 */ 34 35 import jdk.internal.misc.Unsafe; 36 37 public class FoldIfAfterExpansion { 38 private static int[] field1 = new int[100]; 39 private static int[] field2 = new int[100]; 40 private static int[] field3; 41 private static volatile int barrier; 42 43 static final jdk.internal.misc.Unsafe UNSAFE = Unsafe.getUnsafe(); 44 45 public static void main(String[] args) { 46 for (int i = 0; i < 20_000; i++) { 47 test(true, 10, false, true); 48 test(false, 10, false, false); 49 } 50 } 51 52 private static Object test(boolean flag, int i, boolean flag2, boolean flag3) { 53 int[] array; 54 if (flag) { 55 barrier = 1; 56 array = field1; 57 final int length = array.length; 58 if (flag2) { 59 field3 = array; 60 } 61 } else { 62 barrier = 1; 63 array = field1; 64 final int length = array.length; 65 if (flag2) { 66 field3 = array; 67 } 68 } 69 70 array = field1; 71 72 if (flag3) { 73 if (i < 0 || i >= array.length) { 74 throw new RuntimeException(); 75 } 76 long l = (long)i; 77 l = l * UNSAFE.ARRAY_INT_INDEX_SCALE + UNSAFE.ARRAY_INT_BASE_OFFSET; 78 UNSAFE.putInt(array, l, i); 79 } else { 80 if (i < 0 || i >= array.length) { 81 throw new RuntimeException(); 82 } 83 long l = (long)i; 84 l = l * UNSAFE.ARRAY_INT_INDEX_SCALE + UNSAFE.ARRAY_INT_BASE_OFFSET; 85 UNSAFE.putInt(array, l, i); 86 } 87 88 return array; 89 } 90 }