Uses of Class
com.google.common.util.concurrent.CycleDetectingLockFactory.LockGraphNode
Packages that use CycleDetectingLockFactory.LockGraphNode
-
Uses of CycleDetectingLockFactory.LockGraphNode in com.google.common.util.concurrent
Fields in com.google.common.util.concurrent declared as CycleDetectingLockFactory.LockGraphNodeModifier and TypeFieldDescriptionprivate final CycleDetectingLockFactory.LockGraphNode
CycleDetectingLockFactory.CycleDetectingReentrantLock.lockGraphNode
private final CycleDetectingLockFactory.LockGraphNode
CycleDetectingLockFactory.CycleDetectingReentrantReadWriteLock.lockGraphNode
Fields in com.google.common.util.concurrent with type parameters of type CycleDetectingLockFactory.LockGraphNodeModifier and TypeFieldDescriptionprivate static final ThreadLocal
<ArrayList<CycleDetectingLockFactory.LockGraphNode>> CycleDetectingLockFactory.acquiredLocks
Tracks the currently acquired locks for each Thread, kept up to date by calls toCycleDetectingLockFactory.aboutToAcquire(CycleDetectingLock)
andCycleDetectingLockFactory.lockStateChanged(CycleDetectingLock)
.(package private) final Map
<CycleDetectingLockFactory.LockGraphNode, CycleDetectingLockFactory.ExampleStackTrace> CycleDetectingLockFactory.LockGraphNode.allowedPriorLocks
The map tracking the locks that are known to be acquired before this lock, each associated with an example stack trace.(package private) final Map
<CycleDetectingLockFactory.LockGraphNode, CycleDetectingLockFactory.PotentialDeadlockException> CycleDetectingLockFactory.LockGraphNode.disallowedPriorLocks
The map tracking lock nodes that can cause a lock acquisition cycle if acquired before this node.private final Map
<E, CycleDetectingLockFactory.LockGraphNode> CycleDetectingLockFactory.WithExplicitOrdering.lockGraphNodes
private static final ConcurrentMap
<Class<? extends Enum<?>>, Map<? extends Enum<?>, CycleDetectingLockFactory.LockGraphNode>> CycleDetectingLockFactory.lockGraphNodesPerType
Methods in com.google.common.util.concurrent that return CycleDetectingLockFactory.LockGraphNodeModifier and TypeMethodDescriptionCycleDetectingLockFactory.CycleDetectingLock.getLockGraphNode()
CycleDetectingLockFactory.CycleDetectingReentrantLock.getLockGraphNode()
CycleDetectingLockFactory.CycleDetectingReentrantReadWriteLock.getLockGraphNode()
Methods in com.google.common.util.concurrent that return types with arguments of type CycleDetectingLockFactory.LockGraphNodeModifier and TypeMethodDescription(package private) static <E extends Enum<E>>
Map<E, CycleDetectingLockFactory.LockGraphNode> CycleDetectingLockFactory.createNodes
(Class<E> clazz) For a given Enum type, creates an immutable map from each of the Enum's values to a corresponding LockGraphNode, with theallowedPriorLocks
anddisallowedPriorLocks
prepopulated with nodes according to the natural ordering of the associated Enum values.private static <E extends Enum<E>>
Map<? extends E, CycleDetectingLockFactory.LockGraphNode> CycleDetectingLockFactory.getOrCreateNodes
(Class<E> clazz) Methods in com.google.common.util.concurrent with parameters of type CycleDetectingLockFactory.LockGraphNodeModifier and TypeMethodDescription(package private) void
CycleDetectingLockFactory.LockGraphNode.checkAcquiredLock
(CycleDetectingLockFactory.Policy policy, CycleDetectingLockFactory.LockGraphNode acquiredLock) Checks the acquisition-ordering betweenthis
, which is about to be acquired, and the specifiedacquiredLock
.CycleDetectingLockFactory.LockGraphNode.findPathTo
(CycleDetectingLockFactory.LockGraphNode node, Set<CycleDetectingLockFactory.LockGraphNode> seen) Performs a depth-first traversal of the graph edges defined by each node'sallowedPriorLocks
to find a path betweenthis
and the specifiedlock
.Method parameters in com.google.common.util.concurrent with type arguments of type CycleDetectingLockFactory.LockGraphNodeModifier and TypeMethodDescription(package private) void
CycleDetectingLockFactory.LockGraphNode.checkAcquiredLocks
(CycleDetectingLockFactory.Policy policy, List<CycleDetectingLockFactory.LockGraphNode> acquiredLocks) CycleDetectingLockFactory.LockGraphNode.findPathTo
(CycleDetectingLockFactory.LockGraphNode node, Set<CycleDetectingLockFactory.LockGraphNode> seen) Performs a depth-first traversal of the graph edges defined by each node'sallowedPriorLocks
to find a path betweenthis
and the specifiedlock
.Constructors in com.google.common.util.concurrent with parameters of type CycleDetectingLockFactory.LockGraphNodeModifierConstructorDescriptionprivate
CycleDetectingReentrantLock
(CycleDetectingLockFactory.LockGraphNode lockGraphNode, boolean fair) private
CycleDetectingReentrantReadWriteLock
(CycleDetectingLockFactory.LockGraphNode lockGraphNode, boolean fair) (package private)
ExampleStackTrace
(CycleDetectingLockFactory.LockGraphNode node1, CycleDetectingLockFactory.LockGraphNode node2) private
PotentialDeadlockException
(CycleDetectingLockFactory.LockGraphNode node1, CycleDetectingLockFactory.LockGraphNode node2, CycleDetectingLockFactory.ExampleStackTrace conflictingStackTrace) Constructor parameters in com.google.common.util.concurrent with type arguments of type CycleDetectingLockFactory.LockGraphNodeModifierConstructorDescription(package private)
WithExplicitOrdering
(CycleDetectingLockFactory.Policy policy, Map<E, CycleDetectingLockFactory.LockGraphNode> lockGraphNodes)