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
|
/*
* 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/stack010.
* VM testbase keywords: [stress, stack, nonconcurrent]
* VM testbase readme:
* DESCRIPTION
* This test provokes multiple stack overflows in the multiple
* threads -- by invoking static recursive method for the given
* fixed depth of recursion (though, for a large depth).
* This test measures a number of recursive invocations until
* stack overflow, and then tries to provoke similar stack overflows
* 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.
* 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, 1.4 on Win32 and Solaris
* platforms.
* See the bug:
* 4366625 (P4/S4) multiple stack overflow causes HS crash
*
* @requires vm.opt.DeoptimizeALot != true
* @run main/othervm/timeout=900 Stack010
*/
public class Stack010 extends Thread {
final static int THREADS = 1;
final static int CYCLES = 1;
public static void main(String[] args) {
//
// Measure maximal recursion depth until stack overflow:
//
int maxDepth = 0;
for (int depth = 10; ; depth += 10) {
try {
recurse(depth);
maxDepth = depth;
} catch (StackOverflowError | OutOfMemoryError err) {
break;
}
}
System.out.println("Max. depth: " + maxDepth);
//
// Execute multiple threads repeatedly provoking stack overflows:
//
Stack010 threads[] = new Stack010[THREADS];
for (int i = 0; i < threads.length; i++) {
threads[i] = new Stack010();
threads[i].depthToTry = 100 * 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 not 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);
}
}
}
int depthToTry = 0;
Throwable thrown = null;
public void run() {
for (int i = 0; i < CYCLES; i++) {
try {
System.out.println("depth = " +depthToTry);
recurse(depthToTry);
throw new Exception(
"TEST_RFE: no stack overflow thrown" +
", need to try deeper recursion?");
} catch (StackOverflowError | OutOfMemoryError err) {
// It's OK
} catch (Throwable throwable) {
// It isn't OK!
thrown = throwable;
break;
}
}
}
static void recurse(int depth) {
if (depth > 0) {
recurse(depth - 1);
}
}
}
|
