Lines Matching full:next
19 * sometimes we already know the next/prev entries and we can
25 struct list_head *next, *prev;
31 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
38 * the prev/next entries already!
42 struct list_head * next)
44 next->prev = add;
45 add->next = next;
47 prev->next = add;
60 __list_add(add, head, head->next);
77 * Delete a list entry by making the prev/next entries
81 * the prev/next entries already!
84 struct list_head * next)
86 next->prev = prev;
87 prev->next = next;
99 __list_del(entry->prev, entry->next);
108 __list_del(entry->prev, entry->next);
118 return head->next == head;
128 struct list_head *first = list->next;
132 struct list_head *at = head->next;
135 head->next = first;
137 last->next = at;
157 for (pos = (head)->next; pos != (head); pos = pos->next)
163 * @pnext: the &struct list_head to use as a pointer to the next item.
167 for (pos = (head)->next, pnext = pos->next; pos != (head); \
168 pos = pnext, pnext = pos->next)
