1 /* 2 * Copyright (c) 2019, Oracle and/or its affiliates. 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 /* 26 * @test 27 * @bug 8231223 28 * @summary Test conditional move optimization encountering an Opaque4Node. 29 * @run main/othervm -Xbatch -XX:-TieredCompilation 30 * -XX:CompileCommand=inline,compiler.loopopts.TestCMovWithOpaque::test 31 * compiler.loopopts.TestCMovWithOpaque 32 */ 33 34 package compiler.loopopts; 35 36 public class TestCMovWithOpaque { 37 test(int array[])38 public static void test(int array[]) { 39 for (int i = 1; i < 8; i += 3) { 40 for (int j = 0; j < 4; ++j) { 41 switch (i % 4) { 42 case 0: 43 break; 44 case 1: 45 break; 46 case 2: 47 break; 48 case 3: 49 array[j] += 42; 50 break; 51 } 52 } 53 } 54 } 55 main(String[] args)56 public static void main(String[] args) { 57 int[] array = new int[4]; 58 for (int i = 0; i < 20_000; ++i) { 59 test(array); 60 } 61 } 62 } 63