Lines Matching refs:next

67 	struct list_head *next;
75 list->next = list->prev = list;
82 return (head->next == head);
89 entry->next->prev = entry->prev;
90 entry->prev->next = entry->next;
95 struct list_head *next)
98 next->prev = new;
99 new->next = next;
101 prev->next = new;
115 list_entry((ptr)->next, type, member)
118 for (p = (head)->next; p != (head); p = p->next)
121 for (p = (head)->next, n = p->next; p != (head); p = n, n = p->next)
124 for (p = list_entry((h)->next, typeof(*p), field); &p->field != (h); \
125 p = list_entry(p->field.next, typeof(*p), field))
128 for (p = list_entry((h)->next, typeof(*p), field), \
129 n = list_entry(p->field.next, typeof(*p), field); &p->field != (h);\
130 p = n, n = list_entry(n->field.next, typeof(*n), field))
142 _list_add(new, head, head->next);
170 struct list_head *next)
177 first = list->next;
180 prev->next = first;
181 last->next = next;
182 next->prev = last;
189 _list_splice(list, head, head->next);
203 _list_splice(list, head, head->next);
224 struct hlist_node *next, **pprev;
232 (node)->next = NULL; \
254 if (n->next)
255 n->next->pprev = n->pprev;
256 *n->pprev = n->next;
273 n->next = h->first;
275 h->first->pprev = &n->next;
281 hlist_add_before(struct hlist_node *n, struct hlist_node *next)
284 n->pprev = next->pprev;
285 n->next = next;
286 next->pprev = &n->next;
291 hlist_add_after(struct hlist_node *n, struct hlist_node *next)
294 next->next = n->next;
295 n->next = next;
296 next->pprev = &n->next;
297 if (next->next)
298 next->next->pprev = &next->next;
314 for (p = (head)->first; p; p = p->next)
317 for (p = (head)->first; p && ({ n = p->next; 1; }); p = n)
321 p ? (tp = hlist_entry(p, typeof(*tp), field)): NULL; p = p->next)
324 for (p = (p)->next; \
325 p ? (tp = hlist_entry(p, typeof(*tp), field)): NULL; p = p->next)
328 for (; p ? (tp = hlist_entry(p, typeof(*tp), field)): NULL; p = p->next)
332 (n = p->next) | (tp = hlist_entry(p, typeof(*tp), field)) : \