Lines Matching refs:next
36 * sometimes we already know the next/prev entries and we can
42 struct list_head *next, *prev;
51 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
58 * the prev/next entries already!
62 struct list_head *next)
64 next->prev = new;
65 new->next = next;
67 prev->next = new;
80 __list_add(new, head, head->next);
97 * Delete a list entry by making the prev/next entries
101 * the prev/next entries already!
103 static inline void __list_del(struct list_head * prev, struct list_head * next)
105 next->prev = prev;
106 prev->next = next;
117 __list_del(entry->prev, entry->next);
118 entry->next = LIST_POISON1;
128 __list_del(entry->prev, entry->next);
139 __list_del(list->prev, list->next);
151 __list_del(list->prev, list->next);
161 return head->next == head;
167 struct list_head *first = list->next;
169 struct list_head *at = head->next;
172 head->next = first;
174 last->next = at;
220 for (pos = (head)->next; pos != (head); \
221 pos = pos->next)
234 for (pos = (head)->next; pos != (head); pos = pos->next)
251 for (pos = (head)->next, n = pos->next; pos != (head); \
252 pos = n, n = pos->next)
261 for (pos = list_entry((head)->next, typeof(*pos), member); \
263 pos = list_entry(pos->member.next, typeof(*pos), member))
284 for (pos = list_entry((head)->next, typeof(*pos), member), \
285 n = list_entry(pos->member.next, typeof(*pos), member); \
287 pos = n, n = list_entry(n->member.next, typeof(*n), member))