Home
last modified time | relevance | path

Searched refs:tasks (Results 1 – 25 of 204) sorted by relevance

123456789

/netbsd-src/external/mpl/bind/dist/lib/isc/
H A Dtaskpool.c
H A Dtask.c
/netbsd-src/external/mpl/dhcp/bind/dist/lib/isc/
H A Dtaskpool.c34 isc_task_t **tasks; member
54 pool->tasks = isc_mem_get(mctx, ntasks * sizeof(isc_task_t *)); in alloc_pool()
56 pool->tasks[i] = NULL; in alloc_pool()
76 &pool->tasks[i], i); in isc_taskpool_create()
81 isc_task_setprivilege(pool->tasks[i], priv); in isc_taskpool_create()
82 isc_task_setname(pool->tasks[i], "taskpool", NULL); in isc_taskpool_create()
91 isc_task_attach(pool->tasks[isc_random_uniform(pool->ntasks)], targetp); in isc_taskpool_gettask()
120 newpool->tasks[i] = pool->tasks[i]; in isc_taskpool_expand()
121 pool->tasks[i] = NULL; in isc_taskpool_expand()
128 &newpool->tasks[i], i); in isc_taskpool_expand()
[all …]
H A Dtask.c145 LIST(isc_task_t) tasks;
186 UNLINK(manager->tasks, task, link); in task_finished()
258 APPEND(manager->tasks, task, link); in isc_task_create_bound()
1017 INIT_LIST(manager->tasks); in isc__taskmgr_create()
1069 for (task = HEAD(manager->tasks); task != NULL; task = NEXT(task, link)) in isc__taskmgr_shutdown()
1341 task = ISC_LIST_HEAD(mgr->tasks); in isc_taskmgr_renderxml()
1411 json_object *tasks = (json_object *)tasks0; in isc_taskmgr_renderjson() local
1421 json_object_object_add(tasks, "thread-model", obj); in isc_taskmgr_renderjson()
1425 json_object_object_add(tasks, "default-quantum", obj); in isc_taskmgr_renderjson()
1430 for (task = ISC_LIST_HEAD(mgr->tasks); task != NULL; in isc_taskmgr_renderjson()
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/libgomp/
H A Dpriority_queue.h51 struct priority_node *tasks; member
156 head->l.tasks = NULL; in priority_queue_init()
198 return __atomic_load_n (&head->l.tasks, MEMMODEL_ACQUIRE) == NULL; in priority_queue_empty_p()
199 return head->l.tasks == NULL; in priority_queue_empty_p()
246 if (list->tasks) in priority_list_insert()
267 node->next = list->tasks; in priority_list_insert()
268 node->prev = list->tasks->prev; in priority_list_insert()
270 list->tasks = node; in priority_list_insert()
279 list->tasks = node; in priority_list_insert()
302 if (head->l.tasks != NULL) in priority_tree_insert()
[all …]
H A Dpriority_queue.c43 struct priority_node *p = list->tasks; in priority_queue_task_in_list_p()
50 while (p != list->tasks); in priority_queue_task_in_list_p()
101 struct priority_node *p = list->tasks; in priority_list_verify()
121 if (p == list->tasks) in priority_list_verify()
198 list->tasks = NULL; in priority_tree_remove()
226 ret = priority_node_to_task (type, node->key.l.tasks); in priority_tree_next_task_1()
H A Dtaskloop.c275 struct gomp_task *tasks[num_tasks]; in GOMP_taskloop() local
286 tasks[i] = task; in GOMP_taskloop()
325 gomp_finish_task (tasks[i]); in GOMP_taskloop()
326 free (tasks[i]); in GOMP_taskloop()
346 struct gomp_task *task = tasks[i]; in GOMP_taskloop()
H A Dtask.c108 struct priority_node *p = list->tasks; in gomp_clear_parent_in_list()
115 while (p != list->tasks); in gomp_clear_parent_in_list()
923 else if (node != list->tasks) in priority_list_upgrade_task()
927 node->prev = list->tasks->prev; in priority_list_upgrade_task()
928 node->next = list->tasks; in priority_list_upgrade_task()
929 list->tasks = node; in priority_list_upgrade_task()
981 if (list->tasks == node) in priority_list_downgrade_task()
982 list->tasks = node->next; in priority_list_downgrade_task()
983 else if (node->next != list->tasks) in priority_list_downgrade_task()
997 node->next = list->tasks; in priority_list_downgrade_task()
[all …]
/netbsd-src/external/gpl3/gcc/dist/libgomp/
H A Dpriority_queue.h51 struct priority_node *tasks; member
161 head->l.tasks = NULL; in priority_queue_init()
203 return __atomic_load_n (&head->l.tasks, MEMMODEL_ACQUIRE) == NULL; in priority_queue_empty_p()
204 return head->l.tasks == NULL; in priority_queue_empty_p()
251 if (list->tasks) in priority_list_insert()
272 node->next = list->tasks; in priority_list_insert()
273 node->prev = list->tasks->prev; in priority_list_insert()
275 list->tasks = node; in priority_list_insert()
284 list->tasks = node; in priority_list_insert()
307 if (head->l.tasks != NULL) in priority_tree_insert()
[all …]
H A Dpriority_queue.c43 struct priority_node *p = list->tasks; in priority_queue_task_in_list_p()
50 while (p != list->tasks); in priority_queue_task_in_list_p()
101 struct priority_node *p = list->tasks; in priority_list_verify()
121 if (p == list->tasks) in priority_list_verify()
184 task = priority_node_to_task (type, node->key.l.tasks); in priority_tree_find()
198 struct priority_node *node = list->tasks; in priority_list_find()
209 while (node != list->tasks); in priority_list_find()
255 list->tasks = NULL; in priority_tree_remove()
283 ret = priority_node_to_task (type, node->key.l.tasks); in priority_tree_next_task_1()
H A Dtaskloop.c294 struct gomp_task *tasks[num_tasks]; in GOMP_taskloop() local
305 tasks[i] = task; in GOMP_taskloop()
344 gomp_finish_task (tasks[i]); in GOMP_taskloop()
345 free (tasks[i]); in GOMP_taskloop()
365 struct gomp_task *task = tasks[i]; in GOMP_taskloop()
H A Dtask.c111 struct priority_node *p = list->tasks; in gomp_clear_parent_in_list()
118 while (p != list->tasks); in gomp_clear_parent_in_list()
983 else if (node != list->tasks) in priority_list_upgrade_task()
987 node->prev = list->tasks->prev; in priority_list_upgrade_task()
988 node->next = list->tasks; in priority_list_upgrade_task()
989 list->tasks = node; in priority_list_upgrade_task()
1041 if (list->tasks == node) in priority_list_downgrade_task()
1042 list->tasks = node->next; in priority_list_downgrade_task()
1043 else if (node->next != list->tasks) in priority_list_downgrade_task()
1057 node->next = list->tasks; in priority_list_downgrade_task()
[all …]
/netbsd-src/sys/external/bsd/drm2/dist/drm/
H A Ddrm_flip_work.c122 struct list_head tasks; in flip_worker() local
128 INIT_LIST_HEAD(&tasks); in flip_worker()
130 list_splice_tail(&work->commited, &tasks); in flip_worker()
134 if (list_empty(&tasks)) in flip_worker()
137 list_for_each_entry_safe(task, tmp, &tasks, node) { in flip_worker()
/netbsd-src/external/bsd/am-utils/dist/doc/
H A DMakefile.am44 alldocs: ps install-NEWS install-INSTALL install-ChangeLog install-AUTHORS install-tasks install-au…
75 install-tasks: $(AMU_HTML_TOP)/tasks.txt
76 $(AMU_HTML_TOP)/tasks.txt: $(top_srcdir)/tasks
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/
H A Dparallelism.d2628 RTask[] tasks; in reduce()
2639 tasks = (cast(RTask*) buf.ptr)[0 .. nWorkUnits]; in reduce()
2651 tasks = ptr[0 .. nWorkUnits]; in reduce()
2658 free(tasks.ptr); in reduce()
2662 foreach (ref t; tasks[]) in reduce()
2687 foreach (ref task; tasks) in reduce()
2692 foreach (i; 1 .. tasks.length - 1) in reduce()
2694 tasks[i].next = tasks[i + 1].basePtr; in reduce()
2695 tasks[i + 1].prev = tasks[i].basePtr; in reduce()
2698 if (tasks.length > 1) in reduce()
[all …]
/netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/
H A Dparallelism.d2737 RTask[] tasks; in reduce()
2748 tasks = (cast(RTask*) buf.ptr)[0 .. nWorkUnits]; in reduce()
2760 tasks = ptr[0 .. nWorkUnits]; in reduce()
2767 free(tasks.ptr); in reduce()
2800 foreach (ref task; tasks) in reduce()
2805 foreach (i; 1 .. tasks.length - 1) in reduce()
2807 tasks[i].next = tasks[i + 1].basePtr; in reduce()
2808 tasks[i + 1].prev = tasks[i].basePtr; in reduce()
2811 if (tasks.length > 1) in reduce()
2817 tasks[1].basePtr, in reduce()
[all …]
/netbsd-src/external/cddl/osnet/
H A DTODO30 Pre-integration tasks.
55 Post-integration tasks.
66 Pre netbsd-6.0 tasks
71 Post netbsd-6.0 tasks
74 - all Post integration tasks
/netbsd-src/sys/dev/dm/
H A DTODO9 General LVM tasks
15 Pain in the sky tasks
/netbsd-src/sys/dev/usb/
H A Dusb.c156 TAILQ_HEAD(, usb_task) tasks;
421 TAILQ_INIT(&taskq->tasks); in usb_once_init()
579 TAILQ_INSERT_TAIL(&taskq->tasks, task, next); in usb_add_task()
611 TAILQ_REMOVE(&taskq->tasks, task, next); in usb_rem_task()
679 TAILQ_REMOVE(&taskq->tasks, task, next); in usb_rem_task_wait()
785 task = TAILQ_FIRST(&taskq->tasks); in usb_task_thread()
788 task = TAILQ_FIRST(&taskq->tasks); in usb_task_thread()
793 TAILQ_REMOVE(&taskq->tasks, task, next); in usb_task_thread()
/netbsd-src/external/gpl3/binutils/dist/gold/
H A Dgold.cc255 std::vector<Task*> tasks; in queue_initial_tasks() local
256 tasks.reserve(input_file_count); in queue_initial_tasks()
264 tasks.push_back(t); in queue_initial_tasks()
268 for (unsigned int i = 0; i < tasks.size(); i++) in queue_initial_tasks()
269 workqueue->queue(tasks[i]); in queue_initial_tasks()
H A Dworkqueue.cc215 Workqueue::find_runnable_in_list(Task_list* tasks) in find_runnable_in_list() argument
218 while ((t = tasks->pop_front()) != NULL) in find_runnable_in_list()
/netbsd-src/external/gpl3/binutils.old/dist/gold/
H A Dgold.cc255 std::vector<Task*> tasks; in queue_initial_tasks() local
256 tasks.reserve(input_file_count); in queue_initial_tasks()
264 tasks.push_back(t); in queue_initial_tasks()
268 for (unsigned int i = 0; i < tasks.size(); i++) in queue_initial_tasks()
269 workqueue->queue(tasks[i]); in queue_initial_tasks()
/netbsd-src/external/mpl/bind/dist/tests/isc/
H A Dtask_test.c
/netbsd-src/external/lgpl3/gmp/dist/doc/
H A DMakefile.am33 EXTRA_DIST = configuration isa_abi_headache projects.html tasks.html
/netbsd-src/external/apache2/llvm/dist/llvm/utils/vscode/llvm/src/
H A Dextension.ts8 …litTaskProvider = vscode.tasks.registerTaskProvider(LITTaskProvider.LITType, new LITTaskProvider()…

123456789