1298535c0SDavid Daney /* 2298535c0SDavid Daney * OF NUMA Parsing support. 3298535c0SDavid Daney * 4298535c0SDavid Daney * Copyright (C) 2015 - 2016 Cavium Inc. 5298535c0SDavid Daney * 6298535c0SDavid Daney * This program is free software; you can redistribute it and/or modify 7298535c0SDavid Daney * it under the terms of the GNU General Public License version 2 as 8298535c0SDavid Daney * published by the Free Software Foundation. 9298535c0SDavid Daney * 10298535c0SDavid Daney * This program is distributed in the hope that it will be useful, 11298535c0SDavid Daney * but WITHOUT ANY WARRANTY; without even the implied warranty of 12298535c0SDavid Daney * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13298535c0SDavid Daney * GNU General Public License for more details. 14298535c0SDavid Daney * 15298535c0SDavid Daney * You should have received a copy of the GNU General Public License 16298535c0SDavid Daney * along with this program. If not, see <http://www.gnu.org/licenses/>. 17298535c0SDavid Daney */ 18298535c0SDavid Daney 19298535c0SDavid Daney #include <linux/of.h> 20298535c0SDavid Daney #include <linux/of_address.h> 21298535c0SDavid Daney #include <linux/nodemask.h> 22298535c0SDavid Daney 23298535c0SDavid Daney #include <asm/numa.h> 24298535c0SDavid Daney 25298535c0SDavid Daney /* define default numa node to 0 */ 26298535c0SDavid Daney #define DEFAULT_NODE 0 27298535c0SDavid Daney 28298535c0SDavid Daney /* 29298535c0SDavid Daney * Even though we connect cpus to numa domains later in SMP 30298535c0SDavid Daney * init, we need to know the node ids now for all cpus. 31298535c0SDavid Daney */ 32298535c0SDavid Daney static void __init of_numa_parse_cpu_nodes(void) 33298535c0SDavid Daney { 34298535c0SDavid Daney u32 nid; 35298535c0SDavid Daney int r; 36298535c0SDavid Daney struct device_node *cpus; 37298535c0SDavid Daney struct device_node *np = NULL; 38298535c0SDavid Daney 39298535c0SDavid Daney cpus = of_find_node_by_path("/cpus"); 40298535c0SDavid Daney if (!cpus) 41298535c0SDavid Daney return; 42298535c0SDavid Daney 43298535c0SDavid Daney for_each_child_of_node(cpus, np) { 44298535c0SDavid Daney /* Skip things that are not CPUs */ 45298535c0SDavid Daney if (of_node_cmp(np->type, "cpu") != 0) 46298535c0SDavid Daney continue; 47298535c0SDavid Daney 48298535c0SDavid Daney r = of_property_read_u32(np, "numa-node-id", &nid); 49298535c0SDavid Daney if (r) 50298535c0SDavid Daney continue; 51298535c0SDavid Daney 52298535c0SDavid Daney pr_debug("NUMA: CPU on %u\n", nid); 53298535c0SDavid Daney if (nid >= MAX_NUMNODES) 54298535c0SDavid Daney pr_warn("NUMA: Node id %u exceeds maximum value\n", 55298535c0SDavid Daney nid); 56298535c0SDavid Daney else 57298535c0SDavid Daney node_set(nid, numa_nodes_parsed); 58298535c0SDavid Daney } 59298535c0SDavid Daney } 60298535c0SDavid Daney 61298535c0SDavid Daney static int __init of_numa_parse_memory_nodes(void) 62298535c0SDavid Daney { 63298535c0SDavid Daney struct device_node *np = NULL; 64298535c0SDavid Daney struct resource rsrc; 65298535c0SDavid Daney u32 nid; 66*84b14256SZhen Lei int i, r; 67298535c0SDavid Daney 68*84b14256SZhen Lei for_each_node_by_type(np, "memory") { 69298535c0SDavid Daney r = of_property_read_u32(np, "numa-node-id", &nid); 70298535c0SDavid Daney if (r == -EINVAL) 71298535c0SDavid Daney /* 72298535c0SDavid Daney * property doesn't exist if -EINVAL, continue 73298535c0SDavid Daney * looking for more memory nodes with 74298535c0SDavid Daney * "numa-node-id" property 75298535c0SDavid Daney */ 76298535c0SDavid Daney continue; 77298535c0SDavid Daney 78*84b14256SZhen Lei for (i = 0; !r && !of_address_to_resource(np, i, &rsrc); i++) 798ccbbdaaSHanjun Guo r = numa_add_memblk(nid, rsrc.start, rsrc.end + 1); 80298535c0SDavid Daney 81*84b14256SZhen Lei if (!i || r) { 82*84b14256SZhen Lei of_node_put(np); 83*84b14256SZhen Lei pr_err("NUMA: bad property in memory node\n"); 84*84b14256SZhen Lei return r ? : -EINVAL; 85*84b14256SZhen Lei } 86*84b14256SZhen Lei } 87*84b14256SZhen Lei 88*84b14256SZhen Lei return 0; 89298535c0SDavid Daney } 90298535c0SDavid Daney 91298535c0SDavid Daney static int __init of_numa_parse_distance_map_v1(struct device_node *map) 92298535c0SDavid Daney { 93298535c0SDavid Daney const __be32 *matrix; 94298535c0SDavid Daney int entry_count; 95298535c0SDavid Daney int i; 96298535c0SDavid Daney 97298535c0SDavid Daney pr_info("NUMA: parsing numa-distance-map-v1\n"); 98298535c0SDavid Daney 99298535c0SDavid Daney matrix = of_get_property(map, "distance-matrix", NULL); 100298535c0SDavid Daney if (!matrix) { 101298535c0SDavid Daney pr_err("NUMA: No distance-matrix property in distance-map\n"); 102298535c0SDavid Daney return -EINVAL; 103298535c0SDavid Daney } 104298535c0SDavid Daney 105298535c0SDavid Daney entry_count = of_property_count_u32_elems(map, "distance-matrix"); 106298535c0SDavid Daney if (entry_count <= 0) { 107298535c0SDavid Daney pr_err("NUMA: Invalid distance-matrix\n"); 108298535c0SDavid Daney return -EINVAL; 109298535c0SDavid Daney } 110298535c0SDavid Daney 111298535c0SDavid Daney for (i = 0; i + 2 < entry_count; i += 3) { 112298535c0SDavid Daney u32 nodea, nodeb, distance; 113298535c0SDavid Daney 114298535c0SDavid Daney nodea = of_read_number(matrix, 1); 115298535c0SDavid Daney matrix++; 116298535c0SDavid Daney nodeb = of_read_number(matrix, 1); 117298535c0SDavid Daney matrix++; 118298535c0SDavid Daney distance = of_read_number(matrix, 1); 119298535c0SDavid Daney matrix++; 120298535c0SDavid Daney 121298535c0SDavid Daney numa_set_distance(nodea, nodeb, distance); 122298535c0SDavid Daney pr_debug("NUMA: distance[node%d -> node%d] = %d\n", 123298535c0SDavid Daney nodea, nodeb, distance); 124298535c0SDavid Daney 125298535c0SDavid Daney /* Set default distance of node B->A same as A->B */ 126298535c0SDavid Daney if (nodeb > nodea) 127298535c0SDavid Daney numa_set_distance(nodeb, nodea, distance); 128298535c0SDavid Daney } 129298535c0SDavid Daney 130298535c0SDavid Daney return 0; 131298535c0SDavid Daney } 132298535c0SDavid Daney 133298535c0SDavid Daney static int __init of_numa_parse_distance_map(void) 134298535c0SDavid Daney { 135298535c0SDavid Daney int ret = 0; 136298535c0SDavid Daney struct device_node *np; 137298535c0SDavid Daney 138298535c0SDavid Daney np = of_find_compatible_node(NULL, NULL, 139298535c0SDavid Daney "numa-distance-map-v1"); 140298535c0SDavid Daney if (np) 141298535c0SDavid Daney ret = of_numa_parse_distance_map_v1(np); 142298535c0SDavid Daney 143298535c0SDavid Daney of_node_put(np); 144298535c0SDavid Daney return ret; 145298535c0SDavid Daney } 146298535c0SDavid Daney 147298535c0SDavid Daney int of_node_to_nid(struct device_node *device) 148298535c0SDavid Daney { 149298535c0SDavid Daney struct device_node *np; 150298535c0SDavid Daney u32 nid; 151298535c0SDavid Daney int r = -ENODATA; 152298535c0SDavid Daney 153298535c0SDavid Daney np = of_node_get(device); 154298535c0SDavid Daney 155298535c0SDavid Daney while (np) { 156298535c0SDavid Daney struct device_node *parent; 157298535c0SDavid Daney 158298535c0SDavid Daney r = of_property_read_u32(np, "numa-node-id", &nid); 159298535c0SDavid Daney /* 160298535c0SDavid Daney * -EINVAL indicates the property was not found, and 161298535c0SDavid Daney * we walk up the tree trying to find a parent with a 162298535c0SDavid Daney * "numa-node-id". Any other type of error indicates 163298535c0SDavid Daney * a bad device tree and we give up. 164298535c0SDavid Daney */ 165298535c0SDavid Daney if (r != -EINVAL) 166298535c0SDavid Daney break; 167298535c0SDavid Daney 168298535c0SDavid Daney parent = of_get_parent(np); 169298535c0SDavid Daney of_node_put(np); 170298535c0SDavid Daney np = parent; 171298535c0SDavid Daney } 172298535c0SDavid Daney if (np && r) 173298535c0SDavid Daney pr_warn("NUMA: Invalid \"numa-node-id\" property in node %s\n", 174298535c0SDavid Daney np->name); 175298535c0SDavid Daney of_node_put(np); 176298535c0SDavid Daney 177298535c0SDavid Daney if (!r) { 178298535c0SDavid Daney if (nid >= MAX_NUMNODES) 179298535c0SDavid Daney pr_warn("NUMA: Node id %u exceeds maximum value\n", 180298535c0SDavid Daney nid); 181298535c0SDavid Daney else 182298535c0SDavid Daney return nid; 183298535c0SDavid Daney } 184298535c0SDavid Daney 185298535c0SDavid Daney return NUMA_NO_NODE; 186298535c0SDavid Daney } 187298535c0SDavid Daney EXPORT_SYMBOL(of_node_to_nid); 188298535c0SDavid Daney 189298535c0SDavid Daney int __init of_numa_init(void) 190298535c0SDavid Daney { 191298535c0SDavid Daney int r; 192298535c0SDavid Daney 193298535c0SDavid Daney of_numa_parse_cpu_nodes(); 194298535c0SDavid Daney r = of_numa_parse_memory_nodes(); 195298535c0SDavid Daney if (r) 196298535c0SDavid Daney return r; 197298535c0SDavid Daney return of_numa_parse_distance_map(); 198298535c0SDavid Daney } 199