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 |
5 |
+ |
*/ |
6 |
+ |
/* |
7 |
|
* @test |
8 |
|
* Checks for responsiveness of locks to timeouts. Runs under the |
9 |
|
* assumption that ITERS computations require more than TIMEOUT msecs |
20 |
|
static final LoopHelpers.SimpleRandom rng = new LoopHelpers.SimpleRandom(); |
21 |
|
static boolean print = false; |
22 |
|
static final int ITERS = Integer.MAX_VALUE; |
23 |
< |
static final long TIMEOUT = 100; |
23 |
> |
static final long TIMEOUT = 100; |
24 |
|
|
25 |
|
public static void main(String[] args) throws Exception { |
26 |
|
int maxThreads = 100; |
27 |
< |
if (args.length > 0) |
27 |
> |
if (args.length > 0) |
28 |
|
maxThreads = Integer.parseInt(args[0]); |
29 |
|
|
30 |
|
print = true; |
51 |
|
} |
52 |
|
|
53 |
|
final void test() throws Exception { |
54 |
< |
for (int i = 0; i < nthreads; ++i) |
54 |
> |
for (int i = 0; i < nthreads; ++i) |
55 |
|
pool.execute(this); |
56 |
|
barrier.await(); |
57 |
|
Thread.sleep(TIMEOUT); |
72 |
|
|
73 |
|
public final void run() { |
74 |
|
try { |
75 |
< |
barrier.await(); |
75 |
> |
barrier.await(); |
76 |
|
int sum = v; |
77 |
|
int x = 0; |
78 |
|
int n = ITERS; |
92 |
|
barrier.await(); |
93 |
|
result += sum; |
94 |
|
} |
95 |
< |
catch (Exception ie) { |
96 |
< |
return; |
95 |
> |
catch (Exception ie) { |
96 |
> |
return; |
97 |
|
} |
98 |
|
} |
99 |
|
} |