253 	struct list_head *first = list->next;  in __list_splice()  local
256 	first->prev = prev;  in __list_splice()
257 	prev->next = first;  in __list_splice()
544 	struct hlist_node *first;  member
551 #define HLIST_HEAD_INIT { .first = NULL }
552 #define HLIST_HEAD(name) struct hlist_head name = {  .first = NULL }
553 #define INIT_HLIST_HEAD(ptr) ((ptr)->first = NULL)
567 	return !h->first;  in hlist_empty()
596 	struct hlist_node *first = h->first;  in hlist_add_head()  local
597 	n->next = first;  in hlist_add_head()
598 	if (first)  in hlist_add_head()
599 		first->pprev = &n->next;  in hlist_add_head()
600 	h->first = n;  in hlist_add_head()
601 	n->pprev = &h->first;  in hlist_add_head()
628 	for (pos = (head)->first; pos && ({ prefetch(pos->next); 1; }); \
632 	for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
643 	for (pos = (head)->first;					 \
680 	for (pos = (head)->first;					 \