15  * sometimes we already know the next/prev entries and we can
27 	list->next = list;  in INIT_LIST_HEAD()
35  * the prev/next entries already!
40 			      struct list_head *next)  in __list_add()  argument
42 	next->prev = new;  in __list_add()
43 	new->next = next;  in __list_add()
45 	prev->next = new;  in __list_add()
50 			      struct list_head *next);
63 	__list_add(new, head, head->next);  in list_add()
81  * Delete a list entry by making the prev/next entries
85  * the prev/next entries already!
87 static inline void __list_del(struct list_head * prev, struct list_head * next)  in __list_del()  argument
89 	next->prev = prev;  in __list_del()
90 	WRITE_ONCE(prev->next, next);  in __list_del()
102 	__list_del(entry->prev, entry->next);  in __list_del_entry()
107 	__list_del(entry->prev, entry->next);  in list_del()
108 	entry->next = LIST_POISON1;  in list_del()
126 	new->next = old->next;  in list_replace()
127 	new->next->prev = new;  in list_replace()
129 	new->prev->next = new;  in list_replace()
180 	return list->next == head;  in list_is_last()
189 	return head->next == head;  in list_empty()
198  * in the process of modifying either member (next or prev)
207 	struct list_head *next = head->next;  in list_empty_careful()  local
208 	return (next == head) && (next == head->prev);  in list_empty_careful()
220 		first = head->next;  in list_rotate_left()
231 	return !list_empty(head) && (head->next == head->prev);  in list_is_singular()
237 	struct list_head *new_first = entry->next;  in __list_cut_position()
238 	list->next = head->next;  in __list_cut_position()
239 	list->next->prev = list;  in __list_cut_position()
241 	entry->next = list;  in __list_cut_position()
242 	head->next = new_first;  in __list_cut_position()
266 		(head->next != entry && head != entry))  in list_cut_position()
276 				 struct list_head *next)  in __list_splice()  argument
278 	struct list_head *first = list->next;  in __list_splice()
282 	prev->next = first;  in __list_splice()
284 	last->next = next;  in __list_splice()
285 	next->prev = last;  in __list_splice()
297 		__list_splice(list, head, head->next);  in list_splice()
323 		__list_splice(list, head, head->next);  in list_splice_init()
363 	list_entry((ptr)->next, type, member)
388  * list_next_entry - get the next element in list
393 	list_entry((pos)->member.next, typeof(*(pos)), member)
409 	for (pos = (head)->next; pos != (head); pos = pos->next)
426 	for (pos = (head)->next, n = pos->next; pos != (head); \
427 		pos = n, n = pos->next)
600 	h->next = NULL;  in INIT_HLIST_NODE()
616 	struct hlist_node *next = n->next;  in __hlist_del()  local
619 	WRITE_ONCE(*pprev, next);  in __hlist_del()
620 	if (next)  in __hlist_del()
621 		next->pprev = pprev;  in __hlist_del()
627 	n->next = LIST_POISON1;  in hlist_del()
642 	n->next = first;  in hlist_add_head()
644 		first->pprev = &n->next;  in hlist_add_head()
649 /* next must be != NULL */
651 					struct hlist_node *next)  in hlist_add_before()  argument
653 	n->pprev = next->pprev;  in hlist_add_before()
654 	n->next = next;  in hlist_add_before()
655 	next->pprev = &n->next;  in hlist_add_before()
662 	n->next = prev->next;  in hlist_add_behind()
663 	prev->next = n;  in hlist_add_behind()
664 	n->pprev = &prev->next;  in hlist_add_behind()
666 	if (n->next)  in hlist_add_behind()
667 		n->next->pprev  = &n->next;  in hlist_add_behind()
673 	n->pprev = &n->next;  in hlist_add_fake()
678 	return h->pprev == &h->next;  in hlist_fake()
697 	for (pos = (head)->first; pos ; pos = pos->next)
700 	for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
717 	     pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
725 	for (pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member);\
727 	     pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
736 	     pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
747 	     pos && ({ n = pos->member.next; 1; });			\
760 	begin->prev->next = end->next;  in list_del_range()
761 	end->next->prev = begin->prev;  in list_del_range()
770 	for (; pos != (head); pos = pos->next)