21 static inline void wq_list_add_after(struct io_wq_work_node *node,  in wq_list_add_after()  argument
27 	pos->next = node;  in wq_list_add_after()
28 	node->next = next;  in wq_list_add_after()
30 		list->last = node;  in wq_list_add_after()
33 static inline void wq_list_add_tail(struct io_wq_work_node *node,  in wq_list_add_tail()  argument
36 	node->next = NULL;  in wq_list_add_tail()
38 		list->last = node;  in wq_list_add_tail()
39 		WRITE_ONCE(list->first, node);  in wq_list_add_tail()
41 		list->last->next = node;  in wq_list_add_tail()
42 		list->last = node;  in wq_list_add_tail()
46 static inline void wq_list_add_head(struct io_wq_work_node *node,  in wq_list_add_head()  argument
49 	node->next = list->first;  in wq_list_add_head()
50 	if (!node->next)  in wq_list_add_head()
51 		list->last = node;  in wq_list_add_head()
52 	WRITE_ONCE(list->first, node);  in wq_list_add_head()
88 static inline void wq_stack_add_head(struct io_wq_work_node *node,  in wq_stack_add_head()  argument
91 	node->next = stack->next;  in wq_stack_add_head()
92 	stack->next = node;  in wq_stack_add_head()
96 			       struct io_wq_work_node *node,  in wq_list_del()  argument
99 	wq_list_cut(list, node, prev);  in wq_list_del()
105 	struct io_wq_work_node *node = stack->next;  in wq_stack_extract()  local
107 	stack->next = node->next;  in wq_stack_extract()
108 	return node;  in wq_stack_extract()