]>
Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * acpi_numa.c - ACPI NUMA support | |
3 | * | |
4 | * Copyright (C) 2002 Takayoshi Kochi <[email protected]> | |
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> | |
1da177e4 LT |
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> | |
b552a8c5 | 31 | #include <linux/numa.h> |
1da177e4 | 32 | #include <acpi/acpi_bus.h> |
1da177e4 | 33 | |
a192a958 LB |
34 | #define PREFIX "ACPI: " |
35 | ||
1da177e4 LT |
36 | #define ACPI_NUMA 0x80000000 |
37 | #define _COMPONENT ACPI_NUMA | |
f52fd66d | 38 | ACPI_MODULE_NAME("numa"); |
1da177e4 | 39 | |
762834e8 | 40 | static nodemask_t nodes_found_map = NODE_MASK_NONE; |
762834e8 YG |
41 | |
42 | /* maps to convert between proximity domain and logical node ID */ | |
ffada891 | 43 | static int pxm_to_node_map[MAX_PXM_DOMAINS] |
b552a8c5 | 44 | = { [0 ... MAX_PXM_DOMAINS - 1] = NUMA_NO_NODE }; |
ffada891 | 45 | static int node_to_pxm_map[MAX_NUMNODES] |
b552a8c5 | 46 | = { [0 ... MAX_NUMNODES - 1] = PXM_INVAL }; |
762834e8 | 47 | |
8df0eb7c KG |
48 | unsigned char acpi_srat_revision __initdata; |
49 | ||
f363d16f | 50 | int pxm_to_node(int pxm) |
762834e8 YG |
51 | { |
52 | if (pxm < 0) | |
b552a8c5 | 53 | return NUMA_NO_NODE; |
762834e8 YG |
54 | return pxm_to_node_map[pxm]; |
55 | } | |
56 | ||
f363d16f | 57 | int node_to_pxm(int node) |
762834e8 YG |
58 | { |
59 | if (node < 0) | |
60 | return PXM_INVAL; | |
61 | return node_to_pxm_map[node]; | |
62 | } | |
63 | ||
3484d798 DR |
64 | void __acpi_map_pxm_to_node(int pxm, int node) |
65 | { | |
0f9b75ef DR |
66 | if (pxm_to_node_map[pxm] == NUMA_NO_NODE || node < pxm_to_node_map[pxm]) |
67 | pxm_to_node_map[pxm] = node; | |
68 | if (node_to_pxm_map[node] == PXM_INVAL || pxm < node_to_pxm_map[node]) | |
69 | node_to_pxm_map[node] = pxm; | |
3484d798 DR |
70 | } |
71 | ||
8ff6f48d | 72 | int acpi_map_pxm_to_node(int pxm) |
762834e8 YG |
73 | { |
74 | int node = pxm_to_node_map[pxm]; | |
75 | ||
b552a8c5 | 76 | if (node < 0) { |
762834e8 | 77 | if (nodes_weight(nodes_found_map) >= MAX_NUMNODES) |
b552a8c5 | 78 | return NUMA_NO_NODE; |
762834e8 | 79 | node = first_unset_node(nodes_found_map); |
3484d798 | 80 | __acpi_map_pxm_to_node(pxm, node); |
762834e8 YG |
81 | node_set(node, nodes_found_map); |
82 | } | |
83 | ||
84 | return node; | |
85 | } | |
86 | ||
ae2c6dcf DR |
87 | static void __init |
88 | acpi_table_print_srat_entry(struct acpi_subtable_header *header) | |
1da177e4 LT |
89 | { |
90 | ||
4be44fcd | 91 | ACPI_FUNCTION_NAME("acpi_table_print_srat_entry"); |
1da177e4 LT |
92 | |
93 | if (!header) | |
94 | return; | |
95 | ||
96 | switch (header->type) { | |
97 | ||
15a58ed1 | 98 | case ACPI_SRAT_TYPE_CPU_AFFINITY: |
1da177e4 | 99 | #ifdef ACPI_DEBUG_OUTPUT |
4be44fcd | 100 | { |
15a58ed1 AS |
101 | struct acpi_srat_cpu_affinity *p = |
102 | (struct acpi_srat_cpu_affinity *)header; | |
4be44fcd LB |
103 | ACPI_DEBUG_PRINT((ACPI_DB_INFO, |
104 | "SRAT Processor (id[0x%02x] eid[0x%02x]) in proximity domain %d %s\n", | |
15a58ed1 AS |
105 | p->apic_id, p->local_sapic_eid, |
106 | p->proximity_domain_lo, | |
107 | (p->flags & ACPI_SRAT_CPU_ENABLED)? | |
108 | "enabled" : "disabled")); | |
4be44fcd LB |
109 | } |
110 | #endif /* ACPI_DEBUG_OUTPUT */ | |
1da177e4 LT |
111 | break; |
112 | ||
15a58ed1 | 113 | case ACPI_SRAT_TYPE_MEMORY_AFFINITY: |
1da177e4 | 114 | #ifdef ACPI_DEBUG_OUTPUT |
4be44fcd | 115 | { |
15a58ed1 AS |
116 | struct acpi_srat_mem_affinity *p = |
117 | (struct acpi_srat_mem_affinity *)header; | |
4be44fcd | 118 | ACPI_DEBUG_PRINT((ACPI_DB_INFO, |
19d0cfe9 | 119 | "SRAT Memory (0x%lx length 0x%lx) in proximity domain %d %s%s\n", |
15a58ed1 AS |
120 | (unsigned long)p->base_address, |
121 | (unsigned long)p->length, | |
19d0cfe9 | 122 | p->proximity_domain, |
15a58ed1 AS |
123 | (p->flags & ACPI_SRAT_MEM_ENABLED)? |
124 | "enabled" : "disabled", | |
125 | (p->flags & ACPI_SRAT_MEM_HOT_PLUGGABLE)? | |
126 | " hot-pluggable" : "")); | |
4be44fcd LB |
127 | } |
128 | #endif /* ACPI_DEBUG_OUTPUT */ | |
1da177e4 LT |
129 | break; |
130 | ||
7237d3de SS |
131 | case ACPI_SRAT_TYPE_X2APIC_CPU_AFFINITY: |
132 | #ifdef ACPI_DEBUG_OUTPUT | |
133 | { | |
134 | struct acpi_srat_x2apic_cpu_affinity *p = | |
135 | (struct acpi_srat_x2apic_cpu_affinity *)header; | |
136 | ACPI_DEBUG_PRINT((ACPI_DB_INFO, | |
137 | "SRAT Processor (x2apicid[0x%08x]) in" | |
138 | " proximity domain %d %s\n", | |
139 | p->apic_id, | |
140 | p->proximity_domain, | |
141 | (p->flags & ACPI_SRAT_CPU_ENABLED) ? | |
142 | "enabled" : "disabled")); | |
143 | } | |
144 | #endif /* ACPI_DEBUG_OUTPUT */ | |
145 | break; | |
1da177e4 | 146 | default: |
4be44fcd LB |
147 | printk(KERN_WARNING PREFIX |
148 | "Found unsupported SRAT entry (type = 0x%x)\n", | |
149 | header->type); | |
1da177e4 LT |
150 | break; |
151 | } | |
152 | } | |
153 | ||
39b8931b FY |
154 | /* |
155 | * A lot of BIOS fill in 10 (= no distance) everywhere. This messes | |
156 | * up the NUMA heuristics which wants the local node to have a smaller | |
157 | * distance than the others. | |
158 | * Do some quick checks here and only use the SLIT if it passes. | |
159 | */ | |
160 | static __init int slit_valid(struct acpi_table_slit *slit) | |
161 | { | |
162 | int i, j; | |
163 | int d = slit->locality_count; | |
164 | for (i = 0; i < d; i++) { | |
165 | for (j = 0; j < d; j++) { | |
166 | u8 val = slit->entry[d*i + j]; | |
167 | if (i == j) { | |
168 | if (val != LOCAL_DISTANCE) | |
169 | return 0; | |
170 | } else if (val <= LOCAL_DISTANCE) | |
171 | return 0; | |
172 | } | |
173 | } | |
174 | return 1; | |
175 | } | |
176 | ||
15a58ed1 | 177 | static int __init acpi_parse_slit(struct acpi_table_header *table) |
1da177e4 | 178 | { |
4be44fcd | 179 | struct acpi_table_slit *slit; |
1da177e4 | 180 | |
15a58ed1 | 181 | if (!table) |
1da177e4 LT |
182 | return -EINVAL; |
183 | ||
15a58ed1 | 184 | slit = (struct acpi_table_slit *)table; |
1da177e4 | 185 | |
39b8931b FY |
186 | if (!slit_valid(slit)) { |
187 | printk(KERN_INFO "ACPI: SLIT table looks invalid. Not used.\n"); | |
188 | return -EINVAL; | |
189 | } | |
1da177e4 LT |
190 | acpi_numa_slit_init(slit); |
191 | ||
192 | return 0; | |
193 | } | |
194 | ||
7237d3de SS |
195 | void __init __attribute__ ((weak)) |
196 | acpi_numa_x2apic_affinity_init(struct acpi_srat_x2apic_cpu_affinity *pa) | |
197 | { | |
198 | printk(KERN_WARNING PREFIX | |
199 | "Found unsupported x2apic [0x%08x] SRAT entry\n", pa->apic_id); | |
200 | return; | |
201 | } | |
202 | ||
203 | ||
204 | static int __init | |
205 | acpi_parse_x2apic_affinity(struct acpi_subtable_header *header, | |
206 | const unsigned long end) | |
207 | { | |
208 | struct acpi_srat_x2apic_cpu_affinity *processor_affinity; | |
209 | ||
210 | processor_affinity = (struct acpi_srat_x2apic_cpu_affinity *)header; | |
211 | if (!processor_affinity) | |
212 | return -EINVAL; | |
213 | ||
214 | acpi_table_print_srat_entry(header); | |
215 | ||
216 | /* let architecture-dependent part to do it */ | |
217 | acpi_numa_x2apic_affinity_init(processor_affinity); | |
218 | ||
219 | return 0; | |
220 | } | |
221 | ||
1da177e4 | 222 | static int __init |
7237d3de | 223 | acpi_parse_processor_affinity(struct acpi_subtable_header *header, |
4be44fcd | 224 | const unsigned long end) |
1da177e4 | 225 | { |
15a58ed1 | 226 | struct acpi_srat_cpu_affinity *processor_affinity; |
1da177e4 | 227 | |
15a58ed1 | 228 | processor_affinity = (struct acpi_srat_cpu_affinity *)header; |
1da177e4 LT |
229 | if (!processor_affinity) |
230 | return -EINVAL; | |
231 | ||
232 | acpi_table_print_srat_entry(header); | |
233 | ||
234 | /* let architecture-dependent part to do it */ | |
235 | acpi_numa_processor_affinity_init(processor_affinity); | |
236 | ||
237 | return 0; | |
238 | } | |
239 | ||
1da177e4 | 240 | static int __init |
15a58ed1 | 241 | acpi_parse_memory_affinity(struct acpi_subtable_header * header, |
4be44fcd | 242 | const unsigned long end) |
1da177e4 | 243 | { |
15a58ed1 | 244 | struct acpi_srat_mem_affinity *memory_affinity; |
1da177e4 | 245 | |
15a58ed1 | 246 | memory_affinity = (struct acpi_srat_mem_affinity *)header; |
1da177e4 LT |
247 | if (!memory_affinity) |
248 | return -EINVAL; | |
249 | ||
250 | acpi_table_print_srat_entry(header); | |
251 | ||
252 | /* let architecture-dependent part to do it */ | |
253 | acpi_numa_memory_affinity_init(memory_affinity); | |
254 | ||
255 | return 0; | |
256 | } | |
257 | ||
15a58ed1 | 258 | static int __init acpi_parse_srat(struct acpi_table_header *table) |
1da177e4 | 259 | { |
8df0eb7c | 260 | struct acpi_table_srat *srat; |
15a58ed1 | 261 | if (!table) |
1da177e4 LT |
262 | return -EINVAL; |
263 | ||
8df0eb7c KG |
264 | srat = (struct acpi_table_srat *)table; |
265 | acpi_srat_revision = srat->header.revision; | |
266 | ||
cfa806f0 | 267 | /* Real work done in acpi_table_parse_srat below. */ |
1da177e4 LT |
268 | |
269 | return 0; | |
270 | } | |
271 | ||
ae2c6dcf | 272 | static int __init |
15a58ed1 | 273 | acpi_table_parse_srat(enum acpi_srat_type id, |
5a8765a8 | 274 | acpi_table_entry_handler handler, unsigned int max_entries) |
1da177e4 | 275 | { |
6eb87fed | 276 | return acpi_table_parse_entries(ACPI_SIG_SRAT, |
4be44fcd LB |
277 | sizeof(struct acpi_table_srat), id, |
278 | handler, max_entries); | |
1da177e4 LT |
279 | } |
280 | ||
4be44fcd | 281 | int __init acpi_numa_init(void) |
1da177e4 | 282 | { |
940fed2e | 283 | int cnt = 0; |
d3bd0588 | 284 | |
d3bd0588 YL |
285 | /* |
286 | * Should not limit number with cpu num that is from NR_CPUS or nr_cpus= | |
287 | * SRAT cpu entries could have different order with that in MADT. | |
288 | * So go over all cpu entries in SRAT to get apicid to node mapping. | |
289 | */ | |
8716273c | 290 | |
1da177e4 | 291 | /* SRAT: Static Resource Affinity Table */ |
7f8f97c3 | 292 | if (!acpi_table_parse(ACPI_SIG_SRAT, acpi_parse_srat)) { |
7237d3de | 293 | acpi_table_parse_srat(ACPI_SRAT_TYPE_X2APIC_CPU_AFFINITY, |
9378b63c | 294 | acpi_parse_x2apic_affinity, 0); |
ae2c6dcf | 295 | acpi_table_parse_srat(ACPI_SRAT_TYPE_CPU_AFFINITY, |
9378b63c | 296 | acpi_parse_processor_affinity, 0); |
940fed2e | 297 | cnt = acpi_table_parse_srat(ACPI_SRAT_TYPE_MEMORY_AFFINITY, |
8716273c DR |
298 | acpi_parse_memory_affinity, |
299 | NR_NODE_MEMBLKS); | |
1da177e4 LT |
300 | } |
301 | ||
302 | /* SLIT: System Locality Information Table */ | |
7f8f97c3 | 303 | acpi_table_parse(ACPI_SIG_SLIT, acpi_parse_slit); |
1da177e4 LT |
304 | |
305 | acpi_numa_arch_fixup(); | |
940fed2e TH |
306 | |
307 | if (cnt <= 0) | |
308 | return cnt ?: -ENOENT; | |
309 | return 0; | |
1da177e4 LT |
310 | } |
311 | ||
7e81ab9d | 312 | int acpi_get_pxm(acpi_handle h) |
1da177e4 | 313 | { |
27663c58 | 314 | unsigned long long pxm; |
1da177e4 LT |
315 | acpi_status status; |
316 | acpi_handle handle; | |
317 | acpi_handle phandle = h; | |
318 | ||
319 | do { | |
320 | handle = phandle; | |
321 | status = acpi_evaluate_integer(handle, "_PXM", NULL, &pxm); | |
322 | if (ACPI_SUCCESS(status)) | |
50dd0969 | 323 | return pxm; |
1da177e4 | 324 | status = acpi_get_parent(handle, &phandle); |
4be44fcd | 325 | } while (ACPI_SUCCESS(status)); |
1da177e4 LT |
326 | return -1; |
327 | } | |
1e3590e2 | 328 | |
7e81ab9d | 329 | int acpi_get_node(acpi_handle *handle) |
1e3590e2 YG |
330 | { |
331 | int pxm, node = -1; | |
332 | ||
1e3590e2 | 333 | pxm = acpi_get_pxm(handle); |
27ce3419 | 334 | if (pxm >= 0 && pxm < MAX_PXM_DOMAINS) |
1e3590e2 YG |
335 | node = acpi_map_pxm_to_node(pxm); |
336 | ||
635227ee | 337 | return node; |
1e3590e2 YG |
338 | } |
339 | EXPORT_SYMBOL(acpi_get_node); |