Lines Matching defs:prev
34 * sometimes we already know the next/prev entries and we can
54 list->prev = list;
61 * the prev/next entries already!
64 struct list_head *prev,
67 next->prev = new;
69 new->prev = prev;
70 prev->next = new;
96 __list_add(new, head->prev, head);
100 * Delete a list entry by making the prev/next entries
104 * the prev/next entries already!
106 static inline void __list_del(struct list_head *prev, struct list_head *next)
108 next->prev = prev;
109 prev->next = next;
114 __list_del(entry->prev, entry->next);
127 entry->prev = LIST_POISON2;