227 				       struct list_head *first,  in list_bulk_move_tail()  argument
230 	first->prev->next = last->next;  in list_bulk_move_tail()
231 	last->next->prev = first->prev;  in list_bulk_move_tail()
233 	head->prev->next = first;  in list_bulk_move_tail()
234 	first->prev = head->prev;  in list_bulk_move_tail()
296 	struct list_head *first;  in list_rotate_left()  local
299 		first = head->next;  in list_rotate_left()
300 		list_move_tail(first, head);  in list_rotate_left()
405 	struct list_head *first = list->next;  in __list_splice()  local
408 	first->prev = prev;  in __list_splice()
409 	prev->next = first;  in __list_splice()
738 #define HLIST_HEAD_INIT { .first = NULL }
739 #define HLIST_HEAD(name) struct hlist_head name = {  .first = NULL }
740 #define INIT_HLIST_HEAD(ptr) ((ptr)->first = NULL)
754 	return !READ_ONCE(h->first);  in hlist_empty()
784 	struct hlist_node *first = h->first;  in hlist_add_head()  local
785 	n->next = first;  in hlist_add_head()
786 	if (first)  in hlist_add_head()
787 		first->pprev = &n->next;  in hlist_add_head()
788 	WRITE_ONCE(h->first, n);  in hlist_add_head()
789 	n->pprev = &h->first;  in hlist_add_head()
831 	return !n->next && n->pprev == &h->first;  in hlist_is_singular_node()
841 	new->first = old->first;  in hlist_move_list()
842 	if (new->first)  in hlist_move_list()
843 		new->first->pprev = &new->first;  in hlist_move_list()
844 	old->first = NULL;  in hlist_move_list()
850 	for (pos = (head)->first; pos ; pos = pos->next)
853 	for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
868 	for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member);\
899 	for (pos = hlist_entry_safe((head)->first, typeof(*pos), member);\