cache_leaves
return boot_cpu_data.cache_leaves[cache_present - 1].linesz;
struct cache_desc cache_leaves[CACHE_LEAVES_MAX];
current_cpu_data.cache_leaves[cache_present - 1].level;
struct cache_desc *cd, *cdesc = current_cpu_data.cache_leaves;
struct cache_desc *cdesc = current_cpu_data.cache_leaves;
struct cache_desc *cdesc = current_cpu_data.cache_leaves + leaf;
struct cache_desc *cdesc = current_cpu_data.cache_leaves;
llc = per_cpu_cacheinfo_idx(cpu, cache_leaves(cpu) - 1);
while (index < cache_leaves(cpu)) {
if (index != cache_leaves(cpu)) /* not all OF nodes populated */
for (index = 0; index < cache_leaves(cpu); index++) {
for (sib_index = 0; sib_index < cache_leaves(i); sib_index++) {
for (index = 0; index < cache_leaves(cpu); index++) {
for (sib_index = 0; sib_index < cache_leaves(sibling); sib_index++) {
cache_leaves(cpu), GFP_ATOMIC);
cache_leaves(cpu) = 0;
if (ret || !cache_leaves(cpu)) {
if (!cache_leaves(cpu))
unsigned int early_leaves = cache_leaves(cpu);
if (init_cache_level(cpu) || !cache_leaves(cpu))
if (cache_leaves(cpu) <= early_leaves && per_cpu_cacheinfo(cpu))
if (!cache_leaves(cpu) || !per_cpu_cacheinfo(cpu))
llc = per_cpu_cacheinfo_idx(cpu, cache_leaves(cpu) - 1);
llc = per_cpu_cacheinfo_idx(cpu, cache_leaves(cpu) - 1);
for (i = 0; i < cache_leaves(cpu); i++) {
cache_leaves(cpu));
for (i = 0; i < cache_leaves(cpu); i++) {
llc = per_cpu_cacheinfo_idx(cpu, cache_leaves(cpu) - 1);
sib_llc = per_cpu_cacheinfo_idx(sibling, cache_leaves(sibling) - 1);
llc_x = per_cpu_cacheinfo_idx(cpu_x, cache_leaves(cpu_x) - 1);
llc_y = per_cpu_cacheinfo_idx(cpu_y, cache_leaves(cpu_y) - 1);