Lines Matching refs:head
56 static void plist_check_head(struct plist_head *head) in plist_check_head() argument
58 if (!plist_head_empty(head)) in plist_check_head()
59 plist_check_list(&plist_first(head)->prio_list); in plist_check_head()
60 plist_check_list(&head->node_list); in plist_check_head()
73 void plist_add(struct plist_node *node, struct plist_head *head) in plist_add() argument
76 struct list_head *node_next = &head->node_list; in plist_add()
78 plist_check_head(head); in plist_add()
82 if (plist_head_empty(head)) in plist_add()
85 first = iter = plist_first(head); in plist_add()
113 plist_check_head(head); in plist_add()
122 void plist_del(struct plist_node *node, struct plist_head *head) in plist_del() argument
124 plist_check_head(head); in plist_del()
127 if (node->node_list.next != &head->node_list) { in plist_del()
142 plist_check_head(head); in plist_del()
155 void plist_requeue(struct plist_node *node, struct plist_head *head) in plist_requeue() argument
158 struct list_head *node_next = &head->node_list; in plist_requeue()
160 plist_check_head(head); in plist_requeue()
161 BUG_ON(plist_head_empty(head)); in plist_requeue()
164 if (node == plist_last(head)) in plist_requeue()
172 plist_del(node, head); in plist_requeue()
185 plist_for_each_continue(iter, head) { in plist_requeue()
194 plist_check_head(head); in plist_requeue()