309  * in the process of modifying either member (next or prev)
508  * @member:	the name of the list_head within the struct.
510 #define list_entry(ptr, type, member) \  argument
511 	container_of(ptr, type, member)
517  * @member:	the name of the list_head within the struct.
521 #define list_first_entry(ptr, type, member) \  argument
522 	list_entry((ptr)->next, type, member)
528  * @member:	the name of the list_head within the struct.
532 #define list_last_entry(ptr, type, member) \  argument
533 	list_entry((ptr)->prev, type, member)
539  * @member:	the name of the list_head within the struct.
543 #define list_first_entry_or_null(ptr, type, member) ({ \  argument
546 	pos__ != head__ ? list_entry(pos__, type, member) : NULL; \
552  * @member:	the name of the list_head within the struct.
554 #define list_next_entry(pos, member) \  argument
555 	list_entry((pos)->member.next, typeof(*(pos)), member)
560  * @member:	the name of the list_head within the struct.
562 #define list_prev_entry(pos, member) \  argument
563 	list_entry((pos)->member.prev, typeof(*(pos)), member)
616  * @member:	the name of the list_head within the struct.
618 #define list_entry_is_head(pos, head, member)				\  argument
619 	(&pos->member == (head))
625  * @member:	the name of the list_head within the struct.
627 #define list_for_each_entry(pos, head, member)				\  argument
628 	for (pos = list_first_entry(head, typeof(*pos), member);	\
629 	     !list_entry_is_head(pos, head, member);			\
630 	     pos = list_next_entry(pos, member))
636  * @member:	the name of the list_head within the struct.
638 #define list_for_each_entry_reverse(pos, head, member)			\  argument
639 	for (pos = list_last_entry(head, typeof(*pos), member);		\
640 	     !list_entry_is_head(pos, head, member); 			\
641 	     pos = list_prev_entry(pos, member))
647  * @member:	the name of the list_head within the struct.
651 #define list_prepare_entry(pos, head, member) \  argument
652 	((pos) ? : list_entry(head, typeof(*pos), member))
658  * @member:	the name of the list_head within the struct.
663 #define list_for_each_entry_continue(pos, head, member) 		\  argument
664 	for (pos = list_next_entry(pos, member);			\
665 	     !list_entry_is_head(pos, head, member);			\
666 	     pos = list_next_entry(pos, member))
672  * @member:	the name of the list_head within the struct.
677 #define list_for_each_entry_continue_reverse(pos, head, member)		\  argument
678 	for (pos = list_prev_entry(pos, member);			\
679 	     !list_entry_is_head(pos, head, member);			\
680 	     pos = list_prev_entry(pos, member))
686  * @member:	the name of the list_head within the struct.
690 #define list_for_each_entry_from(pos, head, member) 			\  argument
691 	for (; !list_entry_is_head(pos, head, member);			\
692 	     pos = list_next_entry(pos, member))
699  * @member:	the name of the list_head within the struct.
703 #define list_for_each_entry_from_reverse(pos, head, member)		\  argument
704 	for (; !list_entry_is_head(pos, head, member);			\
705 	     pos = list_prev_entry(pos, member))
712  * @member:	the name of the list_head within the struct.
714 #define list_for_each_entry_safe(pos, n, head, member)			\  argument
715 	for (pos = list_first_entry(head, typeof(*pos), member),	\
716 		n = list_next_entry(pos, member);			\
717 	     !list_entry_is_head(pos, head, member); 			\
718 	     pos = n, n = list_next_entry(n, member))
725  * @member:	the name of the list_head within the struct.
730 #define list_for_each_entry_safe_continue(pos, n, head, member) 		\  argument
731 	for (pos = list_next_entry(pos, member), 				\
732 		n = list_next_entry(pos, member);				\
733 	     !list_entry_is_head(pos, head, member);				\
734 	     pos = n, n = list_next_entry(n, member))
741  * @member:	the name of the list_head within the struct.
746 #define list_for_each_entry_safe_from(pos, n, head, member) 			\  argument
747 	for (n = list_next_entry(pos, member);					\
748 	     !list_entry_is_head(pos, head, member);				\
749 	     pos = n, n = list_next_entry(n, member))
756  * @member:	the name of the list_head within the struct.
761 #define list_for_each_entry_safe_reverse(pos, n, head, member)		\  argument
762 	for (pos = list_last_entry(head, typeof(*pos), member),		\
763 		n = list_prev_entry(pos, member);			\
764 	     !list_entry_is_head(pos, head, member); 			\
765 	     pos = n, n = list_prev_entry(n, member))
771  * @member:	the name of the list_head within the struct.
779 #define list_safe_reset_next(pos, n, member)				\  argument
780 	n = list_next_entry(pos, member)
972 #define hlist_entry(ptr, type, member) container_of(ptr,type,member)  argument
981 #define hlist_entry_safe(ptr, type, member) \  argument
983 	   ____ptr ? hlist_entry(____ptr, type, member) : NULL; \
990  * @member:	the name of the hlist_node within the struct.
992 #define hlist_for_each_entry(pos, head, member)				\  argument
993 	for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member);\
995 	     pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
1000  * @member:	the name of the hlist_node within the struct.
1002 #define hlist_for_each_entry_continue(pos, member)			\  argument
1003 	for (pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member);\
1005 	     pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
1010  * @member:	the name of the hlist_node within the struct.
1012 #define hlist_for_each_entry_from(pos, member)				\  argument
1014 	     pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
1021  * @member:	the name of the hlist_node within the struct.
1023 #define hlist_for_each_entry_safe(pos, n, head, member) 		\  argument
1024 	for (pos = hlist_entry_safe((head)->first, typeof(*pos), member);\
1025 	     pos && ({ n = pos->member.next; 1; });			\
1026 	     pos = hlist_entry_safe(n, typeof(*pos), member))