[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <20150415121831.GU5029@twins.programming.kicks-ass.net>
Date: Wed, 15 Apr 2015 14:18:31 +0200
From: Peter Zijlstra <peterz@...radead.org>
To: Daniel Lezcano <daniel.lezcano@...aro.org>
Cc: rjw@...ysocki.net, linux-kernel@...r.kernel.org,
linux-pm@...r.kernel.org, nicolas.pitre@...aro.org,
Ingo Molnar <mingo@...hat.com>
Subject: Re: [PATCH 3/3] sched: fair: Fix wrong idle timestamp usage
On Wed, Apr 15, 2015 at 12:00:24PM +0200, Daniel Lezcano wrote:
> The find_idlest_cpu is assuming the rq->idle_stamp information reflects when
> the cpu entered the idle state. This is wrong as the cpu may exit and enter
> the idle state several times without the rq->idle_stamp being updated.
Sure, but you forgot to tell us why it matters.
> We have two informations here:
>
> * rq->idle_stamp gives when the idle task has been scheduled
> * idle->idle_stamp gives when the cpu entered the idle state
I'm not a native speaker, but I'm pretty sure 'information' is a word
without a plural, a google search suggests it to be a non-countable
noun.
> The patch fixes that by using the latter information and fallbacks to
> the rq's timestamp when the idle state is not accessible
>
> Signed-off-by: Daniel Lezcano <daniel.lezcano@...aro.org>
> ---
> kernel/sched/fair.c | 42 ++++++++++++++++++++++++++++--------------
> 1 file changed, 28 insertions(+), 14 deletions(-)
>
> diff --git a/kernel/sched/fair.c b/kernel/sched/fair.c
> index 46855d0..b44f1ad 100644
> --- a/kernel/sched/fair.c
> +++ b/kernel/sched/fair.c
> @@ -4704,21 +4704,35 @@ find_idlest_cpu(struct sched_group *group, struct task_struct *p, int this_cpu)
> if (idle_cpu(i)) {
> struct rq *rq = cpu_rq(i);
> struct cpuidle_state *idle = idle_get_state(rq);
> +
> + if (idle) {
> + if (idle->exit_latency < min_exit_latency) {
> + /*
> + * We give priority to a CPU
> + * whose idle state has the
> + * smallest exit latency
> + * irrespective of any idle
> + * timestamp.
> + */
> + min_exit_latency = idle->exit_latency;
> + latest_idle_timestamp = idle->idle_stamp;
> + shallowest_idle_cpu = i;
> + } else if (idle->exit_latency == min_exit_latency &&
> + idle->idle_stamp > latest_idle_timestamp) {
> + /*
> + * If the CPU is in the same
> + * idle state, choose the more
> + * recent one as it might have
> + * a warmer cache
> + */
> + latest_idle_timestamp = idle->idle_stamp;
> + shallowest_idle_cpu = i;
> + }
> + } else if (rq->idle_stamp > latest_idle_timestamp) {
> /*
> + * If no active idle state, then the
> + * most recent idled CPU might have a
> + * warmer cache
> */
> latest_idle_timestamp = rq->idle_stamp;
> shallowest_idle_cpu = i;
Urgh, you made horrid code more horrible.
And all without reason.
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
Powered by blists - more mailing lists