Loading include/linux/sched.h +1 −2 Original line number Diff line number Diff line Loading @@ -856,8 +856,7 @@ struct sched_class { struct sched_class *next; void (*enqueue_task) (struct rq *rq, struct task_struct *p, int wakeup); void (*dequeue_task) (struct rq *rq, struct task_struct *p, int sleep, u64 now); void (*dequeue_task) (struct rq *rq, struct task_struct *p, int sleep); void (*yield_task) (struct rq *rq, struct task_struct *p); void (*check_preempt_curr) (struct rq *rq, struct task_struct *p); Loading kernel/sched.c +1 −1 Original line number Diff line number Diff line Loading @@ -859,7 +859,7 @@ enqueue_task(struct rq *rq, struct task_struct *p, int wakeup, u64 now) static void dequeue_task(struct rq *rq, struct task_struct *p, int sleep, u64 now) { p->sched_class->dequeue_task(rq, p, sleep, now); p->sched_class->dequeue_task(rq, p, sleep); p->se.on_rq = 0; } Loading kernel/sched_fair.c +1 −2 Original line number Diff line number Diff line Loading @@ -800,8 +800,7 @@ static void enqueue_task_fair(struct rq *rq, struct task_struct *p, int wakeup) * decreased. We remove the task from the rbtree and * update the fair scheduling stats: */ static void dequeue_task_fair(struct rq *rq, struct task_struct *p, int sleep, u64 now) static void dequeue_task_fair(struct rq *rq, struct task_struct *p, int sleep) { struct cfs_rq *cfs_rq; struct sched_entity *se = &p->se; Loading kernel/sched_idletask.c +1 −1 Original line number Diff line number Diff line Loading @@ -25,7 +25,7 @@ static struct task_struct *pick_next_task_idle(struct rq *rq, u64 now) * message if some code attempts to do it: */ static void dequeue_task_idle(struct rq *rq, struct task_struct *p, int sleep, u64 now) dequeue_task_idle(struct rq *rq, struct task_struct *p, int sleep) { spin_unlock_irq(&rq->lock); printk(KERN_ERR "bad: scheduling from the idle thread!\n"); Loading kernel/sched_rt.c +1 −2 Original line number Diff line number Diff line Loading @@ -36,8 +36,7 @@ static void enqueue_task_rt(struct rq *rq, struct task_struct *p, int wakeup) /* * Adding/removing a task to/from a priority array: */ static void dequeue_task_rt(struct rq *rq, struct task_struct *p, int sleep, u64 now) static void dequeue_task_rt(struct rq *rq, struct task_struct *p, int sleep) { struct rt_prio_array *array = &rq->rt.active; Loading Loading
include/linux/sched.h +1 −2 Original line number Diff line number Diff line Loading @@ -856,8 +856,7 @@ struct sched_class { struct sched_class *next; void (*enqueue_task) (struct rq *rq, struct task_struct *p, int wakeup); void (*dequeue_task) (struct rq *rq, struct task_struct *p, int sleep, u64 now); void (*dequeue_task) (struct rq *rq, struct task_struct *p, int sleep); void (*yield_task) (struct rq *rq, struct task_struct *p); void (*check_preempt_curr) (struct rq *rq, struct task_struct *p); Loading
kernel/sched.c +1 −1 Original line number Diff line number Diff line Loading @@ -859,7 +859,7 @@ enqueue_task(struct rq *rq, struct task_struct *p, int wakeup, u64 now) static void dequeue_task(struct rq *rq, struct task_struct *p, int sleep, u64 now) { p->sched_class->dequeue_task(rq, p, sleep, now); p->sched_class->dequeue_task(rq, p, sleep); p->se.on_rq = 0; } Loading
kernel/sched_fair.c +1 −2 Original line number Diff line number Diff line Loading @@ -800,8 +800,7 @@ static void enqueue_task_fair(struct rq *rq, struct task_struct *p, int wakeup) * decreased. We remove the task from the rbtree and * update the fair scheduling stats: */ static void dequeue_task_fair(struct rq *rq, struct task_struct *p, int sleep, u64 now) static void dequeue_task_fair(struct rq *rq, struct task_struct *p, int sleep) { struct cfs_rq *cfs_rq; struct sched_entity *se = &p->se; Loading
kernel/sched_idletask.c +1 −1 Original line number Diff line number Diff line Loading @@ -25,7 +25,7 @@ static struct task_struct *pick_next_task_idle(struct rq *rq, u64 now) * message if some code attempts to do it: */ static void dequeue_task_idle(struct rq *rq, struct task_struct *p, int sleep, u64 now) dequeue_task_idle(struct rq *rq, struct task_struct *p, int sleep) { spin_unlock_irq(&rq->lock); printk(KERN_ERR "bad: scheduling from the idle thread!\n"); Loading
kernel/sched_rt.c +1 −2 Original line number Diff line number Diff line Loading @@ -36,8 +36,7 @@ static void enqueue_task_rt(struct rq *rq, struct task_struct *p, int wakeup) /* * Adding/removing a task to/from a priority array: */ static void dequeue_task_rt(struct rq *rq, struct task_struct *p, int sleep, u64 now) static void dequeue_task_rt(struct rq *rq, struct task_struct *p, int sleep) { struct rt_prio_array *array = &rq->rt.active; Loading