| |
|
| java.lang.Object java.util.concurrent.locks.AbstractOwnableSynchronizer java.util.concurrent.locks.AbstractQueuedSynchronizer
AbstractQueuedSynchronizer | abstract public class AbstractQueuedSynchronizer extends AbstractOwnableSynchronizer implements java.io.Serializable(Code) | | Provides a framework for implementing blocking locks and related
synchronizers (semaphores, events, etc) that rely on
first-in-first-out (FIFO) wait queues. This class is designed to
be a useful basis for most kinds of synchronizers that rely on a
single atomic int value to represent state. Subclasses
must define the protected methods that change this state, and which
define what that state means in terms of this object being acquired
or released. Given these, the other methods in this class carry
out all queuing and blocking mechanics. Subclasses can maintain
other state fields, but only the atomically updated int
value manipulated using methods
AbstractQueuedSynchronizer.getState ,
AbstractQueuedSynchronizer.setState and
AbstractQueuedSynchronizer.compareAndSetState is tracked with respect
to synchronization.
Subclasses should be defined as non-public internal helper
classes that are used to implement the synchronization properties
of their enclosing class. Class
AbstractQueuedSynchronizer does not implement any
synchronization interface. Instead it defines methods such as
AbstractQueuedSynchronizer.acquireInterruptibly that can be invoked as
appropriate by concrete locks and related synchronizers to
implement their public methods.
This class supports either or both a default exclusive
mode and a shared mode. When acquired in exclusive mode,
attempted acquires by other threads cannot succeed. Shared mode
acquires by multiple threads may (but need not) succeed. This class
does not "understand" these differences except in the
mechanical sense that when a shared mode acquire succeeds, the next
waiting thread (if one exists) must also determine whether it can
acquire as well. Threads waiting in the different modes share the
same FIFO queue. Usually, implementation subclasses support only
one of these modes, but both can come into play for example in a
ReadWriteLock . Subclasses that support only exclusive or
only shared modes need not define the methods supporting the unused mode.
This class defines a nested
ConditionObject class that
can be used as a
Condition implementation by subclasses
supporting exclusive mode for which method
AbstractQueuedSynchronizer.isHeldExclusively reports whether synchronization is exclusively
held with respect to the current thread, method
AbstractQueuedSynchronizer.release invoked with the current
AbstractQueuedSynchronizer.getState value fully releases
this object, and
AbstractQueuedSynchronizer.acquire , given this saved state value,
eventually restores this object to its previous acquired state. No
AbstractQueuedSynchronizer method otherwise creates such a
condition, so if this constraint cannot be met, do not use it. The
behavior of
ConditionObject depends of course on the
semantics of its synchronizer implementation.
This class provides inspection, instrumentation, and monitoring
methods for the internal queue, as well as similar methods for
condition objects. These can be exported as desired into classes
using an AbstractQueuedSynchronizer for their
synchronization mechanics.
Serialization of this class stores only the underlying atomic
integer maintaining state, so deserialized objects have empty
thread queues. Typical subclasses requiring serializability will
define a readObject method that restores this to a known
initial state upon deserialization.
Usage
To use this class as the basis of a synchronizer, redefine the
following methods, as applicable, by inspecting and/or modifying
the synchronization state using
AbstractQueuedSynchronizer.getState ,
AbstractQueuedSynchronizer.setState and/or
AbstractQueuedSynchronizer.compareAndSetState :
Each of these methods by default throws
UnsupportedOperationException . Implementations of these methods
must be internally thread-safe, and should in general be short and
not block. Defining these methods is the only supported
means of using this class. All other methods are declared
final because they cannot be independently varied.
You may also find the inherited methods from
AbstractOwnableSynchronizer useful to keep track of the thread
owning an exclusive synchronizer. You are encouraged to use them
-- this enables monitoring and diagnostic tools to assist users in
determining which threads hold locks.
Even though this class is based on an internal FIFO queue, it
does not automatically enforce FIFO acquisition policies. The core
of exclusive synchronization takes the form:
Acquire:
while (!tryAcquire(arg)) {
enqueue thread if it is not already queued;
possibly block current thread;
}
Release:
if (tryRelease(arg))
unblock the first queued thread;
(Shared mode is similar but may involve cascading signals.)
Because checks in acquire are invoked before
enqueuing, a newly acquiring thread may barge ahead of
others that are blocked and queued. However, you can, if desired,
define tryAcquire and/or tryAcquireShared to
disable barging by internally invoking one or more of the inspection
methods, thereby providing a fair FIFO acquisition order.
In particular, most fair synchronizers can define tryAcquire
to return false if
AbstractQueuedSynchronizer.hasQueuedPredecessors (a method
specifically designed to be used by fair synchronizers) returns
true. Other variations are possible.
Throughput and scalability are generally highest for the
default barging (also known as greedy,
renouncement, and convoy-avoidance) strategy.
While this is not guaranteed to be fair or starvation-free, earlier
queued threads are allowed to recontend before later queued
threads, and each recontention has an unbiased chance to succeed
against incoming threads. Also, while acquires do not
"spin" in the usual sense, they may perform multiple
invocations of tryAcquire interspersed with other
computations before blocking. This gives most of the benefits of
spins when exclusive synchronization is only briefly held, without
most of the liabilities when it isn't. If so desired, you can
augment this by preceding calls to acquire methods with
"fast-path" checks, possibly prechecking
AbstractQueuedSynchronizer.hasContended and/or
AbstractQueuedSynchronizer.hasQueuedThreads to only do so if the synchronizer
is likely not to be contended.
This class provides an efficient and scalable basis for
synchronization in part by specializing its range of use to
synchronizers that can rely on int state, acquire, and
release parameters, and an internal FIFO wait queue. When this does
not suffice, you can build synchronizers from a lower level using
java.util.concurrent.atomic atomic classes, your own custom
java.util.Queue classes, and
LockSupport blocking
support.
Usage Examples
Here is a non-reentrant mutual exclusion lock class that uses
the value zero to represent the unlocked state, and one to
represent the locked state. While a non-reentrant lock
does not strictly require recording of the current owner
thread, this class does so anyway to make usage easier to monitor.
It also supports conditions and exposes
one of the instrumentation methods:
class Mutex implements Lock, java.io.Serializable {
// Our internal helper class
private static class Sync extends AbstractQueuedSynchronizer {
// Report whether in locked state
protected boolean isHeldExclusively() {
return getState() == 1;
}
// Acquire the lock if state is zero
public boolean tryAcquire(int acquires) {
assert acquires == 1; // Otherwise unused
if (compareAndSetState(0, 1)) {
setExclusiveOwnerThread(Thread.currentThread());
return true;
}
return false;
}
// Release the lock by setting state to zero
protected boolean tryRelease(int releases) {
assert releases == 1; // Otherwise unused
if (getState() == 0) throw new IllegalMonitorStateException();
setExclusiveOwnerThread(null);
setState(0);
return true;
}
// Provide a Condition
Condition newCondition() { return new ConditionObject(); }
// Deserialize properly
private void readObject(ObjectInputStream s)
throws IOException, ClassNotFoundException {
s.defaultReadObject();
setState(0); // reset to unlocked state
}
}
// The sync object does all the hard work. We just forward to it.
private final Sync sync = new Sync();
public void lock() { sync.acquire(1); }
public boolean tryLock() { return sync.tryAcquire(1); }
public void unlock() { sync.release(1); }
public Condition newCondition() { return sync.newCondition(); }
public boolean isLocked() { return sync.isHeldExclusively(); }
public boolean hasQueuedThreads() { return sync.hasQueuedThreads(); }
public void lockInterruptibly() throws InterruptedException {
sync.acquireInterruptibly(1);
}
public boolean tryLock(long timeout, TimeUnit unit)
throws InterruptedException {
return sync.tryAcquireNanos(1, unit.toNanos(timeout));
}
}
Here is a latch class that is like a
CountDownLatch except that it only requires a single signal to
fire. Because a latch is non-exclusive, it uses the shared
acquire and release methods.
class BooleanLatch {
private static class Sync extends AbstractQueuedSynchronizer {
boolean isSignalled() { return getState() != 0; }
protected int tryAcquireShared(int ignore) {
return isSignalled()? 1 : -1;
}
protected boolean tryReleaseShared(int ignore) {
setState(1);
return true;
}
}
private final Sync sync = new Sync();
public boolean isSignalled() { return sync.isSignalled(); }
public void signal() { sync.releaseShared(1); }
public void await() throws InterruptedException {
sync.acquireSharedInterruptibly(1);
}
}
since: 1.5 author: Doug Lea |
Inner Class :final static class Node | |
Field Summary | |
final static long | spinForTimeoutThreshold The number of nanoseconds for which it is faster to spin
rather than to use timed park. |
Constructor Summary | |
protected | AbstractQueuedSynchronizer() Creates a new AbstractQueuedSynchronizer instance
with initial synchronization state of zero. |
Method Summary | |
final public void | acquire(int arg) Acquires in exclusive mode, ignoring interrupts. | final public void | acquireInterruptibly(int arg) Acquires in exclusive mode, aborting if interrupted.
Implemented by first checking interrupt status, then invoking
at least once
AbstractQueuedSynchronizer.tryAcquire , returning on
success. | final boolean | acquireQueued(Node node, int arg) Acquires in exclusive uninterruptible mode for thread already in
queue. | final public void | acquireShared(int arg) Acquires in shared mode, ignoring interrupts. | final public void | acquireSharedInterruptibly(int arg) Acquires in shared mode, aborting if interrupted. | final boolean | apparentlyFirstQueuedIsExclusive() Returns
true if the apparent first queued thread, if one
exists, is waiting in exclusive mode. | final protected boolean | compareAndSetState(int expect, int update) Atomically sets synchronization state to the given updated
value if the current state value equals the expected value.
This operation has memory semantics of a volatile read
and write.
Parameters: expect - the expected value Parameters: update - the new value true if successful. | final int | fullyRelease(Node node) Invokes release with current state value; returns saved state. | final public Collection<Thread> | getExclusiveQueuedThreads() Returns a collection containing threads that may be waiting to
acquire in exclusive mode. | final public Thread | getFirstQueuedThread() Returns the first (longest-waiting) thread in the queue, or
null if no threads are currently queued. | final public int | getQueueLength() Returns an estimate of the number of threads waiting to
acquire. | final public Collection<Thread> | getQueuedThreads() Returns a collection containing threads that may be waiting to
acquire. | final public Collection<Thread> | getSharedQueuedThreads() Returns a collection containing threads that may be waiting to
acquire in shared mode. | final protected int | getState() Returns the current value of synchronization state. | final public int | getWaitQueueLength(ConditionObject condition) Returns an estimate of the number of threads waiting on the
given condition associated with this synchronizer. | final public Collection<Thread> | getWaitingThreads(ConditionObject condition) Returns a collection containing those threads that may be
waiting on the given condition associated with this
synchronizer. | final public boolean | hasContended() Queries whether any threads have ever contended to acquire this
synchronizer; that is if an acquire method has ever blocked. | final public boolean | hasQueuedPredecessors() | final public boolean | hasQueuedThreads() Queries whether any threads are waiting to acquire. | final public boolean | hasWaiters(ConditionObject condition) Queries whether any threads are waiting on the given condition
associated with this synchronizer. | protected boolean | isHeldExclusively() Returns
true if synchronization is held exclusively with
respect to the current (calling) thread. | final boolean | isOnSyncQueue(Node node) Returns true if a node, always one that was initially placed on
a condition queue, is now waiting to reacquire on sync queue. | final public boolean | isQueued(Thread thread) Returns true if the given thread is currently queued. | final public boolean | owns(ConditionObject condition) Queries whether the given ConditionObject
uses this synchronizer as its lock. | final public boolean | release(int arg) Releases in exclusive mode. | final public boolean | releaseShared(int arg) Releases in shared mode. | final protected void | setState(int newState) Sets the value of synchronization state. | public String | toString() Returns a string identifying this synchronizer, as well as its state. | final boolean | transferAfterCancelledWait(Node node) Transfers node, if necessary, to sync queue after a cancelled
wait. | final boolean | transferForSignal(Node node) Transfers a node from a condition queue onto sync queue. | protected boolean | tryAcquire(int arg) Attempts to acquire in exclusive mode. | final public boolean | tryAcquireNanos(int arg, long nanosTimeout) Attempts to acquire in exclusive mode, aborting if interrupted,
and failing if the given timeout elapses. | protected int | tryAcquireShared(int arg) Attempts to acquire in shared mode. | final public boolean | tryAcquireSharedNanos(int arg, long nanosTimeout) Attempts to acquire in shared mode, aborting if interrupted, and
failing if the given timeout elapses. | protected boolean | tryRelease(int arg) Attempts to set the state to reflect a release in exclusive
mode.
This method is always invoked by the thread performing release.
The default implementation throws
UnsupportedOperationException .
Parameters: arg - the release argument. | protected boolean | tryReleaseShared(int arg) Attempts to set the state to reflect a release in shared mode.
This method is always invoked by the thread performing release.
The default implementation throws
UnsupportedOperationException .
Parameters: arg - the release argument. |
spinForTimeoutThreshold | final static long spinForTimeoutThreshold(Code) | | The number of nanoseconds for which it is faster to spin
rather than to use timed park. A rough estimate suffices
to improve responsiveness with very short timeouts.
|
AbstractQueuedSynchronizer | protected AbstractQueuedSynchronizer()(Code) | | Creates a new AbstractQueuedSynchronizer instance
with initial synchronization state of zero.
|
acquireQueued | final boolean acquireQueued(Node node, int arg)(Code) | | Acquires in exclusive uninterruptible mode for thread already in
queue. Used by condition wait methods as well as acquire.
Parameters: node - the node Parameters: arg - the acquire argument true if interrupted while waiting |
apparentlyFirstQueuedIsExclusive | final boolean apparentlyFirstQueuedIsExclusive()(Code) | | Returns
true if the apparent first queued thread, if one
exists, is waiting in exclusive mode. If this method returns
true , and the current thread is attempting to acquire in
shared mode (that is, this method is invoked from
AbstractQueuedSynchronizer.tryAcquireShared ) then it is guaranteed that the current thread
is not the first queued thread. Used only as a heuristic in
ReentrantReadWriteLock.
|
compareAndSetState | final protected boolean compareAndSetState(int expect, int update)(Code) | | Atomically sets synchronization state to the given updated
value if the current state value equals the expected value.
This operation has memory semantics of a volatile read
and write.
Parameters: expect - the expected value Parameters: update - the new value true if successful. False return indicates that the actualvalue was not equal to the expected value. |
fullyRelease | final int fullyRelease(Node node)(Code) | | Invokes release with current state value; returns saved state.
Cancels node and throws exception on failure.
Parameters: node - the condition node for this wait previous sync state |
getExclusiveQueuedThreads | final public Collection<Thread> getExclusiveQueuedThreads()(Code) | | Returns a collection containing threads that may be waiting to
acquire in exclusive mode. This has the same properties
as
AbstractQueuedSynchronizer.getQueuedThreads except that it only returns
those threads waiting due to an exclusive acquire.
the collection of threads |
getFirstQueuedThread | final public Thread getFirstQueuedThread()(Code) | | Returns the first (longest-waiting) thread in the queue, or
null if no threads are currently queued.
In this implementation, this operation normally returns in
constant time, but may iterate upon contention if other threads are
concurrently modifying the queue.
the first (longest-waiting) thread in the queue, or null if no threads are currently queued |
getQueueLength | final public int getQueueLength()(Code) | | Returns an estimate of the number of threads waiting to
acquire. The value is only an estimate because the number of
threads may change dynamically while this method traverses
internal data structures. This method is designed for use in
monitoring system state, not for synchronization
control.
the estimated number of threads waiting to acquire |
getQueuedThreads | final public Collection<Thread> getQueuedThreads()(Code) | | Returns a collection containing threads that may be waiting to
acquire. Because the actual set of threads may change
dynamically while constructing this result, the returned
collection is only a best-effort estimate. The elements of the
returned collection are in no particular order. This method is
designed to facilitate construction of subclasses that provide
more extensive monitoring facilities.
the collection of threads |
getSharedQueuedThreads | final public Collection<Thread> getSharedQueuedThreads()(Code) | | Returns a collection containing threads that may be waiting to
acquire in shared mode. This has the same properties
as
AbstractQueuedSynchronizer.getQueuedThreads except that it only returns
those threads waiting due to a shared acquire.
the collection of threads |
getState | final protected int getState()(Code) | | Returns the current value of synchronization state.
This operation has memory semantics of a volatile read.
current state value |
getWaitQueueLength | final public int getWaitQueueLength(ConditionObject condition)(Code) | | Returns an estimate of the number of threads waiting on the
given condition associated with this synchronizer. Note that
because timeouts and interrupts may occur at any time, the
estimate serves only as an upper bound on the actual number of
waiters. This method is designed for use in monitoring of the
system state, not for synchronization control.
Parameters: condition - the condition the estimated number of waiting threads throws: IllegalMonitorStateException - if exclusive synchronizationis not held throws: IllegalArgumentException - if the given condition isnot associated with this synchronizer throws: NullPointerException - if the condition is null |
getWaitingThreads | final public Collection<Thread> getWaitingThreads(ConditionObject condition)(Code) | | Returns a collection containing those threads that may be
waiting on the given condition associated with this
synchronizer. Because the actual set of threads may change
dynamically while constructing this result, the returned
collection is only a best-effort estimate. The elements of the
returned collection are in no particular order.
Parameters: condition - the condition the collection of threads throws: IllegalMonitorStateException - if exclusive synchronizationis not held throws: IllegalArgumentException - if the given condition isnot associated with this synchronizer throws: NullPointerException - if the condition is null |
hasContended | final public boolean hasContended()(Code) | | Queries whether any threads have ever contended to acquire this
synchronizer; that is if an acquire method has ever blocked.
In this implementation, this operation returns in
constant time.
true if there has ever been contention |
hasQueuedPredecessors | final public boolean hasQueuedPredecessors()(Code) | | |
hasQueuedThreads | final public boolean hasQueuedThreads()(Code) | | Queries whether any threads are waiting to acquire. Note that
because cancellations due to interrupts and timeouts may occur
at any time, a
true return does not guarantee that any
other thread will ever acquire.
In this implementation, this operation returns in
constant time.
true if there may be other threads waiting to acquire |
hasWaiters | final public boolean hasWaiters(ConditionObject condition)(Code) | | Queries whether any threads are waiting on the given condition
associated with this synchronizer. Note that because timeouts
and interrupts may occur at any time, a true return
does not guarantee that a future signal will awaken
any threads. This method is designed primarily for use in
monitoring of the system state.
Parameters: condition - the condition true if there are any waiting threads throws: IllegalMonitorStateException - if exclusive synchronizationis not held throws: IllegalArgumentException - if the given condition isnot associated with this synchronizer throws: NullPointerException - if the condition is null |
isHeldExclusively | protected boolean isHeldExclusively()(Code) | | Returns
true if synchronization is held exclusively with
respect to the current (calling) thread. This method is invoked
upon each call to a non-waiting
ConditionObject method.
(Waiting methods instead invoke
AbstractQueuedSynchronizer.release .)
The default implementation throws
UnsupportedOperationException . This method is invoked
internally only within
ConditionObject methods, so need
not be defined if conditions are not used.
true if synchronization is held exclusively; false otherwise throws: UnsupportedOperationException - if conditions are not supported |
isOnSyncQueue | final boolean isOnSyncQueue(Node node)(Code) | | Returns true if a node, always one that was initially placed on
a condition queue, is now waiting to reacquire on sync queue.
Parameters: node - the node true if is reacquiring |
isQueued | final public boolean isQueued(Thread thread)(Code) | | Returns true if the given thread is currently queued.
This implementation traverses the queue to determine
presence of the given thread.
Parameters: thread - the thread true if the given thread is on the queue throws: NullPointerException - if the thread is null |
owns | final public boolean owns(ConditionObject condition)(Code) | | Queries whether the given ConditionObject
uses this synchronizer as its lock.
Parameters: condition - the condition true if owned throws: NullPointerException - if the condition is null |
setState | final protected void setState(int newState)(Code) | | Sets the value of synchronization state.
This operation has memory semantics of a volatile write.
Parameters: newState - the new state value |
toString | public String toString()(Code) | | Returns a string identifying this synchronizer, as well as its state.
The state, in brackets, includes the String
"State =" followed by the current value of
AbstractQueuedSynchronizer.getState , and either
"nonempty" or
"empty" depending on whether the
queue is empty.
a string identifying this synchronizer, as well as its state |
transferAfterCancelledWait | final boolean transferAfterCancelledWait(Node node)(Code) | | Transfers node, if necessary, to sync queue after a cancelled
wait. Returns true if thread was cancelled before being
signalled.
Parameters: current - the waiting thread Parameters: node - its node true if cancelled before the node was signalled |
transferForSignal | final boolean transferForSignal(Node node)(Code) | | Transfers a node from a condition queue onto sync queue.
Returns true if successful.
Parameters: node - the node true if successfully transferred (else the node wascancelled before signal). |
tryAcquire | protected boolean tryAcquire(int arg)(Code) | | Attempts to acquire in exclusive mode. This method should query
if the state of the object permits it to be acquired in the
exclusive mode, and if so to acquire it.
This method is always invoked by the thread performing
acquire. If this method reports failure, the acquire method
may queue the thread, if it is not already queued, until it is
signalled by a release from some other thread. This can be used
to implement method
Lock.tryLock .
The default
implementation throws
UnsupportedOperationException .
Parameters: arg - the acquire argument. This value is always the onepassed to an acquire method, or is the value saved on entryto a condition wait. The value is otherwise uninterpretedand can represent anything you like. true if successful. Upon success, this object hasbeen acquired. throws: IllegalMonitorStateException - if acquiring would place thissynchronizer in an illegal state. This exception must bethrown in a consistent fashion for synchronization to workcorrectly. throws: UnsupportedOperationException - if exclusive mode is not supported |
tryAcquireNanos | final public boolean tryAcquireNanos(int arg, long nanosTimeout) throws InterruptedException(Code) | | Attempts to acquire in exclusive mode, aborting if interrupted,
and failing if the given timeout elapses. Implemented by first
checking interrupt status, then invoking at least once
AbstractQueuedSynchronizer.tryAcquire , returning on success. Otherwise, the thread is
queued, possibly repeatedly blocking and unblocking, invoking
AbstractQueuedSynchronizer.tryAcquire until success or the thread is interrupted
or the timeout elapses. This method can be used to implement
method
Lock.tryLock(longTimeUnit) .
Parameters: arg - the acquire argument. This value is conveyed toAbstractQueuedSynchronizer.tryAcquire but is otherwise uninterpreted andcan represent anything you like. Parameters: nanosTimeout - the maximum number of nanoseconds to wait true if acquired; false if timed out throws: InterruptedException - if the current thread is interrupted |
tryAcquireShared | protected int tryAcquireShared(int arg)(Code) | | Attempts to acquire in shared mode. This method should query if
the state of the object permits it to be acquired in the shared
mode, and if so to acquire it.
This method is always invoked by the thread performing
acquire. If this method reports failure, the acquire method
may queue the thread, if it is not already queued, until it is
signalled by a release from some other thread.
The default implementation throws
UnsupportedOperationException .
Parameters: arg - the acquire argument. This value is always the onepassed to an acquire method, or is the value saved on entryto a condition wait. The value is otherwise uninterpretedand can represent anything you like. a negative value on failure; zero if acquisition in sharedmode succeeded but no subsequent shared-mode acquire cansucceed; and a positive value if acquisition in sharedmode succeeded and subsequent shared-mode acquires mightalso succeed, in which case a subsequent waiting threadmust check availability. (Support for three differentreturn values enables this method to be used in contextswhere acquires only sometimes act exclusively.) Uponsuccess, this object has been acquired. throws: IllegalMonitorStateException - if acquiring would place thissynchronizer in an illegal state. This exception must bethrown in a consistent fashion for synchronization to workcorrectly. throws: UnsupportedOperationException - if shared mode is not supported |
tryAcquireSharedNanos | final public boolean tryAcquireSharedNanos(int arg, long nanosTimeout) throws InterruptedException(Code) | | Attempts to acquire in shared mode, aborting if interrupted, and
failing if the given timeout elapses. Implemented by first
checking interrupt status, then invoking at least once
AbstractQueuedSynchronizer.tryAcquireShared , returning on success. Otherwise, the
thread is queued, possibly repeatedly blocking and unblocking,
invoking
AbstractQueuedSynchronizer.tryAcquireShared until success or the thread
is interrupted or the timeout elapses.
Parameters: arg - the acquire argument. This value is conveyed toAbstractQueuedSynchronizer.tryAcquireShared but is otherwise uninterpretedand can represent anything you like. Parameters: nanosTimeout - the maximum number of nanoseconds to wait true if acquired; false if timed out throws: InterruptedException - if the current thread is interrupted |
tryRelease | protected boolean tryRelease(int arg)(Code) | | Attempts to set the state to reflect a release in exclusive
mode.
This method is always invoked by the thread performing release.
The default implementation throws
UnsupportedOperationException .
Parameters: arg - the release argument. This value is always the onepassed to a release method, or the current state value uponentry to a condition wait. The value is otherwiseuninterpreted and can represent anything you like. true if this object is now in a fully releasedstate, so that any waiting threads may attempt to acquire;and false otherwise. throws: IllegalMonitorStateException - if releasing would place thissynchronizer in an illegal state. This exception must bethrown in a consistent fashion for synchronization to workcorrectly. throws: UnsupportedOperationException - if exclusive mode is not supported |
tryReleaseShared | protected boolean tryReleaseShared(int arg)(Code) | | Attempts to set the state to reflect a release in shared mode.
This method is always invoked by the thread performing release.
The default implementation throws
UnsupportedOperationException .
Parameters: arg - the release argument. This value is always the onepassed to a release method, or the current state value uponentry to a condition wait. The value is otherwiseuninterpreted and can represent anything you like. true if this release of shared mode may permit awaiting acquire (shared or exclusive) to succeed; and false otherwise throws: IllegalMonitorStateException - if releasing would place thissynchronizer in an illegal state. This exception must bethrown in a consistent fashion for synchronization to workcorrectly. throws: UnsupportedOperationException - if shared mode is not supported |
|
|
|