Lines Matching full:member
319 * in the process of modifying either member (next or prev)
517 * @member: the name of the list_head within the struct.
519 #define list_entry(ptr, type, member) \ argument
520 container_of(ptr, type, member)
526 * @member: the name of the list_head within the struct.
530 #define list_first_entry(ptr, type, member) \ argument
531 list_entry((ptr)->next, type, member)
537 * @member: the name of the list_head within the struct.
541 #define list_last_entry(ptr, type, member) \ argument
542 list_entry((ptr)->prev, type, member)
548 * @member: the name of the list_head within the struct.
552 #define list_first_entry_or_null(ptr, type, member) ({ \ argument
555 pos__ != head__ ? list_entry(pos__, type, member) : NULL; \
561 * @member: the name of the list_head within the struct.
563 #define list_next_entry(pos, member) \ argument
564 list_entry((pos)->member.next, typeof(*(pos)), member)
570 * @member: the name of the list_head within the struct.
575 #define list_next_entry_circular(pos, head, member) \ argument
576 (list_is_last(&(pos)->member, head) ? \
577 list_first_entry(head, typeof(*(pos)), member) : list_next_entry(pos, member))
582 * @member: the name of the list_head within the struct.
584 #define list_prev_entry(pos, member) \ argument
585 list_entry((pos)->member.prev, typeof(*(pos)), member)
591 * @member: the name of the list_head within the struct.
596 #define list_prev_entry_circular(pos, head, member) \ argument
597 (list_is_first(&(pos)->member, head) ? \
598 list_last_entry(head, typeof(*(pos)), member) : list_prev_entry(pos, member))
662 * @member: the name of the list_head within the struct.
664 #define list_entry_is_head(pos, head, member) \ argument
665 (&pos->member == (head))
671 * @member: the name of the list_head within the struct.
673 #define list_for_each_entry(pos, head, member) \ argument
674 for (pos = list_first_entry(head, typeof(*pos), member); \
675 !list_entry_is_head(pos, head, member); \
676 pos = list_next_entry(pos, member))
682 * @member: the name of the list_head within the struct.
684 #define list_for_each_entry_reverse(pos, head, member) \ argument
685 for (pos = list_last_entry(head, typeof(*pos), member); \
686 !list_entry_is_head(pos, head, member); \
687 pos = list_prev_entry(pos, member))
693 * @member: the name of the list_head within the struct.
697 #define list_prepare_entry(pos, head, member) \ argument
698 ((pos) ? : list_entry(head, typeof(*pos), member))
704 * @member: the name of the list_head within the struct.
709 #define list_for_each_entry_continue(pos, head, member) \ argument
710 for (pos = list_next_entry(pos, member); \
711 !list_entry_is_head(pos, head, member); \
712 pos = list_next_entry(pos, member))
718 * @member: the name of the list_head within the struct.
723 #define list_for_each_entry_continue_reverse(pos, head, member) \ argument
724 for (pos = list_prev_entry(pos, member); \
725 !list_entry_is_head(pos, head, member); \
726 pos = list_prev_entry(pos, member))
732 * @member: the name of the list_head within the struct.
736 #define list_for_each_entry_from(pos, head, member) \ argument
737 for (; !list_entry_is_head(pos, head, member); \
738 pos = list_next_entry(pos, member))
745 * @member: the name of the list_head within the struct.
749 #define list_for_each_entry_from_reverse(pos, head, member) \ argument
750 for (; !list_entry_is_head(pos, head, member); \
751 pos = list_prev_entry(pos, member))
758 * @member: the name of the list_head within the struct.
760 #define list_for_each_entry_safe(pos, n, head, member) \ argument
761 for (pos = list_first_entry(head, typeof(*pos), member), \
762 n = list_next_entry(pos, member); \
763 !list_entry_is_head(pos, head, member); \
764 pos = n, n = list_next_entry(n, member))
771 * @member: the name of the list_head within the struct.
776 #define list_for_each_entry_safe_continue(pos, n, head, member) \ argument
777 for (pos = list_next_entry(pos, member), \
778 n = list_next_entry(pos, member); \
779 !list_entry_is_head(pos, head, member); \
780 pos = n, n = list_next_entry(n, member))
787 * @member: the name of the list_head within the struct.
792 #define list_for_each_entry_safe_from(pos, n, head, member) \ argument
793 for (n = list_next_entry(pos, member); \
794 !list_entry_is_head(pos, head, member); \
795 pos = n, n = list_next_entry(n, member))
802 * @member: the name of the list_head within the struct.
807 #define list_for_each_entry_safe_reverse(pos, n, head, member) \ argument
808 for (pos = list_last_entry(head, typeof(*pos), member), \
809 n = list_prev_entry(pos, member); \
810 !list_entry_is_head(pos, head, member); \
811 pos = n, n = list_prev_entry(n, member))
817 * @member: the name of the list_head within the struct.
825 #define list_safe_reset_next(pos, n, member) \ argument
826 n = list_next_entry(pos, member)
1018 #define hlist_entry(ptr, type, member) container_of(ptr,type,member) argument
1027 #define hlist_entry_safe(ptr, type, member) \ argument
1029 ____ptr ? hlist_entry(____ptr, type, member) : NULL; \
1036 * @member: the name of the hlist_node within the struct.
1038 #define hlist_for_each_entry(pos, head, member) \ argument
1039 for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member);\
1041 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
1046 * @member: the name of the hlist_node within the struct.
1048 #define hlist_for_each_entry_continue(pos, member) \ argument
1049 for (pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member);\
1051 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
1056 * @member: the name of the hlist_node within the struct.
1058 #define hlist_for_each_entry_from(pos, member) \ argument
1060 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
1067 * @member: the name of the hlist_node within the struct.
1069 #define hlist_for_each_entry_safe(pos, n, head, member) \ argument
1070 for (pos = hlist_entry_safe((head)->first, typeof(*pos), member);\
1071 pos && ({ n = pos->member.next; 1; }); \
1072 pos = hlist_entry_safe(n, typeof(*pos), member))