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
211
212
213
214
215
216
217
218
|
import org.scalacheck._
import Prop._
import org.scalacheck.Gen._
import collection._
import collection.concurrent.TrieMap
case class Wrap(i: Int) {
override def hashCode = i // * 0x9e3775cd
}
/** A check mainly oriented towards checking snapshot correctness.
*/
object Test extends Properties("concurrent.TrieMap") {
/* generators */
val sizes = choose(0, 200000)
val threadCounts = choose(2, 16)
val threadCountsAndSizes = for {
p <- threadCounts
sz <- sizes
} yield (p, sz);
/* helpers */
def inParallel[T](totalThreads: Int)(body: Int => T): Seq[T] = {
val threads = for (idx <- 0 until totalThreads) yield new Thread {
setName("ParThread-" + idx)
private var res: T = _
override def run() {
res = body(idx)
}
def result = {
this.join()
res
}
}
threads foreach (_.start())
threads map (_.result)
}
def spawn[T](body: =>T): { def get: T } = {
val t = new Thread {
setName("SpawnThread")
private var res: T = _
override def run() {
res = body
}
def result = res
}
t.start()
new {
def get: T = {
t.join()
t.result
}
}
}
def elementRange(threadIdx: Int, totalThreads: Int, totalElems: Int): Range = {
val sz = totalElems
val idx = threadIdx
val p = totalThreads
val start = (sz / p) * idx + math.min(idx, sz % p)
val elems = (sz / p) + (if (idx < sz % p) 1 else 0)
val end = start + elems
(start until end)
}
def hasGrown[K, V](last: Map[K, V], current: Map[K, V]) = {
(last.size <= current.size) && {
last forall {
case (k, v) => current.get(k) == Some(v)
}
}
}
object err {
var buffer = new StringBuilder
def println(a: AnyRef) = buffer.append(a.toString).append("\n")
def clear() = buffer.clear()
def flush() = {
Console.out.println(buffer)
clear()
}
}
/* properties */
property("concurrent growing snapshots") = forAll(threadCounts, sizes) {
(numThreads, numElems) =>
val p = 3 //numThreads
val sz = 102 //numElems
val ct = new TrieMap[Wrap, Int]
// checker
val checker = spawn {
def check(last: Map[Wrap, Int], iterationsLeft: Int): Boolean = {
val current = ct.readOnlySnapshot()
if (!hasGrown(last, current)) false
else if (current.size >= sz) true
else if (iterationsLeft < 0) false
else check(current, iterationsLeft - 1)
}
check(ct.readOnlySnapshot(), 500)
}
// fillers
inParallel(p) {
idx =>
elementRange(idx, p, sz) foreach (i => ct.update(Wrap(i), i))
}
// wait for checker to finish
val growing = true//checker.get
val ok = growing && ((0 until sz) forall {
case i => ct.get(Wrap(i)) == Some(i)
})
ok
}
property("update") = forAll(sizes) {
(n: Int) =>
val ct = new TrieMap[Int, Int]
for (i <- 0 until n) ct(i) = i
(0 until n) forall {
case i => ct(i) == i
}
}
property("concurrent update") = forAll(threadCountsAndSizes) {
case (p, sz) =>
val ct = new TrieMap[Wrap, Int]
inParallel(p) {
idx =>
for (i <- elementRange(idx, p, sz)) ct(Wrap(i)) = i
}
(0 until sz) forall {
case i => ct(Wrap(i)) == i
}
}
property("concurrent remove") = forAll(threadCounts, sizes) {
(p, sz) =>
val ct = new TrieMap[Wrap, Int]
for (i <- 0 until sz) ct(Wrap(i)) = i
inParallel(p) {
idx =>
for (i <- elementRange(idx, p, sz)) ct.remove(Wrap(i))
}
(0 until sz) forall {
case i => ct.get(Wrap(i)) == None
}
}
property("concurrent putIfAbsent") = forAll(threadCounts, sizes) {
(p, sz) =>
val ct = new TrieMap[Wrap, Int]
val results = inParallel(p) {
idx =>
elementRange(idx, p, sz) find (i => ct.putIfAbsent(Wrap(i), i) != None)
}
(results forall (_ == None)) && ((0 until sz) forall {
case i => ct.get(Wrap(i)) == Some(i)
})
}
property("concurrent getOrElseUpdate") = forAll(threadCounts, sizes) {
(p, sz) =>
val totalInserts = new java.util.concurrent.atomic.AtomicInteger
val ct = new TrieMap[Wrap, String]
val results = inParallel(p) {
idx =>
(0 until sz) foreach {
i =>
val v = ct.getOrElseUpdate(Wrap(i), idx + ":" + i)
if (v == idx + ":" + i) totalInserts.incrementAndGet()
}
}
(totalInserts.get == sz) && ((0 until sz) forall {
case i => ct(Wrap(i)).split(":")(1).toInt == i
})
}
}
|
