diff options
Diffstat (limited to 'drivers/cpuidle/governors/menu.c')
-rw-r--r-- | drivers/cpuidle/governors/menu.c | 23 |
1 files changed, 16 insertions, 7 deletions
diff --git a/drivers/cpuidle/governors/menu.c b/drivers/cpuidle/governors/menu.c index 1b128702d300..c2408bbe9c2e 100644 --- a/drivers/cpuidle/governors/menu.c +++ b/drivers/cpuidle/governors/menu.c | |||
@@ -234,6 +234,7 @@ static int menu_select(struct cpuidle_device *dev) | |||
234 | { | 234 | { |
235 | struct menu_device *data = &__get_cpu_var(menu_devices); | 235 | struct menu_device *data = &__get_cpu_var(menu_devices); |
236 | int latency_req = pm_qos_request(PM_QOS_CPU_DMA_LATENCY); | 236 | int latency_req = pm_qos_request(PM_QOS_CPU_DMA_LATENCY); |
237 | unsigned int power_usage = -1; | ||
237 | int i; | 238 | int i; |
238 | int multiplier; | 239 | int multiplier; |
239 | 240 | ||
@@ -278,19 +279,27 @@ static int menu_select(struct cpuidle_device *dev) | |||
278 | if (data->expected_us > 5) | 279 | if (data->expected_us > 5) |
279 | data->last_state_idx = CPUIDLE_DRIVER_STATE_START; | 280 | data->last_state_idx = CPUIDLE_DRIVER_STATE_START; |
280 | 281 | ||
281 | 282 | /* | |
282 | /* find the deepest idle state that satisfies our constraints */ | 283 | * Find the idle state with the lowest power while satisfying |
284 | * our constraints. | ||
285 | */ | ||
283 | for (i = CPUIDLE_DRIVER_STATE_START; i < dev->state_count; i++) { | 286 | for (i = CPUIDLE_DRIVER_STATE_START; i < dev->state_count; i++) { |
284 | struct cpuidle_state *s = &dev->states[i]; | 287 | struct cpuidle_state *s = &dev->states[i]; |
285 | 288 | ||
289 | if (s->flags & CPUIDLE_FLAG_IGNORE) | ||
290 | continue; | ||
286 | if (s->target_residency > data->predicted_us) | 291 | if (s->target_residency > data->predicted_us) |
287 | break; | 292 | continue; |
288 | if (s->exit_latency > latency_req) | 293 | if (s->exit_latency > latency_req) |
289 | break; | 294 | continue; |
290 | if (s->exit_latency * multiplier > data->predicted_us) | 295 | if (s->exit_latency * multiplier > data->predicted_us) |
291 | break; | 296 | continue; |
292 | data->exit_us = s->exit_latency; | 297 | |
293 | data->last_state_idx = i; | 298 | if (s->power_usage < power_usage) { |
299 | power_usage = s->power_usage; | ||
300 | data->last_state_idx = i; | ||
301 | data->exit_us = s->exit_latency; | ||
302 | } | ||
294 | } | 303 | } |
295 | 304 | ||
296 | return data->last_state_idx; | 305 | return data->last_state_idx; |