Lines Matching full:next
12 struct list_head *next, *prev;
17 list->next = list;
23 struct list_head *next)
25 next->prev = new;
26 new->next = next;
28 prev->next = new;
33 __list_add(new, head, head->next);
41 static inline void __list_del(struct list_head *prev, struct list_head *next)
43 next->prev = prev;
44 prev->next = next;
49 __list_del(entry->prev, entry->next);
56 list_entry((ptr)->next, type, member)
62 list_entry((pos)->member.next, typeof(*(pos)), member)
88 struct hlist_node *next, **pprev;
93 struct hlist_node *next = n->next;
95 *pprev = next;
96 if (next)
97 next->pprev = pprev;
103 n->next = first;
105 first->pprev = &n->next;
111 for (pos = (head)->first; pos ; pos = pos->next)
115 for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
126 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
