Loading...
1// SPDX-License-Identifier: GPL-2.0-only
2/*
3 * Copyright (C) 2017 SiFive
4 */
5
6#include <linux/cacheinfo.h>
7#include <linux/cpu.h>
8#include <linux/of.h>
9#include <linux/of_device.h>
10
11static void ci_leaf_init(struct cacheinfo *this_leaf,
12 struct device_node *node,
13 enum cache_type type, unsigned int level)
14{
15 this_leaf->level = level;
16 this_leaf->type = type;
17}
18
19static int __init_cache_level(unsigned int cpu)
20{
21 struct cpu_cacheinfo *this_cpu_ci = get_cpu_cacheinfo(cpu);
22 struct device_node *np = of_cpu_device_node_get(cpu);
23 struct device_node *prev = NULL;
24 int levels = 0, leaves = 0, level;
25
26 if (of_property_read_bool(np, "cache-size"))
27 ++leaves;
28 if (of_property_read_bool(np, "i-cache-size"))
29 ++leaves;
30 if (of_property_read_bool(np, "d-cache-size"))
31 ++leaves;
32 if (leaves > 0)
33 levels = 1;
34
35 prev = np;
36 while ((np = of_find_next_cache_node(np))) {
37 of_node_put(prev);
38 prev = np;
39 if (!of_device_is_compatible(np, "cache"))
40 break;
41 if (of_property_read_u32(np, "cache-level", &level))
42 break;
43 if (level <= levels)
44 break;
45 if (of_property_read_bool(np, "cache-size"))
46 ++leaves;
47 if (of_property_read_bool(np, "i-cache-size"))
48 ++leaves;
49 if (of_property_read_bool(np, "d-cache-size"))
50 ++leaves;
51 levels = level;
52 }
53
54 of_node_put(np);
55 this_cpu_ci->num_levels = levels;
56 this_cpu_ci->num_leaves = leaves;
57
58 return 0;
59}
60
61static int __populate_cache_leaves(unsigned int cpu)
62{
63 struct cpu_cacheinfo *this_cpu_ci = get_cpu_cacheinfo(cpu);
64 struct cacheinfo *this_leaf = this_cpu_ci->info_list;
65 struct device_node *np = of_cpu_device_node_get(cpu);
66 struct device_node *prev = NULL;
67 int levels = 1, level = 1;
68
69 if (of_property_read_bool(np, "cache-size"))
70 ci_leaf_init(this_leaf++, np, CACHE_TYPE_UNIFIED, level);
71 if (of_property_read_bool(np, "i-cache-size"))
72 ci_leaf_init(this_leaf++, np, CACHE_TYPE_INST, level);
73 if (of_property_read_bool(np, "d-cache-size"))
74 ci_leaf_init(this_leaf++, np, CACHE_TYPE_DATA, level);
75
76 prev = np;
77 while ((np = of_find_next_cache_node(np))) {
78 of_node_put(prev);
79 prev = np;
80 if (!of_device_is_compatible(np, "cache"))
81 break;
82 if (of_property_read_u32(np, "cache-level", &level))
83 break;
84 if (level <= levels)
85 break;
86 if (of_property_read_bool(np, "cache-size"))
87 ci_leaf_init(this_leaf++, np, CACHE_TYPE_UNIFIED, level);
88 if (of_property_read_bool(np, "i-cache-size"))
89 ci_leaf_init(this_leaf++, np, CACHE_TYPE_INST, level);
90 if (of_property_read_bool(np, "d-cache-size"))
91 ci_leaf_init(this_leaf++, np, CACHE_TYPE_DATA, level);
92 levels = level;
93 }
94 of_node_put(np);
95
96 return 0;
97}
98
99DEFINE_SMP_CALL_CACHE_FUNCTION(init_cache_level)
100DEFINE_SMP_CALL_CACHE_FUNCTION(populate_cache_leaves)
1// SPDX-License-Identifier: GPL-2.0-only
2/*
3 * Copyright (C) 2017 SiFive
4 */
5
6#include <linux/cpu.h>
7#include <linux/of.h>
8#include <asm/cacheinfo.h>
9
10static struct riscv_cacheinfo_ops *rv_cache_ops;
11
12void riscv_set_cacheinfo_ops(struct riscv_cacheinfo_ops *ops)
13{
14 rv_cache_ops = ops;
15}
16EXPORT_SYMBOL_GPL(riscv_set_cacheinfo_ops);
17
18const struct attribute_group *
19cache_get_priv_group(struct cacheinfo *this_leaf)
20{
21 if (rv_cache_ops && rv_cache_ops->get_priv_group)
22 return rv_cache_ops->get_priv_group(this_leaf);
23 return NULL;
24}
25
26static struct cacheinfo *get_cacheinfo(u32 level, enum cache_type type)
27{
28 /*
29 * Using raw_smp_processor_id() elides a preemptability check, but this
30 * is really indicative of a larger problem: the cacheinfo UABI assumes
31 * that cores have a homonogenous view of the cache hierarchy. That
32 * happens to be the case for the current set of RISC-V systems, but
33 * likely won't be true in general. Since there's no way to provide
34 * correct information for these systems via the current UABI we're
35 * just eliding the check for now.
36 */
37 struct cpu_cacheinfo *this_cpu_ci = get_cpu_cacheinfo(raw_smp_processor_id());
38 struct cacheinfo *this_leaf;
39 int index;
40
41 for (index = 0; index < this_cpu_ci->num_leaves; index++) {
42 this_leaf = this_cpu_ci->info_list + index;
43 if (this_leaf->level == level && this_leaf->type == type)
44 return this_leaf;
45 }
46
47 return NULL;
48}
49
50uintptr_t get_cache_size(u32 level, enum cache_type type)
51{
52 struct cacheinfo *this_leaf = get_cacheinfo(level, type);
53
54 return this_leaf ? this_leaf->size : 0;
55}
56
57uintptr_t get_cache_geometry(u32 level, enum cache_type type)
58{
59 struct cacheinfo *this_leaf = get_cacheinfo(level, type);
60
61 return this_leaf ? (this_leaf->ways_of_associativity << 16 |
62 this_leaf->coherency_line_size) :
63 0;
64}
65
66static void ci_leaf_init(struct cacheinfo *this_leaf,
67 struct device_node *node,
68 enum cache_type type, unsigned int level)
69{
70 this_leaf->level = level;
71 this_leaf->type = type;
72}
73
74int populate_cache_leaves(unsigned int cpu)
75{
76 struct cpu_cacheinfo *this_cpu_ci = get_cpu_cacheinfo(cpu);
77 struct cacheinfo *this_leaf = this_cpu_ci->info_list;
78 struct device_node *np = of_cpu_device_node_get(cpu);
79 struct device_node *prev = NULL;
80 int levels = 1, level = 1;
81
82 if (of_property_read_bool(np, "cache-size"))
83 ci_leaf_init(this_leaf++, np, CACHE_TYPE_UNIFIED, level);
84 if (of_property_read_bool(np, "i-cache-size"))
85 ci_leaf_init(this_leaf++, np, CACHE_TYPE_INST, level);
86 if (of_property_read_bool(np, "d-cache-size"))
87 ci_leaf_init(this_leaf++, np, CACHE_TYPE_DATA, level);
88
89 prev = np;
90 while ((np = of_find_next_cache_node(np))) {
91 of_node_put(prev);
92 prev = np;
93 if (!of_device_is_compatible(np, "cache"))
94 break;
95 if (of_property_read_u32(np, "cache-level", &level))
96 break;
97 if (level <= levels)
98 break;
99 if (of_property_read_bool(np, "cache-size"))
100 ci_leaf_init(this_leaf++, np, CACHE_TYPE_UNIFIED, level);
101 if (of_property_read_bool(np, "i-cache-size"))
102 ci_leaf_init(this_leaf++, np, CACHE_TYPE_INST, level);
103 if (of_property_read_bool(np, "d-cache-size"))
104 ci_leaf_init(this_leaf++, np, CACHE_TYPE_DATA, level);
105 levels = level;
106 }
107 of_node_put(np);
108
109 return 0;
110}