]>
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 | */ | |
11 | #include <linux/threads.h> | |
12 | #include <linux/bootmem.h> | |
13 | #include <linux/init.h> | |
14 | #include <linux/mm.h> | |
15 | #include <linux/mmzone.h> | |
16 | #include <linux/module.h> | |
17 | #include <linux/nodemask.h> | |
18 | #include <linux/cpu.h> | |
19 | #include <linux/notifier.h> | |
95f72d1e | 20 | #include <linux/memblock.h> |
6df1646e | 21 | #include <linux/of.h> |
06eccea6 | 22 | #include <linux/pfn.h> |
9eff1a38 JL |
23 | #include <linux/cpuset.h> |
24 | #include <linux/node.h> | |
45fb6cea | 25 | #include <asm/sparsemem.h> |
d9b2b2a2 | 26 | #include <asm/prom.h> |
cf00a8d1 | 27 | #include <asm/system.h> |
2249ca9d | 28 | #include <asm/smp.h> |
9eff1a38 JL |
29 | #include <asm/firmware.h> |
30 | #include <asm/paca.h> | |
39bf990e | 31 | #include <asm/hvcall.h> |
1da177e4 LT |
32 | |
33 | static int numa_enabled = 1; | |
34 | ||
1daa6d08 BS |
35 | static char *cmdline __initdata; |
36 | ||
1da177e4 LT |
37 | static int numa_debug; |
38 | #define dbg(args...) if (numa_debug) { printk(KERN_INFO args); } | |
39 | ||
45fb6cea | 40 | int numa_cpu_lookup_table[NR_CPUS]; |
25863de0 | 41 | cpumask_var_t node_to_cpumask_map[MAX_NUMNODES]; |
1da177e4 | 42 | struct pglist_data *node_data[MAX_NUMNODES]; |
45fb6cea AB |
43 | |
44 | EXPORT_SYMBOL(numa_cpu_lookup_table); | |
25863de0 | 45 | EXPORT_SYMBOL(node_to_cpumask_map); |
45fb6cea AB |
46 | EXPORT_SYMBOL(node_data); |
47 | ||
1da177e4 | 48 | static int min_common_depth; |
237a0989 | 49 | static int n_mem_addr_cells, n_mem_size_cells; |
41eab6f8 AB |
50 | static int form1_affinity; |
51 | ||
52 | #define MAX_DISTANCE_REF_POINTS 4 | |
53 | static int distance_ref_points_depth; | |
54 | static const unsigned int *distance_ref_points; | |
55 | static int distance_lookup_table[MAX_NUMNODES][MAX_DISTANCE_REF_POINTS]; | |
1da177e4 | 56 | |
25863de0 AB |
57 | /* |
58 | * Allocate node_to_cpumask_map based on number of available nodes | |
59 | * Requires node_possible_map to be valid. | |
60 | * | |
61 | * Note: node_to_cpumask() is not valid until after this is done. | |
62 | */ | |
63 | static void __init setup_node_to_cpumask_map(void) | |
64 | { | |
65 | unsigned int node, num = 0; | |
66 | ||
67 | /* setup nr_node_ids if not done yet */ | |
68 | if (nr_node_ids == MAX_NUMNODES) { | |
69 | for_each_node_mask(node, node_possible_map) | |
70 | num = node; | |
71 | nr_node_ids = num + 1; | |
72 | } | |
73 | ||
74 | /* allocate the map */ | |
75 | for (node = 0; node < nr_node_ids; node++) | |
76 | alloc_bootmem_cpumask_var(&node_to_cpumask_map[node]); | |
77 | ||
78 | /* cpumask_of_node() will now work */ | |
79 | dbg("Node to cpumask map for %d nodes\n", nr_node_ids); | |
80 | } | |
81 | ||
1daa6d08 BS |
82 | static int __cpuinit fake_numa_create_new_node(unsigned long end_pfn, |
83 | unsigned int *nid) | |
84 | { | |
85 | unsigned long long mem; | |
86 | char *p = cmdline; | |
87 | static unsigned int fake_nid; | |
88 | static unsigned long long curr_boundary; | |
89 | ||
90 | /* | |
91 | * Modify node id, iff we started creating NUMA nodes | |
92 | * We want to continue from where we left of the last time | |
93 | */ | |
94 | if (fake_nid) | |
95 | *nid = fake_nid; | |
96 | /* | |
97 | * In case there are no more arguments to parse, the | |
98 | * node_id should be the same as the last fake node id | |
99 | * (we've handled this above). | |
100 | */ | |
101 | if (!p) | |
102 | return 0; | |
103 | ||
104 | mem = memparse(p, &p); | |
105 | if (!mem) | |
106 | return 0; | |
107 | ||
108 | if (mem < curr_boundary) | |
109 | return 0; | |
110 | ||
111 | curr_boundary = mem; | |
112 | ||
113 | if ((end_pfn << PAGE_SHIFT) > mem) { | |
114 | /* | |
115 | * Skip commas and spaces | |
116 | */ | |
117 | while (*p == ',' || *p == ' ' || *p == '\t') | |
118 | p++; | |
119 | ||
120 | cmdline = p; | |
121 | fake_nid++; | |
122 | *nid = fake_nid; | |
123 | dbg("created new fake_node with id %d\n", fake_nid); | |
124 | return 1; | |
125 | } | |
126 | return 0; | |
127 | } | |
128 | ||
8f64e1f2 JT |
129 | /* |
130 | * get_active_region_work_fn - A helper function for get_node_active_region | |
131 | * Returns datax set to the start_pfn and end_pfn if they contain | |
132 | * the initial value of datax->start_pfn between them | |
133 | * @start_pfn: start page(inclusive) of region to check | |
134 | * @end_pfn: end page(exclusive) of region to check | |
135 | * @datax: comes in with ->start_pfn set to value to search for and | |
136 | * goes out with active range if it contains it | |
137 | * Returns 1 if search value is in range else 0 | |
138 | */ | |
139 | static int __init get_active_region_work_fn(unsigned long start_pfn, | |
140 | unsigned long end_pfn, void *datax) | |
141 | { | |
142 | struct node_active_region *data; | |
143 | data = (struct node_active_region *)datax; | |
144 | ||
145 | if (start_pfn <= data->start_pfn && end_pfn > data->start_pfn) { | |
146 | data->start_pfn = start_pfn; | |
147 | data->end_pfn = end_pfn; | |
148 | return 1; | |
149 | } | |
150 | return 0; | |
151 | ||
152 | } | |
153 | ||
154 | /* | |
155 | * get_node_active_region - Return active region containing start_pfn | |
e8170372 | 156 | * Active range returned is empty if none found. |
8f64e1f2 JT |
157 | * @start_pfn: The page to return the region for. |
158 | * @node_ar: Returned set to the active region containing start_pfn | |
159 | */ | |
160 | static void __init get_node_active_region(unsigned long start_pfn, | |
161 | struct node_active_region *node_ar) | |
162 | { | |
163 | int nid = early_pfn_to_nid(start_pfn); | |
164 | ||
165 | node_ar->nid = nid; | |
166 | node_ar->start_pfn = start_pfn; | |
e8170372 | 167 | node_ar->end_pfn = start_pfn; |
8f64e1f2 JT |
168 | work_with_active_regions(nid, get_active_region_work_fn, node_ar); |
169 | } | |
170 | ||
39bf990e | 171 | static void map_cpu_to_node(int cpu, int node) |
1da177e4 LT |
172 | { |
173 | numa_cpu_lookup_table[cpu] = node; | |
45fb6cea | 174 | |
bf4b85b0 NL |
175 | dbg("adding cpu %d to node %d\n", cpu, node); |
176 | ||
25863de0 AB |
177 | if (!(cpumask_test_cpu(cpu, node_to_cpumask_map[node]))) |
178 | cpumask_set_cpu(cpu, node_to_cpumask_map[node]); | |
1da177e4 LT |
179 | } |
180 | ||
39bf990e | 181 | #if defined(CONFIG_HOTPLUG_CPU) || defined(CONFIG_PPC_SPLPAR) |
1da177e4 LT |
182 | static void unmap_cpu_from_node(unsigned long cpu) |
183 | { | |
184 | int node = numa_cpu_lookup_table[cpu]; | |
185 | ||
186 | dbg("removing cpu %lu from node %d\n", cpu, node); | |
187 | ||
25863de0 | 188 | if (cpumask_test_cpu(cpu, node_to_cpumask_map[node])) { |
429f4d8d | 189 | cpumask_clear_cpu(cpu, node_to_cpumask_map[node]); |
1da177e4 LT |
190 | } else { |
191 | printk(KERN_ERR "WARNING: cpu %lu not found in node %d\n", | |
192 | cpu, node); | |
193 | } | |
194 | } | |
39bf990e | 195 | #endif /* CONFIG_HOTPLUG_CPU || CONFIG_PPC_SPLPAR */ |
1da177e4 | 196 | |
1da177e4 | 197 | /* must hold reference to node during call */ |
a7f67bdf | 198 | static const int *of_get_associativity(struct device_node *dev) |
1da177e4 | 199 | { |
e2eb6392 | 200 | return of_get_property(dev, "ibm,associativity", NULL); |
1da177e4 LT |
201 | } |
202 | ||
cf00085d C |
203 | /* |
204 | * Returns the property linux,drconf-usable-memory if | |
205 | * it exists (the property exists only in kexec/kdump kernels, | |
206 | * added by kexec-tools) | |
207 | */ | |
208 | static const u32 *of_get_usable_memory(struct device_node *memory) | |
209 | { | |
210 | const u32 *prop; | |
211 | u32 len; | |
212 | prop = of_get_property(memory, "linux,drconf-usable-memory", &len); | |
213 | if (!prop || len < sizeof(unsigned int)) | |
214 | return 0; | |
215 | return prop; | |
216 | } | |
217 | ||
41eab6f8 AB |
218 | int __node_distance(int a, int b) |
219 | { | |
220 | int i; | |
221 | int distance = LOCAL_DISTANCE; | |
222 | ||
223 | if (!form1_affinity) | |
224 | return distance; | |
225 | ||
226 | for (i = 0; i < distance_ref_points_depth; i++) { | |
227 | if (distance_lookup_table[a][i] == distance_lookup_table[b][i]) | |
228 | break; | |
229 | ||
230 | /* Double the distance for each NUMA level */ | |
231 | distance *= 2; | |
232 | } | |
233 | ||
234 | return distance; | |
235 | } | |
236 | ||
237 | static void initialize_distance_lookup_table(int nid, | |
238 | const unsigned int *associativity) | |
239 | { | |
240 | int i; | |
241 | ||
242 | if (!form1_affinity) | |
243 | return; | |
244 | ||
245 | for (i = 0; i < distance_ref_points_depth; i++) { | |
246 | distance_lookup_table[nid][i] = | |
247 | associativity[distance_ref_points[i]]; | |
248 | } | |
249 | } | |
250 | ||
482ec7c4 NL |
251 | /* Returns nid in the range [0..MAX_NUMNODES-1], or -1 if no useful numa |
252 | * info is found. | |
253 | */ | |
9eff1a38 | 254 | static int associativity_to_nid(const unsigned int *associativity) |
1da177e4 | 255 | { |
482ec7c4 | 256 | int nid = -1; |
1da177e4 LT |
257 | |
258 | if (min_common_depth == -1) | |
482ec7c4 | 259 | goto out; |
1da177e4 | 260 | |
9eff1a38 JL |
261 | if (associativity[0] >= min_common_depth) |
262 | nid = associativity[min_common_depth]; | |
bc16a759 NL |
263 | |
264 | /* POWER4 LPAR uses 0xffff as invalid node */ | |
482ec7c4 NL |
265 | if (nid == 0xffff || nid >= MAX_NUMNODES) |
266 | nid = -1; | |
41eab6f8 | 267 | |
9eff1a38 JL |
268 | if (nid > 0 && associativity[0] >= distance_ref_points_depth) |
269 | initialize_distance_lookup_table(nid, associativity); | |
41eab6f8 | 270 | |
482ec7c4 | 271 | out: |
cf950b7a | 272 | return nid; |
1da177e4 LT |
273 | } |
274 | ||
9eff1a38 JL |
275 | /* Returns the nid associated with the given device tree node, |
276 | * or -1 if not found. | |
277 | */ | |
278 | static int of_node_to_nid_single(struct device_node *device) | |
279 | { | |
280 | int nid = -1; | |
281 | const unsigned int *tmp; | |
282 | ||
283 | tmp = of_get_associativity(device); | |
284 | if (tmp) | |
285 | nid = associativity_to_nid(tmp); | |
286 | return nid; | |
287 | } | |
288 | ||
953039c8 JK |
289 | /* Walk the device tree upwards, looking for an associativity id */ |
290 | int of_node_to_nid(struct device_node *device) | |
291 | { | |
292 | struct device_node *tmp; | |
293 | int nid = -1; | |
294 | ||
295 | of_node_get(device); | |
296 | while (device) { | |
297 | nid = of_node_to_nid_single(device); | |
298 | if (nid != -1) | |
299 | break; | |
300 | ||
301 | tmp = device; | |
302 | device = of_get_parent(tmp); | |
303 | of_node_put(tmp); | |
304 | } | |
305 | of_node_put(device); | |
306 | ||
307 | return nid; | |
308 | } | |
309 | EXPORT_SYMBOL_GPL(of_node_to_nid); | |
310 | ||
1da177e4 LT |
311 | static int __init find_min_common_depth(void) |
312 | { | |
41eab6f8 | 313 | int depth; |
bc8449cc | 314 | struct device_node *chosen; |
e70606eb | 315 | struct device_node *root; |
bc8449cc | 316 | const char *vec5; |
1da177e4 | 317 | |
e70606eb ME |
318 | root = of_find_node_by_path("/rtas"); |
319 | if (!root) | |
320 | root = of_find_node_by_path("/"); | |
1da177e4 LT |
321 | |
322 | /* | |
41eab6f8 AB |
323 | * This property is a set of 32-bit integers, each representing |
324 | * an index into the ibm,associativity nodes. | |
325 | * | |
326 | * With form 0 affinity the first integer is for an SMP configuration | |
327 | * (should be all 0's) and the second is for a normal NUMA | |
328 | * configuration. We have only one level of NUMA. | |
329 | * | |
330 | * With form 1 affinity the first integer is the most significant | |
331 | * NUMA boundary and the following are progressively less significant | |
332 | * boundaries. There can be more than one level of NUMA. | |
1da177e4 | 333 | */ |
e70606eb | 334 | distance_ref_points = of_get_property(root, |
41eab6f8 AB |
335 | "ibm,associativity-reference-points", |
336 | &distance_ref_points_depth); | |
337 | ||
338 | if (!distance_ref_points) { | |
339 | dbg("NUMA: ibm,associativity-reference-points not found.\n"); | |
340 | goto err; | |
341 | } | |
342 | ||
343 | distance_ref_points_depth /= sizeof(int); | |
1da177e4 | 344 | |
bc8449cc AB |
345 | #define VEC5_AFFINITY_BYTE 5 |
346 | #define VEC5_AFFINITY 0x80 | |
347 | chosen = of_find_node_by_path("/chosen"); | |
348 | if (chosen) { | |
349 | vec5 = of_get_property(chosen, "ibm,architecture-vec-5", NULL); | |
350 | if (vec5 && (vec5[VEC5_AFFINITY_BYTE] & VEC5_AFFINITY)) { | |
351 | dbg("Using form 1 affinity\n"); | |
41eab6f8 | 352 | form1_affinity = 1; |
bc8449cc | 353 | } |
4b83c330 AB |
354 | } |
355 | ||
41eab6f8 AB |
356 | if (form1_affinity) { |
357 | depth = distance_ref_points[0]; | |
1da177e4 | 358 | } else { |
41eab6f8 AB |
359 | if (distance_ref_points_depth < 2) { |
360 | printk(KERN_WARNING "NUMA: " | |
361 | "short ibm,associativity-reference-points\n"); | |
362 | goto err; | |
363 | } | |
364 | ||
365 | depth = distance_ref_points[1]; | |
1da177e4 | 366 | } |
1da177e4 | 367 | |
41eab6f8 AB |
368 | /* |
369 | * Warn and cap if the hardware supports more than | |
370 | * MAX_DISTANCE_REF_POINTS domains. | |
371 | */ | |
372 | if (distance_ref_points_depth > MAX_DISTANCE_REF_POINTS) { | |
373 | printk(KERN_WARNING "NUMA: distance array capped at " | |
374 | "%d entries\n", MAX_DISTANCE_REF_POINTS); | |
375 | distance_ref_points_depth = MAX_DISTANCE_REF_POINTS; | |
376 | } | |
377 | ||
e70606eb | 378 | of_node_put(root); |
1da177e4 | 379 | return depth; |
41eab6f8 AB |
380 | |
381 | err: | |
e70606eb | 382 | of_node_put(root); |
41eab6f8 | 383 | return -1; |
1da177e4 LT |
384 | } |
385 | ||
84c9fdd1 | 386 | static void __init get_n_mem_cells(int *n_addr_cells, int *n_size_cells) |
1da177e4 LT |
387 | { |
388 | struct device_node *memory = NULL; | |
1da177e4 LT |
389 | |
390 | memory = of_find_node_by_type(memory, "memory"); | |
54c23310 | 391 | if (!memory) |
84c9fdd1 | 392 | panic("numa.c: No memory nodes found!"); |
54c23310 | 393 | |
a8bda5dd | 394 | *n_addr_cells = of_n_addr_cells(memory); |
9213feea | 395 | *n_size_cells = of_n_size_cells(memory); |
84c9fdd1 | 396 | of_node_put(memory); |
1da177e4 LT |
397 | } |
398 | ||
a7f67bdf | 399 | static unsigned long __devinit read_n_cells(int n, const unsigned int **buf) |
1da177e4 LT |
400 | { |
401 | unsigned long result = 0; | |
402 | ||
403 | while (n--) { | |
404 | result = (result << 32) | **buf; | |
405 | (*buf)++; | |
406 | } | |
407 | return result; | |
408 | } | |
409 | ||
8342681d NF |
410 | struct of_drconf_cell { |
411 | u64 base_addr; | |
412 | u32 drc_index; | |
413 | u32 reserved; | |
414 | u32 aa_index; | |
415 | u32 flags; | |
416 | }; | |
417 | ||
418 | #define DRCONF_MEM_ASSIGNED 0x00000008 | |
419 | #define DRCONF_MEM_AI_INVALID 0x00000040 | |
420 | #define DRCONF_MEM_RESERVED 0x00000080 | |
421 | ||
422 | /* | |
95f72d1e | 423 | * Read the next memblock list entry from the ibm,dynamic-memory property |
8342681d NF |
424 | * and return the information in the provided of_drconf_cell structure. |
425 | */ | |
426 | static void read_drconf_cell(struct of_drconf_cell *drmem, const u32 **cellp) | |
427 | { | |
428 | const u32 *cp; | |
429 | ||
430 | drmem->base_addr = read_n_cells(n_mem_addr_cells, cellp); | |
431 | ||
432 | cp = *cellp; | |
433 | drmem->drc_index = cp[0]; | |
434 | drmem->reserved = cp[1]; | |
435 | drmem->aa_index = cp[2]; | |
436 | drmem->flags = cp[3]; | |
437 | ||
438 | *cellp = cp + 4; | |
439 | } | |
440 | ||
441 | /* | |
25985edc | 442 | * Retrieve and validate the ibm,dynamic-memory property of the device tree. |
8342681d | 443 | * |
95f72d1e YL |
444 | * The layout of the ibm,dynamic-memory property is a number N of memblock |
445 | * list entries followed by N memblock list entries. Each memblock list entry | |
25985edc | 446 | * contains information as laid out in the of_drconf_cell struct above. |
8342681d NF |
447 | */ |
448 | static int of_get_drconf_memory(struct device_node *memory, const u32 **dm) | |
449 | { | |
450 | const u32 *prop; | |
451 | u32 len, entries; | |
452 | ||
453 | prop = of_get_property(memory, "ibm,dynamic-memory", &len); | |
454 | if (!prop || len < sizeof(unsigned int)) | |
455 | return 0; | |
456 | ||
457 | entries = *prop++; | |
458 | ||
459 | /* Now that we know the number of entries, revalidate the size | |
460 | * of the property read in to ensure we have everything | |
461 | */ | |
462 | if (len < (entries * (n_mem_addr_cells + 4) + 1) * sizeof(unsigned int)) | |
463 | return 0; | |
464 | ||
465 | *dm = prop; | |
466 | return entries; | |
467 | } | |
468 | ||
469 | /* | |
25985edc | 470 | * Retrieve and validate the ibm,lmb-size property for drconf memory |
8342681d NF |
471 | * from the device tree. |
472 | */ | |
3fdfd990 | 473 | static u64 of_get_lmb_size(struct device_node *memory) |
8342681d NF |
474 | { |
475 | const u32 *prop; | |
476 | u32 len; | |
477 | ||
3fdfd990 | 478 | prop = of_get_property(memory, "ibm,lmb-size", &len); |
8342681d NF |
479 | if (!prop || len < sizeof(unsigned int)) |
480 | return 0; | |
481 | ||
482 | return read_n_cells(n_mem_size_cells, &prop); | |
483 | } | |
484 | ||
485 | struct assoc_arrays { | |
486 | u32 n_arrays; | |
487 | u32 array_sz; | |
488 | const u32 *arrays; | |
489 | }; | |
490 | ||
491 | /* | |
25985edc | 492 | * Retrieve and validate the list of associativity arrays for drconf |
8342681d NF |
493 | * memory from the ibm,associativity-lookup-arrays property of the |
494 | * device tree.. | |
495 | * | |
496 | * The layout of the ibm,associativity-lookup-arrays property is a number N | |
497 | * indicating the number of associativity arrays, followed by a number M | |
498 | * indicating the size of each associativity array, followed by a list | |
499 | * of N associativity arrays. | |
500 | */ | |
501 | static int of_get_assoc_arrays(struct device_node *memory, | |
502 | struct assoc_arrays *aa) | |
503 | { | |
504 | const u32 *prop; | |
505 | u32 len; | |
506 | ||
507 | prop = of_get_property(memory, "ibm,associativity-lookup-arrays", &len); | |
508 | if (!prop || len < 2 * sizeof(unsigned int)) | |
509 | return -1; | |
510 | ||
511 | aa->n_arrays = *prop++; | |
512 | aa->array_sz = *prop++; | |
513 | ||
514 | /* Now that we know the number of arrrays and size of each array, | |
515 | * revalidate the size of the property read in. | |
516 | */ | |
517 | if (len < (aa->n_arrays * aa->array_sz + 2) * sizeof(unsigned int)) | |
518 | return -1; | |
519 | ||
520 | aa->arrays = prop; | |
521 | return 0; | |
522 | } | |
523 | ||
524 | /* | |
525 | * This is like of_node_to_nid_single() for memory represented in the | |
526 | * ibm,dynamic-reconfiguration-memory node. | |
527 | */ | |
528 | static int of_drconf_to_nid_single(struct of_drconf_cell *drmem, | |
529 | struct assoc_arrays *aa) | |
530 | { | |
531 | int default_nid = 0; | |
532 | int nid = default_nid; | |
533 | int index; | |
534 | ||
535 | if (min_common_depth > 0 && min_common_depth <= aa->array_sz && | |
536 | !(drmem->flags & DRCONF_MEM_AI_INVALID) && | |
537 | drmem->aa_index < aa->n_arrays) { | |
538 | index = drmem->aa_index * aa->array_sz + min_common_depth - 1; | |
539 | nid = aa->arrays[index]; | |
540 | ||
541 | if (nid == 0xffff || nid >= MAX_NUMNODES) | |
542 | nid = default_nid; | |
543 | } | |
544 | ||
545 | return nid; | |
546 | } | |
547 | ||
1da177e4 LT |
548 | /* |
549 | * Figure out to which domain a cpu belongs and stick it there. | |
550 | * Return the id of the domain used. | |
551 | */ | |
2e5ce39d | 552 | static int __cpuinit numa_setup_cpu(unsigned long lcpu) |
1da177e4 | 553 | { |
cf950b7a | 554 | int nid = 0; |
8b16cd23 | 555 | struct device_node *cpu = of_get_cpu_node(lcpu, NULL); |
1da177e4 LT |
556 | |
557 | if (!cpu) { | |
558 | WARN_ON(1); | |
559 | goto out; | |
560 | } | |
561 | ||
953039c8 | 562 | nid = of_node_to_nid_single(cpu); |
1da177e4 | 563 | |
482ec7c4 | 564 | if (nid < 0 || !node_online(nid)) |
72c33688 | 565 | nid = first_online_node; |
1da177e4 | 566 | out: |
cf950b7a | 567 | map_cpu_to_node(lcpu, nid); |
1da177e4 LT |
568 | |
569 | of_node_put(cpu); | |
570 | ||
cf950b7a | 571 | return nid; |
1da177e4 LT |
572 | } |
573 | ||
74b85f37 | 574 | static int __cpuinit cpu_numa_callback(struct notifier_block *nfb, |
1da177e4 LT |
575 | unsigned long action, |
576 | void *hcpu) | |
577 | { | |
578 | unsigned long lcpu = (unsigned long)hcpu; | |
579 | int ret = NOTIFY_DONE; | |
580 | ||
581 | switch (action) { | |
582 | case CPU_UP_PREPARE: | |
8bb78442 | 583 | case CPU_UP_PREPARE_FROZEN: |
2b261227 | 584 | numa_setup_cpu(lcpu); |
1da177e4 LT |
585 | ret = NOTIFY_OK; |
586 | break; | |
587 | #ifdef CONFIG_HOTPLUG_CPU | |
588 | case CPU_DEAD: | |
8bb78442 | 589 | case CPU_DEAD_FROZEN: |
1da177e4 | 590 | case CPU_UP_CANCELED: |
8bb78442 | 591 | case CPU_UP_CANCELED_FROZEN: |
1da177e4 LT |
592 | unmap_cpu_from_node(lcpu); |
593 | break; | |
594 | ret = NOTIFY_OK; | |
595 | #endif | |
596 | } | |
597 | return ret; | |
598 | } | |
599 | ||
600 | /* | |
601 | * Check and possibly modify a memory region to enforce the memory limit. | |
602 | * | |
603 | * Returns the size the region should have to enforce the memory limit. | |
604 | * This will either be the original value of size, a truncated value, | |
605 | * or zero. If the returned value of size is 0 the region should be | |
25985edc | 606 | * discarded as it lies wholly above the memory limit. |
1da177e4 | 607 | */ |
45fb6cea AB |
608 | static unsigned long __init numa_enforce_memory_limit(unsigned long start, |
609 | unsigned long size) | |
1da177e4 LT |
610 | { |
611 | /* | |
95f72d1e | 612 | * We use memblock_end_of_DRAM() in here instead of memory_limit because |
1da177e4 | 613 | * we've already adjusted it for the limit and it takes care of |
fe55249d MM |
614 | * having memory holes below the limit. Also, in the case of |
615 | * iommu_is_off, memory_limit is not set but is implicitly enforced. | |
1da177e4 | 616 | */ |
1da177e4 | 617 | |
95f72d1e | 618 | if (start + size <= memblock_end_of_DRAM()) |
1da177e4 LT |
619 | return size; |
620 | ||
95f72d1e | 621 | if (start >= memblock_end_of_DRAM()) |
1da177e4 LT |
622 | return 0; |
623 | ||
95f72d1e | 624 | return memblock_end_of_DRAM() - start; |
1da177e4 LT |
625 | } |
626 | ||
cf00085d C |
627 | /* |
628 | * Reads the counter for a given entry in | |
629 | * linux,drconf-usable-memory property | |
630 | */ | |
631 | static inline int __init read_usm_ranges(const u32 **usm) | |
632 | { | |
633 | /* | |
3fdfd990 | 634 | * For each lmb in ibm,dynamic-memory a corresponding |
cf00085d C |
635 | * entry in linux,drconf-usable-memory property contains |
636 | * a counter followed by that many (base, size) duple. | |
637 | * read the counter from linux,drconf-usable-memory | |
638 | */ | |
639 | return read_n_cells(n_mem_size_cells, usm); | |
640 | } | |
641 | ||
0204568a PM |
642 | /* |
643 | * Extract NUMA information from the ibm,dynamic-reconfiguration-memory | |
644 | * node. This assumes n_mem_{addr,size}_cells have been set. | |
645 | */ | |
646 | static void __init parse_drconf_memory(struct device_node *memory) | |
647 | { | |
cf00085d C |
648 | const u32 *dm, *usm; |
649 | unsigned int n, rc, ranges, is_kexec_kdump = 0; | |
3fdfd990 | 650 | unsigned long lmb_size, base, size, sz; |
8342681d NF |
651 | int nid; |
652 | struct assoc_arrays aa; | |
653 | ||
654 | n = of_get_drconf_memory(memory, &dm); | |
655 | if (!n) | |
0204568a PM |
656 | return; |
657 | ||
3fdfd990 BH |
658 | lmb_size = of_get_lmb_size(memory); |
659 | if (!lmb_size) | |
8342681d NF |
660 | return; |
661 | ||
662 | rc = of_get_assoc_arrays(memory, &aa); | |
663 | if (rc) | |
0204568a PM |
664 | return; |
665 | ||
cf00085d C |
666 | /* check if this is a kexec/kdump kernel */ |
667 | usm = of_get_usable_memory(memory); | |
668 | if (usm != NULL) | |
669 | is_kexec_kdump = 1; | |
670 | ||
0204568a | 671 | for (; n != 0; --n) { |
8342681d NF |
672 | struct of_drconf_cell drmem; |
673 | ||
674 | read_drconf_cell(&drmem, &dm); | |
675 | ||
676 | /* skip this block if the reserved bit is set in flags (0x80) | |
677 | or if the block is not assigned to this partition (0x8) */ | |
678 | if ((drmem.flags & DRCONF_MEM_RESERVED) | |
679 | || !(drmem.flags & DRCONF_MEM_ASSIGNED)) | |
0204568a | 680 | continue; |
1daa6d08 | 681 | |
cf00085d | 682 | base = drmem.base_addr; |
3fdfd990 | 683 | size = lmb_size; |
cf00085d | 684 | ranges = 1; |
8342681d | 685 | |
cf00085d C |
686 | if (is_kexec_kdump) { |
687 | ranges = read_usm_ranges(&usm); | |
688 | if (!ranges) /* there are no (base, size) duple */ | |
689 | continue; | |
690 | } | |
691 | do { | |
692 | if (is_kexec_kdump) { | |
693 | base = read_n_cells(n_mem_addr_cells, &usm); | |
694 | size = read_n_cells(n_mem_size_cells, &usm); | |
695 | } | |
696 | nid = of_drconf_to_nid_single(&drmem, &aa); | |
697 | fake_numa_create_new_node( | |
698 | ((base + size) >> PAGE_SHIFT), | |
8342681d | 699 | &nid); |
cf00085d C |
700 | node_set_online(nid); |
701 | sz = numa_enforce_memory_limit(base, size); | |
702 | if (sz) | |
703 | add_active_range(nid, base >> PAGE_SHIFT, | |
704 | (base >> PAGE_SHIFT) | |
705 | + (sz >> PAGE_SHIFT)); | |
706 | } while (--ranges); | |
0204568a PM |
707 | } |
708 | } | |
709 | ||
1da177e4 LT |
710 | static int __init parse_numa_properties(void) |
711 | { | |
712 | struct device_node *cpu = NULL; | |
713 | struct device_node *memory = NULL; | |
482ec7c4 | 714 | int default_nid = 0; |
1da177e4 LT |
715 | unsigned long i; |
716 | ||
717 | if (numa_enabled == 0) { | |
718 | printk(KERN_WARNING "NUMA disabled by user\n"); | |
719 | return -1; | |
720 | } | |
721 | ||
1da177e4 LT |
722 | min_common_depth = find_min_common_depth(); |
723 | ||
1da177e4 LT |
724 | if (min_common_depth < 0) |
725 | return min_common_depth; | |
726 | ||
bf4b85b0 NL |
727 | dbg("NUMA associativity depth for CPU/Memory: %d\n", min_common_depth); |
728 | ||
1da177e4 | 729 | /* |
482ec7c4 NL |
730 | * Even though we connect cpus to numa domains later in SMP |
731 | * init, we need to know the node ids now. This is because | |
732 | * each node to be onlined must have NODE_DATA etc backing it. | |
1da177e4 | 733 | */ |
482ec7c4 | 734 | for_each_present_cpu(i) { |
cf950b7a | 735 | int nid; |
1da177e4 | 736 | |
8b16cd23 | 737 | cpu = of_get_cpu_node(i, NULL); |
482ec7c4 | 738 | BUG_ON(!cpu); |
953039c8 | 739 | nid = of_node_to_nid_single(cpu); |
482ec7c4 | 740 | of_node_put(cpu); |
1da177e4 | 741 | |
482ec7c4 NL |
742 | /* |
743 | * Don't fall back to default_nid yet -- we will plug | |
744 | * cpus into nodes once the memory scan has discovered | |
745 | * the topology. | |
746 | */ | |
747 | if (nid < 0) | |
748 | continue; | |
749 | node_set_online(nid); | |
1da177e4 LT |
750 | } |
751 | ||
237a0989 | 752 | get_n_mem_cells(&n_mem_addr_cells, &n_mem_size_cells); |
1da177e4 LT |
753 | memory = NULL; |
754 | while ((memory = of_find_node_by_type(memory, "memory")) != NULL) { | |
755 | unsigned long start; | |
756 | unsigned long size; | |
cf950b7a | 757 | int nid; |
1da177e4 | 758 | int ranges; |
a7f67bdf | 759 | const unsigned int *memcell_buf; |
1da177e4 LT |
760 | unsigned int len; |
761 | ||
e2eb6392 | 762 | memcell_buf = of_get_property(memory, |
ba759485 ME |
763 | "linux,usable-memory", &len); |
764 | if (!memcell_buf || len <= 0) | |
e2eb6392 | 765 | memcell_buf = of_get_property(memory, "reg", &len); |
1da177e4 LT |
766 | if (!memcell_buf || len <= 0) |
767 | continue; | |
768 | ||
cc5d0189 BH |
769 | /* ranges in cell */ |
770 | ranges = (len >> 2) / (n_mem_addr_cells + n_mem_size_cells); | |
1da177e4 LT |
771 | new_range: |
772 | /* these are order-sensitive, and modify the buffer pointer */ | |
237a0989 MK |
773 | start = read_n_cells(n_mem_addr_cells, &memcell_buf); |
774 | size = read_n_cells(n_mem_size_cells, &memcell_buf); | |
1da177e4 | 775 | |
482ec7c4 NL |
776 | /* |
777 | * Assumption: either all memory nodes or none will | |
778 | * have associativity properties. If none, then | |
779 | * everything goes to default_nid. | |
780 | */ | |
953039c8 | 781 | nid = of_node_to_nid_single(memory); |
482ec7c4 NL |
782 | if (nid < 0) |
783 | nid = default_nid; | |
1daa6d08 BS |
784 | |
785 | fake_numa_create_new_node(((start + size) >> PAGE_SHIFT), &nid); | |
482ec7c4 | 786 | node_set_online(nid); |
1da177e4 | 787 | |
45fb6cea | 788 | if (!(size = numa_enforce_memory_limit(start, size))) { |
1da177e4 LT |
789 | if (--ranges) |
790 | goto new_range; | |
791 | else | |
792 | continue; | |
793 | } | |
794 | ||
c67c3cb4 MG |
795 | add_active_range(nid, start >> PAGE_SHIFT, |
796 | (start >> PAGE_SHIFT) + (size >> PAGE_SHIFT)); | |
1da177e4 LT |
797 | |
798 | if (--ranges) | |
799 | goto new_range; | |
800 | } | |
801 | ||
0204568a | 802 | /* |
95f72d1e | 803 | * Now do the same thing for each MEMBLOCK listed in the ibm,dynamic-memory |
0204568a PM |
804 | * property in the ibm,dynamic-reconfiguration-memory node. |
805 | */ | |
806 | memory = of_find_node_by_path("/ibm,dynamic-reconfiguration-memory"); | |
807 | if (memory) | |
808 | parse_drconf_memory(memory); | |
809 | ||
1da177e4 LT |
810 | return 0; |
811 | } | |
812 | ||
813 | static void __init setup_nonnuma(void) | |
814 | { | |
95f72d1e YL |
815 | unsigned long top_of_ram = memblock_end_of_DRAM(); |
816 | unsigned long total_ram = memblock_phys_mem_size(); | |
c67c3cb4 | 817 | unsigned long start_pfn, end_pfn; |
28be7072 BH |
818 | unsigned int nid = 0; |
819 | struct memblock_region *reg; | |
1da177e4 | 820 | |
e110b281 | 821 | printk(KERN_DEBUG "Top of RAM: 0x%lx, Total RAM: 0x%lx\n", |
1da177e4 | 822 | top_of_ram, total_ram); |
e110b281 | 823 | printk(KERN_DEBUG "Memory hole size: %ldMB\n", |
1da177e4 LT |
824 | (top_of_ram - total_ram) >> 20); |
825 | ||
28be7072 | 826 | for_each_memblock(memory, reg) { |
c7fc2de0 YL |
827 | start_pfn = memblock_region_memory_base_pfn(reg); |
828 | end_pfn = memblock_region_memory_end_pfn(reg); | |
1daa6d08 BS |
829 | |
830 | fake_numa_create_new_node(end_pfn, &nid); | |
831 | add_active_range(nid, start_pfn, end_pfn); | |
832 | node_set_online(nid); | |
c67c3cb4 | 833 | } |
1da177e4 LT |
834 | } |
835 | ||
4b703a23 AB |
836 | void __init dump_numa_cpu_topology(void) |
837 | { | |
838 | unsigned int node; | |
839 | unsigned int cpu, count; | |
840 | ||
841 | if (min_common_depth == -1 || !numa_enabled) | |
842 | return; | |
843 | ||
844 | for_each_online_node(node) { | |
e110b281 | 845 | printk(KERN_DEBUG "Node %d CPUs:", node); |
4b703a23 AB |
846 | |
847 | count = 0; | |
848 | /* | |
849 | * If we used a CPU iterator here we would miss printing | |
850 | * the holes in the cpumap. | |
851 | */ | |
25863de0 AB |
852 | for (cpu = 0; cpu < nr_cpu_ids; cpu++) { |
853 | if (cpumask_test_cpu(cpu, | |
854 | node_to_cpumask_map[node])) { | |
4b703a23 AB |
855 | if (count == 0) |
856 | printk(" %u", cpu); | |
857 | ++count; | |
858 | } else { | |
859 | if (count > 1) | |
860 | printk("-%u", cpu - 1); | |
861 | count = 0; | |
862 | } | |
863 | } | |
864 | ||
865 | if (count > 1) | |
25863de0 | 866 | printk("-%u", nr_cpu_ids - 1); |
4b703a23 AB |
867 | printk("\n"); |
868 | } | |
869 | } | |
870 | ||
871 | static void __init dump_numa_memory_topology(void) | |
1da177e4 LT |
872 | { |
873 | unsigned int node; | |
874 | unsigned int count; | |
875 | ||
876 | if (min_common_depth == -1 || !numa_enabled) | |
877 | return; | |
878 | ||
879 | for_each_online_node(node) { | |
880 | unsigned long i; | |
881 | ||
e110b281 | 882 | printk(KERN_DEBUG "Node %d Memory:", node); |
1da177e4 LT |
883 | |
884 | count = 0; | |
885 | ||
95f72d1e | 886 | for (i = 0; i < memblock_end_of_DRAM(); |
45fb6cea AB |
887 | i += (1 << SECTION_SIZE_BITS)) { |
888 | if (early_pfn_to_nid(i >> PAGE_SHIFT) == node) { | |
1da177e4 LT |
889 | if (count == 0) |
890 | printk(" 0x%lx", i); | |
891 | ++count; | |
892 | } else { | |
893 | if (count > 0) | |
894 | printk("-0x%lx", i); | |
895 | count = 0; | |
896 | } | |
897 | } | |
898 | ||
899 | if (count > 0) | |
900 | printk("-0x%lx", i); | |
901 | printk("\n"); | |
902 | } | |
1da177e4 LT |
903 | } |
904 | ||
905 | /* | |
95f72d1e | 906 | * Allocate some memory, satisfying the memblock or bootmem allocator where |
1da177e4 LT |
907 | * required. nid is the preferred node and end is the physical address of |
908 | * the highest address in the node. | |
909 | * | |
0be210fd | 910 | * Returns the virtual address of the memory. |
1da177e4 | 911 | */ |
893473df | 912 | static void __init *careful_zallocation(int nid, unsigned long size, |
45fb6cea AB |
913 | unsigned long align, |
914 | unsigned long end_pfn) | |
1da177e4 | 915 | { |
0be210fd | 916 | void *ret; |
45fb6cea | 917 | int new_nid; |
0be210fd DH |
918 | unsigned long ret_paddr; |
919 | ||
95f72d1e | 920 | ret_paddr = __memblock_alloc_base(size, align, end_pfn << PAGE_SHIFT); |
1da177e4 LT |
921 | |
922 | /* retry over all memory */ | |
0be210fd | 923 | if (!ret_paddr) |
95f72d1e | 924 | ret_paddr = __memblock_alloc_base(size, align, memblock_end_of_DRAM()); |
1da177e4 | 925 | |
0be210fd | 926 | if (!ret_paddr) |
5d21ea2b | 927 | panic("numa.c: cannot allocate %lu bytes for node %d", |
1da177e4 LT |
928 | size, nid); |
929 | ||
0be210fd DH |
930 | ret = __va(ret_paddr); |
931 | ||
1da177e4 | 932 | /* |
c555e520 | 933 | * We initialize the nodes in numeric order: 0, 1, 2... |
95f72d1e | 934 | * and hand over control from the MEMBLOCK allocator to the |
c555e520 DH |
935 | * bootmem allocator. If this function is called for |
936 | * node 5, then we know that all nodes <5 are using the | |
95f72d1e | 937 | * bootmem allocator instead of the MEMBLOCK allocator. |
c555e520 DH |
938 | * |
939 | * So, check the nid from which this allocation came | |
940 | * and double check to see if we need to use bootmem | |
95f72d1e | 941 | * instead of the MEMBLOCK. We don't free the MEMBLOCK memory |
c555e520 | 942 | * since it would be useless. |
1da177e4 | 943 | */ |
0be210fd | 944 | new_nid = early_pfn_to_nid(ret_paddr >> PAGE_SHIFT); |
45fb6cea | 945 | if (new_nid < nid) { |
0be210fd | 946 | ret = __alloc_bootmem_node(NODE_DATA(new_nid), |
1da177e4 LT |
947 | size, align, 0); |
948 | ||
0be210fd | 949 | dbg("alloc_bootmem %p %lx\n", ret, size); |
1da177e4 LT |
950 | } |
951 | ||
893473df | 952 | memset(ret, 0, size); |
0be210fd | 953 | return ret; |
1da177e4 LT |
954 | } |
955 | ||
74b85f37 CS |
956 | static struct notifier_block __cpuinitdata ppc64_numa_nb = { |
957 | .notifier_call = cpu_numa_callback, | |
958 | .priority = 1 /* Must run before sched domains notifier. */ | |
959 | }; | |
960 | ||
4a618669 DH |
961 | static void mark_reserved_regions_for_nid(int nid) |
962 | { | |
963 | struct pglist_data *node = NODE_DATA(nid); | |
28be7072 | 964 | struct memblock_region *reg; |
4a618669 | 965 | |
28be7072 BH |
966 | for_each_memblock(reserved, reg) { |
967 | unsigned long physbase = reg->base; | |
968 | unsigned long size = reg->size; | |
4a618669 | 969 | unsigned long start_pfn = physbase >> PAGE_SHIFT; |
06eccea6 | 970 | unsigned long end_pfn = PFN_UP(physbase + size); |
4a618669 DH |
971 | struct node_active_region node_ar; |
972 | unsigned long node_end_pfn = node->node_start_pfn + | |
973 | node->node_spanned_pages; | |
974 | ||
975 | /* | |
95f72d1e | 976 | * Check to make sure that this memblock.reserved area is |
4a618669 DH |
977 | * within the bounds of the node that we care about. |
978 | * Checking the nid of the start and end points is not | |
979 | * sufficient because the reserved area could span the | |
980 | * entire node. | |
981 | */ | |
982 | if (end_pfn <= node->node_start_pfn || | |
983 | start_pfn >= node_end_pfn) | |
984 | continue; | |
985 | ||
986 | get_node_active_region(start_pfn, &node_ar); | |
987 | while (start_pfn < end_pfn && | |
988 | node_ar.start_pfn < node_ar.end_pfn) { | |
989 | unsigned long reserve_size = size; | |
990 | /* | |
991 | * if reserved region extends past active region | |
992 | * then trim size to active region | |
993 | */ | |
994 | if (end_pfn > node_ar.end_pfn) | |
995 | reserve_size = (node_ar.end_pfn << PAGE_SHIFT) | |
06eccea6 | 996 | - physbase; |
a4c74ddd DH |
997 | /* |
998 | * Only worry about *this* node, others may not | |
999 | * yet have valid NODE_DATA(). | |
1000 | */ | |
1001 | if (node_ar.nid == nid) { | |
1002 | dbg("reserve_bootmem %lx %lx nid=%d\n", | |
1003 | physbase, reserve_size, node_ar.nid); | |
1004 | reserve_bootmem_node(NODE_DATA(node_ar.nid), | |
1005 | physbase, reserve_size, | |
1006 | BOOTMEM_DEFAULT); | |
1007 | } | |
4a618669 DH |
1008 | /* |
1009 | * if reserved region is contained in the active region | |
1010 | * then done. | |
1011 | */ | |
1012 | if (end_pfn <= node_ar.end_pfn) | |
1013 | break; | |
1014 | ||
1015 | /* | |
1016 | * reserved region extends past the active region | |
1017 | * get next active region that contains this | |
1018 | * reserved region | |
1019 | */ | |
1020 | start_pfn = node_ar.end_pfn; | |
1021 | physbase = start_pfn << PAGE_SHIFT; | |
1022 | size = size - reserve_size; | |
1023 | get_node_active_region(start_pfn, &node_ar); | |
1024 | } | |
1025 | } | |
1026 | } | |
1027 | ||
1028 | ||
1da177e4 LT |
1029 | void __init do_init_bootmem(void) |
1030 | { | |
1031 | int nid; | |
1da177e4 LT |
1032 | |
1033 | min_low_pfn = 0; | |
95f72d1e | 1034 | max_low_pfn = memblock_end_of_DRAM() >> PAGE_SHIFT; |
1da177e4 LT |
1035 | max_pfn = max_low_pfn; |
1036 | ||
1037 | if (parse_numa_properties()) | |
1038 | setup_nonnuma(); | |
1039 | else | |
4b703a23 | 1040 | dump_numa_memory_topology(); |
1da177e4 | 1041 | |
1da177e4 | 1042 | for_each_online_node(nid) { |
c67c3cb4 | 1043 | unsigned long start_pfn, end_pfn; |
0be210fd | 1044 | void *bootmem_vaddr; |
1da177e4 LT |
1045 | unsigned long bootmap_pages; |
1046 | ||
c67c3cb4 | 1047 | get_pfn_range_for_nid(nid, &start_pfn, &end_pfn); |
1da177e4 | 1048 | |
4a618669 DH |
1049 | /* |
1050 | * Allocate the node structure node local if possible | |
1051 | * | |
1052 | * Be careful moving this around, as it relies on all | |
1053 | * previous nodes' bootmem to be initialized and have | |
1054 | * all reserved areas marked. | |
1055 | */ | |
893473df | 1056 | NODE_DATA(nid) = careful_zallocation(nid, |
1da177e4 | 1057 | sizeof(struct pglist_data), |
45fb6cea | 1058 | SMP_CACHE_BYTES, end_pfn); |
1da177e4 LT |
1059 | |
1060 | dbg("node %d\n", nid); | |
1061 | dbg("NODE_DATA() = %p\n", NODE_DATA(nid)); | |
1062 | ||
b61bfa3c | 1063 | NODE_DATA(nid)->bdata = &bootmem_node_data[nid]; |
45fb6cea AB |
1064 | NODE_DATA(nid)->node_start_pfn = start_pfn; |
1065 | NODE_DATA(nid)->node_spanned_pages = end_pfn - start_pfn; | |
1da177e4 LT |
1066 | |
1067 | if (NODE_DATA(nid)->node_spanned_pages == 0) | |
1068 | continue; | |
1069 | ||
45fb6cea AB |
1070 | dbg("start_paddr = %lx\n", start_pfn << PAGE_SHIFT); |
1071 | dbg("end_paddr = %lx\n", end_pfn << PAGE_SHIFT); | |
1da177e4 | 1072 | |
45fb6cea | 1073 | bootmap_pages = bootmem_bootmap_pages(end_pfn - start_pfn); |
893473df | 1074 | bootmem_vaddr = careful_zallocation(nid, |
45fb6cea AB |
1075 | bootmap_pages << PAGE_SHIFT, |
1076 | PAGE_SIZE, end_pfn); | |
1da177e4 | 1077 | |
0be210fd | 1078 | dbg("bootmap_vaddr = %p\n", bootmem_vaddr); |
1da177e4 | 1079 | |
0be210fd DH |
1080 | init_bootmem_node(NODE_DATA(nid), |
1081 | __pa(bootmem_vaddr) >> PAGE_SHIFT, | |
45fb6cea | 1082 | start_pfn, end_pfn); |
1da177e4 | 1083 | |
c67c3cb4 | 1084 | free_bootmem_with_active_regions(nid, end_pfn); |
4a618669 DH |
1085 | /* |
1086 | * Be very careful about moving this around. Future | |
893473df | 1087 | * calls to careful_zallocation() depend on this getting |
4a618669 DH |
1088 | * done correctly. |
1089 | */ | |
1090 | mark_reserved_regions_for_nid(nid); | |
8f64e1f2 | 1091 | sparse_memory_present_with_active_regions(nid); |
4a618669 | 1092 | } |
d3f6204a BH |
1093 | |
1094 | init_bootmem_done = 1; | |
25863de0 AB |
1095 | |
1096 | /* | |
1097 | * Now bootmem is initialised we can create the node to cpumask | |
1098 | * lookup tables and setup the cpu callback to populate them. | |
1099 | */ | |
1100 | setup_node_to_cpumask_map(); | |
1101 | ||
1102 | register_cpu_notifier(&ppc64_numa_nb); | |
1103 | cpu_numa_callback(&ppc64_numa_nb, CPU_UP_PREPARE, | |
1104 | (void *)(unsigned long)boot_cpuid); | |
1da177e4 LT |
1105 | } |
1106 | ||
1107 | void __init paging_init(void) | |
1108 | { | |
6391af17 MG |
1109 | unsigned long max_zone_pfns[MAX_NR_ZONES]; |
1110 | memset(max_zone_pfns, 0, sizeof(max_zone_pfns)); | |
95f72d1e | 1111 | max_zone_pfns[ZONE_DMA] = memblock_end_of_DRAM() >> PAGE_SHIFT; |
c67c3cb4 | 1112 | free_area_init_nodes(max_zone_pfns); |
1da177e4 LT |
1113 | } |
1114 | ||
1115 | static int __init early_numa(char *p) | |
1116 | { | |
1117 | if (!p) | |
1118 | return 0; | |
1119 | ||
1120 | if (strstr(p, "off")) | |
1121 | numa_enabled = 0; | |
1122 | ||
1123 | if (strstr(p, "debug")) | |
1124 | numa_debug = 1; | |
1125 | ||
1daa6d08 BS |
1126 | p = strstr(p, "fake="); |
1127 | if (p) | |
1128 | cmdline = p + strlen("fake="); | |
1129 | ||
1da177e4 LT |
1130 | return 0; |
1131 | } | |
1132 | early_param("numa", early_numa); | |
237a0989 MK |
1133 | |
1134 | #ifdef CONFIG_MEMORY_HOTPLUG | |
0db9360a | 1135 | /* |
0f16ef7f NF |
1136 | * Find the node associated with a hot added memory section for |
1137 | * memory represented in the device tree by the property | |
1138 | * ibm,dynamic-reconfiguration-memory/ibm,dynamic-memory. | |
0db9360a NF |
1139 | */ |
1140 | static int hot_add_drconf_scn_to_nid(struct device_node *memory, | |
1141 | unsigned long scn_addr) | |
1142 | { | |
1143 | const u32 *dm; | |
0f16ef7f | 1144 | unsigned int drconf_cell_cnt, rc; |
3fdfd990 | 1145 | unsigned long lmb_size; |
0db9360a | 1146 | struct assoc_arrays aa; |
0f16ef7f | 1147 | int nid = -1; |
0db9360a | 1148 | |
0f16ef7f NF |
1149 | drconf_cell_cnt = of_get_drconf_memory(memory, &dm); |
1150 | if (!drconf_cell_cnt) | |
1151 | return -1; | |
0db9360a | 1152 | |
3fdfd990 BH |
1153 | lmb_size = of_get_lmb_size(memory); |
1154 | if (!lmb_size) | |
0f16ef7f | 1155 | return -1; |
0db9360a NF |
1156 | |
1157 | rc = of_get_assoc_arrays(memory, &aa); | |
1158 | if (rc) | |
0f16ef7f | 1159 | return -1; |
0db9360a | 1160 | |
0f16ef7f | 1161 | for (; drconf_cell_cnt != 0; --drconf_cell_cnt) { |
0db9360a NF |
1162 | struct of_drconf_cell drmem; |
1163 | ||
1164 | read_drconf_cell(&drmem, &dm); | |
1165 | ||
1166 | /* skip this block if it is reserved or not assigned to | |
1167 | * this partition */ | |
1168 | if ((drmem.flags & DRCONF_MEM_RESERVED) | |
1169 | || !(drmem.flags & DRCONF_MEM_ASSIGNED)) | |
1170 | continue; | |
1171 | ||
0f16ef7f | 1172 | if ((scn_addr < drmem.base_addr) |
3fdfd990 | 1173 | || (scn_addr >= (drmem.base_addr + lmb_size))) |
0f16ef7f NF |
1174 | continue; |
1175 | ||
0db9360a | 1176 | nid = of_drconf_to_nid_single(&drmem, &aa); |
0f16ef7f NF |
1177 | break; |
1178 | } | |
1179 | ||
1180 | return nid; | |
1181 | } | |
1182 | ||
1183 | /* | |
1184 | * Find the node associated with a hot added memory section for memory | |
1185 | * represented in the device tree as a node (i.e. memory@XXXX) for | |
95f72d1e | 1186 | * each memblock. |
0f16ef7f NF |
1187 | */ |
1188 | int hot_add_node_scn_to_nid(unsigned long scn_addr) | |
1189 | { | |
1190 | struct device_node *memory = NULL; | |
1191 | int nid = -1; | |
1192 | ||
1193 | while ((memory = of_find_node_by_type(memory, "memory")) != NULL) { | |
1194 | unsigned long start, size; | |
1195 | int ranges; | |
1196 | const unsigned int *memcell_buf; | |
1197 | unsigned int len; | |
1198 | ||
1199 | memcell_buf = of_get_property(memory, "reg", &len); | |
1200 | if (!memcell_buf || len <= 0) | |
1201 | continue; | |
1202 | ||
1203 | /* ranges in cell */ | |
1204 | ranges = (len >> 2) / (n_mem_addr_cells + n_mem_size_cells); | |
1205 | ||
1206 | while (ranges--) { | |
1207 | start = read_n_cells(n_mem_addr_cells, &memcell_buf); | |
1208 | size = read_n_cells(n_mem_size_cells, &memcell_buf); | |
1209 | ||
1210 | if ((scn_addr < start) || (scn_addr >= (start + size))) | |
1211 | continue; | |
1212 | ||
1213 | nid = of_node_to_nid_single(memory); | |
1214 | break; | |
1215 | } | |
0db9360a | 1216 | |
0f16ef7f NF |
1217 | if (nid >= 0) |
1218 | break; | |
0db9360a NF |
1219 | } |
1220 | ||
60831842 AB |
1221 | of_node_put(memory); |
1222 | ||
0f16ef7f | 1223 | return nid; |
0db9360a NF |
1224 | } |
1225 | ||
237a0989 MK |
1226 | /* |
1227 | * Find the node associated with a hot added memory section. Section | |
95f72d1e YL |
1228 | * corresponds to a SPARSEMEM section, not an MEMBLOCK. It is assumed that |
1229 | * sections are fully contained within a single MEMBLOCK. | |
237a0989 MK |
1230 | */ |
1231 | int hot_add_scn_to_nid(unsigned long scn_addr) | |
1232 | { | |
1233 | struct device_node *memory = NULL; | |
0f16ef7f | 1234 | int nid, found = 0; |
237a0989 MK |
1235 | |
1236 | if (!numa_enabled || (min_common_depth < 0)) | |
72c33688 | 1237 | return first_online_node; |
0db9360a NF |
1238 | |
1239 | memory = of_find_node_by_path("/ibm,dynamic-reconfiguration-memory"); | |
1240 | if (memory) { | |
1241 | nid = hot_add_drconf_scn_to_nid(memory, scn_addr); | |
1242 | of_node_put(memory); | |
0f16ef7f NF |
1243 | } else { |
1244 | nid = hot_add_node_scn_to_nid(scn_addr); | |
0db9360a | 1245 | } |
237a0989 | 1246 | |
0f16ef7f | 1247 | if (nid < 0 || !node_online(nid)) |
72c33688 | 1248 | nid = first_online_node; |
237a0989 | 1249 | |
0f16ef7f NF |
1250 | if (NODE_DATA(nid)->node_spanned_pages) |
1251 | return nid; | |
237a0989 | 1252 | |
0f16ef7f NF |
1253 | for_each_online_node(nid) { |
1254 | if (NODE_DATA(nid)->node_spanned_pages) { | |
1255 | found = 1; | |
1256 | break; | |
237a0989 | 1257 | } |
237a0989 | 1258 | } |
0f16ef7f NF |
1259 | |
1260 | BUG_ON(!found); | |
1261 | return nid; | |
237a0989 | 1262 | } |
0f16ef7f | 1263 | |
cd34206e NA |
1264 | static u64 hot_add_drconf_memory_max(void) |
1265 | { | |
1266 | struct device_node *memory = NULL; | |
1267 | unsigned int drconf_cell_cnt = 0; | |
1268 | u64 lmb_size = 0; | |
1269 | const u32 *dm = 0; | |
1270 | ||
1271 | memory = of_find_node_by_path("/ibm,dynamic-reconfiguration-memory"); | |
1272 | if (memory) { | |
1273 | drconf_cell_cnt = of_get_drconf_memory(memory, &dm); | |
1274 | lmb_size = of_get_lmb_size(memory); | |
1275 | of_node_put(memory); | |
1276 | } | |
1277 | return lmb_size * drconf_cell_cnt; | |
1278 | } | |
1279 | ||
1280 | /* | |
1281 | * memory_hotplug_max - return max address of memory that may be added | |
1282 | * | |
1283 | * This is currently only used on systems that support drconfig memory | |
1284 | * hotplug. | |
1285 | */ | |
1286 | u64 memory_hotplug_max(void) | |
1287 | { | |
1288 | return max(hot_add_drconf_memory_max(), memblock_end_of_DRAM()); | |
1289 | } | |
237a0989 | 1290 | #endif /* CONFIG_MEMORY_HOTPLUG */ |
9eff1a38 | 1291 | |
bd03403a | 1292 | /* Virtual Processor Home Node (VPHN) support */ |
39bf990e | 1293 | #ifdef CONFIG_PPC_SPLPAR |
5de16699 | 1294 | static u8 vphn_cpu_change_counts[NR_CPUS][MAX_DISTANCE_REF_POINTS]; |
9eff1a38 JL |
1295 | static cpumask_t cpu_associativity_changes_mask; |
1296 | static int vphn_enabled; | |
1297 | static void set_topology_timer(void); | |
9eff1a38 JL |
1298 | |
1299 | /* | |
1300 | * Store the current values of the associativity change counters in the | |
1301 | * hypervisor. | |
1302 | */ | |
1303 | static void setup_cpu_associativity_change_counters(void) | |
1304 | { | |
cd9d6cc7 | 1305 | int cpu; |
9eff1a38 | 1306 | |
5de16699 AB |
1307 | /* The VPHN feature supports a maximum of 8 reference points */ |
1308 | BUILD_BUG_ON(MAX_DISTANCE_REF_POINTS > 8); | |
1309 | ||
9eff1a38 | 1310 | for_each_possible_cpu(cpu) { |
cd9d6cc7 | 1311 | int i; |
9eff1a38 JL |
1312 | u8 *counts = vphn_cpu_change_counts[cpu]; |
1313 | volatile u8 *hypervisor_counts = lppaca[cpu].vphn_assoc_counts; | |
1314 | ||
5de16699 | 1315 | for (i = 0; i < distance_ref_points_depth; i++) |
9eff1a38 | 1316 | counts[i] = hypervisor_counts[i]; |
9eff1a38 JL |
1317 | } |
1318 | } | |
1319 | ||
1320 | /* | |
1321 | * The hypervisor maintains a set of 8 associativity change counters in | |
1322 | * the VPA of each cpu that correspond to the associativity levels in the | |
1323 | * ibm,associativity-reference-points property. When an associativity | |
1324 | * level changes, the corresponding counter is incremented. | |
1325 | * | |
1326 | * Set a bit in cpu_associativity_changes_mask for each cpu whose home | |
1327 | * node associativity levels have changed. | |
1328 | * | |
1329 | * Returns the number of cpus with unhandled associativity changes. | |
1330 | */ | |
1331 | static int update_cpu_associativity_changes_mask(void) | |
1332 | { | |
cd9d6cc7 | 1333 | int cpu, nr_cpus = 0; |
9eff1a38 JL |
1334 | cpumask_t *changes = &cpu_associativity_changes_mask; |
1335 | ||
1336 | cpumask_clear(changes); | |
1337 | ||
1338 | for_each_possible_cpu(cpu) { | |
1339 | int i, changed = 0; | |
1340 | u8 *counts = vphn_cpu_change_counts[cpu]; | |
1341 | volatile u8 *hypervisor_counts = lppaca[cpu].vphn_assoc_counts; | |
1342 | ||
5de16699 | 1343 | for (i = 0; i < distance_ref_points_depth; i++) { |
d69043e8 | 1344 | if (hypervisor_counts[i] != counts[i]) { |
9eff1a38 JL |
1345 | counts[i] = hypervisor_counts[i]; |
1346 | changed = 1; | |
1347 | } | |
1348 | } | |
1349 | if (changed) { | |
1350 | cpumask_set_cpu(cpu, changes); | |
1351 | nr_cpus++; | |
1352 | } | |
1353 | } | |
1354 | ||
1355 | return nr_cpus; | |
1356 | } | |
1357 | ||
c0e5e46f AB |
1358 | /* |
1359 | * 6 64-bit registers unpacked into 12 32-bit associativity values. To form | |
1360 | * the complete property we have to add the length in the first cell. | |
1361 | */ | |
1362 | #define VPHN_ASSOC_BUFSIZE (6*sizeof(u64)/sizeof(u32) + 1) | |
9eff1a38 JL |
1363 | |
1364 | /* | |
1365 | * Convert the associativity domain numbers returned from the hypervisor | |
1366 | * to the sequence they would appear in the ibm,associativity property. | |
1367 | */ | |
1368 | static int vphn_unpack_associativity(const long *packed, unsigned int *unpacked) | |
1369 | { | |
cd9d6cc7 | 1370 | int i, nr_assoc_doms = 0; |
9eff1a38 JL |
1371 | const u16 *field = (const u16*) packed; |
1372 | ||
1373 | #define VPHN_FIELD_UNUSED (0xffff) | |
1374 | #define VPHN_FIELD_MSB (0x8000) | |
1375 | #define VPHN_FIELD_MASK (~VPHN_FIELD_MSB) | |
1376 | ||
c0e5e46f | 1377 | for (i = 1; i < VPHN_ASSOC_BUFSIZE; i++) { |
9eff1a38 JL |
1378 | if (*field == VPHN_FIELD_UNUSED) { |
1379 | /* All significant fields processed, and remaining | |
1380 | * fields contain the reserved value of all 1's. | |
1381 | * Just store them. | |
1382 | */ | |
1383 | unpacked[i] = *((u32*)field); | |
1384 | field += 2; | |
7639adaa | 1385 | } else if (*field & VPHN_FIELD_MSB) { |
9eff1a38 JL |
1386 | /* Data is in the lower 15 bits of this field */ |
1387 | unpacked[i] = *field & VPHN_FIELD_MASK; | |
1388 | field++; | |
1389 | nr_assoc_doms++; | |
7639adaa | 1390 | } else { |
9eff1a38 JL |
1391 | /* Data is in the lower 15 bits of this field |
1392 | * concatenated with the next 16 bit field | |
1393 | */ | |
1394 | unpacked[i] = *((u32*)field); | |
1395 | field += 2; | |
1396 | nr_assoc_doms++; | |
1397 | } | |
1398 | } | |
1399 | ||
c0e5e46f AB |
1400 | /* The first cell contains the length of the property */ |
1401 | unpacked[0] = nr_assoc_doms; | |
1402 | ||
9eff1a38 JL |
1403 | return nr_assoc_doms; |
1404 | } | |
1405 | ||
1406 | /* | |
1407 | * Retrieve the new associativity information for a virtual processor's | |
1408 | * home node. | |
1409 | */ | |
1410 | static long hcall_vphn(unsigned long cpu, unsigned int *associativity) | |
1411 | { | |
cd9d6cc7 | 1412 | long rc; |
9eff1a38 JL |
1413 | long retbuf[PLPAR_HCALL9_BUFSIZE] = {0}; |
1414 | u64 flags = 1; | |
1415 | int hwcpu = get_hard_smp_processor_id(cpu); | |
1416 | ||
1417 | rc = plpar_hcall9(H_HOME_NODE_ASSOCIATIVITY, retbuf, flags, hwcpu); | |
1418 | vphn_unpack_associativity(retbuf, associativity); | |
1419 | ||
1420 | return rc; | |
1421 | } | |
1422 | ||
1423 | static long vphn_get_associativity(unsigned long cpu, | |
1424 | unsigned int *associativity) | |
1425 | { | |
cd9d6cc7 | 1426 | long rc; |
9eff1a38 JL |
1427 | |
1428 | rc = hcall_vphn(cpu, associativity); | |
1429 | ||
1430 | switch (rc) { | |
1431 | case H_FUNCTION: | |
1432 | printk(KERN_INFO | |
1433 | "VPHN is not supported. Disabling polling...\n"); | |
1434 | stop_topology_update(); | |
1435 | break; | |
1436 | case H_HARDWARE: | |
1437 | printk(KERN_ERR | |
1438 | "hcall_vphn() experienced a hardware fault " | |
1439 | "preventing VPHN. Disabling polling...\n"); | |
1440 | stop_topology_update(); | |
1441 | } | |
1442 | ||
1443 | return rc; | |
1444 | } | |
1445 | ||
1446 | /* | |
1447 | * Update the node maps and sysfs entries for each cpu whose home node | |
1448 | * has changed. | |
1449 | */ | |
1450 | int arch_update_cpu_topology(void) | |
1451 | { | |
cd9d6cc7 | 1452 | int cpu, nid, old_nid; |
9eff1a38 | 1453 | unsigned int associativity[VPHN_ASSOC_BUFSIZE] = {0}; |
cd9d6cc7 | 1454 | struct sys_device *sysdev; |
9eff1a38 | 1455 | |
104699c0 | 1456 | for_each_cpu(cpu,&cpu_associativity_changes_mask) { |
9eff1a38 JL |
1457 | vphn_get_associativity(cpu, associativity); |
1458 | nid = associativity_to_nid(associativity); | |
1459 | ||
1460 | if (nid < 0 || !node_online(nid)) | |
1461 | nid = first_online_node; | |
1462 | ||
1463 | old_nid = numa_cpu_lookup_table[cpu]; | |
1464 | ||
1465 | /* Disable hotplug while we update the cpu | |
1466 | * masks and sysfs. | |
1467 | */ | |
1468 | get_online_cpus(); | |
1469 | unregister_cpu_under_node(cpu, old_nid); | |
1470 | unmap_cpu_from_node(cpu); | |
1471 | map_cpu_to_node(cpu, nid); | |
1472 | register_cpu_under_node(cpu, nid); | |
1473 | put_online_cpus(); | |
1474 | ||
1475 | sysdev = get_cpu_sysdev(cpu); | |
1476 | if (sysdev) | |
1477 | kobject_uevent(&sysdev->kobj, KOBJ_CHANGE); | |
1478 | } | |
1479 | ||
1480 | return 1; | |
1481 | } | |
1482 | ||
1483 | static void topology_work_fn(struct work_struct *work) | |
1484 | { | |
1485 | rebuild_sched_domains(); | |
1486 | } | |
1487 | static DECLARE_WORK(topology_work, topology_work_fn); | |
1488 | ||
1489 | void topology_schedule_update(void) | |
1490 | { | |
1491 | schedule_work(&topology_work); | |
1492 | } | |
1493 | ||
1494 | static void topology_timer_fn(unsigned long ignored) | |
1495 | { | |
1496 | if (!vphn_enabled) | |
1497 | return; | |
1498 | if (update_cpu_associativity_changes_mask() > 0) | |
1499 | topology_schedule_update(); | |
1500 | set_topology_timer(); | |
1501 | } | |
1502 | static struct timer_list topology_timer = | |
1503 | TIMER_INITIALIZER(topology_timer_fn, 0, 0); | |
1504 | ||
1505 | static void set_topology_timer(void) | |
1506 | { | |
1507 | topology_timer.data = 0; | |
1508 | topology_timer.expires = jiffies + 60 * HZ; | |
1509 | add_timer(&topology_timer); | |
1510 | } | |
1511 | ||
1512 | /* | |
1513 | * Start polling for VPHN associativity changes. | |
1514 | */ | |
1515 | int start_topology_update(void) | |
1516 | { | |
1517 | int rc = 0; | |
1518 | ||
36e8695c BH |
1519 | /* Disabled until races with load balancing are fixed */ |
1520 | if (0 && firmware_has_feature(FW_FEATURE_VPHN) && | |
fe5cfd63 | 1521 | get_lppaca()->shared_proc) { |
9eff1a38 JL |
1522 | vphn_enabled = 1; |
1523 | setup_cpu_associativity_change_counters(); | |
1524 | init_timer_deferrable(&topology_timer); | |
1525 | set_topology_timer(); | |
1526 | rc = 1; | |
1527 | } | |
1528 | ||
1529 | return rc; | |
1530 | } | |
1531 | __initcall(start_topology_update); | |
1532 | ||
1533 | /* | |
1534 | * Disable polling for VPHN associativity changes. | |
1535 | */ | |
1536 | int stop_topology_update(void) | |
1537 | { | |
1538 | vphn_enabled = 0; | |
1539 | return del_timer_sync(&topology_timer); | |
1540 | } | |
39bf990e | 1541 | #endif /* CONFIG_PPC_SPLPAR */ |