| /external/libpng/projects/beos/ |
| x86-shared.txt | 10 Note: As of version 1.0.10, you'll get a fair number of warnings when
|
| x86-static.txt | 10 Note: As of version 1.0.10, you'll get a fair number of warnings when
|
| /dalvik/libcore/concurrent/src/main/java/java/util/concurrent/locks/ |
| ReentrantLock.java | 30 * access order. Programs using fair locks accessed by many threads
36 * fair lock may obtain it multiple times in succession while other
87 * into fair and nonfair versions below. Uses AQS state to
100 * Performs non-fair tryLock. tryAcquire is
172 * Sync object for non-fair locks
194 * Sync object for fair locks
204 * Fair version of tryAcquire. Don't grant access unless
240 * @param fair {@code true} if this lock should use a fair ordering policy
242 public ReentrantLock(boolean fair) {
[all...] |
| ReentrantReadWriteLock.java | 25 * <dt><b><i>Non-fair mode (default)</i></b>
26 * <dd>When constructed as non-fair (the default), the order of entry
30 * will normally have higher throughput than a fair lock.
33 * <dt><b><i>Fair mode</i></b>
34 * <dd> When constructed as fair, threads contend for entry using an
41 * <p>A thread that tries to acquire a fair read lock (non-reentrantly)
50 * <p>A thread that tries to acquire a fair write lock (non-reentrantly)
54 * do not honor this fair setting and will acquire the lock if it is
210 * @param fair {@code true} if this lock should use a fair ordering polic
[all...] |
| package-info.java | 14 * locking disciplines that differ in semantics (reentrant, fair, etc),
|
| ReadWriteLock.java | 64 * expected. Fair, or "in-order" implementations are also possible.
|
| /dalvik/libcore/concurrent/src/main/java/java/util/concurrent/ |
| Semaphore.java | 111 * initialized as fair, to ensure that no thread is starved out from
113 * synchronization control, the throughput advantages of non-fair
139 * to represent permits. Subclassed into fair and nonfair
205 * Fair version
248 * @param fair {@code true} if this semaphore will guarantee
252 public Semaphore(int permits, boolean fair) {
253 sync = (fair)? new FairSync(permits) : new NonfairSync(permits);
323 * fair ordering policy, a call to {@code tryAcquire()} <em>will</em>
483 * <p>Even when this semaphore has been set to use a fair ordering
|
| ArrayBlockingQueue.java | 156 * @param fair if <tt>true</tt> then queue accesses for threads blocked
161 public ArrayBlockingQueue(int capacity, boolean fair) {
165 lock = new ReentrantLock(fair);
177 * @param fair if <tt>true</tt> then queue accesses for threads blocked
186 public ArrayBlockingQueue(int capacity, boolean fair,
188 this(capacity, fair);
|
| SynchronousQueue.java | 64 * The (Lifo) stack is used for non-fair mode, and the (Fifo)
65 * queue for fair mode. The performance of the two is generally
[all...] |
| /external/opencore/oscl/oscl/osclproc/src/ |
| oscl_scheduler_tuneables.h | 106 //This allows switching between "fair scheduling" and Symbian native scheduler
108 //We always use fair scheduling, but for testing it can be helpful to
|
| oscl_scheduler_readyq.cpp | 76 //This section allows switching between "fair scheduling" and linear
77 //behavior. We always use fair scheduling, but for testing it can be helpful to
80 //Sort by FIFO order, to create fair scheduling.
|
| /development/pdk/docs/community/ |
| groups-charter.jd | 23 <p>The most important rule is friendliness. Remember: disrespect and rudeness are not welcome in our community under any circumstances. We don't have a formal policy on dealing with troublemakers, and we hope we never need one.That said, we do pledge to do our best to be fair, and we will always try to warn someone before banning him or her.
|
| /external/dropbear/libtommath/ |
| bn_mp_n_root.c | 25 * each step involves a fair bit. This is not meant to
|
| /external/iproute2/man/man8/ |
| tc-sfq.8 | 97 M. Shreedhar and George Varghese "Efficient Fair
|
| /dalvik/libcore/concurrent/src/test/java/tests/api/java/util/concurrent/ |
| ReentrantReadWriteLockTest.java | 106 * locking an unlocked fair lock succeeds
516 * Fair Read trylock succeeds if write locked by current thread
527 * Fair Read lock succeeds if write locked by current thread even if
567 * Fair Read lock succeeds if write locked by current thread even if
607 * Fair Write lock succeeds if write locked by current thread even if
694 * Fair Read tryLock succeeds if readlocked but not writelocked
717 * Fair write tryLock fails when readlocked
[all...] |
| /development/samples/ApiDemos/src/com/example/android/apis/view/ |
| List4.java | 232 "Since the more fair and crystal is the sky," +
256 "I, that am curtail'd of this fair proportion," +
267 "To entertain these fair well-spoken days," +
|
| List6.java | 246 "Since the more fair and crystal is the sky," +
270 "I, that am curtail'd of this fair proportion," +
281 "To entertain these fair well-spoken days," +
|
| /external/apache-http/src/org/apache/http/impl/conn/tsccm/ |
| AbstractConnPool.java | 104 boolean fair = false; //@@@ check parameters to decide
105 poolLock = new ReentrantLock(fair);
|
| /development/pdk/docs/source/ |
| roles.jd | 64 <li>Be fair and unbiased while reviewing changes. Accept or reject patches
|
| /external/bluetooth/glib/gio/win32/ |
| winhttp.h | 234 * under fair use.
|
| /external/netcat/ |
| Changelog | 13 unsnarled main a fair amount
|
| /external/proguard/docs/ |
| feedback.html | 14 By now, I've invested a fair amount of time in <b>ProGuard</b>. You can help
|
| /frameworks/base/docs/html/resources/articles/ |
| ui-1.6.jd | 94 number of classes, it still requires a fair amount of code and it still
|
| /sdk/ddms/libs/ddmlib/src/com/android/ddmlib/ |
| ChunkHandler.java | 43 * activity. Because there's a fair chance we'll want to send a
|
| /external/opencore/doc/oscl_html/ |
| oscl__scheduler__tuneables_8h-source.html | 86 00089 <span class="comment">//This allows switching between "fair scheduling" and Symbian native scheduler</span>
88 00091 <span class="comment">//We always use fair scheduling, but for testing it can be helpful to</span>
|
