/* Return task->normal_prio when the waiter list is empty or when the waiter is not allowed to do priority boosting  */
int rt_mutex_getprio(struct task_struct *task)
/* Return task->normal_prio when the waiter list is empty or when the waiter is not allowed to do priority boosting  */
int rt_mutex_getprio(struct task_struct *task)
{
	if (likely(!task_has_pi_waiters(task)))
		return task->normal_prio;
	return min(task_top_pi_waiter(task)->pi_list_entry.prio,
		   task->normal_prio);
}