/* * Copyright (c) 2008, 2018, 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 * * @summary converted from VM Testbase jit/overflow. * VM Testbase keywords: [jit, quick] * * @library /vmTestbase * /test/lib * @run driver jdk.test.lib.FileInstaller . . * @build jit.overflow.overflow * @run driver ExecDriver --java jit.overflow.overflow */ package jit.overflow; /* This test checks if a JIT can still detect stack overflow. Method invocation overhead is expensive in Java and improving it is a nobel cause for a JIT. JITs just have to be careful that they don't loose some error handling ability in doing so. */ import java.lang.*; import nsk.share.TestFailure; class overflow { public static void main(String[] args) { try { recurse(1); } catch (StackOverflowError e) { System.out.println("Test PASSES"); return; } throw new TestFailure("Test FAILED"); } static int recurse(int n) { if (n != 0) { return recurse(n+1); } return 0; } }