82 	if (list_empty(&task->u.tk_wait.timer_list))  in __rpc_disable_timer()
85 	list_del(&task->u.tk_wait.timer_list);  in __rpc_disable_timer()
112 	list_add(&task->u.tk_wait.timer_list, &queue->timer_list.list);  in __rpc_add_timer()
136 	list_for_each_entry(t, q, u.tk_wait.list) {  in __rpc_list_enqueue_task()
138 			list_add_tail(&task->u.tk_wait.links,  in __rpc_list_enqueue_task()
139 					&t->u.tk_wait.links);  in __rpc_list_enqueue_task()
141 			task->u.tk_wait.list.next = q;  in __rpc_list_enqueue_task()
142 			task->u.tk_wait.list.prev = NULL;  in __rpc_list_enqueue_task()
146 	INIT_LIST_HEAD(&task->u.tk_wait.links);  in __rpc_list_enqueue_task()
147 	list_add_tail(&task->u.tk_wait.list, q);  in __rpc_list_enqueue_task()
159 	if (task->u.tk_wait.list.prev == NULL) {  in __rpc_list_dequeue_task()
160 		list_del(&task->u.tk_wait.links);  in __rpc_list_dequeue_task()
163 	if (!list_empty(&task->u.tk_wait.links)) {  in __rpc_list_dequeue_task()
164 		t = list_first_entry(&task->u.tk_wait.links,  in __rpc_list_dequeue_task()
166 				u.tk_wait.links);  in __rpc_list_dequeue_task()
168 		q = t->u.tk_wait.list.next;  in __rpc_list_dequeue_task()
169 		list_add_tail(&t->u.tk_wait.list, q);  in __rpc_list_dequeue_task()
170 		list_del(&task->u.tk_wait.links);  in __rpc_list_dequeue_task()
172 	list_del(&task->u.tk_wait.list);  in __rpc_list_dequeue_task()
194 	INIT_LIST_HEAD(&task->u.tk_wait.timer_list);  in __rpc_add_wait_queue()
198 		list_add_tail(&task->u.tk_wait.list, &queue->tasks[0]);  in __rpc_add_wait_queue()
224 		list_del(&task->u.tk_wait.list);  in __rpc_remove_wait_queue()
349 		INIT_WORK(&task->u.tk_work, rpc_async_schedule);  in rpc_make_runnable()
350 		queue_work(wq, &task->u.tk_work);  in rpc_make_runnable()
592 		task = list_first_entry(q, struct rpc_task, u.tk_wait.list);  in __rpc_find_next_queued_priority()
602 		task = list_first_entry(q, struct rpc_task, u.tk_wait.list);  in __rpc_find_next_queued_priority()
615 			task = list_first_entry(q, struct rpc_task, u.tk_wait.list);  in __rpc_find_next_queued_priority()
634 		return list_first_entry(&queue->tasks[0], struct rpc_task, u.tk_wait.list);  in __rpc_find_next_queued()
754 	list_for_each_entry_safe(task, n, &queue->timer_list.list, u.tk_wait.timer_list) {  in __rpc_queue_timer_fn()
980 	__rpc_execute(container_of(work, struct rpc_task, u.tk_work));  in rpc_async_schedule()
1137 	rpc_free_task(container_of(work, struct rpc_task, u.tk_work));  in rpc_async_release()
1156 		INIT_WORK(&task->u.tk_work, rpc_async_release);  in rpc_final_put_task()
1157 		queue_work(q, &task->u.tk_work);  in rpc_final_put_task()