Lines Matching refs:tasks
26 /* Priority queue implementation of GOMP tasks. */
43 struct priority_node *p = list->tasks;
50 while (p != list->tasks);
84 /* Sanity check LIST to make sure the tasks therein are in the right
87 The expected order is that GOMP_TASK_WAITING tasks come before
91 tasks come before !parent_depends_on WAITING tasks. This is only
101 struct priority_node *p = list->tasks;
121 if (p == list->tasks)
146 Sanity check HEAD to make sure the tasks therein are in the right
147 order. The priority_queue holds tasks of type TYPE.
150 tasks come before !parent_depends_on WAITING tasks. This is only
184 task = priority_node_to_task (type, node->key.l.tasks);
198 struct priority_node *node = list->tasks;
209 while (node != list->tasks);
215 satisfies the predicate PRED. HEAD contains tasks of type TYPE. */
229 tree. HEAD contains tasks of type TYPE. */
255 list->tasks = NULL;
264 there are no WAITING tasks available, return NULL.
266 NODE is a priority list containing tasks of type TYPE.
270 not WAITING, bubble back up and look at the remaining tasks
283 ret = priority_node_to_task (type, node->key.l.tasks);
291 while giving preference to tasks from Q1. Q1 is a queue containing
294 Since we are mostly interested in Q1, if there are no WAITING tasks
Indexes created Tue Mar 03 05:31:39 UTC 2026