Examples of java.util.concurrent.locks.Condition

java.util.concurrent.locks.Condition
{@code Condition} factors out the {@code Object} monitormethods ( {@link Object#wait() wait}, {@link Object#notify notify}and {@link Object#notifyAll notifyAll}) into distinct objects to give the effect of having multiple wait-sets per object, by combining them with the use of arbitrary {@link Lock} implementations.Where a {@code Lock} replaces the use of {@code synchronized} methodsand statements, a {@code Condition} replaces the use of the Objectmonitor methods.
Conditions (also known as condition queues or condition variables) provide a means for one thread to suspend execution (to "wait") until notified by another thread that some state condition may now be true. Because access to this shared state information occurs in different threads, it must be protected, so a lock of some form is associated with the condition. The key property that waiting for a condition provides is that it atomically releases the associated lock and suspends the current thread, just like {@code Object.wait}.
A {@code Condition} instance is intrinsically bound to a lock.To obtain a {@code Condition} instance for a particular {@link Lock}instance use its {@link Lock#newCondition newCondition()} method.
As an example, suppose we have a bounded buffer which supports {@code put} and {@code take} methods. If a{@code take} is attempted on an empty buffer, then the thread will blockuntil an item becomes available; if a {@code put} is attempted on afull buffer, then the thread will block until a space becomes available. We would like to keep waiting {@code put} threads and {@code take}threads in separate wait-sets so that we can use the optimization of only notifying a single thread at a time when items or spaces become available in the buffer. This can be achieved using two {@link Condition} instances.
```
 class BoundedBuffer { final Lock lock = new ReentrantLock(); final Condition notFull  = lock.newCondition();  final Condition notEmpty = lock.newCondition();  final Object[] items = new Object[100]; int putptr, takeptr, count; public void put(Object x) throws InterruptedException { lock.lock(); try { while (count == items.length) notFull.await(); items[putptr] = x; if (++putptr == items.length) putptr = 0; ++count; notEmpty.signal(); } finally { lock.unlock(); } } public Object take() throws InterruptedException { lock.lock(); try { while (count == 0) notEmpty.await(); Object x = items[takeptr]; if (++takeptr == items.length) takeptr = 0; --count; notFull.signal(); return x; } finally { lock.unlock(); } } } 
```
(The {@link java.util.concurrent.ArrayBlockingQueue} class providesthis functionality, so there is no reason to implement this sample usage class.)
A {@code Condition} implementation can provide behavior and semanticsthat is different from that of the {@code Object} monitor methods, such asguaranteed ordering for notifications, or not requiring a lock to be held when performing notifications. If an implementation provides such specialized semantics then the implementation must document those semantics.
Note that {@code Condition} instances are just normal objects and canthemselves be used as the target in a {@code synchronized} statement,and can have their own monitor {@link Object#wait wait} and{@link Object#notify notification} methods invoked.Acquiring the monitor lock of a {@code Condition} instance, or using itsmonitor methods, has no specified relationship with acquiring the {@link Lock} associated with that {@code Condition} or the use of its{@linkplain #await waiting} and {@linkplain #signal signalling} methods.It is recommended that to avoid confusion you never use {@code Condition}instances in this way, except perhaps within their own implementation.
Except where noted, passing a {@code null} value for any parameterwill result in a {@link NullPointerException} being thrown.
Implementation Considerations

When waiting upon a {@code Condition}, a "spurious wakeup" is permitted to occur, in general, as a concession to the underlying platform semantics. This has little practical impact on most application programs as a {@code Condition} should always be waited upon in a loop, testingthe state predicate that is being waited for. An implementation is free to remove the possibility of spurious wakeups but it is recommended that applications programmers always assume that they can occur and so always wait in a loop.
The three forms of condition waiting (interruptible, non-interruptible, and timed) may differ in their ease of implementation on some platforms and in their performance characteristics. In particular, it may be difficult to provide these features and maintain specific semantics such as ordering guarantees. Further, the ability to interrupt the actual suspension of the thread may not always be feasible to implement on all platforms.
Consequently, an implementation is not required to define exactly the same guarantees or semantics for all three forms of waiting, nor is it required to support interruption of the actual suspension of the thread.
An implementation is required to clearly document the semantics and guarantees provided by each of the waiting methods, and when an implementation does support interruption of thread suspension then it must obey the interruption semantics as defined in this interface.
As interruption generally implies cancellation, and checks for interruption are often infrequent, an implementation can favor responding to an interrupt over normal method return. This is true even if it can be shown that the interrupt occurred after another action that may have unblocked the thread. An implementation should document this behavior. @since 1.5 @author Doug Lea

            {
                return null;
            }
            logger_.info(columnFamily_ + " has reached its threshold; switching in a fresh Memtable");
            oldMemtable.freeze();
            final Condition condition = submitFlush(oldMemtable);
            memtable_ = new Memtable(table_, columnFamily_);
            // a second executor that makes sure the onMemtableFlushes get called in the right order,
            // while keeping the wait-for-flush (future.get) out of anything latency-sensitive.
            return commitLogUpdater_.submit(new Runnable()
            {
                public void run()
                {
                    try
                    {
                        condition.await();
                        if (writeCommitLog)
                        {
                            // if we're not writing to the commit log, we are replaying the log, so marking
                            // the log header with "you can discard anything written before the context" is not valid
                            onMemtableFlush(ctx);

View Full Code Here

            // since they're a little complicated.  (We dont' want to move the remove back to switchMemtable, which is
            // the other sane option, since that could mean keeping a flushed memtable in the Historical set unnecessarily
            // while earlier flushes finish.)
            getMemtablesPendingFlushNotNull(columnFamily_).add((Memtable) flushable); // it's ok for the MT to briefly be both active and pendingFlush
        }
        final Condition condition = new SimpleCondition();
        flushSorter_.submit(new Runnable()
        {
            public void run()
            {
                final List sortedKeys = flushable.getSortedKeys();
                flushWriter_.submit(new Runnable()
                {
                    public void run()
                    {
                        try
                        {
                            addSSTable(flushable.writeSortedContents(sortedKeys));
                        }
                        catch (IOException e)
                        {
                            throw new RuntimeException(e);
                        }
                        if (flushable instanceof Memtable)
                        {
                            getMemtablesPendingFlushNotNull(columnFamily_).remove(flushable);
                        }
                        condition.signalAll();
                    }
                });
            }
        });
        return condition;

View Full Code Here

            Assert.assertEquals("thread not waiting",
                         Thread.State.WAITING, gct.getState());


            // get access to the objects we need
            Lock      lck = mgr.extendedCPBR.poolLock;
            Condition cnd = mgr.extendedCPBR.newestWT.getCondition();


            // Now trigger spurious wakeups. We'll do it several times
            // in a loop, just to be sure the connection manager has a
            // fair chance of misbehaving, and the gct to register it.


            for (int i=0; i<3; i++) {
                if (i > 0)
                    Thread.sleep(333); // don't go too fast


                try {
                    lck.lock();
                    cnd.signalAll(); // this is the spurious wakeup
                } finally {
                    lck.unlock();
                }


                // now give the waiting thread some time to register a wakeup

View Full Code Here

            assertEquals("thread not waiting",
                         Thread.State.WAITING, gct.getState());


            // get access to the objects we need
            Lock      lck = mgr.extendedCPBR.poolLock;
            Condition cnd = mgr.extendedCPBR.newestWT.getCondition();


            // Now trigger spurious wakeups. We'll do it several times
            // in a loop, just to be sure the connection manager has a
            // fair chance of misbehaving, and the gct to register it.


            for (int i=0; i<3; i++) {
                if (i > 0)
                    Thread.sleep(333); // don't go too fast


                try {
                    lck.lock();
                    cnd.signalAll(); // this is the spurious wakeup
                } finally {
                    lck.unlock();
                }


                // now give the waiting thread some time to register a wakeup

View Full Code Here

        } catch (IllegalArgumentException iax) {
            // expected
        }


        Lock      lck = new ReentrantLock();
        Condition cnd = lck.newCondition();


        WaitingThread wt = new WaitingThread(cnd, null);
        assertEquals("wrong condition", cnd, wt.getCondition());
        assertNull  ("pool from nowhere", wt.getPool());
        assertNull  ("thread from nowhere", wt.getThread());

View Full Code Here




    public void testAwaitWakeup() throws InterruptedException {


        Lock      lck = new ReentrantLock();
        Condition cnd = lck.newCondition();
        WaitingThread wt = new WaitingThread(cnd, null);


        AwaitThread ath = new AwaitThread(wt, lck, null);
        ath.start();
        Thread.sleep(100); // give extra thread time to block

View Full Code Here




    public void testInterrupt() throws InterruptedException {


        Lock      lck = new ReentrantLock();
        Condition cnd = lck.newCondition();
        WaitingThread wt = new WaitingThread(cnd, null);


        AwaitThread ath = new AwaitThread(wt, lck, null);
        ath.start();
        Thread.sleep(100); // give extra thread time to block

View Full Code Here




    public void testIllegal() throws InterruptedException {


        Lock      lck = new ReentrantLock();
        Condition cnd = lck.newCondition();
        WaitingThread wt = new WaitingThread(cnd, null);


        try {
            lck.lock();
            wt.wakeup();

View Full Code Here

                info=(LockInfo)evt.getArg();
                lock=getLock(info.getName(), false);
                if (lock == null || !lock.acquired) {
                    throw new IllegalMonitorStateException();
                }
                Condition condition = lock.newCondition();
                if (info.isUseTimeout()) {
                    try {
                        return condition.awaitNanos(info.getTimeUnit().toNanos(info.getTimeout()));
                    }
                    catch (InterruptedException e) {
                        Thread.currentThread().interrupt();
                    }
                }
                else if (info.isLockInterruptibly()) {
                    try {
                        condition.await();
                    }
                    catch (InterruptedException e) {
                        Thread.currentThread().interrupt();
                    }
                }
                else {
                    condition.awaitUninterruptibly();
                }
                return null;
            case Event.LOCK_SIGNAL:
                AwaitInfo awaitInfo = (AwaitInfo)evt.getArg();
                lock=getLock(awaitInfo.getName(), false);

View Full Code Here

     * - Now first node should be able to connect and first and second node should be able to merge into a group
     * - SUCCESS: a view of 2
     */
    public void testLateStart() throws Exception {
        final Lock lock=new ReentrantLock();
        final Condition cond=lock.newCondition();
        AtomicBoolean done=new AtomicBoolean(false);


        System.out.println("-- starting first channel");
        c1=new JChannel(props);
        changeMergeInterval(c1);
        setReconnectInterval(c1);
        setRefreshInterval(c1);
        c1.setReceiver(new MyReceiver("c1", done, lock, cond));
        c1.connect("demo");


        System.out.println("-- starting second channel");
        c2=new JChannel(props);
        changeMergeInterval(c2);
        setReconnectInterval(c2);
        setRefreshInterval(c2);
        c2.setReceiver(new MyReceiver("c2", done, lock, cond));
        c2.connect("demo");


        System.out.println("-- starting GossipRouter");
        startRouter(router_host, router_port) ;


        System.out.println("-- waiting for merge to happen --");
        long target_time=System.currentTimeMillis() + 40000;
        lock.lock();
        try {
            while(System.currentTimeMillis() < target_time && done.get() == false) {
                cond.await(1000, TimeUnit.MILLISECONDS);
            }
        }
        finally {
            lock.unlock();
        }

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of java.util.concurrent.locks.Condition

co.paralleluniverse.remote.galaxy.GlxGlobalRegistry

com.google.common.util.concurrent.Monitor

de.scoopgmbh.copper.batcher.impl.BatcherQueue

freenet.store.saltedhash.LockManager

freenet.store.saltedhash.SaltedHashFreenetStore

jersey.repackaged.com.google.common.util.concurrent.Monitor

my.code.concurrency.c01.simplewait2.TestRun

my.home.test.utils.TestUtils

net.algart.arrays.GeneralizedBitProcessing

net.java.trueupdate.core.io.Copy

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.

Examples of java.util.concurrent.locks.Condition

Implementation Considerations

Related Classes of java.util.concurrent.locks.Condition