1 /* 2 * Copyright (c) 2002, 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 /* 26 * @test 27 * @key stress gc 28 * 29 * @summary converted from VM Testbase gc/memory/UniThread/Linear2. 30 * VM Testbase keywords: [gc, stress, stressopt, nonconcurrent] 31 * 32 * @library /vmTestbase 33 * /test/lib 34 * @run driver jdk.test.lib.FileInstaller . . 35 * @run main/othervm gc.memory.UniThread.Linear2.Linear2 -iterations 5 36 */ 37 38 package gc.memory.UniThread.Linear2; 39 40 import nsk.share.gc.*; 41 import gc.memory.UniThread.Linear1.Linear1; 42 43 /** 44 * Test GC collection of linked lists. 45 * 46 * This test simply creates a series of singly 47 * linked memory objects which should be able to be 48 * GC'd. 49 * 50 * In this test the size of one object is medium, the number 51 * of objects in one list is medium and the number 52 * of lists is large. 53 */ 54 55 public class Linear2 { 56 public static void main(String args[]) { 57 int circularitySize = 100; 58 int objectSize = 1000; 59 GC.runTest(new Linear1(objectSize, circularitySize), args); 60 } 61 }