Home
last modified time | relevance | path

Searched refs:task (Results 1 – 8 of 8) sorted by relevance

/libuv/test/
H A Drunner.c70 task_entry_t* task; in run_tests() local
75 for (task = TASKS; task->main; task++, actual++) { in run_tests()
91 for (task = TASKS; task->main; task++) { in run_tests()
152 task_entry_t* task; in run_test() local
171 for (task = TASKS; task->main; task++) { in run_test()
172 if (task->is_helper && strcmp(test, task->process_name) == 0) { in run_test()
178 for (task = TASKS; task->main; task++) { in run_test()
203 for (task = TASKS; task->main; task++) { in run_test()
355 for (task = TASKS; task->main; task++) { in run_test_part()
393 for (n_tasks = 0, task = TASKS; task->main; n_tasks++, task++); in print_tests()
[all …]
/libuv/docs/src/guide/
H A Dthreads.rst10 calls. libuv also uses threads to allow you, the application, to perform a task
192 a task in a separate thread, and have a callback that is triggered when the
193 task is done. A seemingly simple function, what makes ``uv_queue_work()``
204 own system of running the task in a separate thread. libuv just provides
209 a separate thread so that the blocking and CPU bound task does not prevent the
218 The actual task function is simple, nothing to show that it is going to be
243 that *are yet to be started* can be cancelled. If a task has *already started
296 they are running. For example you might be running some long duration task in
H A Dutilities.rst167 Here we create the baton and queue the task.
169 Now the task function can extract the data it needs:
H A Dbasics.rst39 functions don't return until the task is done, so that your program is doing
H A Dfilesystem.rst82 about its primary task and dealing with multiple I/O sources*. For solo tasks
H A Dprocesses.rst254 is great. Just be warned that creating processes is a costly task.
/libuv/
H A DLINKS.md42 …ing a lightweight web server and a set of combinators to manipulate route flow and task composition
H A DMakefile.am157 test/task.h \

Completed in 14 milliseconds