Lines Matching full:next
35 struct list_head *next, *prev;
45 list->next = list;
53 * the prev/next entries already!
57 struct list_head *next)
59 next->prev = new;
60 new->next = next;
62 prev->next = new;
75 __list_add(new, head, head->next);
92 * Delete a list entry by making the prev/next entries
96 * the prev/next entries already!
98 static inline void __list_del(struct list_head * prev, struct list_head * next)
100 next->prev = prev;
101 prev->next = next;
112 __list_del(entry->prev, entry->next);
113 entry->next = LIST_POISON1;
128 for (pos = (head)->next; pos != (head); pos = pos->next)
137 for (pos = (head)->next, n = pos->next; pos != (head); \
138 pos = n, n = pos->next)
167 return head->next == head;
176 return list_empty(head) ? NULL : head->next;
187 __list_del(list->prev, list->next);
194 struct list_head *first = list->next;
196 struct list_head *at = head->next;
199 head->next = first;
201 last->next = at;
226 new->next = old->next;
227 new->next->prev = new;
229 new->prev->next = new;
