24 	struct io_wq_work_node *next;  member
36 	struct io_wq_work_node *next = pos->next;  in wq_list_add_after()  local
38 	pos->next = node;  in wq_list_add_after()
39 	node->next = next;  in wq_list_add_after()
40 	if (!next)  in wq_list_add_after()
47 	node->next = NULL;  in wq_list_add_tail()
52 		list->last->next = node;  in wq_list_add_tail()
63 		WRITE_ONCE(list->first, last->next);  in wq_list_cut()
65 		prev->next = last->next;  in wq_list_cut()
69 	last->next = NULL;  in wq_list_cut()
80 	for (pos = (head)->first, prv = NULL; pos; prv = pos, pos = (pos)->next)
95 	if (!work->list.next)  in wq_next_work()
98 	return container_of(work->list.next, struct io_wq_work, list);  in wq_next_work()