Lines Matching refs:next
36 * sometimes we already know the next/prev entries and we can
42 struct list_head *next, *prev;
52 list->next = list;
60 * the prev/next entries already!
64 struct list_head *prev, struct list_head *next)
66 next->prev = new;
67 new->next = next;
69 prev->next = new;
73 struct list_head *prev, struct list_head *next);
86 __list_add(new, head, head->next);
103 * Delete a list entry by making the prev/next entries
107 * the prev/next entries already!
109 static inline void __list_del(struct list_head *prev, struct list_head *next)
111 next->prev = prev;
112 prev->next = next;
124 __list_del(entry->prev, entry->next);
125 entry->next = (void *)0xDEADBEEF;
141 new->next = old->next;
142 new->next->prev = new;
144 new->prev->next = new;
160 __list_del(entry->prev, entry->next);
171 __list_del(list->prev, list->next);
183 __list_del(list->prev, list->next);
195 return list->next == head;
204 return head->next == head;
213 * in the process of modifying either member (next or prev)
222 struct list_head *next = head->next;
223 return (next == head) && (next == head->prev);
232 return !list_empty(head) && (head->next == head->prev);
239 struct list_head *new_first = entry->next;
240 list->next = head->next;
241 list->next->prev = list;
243 entry->next = list;
244 head->next = new_first;
268 if (list_is_singular(head) && (head->next != entry && head != entry))
277 struct list_head *prev, struct list_head *next)
279 struct list_head *first = list->next;
283 prev->next = first;
285 last->next = next;
286 next->prev = last;
298 __list_splice(list, head, head->next);
324 __list_splice(list, head, head->next);
364 list_entry((ptr)->next, type, member)
372 for (pos = (head)->next; prefetch(pos->next), pos != (head); \
373 pos = pos->next)
386 for (pos = (head)->next; pos != (head); pos = pos->next)
404 for (pos = (head)->next, n = pos->next; pos != (head); \
405 pos = n, n = pos->next)
425 for (pos = list_entry((head)->next, typeof(*pos), member); \
427 pos = list_entry(pos->member.next, typeof(*pos), member))
461 for (pos = list_entry(pos->member.next, typeof(*pos), member); \
462 prefetch(pos->member.next), &pos->member != (head); \
463 pos = list_entry(pos->member.next, typeof(*pos), member))
488 for (; prefetch(pos->member.next), &pos->member != (head); \
489 pos = list_entry(pos->member.next, typeof(*pos), member))
499 for (pos = list_entry((head)->next, typeof(*pos), member), \
500 n = list_entry(pos->member.next, typeof(*pos), member); \
502 pos = n, n = list_entry(n->member.next, typeof(*n), member))
515 for (pos = list_entry(pos->member.next, typeof(*pos), member), \
516 n = list_entry(pos->member.next, typeof(*pos), member); \
518 pos = n, n = list_entry(n->member.next, typeof(*n), member))
531 for (n = list_entry(pos->member.next, typeof(*pos), member); \
533 pos = n, n = list_entry(n->member.next, typeof(*n), member))