File: WhiteBox.java

package info (click to toggle)
openjdk-11 11.0.4%2B11-1
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 757,028 kB
  • sloc: java: 5,016,041; xml: 1,191,974; cpp: 934,731; ansic: 555,697; sh: 24,299; objc: 12,703; python: 3,602; asm: 3,415; makefile: 2,772; awk: 351; sed: 172; perl: 114; jsp: 24; csh: 3
file content (210 lines) | stat: -rw-r--r-- 7,667 bytes parent folder | download | duplicates (16)
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
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
/*
 * 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.
 */

/*
 * This file is available under and governed by the GNU General Public
 * License version 2 only, as published by the Free Software Foundation.
 * However, the following notice accompanied the original version of this
 * file:
 *
 * Written by Martin Buchholz with assistance from members of JCP
 * JSR-166 Expert Group and released to the public domain, as
 * explained at http://creativecommons.org/publicdomain/zero/1.0/
 */

/*
 * @test
 * @modules java.base/java.util.concurrent:open
 * @run testng WhiteBox
 * @summary White box tests of implementation details
 */

import static org.testng.Assert.*;
import org.testng.annotations.Test;

import java.io.ByteArrayInputStream;
import java.io.ByteArrayOutputStream;
import java.io.ObjectInputStream;
import java.io.ObjectOutputStream;
import java.lang.invoke.MethodHandle;
import java.lang.invoke.MethodHandles;
import java.lang.invoke.MethodType;
import java.lang.invoke.VarHandle;
import java.util.List;
import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.ThreadLocalRandom;
import java.util.function.Supplier;

@Test
public class WhiteBox {
    final ThreadLocalRandom rnd = ThreadLocalRandom.current();
    final VarHandle TABLE, NEXTTABLE, SIZECTL;
    final MethodHandle TABLE_SIZE_FOR;

    WhiteBox() throws ReflectiveOperationException {
        Class<?> mClass = ConcurrentHashMap.class;
        String nodeClassName = mClass.getName() + "$Node";
        Class<?> nodeClass = Class.forName(nodeClassName);
        Class<?> nodeArrayClass = Class.forName("[L" + nodeClassName + ";");
        MethodHandles.Lookup lookup
            = MethodHandles.privateLookupIn(mClass, MethodHandles.lookup());
        TABLE = lookup.findVarHandle(mClass, "table", nodeArrayClass);
        NEXTTABLE = lookup.findVarHandle(mClass, "nextTable", nodeArrayClass);
        SIZECTL = lookup.findVarHandle(mClass, "sizeCtl", int.class);
        TABLE_SIZE_FOR = lookup.findStatic(
                mClass, "tableSizeFor",
                MethodType.methodType(int.class, int.class));
    }

    Object[] table(ConcurrentHashMap m) { return (Object[]) TABLE.getVolatile(m); }
    Object[] nextTable(ConcurrentHashMap m) { return (Object[]) NEXTTABLE.getVolatile(m); }
    int sizeCtl(ConcurrentHashMap m) { return (int) SIZECTL.getVolatile(m); }
    int tableSizeFor(int n) {
        try {
            return (int) TABLE_SIZE_FOR.invoke(n);
        } catch (Throwable t) { throw new AssertionError(t); }
    }

    List<Supplier<ConcurrentHashMap>> newConcurrentHashMapSuppliers(
        int initialCapacity) {
        return List.of(
            () -> new ConcurrentHashMap(initialCapacity),
            () -> new ConcurrentHashMap(initialCapacity, 0.75f),
            () -> new ConcurrentHashMap(initialCapacity, 0.75f, 1));
    }

    ConcurrentHashMap newConcurrentHashMap(int initialCapacity) {
        List<Supplier<ConcurrentHashMap>> suppliers
            = newConcurrentHashMapSuppliers(initialCapacity);
        return suppliers.get(rnd.nextInt(suppliers.size())).get();
    }

    @Test
    public void defaultConstructor() {
        ConcurrentHashMap m = new ConcurrentHashMap();
        assertNull(table(m));
        assertEquals(sizeCtl(m), 0);
        assertResizeNotInProgress(m);
    }

    @Test
    public void shouldNotResizeWhenInitialCapacityProvided() {
        int initialCapacity = rnd.nextInt(1, 100);
        Object[] initialTable = null;
        ConcurrentHashMap m = newConcurrentHashMap(initialCapacity);

        // table is lazily initialized
        assertNull(table(m));
        int expectedInitialTableLength = sizeCtl(m);

        assertInvariants(m);
        for (int i = 0; i < initialCapacity; i++) {
            m.put(i * 100 + rnd.nextInt(100), i);
            if (i == 0)
                initialTable = table(m);
            else
                assertSame(table(m), initialTable);
            assertInvariants(m);
        }
        assertEquals(initialTable.length, expectedInitialTableLength);
    }

    @Test
    public void constructorsShouldGiveSameInitialCapacity() {
        int initialCapacity = rnd.nextInt(1, 256);
        long distinctTableLengths
            = newConcurrentHashMapSuppliers(initialCapacity).stream()
            .map(Supplier::get)
            .mapToInt(map -> { map.put(42, 42); return table(map).length; })
            .distinct()
            .count();
        assertEquals(1L, distinctTableLengths);
    }

    @Test
    public void testTableSizeFor() {
        assertEquals(1, tableSizeFor(0));
        assertEquals(1, tableSizeFor(1));
        assertEquals(2, tableSizeFor(2));
        assertEquals(4, tableSizeFor(3));
        assertEquals(16, tableSizeFor(15));
        assertEquals(16, tableSizeFor(16));
        assertEquals(32, tableSizeFor(17));
        int maxSize = 1 << 30;
        assertEquals(maxSize, tableSizeFor(maxSize - 1));
        assertEquals(maxSize, tableSizeFor(maxSize));
        assertEquals(maxSize, tableSizeFor(maxSize + 1));
        assertEquals(maxSize, tableSizeFor(Integer.MAX_VALUE));
    }

    byte[] serialBytes(Object o) {
        try {
            ByteArrayOutputStream bos = new ByteArrayOutputStream();
            ObjectOutputStream oos = new ObjectOutputStream(bos);
            oos.writeObject(o);
            oos.flush();
            oos.close();
            return bos.toByteArray();
        } catch (Exception fail) {
            throw new AssertionError(fail);
        }
    }

    @SuppressWarnings("unchecked")
    <T> T serialClone(T o) {
        try {
            ObjectInputStream ois = new ObjectInputStream
                (new ByteArrayInputStream(serialBytes(o)));
            T clone = (T) ois.readObject();
            assertNotSame(o, clone);
            assertSame(o.getClass(), clone.getClass());
            return clone;
        } catch (Exception fail) {
            throw new AssertionError(fail);
        }
    }

    @Test
    public void testSerialization() {
        assertInvariants(serialClone(new ConcurrentHashMap()));

        ConcurrentHashMap m = newConcurrentHashMap(rnd.nextInt(100));
        m.put(1, 1);
        ConcurrentHashMap clone = serialClone(m);
        assertInvariants(clone);
        assertNotSame(table(m), table(clone));
        assertEquals(m, clone);
        assertResizeNotInProgress(m);
        assertResizeNotInProgress(clone);
    }

    /** Checks conditions which should always be true. */
    void assertInvariants(ConcurrentHashMap m) {
        if (!m.isEmpty())
            assertNotNull(table(m));
    }

    void assertResizeNotInProgress(ConcurrentHashMap m) {
        assertTrue(sizeCtl(m) >= 0);
        assertNull(nextTable(m));
    }
}