/libcore/ojluni/src/main/java/java/util/concurrent/locks/ |
package-info.java | 40 * locks and conditions, at the expense of more awkward syntax. 42 * <p>The {@link java.util.concurrent.locks.Lock} interface supports 46 * is {@link java.util.concurrent.locks.ReentrantLock}. 48 * <p>The {@link java.util.concurrent.locks.ReadWriteLock} interface 49 * similarly defines locks that may be shared among readers but are 51 * java.util.concurrent.locks.ReentrantReadWriteLock}, is provided, since 55 * <p>The {@link java.util.concurrent.locks.Condition} interface 56 * describes condition variables that may be associated with Locks. 64 * <p>The {@link java.util.concurrent.locks.AbstractQueuedSynchronizer} 65 * class serves as a useful superclass for defining locks and othe [all...] |
ReadWriteLock.java | 36 package java.util.concurrent.locks; 40 * Lock locks}, one for read-only operations and one for writing. 100 * <li>Determining whether the locks are reentrant: can a thread with the
|
AbstractOwnableSynchronizer.java | 36 package java.util.concurrent.locks; 40 * class provides a basis for creating locks and related synchronizers
|
Condition.java | 36 package java.util.concurrent.locks;
|
Lock.java | 36 package java.util.concurrent.locks; 51 * acquired first. However, some locks may allow concurrent access to 57 * when multiple locks are acquired they must be released in the opposite 58 * order, and all locks must be released in the same lexical scope in which 62 * and statements makes it much easier to program with monitor locks, 63 * and helps avoid many common programming errors involving locks, 64 * there are occasions where you need to work with locks in a more 72 * and allowing multiple locks to be acquired and released in any 77 * automatic release of locks that occurs with {@code synchronized}
|
/prebuilts/go/darwin-x86/test/ |
locklinear.go | 7 // Test that locks don't go quadratic due to runtime hash table collisions. 95 locks := make([]sync.RWMutex, offset+1) 98 locks[0].Lock() 106 locks[1].Lock() 107 locks[offset].Lock() 108 locks[1].Unlock() 110 locks[offset].Unlock() 115 locks[1].Lock() 116 locks[offset].Lock() 117 locks[1].Unlock( [all...] |
/prebuilts/go/linux-x86/test/ |
locklinear.go | 7 // Test that locks don't go quadratic due to runtime hash table collisions. 95 locks := make([]sync.RWMutex, offset+1) 98 locks[0].Lock() 106 locks[1].Lock() 107 locks[offset].Lock() 108 locks[1].Unlock() 110 locks[offset].Unlock() 115 locks[1].Lock() 116 locks[offset].Lock() 117 locks[1].Unlock( [all...] |
/external/guava/guava-tests/benchmark/com/google/common/util/concurrent/ |
CycleDetectingLockFactoryBenchmark.java | 23 import java.util.concurrent.locks.Lock; 24 import java.util.concurrent.locks.ReentrantLock; 76 private void lockAndUnlockNested(Lock[] locks, int reps) { 78 for (int j = 0; j < locks.length; j++) { 79 locks[j].lock(); 81 for (int j = locks.length - 1; j >= 0; j--) { 82 locks[j].unlock();
|
/external/valgrind/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) {
|
/development/tools/bugreport/src/com/android/bugreport/stacks/ |
JavaStackFrameSnapshot.java | 37 public ArrayList<LockSnapshot> locks = new ArrayList<LockSnapshot>(); field in class:JavaStackFrameSnapshot 51 final int N = that.locks.size(); 53 this.locks.add(that.locks.get(i).clone());
|
/art/test/004-ThreadStress/ |
run | 21 # Run locks-only mode with stack-dump lock profiling. Reduce the number of total operations from 24 "${@}" Main --locks-only -o 100
|
/frameworks/support/lifecycle/integration-tests/testapp/src/main/java/androidx/lifecycle/testapp/ |
NonSupportActivity.java | 25 import java.util.concurrent.locks.Condition; 26 import java.util.concurrent.locks.Lock; 27 import java.util.concurrent.locks.ReentrantLock;
|
/external/libese/apps/boot/card/src/com/android/verifiedboot/storage/ |
Storage.java | 64 /* lockStorage can be backed up directly, as long as the locks themselves have been 68 private LockInterface[] locks; field in class:Storage 73 // Indices into locks[]. 139 // Initialize all supported locks here. 140 locks = new LockInterface[4]; 143 locks[LOCK_CARRIER] = new CarrierLock(); 145 locks[LOCK_CARRIER]); 149 locks[LOCK_DEVICE] = new BasicLock(NO_METADATA, NO_REQ_LOCKS); 150 BasicLock lockRef = (BasicLock)locks[LOCK_DEVICE]; 156 // locks are clear and then, only in the bootloader/fastboot [all...] |
/external/tensorflow/tensorflow/core/kernels/ |
training_op_helpers.cc | 42 std::vector<mutex_lock> locks; local 44 return locks; 62 locks.emplace_back(*mu); 65 return locks;
|
/toolchain/binutils/binutils-2.27/gold/ |
common.h | 49 locks(Task_locker*);
|
/cts/tests/app/app/src/android/app/stubs/ |
KeyboardShortcutsActivity.java | 25 import java.util.concurrent.locks.Condition; 26 import java.util.concurrent.locks.Lock; 27 import java.util.concurrent.locks.ReentrantLock;
|
/device/linaro/bootloader/arm-trusted-firmware/lib/psci/ |
psci_lib.mk | 12 lib/locks/exclusive/${ARCH}/spinlock.S \ 28 PSCI_LIB_SOURCES += lib/locks/bakery/bakery_lock_coherent.c 30 PSCI_LIB_SOURCES += lib/locks/bakery/bakery_lock_normal.c
|
/external/mockito/src/main/java/org/mockito/internal/matchers/ |
CapturingMatcher.java | 14 import java.util.concurrent.locks.Lock; 15 import java.util.concurrent.locks.ReadWriteLock; 16 import java.util.concurrent.locks.ReentrantReadWriteLock;
|
/packages/apps/QuickSearchBox/src/com/android/quicksearchbox/util/ |
BarrierConsumer.java | 20 import java.util.concurrent.locks.Condition; 21 import java.util.concurrent.locks.Lock; 22 import java.util.concurrent.locks.ReentrantLock;
|
/external/nos/test/system-test-harness/src/ |
avb_tests.cc | 119 uint8_t locks[4]; local 130 code = Reset(client.get(), ResetRequest::LOCKS, NULL, 0); 133 GetState(client.get(), &bootloader, &production, locks); 136 EXPECT_EQ(locks[BOOT], 0x00); 137 EXPECT_EQ(locks[CARRIER], 0x00); 138 EXPECT_EQ(locks[DEVICE], 0x00); 139 EXPECT_EQ(locks[OWNER], 0x00); 344 uint8_t locks[4]; local 353 GetState(client.get(), NULL, NULL, locks); 354 ASSERT_EQ(locks[CARRIER], 0x12) 405 uint8_t locks[4]; local 450 uint8_t locks[4]; local 553 uint8_t locks[4]; local 611 uint8_t locks[4]; local 691 uint8_t locks[4]; local 887 uint8_t locks[4]; local [all...] |
/external/guava/guava/src/com/google/common/util/concurrent/ |
Striped.java | 40 import java.util.concurrent.locks.Lock; 41 import java.util.concurrent.locks.ReadWriteLock; 42 import java.util.concurrent.locks.ReentrantLock; 43 import java.util.concurrent.locks.ReentrantReadWriteLock; 48 * semaphores and read-write locks. Conceptually, lock striping is the technique of dividing a lock 67 * {@code Striped<ReadWriteLock>}. <i>Strong</i> means that all stripes (locks/semaphores) are 69 * <i>Weak</i> means that locks/semaphores are created lazily, and they are allowed to be reclaimed 71 * Striped<Lock>} of many locks, but worries that in most cases only a small portion of these 81 * instead of possibly thousands of locks which could be created in a {@code Map<K, Lock>} 172 * Iterable<Lock> locks = stripedLock.bulkGet(keys) [all...] |
/external/nos/test/system-test-harness/tools/ |
avb_tools.cc | 50 bool *production, uint8_t *locks) { 63 auto response_locks = response.locks(); 64 if (locks != NULL) { 66 locks[i] = response_locks[i]; 147 uint8_t locks[4]; local 148 GetState(client, &bootloader, &production, locks);
|
/art/test/168-vmstack-annotated/src/ |
Main.java | 29 List<Object> locks; field in class:Main.Runner 32 public Runner(List<Object> locks, List<CyclicBarrier> barriers) { 33 this.locks = locks; 39 step(locks, barriers); 196 private static void assertLocks(Object fromTrace, Object... locks) throws Exception { 200 (locks == null) ? null : (locks.length == 0 ? null : locks));
|
/art/test/980-redefine-object/src-ex/ |
TestWatcher.java | 19 import java.util.concurrent.locks.ReentrantLock;
|
/device/linaro/bootloader/arm-trusted-firmware/bl2/ |
bl2.mk | 10 lib/locks/exclusive/${ARCH}/spinlock.S \
|