7 	for (pos = (head)->first; pos; pos = (pos)->next)
10 	for (pos = (head)->first, prv = NULL; pos; prv = pos, pos = (pos)->next)
13 	for (; pos; prv = pos, pos = (pos)->next)
25 	struct io_wq_work_node *next = pos->next;  in wq_list_add_after()  local
27 	pos->next = node;  in wq_list_add_after()
28 	node->next = next;  in wq_list_add_after()
29 	if (!next)  in wq_list_add_after()
36 	node->next = NULL;  in wq_list_add_tail()
41 		list->last->next = node;  in wq_list_add_tail()
49 	node->next = list->first;  in wq_list_add_head()
50 	if (!node->next)  in wq_list_add_head()
61 		WRITE_ONCE(list->first, last->next);  in wq_list_cut()
63 		prev->next = last->next;  in wq_list_cut()
67 	last->next = NULL;  in wq_list_cut()
73 	list->last->next = to->next;  in __wq_list_splice()
74 	to->next = list->first;  in __wq_list_splice()
91 	node->next = stack->next;  in wq_stack_add_head()
92 	stack->next = node;  in wq_stack_add_head()
105 	struct io_wq_work_node *node = stack->next;  in wq_stack_extract()
107 	stack->next = node->next;  in wq_stack_extract()
113 	if (!work->list.next)  in wq_next_work()
116 	return container_of(work->list.next, struct io_wq_work, list);  in wq_next_work()