231 	struct list_head *first;  in list_rotate_left()  local
234 		first = head->next;  in list_rotate_left()
235 		list_move_tail(first, head);  in list_rotate_left()
322 	struct list_head *first = list->next;  in __list_splice()  local
325 	first->prev = prev;  in __list_splice()
326 	prev->next = first;  in __list_splice()
655 #define HLIST_HEAD_INIT { .first = NULL }
656 #define HLIST_HEAD(name) struct hlist_head name = {  .first = NULL }
657 #define INIT_HLIST_HEAD(ptr) ((ptr)->first = NULL)
671 	return !READ_ONCE(h->first);  in hlist_empty()
701 	struct hlist_node *first = h->first;  in hlist_add_head()  local
702 	n->next = first;  in hlist_add_head()
703 	if (first)  in hlist_add_head()
704 		first->pprev = &n->next;  in hlist_add_head()
705 	WRITE_ONCE(h->first, n);  in hlist_add_head()
706 	n->pprev = &h->first;  in hlist_add_head()
748 	return !n->next && n->pprev == &h->first;  in hlist_is_singular_node()
758 	new->first = old->first;  in hlist_move_list()
759 	if (new->first)  in hlist_move_list()
760 		new->first->pprev = &new->first;  in hlist_move_list()
761 	old->first = NULL;  in hlist_move_list()
767 	for (pos = (head)->first; pos ; pos = pos->next)
770 	for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
785 	for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member);\
816 	for (pos = hlist_entry_safe((head)->first, typeof(*pos), member);\