Examples of Mutex

EDU.oswego.cs.dl.util.concurrent.Mutex
node keeps its own lock Node(Object x, Node n) { item = x; next = n; } } class List { protected Node head; // pointer to first node of list // Use plain java synchronization to protect head field. // (We could instead use a Mutex here too but there is no // reason to do so.) protected synchronized Node getHead() { return head; } boolean search(Object x) throws InterruptedException { Node p = getHead(); if (p == null) return false; // (This could be made more compact, but for clarity of illustration, // all of the cases that can arise are handled separately.) p.lock.acquire(); // Prime loop by acquiring first lock. // (If the acquire fails due to // interrupt, the method will throw // InterruptedException now, // so there is no need for any // further cleanup.) for (;;) { if (x.equals(p.item)) { p.lock.release(); // release current before return return true; } else { Node nextp = p.next; if (nextp == null) { p.lock.release(); // release final lock that was held return false; } else { try { nextp.lock.acquire(); // get next lock before releasing current } catch (InterruptedException ex) { p.lock.release(); // also release current if acquire fails throw ex; } p.lock.release(); // release old lock now that new one held p = nextp; } } } } synchronized void add(Object x) { // simple prepend // The use of `synchronized' here protects only head field. // The method does not need to wait out other traversers // who have already made it past head. head = new Node(x, head); } // ... other similar traversal and update methods ... }
@see Semaphore
[ Introduction to this package. ]
Framework.Mutex
This class allows multiple tasks to access and change shared objects by providing a mutually exclusive object lock, or "mutex."
net.sf.ehcache.concurrent.Mutex
ode keeps its own lock
Node(Object x, Node n) { item = x; next = n; } }
class List { protected Node head; // pointer to first node of list
// Use plain java synchronization to protect head field. // (We could instead use a Mutex here too but there is no // reason to do so.) protected synchronized Node getHead() { return head; }
boolean search(Object x) throws InterruptedException { Node p = getHead(); if (p == null) return false;
// (This could be made more compact, but for clarity of illustration, // all of the cases that can arise are handled separately.)
p.lock.acquire(); // Prime loop by acquiring first lock. // (If the acquire fails due to // interrupt, the method will throw // InterruptedException now, // so there is no need for any // further cleanup.) for (;;) { if (x.equals(p.item)) { p.lock.release(); // release current before return return true; } else { Node nextp = p.next; if (nextp == null) { p.lock.release(); // release final lock that was held return false; } else { try { nextp.lock.acquire(); // get next lock before releasing current } catch (InterruptedException ex) { p.lock.release(); // also release current if acquire fails throw ex; } p.lock.release(); // release old lock now that new one held p = nextp; } } } }
synchronized void add(Object x) { // simple prepend // The use of `synchronized' here protects only head field. // The method does not need to wait out other traversers // who have already made it past head.
head = new Node(x, head); }
// ... other similar traversal and update methods ... }

[ Introduction to this package. ]
net.sf.ehcache.constructs.concurrent.Mutex
ode keeps its own lock
Node(Object x, Node n) { item = x; next = n; } }
class List { protected Node head; // pointer to first node of list
// Use plain java synchronization to protect head field. // (We could instead use a Mutex here too but there is no // reason to do so.) protected synchronized Node getHead() { return head; }
boolean search(Object x) throws InterruptedException { Node p = getHead(); if (p == null) return false;
// (This could be made more compact, but for clarity of illustration, // all of the cases that can arise are handled separately.)
p.lock.acquire(); // Prime loop by acquiring first lock. // (If the acquire fails due to // interrupt, the method will throw // InterruptedException now, // so there is no need for any // further cleanup.) for (;;) { if (x.equals(p.item)) { p.lock.release(); // release current before return return true; } else { Node nextp = p.next; if (nextp == null) { p.lock.release(); // release final lock that was held return false; } else { try { nextp.lock.acquire(); // get next lock before releasing current } catch (InterruptedException ex) { p.lock.release(); // also release current if acquire fails throw ex; } p.lock.release(); // release old lock now that new one held p = nextp; } } } }
synchronized void add(Object x) { // simple prepend // The use of `synchronized' here protects only head field. // The method does not need to wait out other traversers // who have already made it past head.
head = new Node(x, head); }
// ... other similar traversal and update methods ... }

[ Introduction to this package. ]

Examples of EDU.oswego.cs.dl.util.concurrent.Mutex

        return p;
    }


    public void setup() throws ProtocolException {
        log = LogFactory.getLog(SocketProtocol.class.getName() + ":" + getNextConnectionId());
        sendMutex = new Mutex();
        headerBuffer = ByteBuffer.allocate(4);
        serviceReadMutex = new Object();
        serviceWriteMutex = new Object();


        if (address == null && acceptedSocketChannel == null) throw new IllegalStateException("No address set");

View Full Code Here

Examples of Framework.Mutex

    public ServiceConcurrency getConcurrency() {
        return this.concurrency;
    }


    public void setInitLock(Mutex initLock) {
        Mutex oldValue = this.initLock;
        this.initLock = initLock;
        this.qq_Listeners.firePropertyChange("initLock", oldValue, this.initLock);
    }

View Full Code Here

Examples of Framework.Mutex

    public ServiceConcurrency getConcurrency() {
        return this.concurrency;
    }


    public void setInitLock(Mutex initLock) {
        Mutex oldValue = this.initLock;
        this.initLock = initLock;
        this.qq_Listeners.firePropertyChange("initLock", oldValue, this.initLock);
    }

View Full Code Here

Examples of net.sf.ehcache.concurrent.Mutex

     *                              acquire a lock in that time
     * @throws RuntimeException     if thrown the lock will not released. Catch and call<code>put(new Element(key, null));</code>
     *                              to release the lock acquired.
     */
    public Element get(final Object key) throws RuntimeException, LockTimeoutException {
        Mutex lock = getLockForKey(key);
        try {
            if (timeoutMillis == 0) {
                lock.acquire();
            } else {
                boolean acquired = lock.attempt(timeoutMillis);
                if (!acquired) {
                    StringBuffer message = new StringBuffer("Lock timeout. Waited more than ")
                            .append(timeoutMillis)
                            .append("ms to acquire lock for key ")
                            .append(key).append(" on blocking cache ").append(cache.getName());
                    throw new LockTimeoutException(message.toString());
                }
            }
            final Element element = cache.get(key);
            if (element != null) {
                //ok let the other threads in
                lock.release();
                return element;
            } else {
                //don't release the read lock until we put
                return null;
            }

View Full Code Here

Examples of net.sf.ehcache.concurrent.Mutex

            return;
        }
        Object key = element.getObjectKey();
        Object value = element.getObjectValue();


        Mutex lock = getLockForKey(key);
        try {
            if (value != null) {
                cache.put(element);
            } else {
                cache.remove(key);
            }
        } finally {
            //Release the readlock here. This will have been acquired in the get, where the element was null
            lock.release();
        }
    }

View Full Code Here

Examples of net.sf.ehcache.concurrent.Mutex

            Element element = backingCache.get(key);


            if (element == null) {
                element = super.get(key);
            } else {
                Mutex lock = stripedMutex.getMutexForKey(key);
                try {
                    lock.acquire();
                    update(key);
                } finally {
                    lock.release();
                }
            }
            return element;
        } catch (final Throwable throwable) {
            // Could not fetch - Ditch the entry from the cache and rethrow

View Full Code Here

Examples of net.sf.ehcache.constructs.concurrent.Mutex

            Element element = backingCache.get(key);


            if (element == null) {
                element = super.get(key);
            } else {
                Mutex lock = getLockForKey(key);
                try {
                    lock.acquire();
                    update(key);
                } finally {
                    lock.release();
                }
            }
            return element;
        } catch (final Throwable throwable) {
            // Could not fetch - Ditch the entry from the cache and rethrow

View Full Code Here

Examples of net.sf.ehcache.constructs.concurrent.Mutex

     *                              acquire a lock in that time
     * @throws RuntimeException     if thrown the lock will not released. Catch and call<code>put(new Element(key, null));</code>
     *                              to release the lock acquired.
     */
    public Element get(final Object key) throws RuntimeException, LockTimeoutException {
        Mutex lock = getLockForKey(key);
        try {
            if (timeoutMillis == 0) {
                lock.acquire();
            } else {
                boolean acquired = lock.attempt(timeoutMillis);
                if (!acquired) {
                    StringBuffer message = new StringBuffer("Lock timeout. Waited more than ")
                            .append(timeoutMillis)
                            .append("ms to acquire lock for key ")
                            .append(key).append(" on blocking cache ").append(cache.getName());
                    throw new LockTimeoutException(message.toString());
                }
            }
            final Element element = cache.get(key);
            if (element != null) {
                //ok let the other threads in
                lock.release();
                return element;
            } else {
                //don't release the read lock until we put
                return null;
            }

View Full Code Here

Examples of net.sf.ehcache.constructs.concurrent.Mutex

            return;
        }
        Object key = element.getObjectKey();
        Object value = element.getObjectValue();


        Mutex lock = getLockForKey(key);
        try {
            if (value != null) {
                cache.put(element);
            } else {
                cache.remove(key);
            }
        } finally {
            //Release the readlock here. This will have been acquired in the get, where the element was null
            lock.release();
        }
    }

View Full Code Here

0 1

TOP

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.