Lines Matching refs:next
10 * sometimes we already know the next/prev entries and we can
16 struct list_head *next, *prev;
25 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
36 * the prev/next entries already!
40 struct list_head * next)
42 next->prev = new;
43 new->next = next;
45 prev->next = new;
53 __list_add(new, head, head->next);
65 * Delete a list entry by making the prev/next entries
69 * the prev/next entries already!
72 struct list_head * next)
74 next->prev = prev;
75 prev->next = next;
80 __list_del(entry->prev, entry->next);
85 return head->next == head;
93 struct list_head *first = list->next;
97 struct list_head *at = head->next;
100 head->next = first;
102 last->next = at;
111 for (pos = (head)->next; pos != (head); pos = pos->next)