7 	for (pos = (head)->first, prv = NULL; pos; prv = pos, pos = (pos)->next)
10 	for (; pos; prv = pos, pos = (pos)->next)
22 	struct io_wq_work_node *next = pos->next;  in wq_list_add_after()  local
24 	pos->next = node;  in wq_list_add_after()
25 	node->next = next;  in wq_list_add_after()
26 	if (!next)  in wq_list_add_after()
45 		list0->last->next = list1->first;  in wq_list_merge()
55 	node->next = NULL;  in wq_list_add_tail()
60 		list->last->next = node;  in wq_list_add_tail()
68 	node->next = list->first;  in wq_list_add_head()
69 	if (!node->next)  in wq_list_add_head()
80 		WRITE_ONCE(list->first, last->next);  in wq_list_cut()
82 		prev->next = last->next;  in wq_list_cut()
86 	last->next = NULL;  in wq_list_cut()
92 	list->last->next = to->next;  in __wq_list_splice()
93 	to->next = list->first;  in __wq_list_splice()
110 	node->next = stack->next;  in wq_stack_add_head()
111 	stack->next = node;  in wq_stack_add_head()
124 	struct io_wq_work_node *node = stack->next;  in wq_stack_extract()
126 	stack->next = node->next;  in wq_stack_extract()
132 	if (!work->list.next)  in wq_next_work()
135 	return container_of(work->list.next, struct io_wq_work, list);  in wq_next_work()