| /dalvik/libcore/concurrent/src/main/java/java/util/concurrent/ |
| ExecutorService.java | 16 * one or more asynchronous tasks.
19 * it to reject new tasks. Two different methods are provided for
21 * method will allow previously submitted tasks to execute before
23 * tasks from starting and attempts to stop currently executing tasks.
24 * Upon termination, an executor has no tasks actively executing, no
25 * tasks awaiting execution, and no new tasks can be submitted. An
34 * tasks and then waiting for at least one, or all, to
79 * first by calling <tt>shutdown</tt> to reject incoming tasks, and the
[all...] |
| AbstractExecutorService.java | 62 private <T> T doInvokeAny(Collection<Callable<T>> tasks,
65 if (tasks == null)
67 int ntasks = tasks.size();
75 // parallelism, check to see if previously submitted tasks are
85 Iterator<Callable<T>> it = tasks.iterator();
137 public <T> T invokeAny(Collection<Callable<T>> tasks)
140 return doInvokeAny(tasks, false, 0);
147 public <T> T invokeAny(Collection<Callable<T>> tasks,
150 return doInvokeAny(tasks, true, unit.toNanos(timeout));
153 public <T> List<Future<T>> invokeAll(Collection<Callable<T>> tasks)
[all...] |
| Executor.java | 10 * An object that executes submitted {@link Runnable} tasks. This
16 * of a set of tasks, you might use:
37 * More typically, tasks are executed in some thread other
49 * limitation on how and when tasks are scheduled. The executor below
50 * serializes the submission of tasks to a second executor,
55 * final Queue<Runnable> tasks = new ArrayDeque<Runnable>();
64 * tasks.offer(new Runnable() {
79 * if ((active = tasks.poll()) != null) {
|
| CompletionService.java | 10 * A service that decouples the production of new asynchronous tasks
11 * from the consumption of the results of completed tasks. Producers
12 * <tt>submit</tt> tasks for execution. Consumers <tt>take</tt>
13 * completed tasks and process their results in the order they
15 * manage asynchronous IO, in which tasks that perform reads are
21 * {@link Executor} to actually execute the tasks, in which case the
|
| ThreadPoolExecutor.java | 19 * asynchronous tasks, due to reduced per-task invocation overhead,
21 * including threads, consumed when executing a collection of tasks.
23 * statistics, such as the number of completed tasks.
56 * tasks. Most typically, core and maximum pool sizes are set only
63 * started only when new tasks arrive, but this can be overridden
78 * continue, but might not be able to execute any tasks. Threads
102 * submitted tasks. The use of this queue interacts with pool sizing:
124 * queue is a {@link SynchronousQueue} that hands off tasks to threads
130 * avoid rejection of new submitted tasks. This in turn admits the
136 * capacity) will cause new tasks to wait in the queue when al
1341 List<Runnable> tasks; local
[all...] |
| ScheduledThreadPoolExecutor.java | 24 * <p>Delayed tasks execute no sooner than they are enabled, but
26 * enabled, they will commence. Tasks scheduled for exactly the same
55 * tasks, even those that don't require scheduling (i.e.,
58 * delayed tasks with a delay of zero.
68 * tasks that should NOT be run after shutdown, as well as
79 * False if should cancel/suppress periodic tasks on shutdown.
84 * False if should cancel non-periodic tasks on shutdown.
124 * Period in nanoseconds for repeating tasks. A positive
250 * Main execution method for delayed or periodic tasks. If pool
291 * Cancels and clears the queue of all tasks that should not be ru
[all...] |
| /dalvik/libcore/luni/src/main/java/java/util/ |
| package.html | 7 localization, and scheduling repeated tasks.
|
| Timer.java | 26 * {@code Timer} and its associated thread. All tasks which are scheduled to run after
27 * this point are cancelled. Tasks are executed sequentially but are subject to
28 * the delays from other tasks run methods. If a specific task takes an
30 * tasks may run.
34 * scheduling tasks as its underlying implementation relies on the
40 * A {@code Timer} can be set to schedule tasks either at a fixed rate or
186 private TimerHeap tasks = new TimerHeap(); field in class:Timer.TimerImpl
213 if (tasks.isEmpty()) {
217 // no tasks scheduled -- sleep until any task appear
227 task = tasks.minimum()
[all...] |
| /sdk/anttasks/ |
| .project | 3 <name>ant-tasks</name>
|
| /bionic/libc/bionic/ |
| cpuacct.c | 40 count = snprintf(buf, sizeof(buf), "/acct/uid/%d/tasks", uid);
43 /* Note: sizeof("tasks") returns 6, which includes the NULL char */
44 buf[count - sizeof("tasks")] = 0;
48 /* Note: sizeof("tasks") returns 6, which includes the NULL char */
49 buf[count - sizeof("tasks")] = '/';
|
| /external/kernel-headers/original/linux/sunrpc/ |
| sched.h | 34 struct list_head links; /* Links to related tasks */
46 struct list_head tk_task; /* global list of tasks */
58 unsigned long tk_cookie; /* Cookie for batching tasks */
63 * action next procedure for async tasks
102 /* support walking a list of tasks on a wait queue */
111 /* .. and walking list of all tasks */
206 struct list_head tasks[RPC_NR_PRIORITY]; /* task queue for each priority level */ member in struct:rpc_wait_queue
211 unsigned char nr; /* # tasks remaining for cookie */
212 unsigned short qlen; /* total # tasks waiting in queue */
228 .tasks = {
[all...] |
| /frameworks/base/docs/html/guide/appendix/faq/ |
| index.jd | 5 <dt><a href="commontasks.html">Common Development Tasks and How To Do Them</a></dt>
6 <dd>Quick and to the point — how-to's for a variety of development tasks you are likely to use.</dd>
|
| /packages/apps/QuickSearchBox/tests/src/com/android/quicksearchbox/util/ |
| MockTask.java | 70 public static void assertRanNever(String message, MockTask... tasks) {
71 for (MockTask task : tasks) {
76 public static void assertRanOnce(String message, MockTask... tasks) {
77 for (MockTask task : tasks) {
|
| /dalvik/libcore/concurrent/src/test/java/tests/api/java/util/concurrent/ |
| ScheduledExecutorTest.java | 134 * scheduleAtFixedRate executes series of tasks at given rate
156 * scheduleWithFixedDelay executes series of tasks with given period
310 * when tasks complete
365 * getTaskCount increases, but doesn't overestimate, when tasks
473 * getQueue returns the work queue, which contains queued tasks
477 ScheduledFuture[] tasks = new ScheduledFuture[5]; local
479 tasks[i] = p1.schedule(new SmallPossiblyInterruptedRunnable(), 1, TimeUnit.MILLISECONDS);
484 assertTrue(q.contains(tasks[4]));
485 assertFalse(q.contains(tasks[0]));
498 ScheduledFuture[] tasks = new ScheduledFuture[5] local
526 ScheduledFuture[] tasks = new ScheduledFuture[5]; local
[all...] |
| ThreadPoolExecutorTest.java | 120 * when tasks complete
270 * getTaskCount increases, but doesn't overestimate, when tasks submitted
339 * getQueue returns the work queue, which contains queued tasks
344 FutureTask[] tasks = new FutureTask[5]; local
346 tasks[i] = new FutureTask(new MediumPossiblyInterruptedRunnable(), Boolean.TRUE);
347 p1.execute(tasks[i]);
353 assertFalse(wq.contains(tasks[0]));
354 assertTrue(wq.contains(tasks[4]));
356 tasks[i].cancel(true);
371 FutureTask[] tasks = new FutureTask[5] local
399 FutureTask[] tasks = new FutureTask[5]; local
775 TrackedNoOpRunnable[] tasks = new TrackedNoOpRunnable[5]; local
803 TrackedNoOpRunnable[] tasks = new TrackedNoOpRunnable[5]; local
[all...] |
| /bionic/libc/kernel/common/linux/sunrpc/ |
| sched.h | 145 struct list_head tasks[RPC_NR_PRIORITY]; member in struct:rpc_wait_queue
160 #define RPC_WAITQ_INIT(var,qname) { .lock = SPIN_LOCK_UNLOCKED, .tasks = { [0] = LIST_HEAD_INIT(var.tasks[0]), [1] = LIST_HEAD_INIT(var.tasks[1]), [2] = LIST_HEAD_INIT(var.tasks[2]), }, }
162 #define RPC_WAITQ_INIT(var,qname) { .lock = SPIN_LOCK_UNLOCKED, .tasks = { [0] = LIST_HEAD_INIT(var.tasks[0]), [1] = LIST_HEAD_INIT(var.tasks[1]), [2] = LIST_HEAD_INIT(var.tasks[2]), }, .name = qname, }
|
| /development/samples/ContactManager/ |
| _index.html | 6 <p>In most cases, you will want to ask the existing Contacts activity to handle these tasks for you,
|
| /ndk/build/platforms/android-3/arch-arm/usr/include/linux/sunrpc/ |
| sched.h | 145 struct list_head tasks[RPC_NR_PRIORITY]; member in struct:rpc_wait_queue
160 #define RPC_WAITQ_INIT(var,qname) { .lock = SPIN_LOCK_UNLOCKED, .tasks = { [0] = LIST_HEAD_INIT(var.tasks[0]), [1] = LIST_HEAD_INIT(var.tasks[1]), [2] = LIST_HEAD_INIT(var.tasks[2]), }, }
162 #define RPC_WAITQ_INIT(var,qname) { .lock = SPIN_LOCK_UNLOCKED, .tasks = { [0] = LIST_HEAD_INIT(var.tasks[0]), [1] = LIST_HEAD_INIT(var.tasks[1]), [2] = LIST_HEAD_INIT(var.tasks[2]), }, .name = qname, }
|
| /ndk/build/platforms/android-4/arch-arm/usr/include/linux/sunrpc/ |
| sched.h | 145 struct list_head tasks[RPC_NR_PRIORITY]; member in struct:rpc_wait_queue
160 #define RPC_WAITQ_INIT(var,qname) { .lock = SPIN_LOCK_UNLOCKED, .tasks = { [0] = LIST_HEAD_INIT(var.tasks[0]), [1] = LIST_HEAD_INIT(var.tasks[1]), [2] = LIST_HEAD_INIT(var.tasks[2]), }, }
162 #define RPC_WAITQ_INIT(var,qname) { .lock = SPIN_LOCK_UNLOCKED, .tasks = { [0] = LIST_HEAD_INIT(var.tasks[0]), [1] = LIST_HEAD_INIT(var.tasks[1]), [2] = LIST_HEAD_INIT(var.tasks[2]), }, .name = qname, }
|
| /ndk/build/platforms/android-5/arch-arm/usr/include/linux/sunrpc/ |
| sched.h | 145 struct list_head tasks[RPC_NR_PRIORITY]; member in struct:rpc_wait_queue
160 #define RPC_WAITQ_INIT(var,qname) { .lock = SPIN_LOCK_UNLOCKED, .tasks = { [0] = LIST_HEAD_INIT(var.tasks[0]), [1] = LIST_HEAD_INIT(var.tasks[1]), [2] = LIST_HEAD_INIT(var.tasks[2]), }, }
162 #define RPC_WAITQ_INIT(var,qname) { .lock = SPIN_LOCK_UNLOCKED, .tasks = { [0] = LIST_HEAD_INIT(var.tasks[0]), [1] = LIST_HEAD_INIT(var.tasks[1]), [2] = LIST_HEAD_INIT(var.tasks[2]), }, .name = qname, }
|
| /ndk/build/platforms/android-5/arch-x86/usr/include/linux/sunrpc/ |
| sched.h | 145 struct list_head tasks[RPC_NR_PRIORITY]; member in struct:rpc_wait_queue
160 #define RPC_WAITQ_INIT(var,qname) { .lock = SPIN_LOCK_UNLOCKED, .tasks = { [0] = LIST_HEAD_INIT(var.tasks[0]), [1] = LIST_HEAD_INIT(var.tasks[1]), [2] = LIST_HEAD_INIT(var.tasks[2]), }, }
162 #define RPC_WAITQ_INIT(var,qname) { .lock = SPIN_LOCK_UNLOCKED, .tasks = { [0] = LIST_HEAD_INIT(var.tasks[0]), [1] = LIST_HEAD_INIT(var.tasks[1]), [2] = LIST_HEAD_INIT(var.tasks[2]), }, .name = qname, }
|
| /ndk/build/platforms/android-8/arch-arm/usr/include/linux/sunrpc/ |
| sched.h | 145 struct list_head tasks[RPC_NR_PRIORITY]; member in struct:rpc_wait_queue
160 #define RPC_WAITQ_INIT(var,qname) { .lock = SPIN_LOCK_UNLOCKED, .tasks = { [0] = LIST_HEAD_INIT(var.tasks[0]), [1] = LIST_HEAD_INIT(var.tasks[1]), [2] = LIST_HEAD_INIT(var.tasks[2]), }, }
162 #define RPC_WAITQ_INIT(var,qname) { .lock = SPIN_LOCK_UNLOCKED, .tasks = { [0] = LIST_HEAD_INIT(var.tasks[0]), [1] = LIST_HEAD_INIT(var.tasks[1]), [2] = LIST_HEAD_INIT(var.tasks[2]), }, .name = qname, }
|
| /ndk/build/platforms/android-8/arch-x86/usr/include/linux/sunrpc/ |
| sched.h | 145 struct list_head tasks[RPC_NR_PRIORITY]; member in struct:rpc_wait_queue
160 #define RPC_WAITQ_INIT(var,qname) { .lock = SPIN_LOCK_UNLOCKED, .tasks = { [0] = LIST_HEAD_INIT(var.tasks[0]), [1] = LIST_HEAD_INIT(var.tasks[1]), [2] = LIST_HEAD_INIT(var.tasks[2]), }, }
162 #define RPC_WAITQ_INIT(var,qname) { .lock = SPIN_LOCK_UNLOCKED, .tasks = { [0] = LIST_HEAD_INIT(var.tasks[0]), [1] = LIST_HEAD_INIT(var.tasks[1]), [2] = LIST_HEAD_INIT(var.tasks[2]), }, .name = qname, }
|
| /packages/apps/QuickSearchBox/src/com/android/quicksearchbox/util/ |
| BatchingNamedTaskExecutor.java | 26 * Executes NamedTasks in batches of a given size. Tasks are queued until
36 /** Queue of tasks waiting to be dispatched to mExecutor **/
42 * @param executor A SourceTaskExecutor for actually executing the tasks.
80 * Cancel any unstarted tasks running in this executor. This instance
|
| NamedTaskExecutor.java | 20 * Runs tasks that have a name tag.
32 * Stops any unstarted tasks from running. Implementations of this method must be
|
