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
|
/*
* Copyright (c) 2000, 2024, 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/stack016.
* VM testbase keywords: [stress, diehard, stack, nonconcurrent]
* VM testbase readme:
* DESCRIPTION
* The test provokes second stack overflow from within the
* stack overflow handler -- repeatedly multiple times, and
* in multiple threads.
* This test measures a number of recursive invocations until
* stack overflow, and then tries to provoke similar stack overflows
* in 10 times in each of 10 threads. Each provocation consists of
* invoking that recursive method for the given fixed depth
* of invocations which is 10 times that depth measured before,
* and then trying to invoke that recursive method once again
* from within the catch clause just caught StackOverflowError.
* 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")
* @run main/othervm/timeout=900 -Xint -Xss448K Stack016
* @run main/othervm/timeout=900 -Xcomp -Xss448K Stack016
* @run main/othervm/timeout=900 -Xcomp -XX:-TieredCompilation -Xss448K Stack016
*/
public class Stack016 extends Thread {
private final static int THREADS = 10;
private final static int CYCLES = 10;
private final static int STEP = 10;
private final static int RESERVE = 10;
private final static int PROBES = STEP * RESERVE;
public static void main(String[] args) {
Stack016 test = new Stack016();
test.doRun();
}
private void doRun() {
//
// Measure recursive depth before stack overflow:
//
int maxDepth = 0;
for (depthToTry = 0; ; depthToTry += STEP) {
try {
trickyRecurse(depthToTry);
maxDepth = depthToTry;
} catch (StackOverflowError | OutOfMemoryError ex) {
break;
}
}
System.out.println("Maximal recursion depth: " + maxDepth);
//
// Run the tested threads:
//
Stack016 threads[] = new Stack016[THREADS];
for (int i = 0; i < threads.length; i++) {
threads[i] = new Stack016();
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:
//
for (int i = 0; i < threads.length; i++) {
if (threads[i].thrown != null) {
threads[i].thrown.printStackTrace();
throw new RuntimeException("Exception in the thread " + threads[i], threads[i].thrown);
}
}
}
private int stackTop = 0;
private int depthToTry = 0;
private Throwable thrown = null;
private void trickyRecurse(int depth) {
stackTop = depthToTry - depth;
if (depth > 0) {
try {
trickyRecurse(depth - 1);
} catch (StackOverflowError | OutOfMemoryError error) {
//
// Provoke more stack overflow,
// if current stack is deep enough:
//
if (depthToTry - depth < stackTop - PROBES)
throw error;
recurse(depthToTry);
throw new Error("TEST_RFE: try deeper recursion!");
}
}
}
private static void recurse(int depth) {
if (depth > 0) {
recurse(depth - 1);
}
}
public void run() {
String threadName = Thread.currentThread().getName();
for (int i = 1; i <= CYCLES; i++) {
try {
System.out.println(threadName + ", iteration: " + i + "/" + CYCLES +
", depthToTry: " + depthToTry);
trickyRecurse(depthToTry);
throw new Error(
"TEST_BUG: trickyRecursion() must throw an error anyway!");
} catch (StackOverflowError | OutOfMemoryError err) {
// It's OK
} catch (Throwable throwable) {
thrown = throwable;
break;
}
}
}
}
|
