58 INIT_LIST_HEAD(struct list_head *head) {  in INIT_LIST_HEAD()  argument
59 	(head)->next = head;  in INIT_LIST_HEAD()
60 	(head)->prev = head;  in INIT_LIST_HEAD()
64 list_empty(const struct list_head *head) {  in list_empty()  argument
65 	return (head)->next == head;  in list_empty()
69 list_add(struct list_head *new, struct list_head *head) {  in list_add()  argument
70         (head)->next->prev = new;  in list_add()
71         (new)->next = (head)->next;  in list_add()
72         (new)->prev = head;  in list_add()
73         (head)->next = new;  in list_add()
77 list_add_tail(struct list_head *entry, struct list_head *head) {  in list_add_tail()  argument
78 	(entry)->prev = (head)->prev;  in list_add_tail()
79 	(entry)->next = head;  in list_add_tail()
80 	(head)->prev->next = entry;  in list_add_tail()
81 	(head)->prev = entry;  in list_add_tail()
90 static inline void list_move(struct list_head *list, struct list_head *head)  in list_move()  argument
93 	list_add(list, head);  in list_move()
97     struct list_head *head)  in list_move_tail()  argument
100 	list_add_tail(list, head);  in list_move_tail()
110 #define list_for_each(entry, head)				\  argument
111     for (entry = (head)->next; entry != head; entry = (entry)->next)
113 #define list_for_each_safe(entry, temp, head)			\  argument
114     for (entry = (head)->next, temp = (entry)->next;		\
115 	entry != head; 						\
118 #define list_for_each_entry(pos, head, member)				\  argument
119     for (pos = list_entry((head)->next, __typeof(*pos), member);	\
120 	&pos->member != (head);					 	\
123 #define list_for_each_entry_safe(pos, n, head, member)			\  argument
124 	for (pos = list_entry((head)->next, __typeof(*pos), member),	\
126 	    &pos->member != (head);					\