42 if (head->
next == head) {
72 return (head->
next == head) ? NULL : head->
next;
75 return (node->
next == head) ? NULL : node->
next;
95 if (head->
next == head) {
task_thread * thread_next_node(task_thread *node)
boolean thread_circular_thread_empty(task_thread *head)
task_thread * thread_circular_top(task_thread *head)
task_thread * thread_circular_dequeue_top(task_thread *head)
task_thread * thread_circular_thread_next(task_thread *head, task_thread *node)
boolean thread_node_on_thread(const task_thread *node)
void thread_circular_add_bottom(task_thread *head, task_thread *node)
void thread_new_circular_thread(task_thread *head)
void thread_circular_add_top(task_thread *head, task_thread *node)
void thread_remove(task_thread *node)
boolean thread_circular_thread_head(task_thread *head, task_thread *node)