Lines Matching refs:next
19 * sometimes we already know the next/prev entries and we can
25 struct list_head *next, *prev;
34 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
41 * the prev/next entries already!
45 struct list_head * next)
47 next->prev = add;
48 add->next = next;
50 prev->next = add;
63 __list_add(add, head, head->next);
80 * Delete a list entry by making the prev/next entries
84 * the prev/next entries already!
87 struct list_head * next)
89 next->prev = prev;
90 prev->next = next;
102 __list_del(entry->prev, entry->next);
111 __list_del(entry->prev, entry->next);
121 return head->next == head;
131 struct list_head *first = list->next;
135 struct list_head *at = head->next;
138 head->next = first;
140 last->next = at;
160 for (pos = (head)->next; pos != (head); pos = pos->next)
166 * @pnext: the &struct list_head to use as a pointer to the next item.
170 for (pos = (head)->next, pnext = pos->next; pos != (head); \
171 pos = pnext, pnext = pos->next)
