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
|
/*
* Copyright (c) 2004, 2013, 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
* @bug 4486658 8010293
* @summary thread safety of toArray methods of collection views
* @author Martin Buchholz
*/
import java.util.List;
import java.util.concurrent.CompletableFuture;
import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.ThreadLocalRandom;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
public class ToArray {
public static void main(String[] args) throws Throwable {
final int runsPerTest = Integer.getInteger("jsr166.runsPerTest", 1);
final int reps = 10 * runsPerTest;
for (int i = reps; i--> 0; )
executeTest();
}
static void executeTest() throws Throwable {
final ConcurrentHashMap<Integer, Integer> m = new ConcurrentHashMap<>();
final ThreadLocalRandom rnd = ThreadLocalRandom.current();
final int nCPU = Runtime.getRuntime().availableProcessors();
final int minWorkers = 2;
final int maxWorkers = Math.max(minWorkers, Math.min(32, nCPU));
final int nWorkers = rnd.nextInt(minWorkers, maxWorkers + 1);
final int sizePerWorker = 1024;
final int maxSize = nWorkers * sizePerWorker;
// The foreman busy-checks that the size of the arrays obtained
// from the keys and values views grows monotonically until it
// reaches the maximum size.
// NOTE: these size constraints are not specific to toArray and are
// applicable to any form of traversal of the collection views
CompletableFuture<?> foreman = CompletableFuture.runAsync(new Runnable() {
private int prevSize = 0;
private boolean checkProgress(Object[] a) {
int size = a.length;
if (size < prevSize || size > maxSize)
throw new AssertionError(
String.format("prevSize=%d size=%d maxSize=%d",
prevSize, size, maxSize));
prevSize = size;
return size == maxSize;
}
public void run() {
Integer[] empty = new Integer[0];
for (;;)
if (checkProgress(m.values().toArray())
& checkProgress(m.keySet().toArray())
& checkProgress(m.values().toArray(empty))
& checkProgress(m.keySet().toArray(empty)))
return;
}
});
// Each worker puts globally unique keys into the map
List<CompletableFuture<?>> workers =
IntStream.range(0, nWorkers)
.mapToObj(w -> (Runnable) () -> {
for (int i = 0, o = w * sizePerWorker; i < sizePerWorker; i++)
m.put(o + i, i);
})
.map(CompletableFuture::runAsync)
.collect(Collectors.toList());
// Wait for workers and foreman to complete
workers.forEach(CompletableFuture<?>::join);
foreman.join();
}
}
|
