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
219
220
|
/*
* 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 Doug Lea 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/
*/
import java.util.concurrent.CyclicBarrier;
import java.util.concurrent.Executors;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.atomic.LongAdder;
import junit.framework.Test;
import junit.framework.TestSuite;
public class LongAdderTest extends JSR166TestCase {
public static void main(String[] args) {
main(suite(), args);
}
public static Test suite() {
return new TestSuite(LongAdderTest.class);
}
/**
* default constructed initializes to zero
*/
public void testConstructor() {
LongAdder ai = new LongAdder();
assertEquals(0, ai.sum());
}
/**
* add adds given value to current, and sum returns current value
*/
public void testAddAndSum() {
LongAdder ai = new LongAdder();
ai.add(2);
assertEquals(2, ai.sum());
ai.add(-4);
assertEquals(-2, ai.sum());
}
/**
* decrement decrements and sum returns current value
*/
public void testDecrementAndSum() {
LongAdder ai = new LongAdder();
ai.decrement();
assertEquals(-1, ai.sum());
ai.decrement();
assertEquals(-2, ai.sum());
}
/**
* incrementAndGet increments and returns current value
*/
public void testIncrementAndSum() {
LongAdder ai = new LongAdder();
ai.increment();
assertEquals(1, ai.sum());
ai.increment();
assertEquals(2, ai.sum());
}
/**
* reset() causes subsequent sum() to return zero
*/
public void testReset() {
LongAdder ai = new LongAdder();
ai.add(2);
assertEquals(2, ai.sum());
ai.reset();
assertEquals(0, ai.sum());
}
/**
* sumThenReset() returns sum; subsequent sum() returns zero
*/
public void testSumThenReset() {
LongAdder ai = new LongAdder();
ai.add(2);
assertEquals(2, ai.sum());
assertEquals(2, ai.sumThenReset());
assertEquals(0, ai.sum());
}
/**
* a deserialized/reserialized adder holds same value
*/
public void testSerialization() throws Exception {
LongAdder x = new LongAdder();
LongAdder y = serialClone(x);
assertNotSame(x, y);
x.add(-22);
LongAdder z = serialClone(x);
assertNotSame(y, z);
assertEquals(-22, x.sum());
assertEquals(0, y.sum());
assertEquals(-22, z.sum());
}
/**
* toString returns current value.
*/
public void testToString() {
LongAdder ai = new LongAdder();
assertEquals("0", ai.toString());
ai.increment();
assertEquals(Long.toString(1), ai.toString());
}
/**
* intValue returns current value.
*/
public void testIntValue() {
LongAdder ai = new LongAdder();
assertEquals(0, ai.intValue());
ai.increment();
assertEquals(1, ai.intValue());
}
/**
* longValue returns current value.
*/
public void testLongValue() {
LongAdder ai = new LongAdder();
assertEquals(0, ai.longValue());
ai.increment();
assertEquals(1, ai.longValue());
}
/**
* floatValue returns current value.
*/
public void testFloatValue() {
LongAdder ai = new LongAdder();
assertEquals(0.0f, ai.floatValue());
ai.increment();
assertEquals(1.0f, ai.floatValue());
}
/**
* doubleValue returns current value.
*/
public void testDoubleValue() {
LongAdder ai = new LongAdder();
assertEquals(0.0, ai.doubleValue());
ai.increment();
assertEquals(1.0, ai.doubleValue());
}
/**
* adds by multiple threads produce correct sum
*/
public void testAddAndSumMT() throws Throwable {
final int incs = 1000000;
final int nthreads = 4;
final ExecutorService pool = Executors.newCachedThreadPool();
LongAdder a = new LongAdder();
CyclicBarrier barrier = new CyclicBarrier(nthreads + 1);
for (int i = 0; i < nthreads; ++i)
pool.execute(new AdderTask(a, barrier, incs));
barrier.await();
barrier.await();
long total = (long)nthreads * incs;
long sum = a.sum();
assertEquals(sum, total);
pool.shutdown();
}
static final class AdderTask implements Runnable {
final LongAdder adder;
final CyclicBarrier barrier;
final int incs;
volatile long result;
AdderTask(LongAdder adder, CyclicBarrier barrier, int incs) {
this.adder = adder;
this.barrier = barrier;
this.incs = incs;
}
public void run() {
try {
barrier.await();
LongAdder a = adder;
for (int i = 0; i < incs; ++i)
a.add(1L);
result = a.sum();
barrier.await();
} catch (Throwable t) { throw new Error(t); }
}
}
}
|
