| java.util.Hashtable
 org.apache.derby.impl.services.locks.LockSpace
| LockSpace | | class LockSpace extends Hashtable (Code) | | A LockSpace represents the complete set of locks held within
a single compatability space, broken into groups of locks.
A LockSpace is a hashtable keyed by the group reference,
the data for each key is a Hashtable of Lock's.
|
| Method Summary | |
| protected synchronized void | addLock(Object group, Lock lock)
Add a lock to a group. | | synchronized boolean | areLocksHeld(Object group)
| | synchronized void | clearLimit(Object group)
Clear a limit set by setLimit. | | synchronized int | deadlockCount(int bail)
Return a count of the number of locks
held by this space. | | synchronized boolean | isLockHeld(Object group, Lockable ref, Object qualifier)
| | synchronized void | setLimit(Object group, int limit, Limit callback)
| | synchronized void | transfer(Object oldGroup, Object newGroup)
| | synchronized void | unlockGroup(LockSet lset, Object group)
Unlock all the locks in a group and then remove the group. | | synchronized void | unlockGroup(LockSet lset, Object group, Matchable key)
| | synchronized int | unlockReference(LockSet lset, Lockable ref, Object qualifier, Object group)
|
| areLocksHeld | | synchronized boolean areLocksHeld(Object group)(Code) | | Return true if locks are held in a group
|
| clearLimit | | synchronized void clearLimit(Object group)(Code) | | Clear a limit set by setLimit.
|
| deadlockCount | | synchronized int deadlockCount(int bail)(Code) | | Return a count of the number of locks
held by this space. The argument bail
indicates at which point the counting
should bail out and return the current
count. This routine will bail if the
count is greater than bail. Thus this
routine is intended to for deadlock
code to find the space with the
fewest number of locks.
|
| unlockGroup | | synchronized void unlockGroup(LockSet lset, Object group)(Code) | | Unlock all the locks in a group and then remove the group.
|
|
|