1 /* 2 * Copyright (c) 2008, 2018, 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 * 27 * @summary converted from VM Testbase jit/t/t100. 28 * VM Testbase keywords: [jit, quick] 29 * 30 * @library /vmTestbase 31 * /test/lib 32 * @run driver jdk.test.lib.FileInstaller . . 33 * @build jit.t.t100.t100 34 * @run driver ExecDriver --java jit.t.t100.t100 35 */ 36 37 package jit.t.t100; 38 39 /* 40 This test check it a JIT can still detect stack overflow. Method 41 invocation overhead is expensive in Java and improving it is a 42 nobel cause for a JIT. JITs just have to be careful that they 43 don't loose some error handling ability in doing so. 44 */ 45 46 import java.lang.*; 47 import nsk.share.TestFailure; 48 import nsk.share.GoldChecker; 49 50 class t100 { 51 public static final GoldChecker goldChecker = new GoldChecker( "t100" ); 52 53 public static void main(String[] args) { 54 try { 55 recurse(1); 56 } catch (StackOverflowError e) { 57 t100.goldChecker.println("Test PASSES"); 58 } 59 t100.goldChecker.check(); 60 } 61 62 static int recurse(int n) { 63 if (n != 0) { 64 return recurse(n+1); 65 } 66 return 0; 67 } 68 }