File: StringGenerator.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 (136 lines) | stat: -rw-r--r-- 5,091 bytes parent folder | download | duplicates (19)
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
133
134
135
136
/*
 * Copyright (c) 2017, 2018, 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.
 */
package gc.gctests.StringInternSyncWithGC;

import java.lang.ref.Reference;
import java.lang.ref.SoftReference;
import java.lang.ref.WeakReference;
import java.util.List;
import java.util.concurrent.locks.ReadWriteLock;
import java.util.concurrent.locks.ReentrantReadWriteLock;
import nsk.share.TestBug;
import nsk.share.TestFailure;
import nsk.share.gc.gp.string.RandomStringProducer;
import nsk.share.test.ExecutionController;
import nsk.share.test.LocalRandom;

class StringGenerator implements Runnable {

    private final RandomStringProducer gp;
    private final List<String> stringsToIntern;
    private final int threadNumber;
    private final int numberOfActions;
    private final int maxStringSize;
    private final StringInternSyncWithGC base;
    private static final ReadWriteLock RWLOCK = new ReentrantReadWriteLock();

    public StringGenerator(int threadId, StringInternSyncWithGC base) {
        this.base = base;
        threadNumber = threadId;
        stringsToIntern = base.getStringsToIntern();
        numberOfActions = base.getNumberOfThreads() > 4 ? base.getNumberOfThreads() : 4;
        gp = base.getGarbageProducer();
        maxStringSize = base.getMaxStringSize();
    }

    /* This field is public just to be not optimized */
    public String copy;

    @Override
    public void run() {
        ExecutionController stresser = base.getExecController();
        try {
            RWLOCK.readLock().lock();
            Object[] refToInterned = new Object[stringsToIntern.size()];
            for (int i = 0; i < stringsToIntern.size(); i++) {
                if (!stresser.continueExecution()) {
                    return;
                }
                int index = LocalRandom.nextInt(stringsToIntern.size());
                String str = stringsToIntern.get(index);
                int action = LocalRandom.nextInt(numberOfActions);

                /* We want to provoke a lot of collections for each interned copy
                 * so map should be "sparse".
                 */
                copy = new String(str);
                switch (action) {
                    case 0:
                        refToInterned[index] = copy.intern();
                        break;
                    case 1:
                        refToInterned[index] = new WeakReference(copy.intern());
                        break;
                    case 2:
                        refToInterned[index] = new SoftReference(copy.intern());
                        break;
                    default:
                        refToInterned[index] = null;
                        break;
                }
            }
            for (int index = 0; index < stringsToIntern.size(); index++) {
                verify(refToInterned[index], stringsToIntern.get(index));
            }
        } finally {
            RWLOCK.readLock().unlock();
        }

        if (threadNumber == 0) {
            try {
                RWLOCK.writeLock().lock();
                for (int index = 0; index < stringsToIntern.size(); index++) {
                    stringsToIntern.set(index, gp.create(maxStringSize).intern());
                }
            } finally {
                RWLOCK.writeLock().unlock();
            }
        }
    }

    /*
     * Verify that all exist interned strings in a map
     * a same objects.
     */
    private void verify(Object obj, String str) {
        if (obj == null) {
            return;
        }
        if (obj instanceof Reference) {
            obj = ((Reference) obj).get();
            if (obj == null) {
                return;
            }
        }
        if (!(obj instanceof String)) {
            throw new TestBug("Expected String. Find :" + obj.getClass());
        }
        String interned = (String) obj;
        if (!interned.equals(str)) {
            throw new TestFailure("Interned not equals to original string.");
        }
        if (obj != str.intern()) {
            throw new TestFailure("Interned not same as original string.");
        }
    }
}