提交 668031ca 编写于 作者: I Ingo Molnar

sched: remove the 'u64 now' parameter from enqueue_entity()

remove the 'u64 now' parameter from enqueue_entity().

( identity transformation that causes no change in functionality. )
Signed-off-by: NIngo Molnar <mingo@elte.hu>
上级 2396af69
...@@ -570,8 +570,7 @@ static void enqueue_sleeper(struct cfs_rq *cfs_rq, struct sched_entity *se) ...@@ -570,8 +570,7 @@ static void enqueue_sleeper(struct cfs_rq *cfs_rq, struct sched_entity *se)
} }
static void static void
enqueue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, enqueue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, int wakeup)
int wakeup, u64 now)
{ {
/* /*
* Update the fair clock. * Update the fair clock.
...@@ -680,7 +679,7 @@ static void entity_tick(struct cfs_rq *cfs_rq, struct sched_entity *curr) ...@@ -680,7 +679,7 @@ static void entity_tick(struct cfs_rq *cfs_rq, struct sched_entity *curr)
* position within the tree: * position within the tree:
*/ */
dequeue_entity(cfs_rq, curr, 0, now); dequeue_entity(cfs_rq, curr, 0, now);
enqueue_entity(cfs_rq, curr, 0, now); enqueue_entity(cfs_rq, curr, 0);
/* /*
* Reschedule if another task tops the current one. * Reschedule if another task tops the current one.
...@@ -795,7 +794,7 @@ enqueue_task_fair(struct rq *rq, struct task_struct *p, int wakeup, u64 now) ...@@ -795,7 +794,7 @@ enqueue_task_fair(struct rq *rq, struct task_struct *p, int wakeup, u64 now)
if (se->on_rq) if (se->on_rq)
break; break;
cfs_rq = cfs_rq_of(se); cfs_rq = cfs_rq_of(se);
enqueue_entity(cfs_rq, se, wakeup, now); enqueue_entity(cfs_rq, se, wakeup);
} }
} }
...@@ -834,7 +833,7 @@ static void yield_task_fair(struct rq *rq, struct task_struct *p) ...@@ -834,7 +833,7 @@ static void yield_task_fair(struct rq *rq, struct task_struct *p)
* position within the tree: * position within the tree:
*/ */
dequeue_entity(cfs_rq, &p->se, 0, now); dequeue_entity(cfs_rq, &p->se, 0, now);
enqueue_entity(cfs_rq, &p->se, 0, now); enqueue_entity(cfs_rq, &p->se, 0);
} }
/* /*
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册