ulib/async-loop/loop.c

63     list_node_t node;
122 static inline async_wait_t* node_to_wait(list_node_t* node) {
123     return FROM_NODE(async_wait_t, node);
130 static inline async_task_t* node_to_task(list_node_t* node) {
131     return FROM_NODE(async_task_t, node);
138 static inline async_exception_t* node_to_exception(list_node_t* node) {
139     return FROM_NODE(async_exception_t, node);
205     list_node_t* node;
206     while ((node = list_remove_head(&loop->wait_list))) {
207         async_wait_t* wait = node_to_wait(node);
210     while ((node = list_remove_head(&loop->due_list))) {
211         async_task_t* task = node_to_task(node);
214     while ((node = list_remove_head(&loop->task_list))) {
215         async_task_t* task = node_to_task(node);
218     while ((node = list_remove_head(&loop->exception_list))) {
219         async_exception_t* exception = node_to_exception(node);
345         list_node_t* node;
349             list_for_every(&loop->task_list, node) {
350                 if (node_to_task(node)->deadline > due_time)
352                 tail = node;
368         while ((node = list_remove_head(&loop->due_list))) {
372             async_task_t* task = node_to_task(node);
515     list_node_t* node = wait_to_node(wait);
516     if (!list_in_list(node)) {
527         list_delete(node);
571     list_node_t* node = task_to_node(task);
572     if (!list_in_list(node)) {
580                         node->prev == &loop->task_list &&
581                         node->next != &loop->task_list &&
582                         node_to_task(node->next)->deadline > task->deadline;
583     list_delete(node);
667     list_node_t* node = exception_to_node(exception);
668     if (!list_in_list(node)) {
678         list_delete(node);
690     list_node_t* node;
691     for (node = loop->task_list.prev; node != &loop->task_list; node = node->prev) {
692         if (task->deadline >= node_to_task(node)->deadline)
695     list_add_after(node, task_to_node(task));
753     list_add_tail(&loop->thread_list, &rec->node);