File: TestUnreachableInnerLoop.java

package info (click to toggle)
openjdk-25 25~32ea-1
  • links: PTS, VCS
  • area: main
  • in suites: trixie
  • size: 825,280 kB
  • sloc: java: 5,584,902; cpp: 1,333,941; xml: 1,321,242; ansic: 487,993; asm: 404,003; objc: 21,088; sh: 15,102; javascript: 13,265; python: 8,319; makefile: 2,515; perl: 357; awk: 351; pascal: 103; exp: 83; sed: 72; jsp: 24
file content (87 lines) | stat: -rw-r--r-- 2,970 bytes parent folder | download | duplicates (5)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
/*
 * Copyright (c) 2023, Oracle and/or its affiliates. All rights reserved.
 * Copyright (c) 2022, Arm Limited. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free Software Foundation.
 *
 * This code is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 * or visit www.oracle.com if you need additional information or have any
 * questions.
 */

/**
 * @test
 * @bug 8289954
 * @summary C2: Assert failed in PhaseCFG::verify() after JDK-8183390
 *
 * @run main/othervm -Xcomp -Xbatch
 *      -XX:CompileOnly=compiler.loopopts.TestUnreachableInnerLoop::*
 *      compiler.loopopts.TestUnreachableInnerLoop
 */

package compiler.loopopts;

public class TestUnreachableInnerLoop {

    public static int field = 0;
    public static int arr[] = new int[500];

    public static void fun() {
        for (int elem : arr) {
            int x = 1, y = 2, z = 3;
            int i, j;

            // This is a good loop
            for (i = 2; i < 63; i++) {
                arr[i] = arr[i] + 3592870;
            }

            // The inner loop looks quite complex but it's unreachable
            // code as loop condition "k < 2" never satisfies
            for (j = 3; j < 63; j++) {
                for (int k = j; k < 2; k++) {
                    arr[j] <<= k;
                    try {
                        x = k / i;
                        y = j % 6;
                        arr[k] = 88 % elem;
                    } catch (ArithmeticException ex) {}
                    switch (2) {
                        case 2: {
                            try {
                                y = arr[j] % y;
                                z = x / 2345;
                                elem = j % -2;
                            } catch (ArithmeticException ex) {}
                            break;
                        }
                        case 3: {
                            y = arr[j] / 2;
                            z -= k;
                            break;
                        }
                    }
                    arr[100] -= j;
                    field += k;
                }
            }
        }
    }

    public static void main(String[] args) {
        fun();
    }
}