35 	WARN(n->prev != p || p->next != n,  in plist_check_prev_next()
39 			 t, t->next, t->prev,  in plist_check_prev_next()
40 			p, p->next, p->prev,  in plist_check_prev_next()
41 			n, n->next, n->prev);  in plist_check_prev_next()
46 	struct list_head *prev = top, *next = top->next;  in plist_check_list()  local
48 	plist_check_prev_next(top, prev, next);  in plist_check_list()
50 		prev = next;  in plist_check_list()
51 		next = prev->next;  in plist_check_list()
52 		plist_check_prev_next(top, prev, next);  in plist_check_list()
75 	struct plist_node *first, *iter, *prev = NULL;  in plist_add()  local
93 		prev = iter;  in plist_add()
98 	if (!prev || prev->prio != node->prio)  in plist_add()