Lines Matching refs:prev
28 * sometimes we already know the next/prev entries and we can
33 struct list_head *next, *prev;
42 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
49 * the prev/next entries already!
52 struct list_head *prev,
55 next->prev = new;
57 new->prev = prev;
58 prev->next = new;
84 __list_add(new, head->prev, head);
88 * Delete a list entry by making the prev/next entries
92 * the prev/next entries already!
94 static inline void __list_del(struct list_head *prev, struct list_head *next)
96 next->prev = prev;
97 prev->next = next;
108 __list_del(entry->prev, entry->next);
110 entry->prev = LIST_POISON2;
119 __list_del(entry->prev, entry->next);
130 __list_del(list->prev, list->next);
142 __list_del(list->prev, list->next);
159 struct list_head *last = list->prev;
162 first->prev = head;
166 at->prev = last;
234 for (pos = (head)->prev; prefetch(pos->prev), pos != (head); \
235 pos = pos->prev)
265 for (pos = list_entry((head)->prev, typeof(*pos), member); \
267 pos = list_entry(pos->member.prev, typeof(*pos), member))
328 for (pos = list_entry((head)->prev, typeof(*pos), member), \
329 n = list_entry(pos->member.prev, typeof(*pos), member); \
331 pos = n, n = list_entry(n->member.prev, typeof(*n), member))