103 	struct list_head *q = &queue->tasks[queue->priority];  in rpc_rotate_queue_owner()  local
106 	if (!list_empty(q)) {  in rpc_rotate_queue_owner()
107 		task = list_first_entry(q, struct rpc_task, u.tk_wait.list);  in rpc_rotate_queue_owner()
109 			list_move_tail(&task->u.tk_wait.list, q);  in rpc_rotate_queue_owner()
141 	struct list_head *q;  in __rpc_add_wait_queue_priority()  local
149 	q = &queue->tasks[queue_priority];  in __rpc_add_wait_queue_priority()
150 	list_for_each_entry(t, q, u.tk_wait.list) {  in __rpc_add_wait_queue_priority()
156 	list_add_tail(&task->u.tk_wait.list, q);  in __rpc_add_wait_queue_priority()
352 static void __rpc_sleep_on_priority(struct rpc_wait_queue *q,  in __rpc_sleep_on_priority()  argument
358 			task->tk_pid, rpc_qname(q), jiffies);  in __rpc_sleep_on_priority()
360 	trace_rpc_task_sleep(task->tk_client, task, q);  in __rpc_sleep_on_priority()
362 	__rpc_add_wait_queue(q, task, queue_priority);  in __rpc_sleep_on_priority()
366 	__rpc_add_timer(q, task);  in __rpc_sleep_on_priority()
369 void rpc_sleep_on(struct rpc_wait_queue *q, struct rpc_task *task,  in rpc_sleep_on()  argument
383 	spin_lock_bh(&q->lock);  in rpc_sleep_on()
384 	__rpc_sleep_on_priority(q, task, action, task->tk_priority);  in rpc_sleep_on()
385 	spin_unlock_bh(&q->lock);  in rpc_sleep_on()
389 void rpc_sleep_on_priority(struct rpc_wait_queue *q, struct rpc_task *task,  in rpc_sleep_on_priority()  argument
403 	spin_lock_bh(&q->lock);  in rpc_sleep_on_priority()
404 	__rpc_sleep_on_priority(q, task, action, priority - RPC_PRIORITY_LOW);  in rpc_sleep_on_priority()
405 	spin_unlock_bh(&q->lock);  in rpc_sleep_on_priority()
464 	struct list_head *q;  in __rpc_find_next_queued_priority()  local
470 	q = &queue->tasks[queue->priority];  in __rpc_find_next_queued_priority()
471 	if (!list_empty(q)) {  in __rpc_find_next_queued_priority()
472 		task = list_entry(q->next, struct rpc_task, u.tk_wait.list);  in __rpc_find_next_queued_priority()
476 			list_move_tail(&task->u.tk_wait.list, q);  in __rpc_find_next_queued_priority()
488 		if (q == &queue->tasks[0])  in __rpc_find_next_queued_priority()
489 			q = &queue->tasks[queue->maxpriority];  in __rpc_find_next_queued_priority()
491 			q = q - 1;  in __rpc_find_next_queued_priority()
492 		if (!list_empty(q)) {  in __rpc_find_next_queued_priority()
493 			task = list_entry(q->next, struct rpc_task, u.tk_wait.list);  in __rpc_find_next_queued_priority()
496 	} while (q != &queue->tasks[queue->priority]);  in __rpc_find_next_queued_priority()
502 	rpc_set_waitqueue_priority(queue, (unsigned int)(q - &queue->tasks[0]));  in __rpc_find_next_queued_priority()
998 		struct workqueue_struct *q)  in rpc_final_put_task()  argument
1000 	if (q != NULL) {  in rpc_final_put_task()
1002 		queue_work(q, &task->u.tk_work);  in rpc_final_put_task()
1007 static void rpc_do_put_task(struct rpc_task *task, struct workqueue_struct *q)  in rpc_do_put_task()  argument
1011 		rpc_final_put_task(task, q);  in rpc_do_put_task()