* Pick up the highest-prio task:
  */
 static inline struct task_struct *
-pick_next_task(struct rq *rq, struct task_struct *prev)
+pick_next_task(struct rq *rq)
 {
        const struct sched_class *class;
        struct task_struct *p;
                idle_balance(cpu, rq);
 
        prev->sched_class->put_prev_task(rq, prev);
-       next = pick_next_task(rq, prev);
+       next = pick_next_task(rq);
 
        if (likely(prev != next)) {
                sched_info_switch(prev, next);
                if (!rq->nr_running)
                        break;
                update_rq_clock(rq);
-               next = pick_next_task(rq, rq->curr);
+               next = pick_next_task(rq);
                if (!next)
                        break;
                next->sched_class->put_prev_task(rq, next);