Lines Matching refs:next
9 * sometimes we already know the next/prev entries and we can
15 struct list_head *next, *prev;
24 (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;
52 __list_add(new, head, head->next);
64 * Delete a list entry by making the prev/next entries
68 * the prev/next entries already!
71 struct list_head * next)
73 next->prev = prev;
74 prev->next = next;
79 __list_del(entry->prev, entry->next);
84 return head->next == head;
92 struct list_head *first = list->next;
96 struct list_head *at = head->next;
99 head->next = first;
101 last->next = at;
110 for (pos = (head)->next; pos != (head); pos = pos->next)
