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.concurrent.*; |
8 |
< |
import java.util.concurrent.locks.*; |
9 |
< |
import java.util.*; |
7 |
> |
import java.util.concurrent.CyclicBarrier; |
8 |
> |
import java.util.concurrent.ExecutorService; |
9 |
> |
import java.util.concurrent.Executors; |
10 |
> |
import java.util.concurrent.TimeUnit; |
11 |
> |
import java.util.concurrent.locks.ReentrantLock; |
12 |
|
|
13 |
|
public final class SimpleTimedLockLoops { |
14 |
|
static final ExecutorService pool = Executors.newCachedThreadPool(); |
18 |
|
|
19 |
|
public static void main(String[] args) throws Exception { |
20 |
|
int maxThreads = 100; |
21 |
< |
if (args.length > 0) |
21 |
> |
if (args.length > 0) |
22 |
|
maxThreads = Integer.parseInt(args[0]); |
23 |
|
|
24 |
|
print = true; |
50 |
|
} |
51 |
|
|
52 |
|
final void test() throws Exception { |
53 |
< |
for (int i = 0; i < nthreads; ++i) |
53 |
> |
for (int i = 0; i < nthreads; ++i) |
54 |
|
pool.execute(this); |
55 |
|
barrier.await(); |
56 |
|
barrier.await(); |
57 |
|
if (print) { |
58 |
|
long time = timer.getTime(); |
59 |
< |
long tpi = time / ((long)iters * nthreads); |
59 |
> |
long tpi = time / ((long) iters * nthreads); |
60 |
|
System.out.print("\t" + LoopHelpers.rightJustify(tpi) + " ns per lock"); |
61 |
< |
double secs = (double)(time) / 1000000000.0; |
61 |
> |
double secs = (double) time / 1000000000.0; |
62 |
|
System.out.println("\t " + secs + "s run time"); |
63 |
|
} |
64 |
|
|
70 |
|
public final void run() { |
71 |
|
final ReentrantLock lock = this.lock; |
72 |
|
try { |
73 |
< |
barrier.await(); |
73 |
> |
barrier.await(); |
74 |
|
int sum = v + 1; |
75 |
|
int x = 0; |
76 |
|
int n = iters; |
91 |
|
++readBarrier; |
92 |
|
for (int l = x & 7; l > 0; --l) |
93 |
|
sum += LoopHelpers.compute6(sum); |
94 |
< |
} |
94 |
> |
} |
95 |
|
barrier.await(); |
96 |
|
result += sum; |
97 |
|
} |
98 |
< |
catch (Exception ie) { |
99 |
< |
return; |
98 |
> |
catch (Exception ie) { |
99 |
> |
return; |
100 |
|
} |
101 |
|
} |
102 |
|
} |