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()
103 	plist_check_head(head);  in plist_add()
112 void plist_del(struct plist_node *node, struct plist_head *head)  in plist_del()  argument
114 	plist_check_head(head);  in plist_del()
117 		if (node->node_list.next != &head->node_list) {  in plist_del()
132 	plist_check_head(head);  in plist_del()
145 void plist_requeue(struct plist_node *node, struct plist_head *head)  in plist_requeue()  argument
148 	struct list_head *node_next = &head->node_list;  in plist_requeue()
150 	plist_check_head(head);  in plist_requeue()
151 	BUG_ON(plist_head_empty(head));  in plist_requeue()
154 	if (node == plist_last(head))  in plist_requeue()
162 	plist_del(node, head);  in plist_requeue()
164 	plist_for_each_continue(iter, head) {  in plist_requeue()
172 	plist_check_head(head);  in plist_requeue()