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