File: MTLinkedListGC.java

package info (click to toggle)
openjdk-25 25.0.1%2B8-1~deb13u1
  • links: PTS, VCS
  • area: main
  • in suites: trixie
  • size: 825,408 kB
  • sloc: java: 5,585,680; cpp: 1,333,948; xml: 1,321,242; ansic: 488,034; asm: 404,003; objc: 21,088; sh: 15,106; javascript: 13,265; python: 8,319; makefile: 2,518; perl: 357; awk: 351; pascal: 103; exp: 83; sed: 72; jsp: 24
file content (132 lines) | stat: -rw-r--r-- 5,190 bytes parent folder | download | duplicates (10)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
/*
 * Copyright (c) 2002, 2020, Oracle and/or its affiliates. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free Software Foundation.
 *
 * This code is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 * or visit www.oracle.com if you need additional information or have any
 * questions.
 */

/*
 * @test
 * @key stress
 *
 * @summary converted from VM Testbase gc/gctests/MTLinkedListGC.
 * VM Testbase keywords: [gc, stress, nonconcurrent]
 * VM Testbase readme:
 * In this test 1000 threads contribute in the formation
 * of 1 Meg circular Linked list. Insertion into the linked list
 * is sequential. Once formed, the linked list is converted to
 * garbage and the process repeated 50 times. The test fails
 * if an OutofMemoryException is thrown and passes otherwise.
 *
 * @library /vmTestbase
 *          /test/lib
 * @run main/othervm gc.gctests.MTLinkedListGC.MTLinkedListGC
 */

package gc.gctests.MTLinkedListGC;

import java.util.Vector;
import nsk.share.TestFailure;

class CircularLinkedList {
        synchronized void addElement(String info) {
                node newnode;
                int elementCount ; // Number of nodes in LinkedList
                elementCount = elementCount();
                // Do not allow the linked list to grow to more
                // than  100000 nodes
                if (elementCount >= MAXNODES)
                         return;
                newnode = new node(info);
                if (Root == null) {
                         Root = newnode;
                         Root.next = Root;
                         Root.prev = Root;
                }
                else {
                         newnode.next = Root.next;
                         Root.next.prev = newnode;
                         Root.next = newnode;
                         newnode.prev = Root;
                }
        }
        private synchronized int elementCount() {
                node p;
                int count;
                if (Root == null)
                        return 0;
                p = Root;
                count = 0;
                do {
                        p = p.prev;
                        count++;
                } while(p != Root);
                return count;
        }
        private node Root;
        private final int MAXNODES = 100000;
}

class LinkedListGrower extends Thread {
        LinkedListGrower(int ThreadNumber) {
                setName("Thread-" + ThreadNumber);
        }

        public void run() {
                LinkedListHolder.getCircularLinkedList().addElement(getName());
        }
}

class LinkedListHolder {
        private static CircularLinkedList cl = new CircularLinkedList();
        static CircularLinkedList getCircularLinkedList() { return cl; }
        static void getNewList() { cl = new CircularLinkedList(); }
}

public class MTLinkedListGC {
        public static void main(String args[]) {
                int memory_reserve[] = new int [1000];
                Thread ThreadsArray[] = new LinkedListGrower[1000];
                int count;
//              for(int i = 0; i < ThreadsArray.length; i++ )
//                      ThreadsArray[i] = new LinkedListGrower(i);
                count = 0;
                try {
                        while(count < 50 ){
                                for(int i = 0; i < ThreadsArray.length; i++ )
                                        ThreadsArray[i] = new LinkedListGrower(i);
                                for(int i = 0 ; i < ThreadsArray.length ; i++)
                                        ThreadsArray[i].start();
                                try {
                                        for(int i =0 ; i < ThreadsArray.length ; i++)
                                                ThreadsArray[i].join();
                                } catch(Exception e) { }
                                //turn the old linked list into garbage
                                LinkedListHolder.getNewList();
                                System.out.println("Finished iteration " + count);
                                count ++;
                        }
                } catch (OutOfMemoryError e) {
                        memory_reserve = null;
                        System.gc();
                        throw new TestFailure("Test Failed at " + count +"th iteration.");
                }
                System.out.println("Test Passed");
        }
}