24 	WRITE_ONCE(list->next, list);  in INIT_LIST_HEAD_RCU()
32 #define list_next_rcu(list)	(*((struct list_head __rcu **)(&(list)->next)))
77 		struct list_head *prev, struct list_head *next)  in __list_add_rcu()  argument
79 	if (!__list_add_valid(new, prev, next))  in __list_add_rcu()
82 	new->next = next;  in __list_add_rcu()
85 	next->prev = new;  in __list_add_rcu()
106 	__list_add_rcu(new, head, head->next);  in list_add_rcu()
200 	new->next = old->next;  in list_replace_rcu()
203 	new->next->prev = new;  in list_replace_rcu()
228 					  struct list_head *next,  in __list_splice_init_rcu()  argument
231 	struct list_head *first = list->next;  in __list_splice_init_rcu()
261 	last->next = next;  in __list_splice_init_rcu()
264 	next->prev = last;  in __list_splice_init_rcu()
279 		__list_splice_init_rcu(list, head, head->next, sync);  in list_splice_init_rcu()
353 	struct list_head *__next = READ_ONCE(__ptr->next); \
373 	struct list_head *__next = READ_ONCE(__ptr->next); \
391 	     pos = list_entry_rcu((head)->next, typeof(*pos), member);	\
393 		pos = list_entry_rcu(pos->member.next, typeof(*pos), member))
410 	     pos = list_entry_rcu((head)->next, typeof(*pos), member);	\
412 		pos = list_entry_rcu(pos->member.next, typeof(*pos), member))
444 	for (pos = list_entry_lockless((head)->next, typeof(*pos), member); \
446 	     pos = list_entry_lockless(pos->member.next, typeof(*pos), member))
467 	for (pos = list_entry_rcu(pos->member.next, typeof(*pos), member); \
469 	     pos = list_entry_rcu(pos->member.next, typeof(*pos), member))
490 		pos = list_entry_rcu(pos->member.next, typeof(*(pos)), member))
527 	struct hlist_node *next = old->next;  in hlist_replace_rcu()  local
529 	new->next = next;  in hlist_replace_rcu()
532 	if (next)  in hlist_replace_rcu()
533 		WRITE_ONCE(new->next->pprev, &new->next);  in hlist_replace_rcu()
562 #define hlist_next_rcu(node)	(*((struct hlist_node __rcu **)(&(node)->next)))
589 	n->next = first;  in hlist_add_head_rcu()
593 		WRITE_ONCE(first->pprev, &n->next);  in hlist_add_head_rcu()
621 	for (i = h->first; i; i = i->next)  in hlist_add_tail_rcu()
625 		n->next = last->next;  in hlist_add_tail_rcu()
626 		WRITE_ONCE(n->pprev, &last->next);  in hlist_add_tail_rcu()
652 					struct hlist_node *next)  in hlist_add_before_rcu()  argument
654 	WRITE_ONCE(n->pprev, next->pprev);  in hlist_add_before_rcu()
655 	n->next = next;  in hlist_add_before_rcu()
657 	WRITE_ONCE(next->pprev, &n->next);  in hlist_add_before_rcu()
681 	n->next = prev->next;  in hlist_add_behind_rcu()
682 	WRITE_ONCE(n->pprev, &prev->next);  in hlist_add_behind_rcu()
684 	if (n->next)  in hlist_add_behind_rcu()
685 		WRITE_ONCE(n->next->pprev, &n->next);  in hlist_add_behind_rcu()