17  * sometimes we already know the next/prev entries and we can
23 	struct list_head *next, *prev;  member
33 	list->next = list;  in INIT_LIST_HEAD()
41  * the prev/next entries already!
45 			      struct list_head *next)  in __list_add()  argument
47 	next->prev = new;  in __list_add()
48 	new->next = next;  in __list_add()
50 	prev->next = new;  in __list_add()
63 	__list_add(new, head, head->next);  in list_add()
80  * Delete a list entry by making the prev/next entries
84  * the prev/next entries already!
86 static inline void __list_del(struct list_head *prev, struct list_head *next)  in __list_del()  argument
88 	next->prev = prev;  in __list_del()
89 	prev->next = next;  in __list_del()
100 	__list_del(entry->prev, entry->next);  in list_del()
101 	entry->next = LIST_POISON1;  in list_del()
115 	new->next = old->next;  in list_replace()
116 	new->next->prev = new;  in list_replace()
118 	new->prev->next = new;  in list_replace()
134 	__list_del(entry->prev, entry->next);  in list_del_init()
145 	__list_del(list->prev, list->next);  in list_move()
157 	__list_del(list->prev, list->next);  in list_move_tail()
169 	return list->next == head;  in list_is_last()
178 	return head->next == head;  in list_empty()
187  * in the process of modifying either member (next or prev)
196 	struct list_head *next = head->next;  in list_empty_careful()  local
197 	return (next == head) && (next == head->prev);  in list_empty_careful()
206 	return !list_empty(head) && (head->next == head->prev);  in list_is_singular()
212 	struct list_head *new_first = entry->next;  in __list_cut_position()
213 	list->next = head->next;  in __list_cut_position()
214 	list->next->prev = list;  in __list_cut_position()
216 	entry->next = list;  in __list_cut_position()
217 	head->next = new_first;  in __list_cut_position()
241 		(head->next != entry && head != entry))  in list_cut_position()
251 				 struct list_head *next)  in __list_splice()  argument
253 	struct list_head *first = list->next;  in __list_splice()
257 	prev->next = first;  in __list_splice()
259 	last->next = next;  in __list_splice()
260 	next->prev = last;  in __list_splice()
272 		__list_splice(list, head, head->next);  in list_splice()
298 		__list_splice(list, head, head->next);  in list_splice_init()
338 	list_entry((ptr)->next, type, member)
357 	for (pos = (head)->next; prefetch(pos->next), pos != (head); \
358 		pos = pos->next)
371 	for (pos = (head)->next; pos != (head); pos = pos->next)
389 	for (pos = (head)->next, n = pos->next; pos != (head); \
390 		pos = n, n = pos->next)
410 	for (pos = list_entry((head)->next, typeof(*pos), member);	\
411 	     prefetch(pos->member.next), &pos->member != (head);	\
412 	     pos = list_entry(pos->member.next, typeof(*pos), member))
446 	for (pos = list_entry(pos->member.next, typeof(*pos), member);	\
447 	     prefetch(pos->member.next), &pos->member != (head);	\
448 	     pos = list_entry(pos->member.next, typeof(*pos), member))
473 	for (; prefetch(pos->member.next), &pos->member != (head);	\
474 	     pos = list_entry(pos->member.next, typeof(*pos), member))
484 	for (pos = list_entry((head)->next, typeof(*pos), member),	\
485 		n = list_entry(pos->member.next, typeof(*pos), member);	\
487 	     pos = n, n = list_entry(n->member.next, typeof(*n), member))
500 	for (pos = list_entry(pos->member.next, typeof(*pos), member),		\
501 		n = list_entry(pos->member.next, typeof(*pos), member);		\
503 	     pos = n, n = list_entry(n->member.next, typeof(*n), member))
516 	for (n = list_entry(pos->member.next, typeof(*pos), member);		\
518 	     pos = n, n = list_entry(n->member.next, typeof(*n), member))
548 	struct hlist_node *next, **pprev;  member
556 	h->next = NULL;  in INIT_HLIST_NODE()
572 	struct hlist_node *next = n->next;  in __hlist_del()  local
574 	*pprev = next;  in __hlist_del()
575 	if (next)  in __hlist_del()
576 		next->pprev = pprev;  in __hlist_del()
582 	n->next = LIST_POISON1;  in hlist_del()
597 	n->next = first;  in hlist_add_head()
599 		first->pprev = &n->next;  in hlist_add_head()
604 /* next must be != NULL */
606 					struct hlist_node *next)  in hlist_add_before()  argument
608 	n->pprev = next->pprev;  in hlist_add_before()
609 	n->next = next;  in hlist_add_before()
610 	next->pprev = &n->next;  in hlist_add_before()
615 					struct hlist_node *next)  in hlist_add_after()  argument
617 	next->next = n->next;  in hlist_add_after()
618 	n->next = next;  in hlist_add_after()
619 	next->pprev = &n->next;  in hlist_add_after()
621 	if(next->next)  in hlist_add_after()
622 		next->next->pprev  = &next->next;  in hlist_add_after()
628 	for (pos = (head)->first; pos && ({ prefetch(pos->next); 1; }); \
629 	     pos = pos->next)
632 	for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
644 	     pos && ({ prefetch(pos->next); 1;}) &&			 \
646 	     pos = pos->next)
655 	for (pos = (pos)->next;						 \
656 	     pos && ({ prefetch(pos->next); 1;}) &&			 \
658 	     pos = pos->next)
667 	for (; pos && ({ prefetch(pos->next); 1;}) &&			 \
669 	     pos = pos->next)
681 	     pos && ({ n = pos->next; 1; }) &&				 \