Lines Matching refs:member

187  * in the process of modifying either member (next or prev)
324 * @member: the name of the list_struct within the struct.
326 #define list_entry(ptr, type, member) \
327 container_of(ptr, type, member)
333 * @member: the name of the list_struct within the struct.
337 #define list_first_entry(ptr, type, member) \
338 list_entry((ptr)->next, type, member)
344 * @member: the name of the list_struct within the struct.
348 #define list_last_entry(ptr, type, member) \
349 list_entry((ptr)->prev, type, member)
355 * @member: the name of the list_head within the struct.
359 #define list_first_entry_or_null(ptr, type, member) ({ \
362 pos__ != head__ ? list_entry(pos__, type, member) : NULL; \
421 * @member: the name of the list_struct within the struct.
423 #define list_for_each_entry(pos, head, member) \
424 for (pos = list_entry((head)->next, typeof(*pos), member); \
425 prefetch(pos->member.next), &pos->member != (head); \
426 pos = list_entry(pos->member.next, typeof(*pos), member))
432 * @member: the name of the list_struct within the struct.
434 #define list_for_each_entry_reverse(pos, head, member) \
435 for (pos = list_entry((head)->prev, typeof(*pos), member); \
436 prefetch(pos->member.prev), &pos->member != (head); \
437 pos = list_entry(pos->member.prev, typeof(*pos), member))
443 * @member: the name of the list_struct within the struct.
447 #define list_prepare_entry(pos, head, member) \
448 ((pos) ? : list_entry(head, typeof(*pos), member))
454 * @member: the name of the list_struct within the struct.
459 #define list_for_each_entry_continue(pos, head, member) \
460 for (pos = list_entry(pos->member.next, typeof(*pos), member); \
461 prefetch(pos->member.next), &pos->member != (head); \
462 pos = list_entry(pos->member.next, typeof(*pos), member))
468 * @member: the name of the list_struct within the struct.
473 #define list_for_each_entry_continue_reverse(pos, head, member) \
474 for (pos = list_entry(pos->member.prev, typeof(*pos), member); \
475 prefetch(pos->member.prev), &pos->member != (head); \
476 pos = list_entry(pos->member.prev, typeof(*pos), member))
482 * @member: the name of the list_struct within the struct.
486 #define list_for_each_entry_from(pos, head, member) \
487 for (; prefetch(pos->member.next), &pos->member != (head); \
488 pos = list_entry(pos->member.next, typeof(*pos), member))
495 * @member: the name of the list_struct within the struct.
497 #define list_for_each_entry_safe(pos, n, head, member) \
498 for (pos = list_entry((head)->next, typeof(*pos), member), \
499 n = list_entry(pos->member.next, typeof(*pos), member); \
500 &pos->member != (head); \
501 pos = n, n = list_entry(n->member.next, typeof(*n), member))
508 * @member: the name of the list_struct within the struct.
513 #define list_for_each_entry_safe_continue(pos, n, head, member) \
514 for (pos = list_entry(pos->member.next, typeof(*pos), member), \
515 n = list_entry(pos->member.next, typeof(*pos), member); \
516 &pos->member != (head); \
517 pos = n, n = list_entry(n->member.next, typeof(*n), member))
524 * @member: the name of the list_struct within the struct.
529 #define list_for_each_entry_safe_from(pos, n, head, member) \
530 for (n = list_entry(pos->member.next, typeof(*pos), member); \
531 &pos->member != (head); \
532 pos = n, n = list_entry(n->member.next, typeof(*n), member))
539 * @member: the name of the list_struct within the struct.
544 #define list_for_each_entry_safe_reverse(pos, n, head, member) \
545 for (pos = list_entry((head)->prev, typeof(*pos), member), \
546 n = list_entry(pos->member.prev, typeof(*pos), member); \
547 &pos->member != (head); \
548 pos = n, n = list_entry(n->member.prev, typeof(*n), member))
639 #define hlist_entry(ptr, type, member) container_of(ptr,type,member)
649 #define hlist_entry_safe(ptr, type, member) \
651 ____ptr ? hlist_entry(____ptr, type, member) : NULL; \
658 * @member: the name of the hlist_node within the struct.
660 #define hlist_for_each_entry(pos, head, member) \
661 for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member);\
663 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
668 * @member: the name of the hlist_node within the struct.
670 #define hlist_for_each_entry_continue(pos, member) \
671 for (pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member);\
673 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
678 * @member: the name of the hlist_node within the struct.
680 #define hlist_for_each_entry_from(pos, member) \
682 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
689 * @member: the name of the hlist_node within the struct.
691 #define hlist_for_each_entry_safe(pos, n, head, member) \
692 for (pos = hlist_entry_safe((head)->first, typeof(*pos), member);\
693 pos && ({ n = pos->member.next; 1; }); \
694 pos = hlist_entry_safe(n, typeof(*pos), member))