Lines Matching refs:node
26 inline async_wait_t* NodeToWait(list_node_t* node) { in NodeToWait() argument
27 return FROM_NODE(async_wait_t, node); in NodeToWait()
34 inline async_task_t* NodeToTask(list_node_t* node) { in NodeToTask() argument
35 return FROM_NODE(async_task_t, node); in NodeToTask()
39 list_node_t* node; in InsertTask() local
40 for (node = task_list->prev; node != task_list; node = node->prev) { in InsertTask()
41 if (task->deadline >= NodeToTask(node)->deadline) { in InsertTask()
45 list_add_after(node, TaskToNode(task)); in InsertTask()
95 list_node_t* node = WaitToNode(wait); in CancelWait() local
96 if (!list_in_list(node)) { in CancelWait()
104 list_delete(node); in CancelWait()
112 list_delete(node); in CancelWait()
130 list_node_t* node = TaskToNode(task); in CancelTask() local
131 if (!list_in_list(node)) { in CancelTask()
134 list_delete(node); in CancelTask()
149 list_node_t* node = list_is_empty(&due_list_) ? in GetNextTaskDueTime() local
152 if (!node) { in GetNextTaskDueTime()
155 return zx::time(NodeToTask(node)->deadline); in GetNextTaskDueTime()
180 list_node_t* node = list_peek_head(&due_list_); in DispatchNextDueTask() local
181 if (node) { in DispatchNextDueTask()
182 list_delete(node); in DispatchNextDueTask()
183 async_task_t* task = NodeToTask(node); in DispatchNextDueTask()
221 list_node_t* node; in ExtractDueTasks() local
224 list_for_every(&task_list_, node) { in ExtractDueTasks()
225 if (NodeToTask(node)->deadline > current_time.get()) { break; } in ExtractDueTasks()
226 tail = node; in ExtractDueTasks()
240 list_node_t* node; in Shutdown() local
241 while ((node = list_remove_head(&wait_list_))) { in Shutdown()
242 async_wait_t* wait = NodeToWait(node); in Shutdown()
245 while ((node = list_remove_head(&due_list_))) { in Shutdown()
246 async_task_t* task = NodeToTask(node); in Shutdown()
249 while ((node = list_remove_head(&task_list_))) { in Shutdown()
250 async_task_t* task = NodeToTask(node); in Shutdown()