Lines Matching refs:next
18 struct list_head *next, *prev; member
28 list->next = list; in INIT_LIST_HEAD()
40 struct list_head *next) in __list_add() argument
42 next->prev = new; in __list_add()
43 new->next = next; in __list_add()
45 prev->next = new; in __list_add()
58 __list_add(new, head, head->next); in list_add()
81 static inline void __list_del(struct list_head *prev, struct list_head *next) in __list_del() argument
83 next->prev = prev; in __list_del()
84 prev->next = next; in __list_del()
95 __list_del(entry->prev, entry->next); in list_del()
96 entry->next = LIST_POISON1; in list_del()
110 new->next = old->next; in list_replace()
111 new->next->prev = new; in list_replace()
113 new->prev->next = new; in list_replace()
129 __list_del(entry->prev, entry->next); in list_del_init()
140 __list_del(list->prev, list->next); in list_move()
152 __list_del(list->prev, list->next); in list_move_tail()
164 return list->next == head; in list_is_last()
183 return head->next == head; in list_empty()
201 struct list_head *next = head->next; in list_empty_careful() local
202 return (next == head) && (next == head->prev); in list_empty_careful()
211 return !list_empty(head) && (head->next == head->prev); in list_is_singular()
217 struct list_head *new_first = entry->next; in __list_cut_position()
218 list->next = head->next; in __list_cut_position()
219 list->next->prev = list; in __list_cut_position()
221 entry->next = list; in __list_cut_position()
222 head->next = new_first; in __list_cut_position()
246 (head->next != entry && head != entry)) in list_cut_position()
256 struct list_head *next) in __list_splice() argument
258 struct list_head *first = list->next; in __list_splice()
262 prev->next = first; in __list_splice()
264 last->next = next; in __list_splice()
265 next->prev = last; in __list_splice()
277 __list_splice(list, head, head->next); in list_splice()
303 __list_splice(list, head, head->next); in list_splice_init()
343 list_entry((ptr)->next, type, member)
366 struct list_head *pos__ = READ_ONCE(head__->next); \
376 list_entry((pos)->member.next, typeof(*(pos)), member)
392 for (pos = (head)->next; !list_is_head(pos, (head)); pos = pos->next)
409 for (pos = (head)->next, n = pos->next; pos != (head); \
410 pos = n, n = pos->next)
513 for (pos = list_entry((head)->next, typeof(*pos), member), \
514 n = list_entry(pos->member.next, typeof(*pos), member); \
516 pos = n, n = list_entry(n->member.next, typeof(*n), member))
529 for (pos = list_entry(pos->member.next, typeof(*pos), member), \
530 n = list_entry(pos->member.next, typeof(*pos), member); \
532 pos = n, n = list_entry(n->member.next, typeof(*n), member))
545 for (n = list_entry(pos->member.next, typeof(*pos), member); \
547 pos = n, n = list_entry(n->member.next, typeof(*n), member))
592 struct hlist_node *next, **pprev; member
600 h->next = NULL; in INIT_HLIST_NODE()
616 struct hlist_node *next = n->next; in __hlist_del() local
618 *pprev = next; in __hlist_del()
619 if (next) in __hlist_del()
620 next->pprev = pprev; in __hlist_del()
626 n->next = LIST_POISON1; in hlist_del()
641 n->next = first; in hlist_add_head()
643 first->pprev = &n->next; in hlist_add_head()
650 struct hlist_node *next) in hlist_add_before() argument
652 n->pprev = next->pprev; in hlist_add_before()
653 n->next = next; in hlist_add_before()
654 next->pprev = &n->next; in hlist_add_before()
659 struct hlist_node *next) in hlist_add_after() argument
661 next->next = n->next; in hlist_add_after()
662 n->next = next; in hlist_add_after()
663 next->pprev = &n->next; in hlist_add_after()
665 if(next->next) in hlist_add_after()
666 next->next->pprev = &next->next; in hlist_add_after()
672 for (pos = (head)->first; pos ; pos = pos->next)
675 for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
692 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
700 for (pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member);\
702 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
711 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
722 pos && ({ n = pos->member.next; 1; }); \