54 	struct list_head *next, *prev;  member
63 	(ptr)->next = (ptr); (ptr)->prev = (ptr); \
74 			      struct list_head *next)  in __list_add()  argument
76 	next->prev = new;  in __list_add()
77 	new->next = next;  in __list_add()
79 	prev->next = new;  in __list_add()
92 	__list_add(new, head, head->next);  in list_add()
115 		struct list_head * prev, struct list_head * next)  in __list_add_rcu()  argument
117 	new->next = next;  in __list_add_rcu()
120 	next->prev = new;  in __list_add_rcu()
121 	prev->next = new;  in __list_add_rcu()
142 	__list_add_rcu(new, head, head->next);  in list_add_rcu()
174 static inline void __list_del(struct list_head * prev, struct list_head * next)  in __list_del()  argument
176 	next->prev = prev;  in __list_del()
177 	prev->next = next;  in __list_del()
188 	__list_del(entry->prev, entry->next);  in list_del()
189 	entry->next = LIST_POISON1;  in list_del()
219 	__list_del(entry->prev, entry->next);  in list_del_rcu()
229 	__list_del(entry->prev, entry->next);  in list_del_init()
240         __list_del(list->prev, list->next);  in list_move()
252         __list_del(list->prev, list->next);  in list_move_tail()
262 	return head->next == head;  in list_empty()
279 	struct list_head *next = head->next;  in list_empty_careful()  local
280 	return (next == head) && (next == head->prev);  in list_empty_careful()
286 	struct list_head *first = list->next;  in __list_splice()
288 	struct list_head *at = head->next;  in __list_splice()
291 	head->next = first;  in __list_splice()
293 	last->next = at;  in __list_splice()
339 	for (pos = (head)->next, prefetch(pos->next); pos != (head); \
340         	pos = pos->next, prefetch(pos->next))
353 	for (pos = (head)->next; pos != (head); pos = pos->next)
371 	for (pos = (head)->next, n = pos->next; pos != (head); \
372 		pos = n, n = pos->next)
381 	for (pos = list_entry((head)->next, typeof(*pos), member),	\
382 		     prefetch(pos->member.next);			\
384 	     pos = list_entry(pos->member.next, typeof(*pos), member),	\
385 		     prefetch(pos->member.next))
418 	for (pos = list_entry(pos->member.next, typeof(*pos), member),	\
419 		     prefetch(pos->member.next);			\
421 	     pos = list_entry(pos->member.next, typeof(*pos), member),	\
422 		     prefetch(pos->member.next))
432 	for (pos = list_entry((head)->next, typeof(*pos), member),	\
433 		n = list_entry(pos->member.next, typeof(*pos), member);	\
435 	     pos = n, n = list_entry(n->member.next, typeof(*n), member))
447 	for (pos = (head)->next, prefetch(pos->next); pos != (head); \
448         	pos = pos->next, ({ smp_read_barrier_depends(); 0;}), prefetch(pos->next))
451 	for (pos = (head)->next; pos != (head); \
452         	pos = pos->next, ({ smp_read_barrier_depends(); 0;}))
466 	for (pos = (head)->next, n = pos->next; pos != (head); \
467 		pos = n, ({ smp_read_barrier_depends(); 0;}), n = pos->next)
480 	for (pos = list_entry((head)->next, typeof(*pos), member),	\
481 		     prefetch(pos->member.next);			\
483 	     pos = list_entry(pos->member.next, typeof(*pos), member),	\
485 		     prefetch(pos->member.next))
499 	for ((pos) = (pos)->next, prefetch((pos)->next); (pos) != (head); \
500         	(pos) = (pos)->next, ({ smp_read_barrier_depends(); 0;}), prefetch((pos)->next))
514 	struct hlist_node *next, **pprev;  member
520 #define INIT_HLIST_NODE(ptr) ((ptr)->next = NULL, (ptr)->pprev = NULL)
534 	struct hlist_node *next = n->next;  in __hlist_del()  local
536 	*pprev = next;  in __hlist_del()
537 	if (next)  in __hlist_del()
538 		next->pprev = pprev;  in __hlist_del()
544 	n->next = LIST_POISON1;  in hlist_del()
586 	n->next = first;  in hlist_add_head()
588 		first->pprev = &n->next;  in hlist_add_head()
617 	n->next = first;  in hlist_add_head_rcu()
621 		first->pprev = &n->next;  in hlist_add_head_rcu()
627 					struct hlist_node *next)  in hlist_add_before()  argument
629 	n->pprev = next->pprev;  in hlist_add_before()
630 	n->next = next;  in hlist_add_before()
631 	next->pprev = &n->next;  in hlist_add_before()
636 					struct hlist_node *next)  in hlist_add_after()  argument
638 	next->next = n->next;  in hlist_add_after()
639 	n->next = next;  in hlist_add_after()
640 	next->pprev = &n->next;  in hlist_add_after()
642 	if(next->next)  in hlist_add_after()
643 		next->next->pprev  = &next->next;  in hlist_add_after()
649 	for (pos = (head)->first; pos && ({ prefetch(pos->next); 1; }); \
650 	     pos = pos->next)
653 	for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
665 	     pos && ({ prefetch(pos->next); 1;}) &&			 \
667 	     pos = pos->next)
676 	for (pos = (pos)->next;						 \
677 	     pos && ({ prefetch(pos->next); 1;}) &&			 \
679 	     pos = pos->next)
688 	for (; pos && ({ prefetch(pos->next); 1;}) &&			 \
690 	     pos = pos->next)
702 	     pos && ({ n = pos->next; 1; }) && 				 \
719 	     pos && ({ prefetch(pos->next); 1;}) &&			 \
721 	     pos = pos->next, ({ smp_read_barrier_depends(); 0; }) )