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
36 ACPI_MODULE_NAME("numa");
37
38 static nodemask_t nodes_found_map = NODE_MASK_NONE;
39
40 /* maps to convert between proximity domain and logical node ID */
41 static int pxm_to_node_map[MAX_PXM_DOMAINS]
42 = { [0 ... MAX_PXM_DOMAINS - 1] = NID_INVAL };
43 static int node_to_pxm_map[MAX_NUMNODES]
44 = { [0 ... MAX_NUMNODES - 1] = PXM_INVAL };
45
46 int pxm_to_node(int pxm)
47 {
48 if (pxm < 0)
49 return NID_INVAL;
50 return pxm_to_node_map[pxm];
51 }
52
53 int node_to_pxm(int node)
54 {
55 if (node < 0)
56 return PXM_INVAL;
57 return node_to_pxm_map[node];
58 }
59
60 void __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
66 int 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
82 void __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
91 static void __init
92 acpi_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 type 0x%x) in proximity domain %d %s%s\n",
124 (unsigned long)p->base_address,
125 (unsigned long)p->length,
126 p->memory_type, 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 static int __init acpi_parse_slit(struct acpi_table_header *table)
144 {
145 struct acpi_table_slit *slit;
146 u32 localities;
147
148 if (!table)
149 return -EINVAL;
150
151 slit = (struct acpi_table_slit *)table;
152
153 /* downcast just for %llu vs %lu for i386/ia64 */
154 localities = (u32) slit->locality_count;
155
156 acpi_numa_slit_init(slit);
157
158 return 0;
159 }
160
161 static int __init
162 acpi_parse_processor_affinity(struct acpi_subtable_header * header,
163 const unsigned long end)
164 {
165 struct acpi_srat_cpu_affinity *processor_affinity;
166
167 processor_affinity = (struct acpi_srat_cpu_affinity *)header;
168 if (!processor_affinity)
169 return -EINVAL;
170
171 acpi_table_print_srat_entry(header);
172
173 /* let architecture-dependent part to do it */
174 acpi_numa_processor_affinity_init(processor_affinity);
175
176 return 0;
177 }
178
179 static int __init
180 acpi_parse_memory_affinity(struct acpi_subtable_header * header,
181 const unsigned long end)
182 {
183 struct acpi_srat_mem_affinity *memory_affinity;
184
185 memory_affinity = (struct acpi_srat_mem_affinity *)header;
186 if (!memory_affinity)
187 return -EINVAL;
188
189 acpi_table_print_srat_entry(header);
190
191 /* let architecture-dependent part to do it */
192 acpi_numa_memory_affinity_init(memory_affinity);
193
194 return 0;
195 }
196
197 static int __init acpi_parse_srat(struct acpi_table_header *table)
198 {
199 struct acpi_table_srat *srat;
200
201 if (!table)
202 return -EINVAL;
203
204 srat = (struct acpi_table_srat *)table;
205
206 return 0;
207 }
208
209 static int __init
210 acpi_table_parse_srat(enum acpi_srat_type id,
211 acpi_table_entry_handler handler, unsigned int max_entries)
212 {
213 return acpi_table_parse_entries(ACPI_SIG_SRAT,
214 sizeof(struct acpi_table_srat), id,
215 handler, max_entries);
216 }
217
218 int __init acpi_numa_init(void)
219 {
220 /* SRAT: Static Resource Affinity Table */
221 if (!acpi_table_parse(ACPI_SIG_SRAT, acpi_parse_srat)) {
222 acpi_table_parse_srat(ACPI_SRAT_TYPE_CPU_AFFINITY,
223 acpi_parse_processor_affinity, NR_CPUS);
224 acpi_table_parse_srat(ACPI_SRAT_TYPE_MEMORY_AFFINITY,
225 acpi_parse_memory_affinity,
226 NR_NODE_MEMBLKS);
227 }
228
229 /* SLIT: System Locality Information Table */
230 acpi_table_parse(ACPI_SIG_SLIT, acpi_parse_slit);
231
232 acpi_numa_arch_fixup();
233 return 0;
234 }
235
236 int acpi_get_pxm(acpi_handle h)
237 {
238 unsigned long pxm;
239 acpi_status status;
240 acpi_handle handle;
241 acpi_handle phandle = h;
242
243 do {
244 handle = phandle;
245 status = acpi_evaluate_integer(handle, "_PXM", NULL, &pxm);
246 if (ACPI_SUCCESS(status))
247 return pxm;
248 status = acpi_get_parent(handle, &phandle);
249 } while (ACPI_SUCCESS(status));
250 return -1;
251 }
252
253 int acpi_get_node(acpi_handle *handle)
254 {
255 int pxm, node = -1;
256
257 pxm = acpi_get_pxm(handle);
258 if (pxm >= 0)
259 node = acpi_map_pxm_to_node(pxm);
260
261 return node;
262 }
263 EXPORT_SYMBOL(acpi_get_node);
264
|
This page was automatically generated by the
LXR engine.
|