Examples of org.jboss.cache.lock.IdentityLock

org.jboss.cache.lock.IdentityLock
Lock object which grants and releases locks, and associates locks with owners. The methods to acquire and release a lock require an owner (Object). When a lock is acquired, we store the current owner with the lock. When the same owner (but possibly running in a different thread) wants to acquire the lock, it is immediately granted. When an owner different from the one currently owning the lock wants to release the lock, we do nothing (no-op).
Consider the following example:
```
 FIFOSemaphore lock=new FIFOSemaphore(1); lock.acquire(); lock.acquire(); lock.release(); 
```
This would block on the second acquire() (although we currently already hold the lock) because the lock only has 1 permit. So IdentityLock will allow the following code to work properly:
```
 IdentityLock lock=new IdentityLock(); lock.readLock().acquire(this, timeout); lock.writeLock().acquire(this, timeout); lock.release(this); 
```
If the owner is null, then the current thread is taken by default. This allow the following code to work:
```
 IdentityLock lock=new IdentityLock(); lock.readLock().attempt(null, timeout); lock.writeLock().attempt(null, timeout); lock.release(null); 
```
Note that the Object given as owner is required to implement {@link Object#equals}. For a use case see the examples in the testsuite. @author Bela Ban Apr 11, 2003 @author Ben Wang July 2003 @deprecated will be removed when we drop support for Pessimistic Locking and Optimistic Locking

   }


   private synchronized void initLock()
   {
      if (lock_ == null)
         lock_ = new IdentityLock(cache, fqn);
   }

View Full Code Here

   public void releaseAllLocksFIFO(Object owner) {
      // I guess a copy would work as well
      // This seems fairly safe though
      synchronized (locks) {
         for (Iterator i = locks.iterator(); i.hasNext();) {
            IdentityLock lock = (IdentityLock)i.next();
            lock.release(owner);
             if (log.isTraceEnabled())
             {
                 log.trace("releasing lock for " + lock.getFqn() + " (" + lock + ")");
             }
         }
      }
   }

View Full Code Here

      Map nodeMap = w.getNodes();
      for (Iterator i = nodeMap.keySet().iterator(); i.hasNext();)
      {
         WorkspaceNode wn = (WorkspaceNode) nodeMap.get(i.next());
         DataNode n = wn.getNode();
         IdentityLock lock = n.getLock();
         if (lock.isLocked())
         {
            actual.put(n.getFqn(), lock.isReadLocked() ? READ : WRITE);
         }
      }


      return super.invoke(call);
   }

View Full Code Here


   private synchronized void initLock()
   {
      if (lock_ == null)
      {
         lock_ = new IdentityLock(cache.getConfiguration().getIsolationLevel(), delegate);
      }
   }

View Full Code Here


   protected synchronized void initLock()
   {
      if (lock == null)
      {
         lock = new IdentityLock(lockStrategyFactory, delegate);
      }
   }

View Full Code Here

        assertEquals(pojo, workspace.getNode(Fqn.fromString("/one/two")).get("key1"));
        assertEquals(1, workspace.getNode(Fqn.fromString("/one/two")).getMergedData().size());
        assertEquals(3, entry.getLocks().size());
        for (Iterator it = entry.getLocks().iterator(); it.hasNext();)
        {
            IdentityLock lock = (IdentityLock) it.next();
            assertTrue(lock.isWriteLocked());
            assertEquals(gtx, lock.getWriterOwner());
        }
        assertEquals(1, entry.getModifications().size());
        assertTrue(!cache.exists("/one/two"));
        //assertEquals(null,dummy.getCalled());

View Full Code Here

        assertEquals(pojo, workspace.getNode(Fqn.fromString("/one/two")).get("key1"));
        assertEquals(1, workspace.getNode(Fqn.fromString("/one/two")).getMergedData().size());
        assertEquals(3, entry.getLocks().size());
        for (Iterator it = entry.getLocks().iterator(); it.hasNext();)
        {
            IdentityLock lock = (IdentityLock) it.next();
            assertTrue(lock.isWriteLocked());
            assertEquals(gtx, lock.getWriterOwner());
        }
        assertEquals(1, entry.getModifications().size());
        assertTrue(!cache.exists("/one/two"));
        //assertEquals(null,dummy.getCalled());
        assertEquals(MethodDeclarations.optimisticPrepareMethod, dummy.getCalled());




        MethodCall commitMethod = MethodCallFactory.create(MethodDeclarations.commitMethod, new Object[]{gtx});
        try
        {
            cache._replicate(commitMethod);
        }
        catch (Throwable t)
        {
            fail();
        }
        assertEquals(3, entry.getLocks().size());
        for (Iterator it = entry.getLocks().iterator(); it.hasNext();)
        {
            IdentityLock lock = (IdentityLock) it.next();
            assertEquals(false, lock.isLocked());


        }
        //make sure the nodes and locks are the same order
        int i = 0;
        for (Iterator it = workspace.getNodes().values().iterator(); it.hasNext();)

View Full Code Here

        assertEquals(pojo, workspace.getNode(Fqn.fromString("/one/two")).get("key1"));
        assertEquals(1, workspace.getNode(Fqn.fromString("/one/two")).getMergedData().size());
        assertEquals(3, entry.getLocks().size());
        for (Iterator it = entry.getLocks().iterator(); it.hasNext();)
        {
            IdentityLock lock = (IdentityLock) it.next();
            assertTrue(lock.isWriteLocked());
            assertEquals(gtx, lock.getWriterOwner());
        }
        assertEquals(1, entry.getModifications().size());
        assertTrue(!cache.exists("/one/two"));
        assertEquals(MethodDeclarations.optimisticPrepareMethod, dummy.getCalled());




        MethodCall rollbackMethod = MethodCallFactory.create(MethodDeclarations.rollbackMethod, new Object[]{gtx});
        try
        {
            cache._replicate(rollbackMethod);
        }
        catch (Throwable t)
        {
            fail();
        }
        assertEquals(3, entry.getLocks().size());
        for (Iterator it = entry.getLocks().iterator(); it.hasNext();)
        {
            IdentityLock lock = (IdentityLock) it.next();
            assertEquals(false, lock.isLocked());


        }
        //make sure the nodes and locks are the same order
        int i = 0;
        for (Iterator it = workspace.getNodes().values().iterator(); it.hasNext();)

View Full Code Here


   private void removeLocksForDeadMembers(DataNode node,
                                          Vector deadMembers)
   {
      Set deadOwners = new HashSet();
      IdentityLock lock = node.getLock();
      Object owner = lock.getWriterOwner();


      if (isLockOwnerDead(owner, deadMembers))
      {
         deadOwners.add(owner);
      }


      Iterator iter = lock.getReaderOwners().iterator();
      while (iter.hasNext())
      {
         owner = iter.next();
         if (isLockOwnerDead(owner, deadMembers))
         {

View Full Code Here

   }


   private synchronized void initLock()
   {
      if (lock_ == null)
         lock_ = new IdentityLock(cache, fqn);
   }

View Full Code Here

0 1 2

TOP

Related Classes of org.jboss.cache.lock.IdentityLock

EDU.oswego.cs.dl.util.concurrent.Sync

org.jboss.cache.interceptors.UnlockInterceptor

org.jboss.cache.Node

org.jboss.cache.optimistic.LockReportInterceptor

org.jboss.cache.optimistic.OpLockingInterceptorTest

org.jboss.cache.PessimisticUnversionedNode

org.jboss.cache.transaction.TransactionTest

org.jboss.cache.TransactionEntry

org.jboss.cache.TreeCache

org.jboss.cache.UnversionedNode

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.