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 randomness 27 * 28 * @summary converted from VM Testbase gc/memory/UniThread/Linear3. 29 * VM Testbase keywords: [gc, stress, stressopt, nonconcurrent] 30 * 31 * @library /vmTestbase 32 * /test/lib 33 * @run main/othervm gc.memory.UniThread.Linear3.Linear3 -iterations 5 34 */ 35 36 package gc.memory.UniThread.Linear3; 37 38 import nsk.share.test.*; 39 import nsk.share.gc.*; 40 41 /** 42 * Test GC collection of linked lists. 43 * 44 * This test simply creates a series of singly 45 * linked memory objects which should be able to be 46 * GC'd. 47 * 48 * In this test the size of one object is small, the number 49 * of objects in one list is medium and the number 50 * of lists is large. Also, the order in which references 51 * are cleared is randomized. 52 */ 53 public class Linear3 extends GCTestBase { 54 private int arraySize; 55 private int objectSize; 56 private int circularitySize; 57 private MemoryObject memoryArray[]; 58 Linear3()59 public Linear3() { 60 this(100, 5); 61 } 62 Linear3(int objectSize, int circularitySize)63 public Linear3(int objectSize, int circularitySize) { 64 this.objectSize = objectSize; 65 this.circularitySize = circularitySize; 66 } 67 run()68 public void run() { 69 arraySize = Memory.getArrayLength(runParams.getTestMemory(), Memory.getListSize(circularitySize, objectSize)); 70 log.debug("Array size: " + arraySize); 71 Stresser stresser = new Stresser(runParams.getStressOptions()); 72 memoryArray = new MemoryObject[arraySize]; 73 stresser.start(runParams.getIterations()); 74 try { 75 while (stresser.iteration()) { 76 log.debug(Runtime.getRuntime().freeMemory()); 77 for (int i = 0; i < arraySize && stresser.continueExecution(); i ++) { 78 int index = LocalRandom.nextInt(arraySize); 79 memoryArray[index] = Memory.makeCircularList(circularitySize, objectSize); 80 } 81 } 82 } finally { 83 stresser.finish(); 84 } 85 System.out.println("Test passed."); 86 } 87 main(String args[])88 public static void main(String args[]) { 89 GC.runTest(new Linear3(), args); 90 } 91 } 92