1 |
dl |
1.1 |
/* |
2 |
dl |
1.6 |
* Written by Doug Lea with assistance from members of JCP JSR-166 |
3 |
|
|
* Expert Group and released to the public domain, as explained at |
4 |
jsr166 |
1.19 |
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
jsr166 |
1.10 |
* Other contributors include Andrew Wright, Jeffrey Hayes, |
6 |
|
|
* Pat Fisher, Mike Judd. |
7 |
dl |
1.1 |
*/ |
8 |
|
|
|
9 |
|
|
import junit.framework.*; |
10 |
jsr166 |
1.21 |
import java.util.Arrays; |
11 |
|
|
import java.util.concurrent.atomic.AtomicLongArray; |
12 |
dl |
1.1 |
|
13 |
dl |
1.3 |
public class AtomicLongArrayTest extends JSR166TestCase { |
14 |
jsr166 |
1.16 |
public static void main(String[] args) { |
15 |
|
|
junit.textui.TestRunner.run(suite()); |
16 |
dl |
1.1 |
} |
17 |
|
|
public static Test suite() { |
18 |
|
|
return new TestSuite(AtomicLongArrayTest.class); |
19 |
|
|
} |
20 |
|
|
|
21 |
dl |
1.4 |
/** |
22 |
dl |
1.5 |
* constructor creates array of given size with all elements zero |
23 |
dl |
1.4 |
*/ |
24 |
jsr166 |
1.12 |
public void testConstructor() { |
25 |
dl |
1.3 |
AtomicLongArray ai = new AtomicLongArray(SIZE); |
26 |
jsr166 |
1.10 |
for (int i = 0; i < SIZE; ++i) |
27 |
jsr166 |
1.23 |
assertEquals(0, ai.get(i)); |
28 |
dl |
1.1 |
} |
29 |
|
|
|
30 |
dl |
1.4 |
/** |
31 |
dl |
1.7 |
* constructor with null array throws NPE |
32 |
|
|
*/ |
33 |
|
|
public void testConstructor2NPE() { |
34 |
|
|
try { |
35 |
|
|
long[] a = null; |
36 |
|
|
AtomicLongArray ai = new AtomicLongArray(a); |
37 |
jsr166 |
1.13 |
shouldThrow(); |
38 |
|
|
} catch (NullPointerException success) {} |
39 |
dl |
1.7 |
} |
40 |
|
|
|
41 |
|
|
/** |
42 |
|
|
* constructor with array is of same size and has all elements |
43 |
|
|
*/ |
44 |
|
|
public void testConstructor2() { |
45 |
jsr166 |
1.22 |
long[] a = { 17L, 3L, -42L, 99L, -7L }; |
46 |
dl |
1.7 |
AtomicLongArray ai = new AtomicLongArray(a); |
47 |
|
|
assertEquals(a.length, ai.length()); |
48 |
jsr166 |
1.10 |
for (int i = 0; i < a.length; ++i) |
49 |
dl |
1.7 |
assertEquals(a[i], ai.get(i)); |
50 |
|
|
} |
51 |
|
|
|
52 |
|
|
/** |
53 |
dl |
1.5 |
* get and set for out of bound indices throw IndexOutOfBoundsException |
54 |
|
|
*/ |
55 |
jsr166 |
1.12 |
public void testIndexing() { |
56 |
dl |
1.5 |
AtomicLongArray ai = new AtomicLongArray(SIZE); |
57 |
|
|
try { |
58 |
|
|
ai.get(SIZE); |
59 |
jsr166 |
1.13 |
shouldThrow(); |
60 |
jsr166 |
1.12 |
} catch (IndexOutOfBoundsException success) { |
61 |
dl |
1.5 |
} |
62 |
|
|
try { |
63 |
|
|
ai.get(-1); |
64 |
jsr166 |
1.13 |
shouldThrow(); |
65 |
jsr166 |
1.12 |
} catch (IndexOutOfBoundsException success) { |
66 |
dl |
1.5 |
} |
67 |
|
|
try { |
68 |
|
|
ai.set(SIZE, 0); |
69 |
jsr166 |
1.13 |
shouldThrow(); |
70 |
jsr166 |
1.12 |
} catch (IndexOutOfBoundsException success) { |
71 |
dl |
1.5 |
} |
72 |
|
|
try { |
73 |
|
|
ai.set(-1, 0); |
74 |
jsr166 |
1.13 |
shouldThrow(); |
75 |
jsr166 |
1.12 |
} catch (IndexOutOfBoundsException success) { |
76 |
dl |
1.5 |
} |
77 |
|
|
} |
78 |
|
|
|
79 |
|
|
/** |
80 |
|
|
* get returns the last value set at index |
81 |
dl |
1.4 |
*/ |
82 |
jsr166 |
1.12 |
public void testGetSet() { |
83 |
jsr166 |
1.10 |
AtomicLongArray ai = new AtomicLongArray(SIZE); |
84 |
dl |
1.3 |
for (int i = 0; i < SIZE; ++i) { |
85 |
dl |
1.1 |
ai.set(i, 1); |
86 |
jsr166 |
1.23 |
assertEquals(1, ai.get(i)); |
87 |
dl |
1.1 |
ai.set(i, 2); |
88 |
jsr166 |
1.23 |
assertEquals(2, ai.get(i)); |
89 |
dl |
1.1 |
ai.set(i, -3); |
90 |
jsr166 |
1.23 |
assertEquals(-3, ai.get(i)); |
91 |
dl |
1.1 |
} |
92 |
|
|
} |
93 |
|
|
|
94 |
dl |
1.4 |
/** |
95 |
dl |
1.9 |
* get returns the last value lazySet at index by same thread |
96 |
|
|
*/ |
97 |
jsr166 |
1.12 |
public void testGetLazySet() { |
98 |
jsr166 |
1.10 |
AtomicLongArray ai = new AtomicLongArray(SIZE); |
99 |
dl |
1.9 |
for (int i = 0; i < SIZE; ++i) { |
100 |
|
|
ai.lazySet(i, 1); |
101 |
jsr166 |
1.23 |
assertEquals(1, ai.get(i)); |
102 |
dl |
1.9 |
ai.lazySet(i, 2); |
103 |
jsr166 |
1.23 |
assertEquals(2, ai.get(i)); |
104 |
dl |
1.9 |
ai.lazySet(i, -3); |
105 |
jsr166 |
1.23 |
assertEquals(-3, ai.get(i)); |
106 |
dl |
1.9 |
} |
107 |
|
|
} |
108 |
|
|
|
109 |
|
|
/** |
110 |
dl |
1.5 |
* compareAndSet succeeds in changing value if equal to expected else fails |
111 |
dl |
1.4 |
*/ |
112 |
jsr166 |
1.12 |
public void testCompareAndSet() { |
113 |
jsr166 |
1.10 |
AtomicLongArray ai = new AtomicLongArray(SIZE); |
114 |
dl |
1.3 |
for (int i = 0; i < SIZE; ++i) { |
115 |
dl |
1.1 |
ai.set(i, 1); |
116 |
jsr166 |
1.23 |
assertTrue(ai.compareAndSet(i, 1, 2)); |
117 |
|
|
assertTrue(ai.compareAndSet(i, 2, -4)); |
118 |
|
|
assertEquals(-4, ai.get(i)); |
119 |
|
|
assertFalse(ai.compareAndSet(i, -5, 7)); |
120 |
|
|
assertEquals(-4, ai.get(i)); |
121 |
|
|
assertTrue(ai.compareAndSet(i, -4, 7)); |
122 |
|
|
assertEquals(7, ai.get(i)); |
123 |
dl |
1.1 |
} |
124 |
|
|
} |
125 |
|
|
|
126 |
dl |
1.4 |
/** |
127 |
dl |
1.5 |
* compareAndSet in one thread enables another waiting for value |
128 |
|
|
* to succeed |
129 |
|
|
*/ |
130 |
jsr166 |
1.13 |
public void testCompareAndSetInMultipleThreads() throws InterruptedException { |
131 |
dl |
1.5 |
final AtomicLongArray a = new AtomicLongArray(1); |
132 |
|
|
a.set(0, 1); |
133 |
jsr166 |
1.14 |
Thread t = new Thread(new CheckedRunnable() { |
134 |
|
|
public void realRun() { |
135 |
|
|
while (!a.compareAndSet(0, 2, 3)) |
136 |
|
|
Thread.yield(); |
137 |
|
|
}}); |
138 |
jsr166 |
1.13 |
|
139 |
|
|
t.start(); |
140 |
|
|
assertTrue(a.compareAndSet(0, 1, 2)); |
141 |
|
|
t.join(LONG_DELAY_MS); |
142 |
|
|
assertFalse(t.isAlive()); |
143 |
jsr166 |
1.24 |
assertEquals(3, a.get(0)); |
144 |
dl |
1.5 |
} |
145 |
|
|
|
146 |
|
|
/** |
147 |
|
|
* repeated weakCompareAndSet succeeds in changing value when equal |
148 |
jsr166 |
1.10 |
* to expected |
149 |
dl |
1.4 |
*/ |
150 |
jsr166 |
1.12 |
public void testWeakCompareAndSet() { |
151 |
jsr166 |
1.10 |
AtomicLongArray ai = new AtomicLongArray(SIZE); |
152 |
dl |
1.3 |
for (int i = 0; i < SIZE; ++i) { |
153 |
dl |
1.1 |
ai.set(i, 1); |
154 |
jsr166 |
1.23 |
while (!ai.weakCompareAndSet(i, 1, 2)); |
155 |
|
|
while (!ai.weakCompareAndSet(i, 2, -4)); |
156 |
|
|
assertEquals(-4, ai.get(i)); |
157 |
|
|
while (!ai.weakCompareAndSet(i, -4, 7)); |
158 |
|
|
assertEquals(7, ai.get(i)); |
159 |
dl |
1.1 |
} |
160 |
|
|
} |
161 |
|
|
|
162 |
dl |
1.4 |
/** |
163 |
jsr166 |
1.18 |
* getAndSet returns previous value and sets to given value at given index |
164 |
dl |
1.4 |
*/ |
165 |
jsr166 |
1.12 |
public void testGetAndSet() { |
166 |
jsr166 |
1.10 |
AtomicLongArray ai = new AtomicLongArray(SIZE); |
167 |
dl |
1.3 |
for (int i = 0; i < SIZE; ++i) { |
168 |
dl |
1.1 |
ai.set(i, 1); |
169 |
jsr166 |
1.23 |
assertEquals(1, ai.getAndSet(i, 0)); |
170 |
|
|
assertEquals(0, ai.getAndSet(i, -10)); |
171 |
|
|
assertEquals(-10, ai.getAndSet(i, 1)); |
172 |
dl |
1.1 |
} |
173 |
|
|
} |
174 |
|
|
|
175 |
dl |
1.4 |
/** |
176 |
jsr166 |
1.18 |
* getAndAdd returns previous value and adds given value |
177 |
dl |
1.4 |
*/ |
178 |
jsr166 |
1.12 |
public void testGetAndAdd() { |
179 |
jsr166 |
1.10 |
AtomicLongArray ai = new AtomicLongArray(SIZE); |
180 |
dl |
1.3 |
for (int i = 0; i < SIZE; ++i) { |
181 |
dl |
1.1 |
ai.set(i, 1); |
182 |
jsr166 |
1.23 |
assertEquals(1, ai.getAndAdd(i, 2)); |
183 |
|
|
assertEquals(3, ai.get(i)); |
184 |
|
|
assertEquals(3, ai.getAndAdd(i, -4)); |
185 |
|
|
assertEquals(-1, ai.get(i)); |
186 |
dl |
1.1 |
} |
187 |
|
|
} |
188 |
|
|
|
189 |
dl |
1.4 |
/** |
190 |
dl |
1.5 |
* getAndDecrement returns previous value and decrements |
191 |
dl |
1.4 |
*/ |
192 |
jsr166 |
1.12 |
public void testGetAndDecrement() { |
193 |
jsr166 |
1.10 |
AtomicLongArray ai = new AtomicLongArray(SIZE); |
194 |
dl |
1.3 |
for (int i = 0; i < SIZE; ++i) { |
195 |
dl |
1.1 |
ai.set(i, 1); |
196 |
jsr166 |
1.23 |
assertEquals(1, ai.getAndDecrement(i)); |
197 |
|
|
assertEquals(0, ai.getAndDecrement(i)); |
198 |
|
|
assertEquals(-1, ai.getAndDecrement(i)); |
199 |
dl |
1.1 |
} |
200 |
|
|
} |
201 |
|
|
|
202 |
dl |
1.4 |
/** |
203 |
dl |
1.5 |
* getAndIncrement returns previous value and increments |
204 |
dl |
1.4 |
*/ |
205 |
jsr166 |
1.12 |
public void testGetAndIncrement() { |
206 |
jsr166 |
1.10 |
AtomicLongArray ai = new AtomicLongArray(SIZE); |
207 |
dl |
1.3 |
for (int i = 0; i < SIZE; ++i) { |
208 |
dl |
1.1 |
ai.set(i, 1); |
209 |
jsr166 |
1.23 |
assertEquals(1, ai.getAndIncrement(i)); |
210 |
|
|
assertEquals(2, ai.get(i)); |
211 |
|
|
ai.set(i, -2); |
212 |
|
|
assertEquals(-2, ai.getAndIncrement(i)); |
213 |
|
|
assertEquals(-1, ai.getAndIncrement(i)); |
214 |
|
|
assertEquals(0, ai.getAndIncrement(i)); |
215 |
|
|
assertEquals(1, ai.get(i)); |
216 |
dl |
1.1 |
} |
217 |
|
|
} |
218 |
|
|
|
219 |
dl |
1.4 |
/** |
220 |
jsr166 |
1.18 |
* addAndGet adds given value to current, and returns current value |
221 |
dl |
1.4 |
*/ |
222 |
dl |
1.1 |
public void testAddAndGet() { |
223 |
jsr166 |
1.10 |
AtomicLongArray ai = new AtomicLongArray(SIZE); |
224 |
dl |
1.3 |
for (int i = 0; i < SIZE; ++i) { |
225 |
dl |
1.1 |
ai.set(i, 1); |
226 |
jsr166 |
1.23 |
assertEquals(3, ai.addAndGet(i, 2)); |
227 |
|
|
assertEquals(3, ai.get(i)); |
228 |
|
|
assertEquals(-1, ai.addAndGet(i, -4)); |
229 |
|
|
assertEquals(-1, ai.get(i)); |
230 |
dl |
1.1 |
} |
231 |
|
|
} |
232 |
|
|
|
233 |
dl |
1.4 |
/** |
234 |
dl |
1.5 |
* decrementAndGet decrements and returns current value |
235 |
dl |
1.4 |
*/ |
236 |
jsr166 |
1.12 |
public void testDecrementAndGet() { |
237 |
jsr166 |
1.10 |
AtomicLongArray ai = new AtomicLongArray(SIZE); |
238 |
dl |
1.3 |
for (int i = 0; i < SIZE; ++i) { |
239 |
dl |
1.1 |
ai.set(i, 1); |
240 |
jsr166 |
1.23 |
assertEquals(0, ai.decrementAndGet(i)); |
241 |
|
|
assertEquals(-1, ai.decrementAndGet(i)); |
242 |
|
|
assertEquals(-2, ai.decrementAndGet(i)); |
243 |
|
|
assertEquals(-2, ai.get(i)); |
244 |
dl |
1.1 |
} |
245 |
|
|
} |
246 |
|
|
|
247 |
dl |
1.4 |
/** |
248 |
dl |
1.5 |
* incrementAndGet increments and returns current value |
249 |
dl |
1.4 |
*/ |
250 |
dl |
1.1 |
public void testIncrementAndGet() { |
251 |
jsr166 |
1.10 |
AtomicLongArray ai = new AtomicLongArray(SIZE); |
252 |
dl |
1.3 |
for (int i = 0; i < SIZE; ++i) { |
253 |
dl |
1.1 |
ai.set(i, 1); |
254 |
jsr166 |
1.23 |
assertEquals(2, ai.incrementAndGet(i)); |
255 |
|
|
assertEquals(2, ai.get(i)); |
256 |
dl |
1.1 |
ai.set(i, -2); |
257 |
jsr166 |
1.23 |
assertEquals(-1, ai.incrementAndGet(i)); |
258 |
|
|
assertEquals(0, ai.incrementAndGet(i)); |
259 |
|
|
assertEquals(1, ai.incrementAndGet(i)); |
260 |
|
|
assertEquals(1, ai.get(i)); |
261 |
dl |
1.1 |
} |
262 |
|
|
} |
263 |
dl |
1.2 |
|
264 |
dl |
1.3 |
static final long COUNTDOWN = 100000; |
265 |
jsr166 |
1.10 |
|
266 |
jsr166 |
1.17 |
class Counter extends CheckedRunnable { |
267 |
dl |
1.3 |
final AtomicLongArray ai; |
268 |
|
|
volatile long counts; |
269 |
|
|
Counter(AtomicLongArray a) { ai = a; } |
270 |
jsr166 |
1.17 |
public void realRun() { |
271 |
dl |
1.3 |
for (;;) { |
272 |
|
|
boolean done = true; |
273 |
|
|
for (int i = 0; i < ai.length(); ++i) { |
274 |
|
|
long v = ai.get(i); |
275 |
jsr166 |
1.17 |
assertTrue(v >= 0); |
276 |
dl |
1.3 |
if (v != 0) { |
277 |
|
|
done = false; |
278 |
|
|
if (ai.compareAndSet(i, v, v-1)) |
279 |
|
|
++counts; |
280 |
|
|
} |
281 |
|
|
} |
282 |
|
|
if (done) |
283 |
|
|
break; |
284 |
|
|
} |
285 |
|
|
} |
286 |
|
|
} |
287 |
|
|
|
288 |
dl |
1.4 |
/** |
289 |
dl |
1.5 |
* Multiple threads using same array of counters successfully |
290 |
|
|
* update a number of times equal to total count |
291 |
dl |
1.4 |
*/ |
292 |
jsr166 |
1.13 |
public void testCountingInMultipleThreads() throws InterruptedException { |
293 |
|
|
final AtomicLongArray ai = new AtomicLongArray(SIZE); |
294 |
|
|
for (int i = 0; i < SIZE; ++i) |
295 |
|
|
ai.set(i, COUNTDOWN); |
296 |
|
|
Counter c1 = new Counter(ai); |
297 |
|
|
Counter c2 = new Counter(ai); |
298 |
|
|
Thread t1 = new Thread(c1); |
299 |
|
|
Thread t2 = new Thread(c2); |
300 |
|
|
t1.start(); |
301 |
|
|
t2.start(); |
302 |
|
|
t1.join(); |
303 |
|
|
t2.join(); |
304 |
|
|
assertEquals(c1.counts+c2.counts, SIZE * COUNTDOWN); |
305 |
dl |
1.3 |
} |
306 |
|
|
|
307 |
dl |
1.4 |
/** |
308 |
dl |
1.5 |
* a deserialized serialized array holds same values |
309 |
dl |
1.4 |
*/ |
310 |
jsr166 |
1.13 |
public void testSerialization() throws Exception { |
311 |
jsr166 |
1.21 |
AtomicLongArray x = new AtomicLongArray(SIZE); |
312 |
jsr166 |
1.10 |
for (int i = 0; i < SIZE; ++i) |
313 |
jsr166 |
1.21 |
x.set(i, -i); |
314 |
|
|
AtomicLongArray y = serialClone(x); |
315 |
|
|
assertTrue(x != y); |
316 |
|
|
assertEquals(x.length(), y.length()); |
317 |
jsr166 |
1.13 |
for (int i = 0; i < SIZE; ++i) { |
318 |
jsr166 |
1.21 |
assertEquals(x.get(i), y.get(i)); |
319 |
dl |
1.2 |
} |
320 |
dl |
1.8 |
} |
321 |
|
|
|
322 |
|
|
/** |
323 |
|
|
* toString returns current value. |
324 |
jsr166 |
1.10 |
*/ |
325 |
dl |
1.8 |
public void testToString() { |
326 |
jsr166 |
1.22 |
long[] a = { 17, 3, -42, 99, -7 }; |
327 |
dl |
1.8 |
AtomicLongArray ai = new AtomicLongArray(a); |
328 |
|
|
assertEquals(Arrays.toString(a), ai.toString()); |
329 |
dl |
1.2 |
} |
330 |
|
|
|
331 |
dl |
1.1 |
} |