Lines Matching refs:next
52 * sometimes we already know the next/prev entries and we can
58 struct list_head *next, *prev;
67 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
74 * the prev/next entries already!
78 struct list_head *next)
80 next->prev = new;
81 new->next = next;
83 prev->next = new;
96 __list_add(new, head, head->next);
116 * the prev/next entries already!
119 struct list_head * prev, struct list_head * next)
121 new->next = next;
124 next->prev = new;
125 prev->next = new;
146 __list_add_rcu(new, head, head->next);
172 * Delete a list entry by making the prev/next entries
176 * the prev/next entries already!
178 static inline void __list_del(struct list_head * prev, struct list_head * next)
180 next->prev = prev;
181 prev->next = next;
192 __list_del(entry->prev, entry->next);
193 entry->next = LIST_POISON1;
223 __list_del(entry->prev, entry->next);
233 __list_del(entry->prev, entry->next);
244 __list_del(list->prev, list->next);
256 __list_del(list->prev, list->next);
266 return head->next == head;
283 struct list_head *next = head->next;
284 return (next == head) && (next == head->prev);
290 struct list_head *first = list->next;
292 struct list_head *at = head->next;
295 head->next = first;
297 last->next = at;
343 for (pos = (head)->next, prefetch(pos->next); pos != (head); \
344 pos = pos->next, prefetch(pos->next))
357 for (pos = (head)->next; pos != (head); pos = pos->next)
375 for (pos = (head)->next, n = pos->next; pos != (head); \
376 pos = n, n = pos->next)
385 for (pos = list_entry((head)->next, typeof(*pos), member), \
386 prefetch(pos->member.next); \
388 pos = list_entry(pos->member.next, typeof(*pos), member), \
389 prefetch(pos->member.next))
422 for (pos = list_entry(pos->member.next, typeof(*pos), member), \
423 prefetch(pos->member.next); \
425 pos = list_entry(pos->member.next, typeof(*pos), member), \
426 prefetch(pos->member.next))
436 for (pos = list_entry((head)->next, typeof(*pos), member), \
437 n = list_entry(pos->member.next, typeof(*pos), member); \
439 pos = n, n = list_entry(n->member.next, typeof(*n), member))
451 for (pos = (head)->next, prefetch(pos->next); pos != (head); \
452 pos = pos->next, ({ smp_read_barrier_depends(); 0;}), prefetch(pos->next))
455 for (pos = (head)->next; pos != (head); \
456 pos = pos->next, ({ smp_read_barrier_depends(); 0;}))
470 for (pos = (head)->next, n = pos->next; pos != (head); \
471 pos = n, ({ smp_read_barrier_depends(); 0;}), n = pos->next)
484 for (pos = list_entry((head)->next, typeof(*pos), member), \
485 prefetch(pos->member.next); \
487 pos = list_entry(pos->member.next, typeof(*pos), member), \
489 prefetch(pos->member.next))
503 for ((pos) = (pos)->next, prefetch((pos)->next); (pos) != (head); \
504 (pos) = (pos)->next, ({ smp_read_barrier_depends(); 0;}), prefetch((pos)->next))
518 struct hlist_node *next, **pprev;
524 #define INIT_HLIST_NODE(ptr) ((ptr)->next = NULL, (ptr)->pprev = NULL)
538 struct hlist_node *next = n->next;
540 *pprev = next;
541 if (next)
542 next->pprev = pprev;
548 n->next = LIST_POISON1;
590 n->next = first;
592 first->pprev = &n->next;
621 n->next = first;
625 first->pprev = &n->next;
629 /* next must be != NULL */
631 struct hlist_node *next)
633 n->pprev = next->pprev;
634 n->next = next;
635 next->pprev = &n->next;
640 struct hlist_node *next)
642 next->next = n->next;
643 n->next = next;
644 next->pprev = &n->next;
646 if(next->next)
647 next->next->pprev = &next->next;
653 for (pos = (head)->first; pos && ({ prefetch(pos->next); 1; }); \
654 pos = pos->next)
657 for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
669 pos && ({ prefetch(pos->next); 1;}) && \
671 pos = pos->next)
680 for (pos = (pos)->next; \
681 pos && ({ prefetch(pos->next); 1;}) && \
683 pos = pos->next)
692 for (; pos && ({ prefetch(pos->next); 1;}) && \
694 pos = pos->next)
706 pos && ({ n = pos->next; 1; }) && \
723 pos && ({ prefetch(pos->next); 1;}) && \
725 pos = pos->next, ({ smp_read_barrier_depends(); 0; }) )