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