HomeSort by relevance Sort by last modified time
    Searched refs:locks (Results 101 - 125 of 651) sorted by null

1 2 3 45 6 7 8 91011>>

  /packages/apps/Camera2/src/com/android/camera/processing/
ProcessingService.java 41 import java.util.concurrent.locks.Lock;
42 import java.util.concurrent.locks.ReentrantLock;
  /prebuilts/go/darwin-x86/src/cmd/vet/
copylock.go 5 // This file contains the code to check that locks are not passed by value.
19 "check that locks are not passed by value",
119 // are locks.
145 // any of the range variables are locks.
  /prebuilts/go/linux-x86/src/cmd/vet/
copylock.go 5 // This file contains the code to check that locks are not passed by value.
19 "check that locks are not passed by value",
119 // are locks.
145 // any of the range variables are locks.
  /prebuilts/jdk/jdk8/darwin-x86/sample/scripting/scriptpad/src/resources/
conc.js 49 var Lock = java.util.concurrent.locks.ReentrantLock;
50 var RWLock = java.util.concurrent.locks.ReentrantReadWriteLock;
  /prebuilts/jdk/jdk8/linux-x86/sample/scripting/scriptpad/src/resources/
conc.js 49 var Lock = java.util.concurrent.locks.ReentrantLock;
50 var RWLock = java.util.concurrent.locks.ReentrantReadWriteLock;
  /toolchain/binutils/binutils-2.27/gold/
dirsearch.cc 181 locks(gold::Task_locker*);
203 // Return the locks to hold. We use a blocker lock to prevent file
207 Dir_cache_task::locks(gold::Task_locker* tl) function in class:__anon4440::Dir_cache_task
workqueue.cc 303 // Get the locks for the task. This must be called while we are
305 t->locks(&tl);
340 // Release the locks for the task. This must be done with the
347 // If we have another Task to run, get the Locks. This must
352 next->locks(&tl);
441 // Release the locks associated with a Task. Return the first
  /tools/tradefederation/core/src/com/android/tradefed/util/
ConditionPriorityBlockingQueue.java 27 import java.util.concurrent.locks.Condition;
28 import java.util.concurrent.locks.ReentrantLock;
  /external/guava/guava-tests/test/com/google/common/util/concurrent/
CycleDetectingLockFactoryTest.java 28 import java.util.concurrent.locks.Lock;
29 import java.util.concurrent.locks.ReentrantLock;
30 import java.util.concurrent.locks.ReentrantReadWriteLock;
  /external/toybox/toys/pending/
lsof.c 42 char *name, fd[8], rw, locks, type[10], device[32], size_off[32], node[32]; member in struct:file_info
77 fi->fd, fi->rw, fi->locks, fi->type, fi->device, fi->size_off,
300 fi->rw = fi->locks = ' ';
  /prebuilts/go/darwin-x86/src/runtime/
mgcsweep.go 82 // increment locks to ensure that the goroutine is not preempted
84 _g_.m.locks++
86 _g_.m.locks--
129 _g_.m.locks--
154 if _g_.m.locks == 0 && _g_.m.mallocing == 0 && _g_ != _g_.m.g0 {
183 if _g_.m.locks == 0 && _g_.m.mallocing == 0 && _g_ != _g_.m.g0 {
mcache.go 110 _g_.m.locks++
133 _g_.m.locks--
  /prebuilts/go/linux-x86/src/runtime/
mgcsweep.go 82 // increment locks to ensure that the goroutine is not preempted
84 _g_.m.locks++
86 _g_.m.locks--
129 _g_.m.locks--
154 if _g_.m.locks == 0 && _g_.m.mallocing == 0 && _g_ != _g_.m.g0 {
183 if _g_.m.locks == 0 && _g_.m.mallocing == 0 && _g_ != _g_.m.g0 {
mcache.go 110 _g_.m.locks++
133 _g_.m.locks--
  /development/tools/bugreport/src/com/android/bugreport/inspector/
Inspector.java 197 * Pulls the locks out of the individual stack frames and tags the threads
198 * with which locks are being held or blocked on.
206 for (LockSnapshot lock: f.locks) {
207 final LockSnapshot prev = thread.locks.get(lock.address);
211 thread.locks.put(lock.address, lock.clone());
405 for (LockSnapshot lock: thread.locks.values()) {
  /external/guava/guava/src/com/google/common/util/concurrent/
AbstractFuture.java 26 import java.util.concurrent.locks.AbstractQueuedSynchronizer;
  /frameworks/base/core/java/com/android/internal/view/
BaseSurfaceHolder.java 28 import java.util.concurrent.locks.ReentrantLock;
  /libcore/ojluni/src/main/java/java/util/concurrent/locks/
ReentrantLock.java 36 package java.util.concurrent.locks;
57 * contention, locks favor granting access to the longest-waiting
59 * access order. Programs using fair locks accessed by many threads
62 * variances in times to obtain locks and guarantee lack of
63 * starvation. Note however, that fairness of locks does not guarantee
97 * locks: a deserialized lock is in the unlocked state, regardless of
100 * <p>This lock supports a maximum of 2147483647 recursive locks by
197 * Sync object for non-fair locks
219 * Sync object for fair locks
493 * but for <em>fair</em> locks favors those threads that have bee
    [all...]
  /libcore/ojluni/src/main/java/sun/nio/ch/
AsynchronousFileChannelImpl.java 32 import java.util.concurrent.locks.*;
  /prebuilts/go/darwin-x86/src/sync/
rwmutex.go 38 // RLock locks rw for reading.
84 // Lock locks rw for writing.
cond.go 38 // Wait locks c.L before returning. Unlike in other systems,
  /prebuilts/go/linux-x86/src/sync/
rwmutex.go 38 // RLock locks rw for reading.
84 // Lock locks rw for writing.
cond.go 38 // Wait locks c.L before returning. Unlike in other systems,
  /external/nos/host/generic/nugget/proto/nugget/app/avb/
avb.proto 62 bytes locks = 5;
163 LOCKS = 1;
  /frameworks/base/services/devicepolicy/java/com/android/server/devicepolicy/
SecurityLogMonitor.java 38 import java.util.concurrent.locks.Lock;
39 import java.util.concurrent.locks.ReentrantLock;

Completed in 416 milliseconds

1 2 3 45 6 7 8 91011>>