| /external/elfutils/libelf/ |
| elf_readall.c | 73 locks for all of them. */
109 /* Free the locks on the children. */
|
| /external/kernel-headers/original/linux/ |
| rwsem.h | 66 * lock instance multiple times), but multiple locks of the
67 * same lock class might be taken, if the order of the locks
|
| /development/pdk/docs/porting/ |
| power_management.jd | 9 <a href="#androidPowerWakeLocks">Wake Locks</a><br/><div style="padding-left:40px">
11 <a href="#androidPowerWakeLocksDefinitions">Types of Wake Locks</a><br/>
21 <p>Android requires that applications and services request CPU resources with "wake locks" through the Android application framework and native Linux libraries. If there are no active wake locks, Android will shut down the CPU. </p>
29 <a name="androidPowerWakeLocks"></a><h2>Wake Locks</h2>
31 <p>Wake locks are used by applications and services to request CPU resources.</p>
42 <li> The Keypad driver receives an interrupt, locks the keypad-scan wakelock,
46 <li>The input-event driver sees the key change, enqueues an event, and locks
50 <li>The user-space input-event thread returns from select/poll, locks the
98 <a name="androidPowerWakeLocksDefinitions"></a><h3>Types of Wake Locks</h3
[all...] |
| /dalvik/libcore/concurrent/src/main/java/java/util/concurrent/locks/ |
| 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...] |
| 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}
|
| 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
|
| 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
465 * but for <em>fair</em> locks favors those threads that have bee
[all...] |
| /external/kernel-headers/original/asm-arm/ |
| spinlock.h | 85 * Write locks are easy - we just set bit 31. When unlocking, we can
149 * Read locks are a bit more hairy:
156 * Unlocking is similarly hairy. We may have multiple read locks
158 * locks.
|
| semaphore.h | 13 #include <asm/locks.h>
|
| /external/webkit/JavaScriptCore/wtf/ |
| CONTRIBUTORS.pthreads-win32 | 21 implementation of spin locks and barriers;
55 First implementation of read-write locks.
81 Re-implemented and improved read-write locks;
137 implementation of MCS (Mellor-Crummey/Scott) locks
|
| /frameworks/base/docs/html/sdk/api_diff/4/changes/ |
| java.util.concurrent.locks.AbstractQueuedSynchronizer.html | 10 java.util.concurrent.locks.AbstractQueuedSynchronizer
74 Class java.util.concurrent.locks.<A HREF="../../../../reference/java/util/concurrent/locks/AbstractQueuedSynchronizer.html" target="_top"><font size="+2"><code>AbstractQueuedSynchronizer</code></font></A>
76 <p><font xsize="+1">The superclass changed from <code>java.lang.Object</code> to <code>java.util.concurrent.locks.AbstractOwnableSynchronizer</code>.<br></font>
|
| pkg_java.util.concurrent.locks.html | 10 java.util.concurrent.locks
74 Package <A HREF="../../../../reference/java/util/concurrent/locks/package-summary.html" target="_top"><font size="+1"><code>java.util.concurrent.locks</code></font></A>
85 <nobr><A HREF="java.util.concurrent.locks.AbstractQueuedSynchronizer.html">AbstractQueuedSynchronizer</A></nobr>
|
| /frameworks/base/docs/html/sdk/api_diff/5/changes/ |
| pkg_java.util.concurrent.locks.html | 10 java.util.concurrent.locks
74 Package <A HREF="../../../../reference/java/util/concurrent/locks/package-summary.html" target="_top"><font size="+1"><code>java.util.concurrent.locks</code></font></A>
85 <nobr><A HREF="../../../../reference/java/util/concurrent/locks/AbstractOwnableSynchronizer.html" target="_top"><code>AbstractOwnableSynchronizer</code></A></nobr>
|
| /external/clearsilver/util/ |
| skiplist.c | 32 UINT32 locks; /* count of locks on value */ member in struct:skipItem
92 x->locks++;
119 cWait(&list->flush, &list->read); /* wait until reader locks released */
158 (*item)->locks = 0;
187 if(force || (! y->locks)) { /* check if value currently locked */
225 readBlock(list); /* acquire all read locks */
274 else { /* didn't find item, don't allow locks */
298 else { /* no next item, don't allow locks */
315 x->locks--
[all...] |
| /dalvik/vm/ |
| Sync.h | 23 * Monitor shape field. Used to distinguish immediate thin locks from
24 * indirecting fat locks.
|
| /external/webkit/JavaScriptCore/runtime/ |
| JSLock.h | 40 // release all locks held by your thread. This is safe to do if
42 // reacquire the right number of locks at the end. You can do this
|
| JSLock.cpp | 148 // and drop locks allowing another thread to enter. Should another thread, or the
150 // again through a callback, then the locks will not be dropped when DropAllLocks
152 // the locks, only it will re able to re-enter JSC (either be returning from the
189 // It is necessary to drop even "unreal" locks, because having a non-zero lock count
|
| /external/kernel-headers/original/asm-generic/ |
| resource.h | 41 #define RLIMIT_LOCKS 10 /* maximum file locks held */
|
| /dalvik/libcore/luni-kernel/src/main/java/org/apache/harmony/kernel/vm/ |
| LangAccess.java | 87 * <p>See {@link java.util.concurrent.locks.LockSupport} for more
103 * <p>See {@link java.util.concurrent.locks.LockSupport} for more
122 * <p>See {@link java.util.concurrent.locks.LockSupport} for more
|
| /external/apache-http/src/org/apache/http/client/methods/ |
| HttpRequestBase.java | 36 import java.util.concurrent.locks.Lock;
37 import java.util.concurrent.locks.ReentrantLock;
152 // their own locks that may be used while calling
|
| /external/kernel-headers/original/asm-x86/ |
| spinlock_32.h | 136 * can "mix" irq-safe locks - any writer needs to get a
138 * read-locks.
140 * On x86, we implement read-write locks as a 32-bit counter
|
| mc146818rtc_32.h | 26 * not, it locks normally.
|
| /dalvik/libcore/concurrent/src/test/java/tests/api/java/util/concurrent/ |
| LockSupportTest.java | 14 import java.util.concurrent.locks.*;
|
| /development/host/windows/usb/legacy/driver/ |
| sources.inc | 64 Otherwise we may want to add /SECTION:.rsrc,X option that locks section in memory
|
| /external/easymock/src/org/easymock/internal/ |
| ReplayState.java | 20 import java.util.concurrent.locks.ReentrantLock;
|
