425 #define list_for_each_safe(pos, n, head) \  argument
426 	for (pos = (head)->next, n = pos->next; pos != (head); \
427 		pos = n, n = pos->next)
435 #define list_for_each_prev_safe(pos, n, head) \  argument
436 	for (pos = (head)->prev, n = pos->prev; \
438 	     pos = n, n = pos->prev)
520 #define list_for_each_entry_safe(pos, n, head, member)			\  argument
522 		n = list_next_entry(pos, member);			\
524 	     pos = n, n = list_next_entry(n, member))
536 #define list_for_each_entry_safe_continue(pos, n, head, member) 		\  argument
538 		n = list_next_entry(pos, member);				\
540 	     pos = n, n = list_next_entry(n, member))
552 #define list_for_each_entry_safe_from(pos, n, head, member) 			\  argument
553 	for (n = list_next_entry(pos, member);					\
555 	     pos = n, n = list_next_entry(n, member))
567 #define list_for_each_entry_safe_reverse(pos, n, head, member)		\  argument
569 		n = list_prev_entry(pos, member);			\
571 	     pos = n, n = list_prev_entry(n, member))
585 #define list_safe_reset_next(pos, n, member)				\  argument
586 	n = list_next_entry(pos, member)
614 static inline void __hlist_del(struct hlist_node *n)  in __hlist_del()  argument
616 	struct hlist_node *next = n->next;  in __hlist_del()
617 	struct hlist_node **pprev = n->pprev;  in __hlist_del()
624 static inline void hlist_del(struct hlist_node *n)  in hlist_del()  argument
626 	__hlist_del(n);  in hlist_del()
627 	n->next = LIST_POISON1;  in hlist_del()
628 	n->pprev = LIST_POISON2;  in hlist_del()
631 static inline void hlist_del_init(struct hlist_node *n)  in hlist_del_init()  argument
633 	if (!hlist_unhashed(n)) {  in hlist_del_init()
634 		__hlist_del(n);  in hlist_del_init()
635 		INIT_HLIST_NODE(n);  in hlist_del_init()
639 static inline void hlist_add_head(struct hlist_node *n, struct hlist_head *h)  in hlist_add_head()  argument
642 	n->next = first;  in hlist_add_head()
644 		first->pprev = &n->next;  in hlist_add_head()
645 	h->first = n;  in hlist_add_head()
646 	n->pprev = &h->first;  in hlist_add_head()
650 static inline void hlist_add_before(struct hlist_node *n,  in hlist_add_before()  argument
653 	n->pprev = next->pprev;  in hlist_add_before()
654 	n->next = next;  in hlist_add_before()
655 	next->pprev = &n->next;  in hlist_add_before()
656 	*(n->pprev) = n;  in hlist_add_before()
659 static inline void hlist_add_behind(struct hlist_node *n,  in hlist_add_behind()  argument
662 	n->next = prev->next;  in hlist_add_behind()
663 	prev->next = n;  in hlist_add_behind()
664 	n->pprev = &prev->next;  in hlist_add_behind()
666 	if (n->next)  in hlist_add_behind()
667 		n->next->pprev  = &n->next;  in hlist_add_behind()
671 static inline void hlist_add_fake(struct hlist_node *n)  in hlist_add_fake()  argument
673 	n->pprev = &n->next;  in hlist_add_fake()
699 #define hlist_for_each_safe(pos, n, head) \  argument
700 	for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
701 	     pos = n)
745 #define hlist_for_each_entry_safe(pos, n, head, member) 		\  argument
747 	     pos && ({ n = pos->member.next; 1; });			\
748 	     pos = hlist_entry_safe(n, typeof(*pos), member))