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