| /libcore/luni/src/main/java/java/util/concurrent/locks/ |
| 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
27 * describes condition variables that may be associated with Locks.
35 * <p>The {@link java.util.concurrent.locks.AbstractQueuedSynchronizer}
36 * class serves as a useful superclass for defining locks and othe
[all...] |
| 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
|
| UnsafeAccess.java | 17 package java.util.concurrent.locks;
|
| AbstractOwnableSynchronizer.java | 7 package java.util.concurrent.locks;
11 * class provides a basis for creating locks and related synchronizers
|
| 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}
|
| Condition.java | 7 package java.util.concurrent.locks;
|
| LockSupport.java | 7 package java.util.concurrent.locks;
13 * Basic thread blocking primitives for creating locks and other
|
| ReentrantLock.java | 7 package java.util.concurrent.locks;
28 * contention, locks favor granting access to the longest-waiting
30 * access order. Programs using fair locks accessed by many threads
33 * variances in times to obtain locks and guarantee lack of
34 * starvation. Note however, that fairness of locks does not guarantee
70 * locks: a deserialized lock is in the unlocked state, regardless of
73 * <p>This lock supports a maximum of 2147483647 recursive locks by
172 * Sync object for non-fair locks
194 * Sync object for fair locks
466 * but for <em>fair</em> locks favors those threads that have bee
[all...] |
| ReentrantReadWriteLock.java | 7 package java.util.concurrent.locks;
62 * write locks in the style of a {@link ReentrantLock}. Non-reentrant
63 * readers are not allowed until all write locks held by the writing
68 * when write locks are held during calls or callbacks to methods that
69 * perform reads under read locks. If a reader tries to acquire the
94 * <p>This class supports methods to determine whether locks
100 * locks: a deserialized lock is in the unlocked state, regardless of
105 * particularly tricky when handling multiple locks in a non-nested
181 * <p>This lock supports a maximum of 65535 recursive write locks
182 * and 65535 read locks. Attempts to exceed these limits result i
[all...] |
| AbstractQueuedLongSynchronizer.java | 7 package java.util.concurrent.locks;
21 * multilevel locks and barriers that require
53 * Hagersten) lock queue. CLH locks are normally used for
62 * granted locks etc though. A thread may try to acquire if it is
83 * <p>The "prev" links (not used in original CLH locks), are mainly
87 * of spin locks, see the papers by Scott and Scherer at
[all...] |
| /external/valgrind/main/none/tests/ |
| pth_rwlock.c | 8 #define LOCKS 2000
12 pthread_rwlock_t locks[LOCKS]; local
16 for (n = 0; n < LOCKS; n++) {
17 if ((e = pthread_rwlock_init(locks + n, NULL)) != 0) {
23 for (n = 0; n < LOCKS; n++) {
24 if ((e = pthread_rwlock_destroy(locks + n)) != 0) {
|
| /bionic/libc/kernel/common/linux/ |
| blockgroup_lock.h | 25 struct bgl_lock locks[NR_BG_LOCKS]; member in struct:blockgroup_lock
28 #define sb_bgl_lock(sb, block_group) (&(sb)->s_blockgroup_lock.locks[(block_group) & (NR_BG_LOCKS-1)].lock)
|
| /development/ndk/platforms/android-3/include/linux/ |
| blockgroup_lock.h | 25 struct bgl_lock locks[NR_BG_LOCKS]; member in struct:blockgroup_lock
28 #define sb_bgl_lock(sb, block_group) (&(sb)->s_blockgroup_lock.locks[(block_group) & (NR_BG_LOCKS-1)].lock)
|
| /external/kernel-headers/original/linux/ |
| blockgroup_lock.h | 41 struct bgl_lock locks[NR_BG_LOCKS]; member in struct:blockgroup_lock
49 spin_lock_init(&bgl->locks[i].lock);
57 (&(sb)->s_blockgroup_lock.locks[(block_group) & (NR_BG_LOCKS-1)].lock)
|
| /prebuilt/ndk/android-ndk-r4/platforms/android-3/arch-arm/usr/include/linux/ |
| blockgroup_lock.h | 25 struct bgl_lock locks[NR_BG_LOCKS]; member in struct:blockgroup_lock
28 #define sb_bgl_lock(sb, block_group) (&(sb)->s_blockgroup_lock.locks[(block_group) & (NR_BG_LOCKS-1)].lock)
|
| /prebuilt/ndk/android-ndk-r4/platforms/android-4/arch-arm/usr/include/linux/ |
| blockgroup_lock.h | 25 struct bgl_lock locks[NR_BG_LOCKS]; member in struct:blockgroup_lock
28 #define sb_bgl_lock(sb, block_group) (&(sb)->s_blockgroup_lock.locks[(block_group) & (NR_BG_LOCKS-1)].lock)
|
| /prebuilt/ndk/android-ndk-r4/platforms/android-5/arch-arm/usr/include/linux/ |
| blockgroup_lock.h | 25 struct bgl_lock locks[NR_BG_LOCKS]; member in struct:blockgroup_lock
28 #define sb_bgl_lock(sb, block_group) (&(sb)->s_blockgroup_lock.locks[(block_group) & (NR_BG_LOCKS-1)].lock)
|
| /prebuilt/ndk/android-ndk-r4/platforms/android-5/arch-x86/usr/include/linux/ |
| blockgroup_lock.h | 25 struct bgl_lock locks[NR_BG_LOCKS]; member in struct:blockgroup_lock
28 #define sb_bgl_lock(sb, block_group) (&(sb)->s_blockgroup_lock.locks[(block_group) & (NR_BG_LOCKS-1)].lock)
|
| /prebuilt/ndk/android-ndk-r4/platforms/android-8/arch-arm/usr/include/linux/ |
| blockgroup_lock.h | 25 struct bgl_lock locks[NR_BG_LOCKS]; member in struct:blockgroup_lock
28 #define sb_bgl_lock(sb, block_group) (&(sb)->s_blockgroup_lock.locks[(block_group) & (NR_BG_LOCKS-1)].lock)
|
| /prebuilt/ndk/android-ndk-r4/platforms/android-8/arch-x86/usr/include/linux/ |
| blockgroup_lock.h | 25 struct bgl_lock locks[NR_BG_LOCKS]; member in struct:blockgroup_lock
28 #define sb_bgl_lock(sb, block_group) (&(sb)->s_blockgroup_lock.locks[(block_group) & (NR_BG_LOCKS-1)].lock)
|
| /prebuilt/ndk/android-ndk-r5/platforms/android-3/arch-arm/usr/include/linux/ |
| blockgroup_lock.h | 25 struct bgl_lock locks[NR_BG_LOCKS]; member in struct:blockgroup_lock
28 #define sb_bgl_lock(sb, block_group) (&(sb)->s_blockgroup_lock.locks[(block_group) & (NR_BG_LOCKS-1)].lock)
|
| /prebuilt/ndk/android-ndk-r6/platforms/android-3/arch-arm/usr/include/linux/ |
| blockgroup_lock.h | 25 struct bgl_lock locks[NR_BG_LOCKS]; member in struct:blockgroup_lock
28 #define sb_bgl_lock(sb, block_group) (&(sb)->s_blockgroup_lock.locks[(block_group) & (NR_BG_LOCKS-1)].lock)
|
| /prebuilt/ndk/android-ndk-r6/platforms/android-3/arch-x86/usr/include/linux/ |
| blockgroup_lock.h | 25 struct bgl_lock locks[NR_BG_LOCKS]; member in struct:blockgroup_lock
28 #define sb_bgl_lock(sb, block_group) (&(sb)->s_blockgroup_lock.locks[(block_group) & (NR_BG_LOCKS-1)].lock)
|
| /external/dbus/dbus/ |
| dbus-threads.c | 55 * Functions and macros related to threads and thread locks.
139 * Locks a mutex. Does nothing if passed a #NULL pointer.
140 * Locks may be recursive if threading implementation initialized
141 * recursive locks.
246 * variable to be signalled. Locks the mutex again before
260 * to be signalled, or for a timeout. Locks the mutex again before
307 DBusMutex ***locks = data; local
313 _dbus_mutex_free (*(locks[i]));
314 *(locks[i]) = NULL;
318 dbus_free (locks);
[all...] |
| /libcore/luni/src/main/java/java/nio/ |
| 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);
|
