mirror of
https://github.com/torvalds/linux.git
synced 2026-06-06 21:45:45 +02:00
sched/fair: Fix util_est UTIL_AVG_UNCHANGED handling
commit68d7a19068upstream. The util_est internal UTIL_AVG_UNCHANGED flag which is used to prevent unnecessary util_est updates uses the LSB of util_est.enqueued. It is exposed via _task_util_est() (and task_util_est()). Commit92a801e5d5("sched/fair: Mask UTIL_AVG_UNCHANGED usages") mentions that the LSB is lost for util_est resolution but find_energy_efficient_cpu() checks if task_util_est() returns 0 to return prev_cpu early. _task_util_est() returns the max value of util_est.ewma and util_est.enqueued or'ed w/ UTIL_AVG_UNCHANGED. So task_util_est() returning the max of task_util() and _task_util_est() will never return 0 under the default SCHED_FEAT(UTIL_EST, true). To fix this use the MSB of util_est.enqueued instead and keep the flag util_est internal, i.e. don't export it via _task_util_est(). The maximal possible util_avg value for a task is 1024 so the MSB of 'unsigned int util_est.enqueued' isn't used to store a util value. As a caveat the code behind the util_est_se trace point has to filter UTIL_AVG_UNCHANGED to see the real util_est.enqueued value which should be easy to do. This also fixes an issue report by Xuewen Yan that util_est_update() only used UTIL_AVG_UNCHANGED for the subtrahend of the equation: last_enqueued_diff = ue.enqueued - (task_util() | UTIL_AVG_UNCHANGED) Fixes:b89997aa88sched/pelt: Fix task util_est update filtering Signed-off-by: Dietmar Eggemann <dietmar.eggemann@arm.com> Signed-off-by: Peter Zijlstra (Intel) <peterz@infradead.org> Reviewed-by: Xuewen Yan <xuewen.yan@unisoc.com> Reviewed-by: Vincent Donnefort <vincent.donnefort@arm.com> Reviewed-by: Vincent Guittot <vincent.guittot@linaro.org> Link: https://lore.kernel.org/r/20210602145808.1562603-1-dietmar.eggemann@arm.com Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
This commit is contained in:
parent
32e22db8b2
commit
190a7f9089
|
|
@ -348,11 +348,19 @@ struct load_weight {
|
||||||
* Only for tasks we track a moving average of the past instantaneous
|
* Only for tasks we track a moving average of the past instantaneous
|
||||||
* estimated utilization. This allows to absorb sporadic drops in utilization
|
* estimated utilization. This allows to absorb sporadic drops in utilization
|
||||||
* of an otherwise almost periodic task.
|
* of an otherwise almost periodic task.
|
||||||
|
*
|
||||||
|
* The UTIL_AVG_UNCHANGED flag is used to synchronize util_est with util_avg
|
||||||
|
* updates. When a task is dequeued, its util_est should not be updated if its
|
||||||
|
* util_avg has not been updated in the meantime.
|
||||||
|
* This information is mapped into the MSB bit of util_est.enqueued at dequeue
|
||||||
|
* time. Since max value of util_est.enqueued for a task is 1024 (PELT util_avg
|
||||||
|
* for a task) it is safe to use MSB.
|
||||||
*/
|
*/
|
||||||
struct util_est {
|
struct util_est {
|
||||||
unsigned int enqueued;
|
unsigned int enqueued;
|
||||||
unsigned int ewma;
|
unsigned int ewma;
|
||||||
#define UTIL_EST_WEIGHT_SHIFT 2
|
#define UTIL_EST_WEIGHT_SHIFT 2
|
||||||
|
#define UTIL_AVG_UNCHANGED 0x80000000
|
||||||
} __attribute__((__aligned__(sizeof(u64))));
|
} __attribute__((__aligned__(sizeof(u64))));
|
||||||
|
|
||||||
/*
|
/*
|
||||||
|
|
|
||||||
|
|
@ -888,6 +888,7 @@ __initcall(init_sched_debug_procfs);
|
||||||
#define __PS(S, F) SEQ_printf(m, "%-45s:%21Ld\n", S, (long long)(F))
|
#define __PS(S, F) SEQ_printf(m, "%-45s:%21Ld\n", S, (long long)(F))
|
||||||
#define __P(F) __PS(#F, F)
|
#define __P(F) __PS(#F, F)
|
||||||
#define P(F) __PS(#F, p->F)
|
#define P(F) __PS(#F, p->F)
|
||||||
|
#define PM(F, M) __PS(#F, p->F & (M))
|
||||||
#define __PSN(S, F) SEQ_printf(m, "%-45s:%14Ld.%06ld\n", S, SPLIT_NS((long long)(F)))
|
#define __PSN(S, F) SEQ_printf(m, "%-45s:%14Ld.%06ld\n", S, SPLIT_NS((long long)(F)))
|
||||||
#define __PN(F) __PSN(#F, F)
|
#define __PN(F) __PSN(#F, F)
|
||||||
#define PN(F) __PSN(#F, p->F)
|
#define PN(F) __PSN(#F, p->F)
|
||||||
|
|
@ -1014,7 +1015,7 @@ void proc_sched_show_task(struct task_struct *p, struct pid_namespace *ns,
|
||||||
P(se.avg.util_avg);
|
P(se.avg.util_avg);
|
||||||
P(se.avg.last_update_time);
|
P(se.avg.last_update_time);
|
||||||
P(se.avg.util_est.ewma);
|
P(se.avg.util_est.ewma);
|
||||||
P(se.avg.util_est.enqueued);
|
PM(se.avg.util_est.enqueued, ~UTIL_AVG_UNCHANGED);
|
||||||
#endif
|
#endif
|
||||||
#ifdef CONFIG_UCLAMP_TASK
|
#ifdef CONFIG_UCLAMP_TASK
|
||||||
__PS("uclamp.min", p->uclamp_req[UCLAMP_MIN].value);
|
__PS("uclamp.min", p->uclamp_req[UCLAMP_MIN].value);
|
||||||
|
|
|
||||||
|
|
@ -3903,7 +3903,7 @@ static inline unsigned long _task_util_est(struct task_struct *p)
|
||||||
{
|
{
|
||||||
struct util_est ue = READ_ONCE(p->se.avg.util_est);
|
struct util_est ue = READ_ONCE(p->se.avg.util_est);
|
||||||
|
|
||||||
return (max(ue.ewma, ue.enqueued) | UTIL_AVG_UNCHANGED);
|
return max(ue.ewma, (ue.enqueued & ~UTIL_AVG_UNCHANGED));
|
||||||
}
|
}
|
||||||
|
|
||||||
static inline unsigned long task_util_est(struct task_struct *p)
|
static inline unsigned long task_util_est(struct task_struct *p)
|
||||||
|
|
@ -4003,7 +4003,7 @@ static inline void util_est_update(struct cfs_rq *cfs_rq,
|
||||||
* Reset EWMA on utilization increases, the moving average is used only
|
* Reset EWMA on utilization increases, the moving average is used only
|
||||||
* to smooth utilization decreases.
|
* to smooth utilization decreases.
|
||||||
*/
|
*/
|
||||||
ue.enqueued = (task_util(p) | UTIL_AVG_UNCHANGED);
|
ue.enqueued = task_util(p);
|
||||||
if (sched_feat(UTIL_EST_FASTUP)) {
|
if (sched_feat(UTIL_EST_FASTUP)) {
|
||||||
if (ue.ewma < ue.enqueued) {
|
if (ue.ewma < ue.enqueued) {
|
||||||
ue.ewma = ue.enqueued;
|
ue.ewma = ue.enqueued;
|
||||||
|
|
@ -4052,6 +4052,7 @@ static inline void util_est_update(struct cfs_rq *cfs_rq,
|
||||||
ue.ewma += last_ewma_diff;
|
ue.ewma += last_ewma_diff;
|
||||||
ue.ewma >>= UTIL_EST_WEIGHT_SHIFT;
|
ue.ewma >>= UTIL_EST_WEIGHT_SHIFT;
|
||||||
done:
|
done:
|
||||||
|
ue.enqueued |= UTIL_AVG_UNCHANGED;
|
||||||
WRITE_ONCE(p->se.avg.util_est, ue);
|
WRITE_ONCE(p->se.avg.util_est, ue);
|
||||||
|
|
||||||
trace_sched_util_est_se_tp(&p->se);
|
trace_sched_util_est_se_tp(&p->se);
|
||||||
|
|
|
||||||
|
|
@ -42,15 +42,6 @@ static inline u32 get_pelt_divider(struct sched_avg *avg)
|
||||||
return LOAD_AVG_MAX - 1024 + avg->period_contrib;
|
return LOAD_AVG_MAX - 1024 + avg->period_contrib;
|
||||||
}
|
}
|
||||||
|
|
||||||
/*
|
|
||||||
* When a task is dequeued, its estimated utilization should not be update if
|
|
||||||
* its util_avg has not been updated at least once.
|
|
||||||
* This flag is used to synchronize util_avg updates with util_est updates.
|
|
||||||
* We map this information into the LSB bit of the utilization saved at
|
|
||||||
* dequeue time (i.e. util_est.dequeued).
|
|
||||||
*/
|
|
||||||
#define UTIL_AVG_UNCHANGED 0x1
|
|
||||||
|
|
||||||
static inline void cfs_se_util_change(struct sched_avg *avg)
|
static inline void cfs_se_util_change(struct sched_avg *avg)
|
||||||
{
|
{
|
||||||
unsigned int enqueued;
|
unsigned int enqueued;
|
||||||
|
|
@ -58,7 +49,7 @@ static inline void cfs_se_util_change(struct sched_avg *avg)
|
||||||
if (!sched_feat(UTIL_EST))
|
if (!sched_feat(UTIL_EST))
|
||||||
return;
|
return;
|
||||||
|
|
||||||
/* Avoid store if the flag has been already set */
|
/* Avoid store if the flag has been already reset */
|
||||||
enqueued = avg->util_est.enqueued;
|
enqueued = avg->util_est.enqueued;
|
||||||
if (!(enqueued & UTIL_AVG_UNCHANGED))
|
if (!(enqueued & UTIL_AVG_UNCHANGED))
|
||||||
return;
|
return;
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue
Block a user