Path: blob/master/test/hotspot/jtreg/compiler/c1/Test8271202.java
64474 views
/*1* Copyright (c) 2021, Oracle and/or its affiliates. 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 827120226* @requires vm.debug == true & vm.compiler1.enabled27* @run main/othervm -Xbatch -XX:TieredStopAtLevel=1 -XX:+DeoptimizeALot28* Test827120229*/3031public class Test8271202 {32public static void main(String[] strArr) {33try {34test();35} catch (Exception e) {36// Expected37}38}3940static void test() {41long l6 = 10L;42int counter = 0;43int i2, i26, i29, iArr[] = new int[400];44boolean b3 = true;45for (int smallinvoc = 0; smallinvoc < 139; smallinvoc++) {46}47for (i2 = 13; i2 < 1000; i2++) {48for (i26 = 2; i26 < 114; l6 += 2) {49// Infinite loop50if (b3) {51for (i29 = 1; i29 < 2; i29++) {52try {53iArr[i26] = 0;54} catch (ArithmeticException a_e) {55}56}57}58counter++;59if (counter == 100000) {60throw new RuntimeException("expected");61}62}63}64}65}66676869