37 #define	list_next_rcu(head)	(*((struct list_head **)(&(head)->next)))
41 	for (pos = list_entry_rcu((head)->next, typeof(*(pos)), member); \
43 	     pos = list_entry_rcu((pos)->member.next, typeof(*(pos)), member))
48 	     pos = list_entry_rcu((pos)->member.next, typeof(*(pos)), member))
55     struct list_head *next)  in linux_list_add_rcu()  argument
57 	new->next = next;  in linux_list_add_rcu()
60 	next->prev = new;  in linux_list_add_rcu()
66 	linux_list_add_rcu(new, head, head->next);  in list_add_rcu()
76 __list_del_rcu(struct list_head *prev, struct list_head *next)  in __list_del_rcu()  argument
78 	next->prev = prev;  in __list_del_rcu()
79 	rcu_assign_pointer(list_next_rcu(prev), next);  in __list_del_rcu()
85 	__list_del_rcu(entry->prev, entry->next);  in __list_del_entry_rcu()
91 	__list_del_rcu(entry->prev, entry->next);  in list_del_rcu()
95 #define	hlist_next_rcu(node)	(*((struct hlist_node **)(&(node)->next)))
101 	n->next = prev->next;  in hlist_add_behind_rcu()
102 	n->pprev = &prev->next;  in hlist_add_behind_rcu()
104 	if (n->next)  in hlist_add_behind_rcu()
105 		n->next->pprev = &n->next;  in hlist_add_behind_rcu()
118 	struct hlist_node *next = n->next;  in hlist_del_rcu()  local
121 	WRITE_ONCE(*pprev, next);  in hlist_del_rcu()
122 	if (next)  in hlist_del_rcu()
123 		next->pprev = pprev;  in hlist_del_rcu()
131 	n->next = first;  in hlist_add_head_rcu()
135 		first->pprev = &n->next;  in hlist_add_head_rcu()