24 	WRITE_ONCE(list->next, list);  in INIT_LIST_HEAD_RCU()
32 #define list_next_rcu(list)	(*((struct list_head __rcu **)(&(list)->next)))
88 		struct list_head *prev, struct list_head *next)  in __list_add_rcu()  argument
90 	if (!__list_add_valid(new, prev, next))  in __list_add_rcu()
93 	new->next = next;  in __list_add_rcu()
96 	next->prev = new;  in __list_add_rcu()
117 	__list_add_rcu(new, head, head->next);  in list_add_rcu()
247 	new->next = old->next;  in list_replace_rcu()
250 	new->next->prev = new;  in list_replace_rcu()
275 					  struct list_head *next,  in __list_splice_init_rcu()  argument
278 	struct list_head *first = list->next;  in __list_splice_init_rcu()
308 	last->next = next;  in __list_splice_init_rcu()
311 	next->prev = last;  in __list_splice_init_rcu()
326 		__list_splice_init_rcu(list, head, head->next, sync);  in list_splice_init_rcu()
400 	struct list_head *__next = READ_ONCE(__ptr->next); \
420 	struct list_head *__next = READ_ONCE(__ptr->next); \
438 	     pos = list_entry_rcu((head)->next, typeof(*pos), member);	\
440 		pos = list_entry_rcu(pos->member.next, typeof(*pos), member))
457 	     pos = list_entry_rcu((head)->next, typeof(*pos), member);	\
459 		pos = list_entry_rcu(pos->member.next, typeof(*pos), member))
491 	for (pos = list_entry_lockless((head)->next, typeof(*pos), member); \
493 	     pos = list_entry_lockless(pos->member.next, typeof(*pos), member))
514 	for (pos = list_entry_rcu(pos->member.next, typeof(*pos), member); \
516 	     pos = list_entry_rcu(pos->member.next, typeof(*pos), member))
537 		pos = list_entry_rcu(pos->member.next, typeof(*(pos)), member))
576 	struct hlist_node *next = old->next;  in hlist_replace_rcu()  local
578 	new->next = next;  in hlist_replace_rcu()
581 	if (next)  in hlist_replace_rcu()
582 		WRITE_ONCE(new->next->pprev, &new->next);  in hlist_replace_rcu()
611 #define hlist_next_rcu(node)	(*((struct hlist_node __rcu **)(&(node)->next)))
638 	n->next = first;  in hlist_add_head_rcu()
642 		WRITE_ONCE(first->pprev, &n->next);  in hlist_add_head_rcu()
670 	for (i = h->first; i; i = i->next)  in hlist_add_tail_rcu()
674 		n->next = last->next;  in hlist_add_tail_rcu()
675 		WRITE_ONCE(n->pprev, &last->next);  in hlist_add_tail_rcu()
701 					struct hlist_node *next)  in hlist_add_before_rcu()  argument
703 	WRITE_ONCE(n->pprev, next->pprev);  in hlist_add_before_rcu()
704 	n->next = next;  in hlist_add_before_rcu()
706 	WRITE_ONCE(next->pprev, &n->next);  in hlist_add_before_rcu()
730 	n->next = prev->next;  in hlist_add_behind_rcu()
731 	WRITE_ONCE(n->pprev, &prev->next);  in hlist_add_behind_rcu()
733 	if (n->next)  in hlist_add_behind_rcu()
734 		WRITE_ONCE(n->next->pprev, &n->next);  in hlist_add_behind_rcu()