|
| 1 | +/* |
| 2 | + * Copyright (c) 2025, 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 | + * @test |
| 26 | + * @bug 8335708 |
| 27 | + * @summary Crash Compile::verify_graph_edges with dead code check when safepoints are reachable but not connected back to Root's inputs |
| 28 | + * @library /test/lib |
| 29 | + * |
| 30 | + * @run driver compiler.loopopts.VerifyGraphEdgesWithDeadCodeCheckFromSafepoints |
| 31 | + * @run main/othervm |
| 32 | + * -XX:+IgnoreUnrecognizedVMOptions |
| 33 | + * -XX:-TieredCompilation -XX:+VerifyGraphEdges |
| 34 | + * -XX:+StressIGVN -Xcomp |
| 35 | + * -XX:CompileCommand=compileonly,compiler.loopopts.VerifyGraphEdgesWithDeadCodeCheckFromSafepoints::mainTest |
| 36 | + * compiler.loopopts.VerifyGraphEdgesWithDeadCodeCheckFromSafepoints |
| 37 | + * |
| 38 | + */ |
| 39 | + |
| 40 | +package compiler.loopopts; |
| 41 | + |
| 42 | +import jdk.test.lib.Utils; |
| 43 | + |
| 44 | +public class VerifyGraphEdgesWithDeadCodeCheckFromSafepoints { |
| 45 | + public static void main(String[] args) throws Exception { |
| 46 | + Thread thread = new Thread() { |
| 47 | + public void run() { |
| 48 | + VerifyGraphEdgesWithDeadCodeCheckFromSafepoints instance = new VerifyGraphEdgesWithDeadCodeCheckFromSafepoints(); |
| 49 | + byte[] a = new byte[997]; |
| 50 | + for (int i = 0; i < 100; ++i) { |
| 51 | + instance.mainTest(a, a); |
| 52 | + } |
| 53 | + } |
| 54 | + }; |
| 55 | + // Give thread some time to trigger compilation |
| 56 | + thread.setDaemon(true); |
| 57 | + thread.start(); |
| 58 | + Thread.sleep(Utils.adjustTimeout(500)); |
| 59 | + } |
| 60 | + |
| 61 | + public void mainTest(byte[] a, byte[] b) { |
| 62 | + int i = 0; |
| 63 | + while (i < (a.length - 4)) { |
| 64 | + a[i] = b[i]; |
| 65 | + } |
| 66 | + while (true) { |
| 67 | + a[i] = b[i]; |
| 68 | + } |
| 69 | + } |
| 70 | +} |
0 commit comments