33 	WRITE_ONCE(list->next, list);  in INIT_LIST_HEAD_RCU()
41 #define list_next_rcu(list)	(*((struct list_head __rcu **)(&(list)->next)))
86 		struct list_head *prev, struct list_head *next)  in __list_add_rcu()  argument
88 	if (!__list_add_valid(new, prev, next))  in __list_add_rcu()
91 	new->next = next;  in __list_add_rcu()
94 	next->prev = new;  in __list_add_rcu()
115 	__list_add_rcu(new, head, head->next);  in list_add_rcu()
209 	new->next = old->next;  in list_replace_rcu()
212 	new->next->prev = new;  in list_replace_rcu()
237 					  struct list_head *next,  in __list_splice_init_rcu()  argument
240 	struct list_head *first = list->next;  in __list_splice_init_rcu()
270 	last->next = next;  in __list_splice_init_rcu()
273 	next->prev = last;  in __list_splice_init_rcu()
288 		__list_splice_init_rcu(list, head, head->next, sync);  in list_splice_init_rcu()
354 	struct list_head *__next = READ_ONCE(__ptr->next); \
374 	struct list_head *__next = READ_ONCE(__ptr->next); \
392 	     pos = list_entry_rcu((head)->next, typeof(*pos), member);	\
394 		pos = list_entry_rcu(pos->member.next, typeof(*pos), member))
411 	     pos = list_entry_rcu((head)->next, typeof(*pos), member);	\
413 		pos = list_entry_rcu(pos->member.next, typeof(*pos), member))
445 	for (pos = list_entry_lockless((head)->next, typeof(*pos), member); \
447 	     pos = list_entry_lockless(pos->member.next, typeof(*pos), member))
468 	for (pos = list_entry_rcu(pos->member.next, typeof(*pos), member); \
470 	     pos = list_entry_rcu(pos->member.next, typeof(*pos), member))
491 		pos = list_entry_rcu(pos->member.next, typeof(*(pos)), member))
528 	struct hlist_node *next = old->next;  in hlist_replace_rcu()  local
530 	new->next = next;  in hlist_replace_rcu()
533 	if (next)  in hlist_replace_rcu()
534 		WRITE_ONCE(new->next->pprev, &new->next);  in hlist_replace_rcu()
563 #define hlist_next_rcu(node)	(*((struct hlist_node __rcu **)(&(node)->next)))
590 	n->next = first;  in hlist_add_head_rcu()
594 		WRITE_ONCE(first->pprev, &n->next);  in hlist_add_head_rcu()
622 	for (i = h->first; i; i = i->next)  in hlist_add_tail_rcu()
626 		n->next = last->next;  in hlist_add_tail_rcu()
627 		WRITE_ONCE(n->pprev, &last->next);  in hlist_add_tail_rcu()
653 					struct hlist_node *next)  in hlist_add_before_rcu()  argument
655 	WRITE_ONCE(n->pprev, next->pprev);  in hlist_add_before_rcu()
656 	n->next = next;  in hlist_add_before_rcu()
658 	WRITE_ONCE(next->pprev, &n->next);  in hlist_add_before_rcu()
682 	n->next = prev->next;  in hlist_add_behind_rcu()
683 	WRITE_ONCE(n->pprev, &prev->next);  in hlist_add_behind_rcu()
685 	if (n->next)  in hlist_add_behind_rcu()
686 		WRITE_ONCE(n->next->pprev, &n->next);  in hlist_add_behind_rcu()