Lines Matching refs:next
12 * sometimes we already know the next/prev entries and we can
18 struct list_head *next, *prev;
27 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
35 * the prev/next entries already!
39 struct list_head * next)
41 next->prev = new;
42 new->next = next;
44 prev->next = new;
57 __list_add(new, head, head->next);
74 * Delete a list entry by making the prev/next entries
78 * the prev/next entries already!
81 struct list_head * next)
83 next->prev = prev;
84 prev->next = next;
94 __list_del(entry->prev, entry->next);
103 __list_del(entry->prev, entry->next);
113 return head->next == head;
123 struct list_head *first = list->next;
127 struct list_head *at = head->next;
130 head->next = first;
132 last->next = at;
154 for (pos = (head)->next; pos != (head); \
155 pos = pos->next)