46 INIT_LIST_HEAD(struct list_head *head) {  in INIT_LIST_HEAD()  argument
47 	(head)->next = head;  in INIT_LIST_HEAD()
48 	(head)->prev = head;  in INIT_LIST_HEAD()
52 list_empty(struct list_head *head) {  in list_empty()  argument
53 	return (head)->next == head;  in list_empty()
57 list_add(struct list_head *new, struct list_head *head) {  in list_add()  argument
58         (head)->next->prev = new;  in list_add()
59         (new)->next = (head)->next;  in list_add()
60         (new)->prev = head;  in list_add()
61         (head)->next = new;  in list_add()
65 list_add_tail(struct list_head *entry, struct list_head *head) {  in list_add_tail()  argument
66 	(entry)->prev = (head)->prev;  in list_add_tail()
67 	(entry)->next = head;  in list_add_tail()
68 	(head)->prev->next = entry;  in list_add_tail()
69 	(head)->prev = entry;  in list_add_tail()
85 #define list_for_each(entry, head)				\  argument
86     for (entry = (head)->next; entry != head; entry = (entry)->next)
88 #define list_for_each_prev(entry, head) \  argument
89         for (entry = (head)->prev; entry != (head); \
92 #define list_for_each_safe(entry, temp, head)			\  argument
93     for (entry = (head)->next, temp = (entry)->next;		\
94 	entry != head; 						\
104 #define list_for_each_entry_safe(pos, n, head, member)			\  argument
105 	for (pos = list_entry((head)->next, __typeof(*pos), member),	\
107 	    &pos->member != (head);					\