Lines Matching full:member

198  * in the process of modifying either member (next or prev)
349 * @member: the name of the list_head within the struct.
351 #define list_entry(ptr, type, member) \ argument
352 container_of(ptr, type, member)
358 * @member: the name of the list_head within the struct.
362 #define list_first_entry(ptr, type, member) \ argument
363 list_entry((ptr)->next, type, member)
369 * @member: the name of the list_head within the struct.
373 #define list_last_entry(ptr, type, member) \ argument
374 list_entry((ptr)->prev, type, member)
380 * @member: the name of the list_head within the struct.
384 #define list_first_entry_or_null(ptr, type, member) \ argument
385 (!list_empty(ptr) ? list_first_entry(ptr, type, member) : NULL)
391 * @member: the name of the list_head within the struct.
395 #define list_last_entry_or_null(ptr, type, member) \ argument
396 (!list_empty(ptr) ? list_last_entry(ptr, type, member) : NULL)
401 * @member: the name of the list_head within the struct.
403 #define list_next_entry(pos, member) \ argument
404 list_entry((pos)->member.next, typeof(*(pos)), member)
409 * @member: the name of the list_head within the struct.
411 #define list_prev_entry(pos, member) \ argument
412 list_entry((pos)->member.prev, typeof(*(pos)), member)
455 * @member: the name of the list_head within the struct.
457 #define list_for_each_entry(pos, head, member) \ argument
458 for (pos = list_first_entry(head, typeof(*pos), member); \
459 &pos->member != (head); \
460 pos = list_next_entry(pos, member))
466 * @member: the name of the list_head within the struct.
468 #define list_for_each_entry_reverse(pos, head, member) \ argument
469 for (pos = list_last_entry(head, typeof(*pos), member); \
470 &pos->member != (head); \
471 pos = list_prev_entry(pos, member))
477 * @member: the name of the list_head within the struct.
481 #define list_prepare_entry(pos, head, member) \ argument
482 ((pos) ? : list_entry(head, typeof(*pos), member))
488 * @member: the name of the list_head within the struct.
493 #define list_for_each_entry_continue(pos, head, member) \ argument
494 for (pos = list_next_entry(pos, member); \
495 &pos->member != (head); \
496 pos = list_next_entry(pos, member))
502 * @member: the name of the list_head within the struct.
507 #define list_for_each_entry_continue_reverse(pos, head, member) \ argument
508 for (pos = list_prev_entry(pos, member); \
509 &pos->member != (head); \
510 pos = list_prev_entry(pos, member))
516 * @member: the name of the list_head within the struct.
520 #define list_for_each_entry_from(pos, head, member) \ argument
521 for (; &pos->member != (head); \
522 pos = list_next_entry(pos, member))
529 * @member: the name of the list_head within the struct.
531 #define list_for_each_entry_safe(pos, n, head, member) \ argument
532 for (pos = list_first_entry(head, typeof(*pos), member), \
533 n = list_next_entry(pos, member); \
534 &pos->member != (head); \
535 pos = n, n = list_next_entry(n, member))
542 * @member: the name of the list_head within the struct.
547 #define list_for_each_entry_safe_continue(pos, n, head, member) \ argument
548 for (pos = list_next_entry(pos, member), \
549 n = list_next_entry(pos, member); \
550 &pos->member != (head); \
551 pos = n, n = list_next_entry(n, member))
558 * @member: the name of the list_head within the struct.
563 #define list_for_each_entry_safe_from(pos, n, head, member) \ argument
564 for (n = list_next_entry(pos, member); \
565 &pos->member != (head); \
566 pos = n, n = list_next_entry(n, member))
573 * @member: the name of the list_head within the struct.
578 #define list_for_each_entry_safe_reverse(pos, n, head, member) \ argument
579 for (pos = list_last_entry(head, typeof(*pos), member), \
580 n = list_prev_entry(pos, member); \
581 &pos->member != (head); \
582 pos = n, n = list_prev_entry(n, member))
588 * @member: the name of the list_head within the struct.
596 #define list_safe_reset_next(pos, n, member) \ argument
597 n = list_next_entry(pos, member)
705 #define hlist_entry(ptr, type, member) container_of(ptr,type,member) argument
714 #define hlist_entry_safe(ptr, type, member) \ argument
716 ____ptr ? hlist_entry(____ptr, type, member) : NULL; \
723 * @member: the name of the hlist_node within the struct.
725 #define hlist_for_each_entry(pos, head, member) \ argument
726 for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member);\
728 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
733 * @member: the name of the hlist_node within the struct.
735 #define hlist_for_each_entry_continue(pos, member) \ argument
736 for (pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member);\
738 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
743 * @member: the name of the hlist_node within the struct.
745 #define hlist_for_each_entry_from(pos, member) \ argument
747 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
754 * @member: the name of the hlist_node within the struct.
756 #define hlist_for_each_entry_safe(pos, n, head, member) \ argument
757 for (pos = hlist_entry_safe((head)->first, typeof(*pos), member);\
758 pos && ({ n = pos->member.next; 1; }); \
759 pos = hlist_entry_safe(n, typeof(*pos), member))