32 	WRITE_ONCE(list->next, list);  in INIT_LIST_HEAD_RCU()
40 #define list_next_rcu(list)	(*((struct list_head __rcu **)(&(list)->next)))
50 		struct list_head *prev, struct list_head *next)  in __list_add_rcu()  argument
52 	new->next = next;  in __list_add_rcu()
55 	next->prev = new;  in __list_add_rcu()
59 		    struct list_head *prev, struct list_head *next);
80 	__list_add_rcu(new, head, head->next);  in list_add_rcu()
174 	new->next = old->next;  in list_replace_rcu()
177 	new->next->prev = new;  in list_replace_rcu()
202 	struct list_head *first = list->next;  in list_splice_init_rcu()
204 	struct list_head *at = head->next;  in list_splice_init_rcu()
234 	last->next = at;  in list_splice_init_rcu()
288 	struct list_head *__next = READ_ONCE(__ptr->next); \
303 	for (pos = list_entry_rcu((head)->next, typeof(*pos), member); \
305 		pos = list_entry_rcu(pos->member.next, typeof(*pos), member))
317 	for (pos = list_entry_rcu(pos->member.next, typeof(*pos), member); \
319 	     pos = list_entry_rcu(pos->member.next, typeof(*pos), member))
356 	struct hlist_node *next = old->next;  in hlist_replace_rcu()  local
358 	new->next = next;  in hlist_replace_rcu()
361 	if (next)  in hlist_replace_rcu()
362 		new->next->pprev = &new->next;  in hlist_replace_rcu()
370 #define hlist_next_rcu(node)	(*((struct hlist_node __rcu **)(&(node)->next)))
397 	n->next = first;  in hlist_add_head_rcu()
401 		first->pprev = &n->next;  in hlist_add_head_rcu()
423 					struct hlist_node *next)  in hlist_add_before_rcu()  argument
425 	n->pprev = next->pprev;  in hlist_add_before_rcu()
426 	n->next = next;  in hlist_add_before_rcu()
428 	next->pprev = &n->next;  in hlist_add_before_rcu()
452 	n->next = prev->next;  in hlist_add_behind_rcu()
453 	n->pprev = &prev->next;  in hlist_add_behind_rcu()
455 	if (n->next)  in hlist_add_behind_rcu()
456 		n->next->pprev = &n->next;  in hlist_add_behind_rcu()