135 lines
4.3 KiB
Java
135 lines
4.3 KiB
Java
/*
|
|
* Copyright (c) 2000, 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
|
|
* @key stress
|
|
*
|
|
* @summary converted from VM testbase nsk/stress/stack/stack019.
|
|
* VM testbase keywords: [stress, diehard, stack, nonconcurrent, exclude]
|
|
* VM testbase comments: 8139875
|
|
* VM testbase readme:
|
|
* DESCRIPTION
|
|
* The test invokes infinitely recursive method from within stack
|
|
* overflow handler -- repeatedly multiple times in a single thread.
|
|
* The test is deemed passed, if VM have not crashed, and if exception
|
|
* other than due to stack overflow was not thrown.
|
|
* COMMENTS
|
|
* This test crashes HS versions 2.0, 1.3, and 1.4 on both
|
|
* Solaris and Win32 platforms.
|
|
* See the bug:
|
|
* 4366625 (P4/S4) multiple stack overflow causes HS crash
|
|
*
|
|
* @ignore 8139875
|
|
* @requires vm.opt.DeoptimizeALot != true
|
|
* @run main/othervm nsk.stress.stack.stack019 -eager
|
|
*/
|
|
|
|
package nsk.stress.stack;
|
|
|
|
|
|
import nsk.share.Harakiri;
|
|
|
|
import java.io.PrintStream;
|
|
|
|
public class stack019 {
|
|
private final static int CYCLES = 100;
|
|
private final static int PROBES = 100;
|
|
|
|
public static void main(String[] args) {
|
|
int exitCode = run(args, System.out);
|
|
System.exit(exitCode + 95);
|
|
}
|
|
|
|
public static int run(String args[], PrintStream out) {
|
|
boolean verbose = false, eager = false;
|
|
for (int i = 0; i < args.length; i++)
|
|
if (args[i].toLowerCase().equals("-verbose"))
|
|
verbose = true;
|
|
else if (args[i].toLowerCase().equals("-eager"))
|
|
eager = true;
|
|
if (!eager)
|
|
Harakiri.appoint(Harakiri.parseAppointment(args));
|
|
//
|
|
// Measure recursive depth before stack overflow:
|
|
//
|
|
try {
|
|
recurse(0);
|
|
} catch (StackOverflowError soe) {
|
|
} catch (OutOfMemoryError oome) {
|
|
}
|
|
out.println("Maximal recursion depth: " + maxDepth);
|
|
depthToTry = maxDepth;
|
|
|
|
//
|
|
// Run the tested threads:
|
|
//
|
|
for (int i = 0; i < CYCLES; i++) {
|
|
try {
|
|
out.println("Iteration: " + i + "/" + CYCLES);
|
|
trickyRecurse(0);
|
|
out.println("# TEST_BUG: stack overflow was expected!");
|
|
return 2;
|
|
|
|
} catch (StackOverflowError error) {
|
|
} catch (OutOfMemoryError oome) {
|
|
// It's OK: stack overflow was expected.
|
|
|
|
} catch (Throwable throwable) {
|
|
if (throwable instanceof ThreadDeath)
|
|
throw (ThreadDeath) throwable;
|
|
throwable.printStackTrace(out);
|
|
return 2;
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
private static int maxDepth;
|
|
private static int depthToTry;
|
|
|
|
private static void recurse(int depth) {
|
|
maxDepth = depth;
|
|
recurse(depth + 1);
|
|
}
|
|
|
|
private static void trickyRecurse(int depth) {
|
|
try {
|
|
maxDepth = depth;
|
|
trickyRecurse(depth + 1);
|
|
} catch (Error error) {
|
|
if (!(error instanceof StackOverflowError) &&
|
|
!(error instanceof OutOfMemoryError))
|
|
throw error;
|
|
|
|
//
|
|
// Stack problem caugth: provoke it again,
|
|
// if current stack is enough deep:
|
|
//
|
|
if (depth < depthToTry - PROBES)
|
|
throw error;
|
|
recurse(depth + 1);
|
|
}
|
|
}
|
|
}
|