614 #define list_for_each_safe(pos, n, head) \  argument
615 	for (pos = (head)->next, n = pos->next; \
617 	     pos = n, n = pos->next)
625 #define list_for_each_prev_safe(pos, n, head) \  argument
626 	for (pos = (head)->prev, n = pos->prev; \
628 	     pos = n, n = pos->prev)
732 #define list_for_each_entry_safe(pos, n, head, member)			\  argument
734 		n = list_next_entry(pos, member);			\
736 	     pos = n, n = list_next_entry(n, member))
748 #define list_for_each_entry_safe_continue(pos, n, head, member) 		\  argument
750 		n = list_next_entry(pos, member);				\
752 	     pos = n, n = list_next_entry(n, member))
764 #define list_for_each_entry_safe_from(pos, n, head, member) 			\  argument
765 	for (n = list_next_entry(pos, member);					\
767 	     pos = n, n = list_next_entry(n, member))
779 #define list_for_each_entry_safe_reverse(pos, n, head, member)		\  argument
781 		n = list_prev_entry(pos, member);			\
783 	     pos = n, n = list_prev_entry(n, member))
797 #define list_safe_reset_next(pos, n, member)				\  argument
798 	n = list_next_entry(pos, member)
851 static inline void __hlist_del(struct hlist_node *n)  in __hlist_del()  argument
853 	struct hlist_node *next = n->next;  in __hlist_del()
854 	struct hlist_node **pprev = n->pprev;  in __hlist_del()
868 static inline void hlist_del(struct hlist_node *n)  in hlist_del()  argument
870 	__hlist_del(n);  in hlist_del()
871 	n->next = LIST_POISON1;  in hlist_del()
872 	n->pprev = LIST_POISON2;  in hlist_del()
881 static inline void hlist_del_init(struct hlist_node *n)  in hlist_del_init()  argument
883 	if (!hlist_unhashed(n)) {  in hlist_del_init()
884 		__hlist_del(n);  in hlist_del_init()
885 		INIT_HLIST_NODE(n);  in hlist_del_init()
897 static inline void hlist_add_head(struct hlist_node *n, struct hlist_head *h)  in hlist_add_head()  argument
900 	WRITE_ONCE(n->next, first);  in hlist_add_head()
902 		WRITE_ONCE(first->pprev, &n->next);  in hlist_add_head()
903 	WRITE_ONCE(h->first, n);  in hlist_add_head()
904 	WRITE_ONCE(n->pprev, &h->first);  in hlist_add_head()
912 static inline void hlist_add_before(struct hlist_node *n,  in hlist_add_before()  argument
915 	WRITE_ONCE(n->pprev, next->pprev);  in hlist_add_before()
916 	WRITE_ONCE(n->next, next);  in hlist_add_before()
917 	WRITE_ONCE(next->pprev, &n->next);  in hlist_add_before()
918 	WRITE_ONCE(*(n->pprev), n);  in hlist_add_before()
926 static inline void hlist_add_behind(struct hlist_node *n,  in hlist_add_behind()  argument
929 	WRITE_ONCE(n->next, prev->next);  in hlist_add_behind()
930 	WRITE_ONCE(prev->next, n);  in hlist_add_behind()
931 	WRITE_ONCE(n->pprev, &prev->next);  in hlist_add_behind()
933 	if (n->next)  in hlist_add_behind()
934 		WRITE_ONCE(n->next->pprev, &n->next);  in hlist_add_behind()
945 static inline void hlist_add_fake(struct hlist_node *n)  in hlist_add_fake()  argument
947 	n->pprev = &n->next;  in hlist_add_fake()
968 hlist_is_singular_node(struct hlist_node *n, struct hlist_head *h)  in hlist_is_singular_node()  argument
970 	return !n->next && n->pprev == &h->first;  in hlist_is_singular_node()
995 #define hlist_for_each_safe(pos, n, head) \  argument
996 	for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
997 	     pos = n)
1041 #define hlist_for_each_entry_safe(pos, n, head, member) 		\  argument
1043 	     pos && ({ n = pos->member.next; 1; });			\
1044 	     pos = hlist_entry_safe(n, typeof(*pos), member))