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

Package EDU.oswego.cs.dl.util.concurrent

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

EDU.oswego.cs.dl.util.concurrent.Semaphore
ynch available.acquire(); return getNextAvailableItem(); } public void putItem(Object x) { // no synch if (markAsUnused(x)) available.release(); } // Not a particularly efficient data structure; just for demo protected Object[] items = ... whatever kinds of items being managed protected boolean[] used = new boolean[MAX_AVAILABLE]; protected synchronized Object getNextAvailableItem() { for (int i = 0; i < MAX_AVAILABLE; ++i) { if (!used[i]) { used[i] = true; return items[i]; } } return null; // not reached } protected synchronized boolean markAsUnused(Object item) { for (int i = 0; i < MAX_AVAILABLE; ++i) { if (item == items[i]) { if (used[i]) { used[i] = false; return true; } else return false; } } return false; } }
[ Introduction to this package. ]


         // Bisocket callback client invoker doesn't share socket pools because of the danger
         // that two distinct callback servers could have the same "artifical" port.
         pool = new LinkedList();
         log.debug("Creating semaphore with size " + maxPoolSize);
         semaphore = new Semaphore(maxPoolSize);
         return;
      }


      // Client on client side.
      super.handleConnect();

View Full Code Here


         // Bisocket callback client invoker doesn't share socket pools because of the danger
         // that two distinct callback servers could have the same "artifical" port.
         pool = new LinkedList();
         log.debug("Creating semaphore with size " + maxPoolSize);
         semaphore = new Semaphore(maxPoolSize);
         return;
      }


      // Client on client side.
      super.handleConnect();

View Full Code Here

         if (pool == null)
         {
            pool = new LinkedList();
            connectionPools.put(address, pool);
            log.debug("Creating semaphore with size " + maxPoolSize);
            semaphore = new Semaphore(maxPoolSize);
            semaphores.put(address, semaphore);
            
            if (trace)
            {
               synchronized (pool)

View Full Code Here

         if (pool == null)
         {
            pool = new LinkedList();
            connectionPools.put(address, pool);
            log.debug("Creating semaphore with size " + maxPoolSize);
            semaphore = new Semaphore(maxPoolSize);
            semaphores.put(address, semaphore);
            
            if (trace)
            {
               synchronized (pool)

View Full Code Here

/*     */ 
/*     */       }
/*     */ 
/* 308 */       this.pool = new LinkedList();
/* 309 */       log.debug("Creating semaphore with size " + this.maxPoolSize);
/* 310 */       this.semaphore = new Semaphore(this.maxPoolSize);
/* 311 */       return;
/*     */     }
/*     */ 
/* 315 */     super.handleConnect();
/*     */   }

View Full Code Here

/* 731 */       if (this.pool == null)
/*     */       {
/* 733 */         this.pool = new LinkedList();
/* 734 */         connectionPools.put(this.address, this.pool);
/* 735 */         log.debug("Creating semaphore with size " + this.maxPoolSize);
/* 736 */         this.semaphore = new Semaphore(this.maxPoolSize);
/* 737 */         semaphores.put(this.address, this.semaphore);
/*     */ 
/* 739 */         if (trace)
/*     */         {
/* 741 */           synchronized (this.pool)

View Full Code Here

/*      */ 
/*      */ class SemRNG extends SyncDelegatedRNG
/*      */ {
/*      */   public SemRNG()
/*      */   {
/* 1955 */     super(new Semaphore(1L));
/*      */   }

View Full Code Here

/*      */ class LockedSemRNG extends ExecutorRNG
/*      */ {
/*      */   public LockedSemRNG()
/*      */   {
/* 2188 */     setDelegate(new NoSynchRNG());
/* 2189 */     setExecutor(new LockedExecutor(new Semaphore(1L)));
/*      */   }

View Full Code Here

        nodeInfo = aNodeInfo;
        threadPool = aThreadPool; 
        clockPool = aClockPool;
        
        replacerResolver = new MsgReplacerResolver();
        topologyMonitor = new Semaphore(1);
        endPointView = new NodeEndPointViewImpl();
        
        streamManager = newStreamManager();
        referenceableManager = newReferenceableManager();
        endPointProxyFactory = newEndPointProxyFactory();

View Full Code Here


         // Bisocket callback client invoker doesn't share socket pools because of the danger
         // that two distinct callback servers could have the same "artifical" port.
         pool = new LinkedList();
         log.debug("Creating semaphore with size " + maxPoolSize);
         semaphore = new Semaphore(maxPoolSize);
         return;
      }


      // Client on client side.
      super.handleConnect();

View Full Code Here

0 1 2 3 4

TOP

Related Classes of EDU.oswego.cs.dl.util.concurrent.Semaphore

EDU.oswego.cs.dl.util.concurrent.misc.LockedSemRNG

EDU.oswego.cs.dl.util.concurrent.misc.SemRNG

org.activemq.store.journal.JournalBrokerBenchmark

org.activemq.store.journal.JournalStoreBenchmark

org.apache.geronimo.messaging.NodeImpl

org.codehaus.activemq.store.journal.JournalBrokerBenchmark

org.codehaus.activemq.store.journal.JournalStoreBenchmark

org.jboss.cache.aop.SharedRefConcurrentTest

org.jboss.cache.aop.statetransfer.StateTransferAopTestBase

org.jboss.cache.statetransfer.VersionedTestBase

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.