@@ -5256,7 +5256,7 @@ set_next_entity(struct cfs_rq *cfs_rq, struct sched_entity *se)
5256
5256
* 4) do not run the "skip" process, if something else is available
5257
5257
*/
5258
5258
static struct sched_entity *
5259
- pick_next_entity (struct cfs_rq * cfs_rq , struct sched_entity * curr )
5259
+ pick_next_entity (struct cfs_rq * cfs_rq )
5260
5260
{
5261
5261
/*
5262
5262
* Enabling NEXT_BUDDY will affect latency but not fairness.
@@ -8160,7 +8160,7 @@ static struct task_struct *pick_task_fair(struct rq *rq)
8160
8160
goto again ;
8161
8161
}
8162
8162
8163
- se = pick_next_entity (cfs_rq , curr );
8163
+ se = pick_next_entity (cfs_rq );
8164
8164
cfs_rq = group_cfs_rq (se );
8165
8165
} while (cfs_rq );
8166
8166
@@ -8223,7 +8223,7 @@ pick_next_task_fair(struct rq *rq, struct task_struct *prev, struct rq_flags *rf
8223
8223
}
8224
8224
}
8225
8225
8226
- se = pick_next_entity (cfs_rq , curr );
8226
+ se = pick_next_entity (cfs_rq );
8227
8227
cfs_rq = group_cfs_rq (se );
8228
8228
} while (cfs_rq );
8229
8229
@@ -8262,7 +8262,7 @@ pick_next_task_fair(struct rq *rq, struct task_struct *prev, struct rq_flags *rf
8262
8262
put_prev_task (rq , prev );
8263
8263
8264
8264
do {
8265
- se = pick_next_entity (cfs_rq , NULL );
8265
+ se = pick_next_entity (cfs_rq );
8266
8266
set_next_entity (cfs_rq , se );
8267
8267
cfs_rq = group_cfs_rq (se );
8268
8268
} while (cfs_rq );
0 commit comments