74 void plist_add(struct plist_node *node, struct plist_head *head)  in plist_add()  argument
80 	WARN_ON(!plist_node_empty(node));  in plist_add()
81 	WARN_ON(!list_empty(&node->prio_list));  in plist_add()
89 		if (node->prio < iter->prio) {  in plist_add()
99 	if (!prev || prev->prio != node->prio)  in plist_add()
100 		list_add_tail(&node->prio_list, &iter->prio_list);  in plist_add()
102 	list_add_tail(&node->node_list, node_next);  in plist_add()
113 void plist_del(struct plist_node *node, struct plist_head *head)  in plist_del()  argument
117 	if (!list_empty(&node->prio_list)) {  in plist_del()
118 		if (node->node_list.next != &head->node_list) {  in plist_del()
121 			next = list_entry(node->node_list.next,  in plist_del()
126 				list_add(&next->prio_list, &node->prio_list);  in plist_del()
128 		list_del_init(&node->prio_list);  in plist_del()
131 	list_del_init(&node->node_list);  in plist_del()
146 void plist_requeue(struct plist_node *node, struct plist_head *head)  in plist_requeue()  argument
153 	BUG_ON(plist_node_empty(node));  in plist_requeue()
155 	if (node == plist_last(head))  in plist_requeue()
158 	iter = plist_next(node);  in plist_requeue()
160 	if (node->prio != iter->prio)  in plist_requeue()
163 	plist_del(node, head);  in plist_requeue()
166 		if (node->prio != iter->prio) {  in plist_requeue()
171 	list_add_tail(&node->node_list, node_next);  in plist_requeue()
212 static void __init plist_test_requeue(struct plist_node *node)  in plist_test_requeue()  argument
214 	plist_requeue(node, &test_head);  in plist_test_requeue()
216 	if (node != plist_last(&test_head))  in plist_test_requeue()
217 		BUG_ON(node->prio == plist_next(node)->prio);  in plist_test_requeue()