jdk-24/test/hotspot/jtreg/compiler/c2/TestLargeTreeOfSubNodes.java
2023-10-04 12:06:31 +00:00

51 lines
1.7 KiB
Java

/*
* Copyright (c) 2023, Red Hat, Inc. 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 8316396
* @summary Endless loop in C2 compilation triggered by AddNode::IdealIL
* @run main/othervm -XX:CompileCommand=compileonly,*TestLargeTreeOfSubNodes*::test -XX:-TieredCompilation -Xcomp TestLargeTreeOfSubNodes
*/
public class TestLargeTreeOfSubNodes {
public static long res = 0;
public static void test() {
int a = -1, b = 0;
for (int i = 0; i < 100; ++i) {
for (int j = 0; j < 10; ++j) {
for (int k = 0; k < 1; ++k) {
}
b -= a;
a += b;
}
}
res = a;
}
public static void main(String[] args) {
test();
}
}