240 	struct list_head *first = list->next;  in __list_splice_init_rcu()  local
259 	ASSERT_EXCLUSIVE_ACCESS(*first);  in __list_splice_init_rcu()
271 	rcu_assign_pointer(list_next_rcu(prev), first);  in __list_splice_init_rcu()
272 	first->prev = prev;  in __list_splice_init_rcu()
550 	struct hlist_node *node1 = left->first;  in hlists_swap_heads_rcu()
551 	struct hlist_node *node2 = right->first;  in hlists_swap_heads_rcu()
553 	rcu_assign_pointer(left->first, node2);  in hlists_swap_heads_rcu()
554 	rcu_assign_pointer(right->first, node1);  in hlists_swap_heads_rcu()
555 	WRITE_ONCE(node2->pprev, &left->first);  in hlists_swap_heads_rcu()
556 	WRITE_ONCE(node1->pprev, &right->first);  in hlists_swap_heads_rcu()
562 #define hlist_first_rcu(head)	(*((struct hlist_node __rcu **)(&(head)->first)))
588 	struct hlist_node *first = h->first;  in hlist_add_head_rcu()  local
590 	n->next = first;  in hlist_add_head_rcu()
591 	WRITE_ONCE(n->pprev, &h->first);  in hlist_add_head_rcu()
593 	if (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()