Lines Matching full: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) \ argument
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) \ argument
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) \ argument
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) ({ \ argument
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) \ argument
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) \ argument
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) \ argument
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) \ argument
678 (list_is_first(&(pos)->member, head) ? \
679 list_last_entry(head, typeof(*(pos)), member) : list_prev_entry(pos, member))
758 * @member: the name of the list_head within the struct.
760 #define list_entry_is_head(pos, head, member) \ argument
761 list_is_head(&pos->member, (head))
767 * @member: the name of the list_head within the struct.
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))
778 * @member: the name of the list_head within the struct.
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))
789 * @member: the name of the list_head within the struct.
793 #define list_prepare_entry(pos, head, member) \ argument
794 ((pos) ? : list_entry(head, typeof(*pos), member))
800 * @member: the name of the list_head within the struct.
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))
814 * @member: the name of the list_head within the struct.
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))
828 * @member: the name of the list_head within the struct.
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))
841 * @member: the name of the list_head within the struct.
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))
854 * @member: the name of the list_head within the struct.
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))
867 * @member: the name of the list_head within the struct.
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))
883 * @member: the name of the list_head within the struct.
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))
898 * @member: the name of the list_head within the struct.
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))
913 * @member: the name of the list_head within the struct.
921 #define list_safe_reset_next(pos, n, member) \ argument
922 n = list_next_entry(pos, member)
1134 #define hlist_entry(ptr, type, member) container_of(ptr,type,member) argument
1143 #define hlist_entry_safe(ptr, type, member) \ argument
1145 ____ptr ? hlist_entry(____ptr, type, member) : NULL; \
1152 * @member: the name of the hlist_node within the struct.
1154 #define hlist_for_each_entry(pos, head, member) \ argument
1155 for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member);\
1157 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
1162 * @member: the name of the hlist_node within the struct.
1164 #define hlist_for_each_entry_continue(pos, member) \ argument
1165 for (pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member);\
1167 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
1172 * @member: the name of the hlist_node within the struct.
1174 #define hlist_for_each_entry_from(pos, member) \ argument
1176 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
1183 * @member: the name of the hlist_node within the struct.
1185 #define hlist_for_each_entry_safe(pos, n, head, member) \ argument
1186 for (pos = hlist_entry_safe((head)->first, typeof(*pos), member);\
1187 pos && ({ n = pos->member.next; 1; }); \
1188 pos = hlist_entry_safe(n, typeof(*pos), member))