1 /*
 2  * Copyright (c) 2024, 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 8326638
28  * @summary Test handling of irreducible loops in PhaseIdealLoop::remix_address_expressions.
29  * @run main/othervm -XX:-TieredCompilation -Xbatch
30  *                   -XX:CompileCommand=compileonly,TestRemixAddressExpressionsWithIrreducibleLoop::test
31  *                   TestRemixAddressExpressionsWithIrreducibleLoop
32  */
33 
34 public class TestRemixAddressExpressionsWithIrreducibleLoop {
35 
36     public static void main(String[] args) {
37         test("4");
38     }
39 
40     public static void test(String arg) {
41         for (int i = 0; i < 100_000; ++i) {
42             int j = 0;
43             while (true) {
44                 boolean tmp = "1\ufff0".startsWith(arg, 2 - arg.length());
45                 if (j++ > 100)
46                     break;
47             }
48         loop:
49             while (i >= 100) {
50                 for (int i2 = 0; i2 < 1; i2 = 1)
51                     if (j > 300)
52                         break loop;
53                 j++;
54             }
55         }
56     }
57 }