Loading include/linux/sched.h +1 −2 Original line number Diff line number Diff line Loading @@ -855,8 +855,7 @@ struct sched_domain; struct sched_class { struct sched_class *next; void (*enqueue_task) (struct rq *rq, struct task_struct *p, int wakeup, u64 now); 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 (*yield_task) (struct rq *rq, struct task_struct *p); Loading kernel/sched.c +1 −1 Original line number Diff line number Diff line Loading @@ -852,7 +852,7 @@ static void enqueue_task(struct rq *rq, struct task_struct *p, int wakeup, u64 now) { sched_info_queued(p); p->sched_class->enqueue_task(rq, p, wakeup, now); p->sched_class->enqueue_task(rq, p, wakeup); p->se.on_rq = 1; } Loading kernel/sched_fair.c +1 −2 Original line number Diff line number Diff line Loading @@ -782,8 +782,7 @@ static inline int is_same_group(struct task_struct *curr, struct task_struct *p) * increased. Here we update the fair scheduling stats and * then put the task into the rbtree: */ static void enqueue_task_fair(struct rq *rq, struct task_struct *p, int wakeup, u64 now) static void enqueue_task_fair(struct rq *rq, struct task_struct *p, int wakeup) { struct cfs_rq *cfs_rq; struct sched_entity *se = &p->se; Loading kernel/sched_rt.c +1 −2 Original line number Diff line number Diff line Loading @@ -25,8 +25,7 @@ static inline void update_curr_rt(struct rq *rq) curr->se.exec_start = rq->clock; } static void enqueue_task_rt(struct rq *rq, struct task_struct *p, int wakeup, u64 now) static void enqueue_task_rt(struct rq *rq, struct task_struct *p, int wakeup) { 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 @@ -855,8 +855,7 @@ struct sched_domain; struct sched_class { struct sched_class *next; void (*enqueue_task) (struct rq *rq, struct task_struct *p, int wakeup, u64 now); 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 (*yield_task) (struct rq *rq, struct task_struct *p); Loading
kernel/sched.c +1 −1 Original line number Diff line number Diff line Loading @@ -852,7 +852,7 @@ static void enqueue_task(struct rq *rq, struct task_struct *p, int wakeup, u64 now) { sched_info_queued(p); p->sched_class->enqueue_task(rq, p, wakeup, now); p->sched_class->enqueue_task(rq, p, wakeup); p->se.on_rq = 1; } Loading
kernel/sched_fair.c +1 −2 Original line number Diff line number Diff line Loading @@ -782,8 +782,7 @@ static inline int is_same_group(struct task_struct *curr, struct task_struct *p) * increased. Here we update the fair scheduling stats and * then put the task into the rbtree: */ static void enqueue_task_fair(struct rq *rq, struct task_struct *p, int wakeup, u64 now) static void enqueue_task_fair(struct rq *rq, struct task_struct *p, int wakeup) { struct cfs_rq *cfs_rq; struct sched_entity *se = &p->se; Loading
kernel/sched_rt.c +1 −2 Original line number Diff line number Diff line Loading @@ -25,8 +25,7 @@ static inline void update_curr_rt(struct rq *rq) curr->se.exec_start = rq->clock; } static void enqueue_task_rt(struct rq *rq, struct task_struct *p, int wakeup, u64 now) static void enqueue_task_rt(struct rq *rq, struct task_struct *p, int wakeup) { struct rt_prio_array *array = &rq->rt.active; Loading