103 	struct list_head *q = &queue->tasks[queue->priority];  in rpc_rotate_queue_owner()
149 	q = &queue->tasks[queue_priority];  in __rpc_add_wait_queue_priority()
178 		list_add(&task->u.tk_wait.list, &queue->tasks[0]);  in __rpc_add_wait_queue()
180 		list_add_tail(&task->u.tk_wait.list, &queue->tasks[0]);  in __rpc_add_wait_queue()
225 	for (i = 0; i < ARRAY_SIZE(queue->tasks); i++)  in __rpc_init_priority_wait_queue()
226 		INIT_LIST_HEAD(&queue->tasks[i]);  in __rpc_init_priority_wait_queue()
469 	q = &queue->tasks[queue->priority];  in __rpc_find_next_queued_priority()
487 		if (q == &queue->tasks[0])  in __rpc_find_next_queued_priority()
488 			q = &queue->tasks[queue->maxpriority];  in __rpc_find_next_queued_priority()
495 	} while (q != &queue->tasks[queue->priority]);  in __rpc_find_next_queued_priority()
501 	rpc_set_waitqueue_priority(queue, (unsigned int)(q - &queue->tasks[0]));  in __rpc_find_next_queued_priority()
512 	if (!list_empty(&queue->tasks[0]))  in __rpc_find_next_queued()
513 		return list_first_entry(&queue->tasks[0], struct rpc_task, u.tk_wait.list);  in __rpc_find_next_queued()
566 	head = &queue->tasks[queue->maxpriority];  in rpc_wake_up()
575 		if (head == &queue->tasks[0])  in rpc_wake_up()
595 	head = &queue->tasks[queue->maxpriority];  in rpc_wake_up_status()
605 		if (head == &queue->tasks[0])  in rpc_wake_up_status()