Lines Matching refs:next
14 * sometimes we already know the next/prev entries and we can
26 list->next = list;
34 * the prev/next entries already!
39 struct list_head *next)
41 next->prev = new;
42 new->next = next;
44 prev->next = new;
49 struct list_head *next);
62 __list_add(new, head, head->next);
80 * Delete a list entry by making the prev/next entries
84 * the prev/next entries already!
86 static inline void __list_del(struct list_head * prev, struct list_head * next)
88 next->prev = prev;
89 prev->next = next;
101 __list_del(entry->prev, entry->next);
106 __list_del(entry->prev, entry->next);
107 entry->next = LIST_POISON1;
125 new->next = old->next;
126 new->next->prev = new;
128 new->prev->next = new;
179 return list->next == head;
188 return head->next == head;
197 * in the process of modifying either member (next or prev)
206 struct list_head *next = head->next;
207 return (next == head) && (next == head->prev);
219 first = head->next;
230 return !list_empty(head) && (head->next == head->prev);
236 struct list_head *new_first = entry->next;
237 list->next = head->next;
238 list->next->prev = list;
240 entry->next = list;
241 head->next = new_first;
265 (head->next != entry && head != entry))
275 struct list_head *next)
277 struct list_head *first = list->next;
281 prev->next = first;
283 last->next = next;
284 next->prev = last;
296 __list_splice(list, head, head->next);
322 __list_splice(list, head, head->next);
362 list_entry((ptr)->next, type, member)
381 for (pos = (head)->next; pos != (head); pos = pos->next)
398 for (pos = (head)->next, n = pos->next; pos != (head); \
399 pos = n, n = pos->next)
419 for (pos = list_entry((head)->next, typeof(*pos), member); \
421 pos = list_entry(pos->member.next, typeof(*pos), member))
455 for (pos = list_entry(pos->member.next, typeof(*pos), member); \
457 pos = list_entry(pos->member.next, typeof(*pos), member))
483 pos = list_entry(pos->member.next, typeof(*pos), member))
493 for (pos = list_entry((head)->next, typeof(*pos), member), \
494 n = list_entry(pos->member.next, typeof(*pos), member); \
496 pos = n, n = list_entry(n->member.next, typeof(*n), member))
509 for (pos = list_entry(pos->member.next, typeof(*pos), member), \
510 n = list_entry(pos->member.next, typeof(*pos), member); \
512 pos = n, n = list_entry(n->member.next, typeof(*n), member))
525 for (n = list_entry(pos->member.next, typeof(*pos), member); \
527 pos = n, n = list_entry(n->member.next, typeof(*n), member))
558 n = list_entry(pos->member.next, typeof(*pos), member)
572 h->next = NULL;
588 struct hlist_node *next = n->next;
590 *pprev = next;
591 if (next)
592 next->pprev = pprev;
598 n->next = LIST_POISON1;
613 n->next = first;
615 first->pprev = &n->next;
620 /* next must be != NULL */
622 struct hlist_node *next)
624 n->pprev = next->pprev;
625 n->next = next;
626 next->pprev = &n->next;
631 struct hlist_node *next)
633 next->next = n->next;
634 n->next = next;
635 next->pprev = &n->next;
637 if(next->next)
638 next->next->pprev = &next->next;
644 n->pprev = &n->next;
663 for (pos = (head)->first; pos ; pos = pos->next)
666 for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
683 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
691 for (pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member);\
693 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
702 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
713 pos && ({ n = pos->member.next; 1; }); \
