Gh0st
/
linux
mirror of https://github.com/torvalds/linux.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

cpufreq: intel_pstate: Add and use hybrid_has_l3() 

Introduce a function for checking whether or not a given CPU has L3
cache, called hybrid_has_l3(), and use it in hybrid_get_cost() for
computing cost coefficients associated with a given perf domain.

Signed-off-by: Rafael J. Wysocki <rafael.j.wysocki@intel.com>
Link: https://patch.msgid.link/13884343.uLZWGnKmhe@rafael.j.wysocki
This commit is contained in:
Rafael J. Wysocki 2025-10-15 15:47:45 +02:00
parent 528dde6619
commit c17add7349
1 changed files with 18 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

30
drivers/cpufreq/intel_pstate.c
View File

@ -951,11 +951,26 @@ static int hybrid_active_power(struct device *dev, unsigned long *power,
return 0; return 0;
} }
static bool hybrid_has_l3(unsigned int cpu)
{
struct cpu_cacheinfo *cacheinfo = get_cpu_cacheinfo(cpu);
unsigned int i;
if (!cacheinfo)
return false;
for (i = 0; i < cacheinfo->num_leaves; i++) {
if (cacheinfo->info_list[i].level == 3)
return true;
}
return false;
}
static int hybrid_get_cost(struct device *dev, unsigned long freq, static int hybrid_get_cost(struct device *dev, unsigned long freq,
unsigned long *cost) unsigned long *cost)
{ {
struct pstate_data *pstate = &all_cpu_data[dev->id]->pstate; struct pstate_data *pstate = &all_cpu_data[dev->id]->pstate;
struct cpu_cacheinfo *cacheinfo = get_cpu_cacheinfo(dev->id);
/* /*
* The smaller the perf-to-frequency scaling factor, the larger the IPC * The smaller the perf-to-frequency scaling factor, the larger the IPC
@ -973,17 +988,8 @@ static int hybrid_get_cost(struct device *dev, unsigned long freq,
* touching it in case some other CPUs of the same type can do the work * touching it in case some other CPUs of the same type can do the work
* without it. * without it.
*/ */
if (cacheinfo) { if (hybrid_has_l3(dev->id))
unsigned int i; *cost += 2;
/* Check if L3 cache is there. */
for (i = 0; i < cacheinfo->num_leaves; i++) {
if (cacheinfo->info_list[i].level == 3) {
*cost += 2;
break;
}
}
}
return 0; return 0;
} }