Lines Matching defs:task
33 /* Sanity check to verify whether a TASK is in LIST. Return TRUE if
36 TYPE is the type of priority queue this task resides in. */
41 struct gomp_task *task)
46 if (priority_node_to_task (type, p) == task)
59 struct gomp_task *task)
62 = priority_queue_lookup_priority (head, task->priority);
65 return priority_queue_task_in_list_p (type, list, task);
74 struct gomp_task *task)
79 return priority_queue_task_in_tree_p (type, head, task);
81 return priority_queue_task_in_list_p (type, &head->l, task);
106 gomp_fatal ("priority_queue_verify: WAITING task after TIED");
133 /* Verify every task in NODE.
181 struct gomp_task *task = priority_tree_find (type, node->right, pred);
182 if (task)
183 return task;
184 task = priority_node_to_task (type, node->key.l.tasks);
185 if (pred (task))
186 return task;
204 struct gomp_task *task = priority_node_to_task (type, node);
205 if (pred (task))
206 return task;
214 /* Return the highest priority task in the priority queue HEAD that
263 /* Return the highest priority WAITING task in a splay tree NODE. If
269 Recurse down to find such a node. If the task at that max node is
290 /* Return the highest priority WAITING task from within Q1 and Q2,
298 the highest priority WAITING task in Q1. This is an optimization
301 If the returned task is chosen from Q1, *Q1_CHOSEN_P is set to
Indexes created Sat Feb 28 05:31:39 UTC 2026