2 * acpi_numa.c - ACPI NUMA support
4 * Copyright (C) 2002 Takayoshi Kochi <t-kochi@bq.jp.nec.com>
6 * ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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.
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.
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
22 * ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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 <linux/numa.h>
32 #include <acpi/acpi_bus.h>
34 #define PREFIX "ACPI: "
36 #define ACPI_NUMA 0x80000000
37 #define _COMPONENT ACPI_NUMA
38 ACPI_MODULE_NAME("numa");
40 static nodemask_t nodes_found_map
= NODE_MASK_NONE
;
42 /* maps to convert between proximity domain and logical node ID */
43 static int pxm_to_node_map
[MAX_PXM_DOMAINS
]
44 = { [0 ... MAX_PXM_DOMAINS
- 1] = NUMA_NO_NODE
};
45 static int node_to_pxm_map
[MAX_NUMNODES
]
46 = { [0 ... MAX_NUMNODES
- 1] = PXM_INVAL
};
48 unsigned char acpi_srat_revision __initdata
;
50 int pxm_to_node(int pxm
)
54 return pxm_to_node_map
[pxm
];
57 int node_to_pxm(int node
)
61 return node_to_pxm_map
[node
];
64 void __acpi_map_pxm_to_node(int pxm
, int node
)
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
;
72 int acpi_map_pxm_to_node(int pxm
)
74 int node
= pxm_to_node_map
[pxm
];
77 if (nodes_weight(nodes_found_map
) >= MAX_NUMNODES
)
79 node
= first_unset_node(nodes_found_map
);
80 __acpi_map_pxm_to_node(pxm
, node
);
81 node_set(node
, nodes_found_map
);
88 acpi_table_print_srat_entry(struct acpi_subtable_header
*header
)
91 ACPI_FUNCTION_NAME("acpi_table_print_srat_entry");
96 switch (header
->type
) {
98 case ACPI_SRAT_TYPE_CPU_AFFINITY
:
99 #ifdef ACPI_DEBUG_OUTPUT
101 struct acpi_srat_cpu_affinity
*p
=
102 (struct acpi_srat_cpu_affinity
*)header
;
103 ACPI_DEBUG_PRINT((ACPI_DB_INFO
,
104 "SRAT Processor (id[0x%02x] eid[0x%02x]) in proximity domain %d %s\n",
105 p
->apic_id
, p
->local_sapic_eid
,
106 p
->proximity_domain_lo
,
107 (p
->flags
& ACPI_SRAT_CPU_ENABLED
)?
108 "enabled" : "disabled"));
110 #endif /* ACPI_DEBUG_OUTPUT */
113 case ACPI_SRAT_TYPE_MEMORY_AFFINITY
:
114 #ifdef ACPI_DEBUG_OUTPUT
116 struct acpi_srat_mem_affinity
*p
=
117 (struct acpi_srat_mem_affinity
*)header
;
118 ACPI_DEBUG_PRINT((ACPI_DB_INFO
,
119 "SRAT Memory (0x%lx length 0x%lx) in proximity domain %d %s%s\n",
120 (unsigned long)p
->base_address
,
121 (unsigned long)p
->length
,
123 (p
->flags
& ACPI_SRAT_MEM_ENABLED
)?
124 "enabled" : "disabled",
125 (p
->flags
& ACPI_SRAT_MEM_HOT_PLUGGABLE
)?
126 " hot-pluggable" : ""));
128 #endif /* ACPI_DEBUG_OUTPUT */
131 case ACPI_SRAT_TYPE_X2APIC_CPU_AFFINITY
:
132 #ifdef ACPI_DEBUG_OUTPUT
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",
141 (p
->flags
& ACPI_SRAT_CPU_ENABLED
) ?
142 "enabled" : "disabled"));
144 #endif /* ACPI_DEBUG_OUTPUT */
147 printk(KERN_WARNING PREFIX
148 "Found unsupported SRAT entry (type = 0x%x)\n",
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.
160 static __init
int slit_valid(struct acpi_table_slit
*slit
)
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
];
168 if (val
!= LOCAL_DISTANCE
)
170 } else if (val
<= LOCAL_DISTANCE
)
177 static int __init
acpi_parse_slit(struct acpi_table_header
*table
)
179 struct acpi_table_slit
*slit
;
184 slit
= (struct acpi_table_slit
*)table
;
186 if (!slit_valid(slit
)) {
187 printk(KERN_INFO
"ACPI: SLIT table looks invalid. Not used.\n");
190 acpi_numa_slit_init(slit
);
195 void __init
__attribute__ ((weak
))
196 acpi_numa_x2apic_affinity_init(struct acpi_srat_x2apic_cpu_affinity
*pa
)
198 printk(KERN_WARNING PREFIX
199 "Found unsupported x2apic [0x%08x] SRAT entry\n", pa
->apic_id
);
205 acpi_parse_x2apic_affinity(struct acpi_subtable_header
*header
,
206 const unsigned long end
)
208 struct acpi_srat_x2apic_cpu_affinity
*processor_affinity
;
210 processor_affinity
= (struct acpi_srat_x2apic_cpu_affinity
*)header
;
211 if (!processor_affinity
)
214 acpi_table_print_srat_entry(header
);
216 /* let architecture-dependent part to do it */
217 acpi_numa_x2apic_affinity_init(processor_affinity
);
223 acpi_parse_processor_affinity(struct acpi_subtable_header
*header
,
224 const unsigned long end
)
226 struct acpi_srat_cpu_affinity
*processor_affinity
;
228 processor_affinity
= (struct acpi_srat_cpu_affinity
*)header
;
229 if (!processor_affinity
)
232 acpi_table_print_srat_entry(header
);
234 /* let architecture-dependent part to do it */
235 acpi_numa_processor_affinity_init(processor_affinity
);
240 static int __initdata parsed_numa_memblks
;
243 acpi_parse_memory_affinity(struct acpi_subtable_header
* header
,
244 const unsigned long end
)
246 struct acpi_srat_mem_affinity
*memory_affinity
;
248 memory_affinity
= (struct acpi_srat_mem_affinity
*)header
;
249 if (!memory_affinity
)
252 acpi_table_print_srat_entry(header
);
254 /* let architecture-dependent part to do it */
255 if (!acpi_numa_memory_affinity_init(memory_affinity
))
256 parsed_numa_memblks
++;
260 static int __init
acpi_parse_srat(struct acpi_table_header
*table
)
262 struct acpi_table_srat
*srat
;
266 srat
= (struct acpi_table_srat
*)table
;
267 acpi_srat_revision
= srat
->header
.revision
;
269 /* Real work done in acpi_table_parse_srat below. */
275 acpi_table_parse_srat(enum acpi_srat_type id
,
276 acpi_table_entry_handler handler
, unsigned int max_entries
)
278 return acpi_table_parse_entries(ACPI_SIG_SRAT
,
279 sizeof(struct acpi_table_srat
), id
,
280 handler
, max_entries
);
283 int __init
acpi_numa_init(void)
288 * Should not limit number with cpu num that is from NR_CPUS or nr_cpus=
289 * SRAT cpu entries could have different order with that in MADT.
290 * So go over all cpu entries in SRAT to get apicid to node mapping.
293 /* SRAT: Static Resource Affinity Table */
294 if (!acpi_table_parse(ACPI_SIG_SRAT
, acpi_parse_srat
)) {
295 acpi_table_parse_srat(ACPI_SRAT_TYPE_X2APIC_CPU_AFFINITY
,
296 acpi_parse_x2apic_affinity
, 0);
297 acpi_table_parse_srat(ACPI_SRAT_TYPE_CPU_AFFINITY
,
298 acpi_parse_processor_affinity
, 0);
299 cnt
= acpi_table_parse_srat(ACPI_SRAT_TYPE_MEMORY_AFFINITY
,
300 acpi_parse_memory_affinity
,
304 /* SLIT: System Locality Information Table */
305 acpi_table_parse(ACPI_SIG_SLIT
, acpi_parse_slit
);
307 acpi_numa_arch_fixup();
311 else if (!parsed_numa_memblks
)
316 int acpi_get_pxm(acpi_handle h
)
318 unsigned long long pxm
;
321 acpi_handle phandle
= h
;
325 status
= acpi_evaluate_integer(handle
, "_PXM", NULL
, &pxm
);
326 if (ACPI_SUCCESS(status
))
328 status
= acpi_get_parent(handle
, &phandle
);
329 } while (ACPI_SUCCESS(status
));
333 int acpi_get_node(acpi_handle
*handle
)
337 pxm
= acpi_get_pxm(handle
);
338 if (pxm
>= 0 && pxm
< MAX_PXM_DOMAINS
)
339 node
= acpi_map_pxm_to_node(pxm
);
343 EXPORT_SYMBOL(acpi_get_node
);