Lines Matching refs:next
48 * sometimes we already know the next/prev entries and we can
54 struct list_head *next, *prev;
63 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
70 * the prev/next entries already!
74 struct list_head *next)
76 next->prev = new;
77 new->next = next;
79 prev->next = new;
92 __list_add(new, head, head->next);
112 * the prev/next entries already!
115 struct list_head * prev, struct list_head * next)
117 new->next = next;
120 next->prev = new;
121 prev->next = new;
142 __list_add_rcu(new, head, head->next);
168 * Delete a list entry by making the prev/next entries
172 * the prev/next entries already!
174 static inline void __list_del(struct list_head * prev, struct list_head * next)
176 next->prev = prev;
177 prev->next = next;
188 __list_del(entry->prev, entry->next);
189 entry->next = LIST_POISON1;
219 __list_del(entry->prev, entry->next);
229 __list_del(entry->prev, entry->next);
240 __list_del(list->prev, list->next);
252 __list_del(list->prev, list->next);
262 return head->next == head;
279 struct list_head *next = head->next;
280 return (next == head) && (next == head->prev);
286 struct list_head *first = list->next;
288 struct list_head *at = head->next;
291 head->next = first;
293 last->next = at;
339 for (pos = (head)->next, prefetch(pos->next); pos != (head); \
340 pos = pos->next, prefetch(pos->next))
353 for (pos = (head)->next; pos != (head); pos = pos->next)
371 for (pos = (head)->next, n = pos->next; pos != (head); \
372 pos = n, n = pos->next)
381 for (pos = list_entry((head)->next, typeof(*pos), member), \
382 prefetch(pos->member.next); \
384 pos = list_entry(pos->member.next, typeof(*pos), member), \
385 prefetch(pos->member.next))
418 for (pos = list_entry(pos->member.next, typeof(*pos), member), \
419 prefetch(pos->member.next); \
421 pos = list_entry(pos->member.next, typeof(*pos), member), \
422 prefetch(pos->member.next))
432 for (pos = list_entry((head)->next, typeof(*pos), member), \
433 n = list_entry(pos->member.next, typeof(*pos), member); \
435 pos = n, n = list_entry(n->member.next, typeof(*n), member))
447 for (pos = (head)->next, prefetch(pos->next); pos != (head); \
448 pos = pos->next, ({ smp_read_barrier_depends(); 0;}), prefetch(pos->next))
451 for (pos = (head)->next; pos != (head); \
452 pos = pos->next, ({ smp_read_barrier_depends(); 0;}))
466 for (pos = (head)->next, n = pos->next; pos != (head); \
467 pos = n, ({ smp_read_barrier_depends(); 0;}), n = pos->next)
480 for (pos = list_entry((head)->next, typeof(*pos), member), \
481 prefetch(pos->member.next); \
483 pos = list_entry(pos->member.next, typeof(*pos), member), \
485 prefetch(pos->member.next))
499 for ((pos) = (pos)->next, prefetch((pos)->next); (pos) != (head); \
500 (pos) = (pos)->next, ({ smp_read_barrier_depends(); 0;}), prefetch((pos)->next))
514 struct hlist_node *next, **pprev;
520 #define INIT_HLIST_NODE(ptr) ((ptr)->next = NULL, (ptr)->pprev = NULL)
534 struct hlist_node *next = n->next;
536 *pprev = next;
537 if (next)
538 next->pprev = pprev;
544 n->next = LIST_POISON1;
586 n->next = first;
588 first->pprev = &n->next;
617 n->next = first;
621 first->pprev = &n->next;
625 /* next must be != NULL */
627 struct hlist_node *next)
629 n->pprev = next->pprev;
630 n->next = next;
631 next->pprev = &n->next;
636 struct hlist_node *next)
638 next->next = n->next;
639 n->next = next;
640 next->pprev = &n->next;
642 if(next->next)
643 next->next->pprev = &next->next;
649 for (pos = (head)->first; pos && ({ prefetch(pos->next); 1; }); \
650 pos = pos->next)
653 for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
665 pos && ({ prefetch(pos->next); 1;}) && \
667 pos = pos->next)
676 for (pos = (pos)->next; \
677 pos && ({ prefetch(pos->next); 1;}) && \
679 pos = pos->next)
688 for (; pos && ({ prefetch(pos->next); 1;}) && \
690 pos = pos->next)
702 pos && ({ n = pos->next; 1; }) && \
719 pos && ({ prefetch(pos->next); 1;}) && \
721 pos = pos->next, ({ smp_read_barrier_depends(); 0; }) )