sched: simplify sched_class::yield_task()

the 'p' (task_struct) parameter in the sched_class :: yield_task() is
redundant as the caller is always the 'current'. Get rid of it.

   text    data     bss     dec     hex filename
  24341    2734      20   27095    69d7 sched.o.before
  24330    2734      20   27084    69cc sched.o.after

Signed-off-by: Dmitry Adamushko <dmitry.adamushko@gmail.com>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
Signed-off-by: Peter Zijlstra <a.p.zijlstra@chello.nl>
Reviewed-by: Thomas Gleixner <tglx@linutronix.de>

1 files changed, 5 insertions, 5 deletions

diff --git a/kernel/sched_fair.c b/kernel/sched_fair.c
index 827a0636525a..4dd256d46853 100644
--- a/kernel/sched_fair.c
+++ b/kernel/sched_fair.c
@@ -722,11 +722,11 @@ static void dequeue_task_fair(struct rq *rq, struct task_struct *p, int sleep)
  *
  * If compat_yield is turned on then we requeue to the end of the tree.
  */
-static void yield_task_fair(struct rq *rq, struct task_struct *p)
+static void yield_task_fair(struct rq *rq)
 {
-        struct cfs_rq *cfs_rq = task_cfs_rq(p);
+        struct cfs_rq *cfs_rq = &rq->cfs;
         struct rb_node **link = &cfs_rq->tasks_timeline.rb_node;
-        struct sched_entity *rightmost, *se = &p->se;
+        struct sched_entity *rightmost, *se = &rq->curr->se;
         struct rb_node *parent;
 
         /*
@@ -741,8 +741,8 @@ static void yield_task_fair(struct rq *rq, struct task_struct *p)
                  * Dequeue and enqueue the task to update its
                  * position within the tree:
                  */
-                dequeue_entity(cfs_rq, &p->se, 0);
-                enqueue_entity(cfs_rq, &p->se, 0);
+                dequeue_entity(cfs_rq, se, 0);
+                enqueue_entity(cfs_rq, se, 0);
 
                 return;
         }