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/stack007.
  29  * VM testbase keywords: [stress, stack, nonconcurrent]
  30  * VM testbase readme:
  31  * DESCRIPTION
  32  *     This test provokes multiple stack overflows in the same thread
  33  *     by invoking synchronized virtual recursive method for the given
  34  *     fixed depth of recursion (though, for a large depth).
  35  *     This test makes measures a number of recursive invocations
  36  *     before 1st StackOverflowError, and then tries to reproduce
  37  *     such StackOverflowError 10000 times -- each time by trying to
  38  *     invoke the same recursive method for the given fixed depth
  39  *     of invocations (which is 10 times that depth just measured).
  40  *     The test is deemed passed, if VM have not crashed.
  41  * COMMENTS
  42  *     This test crashes HS versions 1.3 and 1.4 on Win32, Solaris,
  43  *     and Linux platforms in all execution modes. However, it passes
  44  *     against HS 2.0 on Win32 platform.
  45  *     See also the bug:
  46  *     4366625 (P4/S4) multiple stack overflow causes HS crash
  47  *
  48  * @run main/othervm nsk.stress.stack.stack007
  49  */
  50 
  51 package nsk.stress.stack;
  52 
  53 
  54 import java.io.PrintStream;
  55 
  56 public class stack007 implements stack007i {
  57     final static int ITERATIONS = 1000;
  58     final static int INCREMENT = 100;
  59 
  60     public static void main(String[] args) {
  61         int exitCode = run(args, System.out);
  62         System.exit(exitCode + 95);
  63     }
  64 
  65     public static int run(String args[], PrintStream out) {
  66         stack007i test = new stack007();
  67         int depth;
  68         for (depth = 100; ; depth += INCREMENT)
  69             try {
  70                 test.recurse(depth);
  71             } catch (StackOverflowError soe) {
  72                 break;
  73             } catch (OutOfMemoryError oome) {
  74                 break;
  75             }
  76         out.println("Max. depth: " + depth);
  77         for (int i = 0; i < ITERATIONS; i++)
  78             try {
  79                 test.recurse(10 * depth);
  80                 out.println("?");
  81             } catch (StackOverflowError soe) {
  82                 // OK.
  83             } catch (OutOfMemoryError oome) {
  84                 // Also OK.
  85             }
  86         return 0;
  87     }
  88 
  89     public synchronized void recurse(int depth) {
  90         if (depth > 0)
  91             recurse(depth - 1);
  92     }
  93 }
  94 
  95 interface stack007i {
  96     void recurse(int depth);
  97 }