1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
|
/*
* Copyright (c) 2000, 2020, 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/stack018.
* VM testbase keywords: [stress, diehard, stack, nonconcurrent]
* VM testbase readme:
* DESCRIPTION
* This test provokes multiple stack overflows by invocations via
* reflection -- repeatedly multiple times, and in multiple threads.
* Recursive method is invoked for the given fixed depth of recursion
* (though, for a large depth). The test measures a number of recursive
* invocations until stack overflow, and then tries to reproduce similar
* stack overflows 10 times in each of 10 threads -- each time by trying
* to invoke the same recursive method for the given fixed depth
* of invocations (which is 10 times that crucial depth just measured).
* 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
*
* @requires (vm.opt.DeoptimizeALot != true & vm.compMode != "Xcomp" & vm.pageSize == 4096)
* @run main/othervm/timeout=900 -Xss220K Stack018
*/
import java.lang.reflect.InvocationTargetException;
import java.lang.reflect.Method;
public class Stack018 extends Thread {
private final static int THREADS = 10;
private final static int CYCLES = 10;
private final static int STEP = 100;
private final static int RESERVE = 100;
public static void main(String[] args) {
Stack018 test = new Stack018();
test.doRun();
}
private void doRun() {
//
// Measure maximal recursion depth until stack overflow:
//
int maxDepth = 0;
for (depthToTry = 0; ; depthToTry += STEP)
try {
invokeRecurse(depthToTry);
maxDepth = depthToTry;
} catch (Throwable exception) {
Throwable target = getTargetException(exception);
if ((target instanceof StackOverflowError) ||
(target instanceof OutOfMemoryError))
break; // OK.
target.printStackTrace();
throw new RuntimeException(exception);
}
System.out.println("Maximal recursion depth: " + maxDepth);
//
// Run the tested threads:
//
Stack018 threads[] = new Stack018[THREADS];
for (int i = 0; i < threads.length; i++) {
threads[i] = new Stack018();
threads[i].setName("Thread: " + (i + 1) + "/" + THREADS);
threads[i].depthToTry = RESERVE * maxDepth;
threads[i].start();
}
for (int i = 0; i < threads.length; i++) {
if (threads[i].isAlive()) {
try {
threads[i].join();
} catch (InterruptedException exception) {
throw new RuntimeException(exception);
}
}
}
//
// Check if unexpected exceptions were thrown:
//
int exitCode = 0;
for (int i = 0; i < threads.length; i++) {
if (threads[i].thrown != null) {
System.out.println("# " + threads[i].getName()
+ ": " + threads[i].thrown);
throw new RuntimeException("Exception in the thread " + threads[i], threads[i].thrown);
}
}
}
private int depthToTry = 0;
private Throwable thrown = null;
public void run() {
String threadName = Thread.currentThread().getName();
for (int i = 1; i <= CYCLES; i++)
try {
System.out.println(threadName + ", iteration: " + i + "/" + CYCLES);
invokeRecurse(depthToTry);
throw new Error("TEST_RFE: try deeper invocations!");
} catch (Throwable exception) {
Throwable target = getTargetException(exception);
if ((target instanceof StackOverflowError) ||
(target instanceof OutOfMemoryError))
continue; // OK.
thrown = target;
break;
}
}
private static Throwable getTargetException(Throwable exception) {
Throwable target;
//
// Unwrap deep chain of exceptions to find StackOverflowError:
//
for (
target = exception;
target instanceof InvocationTargetException;
target = ((InvocationTargetException) target).getTargetException()
)
;
return target;
}
private Method method = null;
private Object params[] = null;
private void invokeRecurse(int depth) throws Exception {
if (method == null) {
//
// Optimization trick: allocate once, use everywhere.
//
method = Stack018.class.getMethod("recurse");
params = new Object[]{};
}
this.depth = depth; // actual parameter
method.invoke(this, params);
}
private int depth = 0; // actual parameter for recurse()
public void recurse() throws Exception {
if (depth > 0) {
//
// Self-invoke via reflection:
//
invokeRecurse(depth - 1);
}
}
}
|
