1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358
|
/*
* Copyright (c) 2005, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
/*
* @bug 5086470 6358247
* @summary SynchronizersLockingThread is used by LockedSynchronizers.
* It will create threads that acquire ReentrantLock and also object
* monitors.
* @author Mandy Chung
*
* @build ThreadDump Utils
*/
import java.lang.management.*;
import java.util.*;
import java.util.concurrent.locks.ReentrantLock;
import java.util.concurrent.locks.Condition;
public class SynchronizerLockingThread extends Thread {
static ReentrantLock lock1 = new ReentrantLock();
static ReentrantLock lock2 = new ReentrantLock();
static ReentrantLock lock3 = new ReentrantLock();
static ReentrantLock lock4 = new ReentrantLock();
static Lock lock5 = new Lock("lock5");
static Lock lock6 = new Lock("lock6");
static Lock lock7 = new Lock("lock7");
static ReentrantLock lock8 = new ReentrantLock();
static SynchronizerLockingThread t1 = new Thread1();
static SynchronizerLockingThread t2 = new Thread2();
static int count = 2;
static void startLockingThreads() {
t1.setDaemon(true);
t2.setDaemon(true);
t1.start();
t2.start();
// wait until t1 and t2 waits
while (count != 0) {
try {
Thread.sleep(100);
} catch (InterruptedException e) {
throw new RuntimeException(e);
}
}
Utils.waitForBlockWaitingState(t1);
Utils.waitForBlockWaitingState(t2);
}
static long[] getThreadIds() {
return new long[] {t1.getId(), t2.getId()};
}
static void checkLocks(ThreadInfo[] tinfos) throws Exception {
int matches = 0;
for (ThreadInfo info : tinfos) {
if (info.getThreadId() == t1.getId()) {
t1.checkLocks(info);
matches++;
}
if (info.getThreadId() == t2.getId()) {
t2.checkLocks(info);
matches++;
}
}
if (matches != 2) {
throw new RuntimeException("MonitorInfo missing");
}
}
static class Lock {
String name;
Lock(String name) {
this.name = name;
}
public String toString() {
return name;
}
}
final String threadName;
Lock waitingLock;
int numOwnedMonitors;
Map<String, Lock[]> ownedMonitors;
Condition waitingSync;
int numOwnedSyncs;
Map<String, ReentrantLock[]> ownedSyncs;
public SynchronizerLockingThread(String name) {
this.threadName = name;
}
protected void setExpectedResult(Lock waitingLock,
int numOwnedMonitors,
Map<String, Lock[]> ownedMonitors,
Condition waitingSync,
int numOwnedSyncs,
Map<String, ReentrantLock[]> ownedSyncs) {
this.waitingLock = waitingLock;
this.numOwnedMonitors = numOwnedMonitors;
this.ownedMonitors = ownedMonitors;
this.waitingSync = waitingSync;
this.numOwnedSyncs = numOwnedSyncs;
this.ownedSyncs = ownedSyncs;
}
void checkLocks(ThreadInfo info) throws Exception {
checkThreadInfo(info);
MonitorInfo[] monitors = info.getLockedMonitors();
if (monitors.length != numOwnedMonitors) {
ThreadDump.threadDump();
throw new RuntimeException("Number of locked monitors = " +
monitors.length +
" not matched. Expected: " + numOwnedMonitors);
}
// check if each monitor returned in the list is the expected
// one
for (MonitorInfo m : monitors) {
StackTraceElement ste = m.getLockedStackFrame();
int depth = m.getLockedStackDepth();
checkStackFrame(info, ste, depth);
checkMonitor(m, ste.getMethodName());
}
// check if each expected monitor is included in the returned
// list
for (Map.Entry<String, Lock[]> e : ownedMonitors.entrySet()) {
for (Lock l : e.getValue()) {
checkMonitor(e.getKey(), l, monitors);
}
}
// We can only check if the length matches since we have no
// way to get the AbstractOwnableSynchronizer in ReentrantLock
LockInfo[] syncs = info.getLockedSynchronizers();
if (syncs.length != numOwnedSyncs) {
ThreadDump.threadDump();
throw new RuntimeException("Number of locked syncs = " +
syncs.length +
" not matched. Expected: " + numOwnedSyncs);
}
}
void checkThreadInfo(ThreadInfo info) throws Exception {
if (!getName().equals(info.getThreadName())) {
throw new RuntimeException("Name: " + info.getThreadName() +
" not matched. Expected: " + getName());
}
LockInfo l = info.getLockInfo();
if ((waitingLock != null || waitingSync != null) && l == null) {
throw new RuntimeException("LockInfo: " + l +
" not matched. Expected: non-null");
}
if (waitingLock == null && waitingSync == null && l != null) {
throw new RuntimeException("LockInfo: " + l +
" not matched. Expected: null");
}
String waitingLockName;
int hcode;
if (waitingLock != null) {
waitingLockName = waitingLock.getClass().getName();
hcode = System.identityHashCode(waitingLock);
} else {
waitingLockName = waitingSync.getClass().getName();
hcode = System.identityHashCode(waitingSync);
}
if (!waitingLockName.equals(l.getClassName())) {
throw new RuntimeException("LockInfo : " + l +
" class name not matched. Expected: " + waitingLockName);
}
if (hcode != l.getIdentityHashCode()) {
throw new RuntimeException("LockInfo: " + l +
" IdentityHashCode not matched. Expected: " + hcode);
}
String lockName = info.getLockName();
String[] s = lockName.split("@");
if (!waitingLockName.equals(s[0])) {
throw new RuntimeException("LockName: " + lockName +
" class name not matched. Expected: " + waitingLockName);
}
int i = Integer.parseInt(s[1], 16);
if (hcode != i) {
throw new RuntimeException("LockName: " + lockName +
" IdentityHashCode not matched. Expected: " + hcode);
}
}
void checkStackFrame(ThreadInfo info, StackTraceElement ste, int depth) {
StackTraceElement[] stacktrace = info.getStackTrace();
if (!ste.equals(stacktrace[depth])) {
System.out.println("LockedStackFrame:- " + ste);
System.out.println("StackTrace at " + depth + " :-" +
stacktrace[depth]);
throw new RuntimeException("LockedStackFrame does not match " +
"stack frame in ThreadInfo.getStackTrace");
}
}
void checkMonitor(MonitorInfo m, String methodName) {
for (Map.Entry<String, Lock[]> e : ownedMonitors.entrySet()) {
if (methodName.equals(e.getKey())) {
for (Lock l : e.getValue()) {
String className = l.getClass().getName();
int hcode = System.identityHashCode(l);
if (className.equals(m.getClassName()) &&
hcode == m.getIdentityHashCode()) {
// monitor matched the expected
return;
}
}
}
}
throw new RuntimeException("Monitor not expected" + m);
}
void checkMonitor(String methodName, Lock l, MonitorInfo[] monitors) {
String className = l.getClass().getName();
int hcode = System.identityHashCode(l);
for (MonitorInfo m : monitors) {
if (className.equals(m.getClassName()) &&
hcode == m.getIdentityHashCode() &&
methodName.equals(m.getLockedStackFrame().getMethodName())) {
return;
}
}
throw new RuntimeException("Monitor not found in the returned list" +
" Method: " + methodName + " Lock: " + l);
}
static class Thread1 extends SynchronizerLockingThread {
public Thread1() {
super("t1");
initExpectedResult();
}
public void run() {
A();
}
void A() {
lock1.lock();
try {
lock2.lock();
try {
lock3.lock();
try {
B();
} finally {
lock3.unlock();
}
} finally {
lock2.unlock();
}
} finally {
lock1.unlock();
}
}
void B() {
lock4.lock();
try {
synchronized(lock5) {
C();
}
} finally {
lock4.unlock();
}
}
void C() {
synchronized(lock6) {
D();
}
}
void D() {
synchronized(lock7) {
try {
// signal to about to wait
count--;
lock7.wait();
} catch (InterruptedException e) {
throw new RuntimeException(e);
}
}
}
Map<String, Lock[]> LOCKED_MONITORS;
Map<String, ReentrantLock[]> LOCKED_SYNCS;
Lock WAITING_LOCK = lock7;
int OWNED_MONITORS = 2;
int OWNED_SYNCS = 4;
void initExpectedResult() {
LOCKED_MONITORS = new HashMap<String, Lock[]>();
LOCKED_MONITORS.put("D", new Lock[0]); // no monitored locked
LOCKED_MONITORS.put("C", new Lock[] {lock6});
LOCKED_MONITORS.put("B", new Lock[] {lock5});
LOCKED_MONITORS.put("A", new Lock[0]);
LOCKED_SYNCS = new HashMap<String, ReentrantLock[]>();
LOCKED_SYNCS.put("D", new ReentrantLock[0]); // no sync locked
LOCKED_SYNCS.put("C", new ReentrantLock[0]); // no sync locked
LOCKED_SYNCS.put("B", new ReentrantLock[] {lock4});
LOCKED_SYNCS.put("A", new ReentrantLock[] {lock3, lock2, lock1});
this.setExpectedResult(WAITING_LOCK,
OWNED_MONITORS, LOCKED_MONITORS,
null,
OWNED_SYNCS, LOCKED_SYNCS);
}
}
static class Thread2 extends SynchronizerLockingThread {
Map<String, Lock[]> LOCKED_MONITORS = new HashMap<String, Lock[]>();
Map<String, ReentrantLock[]> LOCKED_SYNCS = new HashMap<String, ReentrantLock[]>();
Condition c = lock8.newCondition();
Condition WAITING_LOCK = c;
int OWNED_MONITORS = 0;
int OWNED_SYNCS = 0;
public Thread2() {
super("t2");
this.setExpectedResult(null,
OWNED_MONITORS, LOCKED_MONITORS,
WAITING_LOCK,
OWNED_SYNCS, LOCKED_SYNCS);
}
public void run() {
lock8.lock();
try {
synchronized(lock7) {
count--;
}
c.await();
} catch (InterruptedException e) {
throw new RuntimeException(e);
} finally {
lock8.unlock();
}
throw new RuntimeException("should not reach here");
}
}
}
|