Lines Matching defs:next
33 * sometimes we already know the next/prev entries and we can
39 struct list_head *next, *prev;
56 list->next = list;
64 * the prev/next entries already!
68 struct list_head *next)
70 next->prev = new;
71 new->next = next;
73 prev->next = new;
86 __list_add(new, head, head->next);
103 * Delete a list entry by making the prev/next entries
107 * the prev/next entries already!
109 static inline void __list_del(struct list_head *prev, struct list_head *next)
111 next->prev = prev;
112 prev->next = next;
117 __list_del(entry->prev, entry->next);
129 entry->next = LIST_POISON1;
149 return head->next == head;
170 list_entry((ptr)->next, type, member)
173 * list_next_entry - get the next element in list
178 list_entry((pos)->member.next, typeof(*(pos)), member)