[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <20140130163501.GG5002@laptop.programming.kicks-ass.net>
Date: Thu, 30 Jan 2014 17:35:01 +0100
From: Peter Zijlstra <peterz@...radead.org>
To: Daniel Lezcano <daniel.lezcano@...aro.org>
Cc: nicolas.pitre@...aro.org, mingo@...hat.com, tglx@...utronix.de,
rjw@...ysocki.net, linux-kernel@...r.kernel.org,
linux-pm@...r.kernel.org, linaro-kernel@...ts.linaro.org
Subject: Re: [RFC PATCH 3/3] idle: store the idle state index in the struct rq
On Thu, Jan 30, 2014 at 05:27:54PM +0100, Daniel Lezcano wrote:
> struct cpuidle_state *state = &drv->states[rq->index];
>
> And from the state, we have the following informations:
>
> struct cpuidle_state {
>
> [ ... ]
>
> unsigned int exit_latency; /* in US */
> int power_usage; /* in mW */
> unsigned int target_residency; /* in US */
> bool disabled; /* disabled on all CPUs */
>
> [ ... ]
> };
Right, but can we say that a higher index will save more power and have
a higher exit latency? Or is a driver free to have a random mapping from
idle_index to state?
Also, we should probably create a pretty function to get that state,
just like you did in patch 1.
> IIRC, Alex Shi sent a patchset to improve the choosing of the idlest cpu and
> the exit_latency was needed.
Right. However if we have a 'natural' order in the state array the index
itself might often be sufficient to find the least idle state, in this
specific case the absolute exit latency doesn't matter, all we want is
the lowest one.
Not dereferencing the state array saves hitting cold cachelines.
--
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