1/* 2 * acpi_numa.c - ACPI NUMA support 3 * 4 * Copyright (C) 2002 Takayoshi Kochi <t-kochi@bq.jp.nec.com> 5 * 6 * ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 7 * 8 * This program is free software; you can redistribute it and/or modify 9 * it under the terms of the GNU General Public License as published by 10 * the Free Software Foundation; either version 2 of the License, or 11 * (at your option) any later version. 12 * 13 * This program is distributed in the hope that it will be useful, 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 16 * GNU General Public License for more details. 17 * 18 * You should have received a copy of the GNU General Public License 19 * along with this program; if not, write to the Free Software 20 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA 21 * 22 * ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 23 * 24 */ 25#include <linux/module.h> 26#include <linux/init.h> 27#include <linux/kernel.h> 28#include <linux/types.h> 29#include <linux/errno.h> 30#include <linux/acpi.h> 31#include <acpi/acpi_bus.h> 32#include <acpi/acmacros.h> 33 34#define ACPI_NUMA 0x80000000 35#define _COMPONENT ACPI_NUMA 36ACPI_MODULE_NAME("numa"); 37 38static nodemask_t nodes_found_map = NODE_MASK_NONE; 39#define PXM_INVAL -1 40#define NID_INVAL -1 41 42/* maps to convert between proximity domain and logical node ID */ 43static int pxm_to_node_map[MAX_PXM_DOMAINS] 44 = { [0 ... MAX_PXM_DOMAINS - 1] = NID_INVAL }; 45static int node_to_pxm_map[MAX_NUMNODES] 46 = { [0 ... MAX_NUMNODES - 1] = PXM_INVAL }; 47 48int pxm_to_node(int pxm) 49{ 50 if (pxm < 0) 51 return NID_INVAL; 52 return pxm_to_node_map[pxm]; 53} 54 55int node_to_pxm(int node) 56{ 57 if (node < 0) 58 return PXM_INVAL; 59 return node_to_pxm_map[node]; 60} 61 62int acpi_map_pxm_to_node(int pxm) 63{ 64 int node = pxm_to_node_map[pxm]; 65 66 if (node < 0){ 67 if (nodes_weight(nodes_found_map) >= MAX_NUMNODES) 68 return NID_INVAL; 69 node = first_unset_node(nodes_found_map); 70 pxm_to_node_map[pxm] = node; 71 node_to_pxm_map[node] = pxm; 72 node_set(node, nodes_found_map); 73 } 74 75 return node; 76} 77 78void __cpuinit acpi_unmap_pxm_to_node(int node) 79{ 80 int pxm = node_to_pxm_map[node]; 81 pxm_to_node_map[pxm] = NID_INVAL; 82 node_to_pxm_map[node] = PXM_INVAL; 83 node_clear(node, nodes_found_map); 84} 85 86void __init acpi_table_print_srat_entry(struct acpi_subtable_header * header) 87{ 88 89 ACPI_FUNCTION_NAME("acpi_table_print_srat_entry"); 90 91 if (!header) 92 return; 93 94 switch (header->type) { 95 96 case ACPI_SRAT_TYPE_CPU_AFFINITY: 97#ifdef ACPI_DEBUG_OUTPUT 98 { 99 struct acpi_srat_cpu_affinity *p = 100 (struct acpi_srat_cpu_affinity *)header; 101 ACPI_DEBUG_PRINT((ACPI_DB_INFO, 102 "SRAT Processor (id[0x%02x] eid[0x%02x]) in proximity domain %d %s\n", 103 p->apic_id, p->local_sapic_eid, 104 p->proximity_domain_lo, 105 (p->flags & ACPI_SRAT_CPU_ENABLED)? 106 "enabled" : "disabled")); 107 } 108#endif /* ACPI_DEBUG_OUTPUT */ 109 break; 110 111 case ACPI_SRAT_TYPE_MEMORY_AFFINITY: 112#ifdef ACPI_DEBUG_OUTPUT 113 { 114 struct acpi_srat_mem_affinity *p = 115 (struct acpi_srat_mem_affinity *)header; 116 ACPI_DEBUG_PRINT((ACPI_DB_INFO, 117 "SRAT Memory (0x%lx length 0x%lx type 0x%x) in proximity domain %d %s%s\n", 118 (unsigned long)p->base_address, 119 (unsigned long)p->length, 120 p->memory_type, p->proximity_domain, 121 (p->flags & ACPI_SRAT_MEM_ENABLED)? 122 "enabled" : "disabled", 123 (p->flags & ACPI_SRAT_MEM_HOT_PLUGGABLE)? 124 " hot-pluggable" : "")); 125 } 126#endif /* ACPI_DEBUG_OUTPUT */ 127 break; 128 129 default: 130 printk(KERN_WARNING PREFIX 131 "Found unsupported SRAT entry (type = 0x%x)\n", 132 header->type); 133 break; 134 } 135} 136 137static int __init acpi_parse_slit(struct acpi_table_header *table) 138{ 139 struct acpi_table_slit *slit; 140 u32 localities; 141 142 if (!table) 143 return -EINVAL; 144 145 slit = (struct acpi_table_slit *)table; 146 147 /* downcast just for %llu vs %lu for i386/ia64 */ 148 localities = (u32) slit->locality_count; 149 150 acpi_numa_slit_init(slit); 151 152 return 0; 153} 154 155static int __init 156acpi_parse_processor_affinity(struct acpi_subtable_header * header, 157 const unsigned long end) 158{ 159 struct acpi_srat_cpu_affinity *processor_affinity; 160 161 processor_affinity = (struct acpi_srat_cpu_affinity *)header; 162 if (!processor_affinity) 163 return -EINVAL; 164 165 acpi_table_print_srat_entry(header); 166 167 /* let architecture-dependent part to do it */ 168 acpi_numa_processor_affinity_init(processor_affinity); 169 170 return 0; 171} 172 173static int __init 174acpi_parse_memory_affinity(struct acpi_subtable_header * header, 175 const unsigned long end) 176{ 177 struct acpi_srat_mem_affinity *memory_affinity; 178 179 memory_affinity = (struct acpi_srat_mem_affinity *)header; 180 if (!memory_affinity) 181 return -EINVAL; 182 183 acpi_table_print_srat_entry(header); 184 185 /* let architecture-dependent part to do it */ 186 acpi_numa_memory_affinity_init(memory_affinity); 187 188 return 0; 189} 190 191static int __init acpi_parse_srat(struct acpi_table_header *table) 192{ 193 struct acpi_table_srat *srat; 194 195 if (!table) 196 return -EINVAL; 197 198 srat = (struct acpi_table_srat *)table; 199 200 return 0; 201} 202 203int __init 204acpi_table_parse_srat(enum acpi_srat_type id, 205 acpi_table_entry_handler handler, unsigned int max_entries) 206{ 207 return acpi_table_parse_entries(ACPI_SIG_SRAT, 208 sizeof(struct acpi_table_srat), id, 209 handler, max_entries); 210} 211 212int __init acpi_numa_init(void) 213{ 214 int result; 215 216 /* SRAT: Static Resource Affinity Table */ 217 if (!acpi_table_parse(ACPI_SIG_SRAT, acpi_parse_srat)) { 218 result = acpi_table_parse_srat(ACPI_SRAT_TYPE_CPU_AFFINITY, 219 acpi_parse_processor_affinity, 220 NR_CPUS); 221 result = acpi_table_parse_srat(ACPI_SRAT_TYPE_MEMORY_AFFINITY, acpi_parse_memory_affinity, NR_NODE_MEMBLKS); // IA64 specific 222 } 223 224 /* SLIT: System Locality Information Table */ 225 acpi_table_parse(ACPI_SIG_SLIT, acpi_parse_slit); 226 227 acpi_numa_arch_fixup(); 228 return 0; 229} 230 231int acpi_get_pxm(acpi_handle h) 232{ 233 unsigned long pxm; 234 acpi_status status; 235 acpi_handle handle; 236 acpi_handle phandle = h; 237 238 do { 239 handle = phandle; 240 status = acpi_evaluate_integer(handle, "_PXM", NULL, &pxm); 241 if (ACPI_SUCCESS(status)) 242 return pxm; 243 status = acpi_get_parent(handle, &phandle); 244 } while (ACPI_SUCCESS(status)); 245 return -1; 246} 247EXPORT_SYMBOL(acpi_get_pxm); 248 249int acpi_get_node(acpi_handle *handle) 250{ 251 int pxm, node = -1; 252 253 pxm = acpi_get_pxm(handle); 254 if (pxm >= 0) 255 node = acpi_map_pxm_to_node(pxm); 256 257 return node; 258} 259EXPORT_SYMBOL(acpi_get_node); 260