1 /*
2  * Copyright (c) 2017, 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
26  * @bug 8187822
27  * @summary C2 conditonal move optimization might create broken graph
28  * @requires vm.flavor == "server"
29  * @run main/othervm -XX:-UseOnStackReplacement -XX:-BackgroundCompilation -XX:CompileCommand=dontinline,TestCMovSplitThruPhi::not_inlined -XX:CompileOnly=TestCMovSplitThruPhi::test -XX:-LoopUnswitching TestCMovSplitThruPhi
30  *
31  */
32 
33 public class TestCMovSplitThruPhi {
34     static int f;
35 
test(boolean flag1, boolean flag2, boolean flag3, boolean flag4)36     static int test(boolean flag1, boolean flag2, boolean flag3, boolean flag4) {
37         int v3 = 0;
38         if (flag4) {
39             for (int i = 0; i < 10; i++) {
40                 int v1 = 0;
41                 if (flag1) {
42                     v1 = not_inlined();
43                 }
44                 // AddI below will be candidate for split through Phi
45                 int v2 = v1;
46                 if (flag2) {
47                     v2 = f + v1;
48                 }
49                 // test above will be converted to CMovI
50                 if (flag3) {
51                     v3 = v2 * 2;
52                     break;
53                 }
54             }
55         }
56         return v3;
57     }
58 
not_inlined()59     private static int not_inlined() {
60         return 0;
61     }
62 
main(String[] args)63     public static void main(String[] args) {
64         for (int i = 0; i < 20000; i++) {
65             test((i % 2) == 0, (i % 2) == 0, (i % 100) == 1, (i % 1000) == 1);
66         }
67     }
68 }
69