Lines Matching refs:next

55  * sometimes we already know the next/prev entries and we can
61 struct list_head *next, *prev;
71 list->next = list;
79 * the prev/next entries already!
83 struct list_head *next)
85 next->prev = new;
86 new->next = next;
88 prev->next = new;
101 __list_add(new, head, head->next);
118 * Delete a list entry by making the prev/next entries
122 * the prev/next entries already!
124 static inline void __list_del(struct list_head * prev, struct list_head * next)
126 next->prev = prev;
127 prev->next = next;
138 __list_del(entry->prev, entry->next);
139 entry->next = LIST_POISON1;
149 __list_del(entry->prev, entry->next);
160 __list_del(list->prev, list->next);
172 __list_del(list->prev, list->next);
182 return head->next == head;
199 struct list_head *next = head->next;
200 return (next == head) && (next == head->prev);
206 struct list_head *first = list->next;
208 struct list_head *at = head->next;
211 head->next = first;
213 last->next = at;
272 for (pos = (head)->next; pos != (head); \
273 pos = pos->next)
291 for (pos = (head)->next, n = pos->next; pos != (head); \
292 pos = n, n = pos->next)
301 for (pos = list_entry((head)->next, typeof(*pos), member); \
303 pos = list_entry(pos->member.next, typeof(*pos), member))
334 for (pos = list_entry(pos->member.next, typeof(*pos), member); \
336 pos = list_entry(pos->member.next, typeof(*pos), member))
346 for (pos = list_entry((head)->next, typeof(*pos), member), \
347 n = list_entry(pos->member.next, typeof(*pos), member); \
349 pos = n, n = list_entry(n->member.next, typeof(*n), member))
360 for (pos = list_entry(pos->member.next, typeof(*pos), member), \
361 n = list_entry(pos->member.next, typeof(*pos), member); \
363 pos = n, n = list_entry(n->member.next, typeof(*n), member))