26 	list->next = list;  in INIT_LIST_HEAD()
39 			      struct list_head *next)  in __list_add()  argument
41 	next->prev = new;  in __list_add()
42 	new->next = next;  in __list_add()
44 	prev->next = new;  in __list_add()
49 			      struct list_head *next);
62 	__list_add(new, head, head->next);  in list_add()
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()
101 	__list_del(entry->prev, entry->next);  in __list_del_entry()
106 	__list_del(entry->prev, entry->next);  in list_del()
107 	entry->next = LIST_POISON1;  in list_del()
125 	new->next = old->next;  in list_replace()
126 	new->next->prev = new;  in list_replace()
128 	new->prev->next = new;  in list_replace()
179 	return list->next == head;  in list_is_last()
188 	return head->next == head;  in list_empty()
206 	struct list_head *next = head->next;  in list_empty_careful()  local
207 	return (next == head) && (next == head->prev);  in list_empty_careful()
219 		first = head->next;  in list_rotate_left()
230 	return !list_empty(head) && (head->next == head->prev);  in list_is_singular()
236 	struct list_head *new_first = entry->next;  in __list_cut_position()
237 	list->next = head->next;  in __list_cut_position()
238 	list->next->prev = list;  in __list_cut_position()
240 	entry->next = list;  in __list_cut_position()
241 	head->next = new_first;  in __list_cut_position()
265 		(head->next != entry && head != entry))  in list_cut_position()
275 				 struct list_head *next)  in __list_splice()  argument
277 	struct list_head *first = list->next;  in __list_splice()
281 	prev->next = first;  in __list_splice()
283 	last->next = next;  in __list_splice()
284 	next->prev = last;  in __list_splice()
296 		__list_splice(list, head, head->next);  in list_splice()
322 		__list_splice(list, head, head->next);  in list_splice_init()
362 	list_entry((ptr)->next, type, member)
381 	for (pos = (head)->next; pos != (head); pos = pos->next)
398 	for (pos = (head)->next, n = pos->next; pos != (head); \
399 		pos = n, n = pos->next)
419 	for (pos = list_entry((head)->next, typeof(*pos), member);	\
421 	     pos = list_entry(pos->member.next, typeof(*pos), member))
455 	for (pos = list_entry(pos->member.next, typeof(*pos), member);	\
457 	     pos = list_entry(pos->member.next, typeof(*pos), member))
483 	     pos = list_entry(pos->member.next, typeof(*pos), member))
493 	for (pos = list_entry((head)->next, typeof(*pos), member),	\
494 		n = list_entry(pos->member.next, typeof(*pos), member);	\
496 	     pos = n, n = list_entry(n->member.next, typeof(*n), member))
509 	for (pos = list_entry(pos->member.next, typeof(*pos), member), 		\
510 		n = list_entry(pos->member.next, typeof(*pos), member);		\
512 	     pos = n, n = list_entry(n->member.next, typeof(*n), member))
525 	for (n = list_entry(pos->member.next, typeof(*pos), member);		\
527 	     pos = n, n = list_entry(n->member.next, typeof(*n), member))
558 	n = list_entry(pos->member.next, typeof(*pos), member)
572 	h->next = NULL;  in INIT_HLIST_NODE()
588 	struct hlist_node *next = n->next;  in __hlist_del()  local
590 	*pprev = next;  in __hlist_del()
591 	if (next)  in __hlist_del()
592 		next->pprev = pprev;  in __hlist_del()
598 	n->next = LIST_POISON1;  in hlist_del()
613 	n->next = first;  in hlist_add_head()
615 		first->pprev = &n->next;  in hlist_add_head()
622 					struct hlist_node *next)  in hlist_add_before()  argument
624 	n->pprev = next->pprev;  in hlist_add_before()
625 	n->next = next;  in hlist_add_before()
626 	next->pprev = &n->next;  in hlist_add_before()
631 					struct hlist_node *next)  in hlist_add_after()  argument
633 	next->next = n->next;  in hlist_add_after()
634 	n->next = next;  in hlist_add_after()
635 	next->pprev = &n->next;  in hlist_add_after()
637 	if(next->next)  in hlist_add_after()
638 		next->next->pprev  = &next->next;  in hlist_add_after()
644 	n->pprev = &n->next;  in hlist_add_fake()
663 	for (pos = (head)->first; pos ; pos = pos->next)
666 	for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
683 	     pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
691 	for (pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member);\
693 	     pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
702 	     pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
713 	     pos && ({ n = pos->member.next; 1; });			\