Searched refs:permits (Results 1 - 6 of 6) sorted by relevance
/libcore/luni/src/main/java/java/util/concurrent/ |
H A D | Semaphore.java | 14 * permits. Each {@link #acquire} blocks if necessary until a permit is 82 * available, or zero permits available. When used in this way, the 91 * guarantees about the order in which threads acquire permits. In 97 * #acquire() acquire} methods are selected to obtain permits in the order in 105 * honor the fairness setting, but will take any permits that are 116 * permits at a time. These methods are generally more efficient and 119 * thread B invokes {@code s.acquire(2)}, and two permits become 140 * to represent permits. Subclassed into fair and nonfair 146 Sync(int permits) { argument 147 setState(permits); 201 NonfairSync(int permits) argument 216 FairSync(int permits) argument 241 Semaphore(int permits) argument 256 Semaphore(int permits, boolean fair) argument 444 acquire(int permits) argument 473 acquireUninterruptibly(int permits) argument 505 tryAcquire(int permits) argument 560 tryAcquire(int permits, long timeout, TimeUnit unit) argument 588 release(int permits) argument [all...] |
/libcore/ojluni/src/main/java/java/security/ |
H A D | AlgorithmConstraints.java | 69 public boolean permits(Set<CryptoPrimitive> primitives, method in interface:AlgorithmConstraints 87 public boolean permits(Set<CryptoPrimitive> primitives, Key key); method in interface:AlgorithmConstraints 105 public boolean permits(Set<CryptoPrimitive> primitives, method in interface:AlgorithmConstraints
|
/libcore/jsr166-tests/src/test/java/jsr166/ |
H A D | SemaphoreTest.java | 36 PublicSemaphore(int permits) { super(permits); } argument 37 PublicSemaphore(int permits, boolean fair) { super(permits, fair); } argument 107 void acquire(Semaphore s, int permits) throws InterruptedException { 108 s.acquire(permits); 117 void acquire(Semaphore s, int permits) { 118 s.acquireUninterruptibly(permits); 127 void acquire(Semaphore s, int permits) { 128 assertTrue(s.tryAcquire(permits)); 149 acquire(Semaphore s, int permits) argument [all...] |
/libcore/ojluni/src/main/java/sun/security/provider/certpath/ |
H A D | AlgorithmChecker.java | 197 if (!constraints.permits( 241 if (!constraints.permits(primitives, currPubKey)) { 252 if (!constraints.permits( 357 if (!certPathDefaultConstraints.permits(
|
/libcore/ojluni/src/main/java/sun/security/util/ |
H A D | DisabledAlgorithmConstraints.java | 88 final public boolean permits(Set<CryptoPrimitive> primitives, method in class:DisabledAlgorithmConstraints 128 final public boolean permits(Set<CryptoPrimitive> primitives, Key key) { method in class:DisabledAlgorithmConstraints 133 final public boolean permits(Set<CryptoPrimitive> primitives, method in class:DisabledAlgorithmConstraints 246 if (!permits(primitives, algorithm, parameters)) { 252 if (!permits(primitives, key.getAlgorithm(), null)) {
|
/libcore/ojluni/src/main/java/java/util/stream/ |
H A D | StreamSpliterators.java | 909 private final AtomicLong permits; field in class:StreamSpliterators.UnorderedSliceSpliterator 915 this.permits = new AtomicLong(limit >= 0 ? skip + limit : skip); 922 this.permits = parent.permits; 943 // permits never increase, and don't decrease below zero 946 remainingPermits = permits.get(); 951 !permits.compareAndSet(remainingPermits, remainingPermits - grabbing)); 963 /** Call to check if permits might be available before acquiring data */ 965 if (permits.get() > 0) 972 // Stop splitting when there are no more limit permits [all...] |
Completed in 117 milliseconds