Lines Matching refs:n
408 #define list_for_each_safe(pos, n, head) \ argument
409 for (pos = (head)->next, n = pos->next; pos != (head); \
410 pos = n, n = pos->next)
418 #define list_for_each_prev_safe(pos, n, head) \ argument
419 for (pos = (head)->prev, n = pos->prev; \
421 pos = n, n = pos->prev)
512 #define list_for_each_entry_safe(pos, n, head, member) \ argument
514 n = list_entry(pos->member.next, typeof(*pos), member); \
516 pos = n, n = list_entry(n->member.next, typeof(*n), member))
528 #define list_for_each_entry_safe_continue(pos, n, head, member) \ argument
530 n = list_entry(pos->member.next, typeof(*pos), member); \
532 pos = n, n = list_entry(n->member.next, typeof(*n), member))
544 #define list_for_each_entry_safe_from(pos, n, head, member) \ argument
545 for (n = list_entry(pos->member.next, typeof(*pos), member); \
547 pos = n, n = list_entry(n->member.next, typeof(*n), member))
559 #define list_for_each_entry_safe_reverse(pos, n, head, member) \ argument
561 n = list_entry(pos->member.prev, typeof(*pos), member); \
563 pos = n, n = list_entry(n->member.prev, typeof(*n), member))
614 static inline void __hlist_del(struct hlist_node *n) in __hlist_del() argument
616 struct hlist_node *next = n->next; in __hlist_del()
617 struct hlist_node **pprev = n->pprev; in __hlist_del()
623 static inline void hlist_del(struct hlist_node *n) in hlist_del() argument
625 __hlist_del(n); in hlist_del()
626 n->next = LIST_POISON1; in hlist_del()
627 n->pprev = LIST_POISON2; in hlist_del()
630 static inline void hlist_del_init(struct hlist_node *n) in hlist_del_init() argument
632 if (!hlist_unhashed(n)) { in hlist_del_init()
633 __hlist_del(n); in hlist_del_init()
634 INIT_HLIST_NODE(n); in hlist_del_init()
638 static inline void hlist_add_head(struct hlist_node *n, struct hlist_head *h) in hlist_add_head() argument
641 n->next = first; in hlist_add_head()
643 first->pprev = &n->next; in hlist_add_head()
644 h->first = n; in hlist_add_head()
645 n->pprev = &h->first; in hlist_add_head()
649 static inline void hlist_add_before(struct hlist_node *n, in hlist_add_before() argument
652 n->pprev = next->pprev; in hlist_add_before()
653 n->next = next; in hlist_add_before()
654 next->pprev = &n->next; in hlist_add_before()
655 *(n->pprev) = n; in hlist_add_before()
658 static inline void hlist_add_after(struct hlist_node *n, in hlist_add_after() argument
661 next->next = n->next; in hlist_add_after()
662 n->next = next; in hlist_add_after()
663 next->pprev = &n->next; in hlist_add_after()
674 #define hlist_for_each_safe(pos, n, head) \ argument
675 for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
676 pos = n)
720 #define hlist_for_each_entry_safe(pos, n, head, member) \ argument
722 pos && ({ n = pos->member.next; 1; }); \
723 pos = hlist_entry_safe(n, typeof(*pos), member))