Lines Matching refs:next
16 * sometimes we already know the next/prev entries and we can
22 struct list_head *next, *prev;
32 list->next = list;
40 * the prev/next entries already!
44 struct list_head *next)
46 next->prev = new;
47 new->next = next;
49 prev->next = new;
62 __list_add(new, head, head->next);
82 * the prev/next entries already!
85 struct list_head * prev, struct list_head * next)
87 new->next = next;
90 next->prev = new;
91 prev->next = new;
112 __list_add_rcu(new, head, head->next);
138 * Delete a list entry by making the prev/next entries
142 * the prev/next entries already!
144 static inline void __list_del(struct list_head * prev, struct list_head * next)
146 next->prev = prev;
147 prev->next = next;
158 __list_del(entry->prev, entry->next);
159 entry->next = LIST_POISON1;
189 __list_del(entry->prev, entry->next);
202 new->next = old->next;
203 new->next->prev = new;
205 new->prev->next = new;
226 new->next = old->next;
229 new->next->prev = new;
230 new->prev->next = new;
240 __list_del(entry->prev, entry->next);
251 __list_del(list->prev, list->next);
263 __list_del(list->prev, list->next);
275 return list->next == head;
284 return head->next == head;
293 * in the process of modifying either member (next or prev)
302 struct list_head *next = head->next;
303 return (next == head) && (next == head->prev);
309 struct list_head *first = list->next;
311 struct list_head *at = head->next;
314 head->next = first;
316 last->next = at;
362 for (pos = (head)->next; prefetch(pos->next), pos != (head); \
363 pos = pos->next)
376 for (pos = (head)->next; pos != (head); pos = pos->next)
394 for (pos = (head)->next, n = pos->next; pos != (head); \
395 pos = n, n = pos->next)
404 for (pos = list_entry((head)->next, typeof(*pos), member); \
405 prefetch(pos->member.next), &pos->member != (head); \
406 pos = list_entry(pos->member.next, typeof(*pos), member))
440 for (pos = list_entry(pos->member.next, typeof(*pos), member); \
441 prefetch(pos->member.next), &pos->member != (head); \
442 pos = list_entry(pos->member.next, typeof(*pos), member))
453 for (; prefetch(pos->member.next), &pos->member != (head); \
454 pos = list_entry(pos->member.next, typeof(*pos), member))
464 for (pos = list_entry((head)->next, typeof(*pos), member), \
465 n = list_entry(pos->member.next, typeof(*pos), member); \
467 pos = n, n = list_entry(n->member.next, typeof(*n), member))
480 for (pos = list_entry(pos->member.next, typeof(*pos), member), \
481 n = list_entry(pos->member.next, typeof(*pos), member); \
483 pos = n, n = list_entry(n->member.next, typeof(*n), member))
496 for (n = list_entry(pos->member.next, typeof(*pos), member); \
498 pos = n, n = list_entry(n->member.next, typeof(*n), member))
526 for (pos = (head)->next; \
527 prefetch(rcu_dereference(pos)->next), pos != (head); \
528 pos = pos->next)
531 for (pos = (head)->next; \
533 pos = pos->next)
548 for (pos = (head)->next; \
549 n = rcu_dereference(pos)->next, pos != (head); \
563 for (pos = list_entry((head)->next, typeof(*pos), member); \
564 prefetch(rcu_dereference(pos)->member.next), \
566 pos = list_entry(pos->member.next, typeof(*pos), member))
581 for ((pos) = (pos)->next; \
582 prefetch(rcu_dereference((pos))->next), (pos) != (head); \
583 (pos) = (pos)->next)
597 struct hlist_node *next, **pprev;
605 h->next = NULL;
621 struct hlist_node *next = n->next;
623 *pprev = next;
624 if (next)
625 next->pprev = pprev;
631 n->next = LIST_POISON1;
678 struct hlist_node *next = old->next;
680 new->next = next;
683 if (next)
684 new->next->pprev = &new->next;
692 n->next = first;
694 first->pprev = &n->next;
723 n->next = first;
727 first->pprev = &n->next;
731 /* next must be != NULL */
733 struct hlist_node *next)
735 n->pprev = next->pprev;
736 n->next = next;
737 next->pprev = &n->next;
742 struct hlist_node *next)
744 next->next = n->next;
745 n->next = next;
746 next->pprev = &n->next;
748 if(next->next)
749 next->next->pprev = &next->next;
755 * @next: the existing element to add the new element before.
771 struct hlist_node *next)
773 n->pprev = next->pprev;
774 n->next = next;
776 next->pprev = &n->next;
801 n->next = prev->next;
802 n->pprev = &prev->next;
804 prev->next = n;
805 if (n->next)
806 n->next->pprev = &n->next;
812 for (pos = (head)->first; pos && ({ prefetch(pos->next); 1; }); \
813 pos = pos->next)
816 for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
828 pos && ({ prefetch(pos->next); 1;}) && \
830 pos = pos->next)
839 for (pos = (pos)->next; \
840 pos && ({ prefetch(pos->next); 1;}) && \
842 pos = pos->next)
851 for (; pos && ({ prefetch(pos->next); 1;}) && \
853 pos = pos->next)
865 pos && ({ n = pos->next; 1; }) && \
882 rcu_dereference(pos) && ({ prefetch(pos->next); 1;}) && \
884 pos = pos->next)