Lines Matching refs:next
53 * sometimes we already know the next/prev entries and we can
59 struct mlist_head *next, *prev;
70 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
78 * the prev/next entries already!
82 struct mlist_head *next)
84 next->prev = new;
85 new->next = next;
87 prev->next = new;
101 __list_add(new, head, head->next);
121 * Delete a list entry by making the prev/next entries
125 * the prev/next entries already!
128 struct mlist_head *next)
130 next->prev = prev;
131 prev->next = next;
145 __list_del(entry->prev, entry->next);
146 entry->next = entry->prev = 0;
156 __list_del(entry->prev, entry->next);
167 return (head->next == head);
178 struct mlist_head *first = list->next;
182 struct mlist_head *at = head->next;
185 head->next = first;
187 last->next = at;
217 for (pos = (head)->next, prefetch(pos->next); pos != (head); \
218 pos = pos->next, prefetch(pos->next))
228 for (pos = (head)->next, n = pos->next; pos != (head); \
229 pos = n, n = pos->next)