184 	__rpc_list_enqueue_task(&queue->tasks[queue_priority], task);  in __rpc_add_wait_queue_priority()
203 		list_add(&task->u.tk_wait.list, &queue->tasks[0]);  in __rpc_add_wait_queue()
205 		list_add_tail(&task->u.tk_wait.list, &queue->tasks[0]);  in __rpc_add_wait_queue()
240 	for (i = 0; i < ARRAY_SIZE(queue->tasks); i++)  in __rpc_init_priority_wait_queue()
241 		INIT_LIST_HEAD(&queue->tasks[i]);  in __rpc_init_priority_wait_queue()
597 	q = &queue->tasks[queue->priority];  in __rpc_find_next_queued_priority()
607 		if (q == &queue->tasks[0])  in __rpc_find_next_queued_priority()
608 			q = &queue->tasks[queue->maxpriority];  in __rpc_find_next_queued_priority()
615 	} while (q != &queue->tasks[queue->priority]);  in __rpc_find_next_queued_priority()
621 	rpc_set_waitqueue_priority(queue, (unsigned int)(q - &queue->tasks[0]));  in __rpc_find_next_queued_priority()
630 	if (!list_empty(&queue->tasks[0]))  in __rpc_find_next_queued()
631 		return list_first_entry(&queue->tasks[0], struct rpc_task, u.tk_wait.list);  in __rpc_find_next_queued()
689 	head = &queue->tasks[queue->maxpriority];  in rpc_wake_up()
698 		if (head == &queue->tasks[0])  in rpc_wake_up()
718 	head = &queue->tasks[queue->maxpriority];  in rpc_wake_up_status()
728 		if (head == &queue->tasks[0])  in rpc_wake_up_status()