Lines Matching refs:next
28 * sometimes we already know the next/prev entries and we can
33 struct list_head *next, *prev;
42 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
49 * the prev/next entries already!
53 struct list_head *next)
55 next->prev = new;
56 new->next = next;
58 prev->next = new;
71 __list_add(new, head, head->next);
88 * Delete a list entry by making the prev/next entries
92 * the prev/next entries already!
94 static inline void __list_del(struct list_head *prev, struct list_head *next)
96 next->prev = prev;
97 prev->next = next;
108 __list_del(entry->prev, entry->next);
109 entry->next = LIST_POISON1;
119 __list_del(entry->prev, entry->next);
130 __list_del(list->prev, list->next);
142 __list_del(list->prev, list->next);
152 return head->next == head;
158 struct list_head *first = list->next;
160 struct list_head *at = head->next;
163 head->next = first;
165 last->next = at;
212 for (pos = (head)->next; pos != (head); \
213 pos = pos->next)
226 for (pos = (head)->next; pos != (head); pos = pos->next)
244 for (pos = (head)->next, n = pos->next; pos != (head); \
245 pos = n, n = pos->next)
254 for (pos = list_entry((head)->next, typeof(*pos), member); \
256 pos = list_entry(pos->member.next, typeof(*pos), member))
287 for (pos = list_entry(pos->member.next, typeof(*pos), member); \
289 pos = list_entry(pos->member.next, typeof(*pos), member))
300 for (pos = list_entry((head)->next, typeof(*pos), member), \
301 n = list_entry(pos->member.next, typeof(*pos), member); \
303 pos = n, n = list_entry(n->member.next, typeof(*n), member))
314 for (pos = list_entry(pos->member.next, typeof(*pos), member), \
315 n = list_entry(pos->member.next, typeof(*pos), member); \
317 pos = n, n = list_entry(n->member.next, typeof(*n), member))