1*298535c0SDavid Daney /* 2*298535c0SDavid Daney * OF NUMA Parsing support. 3*298535c0SDavid Daney * 4*298535c0SDavid Daney * Copyright (C) 2015 - 2016 Cavium Inc. 5*298535c0SDavid Daney * 6*298535c0SDavid Daney * This program is free software; you can redistribute it and/or modify 7*298535c0SDavid Daney * it under the terms of the GNU General Public License version 2 as 8*298535c0SDavid Daney * published by the Free Software Foundation. 9*298535c0SDavid Daney * 10*298535c0SDavid Daney * This program is distributed in the hope that it will be useful, 11*298535c0SDavid Daney * but WITHOUT ANY WARRANTY; without even the implied warranty of 12*298535c0SDavid Daney * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13*298535c0SDavid Daney * GNU General Public License for more details. 14*298535c0SDavid Daney * 15*298535c0SDavid Daney * You should have received a copy of the GNU General Public License 16*298535c0SDavid Daney * along with this program. If not, see <http://www.gnu.org/licenses/>. 17*298535c0SDavid Daney */ 18*298535c0SDavid Daney 19*298535c0SDavid Daney #include <linux/of.h> 20*298535c0SDavid Daney #include <linux/of_address.h> 21*298535c0SDavid Daney #include <linux/nodemask.h> 22*298535c0SDavid Daney 23*298535c0SDavid Daney #include <asm/numa.h> 24*298535c0SDavid Daney 25*298535c0SDavid Daney /* define default numa node to 0 */ 26*298535c0SDavid Daney #define DEFAULT_NODE 0 27*298535c0SDavid Daney 28*298535c0SDavid Daney /* 29*298535c0SDavid Daney * Even though we connect cpus to numa domains later in SMP 30*298535c0SDavid Daney * init, we need to know the node ids now for all cpus. 31*298535c0SDavid Daney */ 32*298535c0SDavid Daney static void __init of_numa_parse_cpu_nodes(void) 33*298535c0SDavid Daney { 34*298535c0SDavid Daney u32 nid; 35*298535c0SDavid Daney int r; 36*298535c0SDavid Daney struct device_node *cpus; 37*298535c0SDavid Daney struct device_node *np = NULL; 38*298535c0SDavid Daney 39*298535c0SDavid Daney cpus = of_find_node_by_path("/cpus"); 40*298535c0SDavid Daney if (!cpus) 41*298535c0SDavid Daney return; 42*298535c0SDavid Daney 43*298535c0SDavid Daney for_each_child_of_node(cpus, np) { 44*298535c0SDavid Daney /* Skip things that are not CPUs */ 45*298535c0SDavid Daney if (of_node_cmp(np->type, "cpu") != 0) 46*298535c0SDavid Daney continue; 47*298535c0SDavid Daney 48*298535c0SDavid Daney r = of_property_read_u32(np, "numa-node-id", &nid); 49*298535c0SDavid Daney if (r) 50*298535c0SDavid Daney continue; 51*298535c0SDavid Daney 52*298535c0SDavid Daney pr_debug("NUMA: CPU on %u\n", nid); 53*298535c0SDavid Daney if (nid >= MAX_NUMNODES) 54*298535c0SDavid Daney pr_warn("NUMA: Node id %u exceeds maximum value\n", 55*298535c0SDavid Daney nid); 56*298535c0SDavid Daney else 57*298535c0SDavid Daney node_set(nid, numa_nodes_parsed); 58*298535c0SDavid Daney } 59*298535c0SDavid Daney } 60*298535c0SDavid Daney 61*298535c0SDavid Daney static int __init of_numa_parse_memory_nodes(void) 62*298535c0SDavid Daney { 63*298535c0SDavid Daney struct device_node *np = NULL; 64*298535c0SDavid Daney struct resource rsrc; 65*298535c0SDavid Daney u32 nid; 66*298535c0SDavid Daney int r = 0; 67*298535c0SDavid Daney 68*298535c0SDavid Daney for (;;) { 69*298535c0SDavid Daney np = of_find_node_by_type(np, "memory"); 70*298535c0SDavid Daney if (!np) 71*298535c0SDavid Daney break; 72*298535c0SDavid Daney 73*298535c0SDavid Daney r = of_property_read_u32(np, "numa-node-id", &nid); 74*298535c0SDavid Daney if (r == -EINVAL) 75*298535c0SDavid Daney /* 76*298535c0SDavid Daney * property doesn't exist if -EINVAL, continue 77*298535c0SDavid Daney * looking for more memory nodes with 78*298535c0SDavid Daney * "numa-node-id" property 79*298535c0SDavid Daney */ 80*298535c0SDavid Daney continue; 81*298535c0SDavid Daney else if (r) 82*298535c0SDavid Daney /* some other error */ 83*298535c0SDavid Daney break; 84*298535c0SDavid Daney 85*298535c0SDavid Daney r = of_address_to_resource(np, 0, &rsrc); 86*298535c0SDavid Daney if (r) { 87*298535c0SDavid Daney pr_err("NUMA: bad reg property in memory node\n"); 88*298535c0SDavid Daney break; 89*298535c0SDavid Daney } 90*298535c0SDavid Daney 91*298535c0SDavid Daney pr_debug("NUMA: base = %llx len = %llx, node = %u\n", 92*298535c0SDavid Daney rsrc.start, rsrc.end - rsrc.start + 1, nid); 93*298535c0SDavid Daney 94*298535c0SDavid Daney r = numa_add_memblk(nid, rsrc.start, 95*298535c0SDavid Daney rsrc.end - rsrc.start + 1); 96*298535c0SDavid Daney if (r) 97*298535c0SDavid Daney break; 98*298535c0SDavid Daney } 99*298535c0SDavid Daney of_node_put(np); 100*298535c0SDavid Daney 101*298535c0SDavid Daney return r; 102*298535c0SDavid Daney } 103*298535c0SDavid Daney 104*298535c0SDavid Daney static int __init of_numa_parse_distance_map_v1(struct device_node *map) 105*298535c0SDavid Daney { 106*298535c0SDavid Daney const __be32 *matrix; 107*298535c0SDavid Daney int entry_count; 108*298535c0SDavid Daney int i; 109*298535c0SDavid Daney 110*298535c0SDavid Daney pr_info("NUMA: parsing numa-distance-map-v1\n"); 111*298535c0SDavid Daney 112*298535c0SDavid Daney matrix = of_get_property(map, "distance-matrix", NULL); 113*298535c0SDavid Daney if (!matrix) { 114*298535c0SDavid Daney pr_err("NUMA: No distance-matrix property in distance-map\n"); 115*298535c0SDavid Daney return -EINVAL; 116*298535c0SDavid Daney } 117*298535c0SDavid Daney 118*298535c0SDavid Daney entry_count = of_property_count_u32_elems(map, "distance-matrix"); 119*298535c0SDavid Daney if (entry_count <= 0) { 120*298535c0SDavid Daney pr_err("NUMA: Invalid distance-matrix\n"); 121*298535c0SDavid Daney return -EINVAL; 122*298535c0SDavid Daney } 123*298535c0SDavid Daney 124*298535c0SDavid Daney for (i = 0; i + 2 < entry_count; i += 3) { 125*298535c0SDavid Daney u32 nodea, nodeb, distance; 126*298535c0SDavid Daney 127*298535c0SDavid Daney nodea = of_read_number(matrix, 1); 128*298535c0SDavid Daney matrix++; 129*298535c0SDavid Daney nodeb = of_read_number(matrix, 1); 130*298535c0SDavid Daney matrix++; 131*298535c0SDavid Daney distance = of_read_number(matrix, 1); 132*298535c0SDavid Daney matrix++; 133*298535c0SDavid Daney 134*298535c0SDavid Daney numa_set_distance(nodea, nodeb, distance); 135*298535c0SDavid Daney pr_debug("NUMA: distance[node%d -> node%d] = %d\n", 136*298535c0SDavid Daney nodea, nodeb, distance); 137*298535c0SDavid Daney 138*298535c0SDavid Daney /* Set default distance of node B->A same as A->B */ 139*298535c0SDavid Daney if (nodeb > nodea) 140*298535c0SDavid Daney numa_set_distance(nodeb, nodea, distance); 141*298535c0SDavid Daney } 142*298535c0SDavid Daney 143*298535c0SDavid Daney return 0; 144*298535c0SDavid Daney } 145*298535c0SDavid Daney 146*298535c0SDavid Daney static int __init of_numa_parse_distance_map(void) 147*298535c0SDavid Daney { 148*298535c0SDavid Daney int ret = 0; 149*298535c0SDavid Daney struct device_node *np; 150*298535c0SDavid Daney 151*298535c0SDavid Daney np = of_find_compatible_node(NULL, NULL, 152*298535c0SDavid Daney "numa-distance-map-v1"); 153*298535c0SDavid Daney if (np) 154*298535c0SDavid Daney ret = of_numa_parse_distance_map_v1(np); 155*298535c0SDavid Daney 156*298535c0SDavid Daney of_node_put(np); 157*298535c0SDavid Daney return ret; 158*298535c0SDavid Daney } 159*298535c0SDavid Daney 160*298535c0SDavid Daney int of_node_to_nid(struct device_node *device) 161*298535c0SDavid Daney { 162*298535c0SDavid Daney struct device_node *np; 163*298535c0SDavid Daney u32 nid; 164*298535c0SDavid Daney int r = -ENODATA; 165*298535c0SDavid Daney 166*298535c0SDavid Daney np = of_node_get(device); 167*298535c0SDavid Daney 168*298535c0SDavid Daney while (np) { 169*298535c0SDavid Daney struct device_node *parent; 170*298535c0SDavid Daney 171*298535c0SDavid Daney r = of_property_read_u32(np, "numa-node-id", &nid); 172*298535c0SDavid Daney /* 173*298535c0SDavid Daney * -EINVAL indicates the property was not found, and 174*298535c0SDavid Daney * we walk up the tree trying to find a parent with a 175*298535c0SDavid Daney * "numa-node-id". Any other type of error indicates 176*298535c0SDavid Daney * a bad device tree and we give up. 177*298535c0SDavid Daney */ 178*298535c0SDavid Daney if (r != -EINVAL) 179*298535c0SDavid Daney break; 180*298535c0SDavid Daney 181*298535c0SDavid Daney parent = of_get_parent(np); 182*298535c0SDavid Daney of_node_put(np); 183*298535c0SDavid Daney np = parent; 184*298535c0SDavid Daney } 185*298535c0SDavid Daney if (np && r) 186*298535c0SDavid Daney pr_warn("NUMA: Invalid \"numa-node-id\" property in node %s\n", 187*298535c0SDavid Daney np->name); 188*298535c0SDavid Daney of_node_put(np); 189*298535c0SDavid Daney 190*298535c0SDavid Daney if (!r) { 191*298535c0SDavid Daney if (nid >= MAX_NUMNODES) 192*298535c0SDavid Daney pr_warn("NUMA: Node id %u exceeds maximum value\n", 193*298535c0SDavid Daney nid); 194*298535c0SDavid Daney else 195*298535c0SDavid Daney return nid; 196*298535c0SDavid Daney } 197*298535c0SDavid Daney 198*298535c0SDavid Daney return NUMA_NO_NODE; 199*298535c0SDavid Daney } 200*298535c0SDavid Daney EXPORT_SYMBOL(of_node_to_nid); 201*298535c0SDavid Daney 202*298535c0SDavid Daney int __init of_numa_init(void) 203*298535c0SDavid Daney { 204*298535c0SDavid Daney int r; 205*298535c0SDavid Daney 206*298535c0SDavid Daney of_numa_parse_cpu_nodes(); 207*298535c0SDavid Daney r = of_numa_parse_memory_nodes(); 208*298535c0SDavid Daney if (r) 209*298535c0SDavid Daney return r; 210*298535c0SDavid Daney return of_numa_parse_distance_map(); 211*298535c0SDavid Daney } 212