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/stack012. 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 final recursive method for the given 34 * fixed depth of recursion (though, for a large depth). 35 * This test measures a number of recursive invocations until 36 * stack overflow, and then tries to provoke similar stack overflows 37 * 10 times in each of 10 threads. Each provocation consists of 38 * invoking that recursive method for the given fixed depth 39 * of invocations which is 10 times that depth measured before. 40 * The test is deemed passed, if VM have not crashed, and 41 * if exception other than due to stack overflow was not 42 * thrown. 43 * COMMENTS 44 * This test crashes HS versions 1.3, 1.4 on Win32, and HS versions 45 * 2.0, 1.3, and 1.4 on Solaris. However, it passes against HS 2.0 46 * on Win32. 47 * See the bug: 48 * 4366625 (P4/S4) multiple stack overflow causes HS crash 49 * 50 * @requires vm.opt.DeoptimizeALot == null | vm.opt.DeoptimizeALot == false 51 * @run main/othervm nsk.stress.stack.stack012 52 */ 53 54 package nsk.stress.stack; 55 56 57 import java.io.PrintStream; 58 59 public class stack012 extends Thread { 60 final static int THREADS = 10; 61 final static int CYCLES = 10; 62 63 public static void main(String[] args) { 64 int exitCode = run(args, System.out); 65 System.exit(exitCode + 95); 66 } 67 68 public static int run(String args[], PrintStream out) { 69 stack012 test = new stack012(); 70 // 71 // Measure maximal recursion depth until stack overflow: 72 // 73 int maxDepth = 0; 74 for (int depth = 10; ; depth += 10) 75 try { 76 test.recurse(depth); 77 maxDepth = depth; 78 } catch (StackOverflowError soe) { 79 break; 80 } catch (OutOfMemoryError oome) { 81 break; 82 } 83 out.println("Max. depth: " + maxDepth); 84 85 // 86 // Execute multiple threads repeatedly provoking stack overflows: 87 // 88 stack012 threads[] = new stack012[THREADS]; 89 for (int i = 0; i < threads.length; i++) { 90 threads[i] = new stack012(); 91 threads[i].depthToTry = 10 * maxDepth; 92 threads[i].start(); 93 } 94 for (int i = 0; i < threads.length; i++) 95 if (threads[i].isAlive()) 96 try { 97 threads[i].join(); 98 } catch (InterruptedException exception) { 99 exception.printStackTrace(out); 100 return 2; 101 } 102 103 // 104 // Check if unexpected exceptions were not thrown: 105 // 106 int exitCode = 0; 107 for (int i = 0; i < threads.length; i++) 108 if (threads[i].thrown != null) { 109 threads[i].thrown.printStackTrace(out); 110 exitCode = 2; 111 } 112 113 if (exitCode != 0) 114 out.println("# TEST FAILED"); 115 return exitCode; 116 } 117 118 int depthToTry = 0; 119 Throwable thrown = null; 120 121 public void run() { 122 for (int i = 0; i < CYCLES; i++) 123 try { 124 this.recurse(depthToTry); 125 throw new Exception( 126 "TEST_RFE: no stack overflow thrown" + 127 ", need to try deeper recursion?"); 128 129 } catch (StackOverflowError error) { 130 // It's OK: stack overflow was expected. 131 } catch (OutOfMemoryError oome) { 132 // Also OK: invocation may result in out of memory. 133 134 } catch (Throwable throwable) { 135 if (throwable instanceof ThreadDeath) 136 throw (ThreadDeath) throwable; 137 // It isn't OK! 138 thrown = throwable; 139 break; 140 } 141 } 142 143 final void recurse(int depth) { 144 if (depth > 0) 145 recurse(depth - 1); 146 } 147 }