272 	struct list_head *pos = entry2->prev;  in list_swap()  local
276 	if (pos == entry1)  in list_swap()
277 		pos = entry2;  in list_swap()
278 	list_add(entry1, pos);  in list_swap()
644 #define list_next_entry(pos, member) \  argument
645 	list_entry((pos)->member.next, typeof(*(pos)), member)
656 #define list_next_entry_circular(pos, head, member) \  argument
657 	(list_is_last(&(pos)->member, head) ? \
658 	list_first_entry(head, typeof(*(pos)), member) : list_next_entry(pos, member))
665 #define list_prev_entry(pos, member) \  argument
666 	list_entry((pos)->member.prev, typeof(*(pos)), member)
677 #define list_prev_entry_circular(pos, head, member) \  argument
678 	(list_is_first(&(pos)->member, head) ? \
679 	list_last_entry(head, typeof(*(pos)), member) : list_prev_entry(pos, member))
686 #define list_for_each(pos, head) \  argument
687 	for (pos = (head)->next; !list_is_head(pos, (head)); pos = pos->next)
694 #define list_for_each_rcu(pos, head)		  \  argument
695 	for (pos = rcu_dereference((head)->next); \
696 	     !list_is_head(pos, (head)); \
697 	     pos = rcu_dereference(pos->next))
706 #define list_for_each_continue(pos, head) \  argument
707 	for (pos = pos->next; !list_is_head(pos, (head)); pos = pos->next)
714 #define list_for_each_prev(pos, head) \  argument
715 	for (pos = (head)->prev; !list_is_head(pos, (head)); pos = pos->prev)
723 #define list_for_each_safe(pos, n, head) \  argument
724 	for (pos = (head)->next, n = pos->next; \
725 	     !list_is_head(pos, (head)); \
726 	     pos = n, n = pos->next)
734 #define list_for_each_prev_safe(pos, n, head) \  argument
735 	for (pos = (head)->prev, n = pos->prev; \
736 	     !list_is_head(pos, (head)); \
737 	     pos = n, n = pos->prev)
745 	struct list_head *pos;  in list_count_nodes()  local
748 	list_for_each(pos, head)  in list_count_nodes()
760 #define list_entry_is_head(pos, head, member)				\  argument
761 	(&pos->member == (head))
769 #define list_for_each_entry(pos, head, member)				\  argument
770 	for (pos = list_first_entry(head, typeof(*pos), member);	\
771 	     !list_entry_is_head(pos, head, member);			\
772 	     pos = list_next_entry(pos, member))
780 #define list_for_each_entry_reverse(pos, head, member)			\  argument
781 	for (pos = list_last_entry(head, typeof(*pos), member);		\
782 	     !list_entry_is_head(pos, head, member); 			\
783 	     pos = list_prev_entry(pos, member))
793 #define list_prepare_entry(pos, head, member) \  argument
794 	((pos) ? : list_entry(head, typeof(*pos), member))
805 #define list_for_each_entry_continue(pos, head, member) 		\  argument
806 	for (pos = list_next_entry(pos, member);			\
807 	     !list_entry_is_head(pos, head, member);			\
808 	     pos = list_next_entry(pos, member))
819 #define list_for_each_entry_continue_reverse(pos, head, member)		\  argument
820 	for (pos = list_prev_entry(pos, member);			\
821 	     !list_entry_is_head(pos, head, member);			\
822 	     pos = list_prev_entry(pos, member))
832 #define list_for_each_entry_from(pos, head, member) 			\  argument
833 	for (; !list_entry_is_head(pos, head, member);			\
834 	     pos = list_next_entry(pos, member))
845 #define list_for_each_entry_from_reverse(pos, head, member)		\  argument
846 	for (; !list_entry_is_head(pos, head, member);			\
847 	     pos = list_prev_entry(pos, member))
856 #define list_for_each_entry_safe(pos, n, head, member)			\  argument
857 	for (pos = list_first_entry(head, typeof(*pos), member),	\
858 		n = list_next_entry(pos, member);			\
859 	     !list_entry_is_head(pos, head, member); 			\
860 	     pos = n, n = list_next_entry(n, member))
872 #define list_for_each_entry_safe_continue(pos, n, head, member) 		\  argument
873 	for (pos = list_next_entry(pos, member), 				\
874 		n = list_next_entry(pos, member);				\
875 	     !list_entry_is_head(pos, head, member);				\
876 	     pos = n, n = list_next_entry(n, member))
888 #define list_for_each_entry_safe_from(pos, n, head, member) 			\  argument
889 	for (n = list_next_entry(pos, member);					\
890 	     !list_entry_is_head(pos, head, member);				\
891 	     pos = n, n = list_next_entry(n, member))
903 #define list_for_each_entry_safe_reverse(pos, n, head, member)		\  argument
904 	for (pos = list_last_entry(head, typeof(*pos), member),		\
905 		n = list_prev_entry(pos, member);			\
906 	     !list_entry_is_head(pos, head, member); 			\
907 	     pos = n, n = list_prev_entry(n, member))
921 #define list_safe_reset_next(pos, n, member)				\  argument
922 	n = list_next_entry(pos, member)
1116 #define hlist_for_each(pos, head) \  argument
1117 	for (pos = (head)->first; pos ; pos = pos->next)
1119 #define hlist_for_each_safe(pos, n, head) \  argument
1120 	for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
1121 	     pos = n)
1134 #define hlist_for_each_entry(pos, head, member)				\  argument
1135 	for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member);\
1136 	     pos;							\
1137 	     pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
1144 #define hlist_for_each_entry_continue(pos, member)			\  argument
1145 	for (pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member);\
1146 	     pos;							\
1147 	     pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
1154 #define hlist_for_each_entry_from(pos, member)				\  argument
1155 	for (; pos;							\
1156 	     pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
1165 #define hlist_for_each_entry_safe(pos, n, head, member) 		\  argument
1166 	for (pos = hlist_entry_safe((head)->first, typeof(*pos), member);\
1167 	     pos && ({ n = pos->member.next; 1; });			\
1168 	     pos = hlist_entry_safe(n, typeof(*pos), member))