Lines Matching refs:next
14 * sometimes we already know the next/prev entries and we can
20 struct list_head *next, *prev;
30 list->next = list;
38 * the prev/next entries already!
42 struct list_head *next)
44 next->prev = new;
45 new->next = next;
47 prev->next = new;
60 __list_add(new, head, head->next);
64 * Delete a list entry by making the prev/next entries
68 * the prev/next entries already!
70 static inline void __list_del(struct list_head * prev, struct list_head * next)
72 next->prev = prev;
73 prev->next = next;
82 __list_del(entry->prev, entry->next);
93 __list_del(entry->prev, entry->next);
94 entry->next = LIST_POISON1;
112 for (pos = (head)->next; pos != (head); pos = pos->next)
121 for (pos = (head)->next, n = pos->next; pos != (head); \
122 pos = n, n = pos->next)