How to use

CycleDetectingLockFactory$PotentialDeadlockException

in

com.google.common.util.concurrent

  new PotentialDeadlockException(
    acquiredLock, this, previousDeadlockException.getConflictingStackTrace());
policy.handlePotentialDeadlock(exception);
return;
  new PotentialDeadlockException(acquiredLock, this, path);
disallowedPriorLocks.put(acquiredLock, exception);
policy.handlePotentialDeadlock(exception);

public void testDeadlock_twoLocks() {
 // Establish an acquisition order of lockA -> lockB.
 lockA.lock();
 lockB.lock();
 lockA.unlock();
 lockB.unlock();
 // The opposite order should fail (Policies.THROW).
 PotentialDeadlockException firstException = null;
 lockB.lock();
 try {
  lockA.lock();
  fail("Expected PotentialDeadlockException");
 } catch (PotentialDeadlockException expected) {
  checkMessage(expected, "LockB -> LockA", "LockA -> LockB");
  firstException = expected;
 }
 // Second time should also fail, with a cached causal chain.
 try {
  lockA.lock();
  fail("Expected PotentialDeadlockException");
 } catch (PotentialDeadlockException expected) {
  checkMessage(expected, "LockB -> LockA", "LockA -> LockB");
  // The causal chain should be cached.
  assertSame(firstException.getCause(), expected.getCause());
 }
 // lockA should work after lockB is released.
 lockB.unlock();
 lockA.lock();
}

PotentialDeadlockException exception = new PotentialDeadlockException(
  acquiredLock, this,
  previousDeadlockException.getConflictingStackTrace());
policy.handlePotentialDeadlock(exception);
return;
  new PotentialDeadlockException(acquiredLock, this, path);
disallowedPriorLocks.put(acquiredLock, exception);
policy.handlePotentialDeadlock(exception);

PotentialDeadlockException exception = new PotentialDeadlockException(
  acquiredLock, this,
  previousDeadlockException.getConflictingStackTrace());
policy.handlePotentialDeadlock(exception);
return;
  new PotentialDeadlockException(acquiredLock, this, path);
disallowedPriorLocks.put(acquiredLock, exception);
policy.handlePotentialDeadlock(exception);

PotentialDeadlockException exception = new PotentialDeadlockException(
  acquiredLock, this,
  previousDeadlockException.getConflictingStackTrace());
policy.handlePotentialDeadlock(exception);
return;
  new PotentialDeadlockException(acquiredLock, this, path);
disallowedPriorLocks.put(acquiredLock, exception);
policy.handlePotentialDeadlock(exception);

PotentialDeadlockException exception = new PotentialDeadlockException(
  acquiredLock, this,
  previousDeadlockException.getConflictingStackTrace());
policy.handlePotentialDeadlock(exception);
return;
  new PotentialDeadlockException(acquiredLock, this, path);
disallowedPriorLocks.put(acquiredLock, exception);
policy.handlePotentialDeadlock(exception);

  new PotentialDeadlockException(
    acquiredLock, this, previousDeadlockException.getConflictingStackTrace());
policy.handlePotentialDeadlock(exception);
return;
  new PotentialDeadlockException(acquiredLock, this, path);
disallowedPriorLocks.put(acquiredLock, exception);
policy.handlePotentialDeadlock(exception);

  new PotentialDeadlockException(
    acquiredLock, this, previousDeadlockException.getConflictingStackTrace());
policy.handlePotentialDeadlock(exception);
return;
  new PotentialDeadlockException(acquiredLock, this, path);
disallowedPriorLocks.put(acquiredLock, exception);
policy.handlePotentialDeadlock(exception);

PotentialDeadlockException exception = new PotentialDeadlockException(
    acquiredLock, this,
    previousDeadlockException.getConflictingStackTrace());
policy.handlePotentialDeadlock(exception);
return;
PotentialDeadlockException exception = new PotentialDeadlockException(acquiredLock, this, path);
disallowedPriorLocks.put(acquiredLock, exception);
policy.handlePotentialDeadlock(exception);

PotentialDeadlockException exception = new PotentialDeadlockException(
  acquiredLock, this,
  previousDeadlockException.getConflictingStackTrace());
policy.handlePotentialDeadlock(exception);
return;
  new PotentialDeadlockException(acquiredLock, this, path);
disallowedPriorLocks.put(acquiredLock, exception);
policy.handlePotentialDeadlock(exception);

PotentialDeadlockException exception = new PotentialDeadlockException(
  acquiredLock, this,
  previousDeadlockException.getConflictingStackTrace());
policy.handlePotentialDeadlock(exception);
return;
  new PotentialDeadlockException(acquiredLock, this, path);
disallowedPriorLocks.put(acquiredLock, exception);
policy.handlePotentialDeadlock(exception);

public void testDeadlock_twoLocks() {
 // Establish an acquisition order of lockA -> lockB.
 lockA.lock();
 lockB.lock();
 lockA.unlock();
 lockB.unlock();
 // The opposite order should fail (Policies.THROW).
 PotentialDeadlockException firstException = null;
 lockB.lock();
 try {
  lockA.lock();
  fail("Expected PotentialDeadlockException");
 } catch (PotentialDeadlockException expected) {
  checkMessage(expected, "LockB -> LockA", "LockA -> LockB");
  firstException = expected;
 }
 // Second time should also fail, with a cached causal chain.
 try {
  lockA.lock();
  fail("Expected PotentialDeadlockException");
 } catch (PotentialDeadlockException expected) {
  checkMessage(expected, "LockB -> LockA", "LockA -> LockB");
  // The causal chain should be cached.
  assertSame(firstException.getCause(), expected.getCause());
 }
 // lockA should work after lockB is released.
 lockB.unlock();
 lockA.lock();
}

private PotentialDeadlockException(
  LockGraphNode node1,
  LockGraphNode node2,
  ExampleStackTrace conflictingStackTrace) {
 super(node1, node2);
 this.conflictingStackTrace = conflictingStackTrace;
 initCause(conflictingStackTrace);
}

private PotentialDeadlockException(
  LockGraphNode node1,
  LockGraphNode node2,
  ExampleStackTrace conflictingStackTrace) {
 super(node1, node2);
 this.conflictingStackTrace = conflictingStackTrace;
 initCause(conflictingStackTrace);
}

private PotentialDeadlockException(
  LockGraphNode node1, LockGraphNode node2, ExampleStackTrace conflictingStackTrace) {
 super(node1, node2);
 this.conflictingStackTrace = conflictingStackTrace;
 initCause(conflictingStackTrace);
}

private PotentialDeadlockException(
  LockGraphNode node1, LockGraphNode node2, ExampleStackTrace conflictingStackTrace) {
 super(node1, node2);
 this.conflictingStackTrace = conflictingStackTrace;
 initCause(conflictingStackTrace);
}

private PotentialDeadlockException(
  LockGraphNode node1,
  LockGraphNode node2,
  ExampleStackTrace conflictingStackTrace) {
 super(node1, node2);
 this.conflictingStackTrace = conflictingStackTrace;
 initCause(conflictingStackTrace);
}

private PotentialDeadlockException(
  LockGraphNode node1,
  LockGraphNode node2,
  ExampleStackTrace conflictingStackTrace) {
 super(node1, node2);
 this.conflictingStackTrace = conflictingStackTrace;
 initCause(conflictingStackTrace);
}

private PotentialDeadlockException(
  LockGraphNode node1,
  LockGraphNode node2,
  ExampleStackTrace conflictingStackTrace) {
 super(node1, node2);
 this.conflictingStackTrace = conflictingStackTrace;
 initCause(conflictingStackTrace);
}

private PotentialDeadlockException(
  LockGraphNode node1,
  LockGraphNode node2,
  ExampleStackTrace conflictingStackTrace) {
 super(node1, node2);
 this.conflictingStackTrace = conflictingStackTrace;
 initCause(conflictingStackTrace);
}