1 /*
2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
3 *
4 * This code is free software; you can redistribute it and/or modify it
5 * under the terms of the GNU General Public License version 2 only, as
6 * published by the Free Software Foundation.
7 *
8 * This code is distributed in the hope that it will be useful, but WITHOUT
9 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
10 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
11 * version 2 for more details (a copy is included in the LICENSE file that
12 * accompanied this code).
13 *
14 * You should have received a copy of the GNU General Public License version
15 * 2 along with this work; if not, write to the Free Software Foundation,
16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
17 *
18 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
19 * CA 95054 USA or visit www.sun.com if you need additional information or
20 * have any questions.
21 */
22
23 /*
24 * This file is available under and governed by the GNU General Public
25 * License version 2 only, as published by the Free Software Foundation.
26 * However, the following notice accompanied the original version of this
27 * file:
28 *
29 * Written by Doug Lea with assistance from members of JCP JSR-166
30 * Expert Group and released to the public domain, as explained at
31 * http://creativecommons.org/licenses/publicdomain
32 */
33
34 /*
35 * @test
36 * @bug 4486658
37 * @compile -source 1.5 CancelledLockLoops.java
38 * @run main/timeout=2800 CancelledLockLoops
39 * @summary tests lockInterruptibly.
40 * Checks for responsiveness of locks to interrupts. Runs under that
41 * assumption that ITERS_VALUE computations require more than TIMEOUT
42 * msecs to complete.
43 */
44
45 import java.util.concurrent.*;
46 import java.util.concurrent.locks.*;
47 import java.util.*;
48
49 public final class CancelledLockLoops {
50 static final Random rng = new Random();
51 static boolean print = false;
52 static final int ITERS = 1000000;
53 static final long TIMEOUT = 100;
54
55 public static void main(String[] args) throws Exception {
56 int maxThreads = 5;
57 if (args.length > 0)
58 maxThreads = Integer.parseInt(args[0]);
59
60 print = true;
61
62 for (int i = 2; i <= maxThreads; i += (i+1) >>> 1) {
63 System.out.print("Threads: " + i);
64 try {
65 new ReentrantLockLoop(i).test();
66 }
67 catch(BrokenBarrierException bb) {
68 // OK, ignore
69 }
70 Thread.sleep(TIMEOUT);
71 }
72 }
73
74 static final class ReentrantLockLoop implements Runnable {
75 private int v = rng.nextInt();
76 private int completed;
77 private volatile int result = 17;
78 private final ReentrantLock lock = new ReentrantLock();
79 private final LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer();
80 private final CyclicBarrier barrier;
81 private final int nthreads;
82 ReentrantLockLoop(int nthreads) {
83 this.nthreads = nthreads;
84 barrier = new CyclicBarrier(nthreads+1, timer);
85 }
86
87 final void test() throws Exception {
88 Thread[] threads = new Thread[nthreads];
89 for (int i = 0; i < threads.length; ++i)
90 threads[i] = new Thread(this);
91 for (int i = 0; i < threads.length; ++i)
92 threads[i].start();
93 Thread[] cancels = (Thread[]) (threads.clone());
94 Collections.shuffle(Arrays.asList(cancels), rng);
95 barrier.await();
96 Thread.sleep(TIMEOUT);
97 for (int i = 0; i < cancels.length-2; ++i) {
98 cancels[i].interrupt();
99 // make sure all OK even when cancellations spaced out
100 if ( (i & 3) == 0)
101 Thread.sleep(1 + rng.nextInt(10));
102 }
103 barrier.await();
104 if (print) {
105 long time = timer.getTime();
106 double secs = (double)(time) / 1000000000.0;
107 System.out.println("\t " + secs + "s run time");
108 }
109
110 int c;
111 lock.lock();
112 try {
113 c = completed;
114 }
115 finally {
116 lock.unlock();
117 }
118 if (c != 2)
119 throw new Error("Completed != 2");
120 int r = result;
121 if (r == 0) // avoid overoptimization
122 System.out.println("useless result: " + r);
123 }
124
125 public final void run() {
126 try {
127 barrier.await();
128 int sum = v;
129 int x = 0;
130 int n = ITERS;
131 boolean done = false;
132 do {
133 try {
134 lock.lockInterruptibly();
135 }
136 catch (InterruptedException ie) {
137 break;
138 }
139 try {
140 v = x = LoopHelpers.compute1(v);
141 }
142 finally {
143 lock.unlock();
144 }
145 sum += LoopHelpers.compute2(x);
146 } while (n-- > 0);
147 if (n <= 0) {
148 lock.lock();
149 try {
150 ++completed;
151 }
152 finally {
153 lock.unlock();
154 }
155 }
156 barrier.await();
157 result += sum;
158 }
159 catch (Exception ex) {
160 ex.printStackTrace();
161 return;
162 }
163 }
164 }
165
166 }