| /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) {
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| AbstractExecutorService.java | 114 private <T> T doInvokeAny(Collection<? extends Callable<T>> tasks,
117 if (tasks == null)
119 int ntasks = tasks.size();
127 // parallelism, check to see if previously submitted tasks are
137 Iterator<? extends Callable<T>> it = tasks.iterator();
189 public <T> T invokeAny(Collection<? extends Callable<T>> tasks)
192 return doInvokeAny(tasks, false, 0);
199 public <T> T invokeAny(Collection<? extends Callable<T>> tasks,
202 return doInvokeAny(tasks, true, unit.toNanos(timeout));
205 public <T> List<Future<T>> invokeAll(Collection<? extends Callable<T>> tasks)
[all...] |
| ExecutorService.java | 15 * one or more asynchronous tasks.
18 * it to reject new tasks. Two different methods are provided for
20 * method will allow previously submitted tasks to execute before
22 * tasks from starting and attempts to stop currently executing tasks.
23 * Upon termination, an executor has no tasks actively executing, no
24 * tasks awaiting execution, and no new tasks can be submitted. An
33 * tasks and then waiting for at least one, or all, to
78 * first by calling <tt>shutdown</tt> to reject incoming tasks, and the
[all...] |
| Executors.java | 49 * <tt>nThreads</tt> threads will be active processing tasks.
50 * If additional tasks are submitted when all threads are active,
54 * execute subsequent tasks. The threads in the pool will exist
72 * tasks. If additional tasks are submitted when all threads are
76 * needed to execute subsequent tasks. The threads in the pool will
98 * subsequent tasks.) Tasks are guaranteed to execute
139 * of programs that execute many short-lived asynchronous tasks.
179 * subsequent tasks.) Tasks are guaranteed to execut
[all...] |
| ThreadPoolExecutor.java | 26 * asynchronous tasks, due to reduced per-task invocation overhead,
28 * including threads, consumed when executing a collection of tasks.
30 * statistics, such as the number of completed tasks.
63 * tasks. Most typically, core and maximum pool sizes are set only
70 * started only when new tasks arrive, but this can be overridden
85 * continue, but might not be able to execute any tasks. Threads
112 * submitted tasks. The use of this queue interacts with pool sizing:
134 * queue is a {@link SynchronousQueue} that hands off tasks to threads
140 * avoid rejection of new submitted tasks. This in turn admits the
146 * capacity) will cause new tasks to wait in the queue when al
1361 List<Runnable> tasks; local
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| Timer.java | 21 * Timers schedule one-shot or recurring {@link TimerTask tasks} for execution.
25 * <p>Each timer has one thread on which tasks are executed sequentially. When
26 * this thread is busy running a task, runnable tasks may be subject to delays.
31 * <p>Recurring tasks are scheduled with either a fixed period or a fixed rate:
41 * from starting tasks on time.
181 private TimerHeap tasks = new TimerHeap(); field in class:Timer.TimerImpl
208 if (tasks.isEmpty()) {
212 // no tasks scheduled -- sleep until any task appear
222 task = tasks.minimum();
227 tasks.delete(0)
[all...] |
| /sdk/sdkmanager/libs/sdkuilib/src/com/android/sdkuilib/internal/tasks/ |
| ProgressTaskFactory.java | 17 package com.android.sdkuilib.internal.tasks;
|
| ProgressTask.java | 17 package com.android.sdkuilib.internal.tasks;
|
| /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/ndk/platforms/android-3/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, }
|
| /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...] |
| /prebuilt/ndk/android-ndk-r4/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, }
|
| /prebuilt/ndk/android-ndk-r4/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, }
|
| /prebuilt/ndk/android-ndk-r4/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, }
|
| /prebuilt/ndk/android-ndk-r4/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, }
|
| /prebuilt/ndk/android-ndk-r4/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, }
|
| /prebuilt/ndk/android-ndk-r4/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, }
|
| /libcore/luni/src/test/java/tests/api/java/util/concurrent/ |
| ScheduledExecutorSubclassTest.java | 157 * scheduleAtFixedRate executes series of tasks at given rate
175 * scheduleWithFixedDelay executes series of tasks with given period
312 * when tasks complete
359 * getTaskCount increases, but doesn't overestimate, when tasks
454 * getQueue returns the work queue, which contains queued tasks
458 ScheduledFuture[] tasks = new ScheduledFuture[5]; local
460 tasks[i] = p1.schedule(new SmallPossiblyInterruptedRunnable(), 1, MILLISECONDS);
465 assertTrue(q.contains(tasks[4]));
466 assertFalse(q.contains(tasks[0]));
477 ScheduledFuture[] tasks = new ScheduledFuture[5] local
503 ScheduledFuture[] tasks = new ScheduledFuture[5]; local
[all...] |
| ScheduledExecutorTest.java | 104 * scheduleAtFixedRate executes series of tasks at given rate
122 * scheduleWithFixedDelay executes series of tasks with given period
261 * when tasks complete
308 * getTaskCount increases, but doesn't overestimate, when tasks
405 * getQueue returns the work queue, which contains queued tasks
409 ScheduledFuture[] tasks = new ScheduledFuture[5]; local
411 tasks[i] = p1.schedule(new SmallPossiblyInterruptedRunnable(), 1, MILLISECONDS);
416 assertTrue(q.contains(tasks[4]));
417 assertFalse(q.contains(tasks[0]));
428 ScheduledFuture[] tasks = new ScheduledFuture[5] local
454 ScheduledFuture[] tasks = new ScheduledFuture[5]; local
[all...] |
| ThreadPoolExecutorSubclassTest.java | 249 * when tasks complete
391 * getTaskCount increases, but doesn't overestimate, when tasks submitted
448 * getQueue returns the work queue, which contains queued tasks
453 FutureTask[] tasks = new FutureTask[5]; local
455 tasks[i] = new FutureTask(new MediumPossiblyInterruptedRunnable(), Boolean.TRUE);
456 p1.execute(tasks[i]);
462 assertFalse(wq.contains(tasks[0]));
463 assertTrue(wq.contains(tasks[4]));
465 tasks[i].cancel(true);
478 FutureTask[] tasks = new FutureTask[5] local
504 FutureTask[] tasks = new FutureTask[5]; local
852 TrackedNoOpRunnable[] tasks = new TrackedNoOpRunnable[5]; local
878 TrackedNoOpRunnable[] tasks = new TrackedNoOpRunnable[5]; local
[all...] |
| ThreadPoolExecutorTest.java | 105 * when tasks complete
247 * getTaskCount increases, but doesn't overestimate, when tasks submitted
304 * getQueue returns the work queue, which contains queued tasks
309 FutureTask[] tasks = new FutureTask[5]; local
311 tasks[i] = new FutureTask(new MediumPossiblyInterruptedRunnable(), Boolean.TRUE);
312 p1.execute(tasks[i]);
318 assertFalse(wq.contains(tasks[0]));
319 assertTrue(wq.contains(tasks[4]));
321 tasks[i].cancel(true);
334 FutureTask[] tasks = new FutureTask[5] local
360 FutureTask[] tasks = new FutureTask[5]; local
715 TrackedNoOpRunnable[] tasks = new TrackedNoOpRunnable[5]; local
741 TrackedNoOpRunnable[] tasks = new TrackedNoOpRunnable[5]; local
[all...] |
| /external/chromium/base/ |
| worker_pool_linux_unittest.cc | 28 const std::queue<Task*>& tasks() const { return pool_->tasks_; } function in class:base::LinuxDynamicThreadPool::LinuxDynamicThreadPoolPeer
183 EXPECT_EQ(0U, peer_.tasks().size());
202 // Add another 2 tasks. One should reuse the existing worker thread.
216 // Add two blocking tasks.
220 EXPECT_EQ(0, counter_) << "Blocking tasks should not have started yet.";
232 // Add two non blocking tasks and wait for them to finish.
237 // Add two blocking tasks, start them simultaneously, and wait for them to
|
| /external/v8/benchmarks/ |
| richards.js | 94 * A scheduler can be used to schedule a set of tasks based on their relative
96 * which holds tasks and the data queue they are processing.
186 * Execute the tasks managed by this scheduler.
362 * device tasks.
364 * @param {int} v1 a seed value that controls how the device tasks are scheduled
504 * A simple package of data that is manipulated by the tasks. The exact layout
506 * nature of the work performed on packets by the tasks.
|
| /external/webkit/SunSpider/tests/v8-v4/ |
| v8-richards.js | 89 * A scheduler can be used to schedule a set of tasks based on their relative
91 * which holds tasks and the data queue they are processing.
181 * Execute the tasks managed by this scheduler.
357 * device tasks.
359 * @param {int} v1 a seed value that controls how the device tasks are scheduled
499 * A simple package of data that is manipulated by the tasks. The exact layout
501 * nature of the work performed on packets by the tasks.
|
| /external/webkit/WebCore/platform/graphics/win/ |
| QTMovieWin.cpp | 193 Vector<QTMovieWinPrivate*> tasks; local
194 copyToVector(*gTaskList, tasks);
195 size_t count = tasks.size();
197 tasks[n]->task();
[all...] |
