Lines Matching refs:node
29 void rt_wqueue_add(rt_wqueue_t *queue, struct rt_wqueue_node *node) in rt_wqueue_add() argument
34 node->wqueue = queue; in rt_wqueue_add()
35 rt_list_insert_before(&(queue->waiting_list), &(node->list)); in rt_wqueue_add()
44 void rt_wqueue_remove(struct rt_wqueue_node *node) in rt_wqueue_remove() argument
48 RT_ASSERT(node->wqueue != RT_NULL); in rt_wqueue_remove()
50 level = rt_spin_lock_irqsave(&(node->wqueue->spinlock)); in rt_wqueue_remove()
51 rt_list_remove(&(node->list)); in rt_wqueue_remove()
52 rt_spin_unlock_irqrestore(&(node->wqueue->spinlock), level); in rt_wqueue_remove()
86 struct rt_list_node *node; in rt_wqueue_wakeup() local
97 for (node = queue_list->next; node != queue_list; node = node->next) in rt_wqueue_wakeup()
99 entry = rt_list_entry(node, struct rt_wqueue_node, list); in rt_wqueue_wakeup()
142 struct rt_list_node *node; in rt_wqueue_wakeup_all() local
153 for (node = queue_list->next; node != queue_list; ) in rt_wqueue_wakeup_all()
155 entry = rt_list_entry(node, struct rt_wqueue_node, list); in rt_wqueue_wakeup_all()
172 node = node->next; in rt_wqueue_wakeup_all()
176 node = node->next; in rt_wqueue_wakeup_all()