1 /* 2 * Copyright (c) 2002, 2020, 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 gc randomness 27 * 28 * @summary converted from VM Testbase gc/gctests/JumbleGC. 29 * VM Testbase keywords: [gc, stress, stressopt, nonconcurrent] 30 * VM Testbase readme: 31 * A vector of 10 elements is filled up with references to 32 * CicrcularLinkedList and Binary Trees of 0.1 Meg. Once this 33 * entire structure has been built, all elements in the Vecor are set to null 34 * creating 1Meg of garbage. The Vector is repopulated once again. 35 * With ineffective garbage collection, the heap will soon fill up. 36 * If an OutofMemoryError is thrown, the test fails. 37 * 38 * @library /vmTestbase 39 * /test/lib 40 * @run driver jdk.test.lib.FileInstaller . . 41 * @run main/othervm -XX:-UseGCOverheadLimit gc.gctests.JumbleGC.JumbleGC 42 */ 43 44 package gc.gctests.JumbleGC; 45 46 import nsk.share.test.*; 47 import nsk.share.gc.*; 48 import java.util.Vector; 49 50 public class JumbleGC extends TestBase { 51 public void run() { 52 int TreeSize = 1000; 53 int gc_count; 54 int randNum; 55 int num = 0; 56 57 Vector v = new Vector(10); 58 59 // Build a tree containing 100 treeNodes occupying about 60 // 1Meg of heap space. 61 62 gc_count = 0; 63 try { 64 for(int i = 0; i < 10 ; i++) { 65 if ( i % 2 == 0 ) 66 v.addElement(buildCircularLinkedList()); 67 else 68 v.addElement(buildTree()); 69 } 70 71 while (gc_count < 10) { 72 73 for (int i = 0; i < 10 ; i++) 74 v.setElementAt(null, i); 75 76 for (int i = 0; i < 10 ; i++) { 77 if ( i % 2 == 0 ) 78 v.setElementAt(buildCircularLinkedList(),i); 79 else 80 v.setElementAt(buildTree(),i); 81 } 82 gc_count ++; 83 log.info("Finished iteration # " + gc_count); 84 } 85 86 } catch (OutOfMemoryError e) { 87 log.error("Test Failed."); 88 setFailed(true); 89 } 90 log.info("Test Passed."); 91 } 92 93 public static void main(String args[]){ 94 GC.runTest(new JumbleGC(), args); 95 } 96 97 // build a binary tree of 0.1 Meg.(100 treeNodes in the three, each of 100 bytes 98 99 private Tree buildTree() { 100 int i, randNum; 101 102 i = 0; 103 Tree newTree = new Tree(100); 104 while (i < 100) { 105 randNum = LocalRandom.nextInt(0, 1000000); 106 newTree.addElement(randNum); 107 i++; 108 } 109 return newTree; 110 } 111 112 // build a circular linked list of 0.1 Meg 113 private CircularLinkedList buildCircularLinkedList() { 114 CircularLinkedList cl; 115 cl = new CircularLinkedList(100); 116 for(int i = 0; i < 1000; i++) 117 cl.grow(); 118 return cl; 119 } 120 }