Lines Matching full:next
22 * sometimes we already know the next/prev entries and we can
28 struct flist_head *next, *prev;
37 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
44 * the prev/next entries already!
48 struct flist_head *next)
50 next->prev = new_entry;
51 new_entry->next = next;
53 prev->next = new_entry;
67 __flist_add(new_entry, head, head->next);
77 * Delete a list entry by making the prev/next entries
81 * the prev/next entries already!
84 struct flist_head * next)
86 next->prev = prev;
87 prev->next = next;
98 __flist_del(entry->prev, entry->next);
99 entry->next = NULL;
109 __flist_del(entry->prev, entry->next);
119 return head->next == head;
124 struct flist_head *next)
126 struct flist_head *first = list->next;
130 prev->next = first;
132 last->next = next;
133 next->prev = last;
140 __flist_splice(list, head, head->next);
163 __flist_splice(list, head, head->next);
178 flist_entry((ptr)->next, type, member)
189 for (pos = (head)->next; pos != (head); pos = pos->next)
198 for (pos = (head)->next, n = pos->next; pos != (head); \
199 pos = n, n = pos->next)
