Lines Matching refs:prev
55 * sometimes we already know the next/prev entries and we can
61 struct list_head *next, *prev;
72 list->prev = list;
79 * the prev/next entries already!
82 struct list_head *prev,
85 next->prev = new;
87 new->prev = prev;
88 prev->next = new;
114 __list_add(new, head->prev, head);
118 * Delete a list entry by making the prev/next entries
122 * the prev/next entries already!
124 static inline void __list_del(struct list_head * prev, struct list_head * next)
126 next->prev = prev;
127 prev->next = next;
138 __list_del(entry->prev, entry->next);
140 entry->prev = LIST_POISON2;
149 __list_del(entry->prev, entry->next);
160 __list_del(list->prev, list->next);
172 __list_del(list->prev, list->next);
200 return (next == head) && (next == head->prev);
207 struct list_head *last = list->prev;
210 first->prev = head;
214 at->prev = last;
281 for (pos = (head)->prev; pos != (head); \
282 pos = pos->prev)
312 for (pos = list_entry((head)->prev, typeof(*pos), member); \
314 pos = list_entry(pos->member.prev, typeof(*pos), member))
374 for (pos = list_entry((head)->prev, typeof(*pos), member), \
375 n = list_entry(pos->member.prev, typeof(*pos), member); \
377 pos = n, n = list_entry(n->member.prev, typeof(*n), member))