Linux kernel mirror (for testing) git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git
kernel os linux
1
fork

Configure Feed

Select the types of activity you want to include in your feed.

at v2.6.27 286 lines 7.0 kB view raw
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 40/* maps to convert between proximity domain and logical node ID */ 41static int pxm_to_node_map[MAX_PXM_DOMAINS] 42 = { [0 ... MAX_PXM_DOMAINS - 1] = NID_INVAL }; 43static int node_to_pxm_map[MAX_NUMNODES] 44 = { [0 ... MAX_NUMNODES - 1] = PXM_INVAL }; 45 46int pxm_to_node(int pxm) 47{ 48 if (pxm < 0) 49 return NID_INVAL; 50 return pxm_to_node_map[pxm]; 51} 52 53int node_to_pxm(int node) 54{ 55 if (node < 0) 56 return PXM_INVAL; 57 return node_to_pxm_map[node]; 58} 59 60void __acpi_map_pxm_to_node(int pxm, int node) 61{ 62 pxm_to_node_map[pxm] = node; 63 node_to_pxm_map[node] = pxm; 64} 65 66int acpi_map_pxm_to_node(int pxm) 67{ 68 int node = pxm_to_node_map[pxm]; 69 70 if (node < 0){ 71 if (nodes_weight(nodes_found_map) >= MAX_NUMNODES) 72 return NID_INVAL; 73 node = first_unset_node(nodes_found_map); 74 __acpi_map_pxm_to_node(pxm, node); 75 node_set(node, nodes_found_map); 76 } 77 78 return node; 79} 80 81#if 0 82void __cpuinit acpi_unmap_pxm_to_node(int node) 83{ 84 int pxm = node_to_pxm_map[node]; 85 pxm_to_node_map[pxm] = NID_INVAL; 86 node_to_pxm_map[node] = PXM_INVAL; 87 node_clear(node, nodes_found_map); 88} 89#endif /* 0 */ 90 91static void __init 92acpi_table_print_srat_entry(struct acpi_subtable_header *header) 93{ 94 95 ACPI_FUNCTION_NAME("acpi_table_print_srat_entry"); 96 97 if (!header) 98 return; 99 100 switch (header->type) { 101 102 case ACPI_SRAT_TYPE_CPU_AFFINITY: 103#ifdef ACPI_DEBUG_OUTPUT 104 { 105 struct acpi_srat_cpu_affinity *p = 106 (struct acpi_srat_cpu_affinity *)header; 107 ACPI_DEBUG_PRINT((ACPI_DB_INFO, 108 "SRAT Processor (id[0x%02x] eid[0x%02x]) in proximity domain %d %s\n", 109 p->apic_id, p->local_sapic_eid, 110 p->proximity_domain_lo, 111 (p->flags & ACPI_SRAT_CPU_ENABLED)? 112 "enabled" : "disabled")); 113 } 114#endif /* ACPI_DEBUG_OUTPUT */ 115 break; 116 117 case ACPI_SRAT_TYPE_MEMORY_AFFINITY: 118#ifdef ACPI_DEBUG_OUTPUT 119 { 120 struct acpi_srat_mem_affinity *p = 121 (struct acpi_srat_mem_affinity *)header; 122 ACPI_DEBUG_PRINT((ACPI_DB_INFO, 123 "SRAT Memory (0x%lx length 0x%lx) in proximity domain %d %s%s\n", 124 (unsigned long)p->base_address, 125 (unsigned long)p->length, 126 p->proximity_domain, 127 (p->flags & ACPI_SRAT_MEM_ENABLED)? 128 "enabled" : "disabled", 129 (p->flags & ACPI_SRAT_MEM_HOT_PLUGGABLE)? 130 " hot-pluggable" : "")); 131 } 132#endif /* ACPI_DEBUG_OUTPUT */ 133 break; 134 135 default: 136 printk(KERN_WARNING PREFIX 137 "Found unsupported SRAT entry (type = 0x%x)\n", 138 header->type); 139 break; 140 } 141} 142 143/* 144 * A lot of BIOS fill in 10 (= no distance) everywhere. This messes 145 * up the NUMA heuristics which wants the local node to have a smaller 146 * distance than the others. 147 * Do some quick checks here and only use the SLIT if it passes. 148 */ 149static __init int slit_valid(struct acpi_table_slit *slit) 150{ 151 int i, j; 152 int d = slit->locality_count; 153 for (i = 0; i < d; i++) { 154 for (j = 0; j < d; j++) { 155 u8 val = slit->entry[d*i + j]; 156 if (i == j) { 157 if (val != LOCAL_DISTANCE) 158 return 0; 159 } else if (val <= LOCAL_DISTANCE) 160 return 0; 161 } 162 } 163 return 1; 164} 165 166static int __init acpi_parse_slit(struct acpi_table_header *table) 167{ 168 struct acpi_table_slit *slit; 169 170 if (!table) 171 return -EINVAL; 172 173 slit = (struct acpi_table_slit *)table; 174 175 if (!slit_valid(slit)) { 176 printk(KERN_INFO "ACPI: SLIT table looks invalid. Not used.\n"); 177 return -EINVAL; 178 } 179 acpi_numa_slit_init(slit); 180 181 return 0; 182} 183 184static int __init 185acpi_parse_processor_affinity(struct acpi_subtable_header * header, 186 const unsigned long end) 187{ 188 struct acpi_srat_cpu_affinity *processor_affinity; 189 190 processor_affinity = (struct acpi_srat_cpu_affinity *)header; 191 if (!processor_affinity) 192 return -EINVAL; 193 194 acpi_table_print_srat_entry(header); 195 196 /* let architecture-dependent part to do it */ 197 acpi_numa_processor_affinity_init(processor_affinity); 198 199 return 0; 200} 201 202static int __init 203acpi_parse_memory_affinity(struct acpi_subtable_header * header, 204 const unsigned long end) 205{ 206 struct acpi_srat_mem_affinity *memory_affinity; 207 208 memory_affinity = (struct acpi_srat_mem_affinity *)header; 209 if (!memory_affinity) 210 return -EINVAL; 211 212 acpi_table_print_srat_entry(header); 213 214 /* let architecture-dependent part to do it */ 215 acpi_numa_memory_affinity_init(memory_affinity); 216 217 return 0; 218} 219 220static int __init acpi_parse_srat(struct acpi_table_header *table) 221{ 222 struct acpi_table_srat *srat; 223 224 if (!table) 225 return -EINVAL; 226 227 srat = (struct acpi_table_srat *)table; 228 229 return 0; 230} 231 232static int __init 233acpi_table_parse_srat(enum acpi_srat_type id, 234 acpi_table_entry_handler handler, unsigned int max_entries) 235{ 236 return acpi_table_parse_entries(ACPI_SIG_SRAT, 237 sizeof(struct acpi_table_srat), id, 238 handler, max_entries); 239} 240 241int __init acpi_numa_init(void) 242{ 243 /* SRAT: Static Resource Affinity Table */ 244 if (!acpi_table_parse(ACPI_SIG_SRAT, acpi_parse_srat)) { 245 acpi_table_parse_srat(ACPI_SRAT_TYPE_CPU_AFFINITY, 246 acpi_parse_processor_affinity, NR_CPUS); 247 acpi_table_parse_srat(ACPI_SRAT_TYPE_MEMORY_AFFINITY, 248 acpi_parse_memory_affinity, 249 NR_NODE_MEMBLKS); 250 } 251 252 /* SLIT: System Locality Information Table */ 253 acpi_table_parse(ACPI_SIG_SLIT, acpi_parse_slit); 254 255 acpi_numa_arch_fixup(); 256 return 0; 257} 258 259int acpi_get_pxm(acpi_handle h) 260{ 261 unsigned long pxm; 262 acpi_status status; 263 acpi_handle handle; 264 acpi_handle phandle = h; 265 266 do { 267 handle = phandle; 268 status = acpi_evaluate_integer(handle, "_PXM", NULL, &pxm); 269 if (ACPI_SUCCESS(status)) 270 return pxm; 271 status = acpi_get_parent(handle, &phandle); 272 } while (ACPI_SUCCESS(status)); 273 return -1; 274} 275 276int acpi_get_node(acpi_handle *handle) 277{ 278 int pxm, node = -1; 279 280 pxm = acpi_get_pxm(handle); 281 if (pxm >= 0) 282 node = acpi_map_pxm_to_node(pxm); 283 284 return node; 285} 286EXPORT_SYMBOL(acpi_get_node);