Lines Matching full:first

7 	for (pos = (head)->first, prv = NULL; pos; prv = pos, pos = (pos)->next)
12 #define wq_list_empty(list)	(READ_ONCE((list)->first) == NULL)
15 	(list)->first = NULL;					\
31  * wq_list_merge - merge the second list to the first one.
32  * @list0: the first list
34  * Return the first node after mergence.
41 	if (!list0->first) {  in wq_list_merge()
42 		ret = list1->first;  in wq_list_merge()
44 		ret = list0->first;  in wq_list_merge()
45 		list0->last->next = list1->first;  in wq_list_merge()
56 	if (!list->first) {  in wq_list_add_tail()
58 		WRITE_ONCE(list->first, node);  in wq_list_add_tail()
68 	node->next = list->first;  in wq_list_add_head()
71 	WRITE_ONCE(list->first, node);  in wq_list_add_head()
78 	/* first in the list, if prev==NULL */  in wq_list_cut()
80 		WRITE_ONCE(list->first, last->next);  in wq_list_cut()
93 	to->next = list->first;  in __wq_list_splice()