36  * sometimes we already know the next/prev entries and we can
42 	struct list_head *next, *prev;  member
52 	list->next = list;  in INIT_LIST_HEAD()
60  * the prev/next entries already!
64 			      struct list_head *prev, struct list_head *next)  in __list_add()  argument
66 	next->prev = new;  in __list_add()
67 	new->next = next;  in __list_add()
69 	prev->next = new;  in __list_add()
73 		       struct list_head *prev, struct list_head *next);
86 	__list_add(new, head, head->next);  in list_add()
103  * Delete a list entry by making the prev/next entries
107  * the prev/next entries already!
109 static inline void __list_del(struct list_head *prev, struct list_head *next)  in __list_del()  argument
111 	next->prev = prev;  in __list_del()
112 	prev->next = next;  in __list_del()
124 	__list_del(entry->prev, entry->next);  in list_del()
125 	entry->next = (void *)0xDEADBEEF;  in list_del()
141 	new->next = old->next;  in list_replace()
142 	new->next->prev = new;  in list_replace()
144 	new->prev->next = new;  in list_replace()
160 	__list_del(entry->prev, entry->next);  in list_del_init()
171 	__list_del(list->prev, list->next);  in list_move()
183 	__list_del(list->prev, list->next);  in list_move_tail()
195 	return list->next == head;  in list_is_last()
204 	return head->next == head;  in list_empty()
213  * in the process of modifying either member (next or prev)
222 	struct list_head *next = head->next;  in list_empty_careful()  local
223 	return (next == head) && (next == head->prev);  in list_empty_careful()
232 	return !list_empty(head) && (head->next == head->prev);  in list_is_singular()
239 	struct list_head *new_first = entry->next;  in __list_cut_position()
240 	list->next = head->next;  in __list_cut_position()
241 	list->next->prev = list;  in __list_cut_position()
243 	entry->next = list;  in __list_cut_position()
244 	head->next = new_first;  in __list_cut_position()
268 	if (list_is_singular(head) && (head->next != entry && head != entry))  in list_cut_position()
277 				 struct list_head *prev, struct list_head *next)  in __list_splice()  argument
279 	struct list_head *first = list->next;  in __list_splice()
283 	prev->next = first;  in __list_splice()
285 	last->next = next;  in __list_splice()
286 	next->prev = last;  in __list_splice()
298 		__list_splice(list, head, head->next);  in list_splice()
324 		__list_splice(list, head, head->next);  in list_splice_init()
364 	list_entry((ptr)->next, type, member)
372 	for (pos = (head)->next; prefetch(pos->next), pos != (head); \
373 		pos = pos->next)
386 	for (pos = (head)->next; pos != (head); pos = pos->next)
404 	for (pos = (head)->next, n = pos->next; pos != (head); \
405 		pos = n, n = pos->next)
425 	for (pos = list_entry((head)->next, typeof(*pos), member);	\
427 	     pos = list_entry(pos->member.next, typeof(*pos), member))
461 	for (pos = list_entry(pos->member.next, typeof(*pos), member);	\
462 	     prefetch(pos->member.next), &pos->member != (head);	\
463 	     pos = list_entry(pos->member.next, typeof(*pos), member))
488 	for (; prefetch(pos->member.next), &pos->member != (head);	\
489 	     pos = list_entry(pos->member.next, typeof(*pos), member))
499 	for (pos = list_entry((head)->next, typeof(*pos), member),	\
500 		n = list_entry(pos->member.next, typeof(*pos), member);	\
502 	     pos = n, n = list_entry(n->member.next, typeof(*n), member))
515 	for (pos = list_entry(pos->member.next, typeof(*pos), member), 		\
516 		n = list_entry(pos->member.next, typeof(*pos), member);		\
518 	     pos = n, n = list_entry(n->member.next, typeof(*n), member))
531 	for (n = list_entry(pos->member.next, typeof(*pos), member);		\
533 	     pos = n, n = list_entry(n->member.next, typeof(*n), member))