Lines Matching defs:next
35 WARN(n->prev != p || p->next != n,
38 "next: %p, n: %p, p: %p\n",
39 t, t->next, t->prev,
40 p, p->next, p->prev,
41 n, n->next, n->prev);
46 struct list_head *prev = top, *next = top->next;
48 plist_check_prev_next(top, prev, next);
49 while (next != top) {
50 prev = next;
51 next = prev->next;
52 plist_check_prev_next(top, prev, next);
94 iter = list_entry(iter->prio_list.next,
117 if (node->node_list.next != &head->node_list) {
118 struct plist_node *next;
120 next = list_entry(node->node_list.next,
123 /* add the next plist_node into prio_list */
124 if (list_empty(&next->prio_list))
125 list_add(&next->prio_list, &node->prio_list);
204 BUG_ON(prio_pos->prio_list.next != &node_pos->prio_list);
209 BUG_ON(prio_pos->prio_list.next != &first->prio_list);