24 	struct list_head *next, *prev;  member
49 	for (pos = list_entry((head)->next, typeof(*pos), member);	\
51 	     pos = list_entry(pos->member.next, typeof(*pos), member))
61 	for (pos = list_entry((head)->next, typeof(*pos), member),	\
62 		n = list_entry(pos->member.next, typeof(*pos), member);	\
64 	     pos = n, n = list_entry(n->member.next, typeof(*n), member))
72 	return head->next == head;  in list_empty()
79  * the prev/next entries already!
83 			      struct list_head *next)  in __list_add()  argument
85 	next->prev = _new;  in __list_add()
86 	_new->next = next;  in __list_add()
88 	prev->next = _new;  in __list_add()
105  * Delete a list entry by making the prev/next entries
109  * the prev/next entries already!
111 static inline void __list_del(struct list_head *prev, struct list_head *next)  in __list_del()  argument
113 	next->prev = prev;  in __list_del()
114 	prev->next = next;  in __list_del()
127 	__list_del(entry->prev, entry->next);  in list_del()
128 	entry->next = (struct list_head*)LIST_POISON1;  in list_del()