38 	WRITE_ONCE(list->prev, list);  in INIT_LIST_HEAD()
54 							     struct list_head *prev,
66 					     struct list_head *prev,  in __list_add_valid()  argument
83 		if (likely(next->prev == prev && prev->next == next && new != prev && new != next))  in __list_add_valid()
88 	ret &= __list_add_valid_or_report(new, prev, next);  in __list_add_valid()
111 		struct list_head *prev = entry->prev;  in __list_del_entry_valid()  local
119 		if (likely(prev->next == entry && next->prev == entry))  in __list_del_entry_valid()
129 				struct list_head *prev,  in __list_add_valid()  argument
147 			      struct list_head *prev,  in __list_add()  argument
150 	if (!__list_add_valid(new, prev, next))  in __list_add()
153 	next->prev = new;  in __list_add()
155 	new->prev = prev;  in __list_add()
156 	WRITE_ONCE(prev->next, new);  in __list_add()
183 	__list_add(new, head->prev, head);  in list_add_tail()
193 static inline void __list_del(struct list_head * prev, struct list_head * next)  in __list_del()  argument
195 	next->prev = prev;  in __list_del()
196 	WRITE_ONCE(prev->next, next);  in __list_del()
209 	__list_del(entry->prev, entry->next);  in __list_del_clearprev()
210 	entry->prev = NULL;  in __list_del_clearprev()
218 	__list_del(entry->prev, entry->next);  in __list_del_entry()
231 	entry->prev = LIST_POISON2;  in list_del()
245 	new->next->prev = new;  in list_replace()
246 	new->prev = old->prev;  in list_replace()
247 	new->prev->next = new;  in list_replace()
272 	struct list_head *pos = entry2->prev;  in list_swap()
327 	first->prev->next = last->next;  in list_bulk_move_tail()
328 	last->next->prev = first->prev;  in list_bulk_move_tail()
330 	head->prev->next = first;  in list_bulk_move_tail()
331 	first->prev = head->prev;  in list_bulk_move_tail()
334 	head->prev = last;  in list_bulk_move_tail()
344 	return list->prev == head;  in list_is_first()
390 	WRITE_ONCE(entry->prev, entry);  in list_del_init_careful()
410 	return list_is_head(next, head) && (next == READ_ONCE(head->prev));  in list_empty_careful()
451 	return !list_empty(head) && (head->next == head->prev);  in list_is_singular()
459 	list->next->prev = list;  in __list_cut_position()
460 	list->prev = entry;  in __list_cut_position()
463 	new_first->prev = head;  in __list_cut_position()
516 	list->next->prev = list;  in list_cut_before()
517 	list->prev = entry->prev;  in list_cut_before()
518 	list->prev->next = list;  in list_cut_before()
520 	entry->prev = head;  in list_cut_before()
524 				 struct list_head *prev,  in __list_splice()  argument
528 	struct list_head *last = list->prev;  in __list_splice()
530 	first->prev = prev;  in __list_splice()
531 	prev->next = first;  in __list_splice()
534 	next->prev = last;  in __list_splice()
558 		__list_splice(list, head->prev, head);  in list_splice_tail()
589 		__list_splice(list, head->prev, head);  in list_splice_tail_init()
623 	list_entry((ptr)->prev, type, member)
666 	list_entry((pos)->member.prev, typeof(*(pos)), member)
715 	for (pos = (head)->prev; !list_is_head(pos, (head)); pos = pos->prev)
735 	for (pos = (head)->prev, n = pos->prev; \
737 	     pos = n, n = pos->prev)
1051 				    struct hlist_node *prev)  in hlist_add_behind()  argument
1053 	WRITE_ONCE(n->next, prev->next);  in hlist_add_behind()
1054 	WRITE_ONCE(prev->next, n);  in hlist_add_behind()
1055 	WRITE_ONCE(n->pprev, &prev->next);  in hlist_add_behind()