243 				       struct list_head *first,  in list_bulk_move_tail()  argument
246 	first->prev->next = last->next;  in list_bulk_move_tail()
247 	last->next->prev = first->prev;  in list_bulk_move_tail()
249 	head->prev->next = first;  in list_bulk_move_tail()
250 	first->prev = head->prev;  in list_bulk_move_tail()
338 	struct list_head *first;  in list_rotate_left()  local
341 		first = head->next;  in list_rotate_left()
342 		list_move_tail(first, head);  in list_rotate_left()
446 	struct list_head *first = list->next;  in __list_splice()  local
449 	first->prev = prev;  in __list_splice()
450 	prev->next = first;  in __list_splice()
835 #define HLIST_HEAD_INIT { .first = NULL }
836 #define HLIST_HEAD(name) struct hlist_head name = {  .first = NULL }
837 #define INIT_HLIST_HEAD(ptr) ((ptr)->first = NULL)
876 	return !READ_ONCE(h->first);  in hlist_empty()
927 	struct hlist_node *first = h->first;  in hlist_add_head()  local
928 	WRITE_ONCE(n->next, first);  in hlist_add_head()
929 	if (first)  in hlist_add_head()
930 		WRITE_ONCE(first->pprev, &n->next);  in hlist_add_head()
931 	WRITE_ONCE(h->first, n);  in hlist_add_head()
932 	WRITE_ONCE(n->pprev, &h->first);  in hlist_add_head()
998 	return !n->next && n->pprev == &h->first;  in hlist_is_singular_node()
1012 	new->first = old->first;  in hlist_move_list()
1013 	if (new->first)  in hlist_move_list()
1014 		new->first->pprev = &new->first;  in hlist_move_list()
1015 	old->first = NULL;  in hlist_move_list()
1021 	for (pos = (head)->first; pos ; pos = pos->next)
1024 	for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
1039 	for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member);\
1070 	for (pos = hlist_entry_safe((head)->first, typeof(*pos), member);\