1 |
|
/* |
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 |
4 |
> |
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
|
*/ |
6 |
|
|
7 |
|
import java.util.*; |
58 |
|
System.out.print(" ops: " + nops); |
59 |
|
System.out.println(); |
60 |
|
|
61 |
– |
int k = 1; |
61 |
|
int warmups = 2; |
62 |
< |
for (int i = 1; i <= maxThreads;) { |
62 |
> |
for (int k = 1, i = 1; i <= maxThreads;) { |
63 |
|
Thread.sleep(100); |
64 |
|
test(i, nkeys, mapClass); |
65 |
|
if (warmups > 0) |
111 |
|
barrier.await(); |
112 |
|
barrier.await(); |
113 |
|
long time = timer.getTime(); |
114 |
< |
long tpo = time / (i * (long)nops); |
114 |
> |
long tpo = time / (i * (long) nops); |
115 |
|
System.out.print(LoopHelpers.rightJustify(tpo) + " ns per op"); |
116 |
< |
double secs = (double)(time) / 1000000000.0; |
116 |
> |
double secs = (double) time / 1000000000.0; |
117 |
|
System.out.println("\t " + secs + "s run time"); |
118 |
|
map.clear(); |
119 |
|
} |
126 |
|
int position; |
127 |
|
int total; |
128 |
|
|
129 |
< |
Runner(int id, Map<Integer,Integer> map, Integer[] key, CyclicBarrier barrier) { |
129 |
> |
Runner(int id, Map<Integer,Integer> map, Integer[] key, CyclicBarrier barrier) { |
130 |
|
this.map = map; |
131 |
|
this.key = key; |
132 |
|
this.barrier = barrier; |
136 |
|
} |
137 |
|
|
138 |
|
int step() { |
139 |
< |
// random-walk around key positions, bunching accesses |
139 |
> |
// random-walk around key positions, bunching accesses |
140 |
|
int r = rng.next(); |
141 |
|
position += (r & 7) - 3; |
142 |
|
while (position >= key.length) position -= key.length; |