159 	struct list_head *first = list->next;  in __list_splice()  local
162 	first->prev = prev;  in __list_splice()
163 	prev->next = first;  in __list_splice()
184 	struct hlist_node *first;  member
193 #define	INIT_HLIST_HEAD(head) (head)->first = NULL
211 	return !h->first;  in hlist_empty()
237 	n->next = h->first;  in hlist_add_head()
238 	if (h->first)  in hlist_add_head()
239 		h->first->pprev = &n->next;  in hlist_add_head()
240 	h->first = n;  in hlist_add_head()
241 	n->pprev = &h->first;  in hlist_add_head()
269 	new->first = old->first;  in hlist_move_list()
270 	if (new->first)  in hlist_move_list()
271 		new->first->pprev = &new->first;  in hlist_move_list()
272 	old->first = NULL;  in hlist_move_list()
278 	for (p = (head)->first; p; p = p->next)
281 	for (p = (head)->first; p && ({ n = p->next; 1; }); p = n)
284 	for (p = (head)->first;						\
295 	for (pos = (head)->first;					 \