Lines Matching refs:member

400  * in the process of modifying either member (next or prev)
598 * @member: the name of the list_head within the struct.
600 #define list_entry(ptr, type, member) \
601 container_of(ptr, type, member)
607 * @member: the name of the list_head within the struct.
611 #define list_first_entry(ptr, type, member) \
612 list_entry((ptr)->next, type, member)
618 * @member: the name of the list_head within the struct.
622 #define list_last_entry(ptr, type, member) \
623 list_entry((ptr)->prev, type, member)
629 * @member: the name of the list_head within the struct.
633 #define list_first_entry_or_null(ptr, type, member) ({ \
636 pos__ != head__ ? list_entry(pos__, type, member) : NULL; \
642 * @member: the name of the list_head within the struct.
644 #define list_next_entry(pos, member) \
645 list_entry((pos)->member.next, typeof(*(pos)), member)
651 * @member: the name of the list_head within the struct.
656 #define list_next_entry_circular(pos, head, member) \
657 (list_is_last(&(pos)->member, head) ? \
658 list_first_entry(head, typeof(*(pos)), member) : list_next_entry(pos, member))
663 * @member: the name of the list_head within the struct.
665 #define list_prev_entry(pos, member) \
666 list_entry((pos)->member.prev, typeof(*(pos)), member)
672 * @member: the name of the list_head within the struct.
677 #define list_prev_entry_circular(pos, head, member) \
678 (list_is_first(&(pos)->member, head) ? \
679 list_last_entry(head, typeof(*(pos)), member) : list_prev_entry(pos, member))
766 * @member: the name of the list_head within the struct.
768 #define list_entry_is_head(pos, head, member) \
769 list_is_head(&pos->member, (head))
775 * @member: the name of the list_head within the struct.
777 #define list_for_each_entry(pos, head, member) \
778 for (pos = list_first_entry(head, typeof(*pos), member); \
779 !list_entry_is_head(pos, head, member); \
780 pos = list_next_entry(pos, member))
786 * @member: the name of the list_head within the struct.
788 #define list_for_each_entry_reverse(pos, head, member) \
789 for (pos = list_last_entry(head, typeof(*pos), member); \
790 !list_entry_is_head(pos, head, member); \
791 pos = list_prev_entry(pos, member))
797 * @member: the name of the list_head within the struct.
801 #define list_prepare_entry(pos, head, member) \
802 ((pos) ? : list_entry(head, typeof(*pos), member))
808 * @member: the name of the list_head within the struct.
813 #define list_for_each_entry_continue(pos, head, member) \
814 for (pos = list_next_entry(pos, member); \
815 !list_entry_is_head(pos, head, member); \
816 pos = list_next_entry(pos, member))
822 * @member: the name of the list_head within the struct.
827 #define list_for_each_entry_continue_reverse(pos, head, member) \
828 for (pos = list_prev_entry(pos, member); \
829 !list_entry_is_head(pos, head, member); \
830 pos = list_prev_entry(pos, member))
836 * @member: the name of the list_head within the struct.
840 #define list_for_each_entry_from(pos, head, member) \
841 for (; !list_entry_is_head(pos, head, member); \
842 pos = list_next_entry(pos, member))
849 * @member: the name of the list_head within the struct.
853 #define list_for_each_entry_from_reverse(pos, head, member) \
854 for (; !list_entry_is_head(pos, head, member); \
855 pos = list_prev_entry(pos, member))
862 * @member: the name of the list_head within the struct.
864 #define list_for_each_entry_safe(pos, n, head, member) \
865 for (pos = list_first_entry(head, typeof(*pos), member), \
866 n = list_next_entry(pos, member); \
867 !list_entry_is_head(pos, head, member); \
868 pos = n, n = list_next_entry(n, member))
875 * @member: the name of the list_head within the struct.
880 #define list_for_each_entry_safe_continue(pos, n, head, member) \
881 for (pos = list_next_entry(pos, member), \
882 n = list_next_entry(pos, member); \
883 !list_entry_is_head(pos, head, member); \
884 pos = n, n = list_next_entry(n, member))
891 * @member: the name of the list_head within the struct.
896 #define list_for_each_entry_safe_from(pos, n, head, member) \
897 for (n = list_next_entry(pos, member); \
898 !list_entry_is_head(pos, head, member); \
899 pos = n, n = list_next_entry(n, member))
906 * @member: the name of the list_head within the struct.
911 #define list_for_each_entry_safe_reverse(pos, n, head, member) \
912 for (pos = list_last_entry(head, typeof(*pos), member), \
913 n = list_prev_entry(pos, member); \
914 !list_entry_is_head(pos, head, member); \
915 pos = n, n = list_prev_entry(n, member))
921 * @member: the name of the list_head within the struct.
929 #define list_safe_reset_next(pos, n, member) \
930 n = list_next_entry(pos, member)
1142 #define hlist_entry(ptr, type, member) container_of(ptr,type,member)
1151 #define hlist_entry_safe(ptr, type, member) \
1153 ____ptr ? hlist_entry(____ptr, type, member) : NULL; \
1160 * @member: the name of the hlist_node within the struct.
1162 #define hlist_for_each_entry(pos, head, member) \
1163 for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member);\
1165 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
1170 * @member: the name of the hlist_node within the struct.
1172 #define hlist_for_each_entry_continue(pos, member) \
1173 for (pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member);\
1175 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
1180 * @member: the name of the hlist_node within the struct.
1182 #define hlist_for_each_entry_from(pos, member) \
1184 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
1191 * @member: the name of the hlist_node within the struct.
1193 #define hlist_for_each_entry_safe(pos, n, head, member) \
1194 for (pos = hlist_entry_safe((head)->first, typeof(*pos), member);\
1195 pos && ({ n = pos->member.next; 1; }); \
1196 pos = hlist_entry_safe(n, typeof(*pos), member))