sched: remove the 'u64 now' parameter from ->pick_next_task()
authorIngo Molnar <mingo@elte.hu>
Thu, 9 Aug 2007 09:16:48 +0000 (11:16 +0200)
committerIngo Molnar <mingo@elte.hu>
Thu, 9 Aug 2007 09:16:48 +0000 (11:16 +0200)
remove the 'u64 now' parameter from ->pick_next_task().

( identity transformation that causes no change in functionality. )

Signed-off-by: Ingo Molnar <mingo@elte.hu>
include/linux/sched.h
kernel/sched.c
kernel/sched_fair.c
kernel/sched_idletask.c
kernel/sched_rt.c

index c7815a6b70e01b289fec06602eecc8f96c374b74..c6ad4071c79122ff1b1f4a74deb765e02c25db5f 100644 (file)
@@ -861,7 +861,7 @@ struct sched_class {
 
        void (*check_preempt_curr) (struct rq *rq, struct task_struct *p);
 
-       struct task_struct * (*pick_next_task) (struct rq *rq, u64 now);
+       struct task_struct * (*pick_next_task) (struct rq *rq);
        void (*put_prev_task) (struct rq *rq, struct task_struct *p, u64 now);
 
        unsigned long (*load_balance) (struct rq *this_rq, int this_cpu,
index e51d75f4b4d780bf775d1e28ffad62ce3d5c6a48..b67a288a0f1f75bd527847f11a1edc95171e3b6f 100644 (file)
@@ -3410,14 +3410,14 @@ pick_next_task(struct rq *rq, struct task_struct *prev, u64 now)
         * the fair class we can call that function directly:
         */
        if (likely(rq->nr_running == rq->cfs.nr_running)) {
-               p = fair_sched_class.pick_next_task(rq, now);
+               p = fair_sched_class.pick_next_task(rq);
                if (likely(p))
                        return p;
        }
 
        class = sched_class_highest;
        for ( ; ; ) {
-               p = class->pick_next_task(rq, now);
+               p = class->pick_next_task(rq);
                if (p)
                        return p;
                /*
index fb4d614af2c388763c191f43b845d30603b2e673..0b23aaf074fa8c357d1056012b8854e5f6275cb6 100644 (file)
@@ -859,7 +859,7 @@ static void check_preempt_curr_fair(struct rq *rq, struct task_struct *p)
                __check_preempt_curr_fair(cfs_rq, &p->se, &curr->se, gran);
 }
 
-static struct task_struct *pick_next_task_fair(struct rq *rq, u64 now)
+static struct task_struct *pick_next_task_fair(struct rq *rq)
 {
        struct cfs_rq *cfs_rq = &rq->cfs;
        struct sched_entity *se;
index f69e083e0d96e81f55d5b68b7b6d9cf348f807a2..9f4c28f858fed22ea3ab5da57cd09df7696b79fa 100644 (file)
@@ -13,7 +13,7 @@ static void check_preempt_curr_idle(struct rq *rq, struct task_struct *p)
        resched_task(rq->idle);
 }
 
-static struct task_struct *pick_next_task_idle(struct rq *rq, u64 now)
+static struct task_struct *pick_next_task_idle(struct rq *rq)
 {
        schedstat_inc(rq, sched_goidle);
 
index 60591e2512b1434b9e5f873df5b1fef2313405e6..c0b0d6237bb6faa45ee45479ae921ae5105c892d 100644 (file)
@@ -73,7 +73,7 @@ static void check_preempt_curr_rt(struct rq *rq, struct task_struct *p)
                resched_task(rq->curr);
 }
 
-static struct task_struct *pick_next_task_rt(struct rq *rq, u64 now)
+static struct task_struct *pick_next_task_rt(struct rq *rq)
 {
        struct rt_prio_array *array = &rq->rt.active;
        struct task_struct *next;