Lines Matching full:next
9 * sometimes we already know the next/prev entries and we can
15 struct list_head *next, *prev;
21 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
32 * the prev/next entries already!
36 struct list_head * next)
38 next->prev = new;
39 new->next = next;
41 prev->next = new;
49 __list_add(new, head, head->next);
61 * Delete a list entry by making the prev/next entries
65 * the prev/next entries already!
68 struct list_head * next)
70 next->prev = prev;
71 prev->next = next;
76 __list_del(entry->prev, entry->next);
81 return head->next == head;
89 struct list_head *first = list->next;
93 struct list_head *at = head->next;
96 head->next = first;
98 last->next = at;
107 for (pos = (head)->next; pos != (head); pos = pos->next)
