| /libcore/luni/src/main/java/java/util/concurrent/ |
| Semaphore.java | 20 * <p>Semaphores are often used to restrict the number of threads than can
93 * guarantees about the order in which threads acquire permits. In
97 * the head of the queue of waiting threads. When fairness is set true, the
98 * semaphore guarantees that threads invoking any of the {@link
328 * other threads are currently waiting.
392 * one. If any threads are trying to acquire a permit, then one is
434 * assigned to other threads trying to acquire permits, as if
489 * not other threads are currently waiting. This
538 * assigned to other threads trying to acquire permits, as if
544 * thread, are instead assigned to other threads trying to acquir
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/locks/ |
| ReadWriteLock.java | 13 * multiple reader threads, so long as there are no writers. The
27 * number of threads can concurrently read the data (hence <em>reader</em>
28 * threads).
39 * threads that will try to read or write the data at the same time.
49 * all threads through a small section of code. Ultimately, only profiling
|
| /external/valgrind/main/drd/docs/ |
| drd-manual.xml | 56 Locking. Data that is shared over threads is protected from concurrent
57 accesses via locking. E.g. the POSIX threads library, the Qt library
63 Message passing. No data is shared between threads, but threads exchange
85 threads is updated via transactions. After each transaction it is
99 threads primitives. DRD however does not support programs that use
108 <title>POSIX Threads Programming Model</title>
111 POSIX threads, also known as Pthreads, is the most widely available
116 The POSIX threads programming model is based on the following abstractions:
120 A shared address space. All threads running within the sam
[all...] |
| /external/chromium/base/synchronization/ |
| condition_variable_win.cc | 29 // There are threads of execution still in this->TimedWait() and yet the
32 // was not willing to wait for all the threads to terminate. Such hasty
38 Broadcast(); // Make sure all waiting threads have been signaled.
39 Sleep(10); // Give threads a chance to grab internal_lock_.
40 // All contained threads should be blocked on user_lock_ by now :-).
73 // Broadcast() is guaranteed to signal all threads that were waiting (i.e., had
91 // Signal() will select one of the waiting threads, and signal it (signal its
110 // objects as there are threads simultaneously using this instance's Wait()
130 // recycles it for use in future Wait() calls for this or other threads.
157 // threads to do the extraction. The iterator that identifies this extractabl
[all...] |
| /external/dbus/dbus/ |
| dbus-threads.c | 2 /* dbus-threads.h D-Bus threads handling
24 #include "dbus-threads.h"
26 #include "dbus-threads-internal.h"
55 * Functions and macros related to threads and thread locks.
62 * or creates a no-op mutex if threads are not initialized.
63 * May return #NULL even if threads are initialized, indicating
84 * can initialize threads even after the D-Bus API has been used.
175 * if threads are not initialized. May return #NULL even if
176 * threads are initialized, indicating out-of-memory
[all...] |
| /external/bluetooth/glib/glib/ |
| gasyncqueue.h | 40 /* Asyncronous Queues, can be used to communicate between threads */
99 /* Return the length of the queue. Negative values mean that threads
102 * the number of waiting threads, g_async_queue_length == 0 could also
|
| /external/bluetooth/glib/tests/ |
| asyncqueue-test.c | 147 PRINT_MSG (("creating thread pool with max threads:%d, max unused threads:%d...",
159 PRINT_MSG (("creating threads..."));
|
| slice-test.c | 275 GThread **threads; local
280 g_print ("Starting %d threads allocating random blocks <= %u bytes with seed=%s using %s%s\n", n_threads, prime_size, strseed, mode, emode);
282 threads = g_alloca (sizeof(GThread*) * n_threads);
285 threads[i] = g_thread_create_full (test_sliced_mem_thread, seedp, 0, TRUE, FALSE, 0, NULL);
290 threads[i] = g_thread_create_full (test_memchunk_thread, seedp, 0, TRUE, FALSE, 0, NULL);
293 g_thread_join (threads[i]);
|
| /external/chromium/base/threading/ |
| simple_thread_unittest.cc | 56 // have all threads outstanding until we hit our expected thread pool size.
156 // We can reuse our pool. Verify that all 10 threads can actually run in
157 // parallel, so this test will only pass if there are actually 10 threads.
|
| thread_local_unittest.cc | 66 // In this test, we start 2 threads which will access a ThreadLocalPointer. We
67 // make sure the default is NULL, and the pointers are unique to the threads.
85 // Check that both threads defaulted to NULL.
|
| thread_restrictions.h | 13 // Certain behavior is disallowed on certain threads. ThreadRestrictions helps
23 // By default, threads *are* allowed to make IO calls.
70 // Threads start out in the *allowed* state.
|
| /external/chromium/chrome/browser/net/ |
| proxy_service_factory.cc | 68 size_t num_pac_threads = 0u; // Use default number of threads.
71 // threads to use.
80 LOG(ERROR) << "Invalid switch for number of PAC threads: " << s;
|
| /external/linux-tools-perf/util/ |
| thread.c | 66 struct rb_node **p = &self->threads.rb_node;
96 rb_insert_color(&th->rb_node, &self->threads);
133 for (nd = rb_first(&self->threads); nd; nd = rb_next(nd)) {
|
| /external/protobuf/src/google/protobuf/ |
| package_info.h | 50 // from multiple threads simultaneously as long as the object is declared
51 // const in all threads (or, it is only used in ways that would be allowed
56 // Put simply, read-only access to an object can happen in multiple threads
|
| /external/v8/src/ |
| v8threads.h | 140 // multiple running V8 threads. Generally it is necessary to call
142 // JavaScript can take full control of V8 and not allow other threads to run.
148 // Stop sending preemption requests to threads.
|
| /external/valgrind/main/none/tests/ |
| thread-exits.c | 19 attempts to grow the stack once all the threads have been created
63 /* Create lots of threads */
64 printf("creating threads...\n");
|
| /frameworks/base/core/java/android/os/ |
| ConditionVariable.java | 56 * Open the condition, and release all threads that are blocked.
59 * Any threads that later approach block() will not block unless close()
77 * Any threads that call block() will block until someone calls open.
|
| /frameworks/base/core/tests/coretests/src/android/database/ |
| DatabaseLockTest.java | 63 * testLockFairness() tests the fairness of prioritizing multiple threads
65 * This test is intended to verify that, when two threads are accessing the
115 * This test is intended to verify that, even when two threads are accessing
|
| /frameworks/base/docs/html/tools/debugging/ |
| debugging-projects.jd | 31 running threads</li>
55 <li>Threads - Shows currently running threads within a VM.</li>
|
| /libcore/dalvik/src/main/java/dalvik/system/ |
| BlockGuard.java | 28 * Mechanism to let threads set restrictions on what code is allowed
32 * operations from running on their main event loop (or "UI") threads.
71 * to remote threads/processes and reinstantiating the policy
|
| Zygote.java | 100 * fork()ing and and before spawning any threads.
102 * fork()ing and and before spawning any threads.
104 * setgroups() to after fork and before spawning any threads.
143 * fork()ing and and before spawning any threads.
145 * fork()ing and and before spawning any threads.
147 * setgroups() to after fork and before spawning any threads.
|
| /system/core/include/cutils/ |
| abort_socket.h | 26 * that socket in other threads.
30 * Call asocket_destory() *after* all threads have finished with the socket to
90 * asocket_destroy() should be used to release resources once all threads
|
| /system/core/libsync/ |
| sync_test.c | 78 pthread_t threads[4]; local
118 pthread_create(&threads[i], NULL, sync_thread, &sync_data[i]);
142 pthread_join(threads[i], &val);
|
| /external/chromium/base/metrics/ |
| stats_table.h | 6 // processes and threads, maintaining cheap statistics counters without
17 // threads/processes which can use it.
43 // max_threads is the maximum number of threads the table will support.
65 // All threads that contribute data to the table must register with the
78 // Returns the number of threads currently registered. This is really not
117 // The maxinum number of threads/columns in the table.
|
| /external/chromium-trace/src/tracing/ |
| timeline_model.js | 10 * tokens are converted into a hierarchy of processes, threads,
77 * itself and so is only associated with Threads at its start and end point.
219 * Comparison between threads that orders first by pid,
331 this.threads = {};
338 for (var p in this.threads) {
349 for (var tid in this.threads)
350 this.threads[tid].shiftTimestampsForward(amount);
360 if (!this.threads[tid])
361 this.threads[tid] = new TimelineThread(this, tid);
362 return this.threads[tid]
[all...] |
