Lines Matching refs:next
33 * sometimes we already know the next/prev entries and we can
38 struct list_head *next, *prev;
47 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
54 * @next:
56 * This is only for internal list manipulation where we know the prev/next
60 struct list_head * prev, struct list_head * next)
62 next->prev = new;
63 new->next = next;
65 prev->next = new;
78 __list_add(new, head, head->next);
97 * @next:
99 * Delete a list entry by making the prev/next entries point to each other.
101 * This is only for internal list manipulation where we know the prev/next
105 struct list_head * next)
107 next->prev = prev;
108 prev->next = next;
120 __list_del(entry->prev, entry->next);
129 __list_del(entry->prev, entry->next);
139 return head->next == head;
150 struct list_head *first = list->next;
154 struct list_head *at = head->next;
157 head->next = first;
159 last->next = at;
179 for (pos = (head)->next; pos != (head); pos = pos->next)
188 for (pos = (head)->next, n = pos->next; pos != (head); \
189 pos = n, n = pos->next)