36 	WARN(n->prev != p || p->next != n,  in plist_check_prev_next()
40 			 t, t->next, t->prev,  in plist_check_prev_next()
41 			p, p->next, p->prev,  in plist_check_prev_next()
42 			n, n->next, n->prev);  in plist_check_prev_next()
47 	struct list_head *prev = top, *next = top->next;  in plist_check_list()  local
49 	plist_check_prev_next(top, prev, next);  in plist_check_list()
50 	while (next != top) {  in plist_check_list()
51 		prev = next;  in plist_check_list()
52 		next = prev->next;  in plist_check_list()
53 		plist_check_prev_next(top, prev, next);  in plist_check_list()
95 		iter = list_entry(iter->prio_list.next,  in plist_add()
118 		if (node->node_list.next != &head->node_list) {  in plist_del()
119 			struct plist_node *next;  in plist_del()  local
121 			next = list_entry(node->node_list.next,  in plist_del()
125 			if (list_empty(&next->prio_list))  in plist_del()
126 				list_add(&next->prio_list, &node->prio_list);  in plist_del()
205 		BUG_ON(prio_pos->prio_list.next != &node_pos->prio_list);  in plist_test_check()
210 	BUG_ON(prio_pos->prio_list.next != &first->prio_list);  in plist_test_check()