388 #define list_for_each_safe(pos, n, head) \  argument
389 	for (pos = (head)->next, n = pos->next; pos != (head); \
390 		pos = n, n = pos->next)
398 #define list_for_each_prev_safe(pos, n, head) \  argument
399 	for (pos = (head)->prev, n = pos->prev; \
401 	     pos = n, n = pos->prev)
483 #define list_for_each_entry_safe(pos, n, head, member)			\  argument
485 		n = list_entry(pos->member.next, typeof(*pos), member);	\
487 	     pos = n, n = list_entry(n->member.next, typeof(*n), member))
499 #define list_for_each_entry_safe_continue(pos, n, head, member) 		\  argument
501 		n = list_entry(pos->member.next, typeof(*pos), member);		\
503 	     pos = n, n = list_entry(n->member.next, typeof(*n), member))
515 #define list_for_each_entry_safe_from(pos, n, head, member)			\  argument
516 	for (n = list_entry(pos->member.next, typeof(*pos), member);		\
518 	     pos = n, n = list_entry(n->member.next, typeof(*n), member))
530 #define list_for_each_entry_safe_reverse(pos, n, head, member)		\  argument
532 		n = list_entry(pos->member.prev, typeof(*pos), member);	\
534 	     pos = n, n = list_entry(n->member.prev, typeof(*n), member))
570 static inline void __hlist_del(struct hlist_node *n)  in __hlist_del()  argument
572 	struct hlist_node *next = n->next;  in __hlist_del()
573 	struct hlist_node **pprev = n->pprev;  in __hlist_del()
579 static inline void hlist_del(struct hlist_node *n)  in hlist_del()  argument
581 	__hlist_del(n);  in hlist_del()
582 	n->next = LIST_POISON1;  in hlist_del()
583 	n->pprev = LIST_POISON2;  in hlist_del()
586 static inline void hlist_del_init(struct hlist_node *n)  in hlist_del_init()  argument
588 	if (!hlist_unhashed(n)) {  in hlist_del_init()
589 		__hlist_del(n);  in hlist_del_init()
590 		INIT_HLIST_NODE(n);  in hlist_del_init()
594 static inline void hlist_add_head(struct hlist_node *n, struct hlist_head *h)  in hlist_add_head()  argument
597 	n->next = first;  in hlist_add_head()
599 		first->pprev = &n->next;  in hlist_add_head()
600 	h->first = n;  in hlist_add_head()
601 	n->pprev = &h->first;  in hlist_add_head()
605 static inline void hlist_add_before(struct hlist_node *n,  in hlist_add_before()  argument
608 	n->pprev = next->pprev;  in hlist_add_before()
609 	n->next = next;  in hlist_add_before()
610 	next->pprev = &n->next;  in hlist_add_before()
611 	*(n->pprev) = n;  in hlist_add_before()
614 static inline void hlist_add_after(struct hlist_node *n,  in hlist_add_after()  argument
617 	next->next = n->next;  in hlist_add_after()
618 	n->next = next;  in hlist_add_after()
619 	next->pprev = &n->next;  in hlist_add_after()
631 #define hlist_for_each_safe(pos, n, head) \  argument
632 	for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
633 	     pos = n)
679 #define hlist_for_each_entry_safe(tpos, pos, n, head, member)		 \  argument
681 	     pos && ({ n = pos->next; 1; }) &&				 \
683 	     pos = n)