blob: 65b26bf76c19311cbab01eef7b4a6606eb1656f1 [file] [log] [blame]
/*
* Copyright (c) 2021, Oracle and/or its affiliates. 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 8253353
* @summary Tests custom bytecode with deep nested irreducible loops.
*
* @compile TestNestedIrreducibleLoops.jasm
* @run main/othervm -Xbatch -XX:CompileCommand=dontinline,TestNestedIrreducibleLoops::*
* -XX:CompileCommand=exclude,TestNestedIrreducibleLoopsMain::main
* TestNestedIrreducibleLoopsMain
*/
public class TestNestedIrreducibleLoopsMain {
public static void main(String[] args) {
TestNestedIrreducibleLoops t = new TestNestedIrreducibleLoops();
t.loopCounter = 3;
int j;
for (int i = 0; i < 11000; i++) {
t.start = i & 0x3ff;
j = t.test(); // Produces deep nested irreducible loops
}
}
}