| /third_party/musl/ldso/linux/ |
| D | dynlink_rand.c | 121 struct loadtasks *tasks = __libc_malloc(sizeof(struct loadtasks)); in create_loadtasks() local
122 if (tasks) { in create_loadtasks()
123 tasks->array = NULL; in create_loadtasks()
124 tasks->capacity = 0; in create_loadtasks()
125 tasks->length = 0; in create_loadtasks()
126 return tasks; in create_loadtasks()
131 bool append_loadtasks(struct loadtasks *tasks, struct loadtask *item) in append_loadtasks() argument
133 if (tasks->length + 1 > tasks->capacity) { in append_loadtasks()
135 new_cap = tasks->capacity + TASK_BASE_CAPACITY; in append_loadtasks()
137 if (tasks->array) { in append_loadtasks()
[all …]
|
| D | dynlink_rand.h | 87 hidden bool append_loadtasks(struct loadtasks *tasks, struct loadtask *item);
89 hidden struct loadtask *get_loadtask(struct loadtasks *tasks, size_t index);
90 hidden void free_loadtasks(struct loadtasks *tasks);
91 hidden void shuffle_loadtasks(struct loadtasks *tasks);
|
| /third_party/musl/porting/linux/user/ldso/ |
| D | dynlink_rand.c | 121 struct loadtasks *tasks = __libc_malloc(sizeof(struct loadtasks)); in create_loadtasks() local
122 if (tasks) { in create_loadtasks()
123 tasks->array = NULL; in create_loadtasks()
124 tasks->capacity = 0; in create_loadtasks()
125 tasks->length = 0; in create_loadtasks()
126 return tasks; in create_loadtasks()
131 bool append_loadtasks(struct loadtasks *tasks, struct loadtask *item) in append_loadtasks() argument
133 if (tasks->length + 1 > tasks->capacity) { in append_loadtasks()
135 new_cap = tasks->capacity + TASK_BASE_CAPACITY; in append_loadtasks()
137 if (tasks->array) { in append_loadtasks()
[all …]
|
| D | dynlink_rand.h | 87 hidden bool append_loadtasks(struct loadtasks *tasks, struct loadtask *item);
89 hidden struct loadtask *get_loadtask(struct loadtasks *tasks, size_t index);
90 hidden void free_loadtasks(struct loadtasks *tasks);
91 hidden void shuffle_loadtasks(struct loadtasks *tasks);
|
| /third_party/musl/libc-test/src/functionalext/unittest/ |
| D | unit_test_mock_dynlink.c | 54 struct loadtask *get_loadtask(struct loadtasks *tasks, size_t index) in get_loadtask() argument
56 if (tasks && tasks->array && (index < tasks->length)) { in get_loadtask()
57 return tasks->array[index]; in get_loadtask()
63 void free_loadtasks(struct loadtasks *tasks) in free_loadtasks() argument
65 if (tasks) { in free_loadtasks()
66 if (tasks->length) { in free_loadtasks()
67 for (size_t i = 0; i < tasks->length; i++) { in free_loadtasks()
68 free_task(get_loadtask(tasks, i)); in free_loadtasks()
70 tasks->length = 0; in free_loadtasks()
72 if (tasks->array) { in free_loadtasks()
[all …]
|
| /third_party/ltp/testcases/kernel/controllers/cpuctl_fj/ |
| D | run_cpuctl_test_fj.sh | 70 echo $tmppid > $CPUCTL/tasks
71 done < $tmpdir/tasks
140 task=`cat $CPUCTL/tasks | grep "\b$pid\b"`
168 task=`cat $CPUCTL/tmp/tasks`
200 task=`cat $CPUCTL/tmp/tmp1/tasks`
216 echo 1 > $CPUCTL/tmp/tasks
222 tasks=`cat $CPUCTL/tmp/tasks`
223 if [ $tasks -ne 1 ]
238 ./cpuctl_fj_simple_echo 3 $CPUCTL/tmp/tasks
244 tasks=`cat $CPUCTL/tmp/tasks`
[all …]
|
| /third_party/skia/infra/bots/ |
| D | README.md | 10 Files in this directory define a DAG of tasks which run at every Skia commit. A
15 Jobs are collections of related tasks which help define sub-sections of the DAG,
19 The tasks.json file in this directory is the list of tasks and jobs for
20 the repo. Note that tasks.json is NEVER edited by hand but generated via
23 reads the tasks.json file at each commit to determine which jobs to run. For
24 convenience, gen_tasks.go is provided to generate tasks.json and also to test it
25 for correct syntax and detecting cycles and orphaned tasks. Always edit
26 gen_tasks.go or one of the following input JSON files, rather than tasks.json
34 need to run gen_tasks.go to regenerate tasks.json:
43 tasks.json is unchanged:
[all …]
|
| /third_party/skia/third_party/externals/angle2/src/libANGLE/ |
| D | WorkerThread_unittest.cpp | 34 std::array<std::shared_ptr<TestTask>, 4> tasks = { in TEST() local
38 {WorkerThreadPool::PostWorkerTask(pool, tasks[0]), in TEST()
39 WorkerThreadPool::PostWorkerTask(pool, tasks[1]), in TEST()
40 WorkerThreadPool::PostWorkerTask(pool, tasks[2]), in TEST()
41 WorkerThreadPool::PostWorkerTask(pool, tasks[3])}}; in TEST()
45 for (const auto &task : tasks) in TEST()
|
| /third_party/node/deps/npm/node_modules/glob/dist/esm/ |
| D | walker.js | 172 let tasks = 1;
174 if (--tasks === 0)
180 tasks++;
187 tasks++;
199 let tasks = 1;
201 if (--tasks === 0)
207 tasks++;
211 tasks++;
236 let tasks = 1;
238 if (--tasks === 0)
[all …]
|
| /third_party/node/deps/npm/node_modules/glob/dist/commonjs/ |
| D | walker.js | 175 let tasks = 1;
177 if (--tasks === 0)
183 tasks++;
190 tasks++;
202 let tasks = 1;
204 if (--tasks === 0)
210 tasks++;
214 tasks++;
239 let tasks = 1;
241 if (--tasks === 0)
[all …]
|
| /third_party/ltp/testcases/kernel/controllers/cpuctl/ |
| D | cpuctl_testplan.txt | 18 * of this group and it would create no effect on tasks in other group. So a
21 * Even if task is run with different nice value it will affect the tasks in
43 tasks in different groups on the basis of the shares assigned to that group.
46 number of tasks in that group(in this case only 1).
51 respectively. Hence if the tasks are running infinitely they are supposed to
67 of system default tasks which can run any time.
93 Renice all tasks of a group to -20 and let tasks in all other groups run with
99 In this test for the first run the test is run with say n tasks in m groups.
105 In the following three testcases a total tasks are same and each task is
109 Test 06: N X M (N groups with M tasks each)
[all …]
|
| D | parameters.sh | 57 for task in `cat /dev/cpuctl/tasks`; do
58 echo $task > /dev/cpuctl/group_def/tasks 2>/dev/null 1>&2;
76 for task in `cat /dev/cpuctl/group_def/tasks`; do
77 echo $task > /dev/cpuctl/tasks 2>/dev/null 1>&2;
|
| /third_party/skia/site/docs/dev/testing/ |
| D | automated_testing.md | 13 to do the heavy lifting for our automated testing. It farms out tasks, which may
18 The [Skia Task Scheduler](http://go/skia-task-scheduler) determines what tasks
22 *tasks*. The job is complete when all of its component tasks have succeeded
23 or is considered a failure when any of its component tasks fails. The scheduler
24 may automatically retry tasks within its set limits. Jobs are not retried.
28 Each Skia repository has an `infra/bots/tasks.json` file which defines the jobs
29 and tasks for the repo. Most jobs will run at every commit, but it is possible
31 have a `gen_tasks.go` which will generate `tasks.json`. You will need to
38 has changed. There is also a test mode which simply verifies that the `tasks.json`
51 you may trigger a try job for any job listed in `tasks.json`, either via the
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/marl/docs/ |
| D | scheduler.md | 8 - [Tasks](#tasks)
19 …complex part of marl and is responsible for executing tasks and keeping threads running when tasks…
35 …scheduling tasks when there are no [Multi-Threaded-Workers](#multi-threaded-workers) available. Un…
76 - `work.tasks` - A queue of tasks, yet to be started.
79 - `work.num` - A counter that is kept in sync with `work.tasks.size() + work.fibers.size()`.
83 …e()`, a worker is picked, and the task is placed on to the worker's `work.tasks` queue. The worker…
97 - Calls [`runUntilIdle()`](#marlschedulerworkerrununtilidle) to process all new tasks and fibers. N…
111 1. Resume any unblocked tasks (fibers)
116 …Executing unblocked fibers is prioritized over starting new tasks. This is because new tasks may r…
118 2. Start executing new tasks
[all …]
|
| /third_party/typescript/src/testRunner/parallel/ |
| D | host.ts | 22 let tasks: Task[] = [];
190 …console.log(`Discovered ${tasks.length} unittest suites` + (newTasks.length ? ` and ${newTasks.len…
222 tasks.push({ runner: runner.kind(), file, size });
226 tasks.sort((a, b) => a.size - b.size);
227 tasks = tasks.concat(newTasks);
232 … console.log(`Discovered ${tasks.length} test files in ${+(new Date()) - discoverStart}ms.`);
235 const totalFiles = tasks.length;
333 if (tasks.length === 0) {
343 const taskList = [tasks.pop()!];
344 … while (tasks.length && taskList.reduce((p, c) => p + c.size, 0) < chunkSize) {
[all …]
|
| D | worker.ts | 255 function validateBatch(tasks: Task[]) {
256 return !!tasks && Array.isArray(tasks) && tasks.length > 0 && tasks.every(validateTest);
279 function processBatch(tasks: Task[], fn?: () => void) {
281 const task = tasks.shift();
282 if (task) return processTest(task, tasks.length === 0, next);
|
| /third_party/ltp/testcases/kernel/controllers/cpuset/cpuset_hotplug_test/ |
| D | cpuset_hotplug_test.sh | 173 local tasks=`cat $path/tasks | grep "\b$tst_pid\b"`
174 check_result "$tasks" "EMPTY"
181 tasks=`cat $CPUSET/tasks | grep "\b$tst_pid\b"`
182 check_result "$tasks" "$tst_pid"
|
| /third_party/skia/third_party/externals/swiftshader/third_party/marl/ |
| D | README.md | 7 Marl is a C++ 11 library that provides a fluent interface for running tasks across a number of thre…
9 Marl uses a combination of fibers and threads to allow efficient execution of tasks that can block,…
40 // Schedule some tasks to run asynchronously.
57 sayHello.signal(); // Unblock all the tasks.
59 saidHello.wait(); // Wait for all tasks to complete.
61 printf("All tasks said hello.\n");
63 // All tasks are guaranteed to complete before the scheduler is destructed.
142 Destructing the `marl::Scheduler` requires waiting on all tasks to complete.
188 #### Don't use externally blocking calls in marl tasks
190 …tasks. If a marl task becomes blocked on a marl synchronization primitive, marl can yield from the…
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/marl/src/ |
| D | non_marl_bench.cpp | 70 std::queue<Task> tasks; in SingleQueueTaskExecutor() local
72 tasks.push(Schedule::doSomeWork); in SingleQueueTaskExecutor()
83 if (tasks.size() > 0) { in SingleQueueTaskExecutor()
84 task = tasks.front(); in SingleQueueTaskExecutor()
85 tasks.pop(); in SingleQueueTaskExecutor()
|
| /third_party/jsframework/runtime/main/page/api/ |
| D | misc.ts | 154 export function callTasks(page: Page, tasks: any): any {
156 if (typof(tasks) !== 'array') {
157 tasks = [tasks];
159 tasks.forEach(task => {
|
| /third_party/jsframework/runtime/main/manage/event/ |
| D | bridge.ts | 72 export function receiveTasks(id: string, tasks: any[]): any[] | Error {
74 Log.debug(`ReceiveTasks id ${id}, tasks: ${JSON.stringify(tasks)}`);
76 if (page && Array.isArray(tasks)) {
78 tasks.forEach((task) => {
|
| /third_party/python/Doc/library/ |
| D | asyncio-queue.rst | 71 The count of unfinished tasks goes up whenever an item is added
74 work on it is complete. When the count of unfinished tasks drops
158 concurrent tasks::
190 # Create three worker tasks to process the queue concurrently.
191 tasks = []
194 tasks.append(task)
201 # Cancel our worker tasks.
202 for task in tasks:
204 # Wait until all worker tasks are cancelled.
205 await asyncio.gather(*tasks, return_exceptions=True)
|
| /third_party/ffmpeg/libavcodec/ |
| D | frame_thread_encoder.c | 59 Task tasks[BUFFER_SIZE]; member
103 task = &c->tasks[task_index]; in worker()
205 if (!(c->tasks[j].indata = av_frame_alloc()) || in ff_frame_thread_encoder_init()
206 !(c->tasks[j].outdata = av_packet_alloc())) { in ff_frame_thread_encoder_init()
275 av_frame_free(&c->tasks[i].indata); in ff_frame_thread_encoder_free()
276 av_packet_free(&c->tasks[i].outdata); in ff_frame_thread_encoder_free()
292 av_frame_move_ref(c->tasks[c->task_index].indata, frame); in ff_thread_video_encode_frame()
300 outtask = &c->tasks[c->finished_task_index]; in ff_thread_video_encode_frame()
|
| /third_party/libabigail/src/ |
| D | abg-workers.cc | 206 schedule_tasks(const tasks_type& tasks) in schedule_tasks()
209 for (tasks_type::const_iterator t = tasks.begin(); t != tasks.end(); ++t) in schedule_tasks()
327 queue::schedule_tasks(const tasks_type& tasks) in schedule_tasks() argument
328 {return p_->schedule_tasks(tasks);} in schedule_tasks()
|
| /third_party/typescript/tests/baselines/reference/ |
| D | contextualOverloadListFromArrayUnion.js | 31 export function series<T>(tasks: Task<T>[], callback: Callback<T[]>): void {
36 let task = tasks[index]
76 export function series(tasks, callback) { argument
80 let task = tasks[index];
|