Lines Matching refs:member
194 * Cast from a pointer to a member of a struct back to the containing struct.
198 #define list_container_of(ptr, sample, member) \
200 - ((char *)&(sample)->member - (char *)(sample)))
202 #define list_first_entry(ptr, type, member) \
203 list_entry((ptr)->next, type, member)
205 #define list_last_entry(ptr, type, member) \
206 list_entry((ptr)->prev, type, member)
209 #define LIST_FOR_EACH_ENTRY(pos, head, member) \
210 for (pos = NULL, pos = list_container_of((head)->next, pos, member); \
211 &pos->member != (head); \
212 pos = list_container_of(pos->member.next, pos, member))
214 #define LIST_FOR_EACH_ENTRY_SAFE(pos, storage, head, member) \
215 for (pos = NULL, pos = list_container_of((head)->next, pos, member), \
216 storage = list_container_of(pos->member.next, pos, member); \
217 &pos->member != (head); \
218 pos = storage, storage = list_container_of(storage->member.next, storage, member))
220 #define LIST_FOR_EACH_ENTRY_SAFE_REV(pos, storage, head, member) \
221 for (pos = NULL, pos = list_container_of((head)->prev, pos, member), \
222 storage = list_container_of(pos->member.prev, pos, member); \
223 &pos->member != (head); \
224 pos = storage, storage = list_container_of(storage->member.prev, storage, member))
226 #define LIST_FOR_EACH_ENTRY_FROM(pos, start, head, member) \
227 for (pos = NULL, pos = list_container_of((start), pos, member); \
228 &pos->member != (head); \
229 pos = list_container_of(pos->member.next, pos, member))
231 #define LIST_FOR_EACH_ENTRY_FROM_REV(pos, start, head, member) \
232 for (pos = NULL, pos = list_container_of((start), pos, member); \
233 &pos->member != (head); \
234 pos = list_container_of(pos->member.prev, pos, member))
236 #define list_for_each_entry(type, pos, head, member) \
237 for (type *pos = list_entry((head)->next, type, member), \
238 *__next = list_entry(pos->member.next, type, member); \
239 &pos->member != (head); \
240 pos = list_entry(pos->member.next, type, member), \
242 __next = list_entry(__next->member.next, type, member))
244 #define list_for_each_entry_safe(type, pos, head, member) \
245 for (type *pos = list_entry((head)->next, type, member), \
246 *__next = list_entry(pos->member.next, type, member); \
247 &pos->member != (head); \
249 __next = list_entry(__next->member.next, type, member))
251 #define list_for_each_entry_rev(type, pos, head, member) \
252 for (type *pos = list_entry((head)->prev, type, member), \
253 *__prev = list_entry(pos->member.prev, type, member); \
254 &pos->member != (head); \
255 pos = list_entry(pos->member.prev, type, member), \
257 __prev = list_entry(__prev->member.prev, type, member))
259 #define list_for_each_entry_safe_rev(type, pos, head, member) \
260 for (type *pos = list_entry((head)->prev, type, member), \
261 *__prev = list_entry(pos->member.prev, type, member); \
262 &pos->member != (head); \
264 __prev = list_entry(__prev->member.prev, type, member))
266 #define list_for_each_entry_from(type, pos, start, head, member) \
267 for (type *pos = list_entry((start), type, member); \
268 &pos->member != (head); \
269 pos = list_entry(pos->member.next, type, member))
271 #define list_for_each_entry_from_safe(type, pos, start, head, member) \
272 for (type *pos = list_entry((start), type, member), \
273 *__next = list_entry(pos->member.next, type, member); \
274 &pos->member != (head); \
276 __next = list_entry(__next->member.next, type, member))
278 #define list_for_each_entry_from_rev(type, pos, start, head, member) \
279 for (type *pos = list_entry((start), type, member); \
280 &pos->member != (head); \
281 pos = list_entry(pos->member.prev, type, member))
283 #define list_pair_for_each_entry(type, pos1, pos2, head1, head2, member) \
284 for (type *pos1 = list_entry((head1)->next, type, member), \
285 *pos2 = list_entry((head2)->next, type, member); \
286 &pos1->member != (head1) && &pos2->member != (head2); \
287 pos1 = list_entry(pos1->member.next, type, member), \
288 pos2 = list_entry(pos2->member.next, type, member))