29 	list->prev = list;  in INIT_LIST_HEAD()
34 			      struct list_head *prev,
39 				struct list_head *prev,  in __list_add_valid()  argument
57 			      struct list_head *prev,  in __list_add()  argument
60 	if (!__list_add_valid(new, prev, next))  in __list_add()
63 	next->prev = new;  in __list_add()
65 	new->prev = prev;  in __list_add()
66 	WRITE_ONCE(prev->next, new);  in __list_add()
93 	__list_add(new, head->prev, head);  in list_add_tail()
103 static inline void __list_del(struct list_head * prev, struct list_head * next)  in __list_del()  argument
105 	next->prev = prev;  in __list_del()
106 	WRITE_ONCE(prev->next, next);  in __list_del()
120 	__list_del(entry->prev, entry->next);  in __list_del_entry()
127 	entry->prev = LIST_POISON2;  in list_del()
141 	new->next->prev = new;  in list_replace()
142 	new->prev = old->prev;  in list_replace()
143 	new->prev->next = new;  in list_replace()
222 	return (next == head) && (next == head->prev);  in list_empty_careful()
245 	return !list_empty(head) && (head->next == head->prev);  in list_is_singular()
253 	list->next->prev = list;  in __list_cut_position()
254 	list->prev = entry;  in __list_cut_position()
257 	new_first->prev = head;  in __list_cut_position()
311 	list->next->prev = list;  in list_cut_before()
312 	list->prev = entry->prev;  in list_cut_before()
313 	list->prev->next = list;  in list_cut_before()
315 	entry->prev = head;  in list_cut_before()
319 				 struct list_head *prev,  in __list_splice()  argument
323 	struct list_head *last = list->prev;  in __list_splice()
325 	first->prev = prev;  in __list_splice()
326 	prev->next = first;  in __list_splice()
329 	next->prev = last;  in __list_splice()
353 		__list_splice(list, head->prev, head);  in list_splice_tail()
384 		__list_splice(list, head->prev, head);  in list_splice_tail_init()
418 	list_entry((ptr)->prev, type, member)
448 	list_entry((pos)->member.prev, typeof(*(pos)), member)
464 	for (pos = (head)->prev; pos != (head); pos = pos->prev)
483 	for (pos = (head)->prev, n = pos->prev; \
485 	     pos = n, n = pos->prev)
720 				    struct hlist_node *prev)  in hlist_add_behind()  argument
722 	n->next = prev->next;  in hlist_add_behind()
723 	WRITE_ONCE(prev->next, n);  in hlist_add_behind()
724 	n->pprev = &prev->next;  in hlist_add_behind()