Path: blob/master/test/hotspot/jtreg/compiler/loopopts/TestCMovWithOpaque.java
41149 views
/*1* Copyright (c) 2019, Oracle and/or its affiliates. All rights reserved.2* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.3*4* This code is free software; you can redistribute it and/or modify it5* under the terms of the GNU General Public License version 2 only, as6* published by the Free Software Foundation.7*8* This code is distributed in the hope that it will be useful, but WITHOUT9* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or10* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License11* version 2 for more details (a copy is included in the LICENSE file that12* accompanied this code).13*14* You should have received a copy of the GNU General Public License version15* 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 USA19* or visit www.oracle.com if you need additional information or have any20* questions.21*22*/2324/*25* @test26* @bug 823122327* @summary Test conditional move optimization encountering an Opaque4Node.28* @run main/othervm -Xbatch -XX:-TieredCompilation29* -XX:CompileCommand=inline,compiler.loopopts.TestCMovWithOpaque::test30* compiler.loopopts.TestCMovWithOpaque31*/3233package compiler.loopopts;3435public class TestCMovWithOpaque {3637public static void test(int array[]) {38for (int i = 1; i < 8; i += 3) {39for (int j = 0; j < 4; ++j) {40switch (i % 4) {41case 0:42break;43case 1:44break;45case 2:46break;47case 3:48array[j] += 42;49break;50}51}52}53}5455public static void main(String[] args) {56int[] array = new int[4];57for (int i = 0; i < 20_000; ++i) {58test(array);59}60}61}626364