107  * @member:	the name of the llist_node within the struct.
109 #define llist_entry(ptr, type, member)		\  argument
110 	container_of(ptr, type, member)
113  * member_address_is_nonnull - check whether the member address is not NULL
115  * @member:	the name of the llist_node within the struct.
118  *	&ptr->member != NULL
119  * but it works around the fact that compilers can decide that taking a member
122  * Real objects that start at a high address and have a member at NULL are
126 #define member_address_is_nonnull(ptr, member)	\  argument
127 	((uintptr_t)(ptr) + offsetof(typeof(*(ptr)), member) != 0)
169  * @member:	the name of the llist_node with the struct.
180 #define llist_for_each_entry(pos, node, member)				\  argument
181 	for ((pos) = llist_entry((node), typeof(*(pos)), member);	\
182 	     member_address_is_nonnull(pos, member);			\
183 	     (pos) = llist_entry((pos)->member.next, typeof(*(pos)), member))
191  * @member:	the name of the llist_node with the struct.
202 #define llist_for_each_entry_safe(pos, n, node, member)			       \  argument
203 	for (pos = llist_entry((node), typeof(*pos), member);		       \
204 	     member_address_is_nonnull(pos, member) &&			       \
205 	        (n = llist_entry(pos->member.next, typeof(*n), member), true); \