1 |
|
/* |
2 |
– |
* @test %I% %E% |
3 |
– |
* @bug 4486658 |
4 |
– |
* @compile -source 1.5 ConcurrentQueueLoops.java |
5 |
– |
* @run main/timeout=230 ConcurrentQueueLoops |
6 |
– |
* @summary Checks that a set of threads can repeatedly get and modify items |
7 |
– |
*/ |
8 |
– |
/* |
2 |
|
* Written by Doug Lea with assistance from members of JCP JSR-166 |
3 |
< |
* Expert Group and released to the public domain. Use, modify, and |
4 |
< |
* redistribute this code in any way without acknowledgement. |
3 |
> |
* Expert Group and released to the public domain, as explained at |
4 |
> |
* http://creativecommons.org/licenses/publicdomain |
5 |
|
*/ |
6 |
|
|
7 |
|
import java.util.*; |
43 |
|
|
44 |
|
print = false; |
45 |
|
System.out.println("Warmup..."); |
46 |
< |
oneRun(klass, 4); |
46 |
> |
// oneRun(klass, 4); |
47 |
> |
// |
48 |
|
Thread.sleep(100); |
49 |
|
oneRun(klass, 1); |
50 |
|
Thread.sleep(100); |
100 |
|
l = LoopHelpers.compute6(l); |
101 |
|
} else if ((misses++ & 255) == 0 && |
102 |
|
System.nanoTime() >= stopTime) { |
103 |
< |
return new Integer(takes); |
103 |
> |
return Integer.valueOf(takes); |
104 |
|
} else { |
105 |
|
for (int i = 0; i < BATCH_SIZE; ++i) { |
106 |
|
queue.offer(((l & lmask)== 0)? zero : one); |