76 	struct plist_node *first, *iter, *prev = NULL;  in plist_add()  local
86 	first = iter = plist_first(head);  in plist_add()
89 		if (node->prio < iter->prio) {  in plist_add()
90 			node_next = &iter->node_list;  in plist_add()
94 		prev = iter;  in plist_add()
95 		iter = list_entry(iter->prio_list.next,  in plist_add()
97 	} while (iter != first);  in plist_add()
100 		list_add_tail(&node->prio_list, &iter->prio_list);  in plist_add()
148 	struct plist_node *iter;  in plist_requeue()  local
158 	iter = plist_next(node);  in plist_requeue()
160 	if (node->prio != iter->prio)  in plist_requeue()
165 	plist_for_each_continue(iter, head) {  in plist_requeue()
166 		if (node->prio != iter->prio) {  in plist_requeue()
167 			node_next = &iter->node_list;  in plist_requeue()