Lines Matching refs:next
34 * sometimes we already know the next/prev entries and we can
53 list->next = list;
61 * the prev/next entries already!
65 struct list_head *next)
67 next->prev = new;
68 new->next = next;
70 prev->next = new;
83 __list_add(new, head, head->next);
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);
126 entry->next = LIST_POISON1;
146 return head->next == head;
167 list_entry((ptr)->next, type, member)
170 * list_next_entry - get the next element in list
175 list_entry((pos)->member.next, typeof(*(pos)), member)
231 n->next = first;
233 first->pprev = &n->next;
254 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))