1 /*
2  * Copyright (c) 2021, 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 8272562
27  * @summary C2: assert(false) failed: Bad graph detected in build_loop_late
28  *
29  * @run main/othervm -XX:CompileOnly=TestSunkCastOnUnreachablePath -XX:-TieredCompilation -Xbatch TestSunkCastOnUnreachablePath
30  *
31  */
32 
33 public class TestSunkCastOnUnreachablePath {
34 
main(String[] strArr)35     public static void main(String[] strArr) {
36         for (int i = 0; i < 1000; i++) {
37             vMeth();
38         }
39     }
40 
vMeth()41     static int vMeth() {
42         int i2 = 3, iArr1[] = new int[200];
43 
44         for (int i9 = 3; i9 < 100; i9++) {
45             try {
46                 int i10 = (iArr1[i9 - 1]);
47                 i2 = (i10 / i9);
48             } catch (ArithmeticException a_e) {
49             }
50         }
51         return i2;
52     }
53 }
54