217 	struct list_head *first;  in list_rotate_left()  local
220 		first = head->next;  in list_rotate_left()
221 		list_move_tail(first, head);  in list_rotate_left()
278 	struct list_head *first = list->next;  in __list_splice()  local
281 	first->prev = prev;  in __list_splice()
282 	prev->next = first;  in __list_splice()
291  * @head: the place to add it in the first list.
303  * @head: the place to add it in the first list.
315  * @head: the place to add it in the first list.
331  * @head: the place to add it in the first list.
355  * list_first_entry - get the first element from a list
377  * list_first_entry_or_null - get the first element from a list
595 #define HLIST_HEAD_INIT { .first = NULL }
596 #define HLIST_HEAD(name) struct hlist_head name = {  .first = NULL }
597 #define INIT_HLIST_HEAD(ptr) ((ptr)->first = NULL)
611 	return !h->first;  in hlist_empty()
641 	struct hlist_node *first = h->first;  in hlist_add_head()  local
642 	n->next = first;  in hlist_add_head()
643 	if (first)  in hlist_add_head()
644 		first->pprev = &n->next;  in hlist_add_head()
645 	h->first = n;  in hlist_add_head()
646 	n->pprev = &h->first;  in hlist_add_head()
683  * reference of the first entry if it exists.
688 	new->first = old->first;  in hlist_move_list()
689 	if (new->first)  in hlist_move_list()
690 		new->first->pprev = &new->first;  in hlist_move_list()
691 	old->first = NULL;  in hlist_move_list()
697 	for (pos = (head)->first; pos ; pos = pos->next)
700 	for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
715 	for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member);\
746 	for (pos = hlist_entry_safe((head)->first, typeof(*pos), member);\
752  * @begin: first element in the range to delete from the list.