Lines Matching refs:next
43 struct hlist_node *next, **pprev;
64 h->next = NULL;
80 struct hlist_node *next = n->next;
83 WRITE_ONCE(*pprev, next);
84 if (next) {
85 next->pprev = pprev;
92 n->next = (struct hlist_node*)LIST_POISON1;
107 n->next = first;
109 first->pprev = &n->next;
115 static inline void hlist_add_before(struct hlist_node *n, struct hlist_node *next)
117 n->pprev = next->pprev;
118 n->next = next;
119 next->pprev = &n->next;
125 n->next = prev->next;
126 WRITE_ONCE(prev->next, n);
127 n->pprev = &prev->next;
128 if (n->next) {
129 n->next->pprev = &n->next;
135 n->pprev = &n->next;
140 return h->pprev == &h->next;
146 return !n->next && n->pprev == &h->first;
162 for ((pos) = (head)->first; (pos) ; pos = (pos)->next)
165 for ((pos) = (head)->first; (pos) && ( {n = (pos)->next; 1;} ); \
177 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member)) \
182 for ((pos) = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member); \
184 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member)) \
190 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member)) \
196 (pos) && ( {n = (pos)->member.next; 1;} ); \