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 |
< |
* @test %I% %E% |
7 |
> |
* @test |
8 |
|
* @bug 4486658 |
9 |
– |
* @compile -source 1.5 TimeoutLockLoops.java |
9 |
|
* @run main TimeoutLockLoops |
10 |
|
* @summary Checks for responsiveness of locks to timeouts. |
11 |
|
* Runs under the assumption that ITERS computations require more than |
13 |
|
* another decade. |
14 |
|
*/ |
15 |
|
|
16 |
< |
import java.util.concurrent.*; |
17 |
< |
import java.util.concurrent.locks.*; |
18 |
< |
import java.util.*; |
16 |
> |
import java.util.concurrent.CyclicBarrier; |
17 |
> |
import java.util.concurrent.ExecutorService; |
18 |
> |
import java.util.concurrent.Executors; |
19 |
> |
import java.util.concurrent.TimeUnit; |
20 |
> |
import java.util.concurrent.locks.ReentrantLock; |
21 |
|
|
22 |
|
public final class TimeoutLockLoops { |
23 |
|
static final ExecutorService pool = Executors.newCachedThreadPool(); |
24 |
|
static final LoopHelpers.SimpleRandom rng = new LoopHelpers.SimpleRandom(); |
25 |
|
static boolean print = false; |
26 |
|
static final int ITERS = Integer.MAX_VALUE; |
27 |
< |
static final long TIMEOUT = 100; |
27 |
> |
static final long TIMEOUT = 100; |
28 |
|
|
29 |
|
public static void main(String[] args) throws Exception { |
30 |
|
int maxThreads = 100; |
31 |
< |
if (args.length > 0) |
31 |
> |
if (args.length > 0) |
32 |
|
maxThreads = Integer.parseInt(args[0]); |
33 |
|
|
34 |
|
print = true; |
67 |
|
barrier.await(); |
68 |
|
if (print) { |
69 |
|
long time = timer.getTime(); |
70 |
< |
double secs = (double)(time) / 1000000000.0; |
70 |
> |
double secs = (double) time / 1000000000.0; |
71 |
|
System.out.println("\t " + secs + "s run time"); |
72 |
|
} |
73 |
|
|
80 |
|
|
81 |
|
public final void run() { |
82 |
|
try { |
83 |
< |
barrier.await(); |
83 |
> |
barrier.await(); |
84 |
|
int sum = v; |
85 |
|
int x = 17; |
86 |
|
int n = ITERS; |
105 |
|
barrier.await(); |
106 |
|
result += sum; |
107 |
|
} |
108 |
< |
catch (Exception ex) { |
108 |
> |
catch (Exception ex) { |
109 |
|
ex.printStackTrace(); |
110 |
< |
return; |
110 |
> |
return; |
111 |
|
} |
112 |
|
} |
113 |
|
} |
113 |
– |
|
114 |
– |
|
114 |
|
} |