Update the reason for cpuidle state selection as scheduler bias in case bias timer is set. Make use of unused next_event_us parameter to replace with cpu bias status. Change-Id: I42950b3d9d85da0ec5245c9cdbc7bcc5d609be3d Signed-off-by: Maulik Shah <quic_mkshah@quicinc.com>
1890 lines
44 KiB
C
1890 lines
44 KiB
C
// SPDX-License-Identifier: GPL-2.0-only
|
|
|
|
/* Copyright (c) 2012-2021, The Linux Foundation. All rights reserved.
|
|
* Copyright (C) 2006-2007 Adam Belay <abelay@novell.com>
|
|
* Copyright (C) 2009 Intel Corporation
|
|
*/
|
|
|
|
#define pr_fmt(fmt) "%s: " fmt, KBUILD_MODNAME
|
|
|
|
#include <linux/module.h>
|
|
#include <linux/kernel.h>
|
|
#include <linux/init.h>
|
|
#include <linux/slab.h>
|
|
#include <linux/platform_device.h>
|
|
#include <linux/mutex.h>
|
|
#include <linux/cpu.h>
|
|
#include <linux/of.h>
|
|
#include <linux/hrtimer.h>
|
|
#include <linux/ktime.h>
|
|
#include <linux/tick.h>
|
|
#include <linux/suspend.h>
|
|
#include <linux/pm_qos.h>
|
|
#include <linux/of_platform.h>
|
|
#include <linux/smp.h>
|
|
#include <linux/dma-mapping.h>
|
|
#include <linux/moduleparam.h>
|
|
#include <linux/sched.h>
|
|
#include <linux/cpu_pm.h>
|
|
#include <linux/cpuhotplug.h>
|
|
#include <linux/regulator/machine.h>
|
|
#include <linux/sched/clock.h>
|
|
#include <linux/sched/idle.h>
|
|
#include <linux/sched/stat.h>
|
|
#include <linux/rcupdate.h>
|
|
#include <linux/psci.h>
|
|
#include <soc/qcom/pm.h>
|
|
#include <soc/qcom/lpm_levels.h>
|
|
#include <soc/qcom/lpm-stats.h>
|
|
#include <asm/arch_timer.h>
|
|
#include <asm/suspend.h>
|
|
#include <asm/cpuidle.h>
|
|
#include "lpm-levels.h"
|
|
#include <trace/events/power.h>
|
|
#include <linux/clk.h>
|
|
#define CREATE_TRACE_POINTS
|
|
#include <trace/events/trace_msm_low_power.h>
|
|
|
|
#define SCLK_HZ (32768)
|
|
#define PSCI_POWER_STATE(reset) (reset << 30)
|
|
#define PSCI_AFFINITY_LEVEL(lvl) ((lvl & 0x3) << 24)
|
|
#define MAX_LPM_CPUS (8)
|
|
|
|
enum {
|
|
MSM_LPM_LVL_DBG_SUSPEND_LIMITS = BIT(0),
|
|
MSM_LPM_LVL_DBG_IDLE_LIMITS = BIT(1),
|
|
};
|
|
|
|
enum debug_event {
|
|
CPU_ENTER,
|
|
CPU_EXIT,
|
|
CLUSTER_ENTER,
|
|
CLUSTER_EXIT,
|
|
CPU_HP_STARTING,
|
|
CPU_HP_DYING,
|
|
};
|
|
|
|
struct lpm_debug {
|
|
u64 time;
|
|
enum debug_event evt;
|
|
int cpu;
|
|
uint32_t arg1;
|
|
uint32_t arg2;
|
|
uint32_t arg3;
|
|
uint32_t arg4;
|
|
};
|
|
|
|
static struct system_pm_ops *sys_pm_ops;
|
|
|
|
struct lpm_cluster *lpm_root_node;
|
|
|
|
#define MAXSAMPLES 5
|
|
|
|
static bool lpm_prediction = true;
|
|
module_param_named(lpm_prediction, lpm_prediction, bool, 0664);
|
|
|
|
static bool lpm_ipi_prediction = true;
|
|
module_param_named(lpm_ipi_prediction, lpm_ipi_prediction, bool, 0664);
|
|
|
|
struct lpm_history {
|
|
uint32_t resi[MAXSAMPLES];
|
|
int mode[MAXSAMPLES];
|
|
int nsamp;
|
|
uint32_t hptr;
|
|
uint32_t hinvalid;
|
|
uint32_t htmr_wkup;
|
|
int64_t stime;
|
|
};
|
|
|
|
struct ipi_history {
|
|
uint32_t interval[MAXSAMPLES];
|
|
uint32_t current_ptr;
|
|
ktime_t cpu_idle_resched_ts;
|
|
};
|
|
|
|
static DEFINE_PER_CPU(ktime_t, next_hrtimer);
|
|
static DEFINE_PER_CPU(struct lpm_history, hist);
|
|
static DEFINE_PER_CPU(struct ipi_history, cpu_ipi_history);
|
|
static DEFINE_PER_CPU(struct lpm_cpu*, cpu_lpm);
|
|
static bool suspend_in_progress;
|
|
static DEFINE_PER_CPU(struct hrtimer, histtimer);
|
|
static DEFINE_PER_CPU(struct hrtimer, biastimer);
|
|
static struct lpm_debug *lpm_debug;
|
|
static phys_addr_t lpm_debug_phys;
|
|
static const int num_dbg_elements = 0x100;
|
|
|
|
static void cluster_unprepare(struct lpm_cluster *cluster,
|
|
const struct cpumask *cpu, int child_idx, bool from_idle,
|
|
int64_t time, bool success);
|
|
static void cluster_prepare(struct lpm_cluster *cluster,
|
|
const struct cpumask *cpu, int child_idx, bool from_idle,
|
|
int64_t time);
|
|
|
|
static bool sleep_disabled;
|
|
module_param_named(sleep_disabled, sleep_disabled, bool, 0664);
|
|
|
|
#ifdef CONFIG_SMP
|
|
static int lpm_cpu_qos_notify(struct notifier_block *nb,
|
|
unsigned long val, void *ptr);
|
|
|
|
static struct notifier_block dev_pm_qos_nb[MAX_LPM_CPUS] = {
|
|
[0 ... (MAX_LPM_CPUS - 1)] = { .notifier_call = lpm_cpu_qos_notify },
|
|
};
|
|
#endif
|
|
|
|
#ifdef CONFIG_SCHED_WALT
|
|
static bool check_cpu_isolated(int cpu)
|
|
{
|
|
return cpu_isolated(cpu);
|
|
}
|
|
#else
|
|
static bool check_cpu_isolated(int cpu)
|
|
{
|
|
return false;
|
|
}
|
|
#endif
|
|
|
|
#ifdef CONFIG_SMP
|
|
static int lpm_cpu_qos_notify(struct notifier_block *nb,
|
|
unsigned long val, void *ptr)
|
|
{
|
|
int cpu = nb - dev_pm_qos_nb;
|
|
|
|
preempt_disable();
|
|
if (cpu != smp_processor_id() && cpu_online(cpu) &&
|
|
!check_cpu_isolated(cpu))
|
|
wake_up_if_idle(cpu);
|
|
preempt_enable();
|
|
|
|
return NOTIFY_OK;
|
|
}
|
|
|
|
static int lpm_offline_cpu(unsigned int cpu)
|
|
{
|
|
struct device *dev = get_cpu_device(cpu);
|
|
|
|
if (!dev)
|
|
return 0;
|
|
|
|
dev_pm_qos_remove_notifier(dev, &dev_pm_qos_nb[cpu],
|
|
DEV_PM_QOS_RESUME_LATENCY);
|
|
return 0;
|
|
}
|
|
|
|
static int lpm_online_cpu(unsigned int cpu)
|
|
{
|
|
struct device *dev = get_cpu_device(cpu);
|
|
|
|
if (!dev)
|
|
return 0;
|
|
|
|
dev_pm_qos_add_notifier(dev, &dev_pm_qos_nb[cpu],
|
|
DEV_PM_QOS_RESUME_LATENCY);
|
|
return 0;
|
|
}
|
|
#endif
|
|
|
|
#ifdef CONFIG_MSM_PM
|
|
/**
|
|
* msm_cpuidle_get_deep_idle_latency - Get deep idle latency value
|
|
*
|
|
* Returns an s32 latency value
|
|
*/
|
|
s32 msm_cpuidle_get_deep_idle_latency(void)
|
|
{
|
|
return 10;
|
|
}
|
|
EXPORT_SYMBOL(msm_cpuidle_get_deep_idle_latency);
|
|
|
|
uint32_t register_system_pm_ops(struct system_pm_ops *pm_ops)
|
|
{
|
|
if (sys_pm_ops)
|
|
return -EUSERS;
|
|
|
|
sys_pm_ops = pm_ops;
|
|
|
|
return 0;
|
|
}
|
|
EXPORT_SYMBOL(register_system_pm_ops);
|
|
#endif
|
|
|
|
static void update_debug_pc_event(enum debug_event event, uint32_t arg1,
|
|
uint32_t arg2, uint32_t arg3, uint32_t arg4)
|
|
{
|
|
struct lpm_debug *dbg;
|
|
int idx;
|
|
static DEFINE_SPINLOCK(debug_lock);
|
|
static int pc_event_index;
|
|
|
|
if (!lpm_debug)
|
|
return;
|
|
|
|
spin_lock(&debug_lock);
|
|
idx = pc_event_index++;
|
|
dbg = &lpm_debug[idx & (num_dbg_elements - 1)];
|
|
|
|
dbg->evt = event;
|
|
dbg->time = __arch_counter_get_cntvct();
|
|
dbg->cpu = raw_smp_processor_id();
|
|
dbg->arg1 = arg1;
|
|
dbg->arg2 = arg2;
|
|
dbg->arg3 = arg3;
|
|
dbg->arg4 = arg4;
|
|
spin_unlock(&debug_lock);
|
|
}
|
|
|
|
uint32_t us_to_ticks(uint64_t sleep_val)
|
|
{
|
|
uint64_t sec, nsec;
|
|
|
|
sec = sleep_val;
|
|
do_div(sec, USEC_PER_SEC);
|
|
|
|
if (sec > 0) {
|
|
nsec = sleep_val - sec * USEC_PER_SEC;
|
|
sleep_val = sec * ARCH_TIMER_HZ;
|
|
if (nsec > 0) {
|
|
nsec = nsec * NSEC_PER_USEC;
|
|
do_div(nsec, NSEC_PER_SEC/ARCH_TIMER_HZ);
|
|
}
|
|
sleep_val = sleep_val + nsec;
|
|
} else {
|
|
sleep_val = sleep_val * ARCH_TIMER_HZ;
|
|
do_div(sleep_val, USEC_PER_SEC);
|
|
}
|
|
return sleep_val;
|
|
}
|
|
|
|
static uint32_t get_next_event(struct lpm_cpu *cpu)
|
|
{
|
|
ktime_t next_event = KTIME_MAX;
|
|
unsigned int next_cpu;
|
|
struct cpumask cpu_lpm_mask;
|
|
|
|
cpumask_and(&cpu_lpm_mask, &cpu->related_cpus, cpu_online_mask);
|
|
if (cpumask_empty(&cpu_lpm_mask))
|
|
return 0;
|
|
|
|
for_each_cpu(next_cpu, &cpu_lpm_mask) {
|
|
ktime_t next_event_c = per_cpu(next_hrtimer, next_cpu);
|
|
|
|
if (next_event > next_event_c)
|
|
next_event = next_event_c;
|
|
}
|
|
|
|
return ktime_to_us(ktime_sub(next_event, ktime_get()));
|
|
}
|
|
|
|
static void disable_rimps_timer(struct lpm_cpu *cpu)
|
|
{
|
|
uint32_t ctrl_val;
|
|
|
|
if (!cpu->rimps_tmr_base)
|
|
return;
|
|
|
|
spin_lock(&cpu->cpu_lock);
|
|
ctrl_val = readl_relaxed(cpu->rimps_tmr_base + TIMER_CTRL);
|
|
writel_relaxed(ctrl_val & ~(TIMER_CONTROL_EN),
|
|
cpu->rimps_tmr_base + TIMER_CTRL);
|
|
/* Ensure the write is complete before returning. */
|
|
wmb();
|
|
spin_unlock(&cpu->cpu_lock);
|
|
|
|
}
|
|
|
|
static void program_rimps_timer(struct lpm_cpu *cpu)
|
|
{
|
|
uint32_t ctrl_val, next_event;
|
|
struct cpumask cpu_lpm_mask;
|
|
struct lpm_cluster *cl = cpu->parent;
|
|
|
|
if (!cpu->rimps_tmr_base)
|
|
return;
|
|
|
|
cpumask_and(&cpu_lpm_mask, &cl->num_children_in_sync,
|
|
&cpu->related_cpus);
|
|
if (!cpumask_equal(&cpu_lpm_mask, &cpu->related_cpus))
|
|
return;
|
|
|
|
next_event = get_next_event(cpu);
|
|
if (!next_event)
|
|
return;
|
|
|
|
next_event = us_to_ticks(next_event);
|
|
spin_lock(&cpu->cpu_lock);
|
|
|
|
/* RIMPS timer pending should be read before programming timeout val */
|
|
readl_relaxed(cpu->rimps_tmr_base + TIMER_PENDING);
|
|
ctrl_val = readl_relaxed(cpu->rimps_tmr_base + TIMER_CTRL);
|
|
writel_relaxed(ctrl_val & ~(TIMER_CONTROL_EN),
|
|
cpu->rimps_tmr_base + TIMER_CTRL);
|
|
writel_relaxed(next_event, cpu->rimps_tmr_base + TIMER_VAL);
|
|
writel_relaxed(ctrl_val | (TIMER_CONTROL_EN),
|
|
cpu->rimps_tmr_base + TIMER_CTRL);
|
|
/* Ensure the write is complete before returning. */
|
|
wmb();
|
|
spin_unlock(&cpu->cpu_lock);
|
|
}
|
|
|
|
#ifdef CONFIG_SMP
|
|
static int lpm_dying_cpu(unsigned int cpu)
|
|
{
|
|
struct lpm_cluster *cluster = per_cpu(cpu_lpm, cpu)->parent;
|
|
struct lpm_cpu *lpm_cpu = per_cpu(cpu_lpm, cpu);
|
|
|
|
update_debug_pc_event(CPU_HP_DYING, cpu,
|
|
cluster->num_children_in_sync.bits[0],
|
|
cluster->child_cpus.bits[0], false);
|
|
cluster_prepare(cluster, get_cpu_mask(cpu), NR_LPM_LEVELS, false, 0);
|
|
program_rimps_timer(lpm_cpu);
|
|
return 0;
|
|
}
|
|
|
|
static int lpm_starting_cpu(unsigned int cpu)
|
|
{
|
|
struct lpm_cluster *cluster = per_cpu(cpu_lpm, cpu)->parent;
|
|
|
|
update_debug_pc_event(CPU_HP_STARTING, cpu,
|
|
cluster->num_children_in_sync.bits[0],
|
|
cluster->child_cpus.bits[0], false);
|
|
cluster_unprepare(cluster, get_cpu_mask(cpu), NR_LPM_LEVELS, false,
|
|
0, true);
|
|
return 0;
|
|
}
|
|
#endif
|
|
static void histtimer_cancel(void)
|
|
{
|
|
unsigned int cpu = raw_smp_processor_id();
|
|
struct hrtimer *cpu_histtimer = &per_cpu(histtimer, cpu);
|
|
ktime_t time_rem;
|
|
|
|
time_rem = hrtimer_get_remaining(cpu_histtimer);
|
|
if (ktime_to_us(time_rem) <= 0)
|
|
return;
|
|
|
|
hrtimer_try_to_cancel(cpu_histtimer);
|
|
}
|
|
|
|
static enum hrtimer_restart histtimer_fn(struct hrtimer *h)
|
|
{
|
|
int cpu = raw_smp_processor_id();
|
|
struct lpm_history *history = &per_cpu(hist, cpu);
|
|
|
|
history->hinvalid = 1;
|
|
return HRTIMER_NORESTART;
|
|
}
|
|
|
|
static void histtimer_start(uint32_t time_us)
|
|
{
|
|
uint64_t time_ns = time_us * NSEC_PER_USEC;
|
|
ktime_t hist_ktime = ns_to_ktime(time_ns);
|
|
unsigned int cpu = raw_smp_processor_id();
|
|
struct hrtimer *cpu_histtimer = &per_cpu(histtimer, cpu);
|
|
|
|
cpu_histtimer->function = histtimer_fn;
|
|
hrtimer_start(cpu_histtimer, hist_ktime, HRTIMER_MODE_REL_PINNED);
|
|
}
|
|
|
|
static void cluster_timer_init(struct lpm_cluster *cluster)
|
|
{
|
|
struct list_head *list;
|
|
|
|
if (!cluster)
|
|
return;
|
|
|
|
hrtimer_init(&cluster->histtimer, CLOCK_MONOTONIC, HRTIMER_MODE_REL);
|
|
|
|
list_for_each(list, &cluster->child) {
|
|
struct lpm_cluster *n;
|
|
|
|
n = list_entry(list, typeof(*n), list);
|
|
cluster_timer_init(n);
|
|
}
|
|
}
|
|
|
|
static void clusttimer_cancel(void)
|
|
{
|
|
int cpu = raw_smp_processor_id();
|
|
struct lpm_cluster *cluster = per_cpu(cpu_lpm, cpu)->parent;
|
|
ktime_t time_rem;
|
|
|
|
time_rem = hrtimer_get_remaining(&cluster->histtimer);
|
|
if (ktime_to_us(time_rem) > 0)
|
|
hrtimer_try_to_cancel(&cluster->histtimer);
|
|
|
|
if (cluster->parent) {
|
|
time_rem = hrtimer_get_remaining(
|
|
&cluster->parent->histtimer);
|
|
|
|
if (ktime_to_us(time_rem) <= 0)
|
|
return;
|
|
|
|
hrtimer_try_to_cancel(&cluster->parent->histtimer);
|
|
}
|
|
}
|
|
|
|
static enum hrtimer_restart clusttimer_fn(struct hrtimer *h)
|
|
{
|
|
struct lpm_cluster *cluster = container_of(h,
|
|
struct lpm_cluster, histtimer);
|
|
|
|
cluster->history.hinvalid = 1;
|
|
return HRTIMER_NORESTART;
|
|
}
|
|
|
|
static void clusttimer_start(struct lpm_cluster *cluster, uint32_t time_us)
|
|
{
|
|
uint64_t time_ns = time_us * NSEC_PER_USEC;
|
|
ktime_t clust_ktime = ns_to_ktime(time_ns);
|
|
|
|
cluster->histtimer.function = clusttimer_fn;
|
|
hrtimer_start(&cluster->histtimer, clust_ktime,
|
|
HRTIMER_MODE_REL_PINNED);
|
|
}
|
|
|
|
static void biastimer_cancel(void)
|
|
{
|
|
unsigned int cpu = raw_smp_processor_id();
|
|
struct hrtimer *cpu_biastimer = &per_cpu(biastimer, cpu);
|
|
ktime_t time_rem;
|
|
|
|
time_rem = hrtimer_get_remaining(cpu_biastimer);
|
|
if (ktime_to_us(time_rem) <= 0)
|
|
return;
|
|
|
|
hrtimer_try_to_cancel(cpu_biastimer);
|
|
}
|
|
|
|
static enum hrtimer_restart biastimer_fn(struct hrtimer *h)
|
|
{
|
|
return HRTIMER_NORESTART;
|
|
}
|
|
|
|
static void biastimer_start(uint32_t time_ns)
|
|
{
|
|
ktime_t bias_ktime = ns_to_ktime(time_ns);
|
|
unsigned int cpu = raw_smp_processor_id();
|
|
struct hrtimer *cpu_biastimer = &per_cpu(biastimer, cpu);
|
|
|
|
cpu_biastimer->function = biastimer_fn;
|
|
hrtimer_start(cpu_biastimer, bias_ktime, HRTIMER_MODE_REL_PINNED);
|
|
}
|
|
|
|
static uint64_t find_deviation(int *interval, uint32_t ref_stddev,
|
|
int64_t *stime)
|
|
{
|
|
int divisor, i;
|
|
uint64_t max, avg, stddev;
|
|
int64_t thresh = LLONG_MAX;
|
|
|
|
do {
|
|
max = avg = divisor = stddev = 0;
|
|
for (i = 0; i < MAXSAMPLES; i++) {
|
|
int64_t value = interval[i];
|
|
|
|
if (value <= thresh) {
|
|
avg += value;
|
|
divisor++;
|
|
if (value > max)
|
|
max = value;
|
|
}
|
|
}
|
|
do_div(avg, divisor);
|
|
|
|
for (i = 0; i < MAXSAMPLES; i++) {
|
|
int64_t value = interval[i];
|
|
|
|
if (value <= thresh) {
|
|
int64_t diff = value - avg;
|
|
|
|
stddev += diff * diff;
|
|
}
|
|
}
|
|
do_div(stddev, divisor);
|
|
stddev = int_sqrt(stddev);
|
|
|
|
/*
|
|
* If the deviation is less, return the average, else
|
|
* ignore one maximum sample and retry
|
|
*/
|
|
if (((avg > stddev * 6) && (divisor >= (MAXSAMPLES - 1)))
|
|
|| stddev <= ref_stddev) {
|
|
*stime = ktime_to_us(ktime_get()) + avg;
|
|
return avg;
|
|
}
|
|
thresh = max - 1;
|
|
|
|
} while (divisor > (MAXSAMPLES - 1));
|
|
|
|
return 0;
|
|
}
|
|
|
|
static uint64_t lpm_cpuidle_predict(struct cpuidle_device *dev,
|
|
struct lpm_cpu *cpu, int *idx_restrict,
|
|
uint32_t *idx_restrict_time, uint32_t *ipi_predicted)
|
|
{
|
|
int i, j;
|
|
uint64_t avg;
|
|
struct lpm_history *history = &per_cpu(hist, dev->cpu);
|
|
struct ipi_history *ipi_history = &per_cpu(cpu_ipi_history, dev->cpu);
|
|
|
|
if (!lpm_prediction || !cpu->lpm_prediction)
|
|
return 0;
|
|
|
|
/*
|
|
* Samples are marked invalid when woken-up due to timer,
|
|
* so donot predict.
|
|
*/
|
|
if (history->hinvalid) {
|
|
history->hinvalid = 0;
|
|
history->htmr_wkup = 1;
|
|
history->stime = 0;
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* Predict only when all the samples are collected.
|
|
*/
|
|
if (history->nsamp < MAXSAMPLES) {
|
|
history->stime = 0;
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* Check if the samples are not much deviated, if so use the
|
|
* average of those as predicted sleep time. Else if any
|
|
* specific mode has more premature exits return the index of
|
|
* that mode.
|
|
*/
|
|
|
|
avg = find_deviation(history->resi, cpu->ref_stddev, &(history->stime));
|
|
if (avg)
|
|
return avg;
|
|
|
|
/*
|
|
* Find the number of premature exits for each of the mode,
|
|
* excluding clockgating mode, and they are more than fifty
|
|
* percent restrict that and deeper modes.
|
|
*/
|
|
if (history->htmr_wkup != 1) {
|
|
for (j = 1; j < cpu->nlevels; j++) {
|
|
struct lpm_cpu_level *level = &cpu->levels[j];
|
|
uint32_t min_residency = level->pwr.min_residency;
|
|
uint32_t max_residency = 0;
|
|
struct lpm_cpu_level *lvl;
|
|
uint32_t failed = 0;
|
|
uint64_t total = 0;
|
|
|
|
for (i = 0; i < MAXSAMPLES; i++) {
|
|
if ((history->mode[i] == j) &&
|
|
(history->resi[i] < min_residency)) {
|
|
failed++;
|
|
total += history->resi[i];
|
|
}
|
|
}
|
|
if (failed >= cpu->ref_premature_cnt) {
|
|
*idx_restrict = j;
|
|
do_div(total, failed);
|
|
for (i = 0; i < j; i++) {
|
|
lvl = &cpu->levels[i];
|
|
max_residency = lvl->pwr.max_residency;
|
|
if (total < max_residency) {
|
|
*idx_restrict = i + 1;
|
|
total = max_residency;
|
|
break;
|
|
}
|
|
}
|
|
|
|
*idx_restrict_time = total;
|
|
history->stime = ktime_to_us(ktime_get())
|
|
+ *idx_restrict_time;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
if (*idx_restrict_time || !cpu->ipi_prediction || !lpm_ipi_prediction)
|
|
return 0;
|
|
|
|
avg = find_deviation(ipi_history->interval, cpu->ref_stddev
|
|
+ DEFAULT_IPI_STDDEV,
|
|
&(history->stime));
|
|
if (avg) {
|
|
*ipi_predicted = 1;
|
|
return avg;
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
static inline void invalidate_predict_history(struct cpuidle_device *dev)
|
|
{
|
|
struct lpm_history *history = &per_cpu(hist, dev->cpu);
|
|
struct lpm_cpu *lpm_cpu = per_cpu(cpu_lpm, dev->cpu);
|
|
|
|
if (!lpm_prediction || !lpm_cpu->lpm_prediction)
|
|
return;
|
|
|
|
if (history->hinvalid) {
|
|
history->hinvalid = 0;
|
|
history->htmr_wkup = 1;
|
|
history->stime = 0;
|
|
}
|
|
}
|
|
|
|
static void clear_predict_history(void)
|
|
{
|
|
struct lpm_history *history;
|
|
int i;
|
|
unsigned int cpu;
|
|
struct lpm_cpu *lpm_cpu = per_cpu(cpu_lpm, raw_smp_processor_id());
|
|
|
|
if (!lpm_prediction || !lpm_cpu->lpm_prediction)
|
|
return;
|
|
|
|
for_each_possible_cpu(cpu) {
|
|
history = &per_cpu(hist, cpu);
|
|
for (i = 0; i < MAXSAMPLES; i++) {
|
|
history->resi[i] = 0;
|
|
history->mode[i] = -1;
|
|
history->hptr = 0;
|
|
history->nsamp = 0;
|
|
history->stime = 0;
|
|
}
|
|
}
|
|
}
|
|
|
|
static void update_history(struct cpuidle_device *dev, int idx);
|
|
|
|
static inline bool lpm_disallowed(s64 sleep_us, int cpu, struct lpm_cpu *pm_cpu)
|
|
{
|
|
uint64_t bias_time = 0;
|
|
|
|
if (check_cpu_isolated(cpu))
|
|
goto out;
|
|
|
|
if (sleep_disabled || sleep_us < 0)
|
|
return true;
|
|
|
|
bias_time = sched_lpm_disallowed_time(cpu);
|
|
if (bias_time) {
|
|
pm_cpu->bias = bias_time;
|
|
return true;
|
|
}
|
|
|
|
out:
|
|
return false;
|
|
}
|
|
|
|
static inline uint32_t get_cpus_qos(const struct cpumask *mask)
|
|
{
|
|
int cpu;
|
|
uint32_t n;
|
|
uint32_t latency = PM_QOS_CPU_DMA_LAT_DEFAULT_VALUE;
|
|
|
|
for_each_cpu(cpu, mask) {
|
|
if (check_cpu_isolated(cpu))
|
|
continue;
|
|
n = cpuidle_governor_latency_req(cpu);
|
|
if (n < latency)
|
|
latency = n;
|
|
}
|
|
|
|
return latency;
|
|
}
|
|
|
|
static int cpu_power_select(struct cpuidle_device *dev,
|
|
struct lpm_cpu *cpu)
|
|
{
|
|
ktime_t delta_next;
|
|
int best_level = 0;
|
|
uint32_t latency_us = get_cpus_qos(cpumask_of(dev->cpu));
|
|
s64 sleep_us = ktime_to_us(tick_nohz_get_sleep_length(&delta_next));
|
|
int i, idx_restrict;
|
|
uint32_t lvl_latency_us = 0;
|
|
uint64_t predicted = 0;
|
|
uint32_t htime = 0, idx_restrict_time = 0, ipi_predicted = 0;
|
|
uint32_t next_wakeup_us = (uint32_t)sleep_us;
|
|
uint32_t min_residency, max_residency;
|
|
struct power_params *pwr_params;
|
|
|
|
if (lpm_disallowed(sleep_us, dev->cpu, cpu))
|
|
goto done_select;
|
|
|
|
idx_restrict = cpu->nlevels + 1;
|
|
|
|
for (i = 0; i < cpu->nlevels; i++) {
|
|
if (!lpm_cpu_mode_allow(dev->cpu, i, true))
|
|
continue;
|
|
|
|
pwr_params = &cpu->levels[i].pwr;
|
|
lvl_latency_us = pwr_params->exit_latency;
|
|
min_residency = pwr_params->min_residency;
|
|
max_residency = pwr_params->max_residency;
|
|
|
|
if (latency_us < lvl_latency_us)
|
|
break;
|
|
|
|
if (!i && !check_cpu_isolated(dev->cpu)) {
|
|
/*
|
|
* If the next_wake_us itself is not sufficient for
|
|
* deeper low power modes than clock gating do not
|
|
* call prediction.
|
|
*/
|
|
if (next_wakeup_us > max_residency) {
|
|
predicted = lpm_cpuidle_predict(dev, cpu,
|
|
&idx_restrict, &idx_restrict_time,
|
|
&ipi_predicted);
|
|
if (predicted && (predicted < min_residency))
|
|
predicted = min_residency;
|
|
} else
|
|
invalidate_predict_history(dev);
|
|
}
|
|
|
|
if (i >= idx_restrict)
|
|
break;
|
|
|
|
best_level = i;
|
|
|
|
if (predicted ? (predicted <= max_residency)
|
|
: (next_wakeup_us <= max_residency))
|
|
break;
|
|
}
|
|
|
|
/*
|
|
* Start timer to avoid staying in shallower mode forever
|
|
* incase of misprediciton
|
|
*/
|
|
|
|
pwr_params = &cpu->levels[best_level].pwr;
|
|
min_residency = pwr_params->min_residency;
|
|
max_residency = pwr_params->max_residency;
|
|
|
|
if ((predicted || (idx_restrict != cpu->nlevels + 1)) &&
|
|
(best_level < (cpu->nlevels-1))) {
|
|
htime = predicted + cpu->tmr_add;
|
|
if (lpm_ipi_prediction && cpu->ipi_prediction)
|
|
htime += DEFAULT_IPI_TIMER_ADD;
|
|
if (!predicted)
|
|
htime = idx_restrict_time;
|
|
else if (htime > max_residency)
|
|
htime = max_residency;
|
|
|
|
if ((next_wakeup_us > htime) &&
|
|
((next_wakeup_us - htime) > max_residency))
|
|
histtimer_start(htime);
|
|
}
|
|
|
|
done_select:
|
|
trace_cpu_power_select(best_level, sleep_us, latency_us, cpu->bias);
|
|
|
|
trace_cpu_pred_select(idx_restrict_time ? 2 : (ipi_predicted ?
|
|
3 : (predicted ? 1 : 0)), predicted, htime);
|
|
|
|
return best_level;
|
|
}
|
|
|
|
static unsigned int get_next_online_cpu(bool from_idle)
|
|
{
|
|
unsigned int cpu;
|
|
ktime_t next_event;
|
|
unsigned int next_cpu = raw_smp_processor_id();
|
|
|
|
if (!from_idle)
|
|
return next_cpu;
|
|
next_event = KTIME_MAX;
|
|
for_each_online_cpu(cpu) {
|
|
ktime_t next_event_c = per_cpu(next_hrtimer, cpu);
|
|
|
|
if (next_event_c < next_event) {
|
|
next_event = next_event_c;
|
|
next_cpu = cpu;
|
|
}
|
|
}
|
|
return next_cpu;
|
|
}
|
|
|
|
static uint64_t get_cluster_sleep_time(struct lpm_cluster *cluster,
|
|
bool from_idle, uint32_t *pred_time)
|
|
{
|
|
int cpu;
|
|
ktime_t next_event;
|
|
struct cpumask online_cpus_in_cluster;
|
|
struct lpm_history *history;
|
|
int64_t prediction = LONG_MAX;
|
|
|
|
if (!from_idle)
|
|
return ~0ULL;
|
|
|
|
next_event = KTIME_MAX;
|
|
cpumask_and(&online_cpus_in_cluster,
|
|
&cluster->num_children_in_sync, cpu_online_mask);
|
|
|
|
for_each_cpu(cpu, &online_cpus_in_cluster) {
|
|
ktime_t next_event_c = per_cpu(next_hrtimer, cpu);
|
|
|
|
if (next_event_c < next_event)
|
|
next_event = next_event_c;
|
|
|
|
if (from_idle && lpm_prediction && cluster->lpm_prediction) {
|
|
history = &per_cpu(hist, cpu);
|
|
if (history->stime && (history->stime < prediction))
|
|
prediction = history->stime;
|
|
}
|
|
}
|
|
|
|
if (from_idle && lpm_prediction && cluster->lpm_prediction) {
|
|
if (prediction > ktime_to_us(ktime_get()))
|
|
*pred_time = prediction - ktime_to_us(ktime_get());
|
|
}
|
|
|
|
if (ktime_to_us(next_event) > ktime_to_us(ktime_get()))
|
|
return ktime_to_us(ktime_sub(next_event, ktime_get()));
|
|
else
|
|
return 0;
|
|
}
|
|
|
|
static int cluster_predict(struct lpm_cluster *cluster,
|
|
uint32_t *pred_us)
|
|
{
|
|
int i, j;
|
|
int ret = 0;
|
|
struct cluster_history *history = &cluster->history;
|
|
int64_t cur_time = ktime_to_us(ktime_get());
|
|
|
|
if (!lpm_prediction || !cluster->lpm_prediction)
|
|
return 0;
|
|
|
|
if (history->hinvalid) {
|
|
history->hinvalid = 0;
|
|
history->htmr_wkup = 1;
|
|
history->flag = 0;
|
|
return ret;
|
|
}
|
|
|
|
if (history->nsamp == MAXSAMPLES) {
|
|
for (i = 0; i < MAXSAMPLES; i++) {
|
|
if ((cur_time - history->stime[i])
|
|
> CLUST_SMPL_INVLD_TIME)
|
|
history->nsamp--;
|
|
}
|
|
}
|
|
|
|
if (history->nsamp < MAXSAMPLES) {
|
|
history->flag = 0;
|
|
return ret;
|
|
}
|
|
|
|
if (history->flag == 2)
|
|
history->flag = 0;
|
|
|
|
if (history->htmr_wkup != 1) {
|
|
uint64_t total = 0;
|
|
|
|
if (history->flag == 1) {
|
|
for (i = 0; i < MAXSAMPLES; i++)
|
|
total += history->resi[i];
|
|
do_div(total, MAXSAMPLES);
|
|
*pred_us = total;
|
|
return 2;
|
|
}
|
|
|
|
for (j = 1; j < cluster->nlevels; j++) {
|
|
uint32_t failed = 0;
|
|
|
|
total = 0;
|
|
for (i = 0; i < MAXSAMPLES; i++) {
|
|
if ((history->mode[i] == j) && (history->resi[i]
|
|
< cluster->levels[j].pwr.min_residency)) {
|
|
failed++;
|
|
total += history->resi[i];
|
|
}
|
|
}
|
|
|
|
if (failed > (MAXSAMPLES-2)) {
|
|
do_div(total, failed);
|
|
*pred_us = total;
|
|
history->flag = 1;
|
|
return 1;
|
|
}
|
|
}
|
|
}
|
|
|
|
return ret;
|
|
}
|
|
|
|
static void update_cluster_history_time(struct cluster_history *history,
|
|
int idx, uint64_t start)
|
|
{
|
|
history->entry_idx = idx;
|
|
history->entry_time = start;
|
|
}
|
|
|
|
static void update_cluster_history(struct cluster_history *history, int idx)
|
|
{
|
|
uint32_t tmr = 0;
|
|
uint32_t residency = 0;
|
|
struct lpm_cluster *cluster =
|
|
container_of(history, struct lpm_cluster, history);
|
|
|
|
if (!lpm_prediction || !cluster->lpm_prediction)
|
|
return;
|
|
|
|
if ((history->entry_idx == -1) || (history->entry_idx == idx)) {
|
|
residency = ktime_to_us(ktime_get()) - history->entry_time;
|
|
history->stime[history->hptr] = history->entry_time;
|
|
} else
|
|
return;
|
|
|
|
if (history->htmr_wkup) {
|
|
if (!history->hptr)
|
|
history->hptr = MAXSAMPLES-1;
|
|
else
|
|
history->hptr--;
|
|
|
|
history->resi[history->hptr] += residency;
|
|
|
|
history->htmr_wkup = 0;
|
|
tmr = 1;
|
|
} else
|
|
history->resi[history->hptr] = residency;
|
|
|
|
history->mode[history->hptr] = idx;
|
|
|
|
history->entry_idx = INT_MIN;
|
|
history->entry_time = 0;
|
|
|
|
if (history->nsamp < MAXSAMPLES)
|
|
history->nsamp++;
|
|
|
|
trace_cluster_pred_hist(cluster->cluster_name,
|
|
history->mode[history->hptr], history->resi[history->hptr],
|
|
history->hptr, tmr);
|
|
|
|
(history->hptr)++;
|
|
|
|
if (history->hptr >= MAXSAMPLES)
|
|
history->hptr = 0;
|
|
}
|
|
|
|
static void clear_cl_history_each(struct cluster_history *history)
|
|
{
|
|
int i;
|
|
|
|
for (i = 0; i < MAXSAMPLES; i++) {
|
|
history->resi[i] = 0;
|
|
history->mode[i] = -1;
|
|
history->stime[i] = 0;
|
|
}
|
|
|
|
history->hptr = 0;
|
|
history->nsamp = 0;
|
|
history->flag = 0;
|
|
history->hinvalid = 0;
|
|
history->htmr_wkup = 0;
|
|
}
|
|
static void clear_cl_predict_history(void)
|
|
{
|
|
struct lpm_cluster *cluster = lpm_root_node;
|
|
struct list_head *list;
|
|
|
|
if (!lpm_prediction || !cluster->lpm_prediction)
|
|
return;
|
|
|
|
clear_cl_history_each(&cluster->history);
|
|
|
|
list_for_each(list, &cluster->child) {
|
|
struct lpm_cluster *n;
|
|
|
|
n = list_entry(list, typeof(*n), list);
|
|
clear_cl_history_each(&n->history);
|
|
}
|
|
}
|
|
|
|
static int cluster_select(struct lpm_cluster *cluster, bool from_idle,
|
|
int *ispred)
|
|
{
|
|
int best_level = -1;
|
|
int i;
|
|
struct cpumask mask;
|
|
uint32_t latency_us = ~0U;
|
|
uint32_t sleep_us;
|
|
uint32_t cpupred_us = 0, pred_us = 0;
|
|
int pred_mode = 0, predicted = 0;
|
|
|
|
if (!cluster)
|
|
return -EINVAL;
|
|
|
|
sleep_us = (uint32_t)get_cluster_sleep_time(cluster,
|
|
from_idle, &cpupred_us);
|
|
|
|
if (from_idle) {
|
|
pred_mode = cluster_predict(cluster, &pred_us);
|
|
|
|
if (cpupred_us && pred_mode && (cpupred_us < pred_us))
|
|
pred_us = cpupred_us;
|
|
|
|
if (pred_us && pred_mode && (pred_us < sleep_us))
|
|
predicted = 1;
|
|
|
|
if (predicted && (pred_us == cpupred_us))
|
|
predicted = 2;
|
|
}
|
|
|
|
if (cpumask_and(&mask, cpu_online_mask, &cluster->child_cpus))
|
|
latency_us = get_cpus_qos(&mask);
|
|
|
|
for (i = 0; i < cluster->nlevels; i++) {
|
|
struct lpm_cluster_level *level = &cluster->levels[i];
|
|
struct power_params *pwr_params = &level->pwr;
|
|
|
|
if (!lpm_cluster_mode_allow(cluster, i, from_idle))
|
|
continue;
|
|
|
|
if (!cpumask_equal(&cluster->num_children_in_sync,
|
|
&level->num_cpu_votes))
|
|
continue;
|
|
|
|
if (from_idle && latency_us < pwr_params->exit_latency)
|
|
break;
|
|
|
|
if (sleep_us < (pwr_params->exit_latency +
|
|
pwr_params->entry_latency))
|
|
break;
|
|
|
|
if (suspend_in_progress && from_idle && level->notify_rpm)
|
|
continue;
|
|
|
|
if (level->notify_rpm) {
|
|
if (!(sys_pm_ops && sys_pm_ops->sleep_allowed))
|
|
continue;
|
|
if (!sys_pm_ops->sleep_allowed())
|
|
continue;
|
|
}
|
|
|
|
best_level = i;
|
|
|
|
if (from_idle &&
|
|
(predicted ? (pred_us <= pwr_params->max_residency)
|
|
: (sleep_us <= pwr_params->max_residency)))
|
|
break;
|
|
}
|
|
|
|
if ((best_level == (cluster->nlevels - 1)) && (pred_mode == 2))
|
|
cluster->history.flag = 2;
|
|
|
|
*ispred = predicted;
|
|
|
|
trace_cluster_pred_select(cluster->cluster_name, best_level, sleep_us,
|
|
latency_us, predicted, pred_us);
|
|
|
|
return best_level;
|
|
}
|
|
|
|
static int cluster_configure(struct lpm_cluster *cluster, int idx,
|
|
bool from_idle, int predicted)
|
|
{
|
|
struct lpm_cluster_level *level = &cluster->levels[idx];
|
|
struct cpumask online_cpus, cpumask;
|
|
unsigned int cpu;
|
|
|
|
cpumask_and(&online_cpus, &cluster->num_children_in_sync,
|
|
cpu_online_mask);
|
|
|
|
if (!cpumask_equal(&cluster->num_children_in_sync, &cluster->child_cpus)
|
|
|| is_IPI_pending(&online_cpus))
|
|
return -EPERM;
|
|
|
|
if (idx != cluster->default_level) {
|
|
update_debug_pc_event(CLUSTER_ENTER, idx,
|
|
cluster->num_children_in_sync.bits[0],
|
|
cluster->child_cpus.bits[0], from_idle);
|
|
trace_cluster_enter(cluster->cluster_name, idx,
|
|
cluster->num_children_in_sync.bits[0],
|
|
cluster->child_cpus.bits[0], from_idle);
|
|
lpm_stats_cluster_enter(cluster->stats, idx);
|
|
|
|
if (from_idle && lpm_prediction && cluster->lpm_prediction)
|
|
update_cluster_history_time(&cluster->history, idx,
|
|
ktime_to_us(ktime_get()));
|
|
}
|
|
|
|
if (level->notify_rpm) {
|
|
/*
|
|
* Print enabled clocks and regulators which are on during
|
|
* system suspend. This debug information is useful to know
|
|
* which resources are enabled and preventing system level
|
|
* LPMs (XO and Vmin).
|
|
*/
|
|
if (!from_idle) {
|
|
clock_debug_print_enabled();
|
|
regulator_debug_print_enabled();
|
|
}
|
|
|
|
cpu = get_next_online_cpu(from_idle);
|
|
cpumask_copy(&cpumask, cpumask_of(cpu));
|
|
clear_predict_history();
|
|
clear_cl_predict_history();
|
|
if (sys_pm_ops && sys_pm_ops->enter)
|
|
if ((sys_pm_ops->enter(&cpumask)))
|
|
return -EBUSY;
|
|
}
|
|
|
|
cluster->last_level = idx;
|
|
|
|
if (predicted && (idx < (cluster->nlevels - 1))) {
|
|
struct power_params *pwr_params = &cluster->levels[idx].pwr;
|
|
|
|
clusttimer_start(cluster, pwr_params->max_residency +
|
|
cluster->tmr_add);
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
static void cluster_prepare(struct lpm_cluster *cluster,
|
|
const struct cpumask *cpu, int child_idx, bool from_idle,
|
|
int64_t start_time)
|
|
{
|
|
int i;
|
|
int predicted = 0;
|
|
|
|
if (!cluster)
|
|
return;
|
|
|
|
if (cluster->min_child_level > child_idx)
|
|
return;
|
|
|
|
spin_lock(&cluster->sync_lock);
|
|
cpumask_or(&cluster->num_children_in_sync, cpu,
|
|
&cluster->num_children_in_sync);
|
|
|
|
for (i = 0; i < cluster->nlevels; i++) {
|
|
struct lpm_cluster_level *lvl = &cluster->levels[i];
|
|
|
|
if (child_idx >= lvl->min_child_level)
|
|
cpumask_or(&lvl->num_cpu_votes, cpu,
|
|
&lvl->num_cpu_votes);
|
|
}
|
|
|
|
/*
|
|
* cluster_select() does not make any configuration changes. So its ok
|
|
* to release the lock here. If a core wakes up for a rude request,
|
|
* it need not wait for another to finish its cluster selection and
|
|
* configuration process
|
|
*/
|
|
|
|
if (!cpumask_equal(&cluster->num_children_in_sync,
|
|
&cluster->child_cpus))
|
|
goto failed;
|
|
|
|
i = cluster_select(cluster, from_idle, &predicted);
|
|
|
|
if (((i < 0) || (i == cluster->default_level))
|
|
&& predicted && from_idle) {
|
|
update_cluster_history_time(&cluster->history,
|
|
-1, ktime_to_us(ktime_get()));
|
|
|
|
if (i < 0) {
|
|
struct power_params *pwr_params =
|
|
&cluster->levels[0].pwr;
|
|
|
|
clusttimer_start(cluster,
|
|
pwr_params->max_residency +
|
|
cluster->tmr_add);
|
|
|
|
goto failed;
|
|
}
|
|
}
|
|
|
|
if (i < 0)
|
|
goto failed;
|
|
|
|
if (cluster_configure(cluster, i, from_idle, predicted))
|
|
goto failed;
|
|
|
|
if (!IS_ERR_OR_NULL(cluster->stats))
|
|
cluster->stats->sleep_time = start_time;
|
|
cluster_prepare(cluster->parent, &cluster->num_children_in_sync, i,
|
|
from_idle, start_time);
|
|
|
|
spin_unlock(&cluster->sync_lock);
|
|
return;
|
|
failed:
|
|
spin_unlock(&cluster->sync_lock);
|
|
if (!IS_ERR_OR_NULL(cluster->stats))
|
|
cluster->stats->sleep_time = 0;
|
|
}
|
|
|
|
static void cluster_unprepare(struct lpm_cluster *cluster,
|
|
const struct cpumask *cpu, int child_idx, bool from_idle,
|
|
int64_t end_time, bool success)
|
|
{
|
|
struct lpm_cluster_level *level;
|
|
bool first_cpu;
|
|
int last_level, i;
|
|
|
|
if (!cluster)
|
|
return;
|
|
|
|
if (cluster->min_child_level > child_idx)
|
|
return;
|
|
|
|
spin_lock(&cluster->sync_lock);
|
|
last_level = cluster->default_level;
|
|
first_cpu = cpumask_equal(&cluster->num_children_in_sync,
|
|
&cluster->child_cpus);
|
|
cpumask_andnot(&cluster->num_children_in_sync,
|
|
&cluster->num_children_in_sync, cpu);
|
|
|
|
for (i = 0; i < cluster->nlevels; i++) {
|
|
struct lpm_cluster_level *lvl = &cluster->levels[i];
|
|
|
|
if (child_idx >= lvl->min_child_level)
|
|
cpumask_andnot(&lvl->num_cpu_votes,
|
|
&lvl->num_cpu_votes, cpu);
|
|
}
|
|
|
|
if (from_idle && first_cpu &&
|
|
(cluster->last_level == cluster->default_level))
|
|
update_cluster_history(&cluster->history, cluster->last_level);
|
|
|
|
if (!first_cpu || cluster->last_level == cluster->default_level)
|
|
goto unlock_return;
|
|
|
|
if (!IS_ERR_OR_NULL(cluster->stats) && cluster->stats->sleep_time)
|
|
cluster->stats->sleep_time = end_time -
|
|
cluster->stats->sleep_time;
|
|
lpm_stats_cluster_exit(cluster->stats, cluster->last_level, success);
|
|
|
|
level = &cluster->levels[cluster->last_level];
|
|
|
|
if (level->notify_rpm)
|
|
if (sys_pm_ops && sys_pm_ops->exit)
|
|
sys_pm_ops->exit(success);
|
|
|
|
update_debug_pc_event(CLUSTER_EXIT, cluster->last_level,
|
|
cluster->num_children_in_sync.bits[0],
|
|
cluster->child_cpus.bits[0], from_idle);
|
|
trace_cluster_exit(cluster->cluster_name, cluster->last_level,
|
|
cluster->num_children_in_sync.bits[0],
|
|
cluster->child_cpus.bits[0], from_idle);
|
|
|
|
last_level = cluster->last_level;
|
|
cluster->last_level = cluster->default_level;
|
|
|
|
if (from_idle)
|
|
update_cluster_history(&cluster->history, last_level);
|
|
|
|
cluster_unprepare(cluster->parent, &cluster->child_cpus,
|
|
last_level, from_idle, end_time, success);
|
|
unlock_return:
|
|
spin_unlock(&cluster->sync_lock);
|
|
}
|
|
|
|
static inline void cpu_prepare(struct lpm_cpu *cpu, int cpu_index,
|
|
bool from_idle)
|
|
{
|
|
struct lpm_cpu_level *cpu_level = &cpu->levels[cpu_index];
|
|
|
|
/* Use broadcast timer for aggregating sleep mode within a cluster.
|
|
* A broadcast timer could be used in the following scenarios
|
|
* 1) The architected timer HW gets reset during certain low power
|
|
* modes and the core relies on a external(broadcast) timer to wake up
|
|
* from sleep. This information is passed through device tree.
|
|
* 2) The CPU low power mode could trigger a system low power mode.
|
|
* The low power module relies on Broadcast timer to aggregate the
|
|
* next wakeup within a cluster, in which case, CPU switches over to
|
|
* use broadcast timer.
|
|
*/
|
|
|
|
if (from_idle && cpu_level->is_reset)
|
|
cpu_pm_enter();
|
|
|
|
}
|
|
|
|
static inline void cpu_unprepare(struct lpm_cpu *cpu, int cpu_index,
|
|
bool from_idle)
|
|
{
|
|
struct lpm_cpu_level *cpu_level = &cpu->levels[cpu_index];
|
|
|
|
if (from_idle && cpu_level->is_reset)
|
|
cpu_pm_exit();
|
|
}
|
|
|
|
static int get_cluster_id(struct lpm_cluster *cluster, int *aff_lvl,
|
|
bool from_idle)
|
|
{
|
|
int state_id = 0;
|
|
|
|
if (!cluster)
|
|
return 0;
|
|
|
|
spin_lock(&cluster->sync_lock);
|
|
|
|
if (!cpumask_equal(&cluster->num_children_in_sync,
|
|
&cluster->child_cpus))
|
|
goto unlock_and_return;
|
|
|
|
state_id += get_cluster_id(cluster->parent, aff_lvl, from_idle);
|
|
|
|
if (cluster->last_level != cluster->default_level) {
|
|
struct lpm_cluster_level *level
|
|
= &cluster->levels[cluster->last_level];
|
|
|
|
state_id += (level->psci_id & cluster->psci_mode_mask)
|
|
<< cluster->psci_mode_shift;
|
|
|
|
/*
|
|
* We may have updated the broadcast timers, update
|
|
* the wakeup value by reading the bc timer directly.
|
|
*/
|
|
if (level->notify_rpm)
|
|
if (sys_pm_ops && sys_pm_ops->update_wakeup)
|
|
sys_pm_ops->update_wakeup(from_idle);
|
|
if (cluster->psci_mode_shift)
|
|
(*aff_lvl)++;
|
|
}
|
|
unlock_and_return:
|
|
spin_unlock(&cluster->sync_lock);
|
|
return state_id;
|
|
}
|
|
|
|
static int psci_enter_sleep(struct lpm_cpu *cpu, int idx, bool from_idle)
|
|
{
|
|
int affinity_level = 0, state_id = 0, power_state = 0;
|
|
int ret, success;
|
|
/*
|
|
* idx = 0 is the default LPM state
|
|
*/
|
|
|
|
if (!idx) {
|
|
if (cpu->bias)
|
|
biastimer_start(cpu->bias);
|
|
stop_critical_timings();
|
|
cpu_do_idle();
|
|
start_critical_timings();
|
|
return 0;
|
|
}
|
|
|
|
if (from_idle && cpu->levels[idx].use_bc_timer) {
|
|
ret = tick_broadcast_enter();
|
|
if (ret)
|
|
return ret;
|
|
}
|
|
|
|
state_id = get_cluster_id(cpu->parent, &affinity_level, from_idle);
|
|
power_state = PSCI_POWER_STATE(cpu->levels[idx].is_reset);
|
|
affinity_level = PSCI_AFFINITY_LEVEL(affinity_level);
|
|
state_id += power_state + affinity_level + cpu->levels[idx].psci_id;
|
|
|
|
update_debug_pc_event(CPU_ENTER, state_id,
|
|
0xdeaffeed, 0xdeaffeed, from_idle);
|
|
stop_critical_timings();
|
|
|
|
ret = psci_cpu_suspend_enter(state_id);
|
|
success = (ret == 0);
|
|
|
|
start_critical_timings();
|
|
update_debug_pc_event(CPU_EXIT, state_id,
|
|
success, 0xdeaffeed, from_idle);
|
|
|
|
if (from_idle && cpu->levels[idx].use_bc_timer)
|
|
tick_broadcast_exit();
|
|
|
|
return ret;
|
|
}
|
|
|
|
static int lpm_cpuidle_select(struct cpuidle_driver *drv,
|
|
struct cpuidle_device *dev, bool *stop_tick)
|
|
{
|
|
struct lpm_cpu *cpu = per_cpu(cpu_lpm, dev->cpu);
|
|
|
|
if (!cpu)
|
|
return 0;
|
|
|
|
return cpu_power_select(dev, cpu);
|
|
}
|
|
|
|
#ifdef CONFIG_MSM_PM
|
|
void update_ipi_history(int cpu)
|
|
{
|
|
struct ipi_history *history = &per_cpu(cpu_ipi_history, cpu);
|
|
ktime_t now = ktime_get();
|
|
|
|
history->interval[history->current_ptr] =
|
|
ktime_to_us(ktime_sub(now,
|
|
history->cpu_idle_resched_ts));
|
|
(history->current_ptr)++;
|
|
if (history->current_ptr >= MAXSAMPLES)
|
|
history->current_ptr = 0;
|
|
history->cpu_idle_resched_ts = now;
|
|
trace_ipi_wakeup_time(ktime_to_us(now));
|
|
}
|
|
#endif
|
|
|
|
static void update_history(struct cpuidle_device *dev, int idx)
|
|
{
|
|
struct lpm_history *history = &per_cpu(hist, dev->cpu);
|
|
uint32_t tmr = 0;
|
|
struct lpm_cpu *lpm_cpu = per_cpu(cpu_lpm, dev->cpu);
|
|
|
|
if (!lpm_prediction || !lpm_cpu->lpm_prediction)
|
|
return;
|
|
|
|
if (history->htmr_wkup) {
|
|
if (!history->hptr)
|
|
history->hptr = MAXSAMPLES-1;
|
|
else
|
|
history->hptr--;
|
|
|
|
history->resi[history->hptr] += dev->last_residency;
|
|
history->htmr_wkup = 0;
|
|
tmr = 1;
|
|
} else
|
|
history->resi[history->hptr] = dev->last_residency;
|
|
|
|
history->mode[history->hptr] = idx;
|
|
|
|
RCU_NONIDLE(trace_cpu_pred_hist(history->mode[history->hptr],
|
|
history->resi[history->hptr], history->hptr, tmr));
|
|
|
|
if (history->nsamp < MAXSAMPLES)
|
|
history->nsamp++;
|
|
|
|
(history->hptr)++;
|
|
if (history->hptr >= MAXSAMPLES)
|
|
history->hptr = 0;
|
|
}
|
|
|
|
static int lpm_cpuidle_enter(struct cpuidle_device *dev,
|
|
struct cpuidle_driver *drv, int idx)
|
|
{
|
|
struct lpm_cpu *cpu = per_cpu(cpu_lpm, dev->cpu);
|
|
bool success = false;
|
|
const struct cpumask *cpumask = get_cpu_mask(dev->cpu);
|
|
ktime_t start = ktime_get();
|
|
uint64_t start_time = ktime_to_ns(start), end_time;
|
|
int ret = -EBUSY;
|
|
|
|
/* Read the timer from the CPU that is entering idle */
|
|
per_cpu(next_hrtimer, dev->cpu) = tick_nohz_get_next_hrtimer();
|
|
|
|
cpu_prepare(cpu, idx, true);
|
|
cluster_prepare(cpu->parent, cpumask, idx, true, start_time);
|
|
|
|
RCU_NONIDLE(trace_cpu_idle_enter(idx));
|
|
lpm_stats_cpu_enter(idx, start_time);
|
|
|
|
if (need_resched() || is_IPI_pending(cpumask_of(dev->cpu)))
|
|
goto exit;
|
|
|
|
if (idx == cpu->nlevels - 1)
|
|
program_rimps_timer(cpu);
|
|
|
|
ret = psci_enter_sleep(cpu, idx, true);
|
|
success = (ret == 0);
|
|
|
|
exit:
|
|
if (idx == cpu->nlevels - 1)
|
|
disable_rimps_timer(cpu);
|
|
end_time = ktime_to_ns(ktime_get());
|
|
lpm_stats_cpu_exit(idx, end_time, success);
|
|
|
|
cluster_unprepare(cpu->parent, cpumask, idx, true, end_time, success);
|
|
cpu_unprepare(cpu, idx, true);
|
|
dev->last_residency = ktime_us_delta(ktime_get(), start);
|
|
update_history(dev, idx);
|
|
RCU_NONIDLE(trace_cpu_idle_exit(idx, ret));
|
|
if (lpm_prediction && cpu->lpm_prediction) {
|
|
histtimer_cancel();
|
|
clusttimer_cancel();
|
|
}
|
|
if (cpu->bias) {
|
|
biastimer_cancel();
|
|
cpu->bias = 0;
|
|
}
|
|
local_irq_enable();
|
|
return idx;
|
|
}
|
|
|
|
static int lpm_cpuidle_s2idle(struct cpuidle_device *dev,
|
|
struct cpuidle_driver *drv, int idx)
|
|
{
|
|
struct lpm_cpu *cpu = per_cpu(cpu_lpm, dev->cpu);
|
|
const struct cpumask *cpumask = get_cpu_mask(dev->cpu);
|
|
bool success;
|
|
int ret;
|
|
|
|
for (; idx >= 0; idx--) {
|
|
if (lpm_cpu_mode_allow(dev->cpu, idx, false))
|
|
break;
|
|
}
|
|
if (idx < 0) {
|
|
pr_err("Failed suspend\n");
|
|
return -EPERM;
|
|
}
|
|
|
|
cpu_prepare(cpu, idx, true);
|
|
cluster_prepare(cpu->parent, cpumask, idx, false, 0);
|
|
|
|
ret = psci_enter_sleep(cpu, idx, false);
|
|
success = (ret == 0);
|
|
|
|
cluster_unprepare(cpu->parent, cpumask, idx, false, 0, success);
|
|
cpu_unprepare(cpu, idx, true);
|
|
return ret;
|
|
}
|
|
|
|
#ifdef CONFIG_CPU_IDLE_MULTIPLE_DRIVERS
|
|
static int cpuidle_register_cpu(struct cpuidle_driver *drv,
|
|
struct cpumask *mask)
|
|
{
|
|
struct cpuidle_device *device;
|
|
int cpu, ret;
|
|
|
|
if (!mask || !drv)
|
|
return -EINVAL;
|
|
|
|
drv->cpumask = mask;
|
|
ret = cpuidle_register_driver(drv);
|
|
if (ret) {
|
|
pr_err("Failed to register cpuidle driver %d\n", ret);
|
|
goto failed_driver_register;
|
|
}
|
|
|
|
for_each_cpu(cpu, mask) {
|
|
device = &per_cpu(cpuidle_dev, cpu);
|
|
device->cpu = cpu;
|
|
|
|
ret = cpuidle_register_device(device);
|
|
if (ret) {
|
|
pr_err("Failed to register cpuidle driver for cpu:%u\n",
|
|
cpu);
|
|
goto failed_driver_register;
|
|
}
|
|
}
|
|
return ret;
|
|
failed_driver_register:
|
|
for_each_cpu(cpu, mask)
|
|
cpuidle_unregister_driver(drv);
|
|
return ret;
|
|
}
|
|
#else
|
|
static int cpuidle_register_cpu(struct cpuidle_driver *drv,
|
|
struct cpumask *mask)
|
|
{
|
|
return cpuidle_register(drv, NULL);
|
|
}
|
|
#endif
|
|
|
|
static struct cpuidle_governor lpm_governor = {
|
|
.name = "qcom",
|
|
.rating = 30,
|
|
.select = lpm_cpuidle_select,
|
|
};
|
|
|
|
static int cluster_cpuidle_register(struct lpm_cluster *cl)
|
|
{
|
|
int i = 0, ret = 0;
|
|
unsigned int cpu;
|
|
struct lpm_cluster *p = NULL;
|
|
struct lpm_cpu *lpm_cpu;
|
|
|
|
if (list_empty(&cl->cpu)) {
|
|
struct lpm_cluster *n;
|
|
|
|
list_for_each_entry(n, &cl->child, list) {
|
|
ret = cluster_cpuidle_register(n);
|
|
if (ret)
|
|
break;
|
|
}
|
|
return ret;
|
|
}
|
|
|
|
list_for_each_entry(lpm_cpu, &cl->cpu, list) {
|
|
lpm_cpu->drv = kcalloc(1, sizeof(*lpm_cpu->drv), GFP_KERNEL);
|
|
if (!lpm_cpu->drv)
|
|
return -ENOMEM;
|
|
|
|
lpm_cpu->drv->name = "msm_idle";
|
|
|
|
for (i = 0; i < lpm_cpu->nlevels; i++) {
|
|
struct cpuidle_state *st = &lpm_cpu->drv->states[i];
|
|
struct lpm_cpu_level *cpu_level = &lpm_cpu->levels[i];
|
|
|
|
snprintf(st->name, CPUIDLE_NAME_LEN, "C%u\n", i);
|
|
strlcpy(st->desc, cpu_level->name, CPUIDLE_DESC_LEN);
|
|
|
|
st->flags = 0;
|
|
st->exit_latency = cpu_level->pwr.exit_latency;
|
|
st->target_residency = 0;
|
|
st->enter = lpm_cpuidle_enter;
|
|
if (i == lpm_cpu->nlevels - 1)
|
|
st->enter_s2idle = lpm_cpuidle_s2idle;
|
|
}
|
|
|
|
lpm_cpu->drv->state_count = lpm_cpu->nlevels;
|
|
lpm_cpu->drv->safe_state_index = 0;
|
|
for_each_cpu(cpu, &lpm_cpu->related_cpus)
|
|
per_cpu(cpu_lpm, cpu) = lpm_cpu;
|
|
|
|
for_each_possible_cpu(cpu) {
|
|
if (cpu_online(cpu))
|
|
continue;
|
|
if (per_cpu(cpu_lpm, cpu))
|
|
p = per_cpu(cpu_lpm, cpu)->parent;
|
|
while (p) {
|
|
int j;
|
|
|
|
spin_lock(&p->sync_lock);
|
|
cpumask_set_cpu(cpu, &p->num_children_in_sync);
|
|
for (j = 0; j < p->nlevels; j++)
|
|
cpumask_copy(
|
|
&p->levels[j].num_cpu_votes,
|
|
&p->num_children_in_sync);
|
|
spin_unlock(&p->sync_lock);
|
|
p = p->parent;
|
|
}
|
|
}
|
|
ret = cpuidle_register_cpu(lpm_cpu->drv,
|
|
&lpm_cpu->related_cpus);
|
|
|
|
if (ret) {
|
|
kfree(lpm_cpu->drv);
|
|
return -ENOMEM;
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
static void register_cpu_lpm_stats(struct lpm_cpu *cpu,
|
|
struct lpm_cluster *parent)
|
|
{
|
|
const char **level_name;
|
|
int i;
|
|
|
|
level_name = kcalloc(cpu->nlevels, sizeof(*level_name), GFP_KERNEL);
|
|
|
|
if (!level_name)
|
|
return;
|
|
|
|
for (i = 0; i < cpu->nlevels; i++)
|
|
level_name[i] = cpu->levels[i].name;
|
|
|
|
lpm_stats_config_level("cpu", level_name, cpu->nlevels,
|
|
parent->stats, &cpu->related_cpus);
|
|
|
|
kfree(level_name);
|
|
}
|
|
|
|
static void register_cluster_lpm_stats(struct lpm_cluster *cl,
|
|
struct lpm_cluster *parent)
|
|
{
|
|
const char **level_name;
|
|
struct lpm_cluster *child;
|
|
struct lpm_cpu *cpu;
|
|
int i;
|
|
|
|
if (!cl)
|
|
return;
|
|
|
|
level_name = kcalloc(cl->nlevels, sizeof(*level_name), GFP_KERNEL);
|
|
|
|
if (!level_name)
|
|
return;
|
|
|
|
for (i = 0; i < cl->nlevels; i++)
|
|
level_name[i] = cl->levels[i].level_name;
|
|
|
|
cl->stats = lpm_stats_config_level(cl->cluster_name, level_name,
|
|
cl->nlevels, parent ? parent->stats : NULL, NULL);
|
|
if (IS_ERR_OR_NULL(cl->stats))
|
|
pr_info("Cluster (%s) stats not registered\n",
|
|
cl->cluster_name);
|
|
|
|
kfree(level_name);
|
|
|
|
list_for_each_entry(cpu, &cl->cpu, list) {
|
|
register_cpu_lpm_stats(cpu, cl);
|
|
}
|
|
if (!list_empty(&cl->cpu))
|
|
return;
|
|
|
|
list_for_each_entry(child, &cl->child, list)
|
|
register_cluster_lpm_stats(child, cl);
|
|
}
|
|
|
|
static int lpm_suspend_prepare(void)
|
|
{
|
|
suspend_in_progress = true;
|
|
lpm_stats_suspend_enter();
|
|
|
|
return 0;
|
|
}
|
|
|
|
static void lpm_suspend_wake(void)
|
|
{
|
|
suspend_in_progress = false;
|
|
lpm_stats_suspend_exit();
|
|
}
|
|
|
|
static int lpm_suspend_enter(suspend_state_t state)
|
|
{
|
|
int cpu = raw_smp_processor_id();
|
|
struct lpm_cpu *lpm_cpu = per_cpu(cpu_lpm, cpu);
|
|
struct lpm_cluster *cluster = lpm_cpu->parent;
|
|
const struct cpumask *cpumask = get_cpu_mask(cpu);
|
|
int idx;
|
|
bool success;
|
|
int ret;
|
|
|
|
for (idx = lpm_cpu->nlevels - 1; idx >= 0; idx--) {
|
|
if (lpm_cpu_mode_allow(cpu, idx, false))
|
|
break;
|
|
}
|
|
if (idx < 0) {
|
|
pr_err("Failed suspend\n");
|
|
return -EINVAL;
|
|
}
|
|
cpu_prepare(lpm_cpu, idx, false);
|
|
cluster_prepare(cluster, cpumask, idx, false, 0);
|
|
|
|
disable_rimps_timer(lpm_cpu);
|
|
ret = psci_enter_sleep(lpm_cpu, idx, false);
|
|
success = (ret == 0);
|
|
|
|
cluster_unprepare(cluster, cpumask, idx, false, 0, success);
|
|
cpu_unprepare(lpm_cpu, idx, false);
|
|
return ret;
|
|
}
|
|
|
|
static const struct platform_suspend_ops lpm_suspend_ops = {
|
|
.enter = lpm_suspend_enter,
|
|
.valid = suspend_valid_only_mem,
|
|
.prepare_late = lpm_suspend_prepare,
|
|
.wake = lpm_suspend_wake,
|
|
};
|
|
|
|
static const struct platform_s2idle_ops lpm_s2idle_ops = {
|
|
.prepare = lpm_suspend_prepare,
|
|
.restore = lpm_suspend_wake,
|
|
};
|
|
|
|
static int lpm_probe(struct platform_device *pdev)
|
|
{
|
|
int ret;
|
|
int size;
|
|
unsigned int cpu;
|
|
struct hrtimer *cpu_histtimer;
|
|
struct kobject *module_kobj = NULL;
|
|
|
|
get_online_cpus();
|
|
lpm_root_node = lpm_of_parse_cluster(pdev);
|
|
|
|
if (IS_ERR_OR_NULL(lpm_root_node)) {
|
|
pr_err("Failed to probe low power modes\n");
|
|
put_online_cpus();
|
|
return PTR_ERR(lpm_root_node);
|
|
}
|
|
|
|
/*
|
|
* Register hotplug notifier before broadcast time to ensure there
|
|
* to prevent race where a broadcast timer might not be setup on for a
|
|
* core. BUG in existing code but no known issues possibly because of
|
|
* how late lpm_levels gets initialized.
|
|
*/
|
|
for_each_possible_cpu(cpu) {
|
|
cpu_histtimer = &per_cpu(histtimer, cpu);
|
|
hrtimer_init(cpu_histtimer, CLOCK_MONOTONIC, HRTIMER_MODE_REL);
|
|
cpu_histtimer = &per_cpu(biastimer, cpu);
|
|
hrtimer_init(cpu_histtimer, CLOCK_MONOTONIC, HRTIMER_MODE_REL);
|
|
}
|
|
|
|
cluster_timer_init(lpm_root_node);
|
|
|
|
size = num_dbg_elements * sizeof(struct lpm_debug);
|
|
lpm_debug = dma_alloc_coherent(&pdev->dev, size,
|
|
&lpm_debug_phys, GFP_KERNEL);
|
|
|
|
register_cluster_lpm_stats(lpm_root_node, NULL);
|
|
|
|
ret = cluster_cpuidle_register(lpm_root_node);
|
|
put_online_cpus();
|
|
if (ret) {
|
|
pr_err("Failed to register with cpuidle framework\n");
|
|
goto failed;
|
|
}
|
|
#ifdef CONFIG_SMP
|
|
ret = cpuhp_setup_state(CPUHP_AP_QCOM_TIMER_STARTING,
|
|
"AP_QCOM_SLEEP_STARTING",
|
|
lpm_starting_cpu, lpm_dying_cpu);
|
|
if (ret)
|
|
goto failed;
|
|
|
|
ret = cpuhp_setup_state(CPUHP_AP_QCOM_CPU_QOS_ONLINE,
|
|
"AP_QCOM_CPU_QOS_ONLINE",
|
|
lpm_online_cpu, lpm_offline_cpu);
|
|
if (ret)
|
|
goto failed;
|
|
#endif
|
|
module_kobj = kset_find_obj(module_kset, KBUILD_MODNAME);
|
|
if (!module_kobj) {
|
|
pr_err("Cannot find kobject for module %s\n", KBUILD_MODNAME);
|
|
ret = -ENOENT;
|
|
goto failed;
|
|
}
|
|
|
|
ret = create_cluster_lvl_nodes(lpm_root_node, module_kobj);
|
|
if (ret) {
|
|
pr_err("Failed to create cluster level nodes\n");
|
|
goto failed;
|
|
}
|
|
|
|
suspend_set_ops(&lpm_suspend_ops);
|
|
s2idle_set_ops(&lpm_s2idle_ops);
|
|
|
|
return 0;
|
|
failed:
|
|
free_cluster_node(lpm_root_node);
|
|
lpm_root_node = NULL;
|
|
dma_free_coherent(&pdev->dev, size, lpm_debug, lpm_debug_phys);
|
|
|
|
return ret;
|
|
}
|
|
|
|
static const struct of_device_id lpm_mtch_tbl[] = {
|
|
{.compatible = "qcom,lpm-levels"},
|
|
{},
|
|
};
|
|
|
|
static struct platform_driver lpm_driver = {
|
|
.probe = lpm_probe,
|
|
.driver = {
|
|
.name = "lpm-levels",
|
|
.suppress_bind_attrs = true,
|
|
.of_match_table = lpm_mtch_tbl,
|
|
},
|
|
};
|
|
|
|
static int __init lpm_levels_module_init(void)
|
|
{
|
|
int rc;
|
|
|
|
rc = cpuidle_register_governor(&lpm_governor);
|
|
if (rc) {
|
|
pr_info("Error registering governor %s rc=%d\n",
|
|
lpm_driver.driver.name, rc);
|
|
return rc;
|
|
}
|
|
|
|
rc = platform_driver_register(&lpm_driver);
|
|
if (rc)
|
|
pr_info("Error registering %s rc=%d\n", lpm_driver.driver.name,
|
|
rc);
|
|
|
|
return rc;
|
|
}
|
|
module_init(lpm_levels_module_init);
|
|
MODULE_LICENSE("GPL v2");
|