39 	struct list_head *next, *prev;  member
47 	(head)->next = head;  in INIT_LIST_HEAD()
53 	return (head)->next == head;  in list_empty()
58         (head)->next->prev = new;  in list_add()
59         (new)->next = (head)->next;  in list_add()
61         (head)->next = new;  in list_add()
67 	(entry)->next = head;  in list_add_tail()
68 	(head)->prev->next = entry;  in list_add_tail()
74 	(entry)->next->prev = (entry)->prev;  in list_del()
75 	(entry)->prev->next = (entry)->next;  in list_del()
80 	(entry)->next->prev = (entry)->prev;  in list_del_init()
81 	(entry)->prev->next = (entry)->next;  in list_del_init()
86     for (entry = (head)->next; entry != head; entry = (entry)->next)
93     for (entry = (head)->next, temp = (entry)->next;		\
95 	entry = temp, temp = entry->next)
105 	for (pos = list_entry((head)->next, __typeof(*pos), member),	\
106 	    n = list_entry(pos->member.next, __typeof(*pos), member);	\
108 	    pos = n, n = list_entry(n->member.next, __typeof(*n), member))