57 static void plist_check_head(struct plist_head *head)  in plist_check_head()  argument
59 	if (!plist_head_empty(head))  in plist_check_head()
60 		plist_check_list(&plist_first(head)->prio_list);  in plist_check_head()
61 	plist_check_list(&head->node_list);  in plist_check_head()
74 void plist_add(struct plist_node *node, struct plist_head *head)  in plist_add()  argument
77 	struct list_head *node_next = &head->node_list;  in plist_add()
79 	plist_check_head(head);  in plist_add()
83 	if (plist_head_empty(head))  in plist_add()
86 	first = iter = plist_first(head);  in plist_add()
104 	plist_check_head(head);  in plist_add()
113 void plist_del(struct plist_node *node, struct plist_head *head)  in plist_del()  argument
115 	plist_check_head(head);  in plist_del()
118 		if (node->node_list.next != &head->node_list) {  in plist_del()
133 	plist_check_head(head);  in plist_del()
146 void plist_requeue(struct plist_node *node, struct plist_head *head)  in plist_requeue()  argument
149 	struct list_head *node_next = &head->node_list;  in plist_requeue()
151 	plist_check_head(head);  in plist_requeue()
152 	BUG_ON(plist_head_empty(head));  in plist_requeue()
155 	if (node == plist_last(head))  in plist_requeue()
163 	plist_del(node, head);  in plist_requeue()
165 	plist_for_each_continue(iter, head) {  in plist_requeue()
173 	plist_check_head(head);  in plist_requeue()