105 #define container_of(ptr, sample, member)				\  argument
107 	     - ((char *)&(sample)->member - (char *)(sample)))
110 #define LIST_FOR_EACH_ENTRY(pos, head, member)				\  argument
111    for (pos = container_of((head)->next, pos, member);			\
112 	&pos->member != (head);						\
113 	pos = container_of(pos->member.next, pos, member))
115 #define LIST_FOR_EACH_ENTRY_SAFE(pos, storage, head, member)	\  argument
116    for (pos = container_of((head)->next, pos, member),			\
117 	storage = container_of(pos->member.next, pos, member);	\
118 	&pos->member != (head);						\
119 	pos = storage, storage = container_of(storage->member.next, storage, member))
121 #define LIST_FOR_EACH_ENTRY_SAFE_REV(pos, storage, head, member)	\  argument
122    for (pos = container_of((head)->prev, pos, member),			\
123 	storage = container_of(pos->member.prev, pos, member);		\
124 	&pos->member != (head);						\
125 	pos = storage, storage = container_of(storage->member.prev, storage, member))
127 #define LIST_FOR_EACH_ENTRY_FROM(pos, start, head, member)		\  argument
128    for (pos = container_of((start), pos, member);			\
129 	&pos->member != (head);						\
130 	pos = container_of(pos->member.next, pos, member))
132 #define LIST_FOR_EACH_ENTRY_FROM_REV(pos, start, head, member)		\  argument
133    for (pos = container_of((start), pos, member);			\
134 	&pos->member != (head);						\
135 	pos = container_of(pos->member.prev, pos, member))