com.google.common.util.concurrent.CycleDetectingLockFactory$PotentialDeadlockException java code examples

Add the Codota plugin to your IDE and get smart completions

private void myMethod () {
 BufferedReader b =InputStream in;new BufferedReader(new InputStreamReader(in))
Reader in;new BufferedReader(in)
File file;new BufferedReader(new FileReader(file))
Smart code suggestions by Tabnine
}

  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);
}

Javadoc

Represents a detected cycle in lock acquisition ordering. The exception includes a causal chain of ExampleStackTrace instances to illustrate the cycle, e.g.

 
com....PotentialDeadlockException: Potential Deadlock from LockC -> ReadWriteA 
at ... 
at ... 
Caused by: com...ExampleStackTrace: LockB -> LockC 
at ... 
at ... 
Caused by: com...ExampleStackTrace: ReadWriteA -> LockB 
at ... 
at ...

Instances are logged for the Policies.WARN, and thrown for Policies.THROW.

Most used methods

Popular in Java

Updating database using SQL prepared statement
requestLocationUpdates (LocationManager)
addToBackStack (FragmentTransaction)
getExternalFilesDir (Context)
Window (java.awt)
A Window object is a top-level window with no borders and no menubar. The default layout for a windo
ByteBuffer (java.nio)
A buffer for bytes. A byte buffer can be created in either one of the following ways: * #allocate
KeyStore (java.security)
KeyStore is responsible for maintaining cryptographic keys and their owners. The type of the syste
Callable (java.util.concurrent)
A task that returns a result and may throw an exception. Implementors define a single method with no
Semaphore (java.util.concurrent)
A counting semaphore. Conceptually, a semaphore maintains a set of permits. Each #acquire blocks if
Notification (javax.management)
Top 15 Vim Plugins

How to useCycleDetectingLockFactory$PotentialDeadlockException in com.google.common.util.concurrent

Best Java code snippets using com.google.common.util.concurrent.CycleDetectingLockFactory$PotentialDeadlockException (Showing top 20 results out of 315)

How to use
CycleDetectingLockFactory$PotentialDeadlockException
in
com.google.common.util.concurrent