1 /*
2 * Copyright (c) 2000, 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 * @key stress
27 *
28 * @summary converted from VM testbase nsk/stress/stack/stack015.
29 * VM testbase keywords: [stress, stack, nonconcurrent]
30 * VM testbase readme:
31 * DESCRIPTION
32 * This test provokes multiple stack overflows in the multiple
33 * threads -- by invoking synchronized virtual recursive method
34 * for the given fixed depth of recursion from within another
35 * recursive method already deeply invoked.
36 * This test measures a number of recursive invocations until
37 * stack overflow, and then tries to provoke similar stack overflows
38 * in 10 times in each of 10 threads. Each provocation consists of
39 * invoking that recursive method for the given fixed depth
40 * of invocations which is 10 times that depth measured before.
41 * The test is deemed passed, if VM have not crashed, and
42 * if exception other than due to stack overflow was not
43 * thrown.
44 * COMMENTS
45 * This test crashes HS versions 2.0, 1.3, and 1.4 on Solaris.
46 * However, it passes against all these HS versions on Win32.
47 * See the bug:
48 * 4366625 (P4/S4) multiple stack overflow causes HS crash
49 *
50 * @run main/othervm nsk.stress.stack.stack015
51 */
52
53 package nsk.stress.stack;
54
55
56 import java.io.PrintStream;
57
58 public class stack015 extends stack015i {
59 final static int THREADS = 10;
60 final static int CYCLES = 10;
61 final static int STEP = 10;
62 final static int RESERVE = 10;
63
64 public static void main(String[] args) {
65 int exitCode = run(args, System.out);
66 System.exit(exitCode + 95);
67 }
68
69 public static int run(String args[], PrintStream out) {
70 //
71 // The test will invoke the particular stack015.recurse()
72 // method via abstract test.recurse() invocations.
73 //
74 stack015i test = new stack015();
75 stack015i.test = test;
76
77 //
78 // Measure maximal recursion depth until stack overflow:
79 //
80 int maxDepth = 0;
81 for (int depth = 0; ; depth += STEP)
82 try {
83 test.recurse(depth);
84 maxDepth = depth;
85 } catch (StackOverflowError soe) {
86 break;
87 } catch (OutOfMemoryError oome) {
88 break;
89 }
90 out.println("Max. depth: " + maxDepth);
91
92 //
93 // Execute multiple threads repeatedly provoking stack overflows:
94 //
95 stack015i threads[] = new stack015i[THREADS];
96 for (int i = 0; i < threads.length; i++) {
97 threads[i] = new stack015();
98 threads[i].depthToTry = RESERVE * maxDepth;
99 threads[i].start();
100 }
101 for (int i = 0; i < threads.length; i++)
102 if (threads[i].isAlive())
103 try {
104 threads[i].join();
105 } catch (InterruptedException exception) {
106 exception.printStackTrace(out);
107 return 2;
108 }
109
110 //
111 // Check if unexpected exceptions were thrown:
112 //
113 int exitCode = 0;
114 for (int i = 0; i < threads.length; i++)
115 if (threads[i].thrown != null) {
116 threads[i].thrown.printStackTrace(out);
117 exitCode = 2;
118 }
119
120 if (exitCode != 0)
121 out.println("# TEST FAILED");
122 return exitCode;
123 }
124
125 synchronized void syncRecurse(int depth) {
126 if (depth > 0)
127 syncRecurse(depth - 1);
128 }
129 }
130
131 abstract class stack015i extends Thread {
132 //
133 // Pure virtual method:
134 //
135 abstract void syncRecurse(int depth);
136
137 void recurse(int depth) {
138 //
139 // Stack overflow must occur here:
140 //
141 syncRecurse(stack015.STEP);
142 //
143 // If no stack overflow occured, try again with deeper stack:
144 //
145 if (depth > 0)
146 recurse(depth - 1);
147 }
148
149 Throwable thrown = null;
150 int depthToTry;
151
152 static stack015i test;
153
154 public void run() {
155 //
156 // Provoke multiple stack overflows:
157 //
158 for (int i = 0; i < stack015.CYCLES; i++)
159 try {
160 //
161 // All threads invoke the same synchronized method:
162 //
163 test.recurse(depthToTry);
164
165 throw new Exception(
166 "TEST_RFE: no stack overflow thrown" +
167 ", need to try deeper recursion?");
168
169 } catch (StackOverflowError error) {
170 // It's OK: stack overflow was expected.
171 } catch (OutOfMemoryError oome) {
172 // Also OK: there may be no memory for stack expansion.
173
174 } catch (Throwable throwable) {
175 if (throwable instanceof ThreadDeath)
176 throw (ThreadDeath) throwable;
177 // It isn't OK!
178 thrown = throwable;
179 break;
180 }
181 }
182 }