Lines Matching refs:next
23 struct list_head *next, *prev; member
33 list->next = list; in INIT_LIST_HEAD()
45 struct list_head *next) in __list_add() argument
47 next->prev = new; in __list_add()
48 new->next = next; in __list_add()
50 prev->next = new; in __list_add()
63 __list_add(new, head, head->next); in list_add()
86 static inline void __list_del(struct list_head *prev, struct list_head *next) in __list_del() argument
88 next->prev = prev; in __list_del()
89 prev->next = next; in __list_del()
100 __list_del(entry->prev, entry->next); in list_del()
101 entry->next = LIST_POISON1; in list_del()
115 new->next = old->next; in list_replace()
116 new->next->prev = new; in list_replace()
118 new->prev->next = new; in list_replace()
134 __list_del(entry->prev, entry->next); in list_del_init()
145 __list_del(list->prev, list->next); in list_move()
157 __list_del(list->prev, list->next); in list_move_tail()
169 return list->next == head; in list_is_last()
178 return head->next == head; in list_empty()
196 struct list_head *next = head->next; in list_empty_careful() local
197 return (next == head) && (next == head->prev); in list_empty_careful()
206 return !list_empty(head) && (head->next == head->prev); in list_is_singular()
212 struct list_head *new_first = entry->next; in __list_cut_position()
213 list->next = head->next; in __list_cut_position()
214 list->next->prev = list; in __list_cut_position()
216 entry->next = list; in __list_cut_position()
217 head->next = new_first; in __list_cut_position()
241 (head->next != entry && head != entry)) in list_cut_position()
251 struct list_head *next) in __list_splice() argument
253 struct list_head *first = list->next; in __list_splice()
257 prev->next = first; in __list_splice()
259 last->next = next; in __list_splice()
260 next->prev = last; in __list_splice()
272 __list_splice(list, head, head->next); in list_splice()
298 __list_splice(list, head, head->next); in list_splice_init()
338 list_entry((ptr)->next, type, member)
361 struct list_head *pos__ = READ_ONCE(head__->next); \
371 for (pos = (head)->next; prefetch(pos->next), pos != (head); \
372 pos = pos->next)
385 for (pos = (head)->next; pos != (head); pos = pos->next)
403 for (pos = (head)->next, n = pos->next; pos != (head); \
404 pos = n, n = pos->next)
424 for (pos = list_entry((head)->next, typeof(*pos), member); \
425 prefetch(pos->member.next), &pos->member != (head); \
426 pos = list_entry(pos->member.next, typeof(*pos), member))
460 for (pos = list_entry(pos->member.next, typeof(*pos), member); \
461 prefetch(pos->member.next), &pos->member != (head); \
462 pos = list_entry(pos->member.next, typeof(*pos), member))
487 for (; prefetch(pos->member.next), &pos->member != (head); \
488 pos = list_entry(pos->member.next, typeof(*pos), member))
498 for (pos = list_entry((head)->next, typeof(*pos), member), \
499 n = list_entry(pos->member.next, typeof(*pos), member); \
501 pos = n, n = list_entry(n->member.next, typeof(*n), member))
514 for (pos = list_entry(pos->member.next, typeof(*pos), member), \
515 n = list_entry(pos->member.next, typeof(*pos), member); \
517 pos = n, n = list_entry(n->member.next, typeof(*n), member))
530 for (n = list_entry(pos->member.next, typeof(*pos), member); \
532 pos = n, n = list_entry(n->member.next, typeof(*n), member))
562 struct hlist_node *next, **pprev; member
570 h->next = NULL; in INIT_HLIST_NODE()
586 struct hlist_node *next = n->next; in __hlist_del() local
588 *pprev = next; in __hlist_del()
589 if (next) in __hlist_del()
590 next->pprev = pprev; in __hlist_del()
596 n->next = LIST_POISON1; in hlist_del()
611 n->next = first; in hlist_add_head()
613 first->pprev = &n->next; in hlist_add_head()
620 struct hlist_node *next) in hlist_add_before() argument
622 n->pprev = next->pprev; in hlist_add_before()
623 n->next = next; in hlist_add_before()
624 next->pprev = &n->next; in hlist_add_before()
629 struct hlist_node *next) in hlist_add_after() argument
631 next->next = n->next; in hlist_add_after()
632 n->next = next; in hlist_add_after()
633 next->pprev = &n->next; in hlist_add_after()
635 if(next->next) in hlist_add_after()
636 next->next->pprev = &next->next; in hlist_add_after()
642 for (pos = (head)->first; pos && ({ prefetch(pos->next); 1; }); \
643 pos = pos->next)
646 for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
658 pos && ({ prefetch(pos->next); 1;}) && \
660 pos = pos->next)
669 for (pos = (pos)->next; \
670 pos && ({ prefetch(pos->next); 1;}) && \
672 pos = pos->next)
681 for (; pos && ({ prefetch(pos->next); 1;}) && \
683 pos = pos->next)
695 pos && ({ n = pos->next; 1; }) && \