In deadline class we do not have group scheduling. So, let's remove unnecessary X = X; equations.
Showing the changes to kernel (1 of 1 file). Show all
Unified · Split
| @@ -135,7 +135,6 @@ static void update_dl_migration(struct dl_rq *dl_rq) · 134 unmodified lines | ||
| 135 | 135 | static void inc_dl_migration(struct sched_dl_entity *dl_se, struct dl_rq *dl_rq) |
| 136 | 136 | { |
| 137 | 137 | struct task_struct *p = dl_task_of(dl_se); |
| 138 | − dl_rq = &rq_of_dl_rq(dl_rq)->dl; | |
| 139 | 138 | |
| 140 | 139 | if (p->nr_cpus_allowed > 1) |
| 141 | 140 | dl_rq->dl_nr_migratory++; |
| @@ -146,7 +145,6 @@ static void inc_dl_migration(struct sched_dl_entity *dl_se, struct dl_rq *dl_rq) · 4 unmodified lines | ||
| 146 | 145 | static void dec_dl_migration(struct sched_dl_entity *dl_se, struct dl_rq *dl_rq) |
| 147 | 146 | { |
| 148 | 147 | struct task_struct *p = dl_task_of(dl_se); |
| 149 | − dl_rq = &rq_of_dl_rq(dl_rq)->dl; | |
| 150 | 148 | |
| 151 | 149 | if (p->nr_cpus_allowed > 1) |
| 152 | 150 | dl_rq->dl_nr_migratory--; |