Justin Chen | ef462f3 | 2016-12-07 17:16:26 -0800 | [diff] [blame] | 1 | /* |
| 2 | * MIPS cacheinfo support |
| 3 | * |
| 4 | * This program is free software; you can redistribute it and/or modify |
| 5 | * it under the terms of the GNU General Public License version 2 as |
| 6 | * published by the Free Software Foundation. |
| 7 | * |
| 8 | * This program is distributed "as is" WITHOUT ANY WARRANTY of any |
| 9 | * kind, whether express or implied; without even the implied warranty |
| 10 | * of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 11 | * GNU General Public License for more details. |
| 12 | * |
| 13 | * You should have received a copy of the GNU General Public License |
| 14 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
| 15 | */ |
| 16 | #include <linux/cacheinfo.h> |
| 17 | |
| 18 | /* Populates leaf and increments to next leaf */ |
| 19 | #define populate_cache(cache, leaf, c_level, c_type) \ |
James Hogan | 4828b5f | 2017-02-10 22:44:03 +0000 | [diff] [blame] | 20 | do { \ |
Justin Chen | ef462f3 | 2016-12-07 17:16:26 -0800 | [diff] [blame] | 21 | leaf->type = c_type; \ |
| 22 | leaf->level = c_level; \ |
| 23 | leaf->coherency_line_size = c->cache.linesz; \ |
| 24 | leaf->number_of_sets = c->cache.sets; \ |
| 25 | leaf->ways_of_associativity = c->cache.ways; \ |
| 26 | leaf->size = c->cache.linesz * c->cache.sets * \ |
| 27 | c->cache.ways; \ |
James Hogan | 4828b5f | 2017-02-10 22:44:03 +0000 | [diff] [blame] | 28 | leaf++; \ |
| 29 | } while (0) |
Justin Chen | ef462f3 | 2016-12-07 17:16:26 -0800 | [diff] [blame] | 30 | |
| 31 | static int __init_cache_level(unsigned int cpu) |
| 32 | { |
| 33 | struct cpuinfo_mips *c = ¤t_cpu_data; |
| 34 | struct cpu_cacheinfo *this_cpu_ci = get_cpu_cacheinfo(cpu); |
| 35 | int levels = 0, leaves = 0; |
| 36 | |
| 37 | /* |
| 38 | * If Dcache is not set, we assume the cache structures |
| 39 | * are not properly initialized. |
| 40 | */ |
| 41 | if (c->dcache.waysize) |
| 42 | levels += 1; |
| 43 | else |
| 44 | return -ENOENT; |
| 45 | |
| 46 | |
| 47 | leaves += (c->icache.waysize) ? 2 : 1; |
| 48 | |
| 49 | if (c->scache.waysize) { |
| 50 | levels++; |
| 51 | leaves++; |
| 52 | } |
| 53 | |
| 54 | if (c->tcache.waysize) { |
| 55 | levels++; |
| 56 | leaves++; |
| 57 | } |
| 58 | |
| 59 | this_cpu_ci->num_levels = levels; |
| 60 | this_cpu_ci->num_leaves = leaves; |
| 61 | return 0; |
| 62 | } |
| 63 | |
| 64 | static int __populate_cache_leaves(unsigned int cpu) |
| 65 | { |
| 66 | struct cpuinfo_mips *c = ¤t_cpu_data; |
| 67 | struct cpu_cacheinfo *this_cpu_ci = get_cpu_cacheinfo(cpu); |
| 68 | struct cacheinfo *this_leaf = this_cpu_ci->info_list; |
| 69 | |
| 70 | if (c->icache.waysize) { |
| 71 | populate_cache(dcache, this_leaf, 1, CACHE_TYPE_DATA); |
| 72 | populate_cache(icache, this_leaf, 1, CACHE_TYPE_INST); |
| 73 | } else { |
| 74 | populate_cache(dcache, this_leaf, 1, CACHE_TYPE_UNIFIED); |
| 75 | } |
| 76 | |
| 77 | if (c->scache.waysize) |
| 78 | populate_cache(scache, this_leaf, 2, CACHE_TYPE_UNIFIED); |
| 79 | |
| 80 | if (c->tcache.waysize) |
| 81 | populate_cache(tcache, this_leaf, 3, CACHE_TYPE_UNIFIED); |
| 82 | |
| 83 | return 0; |
| 84 | } |
| 85 | |
| 86 | DEFINE_SMP_CALL_CACHE_FUNCTION(init_cache_level) |
| 87 | DEFINE_SMP_CALL_CACHE_FUNCTION(populate_cache_leaves) |