Lines Matching refs:next
44 struct hlist_node *next, **pprev;
65 h->next = NULL;
82 struct hlist_node *next = n->next;
85 WRITE_ONCE(*pprev, next);
86 if (next)
87 next->pprev = pprev;
93 n->next = (struct hlist_node*)LIST_POISON1;
108 n->next = first;
110 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;
129 if (n->next)
130 n->next->pprev = &n->next;
135 n->pprev = &n->next;
140 return h->pprev == &h->next;
146 return !n->next && n->pprev == &h->first;
161 for (pos = (head)->first; pos ; pos = pos->next)
164 for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
175 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
178 for (pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member);\
180 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
184 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
188 pos && ({ n = pos->member.next; 1; }); \