Path: blob/master/test/hotspot/jtreg/compiler/loopopts/TestBeautifyLoops.java
41149 views
/*1* Copyright (c) 2020, Huawei Technologies Co., Ltd. All rights reserved.2* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.3*4* This code is free software; you can redistribute it and/or modify it5* under the terms of the GNU General Public License version 2 only, as6* published by the Free Software Foundation.7*8* This code is distributed in the hope that it will be useful, but WITHOUT9* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or10* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License11* version 2 for more details (a copy is included in the LICENSE file that12* accompanied this code).13*14* You should have received a copy of the GNU General Public License version15* 2 along with this work; if not, write to the Free Software Foundation,16* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.17*18* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA19* or visit www.oracle.com if you need additional information or have any20* questions.21*/2223/**24* @test25* @bug 824057626* @summary JVM crashes after transformation in C2 IdealLoopTree::merge_many_backedges27*28* @run main/othervm -XX:-TieredCompilation -XX:-BackgroundCompilation29* compiler.loopopts.TestBeautifyLoops30*/3132package compiler.loopopts;3334public class TestBeautifyLoops {35private int mI = 0;36private long mJ = 0;37private float mF = 0f;3839public void testMethod() {40for (int i0 = 0; i0 < 100; i0++) {41if (mF != 0) {42// do nothing43} else {44try {45mJ = Long.MAX_VALUE;46for (int i1 = 0; i1 < 101; i1++) {47for (int i2 = 0; i2 < 102; i2++) {48mI = new Integer(0x1234);49}50}51} catch (Exception ignored) {}52}53}54}5556public static void main(String[] args) {57TestBeautifyLoops obj = new TestBeautifyLoops();58obj.testMethod();59}60}616263