Java Doc for AbstractQueuedSynchronizer.java in  » Apache-Harmony-Java-SE » java-package » java » util » concurrent » locks » Java Source Code / Java DocumentationJava Source Code and Java Documentation

Java Source Code / Java Documentation
1. 6.0 JDK Core
2. 6.0 JDK Modules
3. 6.0 JDK Modules com.sun
4. 6.0 JDK Modules com.sun.java
5. 6.0 JDK Modules sun
6. 6.0 JDK Platform
7. Ajax
8. Apache Harmony Java SE
9. Aspect oriented
10. Authentication Authorization
11. Blogger System
12. Build
13. Byte Code
14. Cache
15. Chart
16. Chat
17. Code Analyzer
18. Collaboration
19. Content Management System
20. Database Client
21. Database DBMS
22. Database JDBC Connection Pool
23. Database ORM
24. Development
25. EJB Server geronimo
26. EJB Server GlassFish
27. EJB Server JBoss 4.2.1
28. EJB Server resin 3.1.5
29. ERP CRM Financial
30. ESB
31. Forum
32. GIS
33. Graphic Library
34. Groupware
35. HTML Parser
36. IDE
37. IDE Eclipse
38. IDE Netbeans
39. Installer
40. Internationalization Localization
41. Inversion of Control
42. Issue Tracking
43. J2EE
44. JBoss
45. JMS
46. JMX
47. Library
48. Mail Clients
49. Net
50. Parser
51. PDF
52. Portal
53. Profiler
54. Project Management
55. Report
56. RSS RDF
57. Rule Engine
58. Science
59. Scripting
60. Search Engine
61. Security
62. Sevlet Container
63. Source Control
64. Swing Library
65. Template Engine
66. Test Coverage
67. Testing
68. UML
69. Web Crawler
70. Web Framework
71. Web Mail
72. Web Server
73. Web Services
74. Web Services apache cxf 2.0.1
75. Web Services AXIS2
76. Wiki Engine
77. Workflow Engines
78. XML
79. XML UI
Java
Java Tutorial
Java Open Source
Jar File Download
Java Articles
Java Products
Java by API
Photoshop Tutorials
Maya Tutorials
Flash Tutorials
3ds-Max Tutorials
Illustrator Tutorials
GIMP Tutorials
C# / C Sharp
C# / CSharp Tutorial
C# / CSharp Open Source
ASP.Net
ASP.NET Tutorial
JavaScript DHTML
JavaScript Tutorial
JavaScript Reference
HTML / CSS
HTML CSS Reference
C / ANSI-C
C Tutorial
C++
C++ Tutorial
Ruby
PHP
Python
Python Tutorial
Python Open Source
SQL Server / T-SQL
SQL Server / T-SQL Tutorial
Oracle PL / SQL
Oracle PL/SQL Tutorial
PostgreSQL
SQL / MySQL
MySQL Tutorial
VB.Net
VB.Net Tutorial
Flash / Flex / ActionScript
VBA / Excel / Access / Word
XML
XML Tutorial
Microsoft Office PowerPoint 2007 Tutorial
Microsoft Office Excel 2007 Tutorial
Microsoft Office Word 2007 Tutorial
Java Source Code / Java Documentation » Apache Harmony Java SE » java package » java.util.concurrent.locks 
Source Cross Reference  Class Diagram Java Document (Java Doc) 


java.lang.Object
   java.util.concurrent.locks.AbstractQueuedSynchronizer

AbstractQueuedSynchronizer
abstract public class AbstractQueuedSynchronizer 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.

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. In particular, a strict FIFO lock can define tryAcquire to immediately return false if AbstractQueuedSynchronizer.getFirstQueuedThread does not return the current thread. A normally preferable non-strict fair version can immediately return false only if AbstractQueuedSynchronizer.hasQueuedThreads returns true and getFirstQueuedThread is not the current thread; or equivalently, that getFirstQueuedThread is both non-null and not the current thread. Further 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. 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
 return compareAndSetState(0, 1);
 }
 // Release the lock by setting state to zero
 protected boolean tryRelease(int releases) {
 assert releases == 1; // Otherwise unused
 if (getState() == 0) throw new IllegalMonitorStateException();
 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
Inner Class :public class ConditionObject implements Condition,java.io.Serializable


Constructor Summary
protected  AbstractQueuedSynchronizer()
     Creates a new AbstractQueuedSynchronizer instance with initial synchronization state of zero.

Method Summary
final public  voidacquire(int arg)
     Acquires in exclusive mode, ignoring interrupts.
final public  voidacquireInterruptibly(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  booleanacquireQueued(Node node, int arg)
     Acquire in exclusive uninterruptible mode for thread already in queue.
final public  voidacquireShared(int arg)
     Acquires in shared mode, ignoring interrupts.
final public  voidacquireSharedInterruptibly(int arg)
     Acquires in shared mode, aborting if interrupted.
final protected  booleancompareAndSetState(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  intfullyRelease(Node node)
     Invoke release with current state value; return saved state.
final public  Collection<Thread>getExclusiveQueuedThreads()
     Returns a collection containing threads that may be waiting to acquire in exclusive mode.
final public  ThreadgetFirstQueuedThread()
     Returns the first (longest-waiting) thread in the queue, or null if no threads are currently queued.
final public  intgetQueueLength()
     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  intgetState()
     Returns the current value of synchronization state.
final public  intgetWaitQueueLength(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  booleanhasContended()
     Queries whether any threads have ever contended to acquire this synchronizer; that is if an acquire method has ever blocked.
final public  booleanhasQueuedThreads()
     Queries whether any threads are waiting to acquire.
final public  booleanhasWaiters(ConditionObject condition)
     Queries whether any threads are waiting on the given condition associated with this synchronizer.
protected  booleanisHeldExclusively()
     Returns true if synchronization is held exclusively with respect to the current (calling) thread.
final  booleanisOnSyncQueue(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  booleanisQueued(Thread thread)
     Returns true if the given thread is currently queued.
final public  booleanowns(ConditionObject condition)
     Queries whether the given ConditionObject uses this synchronizer as its lock.
final public  booleanrelease(int arg)
     Releases in exclusive mode.
final public  booleanreleaseShared(int arg)
     Releases in shared mode.
final protected  voidsetState(int newState)
     Sets the value of synchronization state.
public  StringtoString()
     Returns a string identifying this synchronizer, as well as its state.
final  booleantransferAfterCancelledWait(Node node)
     Transfers node, if necessary, to sync queue after a cancelled wait.
final  booleantransferForSignal(Node node)
     Transfers a node from a condition queue onto sync queue.
protected  booleantryAcquire(int arg)
     Attempts to acquire in exclusive mode.
final public  booleantryAcquireNanos(int arg, long nanosTimeout)
     Attempts to acquire in exclusive mode, aborting if interrupted, and failing if the given timeout elapses.
protected  inttryAcquireShared(int arg)
     Attempts to acquire in shared mode.
final public  booleantryAcquireSharedNanos(int arg, long nanosTimeout)
     Attempts to acquire in shared mode, aborting if interrupted, and failing if the given timeout elapses.
protected  booleantryRelease(int arg)
     Attempts to set the state to reflect a release in exclusive mode.
protected  booleantryReleaseShared(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.



Constructor Detail
AbstractQueuedSynchronizer
protected AbstractQueuedSynchronizer()(Code)
Creates a new AbstractQueuedSynchronizer instance with initial synchronization state of zero.




Method Detail
acquire
final public void acquire(int arg)(Code)
Acquires in exclusive mode, ignoring interrupts. Implemented by invoking at least once AbstractQueuedSynchronizer.tryAcquire , returning on success. Otherwise the thread is queued, possibly repeatedly blocking and unblocking, invoking AbstractQueuedSynchronizer.tryAcquire until success. This method can be used to implement method Lock.lock
Parameters:
  arg - the acquire argument.This value is conveyed to AbstractQueuedSynchronizer.tryAcquire but isotherwise uninterpreted and can represent anythingyou like.



acquireInterruptibly
final public void acquireInterruptibly(int arg) throws InterruptedException(Code)
Acquires in exclusive mode, aborting if interrupted. 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. This method can be used to implement method Lock.lockInterruptibly
Parameters:
  arg - the acquire argument.This value is conveyed to AbstractQueuedSynchronizer.tryAcquire but isotherwise uninterpreted and can represent anythingyou like.
throws:
  InterruptedException - if the current thread is interrupted



acquireQueued
final boolean acquireQueued(Node node, int arg)(Code)
Acquire 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



acquireShared
final public void acquireShared(int arg)(Code)
Acquires in shared mode, ignoring interrupts. Implemented by first invoking at least once AbstractQueuedSynchronizer.tryAcquireShared , returning on success. Otherwise the thread is queued, possibly repeatedly blocking and unblocking, invoking AbstractQueuedSynchronizer.tryAcquireShared until success.
Parameters:
  arg - the acquire argument.This value is conveyed to AbstractQueuedSynchronizer.tryAcquireShared but isotherwise uninterpreted and can represent anythingyou like.



acquireSharedInterruptibly
final public void acquireSharedInterruptibly(int arg) throws InterruptedException(Code)
Acquires in shared mode, aborting if interrupted. 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.
Parameters:
  arg - the acquire argument.This value is conveyed to AbstractQueuedSynchronizer.tryAcquireShared but isotherwise uninterpreted and can represent anythingyou like.
throws:
  InterruptedException - if the current thread is interrupted



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 thatthe actual value was not equal to the expected value.



fullyRelease
final int fullyRelease(Node node)(Code)
Invoke release with current state value; return saved state. Cancel node and throw 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, ornull 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 for this lock



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 synchronization is not held
throws:
  IllegalArgumentException - if the given condition isnot associated with this synchronizer
throws:
  NullPointerException - if condition 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 synchronization is not held
throws:
  IllegalArgumentException - if the given condition isnot associated with this synchronizer
throws:
  NullPointerException - if condition 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




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 acquirethe lock.




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 synchronization is not held
throws:
  IllegalArgumentException - if the given condition isnot associated with this synchronizer
throws:
  NullPointerException - if condition 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;else false
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 in on the queue
throws:
  NullPointerException - if thread 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 condition null



release
final public boolean release(int arg)(Code)
Releases in exclusive mode. Implemented by unblocking one or more threads if AbstractQueuedSynchronizer.tryRelease returns true. This method can be used to implement method Lock.unlock
Parameters:
  arg - the release argument.This value is conveyed to AbstractQueuedSynchronizer.tryRelease but isotherwise uninterpreted and can represent anythingyou like. the value returned from AbstractQueuedSynchronizer.tryRelease



releaseShared
final public boolean releaseShared(int arg)(Code)
Releases in shared mode. Implemented by unblocking one or more threads if AbstractQueuedSynchronizer.tryReleaseShared returns true.
Parameters:
  arg - the release argument.This value is conveyed to AbstractQueuedSynchronizer.tryReleaseShared but isotherwise uninterpreted and can represent anythingyou like. the value returned from AbstractQueuedSynchronizer.tryReleaseShared



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 valueis always the one passed to an acquire method,or is the value saved on entry to a condition wait.The value is otherwise uninterpreted and can represent anythingyou like. true if successful. Upon success, this object has beenacquired.
throws:
  IllegalMonitorStateException - if acquiring would placethis synchronizer 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 to AbstractQueuedSynchronizer.tryAcquire but isotherwise uninterpreted and can represent anythingyou 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 valueis always the one passed to an acquire method,or is the value saved on entry to a condition wait.The value is otherwise uninterpreted and can represent anythingyou like. a negative value on failure, zero on exclusive success,and a positive value if non-exclusively successful, in whichcase a subsequent waiting thread must checkavailability. (Support for three different return valuesenables this method to be used in contexts where acquires onlysometimes act exclusively.) Upon success, this object has beenacquired.
throws:
  IllegalMonitorStateException - if acquiring would placethis synchronizer 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 to AbstractQueuedSynchronizer.tryAcquireShared but isotherwise uninterpreted and can represent anythingyou 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 valueis always the one passed to a release method,or the current state value upon entry to a condition wait.The value is otherwise uninterpreted and can represent anythingyou like. true if this object is now in a fully released state, so that any waiting threads may attempt to acquire; and falseotherwise.
throws:
  IllegalMonitorStateException - if releasing would placethis synchronizer 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 valueis always the one passed to a release method,or the current state value upon entry to a condition wait.The value is otherwise uninterpreted and can represent anythingyou like. true if this object is now in a fully released state, so that any waiting threads may attempt to acquire; and falseotherwise.
throws:
  IllegalMonitorStateException - if releasing would placethis synchronizer in an illegal state. This exception must bethrown in a consistent fashion for synchronization to workcorrectly.
throws:
  UnsupportedOperationException - if shared mode is not supported




Methods inherited from java.lang.Object
protected Object clone() throws CloneNotSupportedException(Code)(Java Doc)
public boolean equals(Object object)(Code)(Java Doc)
protected void finalize() throws Throwable(Code)(Java Doc)
final public Class<? extends Object> getClass()(Code)(Java Doc)
public int hashCode()(Code)(Java Doc)
final public void notify()(Code)(Java Doc)
final public void notifyAll()(Code)(Java Doc)
public String toString()(Code)(Java Doc)
final public void wait(long millis, int nanos) throws InterruptedException(Code)(Java Doc)
final public void wait(long millis) throws InterruptedException(Code)(Java Doc)
final public void wait() throws InterruptedException(Code)(Java Doc)

www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.