176 	struct list_head *first;  in _list_splice()  local
181 	first = list->next;  in _list_splice()
183 	first->prev = prev;  in _list_splice()
184 	prev->next = first;  in _list_splice()
224 	struct hlist_node *first;  member
233 #define	INIT_HLIST_HEAD(head) (head)->first = NULL
251 	return !h->first;  in hlist_empty()
277 	n->next = h->first;  in hlist_add_head()
278 	if (h->first)  in hlist_add_head()
279 		h->first->pprev = &n->next;  in hlist_add_head()
280 	h->first = n;  in hlist_add_head()
281 	n->pprev = &h->first;  in hlist_add_head()
309 	new->first = old->first;  in hlist_move_list()
310 	if (new->first)  in hlist_move_list()
311 		new->first->pprev = &new->first;  in hlist_move_list()
312 	old->first = NULL;  in hlist_move_list()
378 	for (p = (head)->first; p; p = p->next)
381 	for (p = (head)->first; p && ({ n = p->next; 1; }); p = n)
384 	for (p = (head)->first;						\
395 	for (pos = (head)->first;					 \