1 /*
   2  * Copyright (c) 2015, 2016, 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 TestPrintGCDetailsVerbose
  26  * @bug 8016740
  27  * @summary Tests that jvm with maximally verbose GC logging does not crash when ParOldGC has no memory
  28  * @key gc
  29  * @requires vm.gc.Parallel
  30  * @modules java.base/jdk.internal.misc
  31  * @run main/othervm -Xmx50m -XX:+UseParallelGC -Xlog:gc*=trace TestPrintGCDetailsVerbose
  32  */
  33 public class TestPrintGCDetailsVerbose {
  34 
  35     public static void main(String[] args) {
  36         for (int t = 0; t <= 10; t++) {
  37             byte a[][] = new byte[100000][];
  38             try {
  39                 for (int i = 0; i < a.length; i++) {
  40                     a[i] = new byte[100000];
  41                 }
  42             } catch (OutOfMemoryError oome) {
  43                 a = null;
  44                 System.out.println("OOM!");
  45                 continue;
  46             }
  47         }
  48     }
  49 }
  50