|
@@ -1846,26 +1846,26 @@ wakeup_preempt_entity(struct sched_entity *curr, struct sched_entity *se)
|
|
|
|
|
|
static void set_last_buddy(struct sched_entity *se)
|
|
|
{
|
|
|
- if (likely(task_of(se)->policy != SCHED_IDLE)) {
|
|
|
- for_each_sched_entity(se)
|
|
|
- cfs_rq_of(se)->last = se;
|
|
|
- }
|
|
|
+ if (entity_is_task(se) && unlikely(task_of(se)->policy == SCHED_IDLE))
|
|
|
+ return;
|
|
|
+
|
|
|
+ for_each_sched_entity(se)
|
|
|
+ cfs_rq_of(se)->last = se;
|
|
|
}
|
|
|
|
|
|
static void set_next_buddy(struct sched_entity *se)
|
|
|
{
|
|
|
- if (likely(task_of(se)->policy != SCHED_IDLE)) {
|
|
|
- for_each_sched_entity(se)
|
|
|
- cfs_rq_of(se)->next = se;
|
|
|
- }
|
|
|
+ if (entity_is_task(se) && unlikely(task_of(se)->policy == SCHED_IDLE))
|
|
|
+ return;
|
|
|
+
|
|
|
+ for_each_sched_entity(se)
|
|
|
+ cfs_rq_of(se)->next = se;
|
|
|
}
|
|
|
|
|
|
static void set_skip_buddy(struct sched_entity *se)
|
|
|
{
|
|
|
- if (likely(task_of(se)->policy != SCHED_IDLE)) {
|
|
|
- for_each_sched_entity(se)
|
|
|
- cfs_rq_of(se)->skip = se;
|
|
|
- }
|
|
|
+ for_each_sched_entity(se)
|
|
|
+ cfs_rq_of(se)->skip = se;
|
|
|
}
|
|
|
|
|
|
/*
|