]>
Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * pSeries NUMA support | |
3 | * | |
4 | * Copyright (C) 2002 Anton Blanchard <anton@au.ibm.com>, IBM | |
5 | * | |
6 | * This program is free software; you can redistribute it and/or | |
7 | * modify it under the terms of the GNU General Public License | |
8 | * as published by the Free Software Foundation; either version | |
9 | * 2 of the License, or (at your option) any later version. | |
10 | */ | |
2d73bae1 NA |
11 | #define pr_fmt(fmt) "numa: " fmt |
12 | ||
1da177e4 LT |
13 | #include <linux/threads.h> |
14 | #include <linux/bootmem.h> | |
15 | #include <linux/init.h> | |
16 | #include <linux/mm.h> | |
17 | #include <linux/mmzone.h> | |
4b16f8e2 | 18 | #include <linux/export.h> |
1da177e4 LT |
19 | #include <linux/nodemask.h> |
20 | #include <linux/cpu.h> | |
21 | #include <linux/notifier.h> | |
95f72d1e | 22 | #include <linux/memblock.h> |
6df1646e | 23 | #include <linux/of.h> |
06eccea6 | 24 | #include <linux/pfn.h> |
9eff1a38 JL |
25 | #include <linux/cpuset.h> |
26 | #include <linux/node.h> | |
30c05350 | 27 | #include <linux/stop_machine.h> |
e04fa612 NF |
28 | #include <linux/proc_fs.h> |
29 | #include <linux/seq_file.h> | |
30 | #include <linux/uaccess.h> | |
191a7120 | 31 | #include <linux/slab.h> |
3be7db6a | 32 | #include <asm/cputhreads.h> |
45fb6cea | 33 | #include <asm/sparsemem.h> |
d9b2b2a2 | 34 | #include <asm/prom.h> |
2249ca9d | 35 | #include <asm/smp.h> |
d4edc5b6 SB |
36 | #include <asm/cputhreads.h> |
37 | #include <asm/topology.h> | |
9eff1a38 JL |
38 | #include <asm/firmware.h> |
39 | #include <asm/paca.h> | |
39bf990e | 40 | #include <asm/hvcall.h> |
ae3a197e | 41 | #include <asm/setup.h> |
176bbf14 | 42 | #include <asm/vdso.h> |
1da177e4 LT |
43 | |
44 | static int numa_enabled = 1; | |
45 | ||
1daa6d08 BS |
46 | static char *cmdline __initdata; |
47 | ||
1da177e4 LT |
48 | static int numa_debug; |
49 | #define dbg(args...) if (numa_debug) { printk(KERN_INFO args); } | |
50 | ||
45fb6cea | 51 | int numa_cpu_lookup_table[NR_CPUS]; |
25863de0 | 52 | cpumask_var_t node_to_cpumask_map[MAX_NUMNODES]; |
1da177e4 | 53 | struct pglist_data *node_data[MAX_NUMNODES]; |
45fb6cea AB |
54 | |
55 | EXPORT_SYMBOL(numa_cpu_lookup_table); | |
25863de0 | 56 | EXPORT_SYMBOL(node_to_cpumask_map); |
45fb6cea AB |
57 | EXPORT_SYMBOL(node_data); |
58 | ||
1da177e4 | 59 | static int min_common_depth; |
237a0989 | 60 | static int n_mem_addr_cells, n_mem_size_cells; |
41eab6f8 AB |
61 | static int form1_affinity; |
62 | ||
63 | #define MAX_DISTANCE_REF_POINTS 4 | |
64 | static int distance_ref_points_depth; | |
b08a2a12 | 65 | static const __be32 *distance_ref_points; |
41eab6f8 | 66 | static int distance_lookup_table[MAX_NUMNODES][MAX_DISTANCE_REF_POINTS]; |
1da177e4 | 67 | |
25863de0 AB |
68 | /* |
69 | * Allocate node_to_cpumask_map based on number of available nodes | |
70 | * Requires node_possible_map to be valid. | |
71 | * | |
9512938b | 72 | * Note: cpumask_of_node() is not valid until after this is done. |
25863de0 AB |
73 | */ |
74 | static void __init setup_node_to_cpumask_map(void) | |
75 | { | |
f9d531b8 | 76 | unsigned int node; |
25863de0 AB |
77 | |
78 | /* setup nr_node_ids if not done yet */ | |
f9d531b8 CS |
79 | if (nr_node_ids == MAX_NUMNODES) |
80 | setup_nr_node_ids(); | |
25863de0 AB |
81 | |
82 | /* allocate the map */ | |
83 | for (node = 0; node < nr_node_ids; node++) | |
84 | alloc_bootmem_cpumask_var(&node_to_cpumask_map[node]); | |
85 | ||
86 | /* cpumask_of_node() will now work */ | |
87 | dbg("Node to cpumask map for %d nodes\n", nr_node_ids); | |
88 | } | |
89 | ||
55671f3c | 90 | static int __init fake_numa_create_new_node(unsigned long end_pfn, |
1daa6d08 BS |
91 | unsigned int *nid) |
92 | { | |
93 | unsigned long long mem; | |
94 | char *p = cmdline; | |
95 | static unsigned int fake_nid; | |
96 | static unsigned long long curr_boundary; | |
97 | ||
98 | /* | |
99 | * Modify node id, iff we started creating NUMA nodes | |
100 | * We want to continue from where we left of the last time | |
101 | */ | |
102 | if (fake_nid) | |
103 | *nid = fake_nid; | |
104 | /* | |
105 | * In case there are no more arguments to parse, the | |
106 | * node_id should be the same as the last fake node id | |
107 | * (we've handled this above). | |
108 | */ | |
109 | if (!p) | |
110 | return 0; | |
111 | ||
112 | mem = memparse(p, &p); | |
113 | if (!mem) | |
114 | return 0; | |
115 | ||
116 | if (mem < curr_boundary) | |
117 | return 0; | |
118 | ||
119 | curr_boundary = mem; | |
120 | ||
121 | if ((end_pfn << PAGE_SHIFT) > mem) { | |
122 | /* | |
123 | * Skip commas and spaces | |
124 | */ | |
125 | while (*p == ',' || *p == ' ' || *p == '\t') | |
126 | p++; | |
127 | ||
128 | cmdline = p; | |
129 | fake_nid++; | |
130 | *nid = fake_nid; | |
131 | dbg("created new fake_node with id %d\n", fake_nid); | |
132 | return 1; | |
133 | } | |
134 | return 0; | |
135 | } | |
136 | ||
d4edc5b6 SB |
137 | static void reset_numa_cpu_lookup_table(void) |
138 | { | |
139 | unsigned int cpu; | |
140 | ||
141 | for_each_possible_cpu(cpu) | |
142 | numa_cpu_lookup_table[cpu] = -1; | |
143 | } | |
144 | ||
145 | static void update_numa_cpu_lookup_table(unsigned int cpu, int node) | |
1da177e4 LT |
146 | { |
147 | numa_cpu_lookup_table[cpu] = node; | |
d4edc5b6 SB |
148 | } |
149 | ||
150 | static void map_cpu_to_node(int cpu, int node) | |
151 | { | |
152 | update_numa_cpu_lookup_table(cpu, node); | |
45fb6cea | 153 | |
bf4b85b0 NL |
154 | dbg("adding cpu %d to node %d\n", cpu, node); |
155 | ||
25863de0 AB |
156 | if (!(cpumask_test_cpu(cpu, node_to_cpumask_map[node]))) |
157 | cpumask_set_cpu(cpu, node_to_cpumask_map[node]); | |
1da177e4 LT |
158 | } |
159 | ||
39bf990e | 160 | #if defined(CONFIG_HOTPLUG_CPU) || defined(CONFIG_PPC_SPLPAR) |
1da177e4 LT |
161 | static void unmap_cpu_from_node(unsigned long cpu) |
162 | { | |
163 | int node = numa_cpu_lookup_table[cpu]; | |
164 | ||
165 | dbg("removing cpu %lu from node %d\n", cpu, node); | |
166 | ||
25863de0 | 167 | if (cpumask_test_cpu(cpu, node_to_cpumask_map[node])) { |
429f4d8d | 168 | cpumask_clear_cpu(cpu, node_to_cpumask_map[node]); |
1da177e4 LT |
169 | } else { |
170 | printk(KERN_ERR "WARNING: cpu %lu not found in node %d\n", | |
171 | cpu, node); | |
172 | } | |
173 | } | |
39bf990e | 174 | #endif /* CONFIG_HOTPLUG_CPU || CONFIG_PPC_SPLPAR */ |
1da177e4 | 175 | |
1da177e4 | 176 | /* must hold reference to node during call */ |
b08a2a12 | 177 | static const __be32 *of_get_associativity(struct device_node *dev) |
1da177e4 | 178 | { |
e2eb6392 | 179 | return of_get_property(dev, "ibm,associativity", NULL); |
1da177e4 LT |
180 | } |
181 | ||
cf00085d C |
182 | /* |
183 | * Returns the property linux,drconf-usable-memory if | |
184 | * it exists (the property exists only in kexec/kdump kernels, | |
185 | * added by kexec-tools) | |
186 | */ | |
b08a2a12 | 187 | static const __be32 *of_get_usable_memory(struct device_node *memory) |
cf00085d | 188 | { |
b08a2a12 | 189 | const __be32 *prop; |
cf00085d C |
190 | u32 len; |
191 | prop = of_get_property(memory, "linux,drconf-usable-memory", &len); | |
192 | if (!prop || len < sizeof(unsigned int)) | |
ec32dd66 | 193 | return NULL; |
cf00085d C |
194 | return prop; |
195 | } | |
196 | ||
41eab6f8 AB |
197 | int __node_distance(int a, int b) |
198 | { | |
199 | int i; | |
200 | int distance = LOCAL_DISTANCE; | |
201 | ||
202 | if (!form1_affinity) | |
7122beee | 203 | return ((a == b) ? LOCAL_DISTANCE : REMOTE_DISTANCE); |
41eab6f8 AB |
204 | |
205 | for (i = 0; i < distance_ref_points_depth; i++) { | |
206 | if (distance_lookup_table[a][i] == distance_lookup_table[b][i]) | |
207 | break; | |
208 | ||
209 | /* Double the distance for each NUMA level */ | |
210 | distance *= 2; | |
211 | } | |
212 | ||
213 | return distance; | |
214 | } | |
12c743eb | 215 | EXPORT_SYMBOL(__node_distance); |
41eab6f8 AB |
216 | |
217 | static void initialize_distance_lookup_table(int nid, | |
b08a2a12 | 218 | const __be32 *associativity) |
41eab6f8 AB |
219 | { |
220 | int i; | |
221 | ||
222 | if (!form1_affinity) | |
223 | return; | |
224 | ||
225 | for (i = 0; i < distance_ref_points_depth; i++) { | |
b08a2a12 AP |
226 | const __be32 *entry; |
227 | ||
1d805440 | 228 | entry = &associativity[be32_to_cpu(distance_ref_points[i]) - 1]; |
b08a2a12 | 229 | distance_lookup_table[nid][i] = of_read_number(entry, 1); |
41eab6f8 AB |
230 | } |
231 | } | |
232 | ||
482ec7c4 NL |
233 | /* Returns nid in the range [0..MAX_NUMNODES-1], or -1 if no useful numa |
234 | * info is found. | |
235 | */ | |
b08a2a12 | 236 | static int associativity_to_nid(const __be32 *associativity) |
1da177e4 | 237 | { |
482ec7c4 | 238 | int nid = -1; |
1da177e4 LT |
239 | |
240 | if (min_common_depth == -1) | |
482ec7c4 | 241 | goto out; |
1da177e4 | 242 | |
b08a2a12 AP |
243 | if (of_read_number(associativity, 1) >= min_common_depth) |
244 | nid = of_read_number(&associativity[min_common_depth], 1); | |
bc16a759 NL |
245 | |
246 | /* POWER4 LPAR uses 0xffff as invalid node */ | |
482ec7c4 NL |
247 | if (nid == 0xffff || nid >= MAX_NUMNODES) |
248 | nid = -1; | |
41eab6f8 | 249 | |
b08a2a12 | 250 | if (nid > 0 && |
1d805440 ND |
251 | of_read_number(associativity, 1) >= distance_ref_points_depth) { |
252 | /* | |
253 | * Skip the length field and send start of associativity array | |
254 | */ | |
255 | initialize_distance_lookup_table(nid, associativity + 1); | |
256 | } | |
41eab6f8 | 257 | |
482ec7c4 | 258 | out: |
cf950b7a | 259 | return nid; |
1da177e4 LT |
260 | } |
261 | ||
9eff1a38 JL |
262 | /* Returns the nid associated with the given device tree node, |
263 | * or -1 if not found. | |
264 | */ | |
265 | static int of_node_to_nid_single(struct device_node *device) | |
266 | { | |
267 | int nid = -1; | |
b08a2a12 | 268 | const __be32 *tmp; |
9eff1a38 JL |
269 | |
270 | tmp = of_get_associativity(device); | |
271 | if (tmp) | |
272 | nid = associativity_to_nid(tmp); | |
273 | return nid; | |
274 | } | |
275 | ||
953039c8 JK |
276 | /* Walk the device tree upwards, looking for an associativity id */ |
277 | int of_node_to_nid(struct device_node *device) | |
278 | { | |
279 | struct device_node *tmp; | |
280 | int nid = -1; | |
281 | ||
282 | of_node_get(device); | |
283 | while (device) { | |
284 | nid = of_node_to_nid_single(device); | |
285 | if (nid != -1) | |
286 | break; | |
287 | ||
288 | tmp = device; | |
289 | device = of_get_parent(tmp); | |
290 | of_node_put(tmp); | |
291 | } | |
292 | of_node_put(device); | |
293 | ||
294 | return nid; | |
295 | } | |
296 | EXPORT_SYMBOL_GPL(of_node_to_nid); | |
297 | ||
1da177e4 LT |
298 | static int __init find_min_common_depth(void) |
299 | { | |
41eab6f8 | 300 | int depth; |
e70606eb | 301 | struct device_node *root; |
1da177e4 | 302 | |
1c8ee733 DS |
303 | if (firmware_has_feature(FW_FEATURE_OPAL)) |
304 | root = of_find_node_by_path("/ibm,opal"); | |
305 | else | |
306 | root = of_find_node_by_path("/rtas"); | |
e70606eb ME |
307 | if (!root) |
308 | root = of_find_node_by_path("/"); | |
1da177e4 LT |
309 | |
310 | /* | |
41eab6f8 AB |
311 | * This property is a set of 32-bit integers, each representing |
312 | * an index into the ibm,associativity nodes. | |
313 | * | |
314 | * With form 0 affinity the first integer is for an SMP configuration | |
315 | * (should be all 0's) and the second is for a normal NUMA | |
316 | * configuration. We have only one level of NUMA. | |
317 | * | |
318 | * With form 1 affinity the first integer is the most significant | |
319 | * NUMA boundary and the following are progressively less significant | |
320 | * boundaries. There can be more than one level of NUMA. | |
1da177e4 | 321 | */ |
e70606eb | 322 | distance_ref_points = of_get_property(root, |
41eab6f8 AB |
323 | "ibm,associativity-reference-points", |
324 | &distance_ref_points_depth); | |
325 | ||
326 | if (!distance_ref_points) { | |
327 | dbg("NUMA: ibm,associativity-reference-points not found.\n"); | |
328 | goto err; | |
329 | } | |
330 | ||
331 | distance_ref_points_depth /= sizeof(int); | |
1da177e4 | 332 | |
8002b0c5 NF |
333 | if (firmware_has_feature(FW_FEATURE_OPAL) || |
334 | firmware_has_feature(FW_FEATURE_TYPE1_AFFINITY)) { | |
335 | dbg("Using form 1 affinity\n"); | |
1c8ee733 | 336 | form1_affinity = 1; |
4b83c330 AB |
337 | } |
338 | ||
41eab6f8 | 339 | if (form1_affinity) { |
b08a2a12 | 340 | depth = of_read_number(distance_ref_points, 1); |
1da177e4 | 341 | } else { |
41eab6f8 AB |
342 | if (distance_ref_points_depth < 2) { |
343 | printk(KERN_WARNING "NUMA: " | |
344 | "short ibm,associativity-reference-points\n"); | |
345 | goto err; | |
346 | } | |
347 | ||
b08a2a12 | 348 | depth = of_read_number(&distance_ref_points[1], 1); |
1da177e4 | 349 | } |
1da177e4 | 350 | |
41eab6f8 AB |
351 | /* |
352 | * Warn and cap if the hardware supports more than | |
353 | * MAX_DISTANCE_REF_POINTS domains. | |
354 | */ | |
355 | if (distance_ref_points_depth > MAX_DISTANCE_REF_POINTS) { | |
356 | printk(KERN_WARNING "NUMA: distance array capped at " | |
357 | "%d entries\n", MAX_DISTANCE_REF_POINTS); | |
358 | distance_ref_points_depth = MAX_DISTANCE_REF_POINTS; | |
359 | } | |
360 | ||
e70606eb | 361 | of_node_put(root); |
1da177e4 | 362 | return depth; |
41eab6f8 AB |
363 | |
364 | err: | |
e70606eb | 365 | of_node_put(root); |
41eab6f8 | 366 | return -1; |
1da177e4 LT |
367 | } |
368 | ||
84c9fdd1 | 369 | static void __init get_n_mem_cells(int *n_addr_cells, int *n_size_cells) |
1da177e4 LT |
370 | { |
371 | struct device_node *memory = NULL; | |
1da177e4 LT |
372 | |
373 | memory = of_find_node_by_type(memory, "memory"); | |
54c23310 | 374 | if (!memory) |
84c9fdd1 | 375 | panic("numa.c: No memory nodes found!"); |
54c23310 | 376 | |
a8bda5dd | 377 | *n_addr_cells = of_n_addr_cells(memory); |
9213feea | 378 | *n_size_cells = of_n_size_cells(memory); |
84c9fdd1 | 379 | of_node_put(memory); |
1da177e4 LT |
380 | } |
381 | ||
b08a2a12 | 382 | static unsigned long read_n_cells(int n, const __be32 **buf) |
1da177e4 LT |
383 | { |
384 | unsigned long result = 0; | |
385 | ||
386 | while (n--) { | |
b08a2a12 | 387 | result = (result << 32) | of_read_number(*buf, 1); |
1da177e4 LT |
388 | (*buf)++; |
389 | } | |
390 | return result; | |
391 | } | |
392 | ||
8342681d | 393 | /* |
95f72d1e | 394 | * Read the next memblock list entry from the ibm,dynamic-memory property |
8342681d NF |
395 | * and return the information in the provided of_drconf_cell structure. |
396 | */ | |
b08a2a12 | 397 | static void read_drconf_cell(struct of_drconf_cell *drmem, const __be32 **cellp) |
8342681d | 398 | { |
b08a2a12 | 399 | const __be32 *cp; |
8342681d NF |
400 | |
401 | drmem->base_addr = read_n_cells(n_mem_addr_cells, cellp); | |
402 | ||
403 | cp = *cellp; | |
b08a2a12 AP |
404 | drmem->drc_index = of_read_number(cp, 1); |
405 | drmem->reserved = of_read_number(&cp[1], 1); | |
406 | drmem->aa_index = of_read_number(&cp[2], 1); | |
407 | drmem->flags = of_read_number(&cp[3], 1); | |
8342681d NF |
408 | |
409 | *cellp = cp + 4; | |
410 | } | |
411 | ||
412 | /* | |
25985edc | 413 | * Retrieve and validate the ibm,dynamic-memory property of the device tree. |
8342681d | 414 | * |
95f72d1e YL |
415 | * The layout of the ibm,dynamic-memory property is a number N of memblock |
416 | * list entries followed by N memblock list entries. Each memblock list entry | |
25985edc | 417 | * contains information as laid out in the of_drconf_cell struct above. |
8342681d | 418 | */ |
b08a2a12 | 419 | static int of_get_drconf_memory(struct device_node *memory, const __be32 **dm) |
8342681d | 420 | { |
b08a2a12 | 421 | const __be32 *prop; |
8342681d NF |
422 | u32 len, entries; |
423 | ||
424 | prop = of_get_property(memory, "ibm,dynamic-memory", &len); | |
425 | if (!prop || len < sizeof(unsigned int)) | |
426 | return 0; | |
427 | ||
b08a2a12 | 428 | entries = of_read_number(prop++, 1); |
8342681d NF |
429 | |
430 | /* Now that we know the number of entries, revalidate the size | |
431 | * of the property read in to ensure we have everything | |
432 | */ | |
433 | if (len < (entries * (n_mem_addr_cells + 4) + 1) * sizeof(unsigned int)) | |
434 | return 0; | |
435 | ||
436 | *dm = prop; | |
437 | return entries; | |
438 | } | |
439 | ||
440 | /* | |
25985edc | 441 | * Retrieve and validate the ibm,lmb-size property for drconf memory |
8342681d NF |
442 | * from the device tree. |
443 | */ | |
3fdfd990 | 444 | static u64 of_get_lmb_size(struct device_node *memory) |
8342681d | 445 | { |
b08a2a12 | 446 | const __be32 *prop; |
8342681d NF |
447 | u32 len; |
448 | ||
3fdfd990 | 449 | prop = of_get_property(memory, "ibm,lmb-size", &len); |
8342681d NF |
450 | if (!prop || len < sizeof(unsigned int)) |
451 | return 0; | |
452 | ||
453 | return read_n_cells(n_mem_size_cells, &prop); | |
454 | } | |
455 | ||
456 | struct assoc_arrays { | |
457 | u32 n_arrays; | |
458 | u32 array_sz; | |
b08a2a12 | 459 | const __be32 *arrays; |
8342681d NF |
460 | }; |
461 | ||
462 | /* | |
25985edc | 463 | * Retrieve and validate the list of associativity arrays for drconf |
8342681d NF |
464 | * memory from the ibm,associativity-lookup-arrays property of the |
465 | * device tree.. | |
466 | * | |
467 | * The layout of the ibm,associativity-lookup-arrays property is a number N | |
468 | * indicating the number of associativity arrays, followed by a number M | |
469 | * indicating the size of each associativity array, followed by a list | |
470 | * of N associativity arrays. | |
471 | */ | |
472 | static int of_get_assoc_arrays(struct device_node *memory, | |
473 | struct assoc_arrays *aa) | |
474 | { | |
b08a2a12 | 475 | const __be32 *prop; |
8342681d NF |
476 | u32 len; |
477 | ||
478 | prop = of_get_property(memory, "ibm,associativity-lookup-arrays", &len); | |
479 | if (!prop || len < 2 * sizeof(unsigned int)) | |
480 | return -1; | |
481 | ||
b08a2a12 AP |
482 | aa->n_arrays = of_read_number(prop++, 1); |
483 | aa->array_sz = of_read_number(prop++, 1); | |
8342681d | 484 | |
42b2aa86 | 485 | /* Now that we know the number of arrays and size of each array, |
8342681d NF |
486 | * revalidate the size of the property read in. |
487 | */ | |
488 | if (len < (aa->n_arrays * aa->array_sz + 2) * sizeof(unsigned int)) | |
489 | return -1; | |
490 | ||
491 | aa->arrays = prop; | |
492 | return 0; | |
493 | } | |
494 | ||
495 | /* | |
496 | * This is like of_node_to_nid_single() for memory represented in the | |
497 | * ibm,dynamic-reconfiguration-memory node. | |
498 | */ | |
499 | static int of_drconf_to_nid_single(struct of_drconf_cell *drmem, | |
500 | struct assoc_arrays *aa) | |
501 | { | |
502 | int default_nid = 0; | |
503 | int nid = default_nid; | |
504 | int index; | |
505 | ||
506 | if (min_common_depth > 0 && min_common_depth <= aa->array_sz && | |
507 | !(drmem->flags & DRCONF_MEM_AI_INVALID) && | |
508 | drmem->aa_index < aa->n_arrays) { | |
509 | index = drmem->aa_index * aa->array_sz + min_common_depth - 1; | |
b08a2a12 | 510 | nid = of_read_number(&aa->arrays[index], 1); |
8342681d NF |
511 | |
512 | if (nid == 0xffff || nid >= MAX_NUMNODES) | |
513 | nid = default_nid; | |
1d805440 ND |
514 | |
515 | if (nid > 0) { | |
516 | index = drmem->aa_index * aa->array_sz; | |
517 | initialize_distance_lookup_table(nid, | |
518 | &aa->arrays[index]); | |
519 | } | |
8342681d NF |
520 | } |
521 | ||
522 | return nid; | |
523 | } | |
524 | ||
1da177e4 LT |
525 | /* |
526 | * Figure out to which domain a cpu belongs and stick it there. | |
527 | * Return the id of the domain used. | |
528 | */ | |
061d19f2 | 529 | static int numa_setup_cpu(unsigned long lcpu) |
1da177e4 | 530 | { |
297cf502 | 531 | int nid = -1; |
d4edc5b6 SB |
532 | struct device_node *cpu; |
533 | ||
534 | /* | |
535 | * If a valid cpu-to-node mapping is already available, use it | |
536 | * directly instead of querying the firmware, since it represents | |
537 | * the most recent mapping notified to us by the platform (eg: VPHN). | |
538 | */ | |
539 | if ((nid = numa_cpu_lookup_table[lcpu]) >= 0) { | |
540 | map_cpu_to_node(lcpu, nid); | |
541 | return nid; | |
542 | } | |
543 | ||
544 | cpu = of_get_cpu_node(lcpu, NULL); | |
1da177e4 LT |
545 | |
546 | if (!cpu) { | |
547 | WARN_ON(1); | |
297cf502 LZ |
548 | if (cpu_present(lcpu)) |
549 | goto out_present; | |
550 | else | |
551 | goto out; | |
1da177e4 LT |
552 | } |
553 | ||
953039c8 | 554 | nid = of_node_to_nid_single(cpu); |
1da177e4 | 555 | |
297cf502 | 556 | out_present: |
482ec7c4 | 557 | if (nid < 0 || !node_online(nid)) |
72c33688 | 558 | nid = first_online_node; |
1da177e4 | 559 | |
297cf502 | 560 | map_cpu_to_node(lcpu, nid); |
1da177e4 | 561 | of_node_put(cpu); |
297cf502 | 562 | out: |
cf950b7a | 563 | return nid; |
1da177e4 LT |
564 | } |
565 | ||
68fb18aa SB |
566 | static void verify_cpu_node_mapping(int cpu, int node) |
567 | { | |
568 | int base, sibling, i; | |
569 | ||
570 | /* Verify that all the threads in the core belong to the same node */ | |
571 | base = cpu_first_thread_sibling(cpu); | |
572 | ||
573 | for (i = 0; i < threads_per_core; i++) { | |
574 | sibling = base + i; | |
575 | ||
576 | if (sibling == cpu || cpu_is_offline(sibling)) | |
577 | continue; | |
578 | ||
579 | if (cpu_to_node(sibling) != node) { | |
580 | WARN(1, "CPU thread siblings %d and %d don't belong" | |
581 | " to the same node!\n", cpu, sibling); | |
582 | break; | |
583 | } | |
584 | } | |
585 | } | |
586 | ||
061d19f2 | 587 | static int cpu_numa_callback(struct notifier_block *nfb, unsigned long action, |
1da177e4 LT |
588 | void *hcpu) |
589 | { | |
590 | unsigned long lcpu = (unsigned long)hcpu; | |
68fb18aa | 591 | int ret = NOTIFY_DONE, nid; |
1da177e4 LT |
592 | |
593 | switch (action) { | |
594 | case CPU_UP_PREPARE: | |
8bb78442 | 595 | case CPU_UP_PREPARE_FROZEN: |
68fb18aa SB |
596 | nid = numa_setup_cpu(lcpu); |
597 | verify_cpu_node_mapping((int)lcpu, nid); | |
1da177e4 LT |
598 | ret = NOTIFY_OK; |
599 | break; | |
600 | #ifdef CONFIG_HOTPLUG_CPU | |
601 | case CPU_DEAD: | |
8bb78442 | 602 | case CPU_DEAD_FROZEN: |
1da177e4 | 603 | case CPU_UP_CANCELED: |
8bb78442 | 604 | case CPU_UP_CANCELED_FROZEN: |
1da177e4 | 605 | unmap_cpu_from_node(lcpu); |
1da177e4 | 606 | ret = NOTIFY_OK; |
b00fc6ec | 607 | break; |
1da177e4 LT |
608 | #endif |
609 | } | |
610 | return ret; | |
611 | } | |
612 | ||
613 | /* | |
614 | * Check and possibly modify a memory region to enforce the memory limit. | |
615 | * | |
616 | * Returns the size the region should have to enforce the memory limit. | |
617 | * This will either be the original value of size, a truncated value, | |
618 | * or zero. If the returned value of size is 0 the region should be | |
25985edc | 619 | * discarded as it lies wholly above the memory limit. |
1da177e4 | 620 | */ |
45fb6cea AB |
621 | static unsigned long __init numa_enforce_memory_limit(unsigned long start, |
622 | unsigned long size) | |
1da177e4 LT |
623 | { |
624 | /* | |
95f72d1e | 625 | * We use memblock_end_of_DRAM() in here instead of memory_limit because |
1da177e4 | 626 | * we've already adjusted it for the limit and it takes care of |
fe55249d MM |
627 | * having memory holes below the limit. Also, in the case of |
628 | * iommu_is_off, memory_limit is not set but is implicitly enforced. | |
1da177e4 | 629 | */ |
1da177e4 | 630 | |
95f72d1e | 631 | if (start + size <= memblock_end_of_DRAM()) |
1da177e4 LT |
632 | return size; |
633 | ||
95f72d1e | 634 | if (start >= memblock_end_of_DRAM()) |
1da177e4 LT |
635 | return 0; |
636 | ||
95f72d1e | 637 | return memblock_end_of_DRAM() - start; |
1da177e4 LT |
638 | } |
639 | ||
cf00085d C |
640 | /* |
641 | * Reads the counter for a given entry in | |
642 | * linux,drconf-usable-memory property | |
643 | */ | |
b08a2a12 | 644 | static inline int __init read_usm_ranges(const __be32 **usm) |
cf00085d C |
645 | { |
646 | /* | |
3fdfd990 | 647 | * For each lmb in ibm,dynamic-memory a corresponding |
cf00085d C |
648 | * entry in linux,drconf-usable-memory property contains |
649 | * a counter followed by that many (base, size) duple. | |
650 | * read the counter from linux,drconf-usable-memory | |
651 | */ | |
652 | return read_n_cells(n_mem_size_cells, usm); | |
653 | } | |
654 | ||
0204568a PM |
655 | /* |
656 | * Extract NUMA information from the ibm,dynamic-reconfiguration-memory | |
657 | * node. This assumes n_mem_{addr,size}_cells have been set. | |
658 | */ | |
659 | static void __init parse_drconf_memory(struct device_node *memory) | |
660 | { | |
b08a2a12 | 661 | const __be32 *uninitialized_var(dm), *usm; |
cf00085d | 662 | unsigned int n, rc, ranges, is_kexec_kdump = 0; |
3fdfd990 | 663 | unsigned long lmb_size, base, size, sz; |
8342681d | 664 | int nid; |
aa709f3b | 665 | struct assoc_arrays aa = { .arrays = NULL }; |
8342681d NF |
666 | |
667 | n = of_get_drconf_memory(memory, &dm); | |
668 | if (!n) | |
0204568a PM |
669 | return; |
670 | ||
3fdfd990 BH |
671 | lmb_size = of_get_lmb_size(memory); |
672 | if (!lmb_size) | |
8342681d NF |
673 | return; |
674 | ||
675 | rc = of_get_assoc_arrays(memory, &aa); | |
676 | if (rc) | |
0204568a PM |
677 | return; |
678 | ||
cf00085d C |
679 | /* check if this is a kexec/kdump kernel */ |
680 | usm = of_get_usable_memory(memory); | |
681 | if (usm != NULL) | |
682 | is_kexec_kdump = 1; | |
683 | ||
0204568a | 684 | for (; n != 0; --n) { |
8342681d NF |
685 | struct of_drconf_cell drmem; |
686 | ||
687 | read_drconf_cell(&drmem, &dm); | |
688 | ||
689 | /* skip this block if the reserved bit is set in flags (0x80) | |
690 | or if the block is not assigned to this partition (0x8) */ | |
691 | if ((drmem.flags & DRCONF_MEM_RESERVED) | |
692 | || !(drmem.flags & DRCONF_MEM_ASSIGNED)) | |
0204568a | 693 | continue; |
1daa6d08 | 694 | |
cf00085d | 695 | base = drmem.base_addr; |
3fdfd990 | 696 | size = lmb_size; |
cf00085d | 697 | ranges = 1; |
8342681d | 698 | |
cf00085d C |
699 | if (is_kexec_kdump) { |
700 | ranges = read_usm_ranges(&usm); | |
701 | if (!ranges) /* there are no (base, size) duple */ | |
702 | continue; | |
703 | } | |
704 | do { | |
705 | if (is_kexec_kdump) { | |
706 | base = read_n_cells(n_mem_addr_cells, &usm); | |
707 | size = read_n_cells(n_mem_size_cells, &usm); | |
708 | } | |
709 | nid = of_drconf_to_nid_single(&drmem, &aa); | |
710 | fake_numa_create_new_node( | |
711 | ((base + size) >> PAGE_SHIFT), | |
8342681d | 712 | &nid); |
cf00085d C |
713 | node_set_online(nid); |
714 | sz = numa_enforce_memory_limit(base, size); | |
715 | if (sz) | |
e7e8de59 TC |
716 | memblock_set_node(base, sz, |
717 | &memblock.memory, nid); | |
cf00085d | 718 | } while (--ranges); |
0204568a PM |
719 | } |
720 | } | |
721 | ||
1da177e4 LT |
722 | static int __init parse_numa_properties(void) |
723 | { | |
94db7c5e | 724 | struct device_node *memory; |
482ec7c4 | 725 | int default_nid = 0; |
1da177e4 LT |
726 | unsigned long i; |
727 | ||
728 | if (numa_enabled == 0) { | |
729 | printk(KERN_WARNING "NUMA disabled by user\n"); | |
730 | return -1; | |
731 | } | |
732 | ||
1da177e4 LT |
733 | min_common_depth = find_min_common_depth(); |
734 | ||
1da177e4 LT |
735 | if (min_common_depth < 0) |
736 | return min_common_depth; | |
737 | ||
bf4b85b0 NL |
738 | dbg("NUMA associativity depth for CPU/Memory: %d\n", min_common_depth); |
739 | ||
1da177e4 | 740 | /* |
482ec7c4 NL |
741 | * Even though we connect cpus to numa domains later in SMP |
742 | * init, we need to know the node ids now. This is because | |
743 | * each node to be onlined must have NODE_DATA etc backing it. | |
1da177e4 | 744 | */ |
482ec7c4 | 745 | for_each_present_cpu(i) { |
dfbe93a2 | 746 | struct device_node *cpu; |
cf950b7a | 747 | int nid; |
1da177e4 | 748 | |
8b16cd23 | 749 | cpu = of_get_cpu_node(i, NULL); |
482ec7c4 | 750 | BUG_ON(!cpu); |
953039c8 | 751 | nid = of_node_to_nid_single(cpu); |
482ec7c4 | 752 | of_node_put(cpu); |
1da177e4 | 753 | |
482ec7c4 NL |
754 | /* |
755 | * Don't fall back to default_nid yet -- we will plug | |
756 | * cpus into nodes once the memory scan has discovered | |
757 | * the topology. | |
758 | */ | |
759 | if (nid < 0) | |
760 | continue; | |
761 | node_set_online(nid); | |
1da177e4 LT |
762 | } |
763 | ||
237a0989 | 764 | get_n_mem_cells(&n_mem_addr_cells, &n_mem_size_cells); |
94db7c5e AB |
765 | |
766 | for_each_node_by_type(memory, "memory") { | |
1da177e4 LT |
767 | unsigned long start; |
768 | unsigned long size; | |
cf950b7a | 769 | int nid; |
1da177e4 | 770 | int ranges; |
b08a2a12 | 771 | const __be32 *memcell_buf; |
1da177e4 LT |
772 | unsigned int len; |
773 | ||
e2eb6392 | 774 | memcell_buf = of_get_property(memory, |
ba759485 ME |
775 | "linux,usable-memory", &len); |
776 | if (!memcell_buf || len <= 0) | |
e2eb6392 | 777 | memcell_buf = of_get_property(memory, "reg", &len); |
1da177e4 LT |
778 | if (!memcell_buf || len <= 0) |
779 | continue; | |
780 | ||
cc5d0189 BH |
781 | /* ranges in cell */ |
782 | ranges = (len >> 2) / (n_mem_addr_cells + n_mem_size_cells); | |
1da177e4 LT |
783 | new_range: |
784 | /* these are order-sensitive, and modify the buffer pointer */ | |
237a0989 MK |
785 | start = read_n_cells(n_mem_addr_cells, &memcell_buf); |
786 | size = read_n_cells(n_mem_size_cells, &memcell_buf); | |
1da177e4 | 787 | |
482ec7c4 NL |
788 | /* |
789 | * Assumption: either all memory nodes or none will | |
790 | * have associativity properties. If none, then | |
791 | * everything goes to default_nid. | |
792 | */ | |
953039c8 | 793 | nid = of_node_to_nid_single(memory); |
482ec7c4 NL |
794 | if (nid < 0) |
795 | nid = default_nid; | |
1daa6d08 BS |
796 | |
797 | fake_numa_create_new_node(((start + size) >> PAGE_SHIFT), &nid); | |
482ec7c4 | 798 | node_set_online(nid); |
1da177e4 | 799 | |
45fb6cea | 800 | if (!(size = numa_enforce_memory_limit(start, size))) { |
1da177e4 LT |
801 | if (--ranges) |
802 | goto new_range; | |
803 | else | |
804 | continue; | |
805 | } | |
806 | ||
e7e8de59 | 807 | memblock_set_node(start, size, &memblock.memory, nid); |
1da177e4 LT |
808 | |
809 | if (--ranges) | |
810 | goto new_range; | |
811 | } | |
812 | ||
0204568a | 813 | /* |
dfbe93a2 AB |
814 | * Now do the same thing for each MEMBLOCK listed in the |
815 | * ibm,dynamic-memory property in the | |
816 | * ibm,dynamic-reconfiguration-memory node. | |
0204568a PM |
817 | */ |
818 | memory = of_find_node_by_path("/ibm,dynamic-reconfiguration-memory"); | |
819 | if (memory) | |
820 | parse_drconf_memory(memory); | |
821 | ||
1da177e4 LT |
822 | return 0; |
823 | } | |
824 | ||
825 | static void __init setup_nonnuma(void) | |
826 | { | |
95f72d1e YL |
827 | unsigned long top_of_ram = memblock_end_of_DRAM(); |
828 | unsigned long total_ram = memblock_phys_mem_size(); | |
c67c3cb4 | 829 | unsigned long start_pfn, end_pfn; |
28be7072 BH |
830 | unsigned int nid = 0; |
831 | struct memblock_region *reg; | |
1da177e4 | 832 | |
e110b281 | 833 | printk(KERN_DEBUG "Top of RAM: 0x%lx, Total RAM: 0x%lx\n", |
1da177e4 | 834 | top_of_ram, total_ram); |
e110b281 | 835 | printk(KERN_DEBUG "Memory hole size: %ldMB\n", |
1da177e4 LT |
836 | (top_of_ram - total_ram) >> 20); |
837 | ||
28be7072 | 838 | for_each_memblock(memory, reg) { |
c7fc2de0 YL |
839 | start_pfn = memblock_region_memory_base_pfn(reg); |
840 | end_pfn = memblock_region_memory_end_pfn(reg); | |
1daa6d08 BS |
841 | |
842 | fake_numa_create_new_node(end_pfn, &nid); | |
1d7cfe18 | 843 | memblock_set_node(PFN_PHYS(start_pfn), |
e7e8de59 TC |
844 | PFN_PHYS(end_pfn - start_pfn), |
845 | &memblock.memory, nid); | |
1daa6d08 | 846 | node_set_online(nid); |
c67c3cb4 | 847 | } |
1da177e4 LT |
848 | } |
849 | ||
4b703a23 AB |
850 | void __init dump_numa_cpu_topology(void) |
851 | { | |
852 | unsigned int node; | |
853 | unsigned int cpu, count; | |
854 | ||
855 | if (min_common_depth == -1 || !numa_enabled) | |
856 | return; | |
857 | ||
858 | for_each_online_node(node) { | |
e110b281 | 859 | printk(KERN_DEBUG "Node %d CPUs:", node); |
4b703a23 AB |
860 | |
861 | count = 0; | |
862 | /* | |
863 | * If we used a CPU iterator here we would miss printing | |
864 | * the holes in the cpumap. | |
865 | */ | |
25863de0 AB |
866 | for (cpu = 0; cpu < nr_cpu_ids; cpu++) { |
867 | if (cpumask_test_cpu(cpu, | |
868 | node_to_cpumask_map[node])) { | |
4b703a23 AB |
869 | if (count == 0) |
870 | printk(" %u", cpu); | |
871 | ++count; | |
872 | } else { | |
873 | if (count > 1) | |
874 | printk("-%u", cpu - 1); | |
875 | count = 0; | |
876 | } | |
877 | } | |
878 | ||
879 | if (count > 1) | |
25863de0 | 880 | printk("-%u", nr_cpu_ids - 1); |
4b703a23 AB |
881 | printk("\n"); |
882 | } | |
883 | } | |
884 | ||
885 | static void __init dump_numa_memory_topology(void) | |
1da177e4 LT |
886 | { |
887 | unsigned int node; | |
888 | unsigned int count; | |
889 | ||
890 | if (min_common_depth == -1 || !numa_enabled) | |
891 | return; | |
892 | ||
893 | for_each_online_node(node) { | |
894 | unsigned long i; | |
895 | ||
e110b281 | 896 | printk(KERN_DEBUG "Node %d Memory:", node); |
1da177e4 LT |
897 | |
898 | count = 0; | |
899 | ||
95f72d1e | 900 | for (i = 0; i < memblock_end_of_DRAM(); |
45fb6cea AB |
901 | i += (1 << SECTION_SIZE_BITS)) { |
902 | if (early_pfn_to_nid(i >> PAGE_SHIFT) == node) { | |
1da177e4 LT |
903 | if (count == 0) |
904 | printk(" 0x%lx", i); | |
905 | ++count; | |
906 | } else { | |
907 | if (count > 0) | |
908 | printk("-0x%lx", i); | |
909 | count = 0; | |
910 | } | |
911 | } | |
912 | ||
913 | if (count > 0) | |
914 | printk("-0x%lx", i); | |
915 | printk("\n"); | |
916 | } | |
1da177e4 LT |
917 | } |
918 | ||
061d19f2 | 919 | static struct notifier_block ppc64_numa_nb = { |
74b85f37 CS |
920 | .notifier_call = cpu_numa_callback, |
921 | .priority = 1 /* Must run before sched domains notifier. */ | |
922 | }; | |
923 | ||
10239733 AB |
924 | /* Initialize NODE_DATA for a node on the local memory */ |
925 | static void __init setup_node_data(int nid, u64 start_pfn, u64 end_pfn) | |
4a618669 | 926 | { |
10239733 AB |
927 | u64 spanned_pages = end_pfn - start_pfn; |
928 | const size_t nd_size = roundup(sizeof(pg_data_t), SMP_CACHE_BYTES); | |
929 | u64 nd_pa; | |
930 | void *nd; | |
931 | int tnid; | |
4a618669 | 932 | |
10239733 AB |
933 | if (spanned_pages) |
934 | pr_info("Initmem setup node %d [mem %#010Lx-%#010Lx]\n", | |
935 | nid, start_pfn << PAGE_SHIFT, | |
936 | (end_pfn << PAGE_SHIFT) - 1); | |
937 | else | |
938 | pr_info("Initmem setup node %d\n", nid); | |
4a618669 | 939 | |
10239733 AB |
940 | nd_pa = memblock_alloc_try_nid(nd_size, SMP_CACHE_BYTES, nid); |
941 | nd = __va(nd_pa); | |
4a618669 | 942 | |
10239733 AB |
943 | /* report and initialize */ |
944 | pr_info(" NODE_DATA [mem %#010Lx-%#010Lx]\n", | |
945 | nd_pa, nd_pa + nd_size - 1); | |
946 | tnid = early_pfn_to_nid(nd_pa >> PAGE_SHIFT); | |
947 | if (tnid != nid) | |
948 | pr_info(" NODE_DATA(%d) on node %d\n", nid, tnid); | |
4a618669 | 949 | |
10239733 AB |
950 | node_data[nid] = nd; |
951 | memset(NODE_DATA(nid), 0, sizeof(pg_data_t)); | |
952 | NODE_DATA(nid)->node_id = nid; | |
953 | NODE_DATA(nid)->node_start_pfn = start_pfn; | |
954 | NODE_DATA(nid)->node_spanned_pages = spanned_pages; | |
955 | } | |
4a618669 | 956 | |
10239733 | 957 | void __init initmem_init(void) |
1da177e4 | 958 | { |
2fabf084 | 959 | int nid, cpu; |
1da177e4 | 960 | |
95f72d1e | 961 | max_low_pfn = memblock_end_of_DRAM() >> PAGE_SHIFT; |
1da177e4 LT |
962 | max_pfn = max_low_pfn; |
963 | ||
964 | if (parse_numa_properties()) | |
965 | setup_nonnuma(); | |
966 | else | |
4b703a23 | 967 | dump_numa_memory_topology(); |
1da177e4 | 968 | |
10239733 AB |
969 | memblock_dump_all(); |
970 | ||
3af229f2 NA |
971 | /* |
972 | * Reduce the possible NUMA nodes to the online NUMA nodes, | |
973 | * since we do not support node hotplug. This ensures that we | |
974 | * lower the maximum NUMA node ID to what is actually present. | |
975 | */ | |
976 | nodes_and(node_possible_map, node_possible_map, node_online_map); | |
977 | ||
1da177e4 | 978 | for_each_online_node(nid) { |
c67c3cb4 | 979 | unsigned long start_pfn, end_pfn; |
1da177e4 | 980 | |
c67c3cb4 | 981 | get_pfn_range_for_nid(nid, &start_pfn, &end_pfn); |
10239733 | 982 | setup_node_data(nid, start_pfn, end_pfn); |
8f64e1f2 | 983 | sparse_memory_present_with_active_regions(nid); |
4a618669 | 984 | } |
d3f6204a | 985 | |
21098b9e | 986 | sparse_init(); |
25863de0 | 987 | |
25863de0 AB |
988 | setup_node_to_cpumask_map(); |
989 | ||
d4edc5b6 | 990 | reset_numa_cpu_lookup_table(); |
25863de0 | 991 | register_cpu_notifier(&ppc64_numa_nb); |
2fabf084 NA |
992 | /* |
993 | * We need the numa_cpu_lookup_table to be accurate for all CPUs, | |
994 | * even before we online them, so that we can use cpu_to_{node,mem} | |
995 | * early in boot, cf. smp_prepare_cpus(). | |
996 | */ | |
bc3c4327 | 997 | for_each_present_cpu(cpu) { |
70ad2375 | 998 | numa_setup_cpu((unsigned long)cpu); |
2fabf084 | 999 | } |
1da177e4 LT |
1000 | } |
1001 | ||
1da177e4 LT |
1002 | static int __init early_numa(char *p) |
1003 | { | |
1004 | if (!p) | |
1005 | return 0; | |
1006 | ||
1007 | if (strstr(p, "off")) | |
1008 | numa_enabled = 0; | |
1009 | ||
1010 | if (strstr(p, "debug")) | |
1011 | numa_debug = 1; | |
1012 | ||
1daa6d08 BS |
1013 | p = strstr(p, "fake="); |
1014 | if (p) | |
1015 | cmdline = p + strlen("fake="); | |
1016 | ||
1da177e4 LT |
1017 | return 0; |
1018 | } | |
1019 | early_param("numa", early_numa); | |
237a0989 | 1020 | |
2d73bae1 NA |
1021 | static bool topology_updates_enabled = true; |
1022 | ||
1023 | static int __init early_topology_updates(char *p) | |
1024 | { | |
1025 | if (!p) | |
1026 | return 0; | |
1027 | ||
1028 | if (!strcmp(p, "off")) { | |
1029 | pr_info("Disabling topology updates\n"); | |
1030 | topology_updates_enabled = false; | |
1031 | } | |
1032 | ||
1033 | return 0; | |
1034 | } | |
1035 | early_param("topology_updates", early_topology_updates); | |
1036 | ||
237a0989 | 1037 | #ifdef CONFIG_MEMORY_HOTPLUG |
0db9360a | 1038 | /* |
0f16ef7f NF |
1039 | * Find the node associated with a hot added memory section for |
1040 | * memory represented in the device tree by the property | |
1041 | * ibm,dynamic-reconfiguration-memory/ibm,dynamic-memory. | |
0db9360a NF |
1042 | */ |
1043 | static int hot_add_drconf_scn_to_nid(struct device_node *memory, | |
1044 | unsigned long scn_addr) | |
1045 | { | |
b08a2a12 | 1046 | const __be32 *dm; |
0f16ef7f | 1047 | unsigned int drconf_cell_cnt, rc; |
3fdfd990 | 1048 | unsigned long lmb_size; |
0db9360a | 1049 | struct assoc_arrays aa; |
0f16ef7f | 1050 | int nid = -1; |
0db9360a | 1051 | |
0f16ef7f NF |
1052 | drconf_cell_cnt = of_get_drconf_memory(memory, &dm); |
1053 | if (!drconf_cell_cnt) | |
1054 | return -1; | |
0db9360a | 1055 | |
3fdfd990 BH |
1056 | lmb_size = of_get_lmb_size(memory); |
1057 | if (!lmb_size) | |
0f16ef7f | 1058 | return -1; |
0db9360a NF |
1059 | |
1060 | rc = of_get_assoc_arrays(memory, &aa); | |
1061 | if (rc) | |
0f16ef7f | 1062 | return -1; |
0db9360a | 1063 | |
0f16ef7f | 1064 | for (; drconf_cell_cnt != 0; --drconf_cell_cnt) { |
0db9360a NF |
1065 | struct of_drconf_cell drmem; |
1066 | ||
1067 | read_drconf_cell(&drmem, &dm); | |
1068 | ||
1069 | /* skip this block if it is reserved or not assigned to | |
1070 | * this partition */ | |
1071 | if ((drmem.flags & DRCONF_MEM_RESERVED) | |
1072 | || !(drmem.flags & DRCONF_MEM_ASSIGNED)) | |
1073 | continue; | |
1074 | ||
0f16ef7f | 1075 | if ((scn_addr < drmem.base_addr) |
3fdfd990 | 1076 | || (scn_addr >= (drmem.base_addr + lmb_size))) |
0f16ef7f NF |
1077 | continue; |
1078 | ||
0db9360a | 1079 | nid = of_drconf_to_nid_single(&drmem, &aa); |
0f16ef7f NF |
1080 | break; |
1081 | } | |
1082 | ||
1083 | return nid; | |
1084 | } | |
1085 | ||
1086 | /* | |
1087 | * Find the node associated with a hot added memory section for memory | |
1088 | * represented in the device tree as a node (i.e. memory@XXXX) for | |
95f72d1e | 1089 | * each memblock. |
0f16ef7f | 1090 | */ |
ec32dd66 | 1091 | static int hot_add_node_scn_to_nid(unsigned long scn_addr) |
0f16ef7f | 1092 | { |
94db7c5e | 1093 | struct device_node *memory; |
0f16ef7f NF |
1094 | int nid = -1; |
1095 | ||
94db7c5e | 1096 | for_each_node_by_type(memory, "memory") { |
0f16ef7f NF |
1097 | unsigned long start, size; |
1098 | int ranges; | |
b08a2a12 | 1099 | const __be32 *memcell_buf; |
0f16ef7f NF |
1100 | unsigned int len; |
1101 | ||
1102 | memcell_buf = of_get_property(memory, "reg", &len); | |
1103 | if (!memcell_buf || len <= 0) | |
1104 | continue; | |
1105 | ||
1106 | /* ranges in cell */ | |
1107 | ranges = (len >> 2) / (n_mem_addr_cells + n_mem_size_cells); | |
1108 | ||
1109 | while (ranges--) { | |
1110 | start = read_n_cells(n_mem_addr_cells, &memcell_buf); | |
1111 | size = read_n_cells(n_mem_size_cells, &memcell_buf); | |
1112 | ||
1113 | if ((scn_addr < start) || (scn_addr >= (start + size))) | |
1114 | continue; | |
1115 | ||
1116 | nid = of_node_to_nid_single(memory); | |
1117 | break; | |
1118 | } | |
0db9360a | 1119 | |
0f16ef7f NF |
1120 | if (nid >= 0) |
1121 | break; | |
0db9360a NF |
1122 | } |
1123 | ||
60831842 AB |
1124 | of_node_put(memory); |
1125 | ||
0f16ef7f | 1126 | return nid; |
0db9360a NF |
1127 | } |
1128 | ||
237a0989 MK |
1129 | /* |
1130 | * Find the node associated with a hot added memory section. Section | |
95f72d1e YL |
1131 | * corresponds to a SPARSEMEM section, not an MEMBLOCK. It is assumed that |
1132 | * sections are fully contained within a single MEMBLOCK. | |
237a0989 MK |
1133 | */ |
1134 | int hot_add_scn_to_nid(unsigned long scn_addr) | |
1135 | { | |
1136 | struct device_node *memory = NULL; | |
0f16ef7f | 1137 | int nid, found = 0; |
237a0989 MK |
1138 | |
1139 | if (!numa_enabled || (min_common_depth < 0)) | |
72c33688 | 1140 | return first_online_node; |
0db9360a NF |
1141 | |
1142 | memory = of_find_node_by_path("/ibm,dynamic-reconfiguration-memory"); | |
1143 | if (memory) { | |
1144 | nid = hot_add_drconf_scn_to_nid(memory, scn_addr); | |
1145 | of_node_put(memory); | |
0f16ef7f NF |
1146 | } else { |
1147 | nid = hot_add_node_scn_to_nid(scn_addr); | |
0db9360a | 1148 | } |
237a0989 | 1149 | |
0f16ef7f | 1150 | if (nid < 0 || !node_online(nid)) |
72c33688 | 1151 | nid = first_online_node; |
237a0989 | 1152 | |
0f16ef7f NF |
1153 | if (NODE_DATA(nid)->node_spanned_pages) |
1154 | return nid; | |
237a0989 | 1155 | |
0f16ef7f NF |
1156 | for_each_online_node(nid) { |
1157 | if (NODE_DATA(nid)->node_spanned_pages) { | |
1158 | found = 1; | |
1159 | break; | |
237a0989 | 1160 | } |
237a0989 | 1161 | } |
0f16ef7f NF |
1162 | |
1163 | BUG_ON(!found); | |
1164 | return nid; | |
237a0989 | 1165 | } |
0f16ef7f | 1166 | |
cd34206e NA |
1167 | static u64 hot_add_drconf_memory_max(void) |
1168 | { | |
1169 | struct device_node *memory = NULL; | |
1170 | unsigned int drconf_cell_cnt = 0; | |
1171 | u64 lmb_size = 0; | |
ec32dd66 | 1172 | const __be32 *dm = NULL; |
cd34206e NA |
1173 | |
1174 | memory = of_find_node_by_path("/ibm,dynamic-reconfiguration-memory"); | |
1175 | if (memory) { | |
1176 | drconf_cell_cnt = of_get_drconf_memory(memory, &dm); | |
1177 | lmb_size = of_get_lmb_size(memory); | |
1178 | of_node_put(memory); | |
1179 | } | |
1180 | return lmb_size * drconf_cell_cnt; | |
1181 | } | |
1182 | ||
1183 | /* | |
1184 | * memory_hotplug_max - return max address of memory that may be added | |
1185 | * | |
1186 | * This is currently only used on systems that support drconfig memory | |
1187 | * hotplug. | |
1188 | */ | |
1189 | u64 memory_hotplug_max(void) | |
1190 | { | |
1191 | return max(hot_add_drconf_memory_max(), memblock_end_of_DRAM()); | |
1192 | } | |
237a0989 | 1193 | #endif /* CONFIG_MEMORY_HOTPLUG */ |
9eff1a38 | 1194 | |
bd03403a | 1195 | /* Virtual Processor Home Node (VPHN) support */ |
39bf990e | 1196 | #ifdef CONFIG_PPC_SPLPAR |
4b6cfb2a GK |
1197 | |
1198 | #include "vphn.h" | |
1199 | ||
30c05350 NF |
1200 | struct topology_update_data { |
1201 | struct topology_update_data *next; | |
1202 | unsigned int cpu; | |
1203 | int old_nid; | |
1204 | int new_nid; | |
1205 | }; | |
1206 | ||
5de16699 | 1207 | static u8 vphn_cpu_change_counts[NR_CPUS][MAX_DISTANCE_REF_POINTS]; |
9eff1a38 JL |
1208 | static cpumask_t cpu_associativity_changes_mask; |
1209 | static int vphn_enabled; | |
5d88aa85 JL |
1210 | static int prrn_enabled; |
1211 | static void reset_topology_timer(void); | |
9eff1a38 JL |
1212 | |
1213 | /* | |
1214 | * Store the current values of the associativity change counters in the | |
1215 | * hypervisor. | |
1216 | */ | |
1217 | static void setup_cpu_associativity_change_counters(void) | |
1218 | { | |
cd9d6cc7 | 1219 | int cpu; |
9eff1a38 | 1220 | |
5de16699 AB |
1221 | /* The VPHN feature supports a maximum of 8 reference points */ |
1222 | BUILD_BUG_ON(MAX_DISTANCE_REF_POINTS > 8); | |
1223 | ||
9eff1a38 | 1224 | for_each_possible_cpu(cpu) { |
cd9d6cc7 | 1225 | int i; |
9eff1a38 JL |
1226 | u8 *counts = vphn_cpu_change_counts[cpu]; |
1227 | volatile u8 *hypervisor_counts = lppaca[cpu].vphn_assoc_counts; | |
1228 | ||
5de16699 | 1229 | for (i = 0; i < distance_ref_points_depth; i++) |
9eff1a38 | 1230 | counts[i] = hypervisor_counts[i]; |
9eff1a38 JL |
1231 | } |
1232 | } | |
1233 | ||
1234 | /* | |
1235 | * The hypervisor maintains a set of 8 associativity change counters in | |
1236 | * the VPA of each cpu that correspond to the associativity levels in the | |
1237 | * ibm,associativity-reference-points property. When an associativity | |
1238 | * level changes, the corresponding counter is incremented. | |
1239 | * | |
1240 | * Set a bit in cpu_associativity_changes_mask for each cpu whose home | |
1241 | * node associativity levels have changed. | |
1242 | * | |
1243 | * Returns the number of cpus with unhandled associativity changes. | |
1244 | */ | |
1245 | static int update_cpu_associativity_changes_mask(void) | |
1246 | { | |
5d88aa85 | 1247 | int cpu; |
9eff1a38 JL |
1248 | cpumask_t *changes = &cpu_associativity_changes_mask; |
1249 | ||
9eff1a38 JL |
1250 | for_each_possible_cpu(cpu) { |
1251 | int i, changed = 0; | |
1252 | u8 *counts = vphn_cpu_change_counts[cpu]; | |
1253 | volatile u8 *hypervisor_counts = lppaca[cpu].vphn_assoc_counts; | |
1254 | ||
5de16699 | 1255 | for (i = 0; i < distance_ref_points_depth; i++) { |
d69043e8 | 1256 | if (hypervisor_counts[i] != counts[i]) { |
9eff1a38 JL |
1257 | counts[i] = hypervisor_counts[i]; |
1258 | changed = 1; | |
1259 | } | |
1260 | } | |
1261 | if (changed) { | |
3be7db6a RJ |
1262 | cpumask_or(changes, changes, cpu_sibling_mask(cpu)); |
1263 | cpu = cpu_last_thread_sibling(cpu); | |
9eff1a38 JL |
1264 | } |
1265 | } | |
1266 | ||
5d88aa85 | 1267 | return cpumask_weight(changes); |
9eff1a38 JL |
1268 | } |
1269 | ||
9eff1a38 JL |
1270 | /* |
1271 | * Retrieve the new associativity information for a virtual processor's | |
1272 | * home node. | |
1273 | */ | |
b08a2a12 | 1274 | static long hcall_vphn(unsigned long cpu, __be32 *associativity) |
9eff1a38 | 1275 | { |
cd9d6cc7 | 1276 | long rc; |
9eff1a38 JL |
1277 | long retbuf[PLPAR_HCALL9_BUFSIZE] = {0}; |
1278 | u64 flags = 1; | |
1279 | int hwcpu = get_hard_smp_processor_id(cpu); | |
1280 | ||
1281 | rc = plpar_hcall9(H_HOME_NODE_ASSOCIATIVITY, retbuf, flags, hwcpu); | |
1282 | vphn_unpack_associativity(retbuf, associativity); | |
1283 | ||
1284 | return rc; | |
1285 | } | |
1286 | ||
1287 | static long vphn_get_associativity(unsigned long cpu, | |
b08a2a12 | 1288 | __be32 *associativity) |
9eff1a38 | 1289 | { |
cd9d6cc7 | 1290 | long rc; |
9eff1a38 JL |
1291 | |
1292 | rc = hcall_vphn(cpu, associativity); | |
1293 | ||
1294 | switch (rc) { | |
1295 | case H_FUNCTION: | |
1296 | printk(KERN_INFO | |
1297 | "VPHN is not supported. Disabling polling...\n"); | |
1298 | stop_topology_update(); | |
1299 | break; | |
1300 | case H_HARDWARE: | |
1301 | printk(KERN_ERR | |
1302 | "hcall_vphn() experienced a hardware fault " | |
1303 | "preventing VPHN. Disabling polling...\n"); | |
1304 | stop_topology_update(); | |
1305 | } | |
1306 | ||
1307 | return rc; | |
1308 | } | |
1309 | ||
30c05350 NF |
1310 | /* |
1311 | * Update the CPU maps and sysfs entries for a single CPU when its NUMA | |
1312 | * characteristics change. This function doesn't perform any locking and is | |
1313 | * only safe to call from stop_machine(). | |
1314 | */ | |
1315 | static int update_cpu_topology(void *data) | |
1316 | { | |
1317 | struct topology_update_data *update; | |
1318 | unsigned long cpu; | |
1319 | ||
1320 | if (!data) | |
1321 | return -EINVAL; | |
1322 | ||
3be7db6a | 1323 | cpu = smp_processor_id(); |
30c05350 NF |
1324 | |
1325 | for (update = data; update; update = update->next) { | |
2c0a33f9 | 1326 | int new_nid = update->new_nid; |
30c05350 NF |
1327 | if (cpu != update->cpu) |
1328 | continue; | |
1329 | ||
49f8d8c0 | 1330 | unmap_cpu_from_node(cpu); |
2c0a33f9 NA |
1331 | map_cpu_to_node(cpu, new_nid); |
1332 | set_cpu_numa_node(cpu, new_nid); | |
1333 | set_cpu_numa_mem(cpu, local_memory_node(new_nid)); | |
176bbf14 | 1334 | vdso_getcpu_init(); |
30c05350 NF |
1335 | } |
1336 | ||
1337 | return 0; | |
1338 | } | |
1339 | ||
d4edc5b6 SB |
1340 | static int update_lookup_table(void *data) |
1341 | { | |
1342 | struct topology_update_data *update; | |
1343 | ||
1344 | if (!data) | |
1345 | return -EINVAL; | |
1346 | ||
1347 | /* | |
1348 | * Upon topology update, the numa-cpu lookup table needs to be updated | |
1349 | * for all threads in the core, including offline CPUs, to ensure that | |
1350 | * future hotplug operations respect the cpu-to-node associativity | |
1351 | * properly. | |
1352 | */ | |
1353 | for (update = data; update; update = update->next) { | |
1354 | int nid, base, j; | |
1355 | ||
1356 | nid = update->new_nid; | |
1357 | base = cpu_first_thread_sibling(update->cpu); | |
1358 | ||
1359 | for (j = 0; j < threads_per_core; j++) { | |
1360 | update_numa_cpu_lookup_table(base + j, nid); | |
1361 | } | |
1362 | } | |
1363 | ||
1364 | return 0; | |
1365 | } | |
1366 | ||
9eff1a38 JL |
1367 | /* |
1368 | * Update the node maps and sysfs entries for each cpu whose home node | |
79c5fceb | 1369 | * has changed. Returns 1 when the topology has changed, and 0 otherwise. |
9eff1a38 JL |
1370 | */ |
1371 | int arch_update_cpu_topology(void) | |
1372 | { | |
3be7db6a | 1373 | unsigned int cpu, sibling, changed = 0; |
30c05350 | 1374 | struct topology_update_data *updates, *ud; |
b08a2a12 | 1375 | __be32 associativity[VPHN_ASSOC_BUFSIZE] = {0}; |
176bbf14 | 1376 | cpumask_t updated_cpus; |
8a25a2fd | 1377 | struct device *dev; |
3be7db6a | 1378 | int weight, new_nid, i = 0; |
9eff1a38 | 1379 | |
2d73bae1 NA |
1380 | if (!prrn_enabled && !vphn_enabled) |
1381 | return 0; | |
1382 | ||
30c05350 NF |
1383 | weight = cpumask_weight(&cpu_associativity_changes_mask); |
1384 | if (!weight) | |
1385 | return 0; | |
1386 | ||
1387 | updates = kzalloc(weight * (sizeof(*updates)), GFP_KERNEL); | |
1388 | if (!updates) | |
1389 | return 0; | |
9eff1a38 | 1390 | |
176bbf14 JL |
1391 | cpumask_clear(&updated_cpus); |
1392 | ||
5d88aa85 | 1393 | for_each_cpu(cpu, &cpu_associativity_changes_mask) { |
3be7db6a RJ |
1394 | /* |
1395 | * If siblings aren't flagged for changes, updates list | |
1396 | * will be too short. Skip on this update and set for next | |
1397 | * update. | |
1398 | */ | |
1399 | if (!cpumask_subset(cpu_sibling_mask(cpu), | |
1400 | &cpu_associativity_changes_mask)) { | |
1401 | pr_info("Sibling bits not set for associativity " | |
1402 | "change, cpu%d\n", cpu); | |
1403 | cpumask_or(&cpu_associativity_changes_mask, | |
1404 | &cpu_associativity_changes_mask, | |
1405 | cpu_sibling_mask(cpu)); | |
1406 | cpu = cpu_last_thread_sibling(cpu); | |
1407 | continue; | |
1408 | } | |
9eff1a38 | 1409 | |
3be7db6a RJ |
1410 | /* Use associativity from first thread for all siblings */ |
1411 | vphn_get_associativity(cpu, associativity); | |
1412 | new_nid = associativity_to_nid(associativity); | |
1413 | if (new_nid < 0 || !node_online(new_nid)) | |
1414 | new_nid = first_online_node; | |
1415 | ||
1416 | if (new_nid == numa_cpu_lookup_table[cpu]) { | |
1417 | cpumask_andnot(&cpu_associativity_changes_mask, | |
1418 | &cpu_associativity_changes_mask, | |
1419 | cpu_sibling_mask(cpu)); | |
1420 | cpu = cpu_last_thread_sibling(cpu); | |
1421 | continue; | |
1422 | } | |
9eff1a38 | 1423 | |
3be7db6a RJ |
1424 | for_each_cpu(sibling, cpu_sibling_mask(cpu)) { |
1425 | ud = &updates[i++]; | |
1426 | ud->cpu = sibling; | |
1427 | ud->new_nid = new_nid; | |
1428 | ud->old_nid = numa_cpu_lookup_table[sibling]; | |
1429 | cpumask_set_cpu(sibling, &updated_cpus); | |
1430 | if (i < weight) | |
1431 | ud->next = &updates[i]; | |
1432 | } | |
1433 | cpu = cpu_last_thread_sibling(cpu); | |
30c05350 NF |
1434 | } |
1435 | ||
2d73bae1 NA |
1436 | pr_debug("Topology update for the following CPUs:\n"); |
1437 | if (cpumask_weight(&updated_cpus)) { | |
1438 | for (ud = &updates[0]; ud; ud = ud->next) { | |
1439 | pr_debug("cpu %d moving from node %d " | |
1440 | "to %d\n", ud->cpu, | |
1441 | ud->old_nid, ud->new_nid); | |
1442 | } | |
1443 | } | |
1444 | ||
9a013361 MW |
1445 | /* |
1446 | * In cases where we have nothing to update (because the updates list | |
1447 | * is too short or because the new topology is same as the old one), | |
1448 | * skip invoking update_cpu_topology() via stop-machine(). This is | |
1449 | * necessary (and not just a fast-path optimization) since stop-machine | |
1450 | * can end up electing a random CPU to run update_cpu_topology(), and | |
1451 | * thus trick us into setting up incorrect cpu-node mappings (since | |
1452 | * 'updates' is kzalloc()'ed). | |
1453 | * | |
1454 | * And for the similar reason, we will skip all the following updating. | |
1455 | */ | |
1456 | if (!cpumask_weight(&updated_cpus)) | |
1457 | goto out; | |
1458 | ||
176bbf14 | 1459 | stop_machine(update_cpu_topology, &updates[0], &updated_cpus); |
30c05350 | 1460 | |
d4edc5b6 SB |
1461 | /* |
1462 | * Update the numa-cpu lookup table with the new mappings, even for | |
1463 | * offline CPUs. It is best to perform this update from the stop- | |
1464 | * machine context. | |
1465 | */ | |
1466 | stop_machine(update_lookup_table, &updates[0], | |
1467 | cpumask_of(raw_smp_processor_id())); | |
1468 | ||
30c05350 | 1469 | for (ud = &updates[0]; ud; ud = ud->next) { |
dd023217 NF |
1470 | unregister_cpu_under_node(ud->cpu, ud->old_nid); |
1471 | register_cpu_under_node(ud->cpu, ud->new_nid); | |
1472 | ||
30c05350 | 1473 | dev = get_cpu_device(ud->cpu); |
8a25a2fd KS |
1474 | if (dev) |
1475 | kobject_uevent(&dev->kobj, KOBJ_CHANGE); | |
30c05350 | 1476 | cpumask_clear_cpu(ud->cpu, &cpu_associativity_changes_mask); |
79c5fceb | 1477 | changed = 1; |
9eff1a38 JL |
1478 | } |
1479 | ||
9a013361 | 1480 | out: |
30c05350 | 1481 | kfree(updates); |
79c5fceb | 1482 | return changed; |
9eff1a38 JL |
1483 | } |
1484 | ||
1485 | static void topology_work_fn(struct work_struct *work) | |
1486 | { | |
1487 | rebuild_sched_domains(); | |
1488 | } | |
1489 | static DECLARE_WORK(topology_work, topology_work_fn); | |
1490 | ||
ec32dd66 | 1491 | static void topology_schedule_update(void) |
9eff1a38 JL |
1492 | { |
1493 | schedule_work(&topology_work); | |
1494 | } | |
1495 | ||
1496 | static void topology_timer_fn(unsigned long ignored) | |
1497 | { | |
5d88aa85 | 1498 | if (prrn_enabled && cpumask_weight(&cpu_associativity_changes_mask)) |
9eff1a38 | 1499 | topology_schedule_update(); |
5d88aa85 JL |
1500 | else if (vphn_enabled) { |
1501 | if (update_cpu_associativity_changes_mask() > 0) | |
1502 | topology_schedule_update(); | |
1503 | reset_topology_timer(); | |
1504 | } | |
9eff1a38 JL |
1505 | } |
1506 | static struct timer_list topology_timer = | |
1507 | TIMER_INITIALIZER(topology_timer_fn, 0, 0); | |
1508 | ||
5d88aa85 | 1509 | static void reset_topology_timer(void) |
9eff1a38 JL |
1510 | { |
1511 | topology_timer.data = 0; | |
1512 | topology_timer.expires = jiffies + 60 * HZ; | |
5d88aa85 | 1513 | mod_timer(&topology_timer, topology_timer.expires); |
9eff1a38 JL |
1514 | } |
1515 | ||
601abdc3 NF |
1516 | #ifdef CONFIG_SMP |
1517 | ||
5d88aa85 JL |
1518 | static void stage_topology_update(int core_id) |
1519 | { | |
1520 | cpumask_or(&cpu_associativity_changes_mask, | |
1521 | &cpu_associativity_changes_mask, cpu_sibling_mask(core_id)); | |
1522 | reset_topology_timer(); | |
1523 | } | |
1524 | ||
1525 | static int dt_update_callback(struct notifier_block *nb, | |
1526 | unsigned long action, void *data) | |
1527 | { | |
f5242e5a | 1528 | struct of_reconfig_data *update = data; |
5d88aa85 JL |
1529 | int rc = NOTIFY_DONE; |
1530 | ||
1531 | switch (action) { | |
5d88aa85 | 1532 | case OF_RECONFIG_UPDATE_PROPERTY: |
30c05350 NF |
1533 | if (!of_prop_cmp(update->dn->type, "cpu") && |
1534 | !of_prop_cmp(update->prop->name, "ibm,associativity")) { | |
5d88aa85 JL |
1535 | u32 core_id; |
1536 | of_property_read_u32(update->dn, "reg", &core_id); | |
1537 | stage_topology_update(core_id); | |
1538 | rc = NOTIFY_OK; | |
1539 | } | |
1540 | break; | |
1541 | } | |
1542 | ||
1543 | return rc; | |
9eff1a38 JL |
1544 | } |
1545 | ||
5d88aa85 JL |
1546 | static struct notifier_block dt_update_nb = { |
1547 | .notifier_call = dt_update_callback, | |
1548 | }; | |
1549 | ||
601abdc3 NF |
1550 | #endif |
1551 | ||
9eff1a38 | 1552 | /* |
5d88aa85 | 1553 | * Start polling for associativity changes. |
9eff1a38 JL |
1554 | */ |
1555 | int start_topology_update(void) | |
1556 | { | |
1557 | int rc = 0; | |
1558 | ||
5d88aa85 JL |
1559 | if (firmware_has_feature(FW_FEATURE_PRRN)) { |
1560 | if (!prrn_enabled) { | |
1561 | prrn_enabled = 1; | |
1562 | vphn_enabled = 0; | |
601abdc3 | 1563 | #ifdef CONFIG_SMP |
5d88aa85 | 1564 | rc = of_reconfig_notifier_register(&dt_update_nb); |
601abdc3 | 1565 | #endif |
5d88aa85 | 1566 | } |
b7abef04 | 1567 | } else if (firmware_has_feature(FW_FEATURE_VPHN) && |
f13c13a0 | 1568 | lppaca_shared_proc(get_lppaca())) { |
5d88aa85 JL |
1569 | if (!vphn_enabled) { |
1570 | prrn_enabled = 0; | |
1571 | vphn_enabled = 1; | |
1572 | setup_cpu_associativity_change_counters(); | |
1573 | init_timer_deferrable(&topology_timer); | |
1574 | reset_topology_timer(); | |
1575 | } | |
9eff1a38 JL |
1576 | } |
1577 | ||
1578 | return rc; | |
1579 | } | |
9eff1a38 JL |
1580 | |
1581 | /* | |
1582 | * Disable polling for VPHN associativity changes. | |
1583 | */ | |
1584 | int stop_topology_update(void) | |
1585 | { | |
5d88aa85 JL |
1586 | int rc = 0; |
1587 | ||
1588 | if (prrn_enabled) { | |
1589 | prrn_enabled = 0; | |
601abdc3 | 1590 | #ifdef CONFIG_SMP |
5d88aa85 | 1591 | rc = of_reconfig_notifier_unregister(&dt_update_nb); |
601abdc3 | 1592 | #endif |
5d88aa85 JL |
1593 | } else if (vphn_enabled) { |
1594 | vphn_enabled = 0; | |
1595 | rc = del_timer_sync(&topology_timer); | |
1596 | } | |
1597 | ||
1598 | return rc; | |
9eff1a38 | 1599 | } |
e04fa612 NF |
1600 | |
1601 | int prrn_is_enabled(void) | |
1602 | { | |
1603 | return prrn_enabled; | |
1604 | } | |
1605 | ||
1606 | static int topology_read(struct seq_file *file, void *v) | |
1607 | { | |
1608 | if (vphn_enabled || prrn_enabled) | |
1609 | seq_puts(file, "on\n"); | |
1610 | else | |
1611 | seq_puts(file, "off\n"); | |
1612 | ||
1613 | return 0; | |
1614 | } | |
1615 | ||
1616 | static int topology_open(struct inode *inode, struct file *file) | |
1617 | { | |
1618 | return single_open(file, topology_read, NULL); | |
1619 | } | |
1620 | ||
1621 | static ssize_t topology_write(struct file *file, const char __user *buf, | |
1622 | size_t count, loff_t *off) | |
1623 | { | |
1624 | char kbuf[4]; /* "on" or "off" plus null. */ | |
1625 | int read_len; | |
1626 | ||
1627 | read_len = count < 3 ? count : 3; | |
1628 | if (copy_from_user(kbuf, buf, read_len)) | |
1629 | return -EINVAL; | |
1630 | ||
1631 | kbuf[read_len] = '\0'; | |
1632 | ||
1633 | if (!strncmp(kbuf, "on", 2)) | |
1634 | start_topology_update(); | |
1635 | else if (!strncmp(kbuf, "off", 3)) | |
1636 | stop_topology_update(); | |
1637 | else | |
1638 | return -EINVAL; | |
1639 | ||
1640 | return count; | |
1641 | } | |
1642 | ||
1643 | static const struct file_operations topology_ops = { | |
1644 | .read = seq_read, | |
1645 | .write = topology_write, | |
1646 | .open = topology_open, | |
1647 | .release = single_release | |
1648 | }; | |
1649 | ||
1650 | static int topology_update_init(void) | |
1651 | { | |
2d73bae1 NA |
1652 | /* Do not poll for changes if disabled at boot */ |
1653 | if (topology_updates_enabled) | |
1654 | start_topology_update(); | |
1655 | ||
2d15b9b4 NA |
1656 | if (!proc_create("powerpc/topology_updates", 0644, NULL, &topology_ops)) |
1657 | return -ENOMEM; | |
e04fa612 NF |
1658 | |
1659 | return 0; | |
9eff1a38 | 1660 | } |
e04fa612 | 1661 | device_initcall(topology_update_init); |
39bf990e | 1662 | #endif /* CONFIG_PPC_SPLPAR */ |