Lines Matching refs:next
19 * sometimes we already know the next/prev entries and we can
25 struct list_head * next, * prev;
36 ptr->next = ptr;
44 * the prev/next entries already!
48 struct list_head * next)
50 next->prev = new_entry;
51 new_entry->next = next;
53 prev->next = new_entry;
66 __list_add(new_entry, head, head->next);
83 * Delete a list entry by making the prev/next entries
87 * the prev/next entries already!
90 struct list_head * next)
92 next->prev = prev;
93 prev->next = next;
103 __list_del(entry->prev, entry->next);
112 __list_del(entry->prev, entry->next);
122 return head->next == head;
132 struct list_head * first = list->next;
136 struct list_head * at = head->next;
139 head->next = first;
141 last->next = at;
161 for (pos = (head)->next; pos != (head); pos = pos->next)
170 for (pos = (head)->next, n = pos->next; pos != (head); \
171 pos = n, n = pos->next)
