Lines Matching refs:prev
13 * sometimes we already know the next/prev entries and we can
19 struct list_head *next, *prev;
28 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
35 * the prev/next entries already!
38 struct list_head *prev,
41 next->prev = new;
43 new->prev = prev;
44 prev->next = new;
70 __list_add(new, head->prev, head);
74 * Delete a list entry by making the prev/next entries
78 * the prev/next entries already!
80 static inline void __list_del(struct list_head *prev, struct list_head *next)
82 next->prev = prev;
83 prev->next = next;
93 __list_del(entry->prev, entry->next);
95 entry->prev = (void *) 0;
104 __list_del(entry->prev, entry->next);
115 __list_del(list->prev, list->next);
127 __list_del(list->prev, list->next);
144 struct list_head *last = list->prev;
147 first->prev = head;
151 at->prev = last;
204 for (pos = (head)->prev, prefetch(pos->prev); pos != (head); \
205 pos = pos->prev, prefetch(pos->prev))