157 	struct list_head *first = list->next;  in __list_splice()  local
160 	first->prev = prev;  in __list_splice()
161 	prev->next = first;  in __list_splice()
182 	struct hlist_node *first;  member
191 #define	INIT_HLIST_HEAD(head) (head)->first = NULL
209 	return !h->first;  in hlist_empty()
235 	n->next = h->first;  in hlist_add_head()
236 	if (h->first)  in hlist_add_head()
237 		h->first->pprev = &n->next;  in hlist_add_head()
238 	h->first = n;  in hlist_add_head()
239 	n->pprev = &h->first;  in hlist_add_head()
267 	new->first = old->first;  in hlist_move_list()
268 	if (new->first)  in hlist_move_list()
269 		new->first->pprev = &new->first;  in hlist_move_list()
270 	old->first = NULL;  in hlist_move_list()
276 	for (p = (head)->first; p; p = p->next)
279 	for (p = (head)->first; p && ({ n = p->next; 1; }); p = n)
282 	for (p = (head)->first;						\
293 	for (pos = (head)->first;					 \