Searched defs:locks (Results 1 - 11 of 11) sorted by relevance
/libcore/luni/src/main/java/java/util/concurrent/locks/ |
H A D | package-info.java | 11 * locks and conditions, at the expense of more awkward syntax. 13 * <p>The {@link java.util.concurrent.locks.Lock} interface supports 17 * is {@link java.util.concurrent.locks.ReentrantLock}. 19 * <p>The {@link java.util.concurrent.locks.ReadWriteLock} interface 20 * similarly defines locks that may be shared among readers but are 22 * java.util.concurrent.locks.ReentrantReadWriteLock}, is provided, since 26 * <p>The {@link java.util.concurrent.locks.Condition} interface 35 * <p>The {@link java.util.concurrent.locks.AbstractQueuedSynchronizer} 36 * class serves as a useful superclass for defining locks and other 38 * java.util.concurrent.locks [all...] |
H A D | ReadWriteLock.java | 7 package java.util.concurrent.locks; 11 * Lock locks}, one for read-only operations and one for writing. 71 * <li>Determining whether the locks are reentrant: can a thread with the
|
H A D | AbstractOwnableSynchronizer.java | 7 package java.util.concurrent.locks; 11 * class provides a basis for creating locks and related synchronizers
|
H A D | Condition.java | 7 package java.util.concurrent.locks;
|
H A D | Lock.java | 7 package java.util.concurrent.locks; 21 * acquired first. However, some locks may allow concurrent access to 27 * when multiple locks are acquired they must be released in the opposite 28 * order, and all locks must be released in the same lexical scope in which 32 * and statements makes it much easier to program with monitor locks, 33 * and helps avoid many common programming errors involving locks, 34 * there are occasions where you need to work with locks in a more 42 * and allowing multiple locks to be acquired and released in any 47 * automatic release of locks that occurs with {@code synchronized}
|
H A D | LockSupport.java | 7 package java.util.concurrent.locks; 12 * Basic thread blocking primitives for creating locks and other
|
H A D | ReentrantLock.java | 7 package java.util.concurrent.locks; 27 * contention, locks favor granting access to the longest-waiting 29 * access order. Programs using fair locks accessed by many threads 32 * variances in times to obtain locks and guarantee lack of 33 * starvation. Note however, that fairness of locks does not guarantee 68 * locks: a deserialized lock is in the unlocked state, regardless of 71 * <p>This lock supports a maximum of 2147483647 recursive locks by 170 * Sync object for non-fair locks 192 * Sync object for fair locks 467 * but for <em>fair</em> locks favor [all...] |
H A D | ReentrantReadWriteLock.java | 7 package java.util.concurrent.locks; 61 * write locks in the style of a {@link ReentrantLock}. Non-reentrant 62 * readers are not allowed until all write locks held by the writing 67 * when write locks are held during calls or callbacks to methods that 68 * perform reads under read locks. If a reader tries to acquire the 93 * <p>This class supports methods to determine whether locks 99 * locks: a deserialized lock is in the unlocked state, regardless of 104 * particularly tricky when handling multiple locks in a non-nested 180 * <p>This lock supports a maximum of 65535 recursive write locks 181 * and 65535 read locks [all...] |
H A D | AbstractQueuedLongSynchronizer.java | 7 package java.util.concurrent.locks; 20 * multilevel locks and barriers that require 52 * Hagersten) lock queue. CLH locks are normally used for 61 * granted locks etc though. A thread may try to acquire if it is 82 * <p>The "prev" links (not used in original CLH locks), are mainly 86 * of spin locks, see the papers by Scott and Scherer at
|
H A D | AbstractQueuedSynchronizer.java | 7 package java.util.concurrent.locks; 17 * Provides a framework for implementing blocking locks and related 37 * appropriate by concrete locks and related synchronizers to 104 * determining which threads hold locks. 281 * Hagersten) lock queue. CLH locks are normally used for 290 * granted locks etc though. A thread may try to acquire if it is 311 * <p>The "prev" links (not used in original CLH locks), are mainly 315 * of spin locks, see the papers by Scott and Scherer at
|
/libcore/luni/src/main/java/java/nio/ |
H A D | FileChannelImpl.java | 58 // The set of acquired and pending locks. 59 private final SortedSet<FileLock> locks = new TreeSet<FileLock>(LOCK_COMPARATOR); field in class:FileChannelImpl 535 for (FileLock existingLock : locks) { 537 // This, and all remaining locks, start beyond our end (so 545 locks.add(lock); 553 locks.remove(lock);
|
Completed in 1467 milliseconds