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/stack010.
  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 static 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 2.0, 1.3, 1.4 on Win32 and Solaris
  45  *     platforms.
  46  *     See the bug:
  47  *     4366625 (P4/S4) multiple stack overflow causes HS crash
  48  *
  49  * @requires vm.opt.DeoptimizeALot == null | vm.opt.DeoptimizeALot == false
  50  * @run main/othervm nsk.stress.stack.stack010
  51  */
  52 
  53 package nsk.stress.stack;
  54 
  55 
  56 import java.io.PrintStream;
  57 
  58 public class stack010 extends Thread {
  59     final static int THREADS = 10;
  60     final static int CYCLES = 10;
  61 
  62     public static void main(String[] args) {
  63         int exitCode = run(args, System.out);
  64         System.exit(exitCode + 95);
  65     }
  66 
  67     public static int run(String args[], PrintStream out) {
  68         //
  69         // Measure maximal recursion depth until stack overflow:
  70         //
  71         int maxDepth = 0;
  72         for (int depth = 10; ; depth += 10)
  73             try {
  74                 recurse(depth);
  75                 maxDepth = depth;
  76             } catch (StackOverflowError soe) {
  77                 break;
  78             } catch (OutOfMemoryError oome) {
  79                 break;
  80             }
  81         out.println("Max. depth: " + maxDepth);
  82 
  83         //
  84         // Execute multiple threads repeatedly provoking stack overflows:
  85         //
  86         stack010 threads[] = new stack010[THREADS];
  87         for (int i = 0; i < threads.length; i++) {
  88             threads[i] = new stack010();
  89             threads[i].depthToTry = 10 * maxDepth;
  90             threads[i].start();
  91         }
  92         for (int i = 0; i < threads.length; i++)
  93             if (threads[i].isAlive())
  94                 try {
  95                     threads[i].join();
  96                 } catch (InterruptedException exception) {
  97                     exception.printStackTrace(out);
  98                     return 2;
  99                 }
 100 
 101         //
 102         // Check if unexpected exceptions were not thrown:
 103         //
 104         int exitCode = 0;
 105         for (int i = 0; i < threads.length; i++)
 106             if (threads[i].thrown != null) {
 107                 threads[i].thrown.printStackTrace(out);
 108                 exitCode = 2;
 109             }
 110 
 111         if (exitCode != 0)
 112             out.println("# TEST FAILED");
 113         return exitCode;
 114     }
 115 
 116     int depthToTry = 0;
 117     Throwable thrown = null;
 118 
 119     public void run() {
 120         for (int i = 0; i < CYCLES; i++)
 121             try {
 122                 recurse(depthToTry);
 123                 throw new Exception(
 124                         "TEST_RFE: no stack overflow thrown" +
 125                                 ", need to try deeper recursion?");
 126 
 127             } catch (StackOverflowError soe) {
 128                 // It's OK: stack overflow was expected.
 129             } catch (OutOfMemoryError oome) {
 130                 // Also OK: out of memory may indacate stack overflow.
 131 
 132             } catch (Throwable throwable) {
 133                 if (throwable instanceof ThreadDeath)
 134                     throw (ThreadDeath) throwable;
 135                 // It isn't OK!
 136                 thrown = throwable;
 137                 break;
 138             }
 139     }
 140 
 141     static void recurse(int depth) {
 142         if (depth > 0)
 143             recurse(depth - 1);
 144     }
 145 }