Examples of edu.emory.mathcs.backport.java.util.concurrent.locks.Lock.unlock()

Package edu.emory.mathcs.backport.java.util.concurrent.locks

Class edu.emory.mathcs.backport.java.util.concurrent.locks.Lock

Examples of edu.emory.mathcs.backport.java.util.concurrent.locks.Lock.unlock()

edu.emory.mathcs.backport.java.util.concurrent.locks.Lock.unlock()
Releases the lock.
Implementation Considerations
A Lock implementation will usually impose restrictions on which thread can release a lock (typically only the holder of the lock can release it) and may throw an (unchecked) exception if the restriction is violated. Any restrictions and the exception type must be documented by that Lock implementation.

        try {
            final InstanceResource resource = this.find(id);
            this.scheduler.cleanup(id);
            resource.cleanup();
        } finally {
            lock.unlock();
            destroy_lock.unlock();
        }
    }


    // -------------------------------------------------------------------------

View Full Code Here

            if (destroyed) {
                this.cache.remove(id);
            }


        } finally {
            lock.unlock();
            destroy_lock.unlock();
        }


        return destroyed;
    }

View Full Code Here

                // candidate for admin log/trigger of severe issues
                logger.error("",t);
            } finally {
              try {
                  lock.lockInterruptibly();
                  destroy_lock.unlock();
              } catch (InterruptedException e) {
                  throw new ManageException(e.getMessage(), e);
              }
            }

View Full Code Here

            }


            try {
                lock.lockInterruptibly();
            } catch (InterruptedException e) {
                destroy_lock.unlock();
                throw new LockAcquisitionFailure(e);
            }


            if (lager.traceLog) {
                logger.trace(Lager.id(this.id) + ": acquired lock");

View Full Code Here

            if (lock != null) {
                if (lager.traceLog) {
                    logger.trace(Lager.id(this.id) + ": releasing lock");
                }
                lock.unlock();
                destroy_lock.unlock();
            }
        }
    }


    private void updateCumulus()

View Full Code Here

            throw e;
        } finally {
            if (lager.traceLog) {
                logger.trace(Lager.id(this.id) + ": releasing lock");
            }
            lock.unlock();
        }
    }


    private void setTargetStateImpl(int target,
                                    boolean force,

View Full Code Here

                throw new ManageException("UUID collision in groups cache, " +
                        "ID '" + idStr + "' already exists (seriously?)");
            }


        } finally {
            lock.unlock();
        }


        if (this.lager.eventLog) {
            logger.info(Lager.ensembleev(idStr) +
                    " created on behalf of '" + creatorID + "'");

View Full Code Here

            } else {
                resource = (CoschedResource) el.getObjectValue();
            }


        } finally {
            lock.unlock();
        }


        return resource;
        
    }

View Full Code Here

            resource.remove();
            this.cache.remove(coschedid);
            this.persistence.removeEnsemble(coschedid);


        } finally {
            lock.unlock();
        }
    }
    
}

View Full Code Here

                throw new ManageException("UUID collision in groups cache, " +
                        "ID '" + idStr + "' already exists (seriously?)");
            }


        } finally {
            lock.unlock();
        }


        if (this.lager.eventLog) {
            logger.info(Lager.groupev(idStr) +
                    " created on behalf of '" + creatorID + "'");

View Full Code Here

0 1 2

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.