Lines Matching refs:next
53 * sometimes we already know the next/prev entries and we can
59 struct list_head *next, *prev;
68 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
75 * the prev/next entries already!
79 struct list_head *next)
81 next->prev = new;
82 new->next = next;
84 prev->next = new;
97 __list_add(new, head, head->next);
117 * the prev/next entries already!
120 struct list_head * prev, struct list_head * next)
122 new->next = next;
125 next->prev = new;
126 prev->next = new;
147 __list_add_rcu(new, head, head->next);
173 * Delete a list entry by making the prev/next entries
177 * the prev/next entries already!
179 static inline void __list_del(struct list_head * prev, struct list_head * next)
181 next->prev = prev;
182 prev->next = next;
193 __list_del(entry->prev, entry->next);
194 entry->next = LIST_POISON1;
224 __list_del(entry->prev, entry->next);
234 __list_del(entry->prev, entry->next);
245 __list_del(list->prev, list->next);
257 __list_del(list->prev, list->next);
267 return head->next == head;
284 struct list_head *next = head->next;
285 return (next == head) && (next == head->prev);
291 struct list_head *first = list->next;
293 struct list_head *at = head->next;
296 head->next = first;
298 last->next = at;
344 for (pos = (head)->next, prefetch(pos->next); pos != (head); \
345 pos = pos->next, prefetch(pos->next))
358 for (pos = (head)->next; pos != (head); pos = pos->next)
376 for (pos = (head)->next, n = pos->next; pos != (head); \
377 pos = n, n = pos->next)
386 for (pos = list_entry((head)->next, typeof(*pos), member), \
387 prefetch(pos->member.next); \
389 pos = list_entry(pos->member.next, typeof(*pos), member), \
390 prefetch(pos->member.next))
423 for (pos = list_entry(pos->member.next, typeof(*pos), member), \
424 prefetch(pos->member.next); \
426 pos = list_entry(pos->member.next, typeof(*pos), member), \
427 prefetch(pos->member.next))
437 for (pos = list_entry((head)->next, typeof(*pos), member), \
438 n = list_entry(pos->member.next, typeof(*pos), member); \
440 pos = n, n = list_entry(n->member.next, typeof(*n), member))
452 for (pos = (head)->next, prefetch(pos->next); pos != (head); \
453 pos = pos->next, ({ smp_read_barrier_depends(); 0;}), prefetch(pos->next))
456 for (pos = (head)->next; pos != (head); \
457 pos = pos->next, ({ smp_read_barrier_depends(); 0;}))
471 for (pos = (head)->next, n = pos->next; pos != (head); \
472 pos = n, ({ smp_read_barrier_depends(); 0;}), n = pos->next)
485 for (pos = list_entry((head)->next, typeof(*pos), member), \
486 prefetch(pos->member.next); \
488 pos = list_entry(pos->member.next, typeof(*pos), member), \
490 prefetch(pos->member.next))
504 for ((pos) = (pos)->next, prefetch((pos)->next); (pos) != (head); \
505 (pos) = (pos)->next, ({ smp_read_barrier_depends(); 0;}), prefetch((pos)->next))
519 struct hlist_node *next, **pprev;
525 #define INIT_HLIST_NODE(ptr) ((ptr)->next = NULL, (ptr)->pprev = NULL)
539 struct hlist_node *next = n->next;
541 *pprev = next;
542 if (next)
543 next->pprev = pprev;
549 n->next = LIST_POISON1;
591 n->next = first;
593 first->pprev = &n->next;
622 n->next = first;
626 first->pprev = &n->next;
630 /* next must be != NULL */
632 struct hlist_node *next)
634 n->pprev = next->pprev;
635 n->next = next;
636 next->pprev = &n->next;
641 struct hlist_node *next)
643 next->next = n->next;
644 n->next = next;
645 next->pprev = &n->next;
647 if(next->next)
648 next->next->pprev = &next->next;
654 for (pos = (head)->first; pos && ({ prefetch(pos->next); 1; }); \
655 pos = pos->next)
658 for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
670 pos && ({ prefetch(pos->next); 1;}) && \
672 pos = pos->next)
681 for (pos = (pos)->next; \
682 pos && ({ prefetch(pos->next); 1;}) && \
684 pos = pos->next)
693 for (; pos && ({ prefetch(pos->next); 1;}) && \
695 pos = pos->next)
707 pos && ({ n = pos->next; 1; }) && \
724 pos && ({ prefetch(pos->next); 1;}) && \
726 pos = pos->next, ({ smp_read_barrier_depends(); 0; }) )