1 /* Common code for 32 and 64-bit NUMA */
2 #include <linux/kernel.h>
3 #include <linux/mm.h>
4 #include <linux/string.h>
5 #include <linux/init.h>
6 #include <linux/bootmem.h>
7 #include <linux/memblock.h>
8 #include <linux/mmzone.h>
9 #include <linux/ctype.h>
10 #include <linux/module.h>
11 #include <linux/nodemask.h>
12 #include <linux/sched.h>
13 #include <linux/topology.h>
14
15 #include <asm/e820.h>
16 #include <asm/proto.h>
17 #include <asm/dma.h>
18 #include <asm/acpi.h>
19 #include <asm/amd_nb.h>
20
21 #include "numa_internal.h"
22
23 int __initdata numa_off;
24 nodemask_t numa_nodes_parsed __initdata;
25
26 struct pglist_data *node_data[MAX_NUMNODES] __read_mostly;
27 EXPORT_SYMBOL(node_data);
28
29 static struct numa_meminfo numa_meminfo
30 #ifndef CONFIG_MEMORY_HOTPLUG
31 __initdata
32 #endif
33 ;
34
35 static int numa_distance_cnt;
36 static u8 *numa_distance;
37
numa_setup(char * opt)38 static __init int numa_setup(char *opt)
39 {
40 if (!opt)
41 return -EINVAL;
42 if (!strncmp(opt, "off", 3))
43 numa_off = 1;
44 #ifdef CONFIG_NUMA_EMU
45 if (!strncmp(opt, "fake=", 5))
46 numa_emu_cmdline(opt + 5);
47 #endif
48 #ifdef CONFIG_ACPI_NUMA
49 if (!strncmp(opt, "noacpi", 6))
50 acpi_numa = -1;
51 #endif
52 return 0;
53 }
54 early_param("numa", numa_setup);
55
56 /*
57 * apicid, cpu, node mappings
58 */
59 s16 __apicid_to_node[MAX_LOCAL_APIC] __cpuinitdata = {
60 [0 ... MAX_LOCAL_APIC-1] = NUMA_NO_NODE
61 };
62
numa_cpu_node(int cpu)63 int __cpuinit numa_cpu_node(int cpu)
64 {
65 int apicid = early_per_cpu(x86_cpu_to_apicid, cpu);
66
67 if (apicid != BAD_APICID)
68 return __apicid_to_node[apicid];
69 return NUMA_NO_NODE;
70 }
71
72 cpumask_var_t node_to_cpumask_map[MAX_NUMNODES];
73 EXPORT_SYMBOL(node_to_cpumask_map);
74
75 /*
76 * Map cpu index to node index
77 */
78 DEFINE_EARLY_PER_CPU(int, x86_cpu_to_node_map, NUMA_NO_NODE);
79 EXPORT_EARLY_PER_CPU_SYMBOL(x86_cpu_to_node_map);
80
numa_set_node(int cpu,int node)81 void __cpuinit numa_set_node(int cpu, int node)
82 {
83 int *cpu_to_node_map = early_per_cpu_ptr(x86_cpu_to_node_map);
84
85 /* early setting, no percpu area yet */
86 if (cpu_to_node_map) {
87 cpu_to_node_map[cpu] = node;
88 return;
89 }
90
91 #ifdef CONFIG_DEBUG_PER_CPU_MAPS
92 if (cpu >= nr_cpu_ids || !cpu_possible(cpu)) {
93 printk(KERN_ERR "numa_set_node: invalid cpu# (%d)\n", cpu);
94 dump_stack();
95 return;
96 }
97 #endif
98 per_cpu(x86_cpu_to_node_map, cpu) = node;
99
100 if (node != NUMA_NO_NODE)
101 set_cpu_numa_node(cpu, node);
102 }
103
numa_clear_node(int cpu)104 void __cpuinit numa_clear_node(int cpu)
105 {
106 numa_set_node(cpu, NUMA_NO_NODE);
107 }
108
109 /*
110 * Allocate node_to_cpumask_map based on number of available nodes
111 * Requires node_possible_map to be valid.
112 *
113 * Note: cpumask_of_node() is not valid until after this is done.
114 * (Use CONFIG_DEBUG_PER_CPU_MAPS to check this.)
115 */
setup_node_to_cpumask_map(void)116 void __init setup_node_to_cpumask_map(void)
117 {
118 unsigned int node, num = 0;
119
120 /* setup nr_node_ids if not done yet */
121 if (nr_node_ids == MAX_NUMNODES) {
122 for_each_node_mask(node, node_possible_map)
123 num = node;
124 nr_node_ids = num + 1;
125 }
126
127 /* allocate the map */
128 for (node = 0; node < nr_node_ids; node++)
129 alloc_bootmem_cpumask_var(&node_to_cpumask_map[node]);
130
131 /* cpumask_of_node() will now work */
132 pr_debug("Node to cpumask map for %d nodes\n", nr_node_ids);
133 }
134
numa_add_memblk_to(int nid,u64 start,u64 end,struct numa_meminfo * mi)135 static int __init numa_add_memblk_to(int nid, u64 start, u64 end,
136 struct numa_meminfo *mi)
137 {
138 /* ignore zero length blks */
139 if (start == end)
140 return 0;
141
142 /* whine about and ignore invalid blks */
143 if (start > end || nid < 0 || nid >= MAX_NUMNODES) {
144 pr_warning("NUMA: Warning: invalid memblk node %d (%Lx-%Lx)\n",
145 nid, start, end);
146 return 0;
147 }
148
149 if (mi->nr_blks >= NR_NODE_MEMBLKS) {
150 pr_err("NUMA: too many memblk ranges\n");
151 return -EINVAL;
152 }
153
154 mi->blk[mi->nr_blks].start = start;
155 mi->blk[mi->nr_blks].end = end;
156 mi->blk[mi->nr_blks].nid = nid;
157 mi->nr_blks++;
158 return 0;
159 }
160
161 /**
162 * numa_remove_memblk_from - Remove one numa_memblk from a numa_meminfo
163 * @idx: Index of memblk to remove
164 * @mi: numa_meminfo to remove memblk from
165 *
166 * Remove @idx'th numa_memblk from @mi by shifting @mi->blk[] and
167 * decrementing @mi->nr_blks.
168 */
numa_remove_memblk_from(int idx,struct numa_meminfo * mi)169 void __init numa_remove_memblk_from(int idx, struct numa_meminfo *mi)
170 {
171 mi->nr_blks--;
172 memmove(&mi->blk[idx], &mi->blk[idx + 1],
173 (mi->nr_blks - idx) * sizeof(mi->blk[0]));
174 }
175
176 /**
177 * numa_add_memblk - Add one numa_memblk to numa_meminfo
178 * @nid: NUMA node ID of the new memblk
179 * @start: Start address of the new memblk
180 * @end: End address of the new memblk
181 *
182 * Add a new memblk to the default numa_meminfo.
183 *
184 * RETURNS:
185 * 0 on success, -errno on failure.
186 */
numa_add_memblk(int nid,u64 start,u64 end)187 int __init numa_add_memblk(int nid, u64 start, u64 end)
188 {
189 return numa_add_memblk_to(nid, start, end, &numa_meminfo);
190 }
191
192 /* Initialize NODE_DATA for a node on the local memory */
setup_node_data(int nid,u64 start,u64 end)193 static void __init setup_node_data(int nid, u64 start, u64 end)
194 {
195 const size_t nd_size = roundup(sizeof(pg_data_t), PAGE_SIZE);
196 u64 nd_pa;
197 void *nd;
198 int tnid;
199
200 /*
201 * Don't confuse VM with a node that doesn't have the
202 * minimum amount of memory:
203 */
204 if (end && (end - start) < NODE_MIN_SIZE)
205 return;
206
207 start = roundup(start, ZONE_ALIGN);
208
209 printk(KERN_INFO "Initmem setup node %d %016Lx-%016Lx\n",
210 nid, start, end);
211
212 /*
213 * Allocate node data. Try node-local memory and then any node.
214 * Never allocate in DMA zone.
215 */
216 nd_pa = memblock_alloc_nid(nd_size, SMP_CACHE_BYTES, nid);
217 if (!nd_pa) {
218 pr_err("Cannot find %zu bytes in node %d\n",
219 nd_size, nid);
220 return;
221 }
222 nd = __va(nd_pa);
223
224 /* report and initialize */
225 printk(KERN_INFO " NODE_DATA [mem %#010Lx-%#010Lx]\n",
226 nd_pa, nd_pa + nd_size - 1);
227 tnid = early_pfn_to_nid(nd_pa >> PAGE_SHIFT);
228 if (tnid != nid)
229 printk(KERN_INFO " NODE_DATA(%d) on node %d\n", nid, tnid);
230
231 node_data[nid] = nd;
232 memset(NODE_DATA(nid), 0, sizeof(pg_data_t));
233 NODE_DATA(nid)->node_id = nid;
234 NODE_DATA(nid)->node_start_pfn = start >> PAGE_SHIFT;
235 NODE_DATA(nid)->node_spanned_pages = (end - start) >> PAGE_SHIFT;
236
237 node_set_online(nid);
238 }
239
240 /**
241 * numa_cleanup_meminfo - Cleanup a numa_meminfo
242 * @mi: numa_meminfo to clean up
243 *
244 * Sanitize @mi by merging and removing unncessary memblks. Also check for
245 * conflicts and clear unused memblks.
246 *
247 * RETURNS:
248 * 0 on success, -errno on failure.
249 */
numa_cleanup_meminfo(struct numa_meminfo * mi)250 int __init numa_cleanup_meminfo(struct numa_meminfo *mi)
251 {
252 const u64 low = 0;
253 const u64 high = PFN_PHYS(max_pfn);
254 int i, j, k;
255
256 /* first, trim all entries */
257 for (i = 0; i < mi->nr_blks; i++) {
258 struct numa_memblk *bi = &mi->blk[i];
259
260 /* make sure all blocks are inside the limits */
261 bi->start = max(bi->start, low);
262 bi->end = min(bi->end, high);
263
264 /* and there's no empty block */
265 if (bi->start >= bi->end)
266 numa_remove_memblk_from(i--, mi);
267 }
268
269 /* merge neighboring / overlapping entries */
270 for (i = 0; i < mi->nr_blks; i++) {
271 struct numa_memblk *bi = &mi->blk[i];
272
273 for (j = i + 1; j < mi->nr_blks; j++) {
274 struct numa_memblk *bj = &mi->blk[j];
275 u64 start, end;
276
277 /*
278 * See whether there are overlapping blocks. Whine
279 * about but allow overlaps of the same nid. They
280 * will be merged below.
281 */
282 if (bi->end > bj->start && bi->start < bj->end) {
283 if (bi->nid != bj->nid) {
284 pr_err("NUMA: node %d (%Lx-%Lx) overlaps with node %d (%Lx-%Lx)\n",
285 bi->nid, bi->start, bi->end,
286 bj->nid, bj->start, bj->end);
287 return -EINVAL;
288 }
289 pr_warning("NUMA: Warning: node %d (%Lx-%Lx) overlaps with itself (%Lx-%Lx)\n",
290 bi->nid, bi->start, bi->end,
291 bj->start, bj->end);
292 }
293
294 /*
295 * Join together blocks on the same node, holes
296 * between which don't overlap with memory on other
297 * nodes.
298 */
299 if (bi->nid != bj->nid)
300 continue;
301 start = min(bi->start, bj->start);
302 end = max(bi->end, bj->end);
303 for (k = 0; k < mi->nr_blks; k++) {
304 struct numa_memblk *bk = &mi->blk[k];
305
306 if (bi->nid == bk->nid)
307 continue;
308 if (start < bk->end && end > bk->start)
309 break;
310 }
311 if (k < mi->nr_blks)
312 continue;
313 printk(KERN_INFO "NUMA: Node %d [%Lx,%Lx) + [%Lx,%Lx) -> [%Lx,%Lx)\n",
314 bi->nid, bi->start, bi->end, bj->start, bj->end,
315 start, end);
316 bi->start = start;
317 bi->end = end;
318 numa_remove_memblk_from(j--, mi);
319 }
320 }
321
322 /* clear unused ones */
323 for (i = mi->nr_blks; i < ARRAY_SIZE(mi->blk); i++) {
324 mi->blk[i].start = mi->blk[i].end = 0;
325 mi->blk[i].nid = NUMA_NO_NODE;
326 }
327
328 return 0;
329 }
330
331 /*
332 * Set nodes, which have memory in @mi, in *@nodemask.
333 */
numa_nodemask_from_meminfo(nodemask_t * nodemask,const struct numa_meminfo * mi)334 static void __init numa_nodemask_from_meminfo(nodemask_t *nodemask,
335 const struct numa_meminfo *mi)
336 {
337 int i;
338
339 for (i = 0; i < ARRAY_SIZE(mi->blk); i++)
340 if (mi->blk[i].start != mi->blk[i].end &&
341 mi->blk[i].nid != NUMA_NO_NODE)
342 node_set(mi->blk[i].nid, *nodemask);
343 }
344
345 /**
346 * numa_reset_distance - Reset NUMA distance table
347 *
348 * The current table is freed. The next numa_set_distance() call will
349 * create a new one.
350 */
numa_reset_distance(void)351 void __init numa_reset_distance(void)
352 {
353 size_t size = numa_distance_cnt * numa_distance_cnt * sizeof(numa_distance[0]);
354
355 /* numa_distance could be 1LU marking allocation failure, test cnt */
356 if (numa_distance_cnt)
357 memblock_free(__pa(numa_distance), size);
358 numa_distance_cnt = 0;
359 numa_distance = NULL; /* enable table creation */
360 }
361
numa_alloc_distance(void)362 static int __init numa_alloc_distance(void)
363 {
364 nodemask_t nodes_parsed;
365 size_t size;
366 int i, j, cnt = 0;
367 u64 phys;
368
369 /* size the new table and allocate it */
370 nodes_parsed = numa_nodes_parsed;
371 numa_nodemask_from_meminfo(&nodes_parsed, &numa_meminfo);
372
373 for_each_node_mask(i, nodes_parsed)
374 cnt = i;
375 cnt++;
376 size = cnt * cnt * sizeof(numa_distance[0]);
377
378 phys = memblock_find_in_range(0, PFN_PHYS(max_pfn_mapped),
379 size, PAGE_SIZE);
380 if (!phys) {
381 pr_warning("NUMA: Warning: can't allocate distance table!\n");
382 /* don't retry until explicitly reset */
383 numa_distance = (void *)1LU;
384 return -ENOMEM;
385 }
386 memblock_reserve(phys, size);
387
388 numa_distance = __va(phys);
389 numa_distance_cnt = cnt;
390
391 /* fill with the default distances */
392 for (i = 0; i < cnt; i++)
393 for (j = 0; j < cnt; j++)
394 numa_distance[i * cnt + j] = i == j ?
395 LOCAL_DISTANCE : REMOTE_DISTANCE;
396 printk(KERN_DEBUG "NUMA: Initialized distance table, cnt=%d\n", cnt);
397
398 return 0;
399 }
400
401 /**
402 * numa_set_distance - Set NUMA distance from one NUMA to another
403 * @from: the 'from' node to set distance
404 * @to: the 'to' node to set distance
405 * @distance: NUMA distance
406 *
407 * Set the distance from node @from to @to to @distance. If distance table
408 * doesn't exist, one which is large enough to accommodate all the currently
409 * known nodes will be created.
410 *
411 * If such table cannot be allocated, a warning is printed and further
412 * calls are ignored until the distance table is reset with
413 * numa_reset_distance().
414 *
415 * If @from or @to is higher than the highest known node or lower than zero
416 * at the time of table creation or @distance doesn't make sense, the call
417 * is ignored.
418 * This is to allow simplification of specific NUMA config implementations.
419 */
numa_set_distance(int from,int to,int distance)420 void __init numa_set_distance(int from, int to, int distance)
421 {
422 if (!numa_distance && numa_alloc_distance() < 0)
423 return;
424
425 if (from >= numa_distance_cnt || to >= numa_distance_cnt ||
426 from < 0 || to < 0) {
427 pr_warn_once("NUMA: Warning: node ids are out of bound, from=%d to=%d distance=%d\n",
428 from, to, distance);
429 return;
430 }
431
432 if ((u8)distance != distance ||
433 (from == to && distance != LOCAL_DISTANCE)) {
434 pr_warn_once("NUMA: Warning: invalid distance parameter, from=%d to=%d distance=%d\n",
435 from, to, distance);
436 return;
437 }
438
439 numa_distance[from * numa_distance_cnt + to] = distance;
440 }
441
__node_distance(int from,int to)442 int __node_distance(int from, int to)
443 {
444 if (from >= numa_distance_cnt || to >= numa_distance_cnt)
445 return from == to ? LOCAL_DISTANCE : REMOTE_DISTANCE;
446 return numa_distance[from * numa_distance_cnt + to];
447 }
448 EXPORT_SYMBOL(__node_distance);
449
450 /*
451 * Sanity check to catch more bad NUMA configurations (they are amazingly
452 * common). Make sure the nodes cover all memory.
453 */
numa_meminfo_cover_memory(const struct numa_meminfo * mi)454 static bool __init numa_meminfo_cover_memory(const struct numa_meminfo *mi)
455 {
456 u64 numaram, e820ram;
457 int i;
458
459 numaram = 0;
460 for (i = 0; i < mi->nr_blks; i++) {
461 u64 s = mi->blk[i].start >> PAGE_SHIFT;
462 u64 e = mi->blk[i].end >> PAGE_SHIFT;
463 numaram += e - s;
464 numaram -= __absent_pages_in_range(mi->blk[i].nid, s, e);
465 if ((s64)numaram < 0)
466 numaram = 0;
467 }
468
469 e820ram = max_pfn - absent_pages_in_range(0, max_pfn);
470
471 /* We seem to lose 3 pages somewhere. Allow 1M of slack. */
472 if ((s64)(e820ram - numaram) >= (1 << (20 - PAGE_SHIFT))) {
473 printk(KERN_ERR "NUMA: nodes only cover %LuMB of your %LuMB e820 RAM. Not used.\n",
474 (numaram << PAGE_SHIFT) >> 20,
475 (e820ram << PAGE_SHIFT) >> 20);
476 return false;
477 }
478 return true;
479 }
480
numa_register_memblks(struct numa_meminfo * mi)481 static int __init numa_register_memblks(struct numa_meminfo *mi)
482 {
483 unsigned long uninitialized_var(pfn_align);
484 int i, nid;
485
486 /* Account for nodes with cpus and no memory */
487 node_possible_map = numa_nodes_parsed;
488 numa_nodemask_from_meminfo(&node_possible_map, mi);
489 if (WARN_ON(nodes_empty(node_possible_map)))
490 return -EINVAL;
491
492 for (i = 0; i < mi->nr_blks; i++) {
493 struct numa_memblk *mb = &mi->blk[i];
494 memblock_set_node(mb->start, mb->end - mb->start, mb->nid);
495 }
496
497 /*
498 * If sections array is gonna be used for pfn -> nid mapping, check
499 * whether its granularity is fine enough.
500 */
501 #ifdef NODE_NOT_IN_PAGE_FLAGS
502 pfn_align = node_map_pfn_alignment();
503 if (pfn_align && pfn_align < PAGES_PER_SECTION) {
504 printk(KERN_WARNING "Node alignment %LuMB < min %LuMB, rejecting NUMA config\n",
505 PFN_PHYS(pfn_align) >> 20,
506 PFN_PHYS(PAGES_PER_SECTION) >> 20);
507 return -EINVAL;
508 }
509 #endif
510 if (!numa_meminfo_cover_memory(mi))
511 return -EINVAL;
512
513 /* Finally register nodes. */
514 for_each_node_mask(nid, node_possible_map) {
515 u64 start = PFN_PHYS(max_pfn);
516 u64 end = 0;
517
518 for (i = 0; i < mi->nr_blks; i++) {
519 if (nid != mi->blk[i].nid)
520 continue;
521 start = min(mi->blk[i].start, start);
522 end = max(mi->blk[i].end, end);
523 }
524
525 if (start < end)
526 setup_node_data(nid, start, end);
527 }
528
529 /* Dump memblock with node info and return. */
530 memblock_dump_all();
531 return 0;
532 }
533
534 /*
535 * There are unfortunately some poorly designed mainboards around that
536 * only connect memory to a single CPU. This breaks the 1:1 cpu->node
537 * mapping. To avoid this fill in the mapping for all possible CPUs,
538 * as the number of CPUs is not known yet. We round robin the existing
539 * nodes.
540 */
numa_init_array(void)541 static void __init numa_init_array(void)
542 {
543 int rr, i;
544
545 rr = first_node(node_online_map);
546 for (i = 0; i < nr_cpu_ids; i++) {
547 if (early_cpu_to_node(i) != NUMA_NO_NODE)
548 continue;
549 numa_set_node(i, rr);
550 rr = next_node(rr, node_online_map);
551 if (rr == MAX_NUMNODES)
552 rr = first_node(node_online_map);
553 }
554 }
555
numa_init(int (* init_func)(void))556 static int __init numa_init(int (*init_func)(void))
557 {
558 int i;
559 int ret;
560
561 for (i = 0; i < MAX_LOCAL_APIC; i++)
562 set_apicid_to_node(i, NUMA_NO_NODE);
563
564 nodes_clear(numa_nodes_parsed);
565 nodes_clear(node_possible_map);
566 nodes_clear(node_online_map);
567 memset(&numa_meminfo, 0, sizeof(numa_meminfo));
568 WARN_ON(memblock_set_node(0, ULLONG_MAX, MAX_NUMNODES));
569 numa_reset_distance();
570
571 ret = init_func();
572 if (ret < 0)
573 return ret;
574 ret = numa_cleanup_meminfo(&numa_meminfo);
575 if (ret < 0)
576 return ret;
577
578 numa_emulation(&numa_meminfo, numa_distance_cnt);
579
580 ret = numa_register_memblks(&numa_meminfo);
581 if (ret < 0)
582 return ret;
583
584 for (i = 0; i < nr_cpu_ids; i++) {
585 int nid = early_cpu_to_node(i);
586
587 if (nid == NUMA_NO_NODE)
588 continue;
589 if (!node_online(nid))
590 numa_clear_node(i);
591 }
592 numa_init_array();
593 return 0;
594 }
595
596 /**
597 * dummy_numa_init - Fallback dummy NUMA init
598 *
599 * Used if there's no underlying NUMA architecture, NUMA initialization
600 * fails, or NUMA is disabled on the command line.
601 *
602 * Must online at least one node and add memory blocks that cover all
603 * allowed memory. This function must not fail.
604 */
dummy_numa_init(void)605 static int __init dummy_numa_init(void)
606 {
607 printk(KERN_INFO "%s\n",
608 numa_off ? "NUMA turned off" : "No NUMA configuration found");
609 printk(KERN_INFO "Faking a node at %016Lx-%016Lx\n",
610 0LLU, PFN_PHYS(max_pfn));
611
612 node_set(0, numa_nodes_parsed);
613 numa_add_memblk(0, 0, PFN_PHYS(max_pfn));
614
615 return 0;
616 }
617
618 /**
619 * x86_numa_init - Initialize NUMA
620 *
621 * Try each configured NUMA initialization method until one succeeds. The
622 * last fallback is dummy single node config encomapssing whole memory and
623 * never fails.
624 */
x86_numa_init(void)625 void __init x86_numa_init(void)
626 {
627 if (!numa_off) {
628 #ifdef CONFIG_X86_NUMAQ
629 if (!numa_init(numaq_numa_init))
630 return;
631 #endif
632 #ifdef CONFIG_ACPI_NUMA
633 if (!numa_init(x86_acpi_numa_init))
634 return;
635 #endif
636 #ifdef CONFIG_AMD_NUMA
637 if (!numa_init(amd_numa_init))
638 return;
639 #endif
640 }
641
642 numa_init(dummy_numa_init);
643 }
644
find_near_online_node(int node)645 static __init int find_near_online_node(int node)
646 {
647 int n, val;
648 int min_val = INT_MAX;
649 int best_node = -1;
650
651 for_each_online_node(n) {
652 val = node_distance(node, n);
653
654 if (val < min_val) {
655 min_val = val;
656 best_node = n;
657 }
658 }
659
660 return best_node;
661 }
662
663 /*
664 * Setup early cpu_to_node.
665 *
666 * Populate cpu_to_node[] only if x86_cpu_to_apicid[],
667 * and apicid_to_node[] tables have valid entries for a CPU.
668 * This means we skip cpu_to_node[] initialisation for NUMA
669 * emulation and faking node case (when running a kernel compiled
670 * for NUMA on a non NUMA box), which is OK as cpu_to_node[]
671 * is already initialized in a round robin manner at numa_init_array,
672 * prior to this call, and this initialization is good enough
673 * for the fake NUMA cases.
674 *
675 * Called before the per_cpu areas are setup.
676 */
init_cpu_to_node(void)677 void __init init_cpu_to_node(void)
678 {
679 int cpu;
680 u16 *cpu_to_apicid = early_per_cpu_ptr(x86_cpu_to_apicid);
681
682 BUG_ON(cpu_to_apicid == NULL);
683
684 for_each_possible_cpu(cpu) {
685 int node = numa_cpu_node(cpu);
686
687 if (node == NUMA_NO_NODE)
688 continue;
689 if (!node_online(node))
690 node = find_near_online_node(node);
691 numa_set_node(cpu, node);
692 }
693 }
694
695 #ifndef CONFIG_DEBUG_PER_CPU_MAPS
696
697 # ifndef CONFIG_NUMA_EMU
numa_add_cpu(int cpu)698 void __cpuinit numa_add_cpu(int cpu)
699 {
700 cpumask_set_cpu(cpu, node_to_cpumask_map[early_cpu_to_node(cpu)]);
701 }
702
numa_remove_cpu(int cpu)703 void __cpuinit numa_remove_cpu(int cpu)
704 {
705 cpumask_clear_cpu(cpu, node_to_cpumask_map[early_cpu_to_node(cpu)]);
706 }
707 # endif /* !CONFIG_NUMA_EMU */
708
709 #else /* !CONFIG_DEBUG_PER_CPU_MAPS */
710
__cpu_to_node(int cpu)711 int __cpu_to_node(int cpu)
712 {
713 if (early_per_cpu_ptr(x86_cpu_to_node_map)) {
714 printk(KERN_WARNING
715 "cpu_to_node(%d): usage too early!\n", cpu);
716 dump_stack();
717 return early_per_cpu_ptr(x86_cpu_to_node_map)[cpu];
718 }
719 return per_cpu(x86_cpu_to_node_map, cpu);
720 }
721 EXPORT_SYMBOL(__cpu_to_node);
722
723 /*
724 * Same function as cpu_to_node() but used if called before the
725 * per_cpu areas are setup.
726 */
early_cpu_to_node(int cpu)727 int early_cpu_to_node(int cpu)
728 {
729 if (early_per_cpu_ptr(x86_cpu_to_node_map))
730 return early_per_cpu_ptr(x86_cpu_to_node_map)[cpu];
731
732 if (!cpu_possible(cpu)) {
733 printk(KERN_WARNING
734 "early_cpu_to_node(%d): no per_cpu area!\n", cpu);
735 dump_stack();
736 return NUMA_NO_NODE;
737 }
738 return per_cpu(x86_cpu_to_node_map, cpu);
739 }
740
debug_cpumask_set_cpu(int cpu,int node,bool enable)741 void debug_cpumask_set_cpu(int cpu, int node, bool enable)
742 {
743 struct cpumask *mask;
744 char buf[64];
745
746 if (node == NUMA_NO_NODE) {
747 /* early_cpu_to_node() already emits a warning and trace */
748 return;
749 }
750 mask = node_to_cpumask_map[node];
751 if (!mask) {
752 pr_err("node_to_cpumask_map[%i] NULL\n", node);
753 dump_stack();
754 return;
755 }
756
757 if (enable)
758 cpumask_set_cpu(cpu, mask);
759 else
760 cpumask_clear_cpu(cpu, mask);
761
762 cpulist_scnprintf(buf, sizeof(buf), mask);
763 printk(KERN_DEBUG "%s cpu %d node %d: mask now %s\n",
764 enable ? "numa_add_cpu" : "numa_remove_cpu",
765 cpu, node, buf);
766 return;
767 }
768
769 # ifndef CONFIG_NUMA_EMU
numa_set_cpumask(int cpu,bool enable)770 static void __cpuinit numa_set_cpumask(int cpu, bool enable)
771 {
772 debug_cpumask_set_cpu(cpu, early_cpu_to_node(cpu), enable);
773 }
774
numa_add_cpu(int cpu)775 void __cpuinit numa_add_cpu(int cpu)
776 {
777 numa_set_cpumask(cpu, true);
778 }
779
numa_remove_cpu(int cpu)780 void __cpuinit numa_remove_cpu(int cpu)
781 {
782 numa_set_cpumask(cpu, false);
783 }
784 # endif /* !CONFIG_NUMA_EMU */
785
786 /*
787 * Returns a pointer to the bitmask of CPUs on Node 'node'.
788 */
cpumask_of_node(int node)789 const struct cpumask *cpumask_of_node(int node)
790 {
791 if (node >= nr_node_ids) {
792 printk(KERN_WARNING
793 "cpumask_of_node(%d): node > nr_node_ids(%d)\n",
794 node, nr_node_ids);
795 dump_stack();
796 return cpu_none_mask;
797 }
798 if (node_to_cpumask_map[node] == NULL) {
799 printk(KERN_WARNING
800 "cpumask_of_node(%d): no node_to_cpumask_map!\n",
801 node);
802 dump_stack();
803 return cpu_online_mask;
804 }
805 return node_to_cpumask_map[node];
806 }
807 EXPORT_SYMBOL(cpumask_of_node);
808
809 #endif /* !CONFIG_DEBUG_PER_CPU_MAPS */
810
811 #ifdef CONFIG_MEMORY_HOTPLUG
memory_add_physaddr_to_nid(u64 start)812 int memory_add_physaddr_to_nid(u64 start)
813 {
814 struct numa_meminfo *mi = &numa_meminfo;
815 int nid = mi->blk[0].nid;
816 int i;
817
818 for (i = 0; i < mi->nr_blks; i++)
819 if (mi->blk[i].start <= start && mi->blk[i].end > start)
820 nid = mi->blk[i].nid;
821 return nid;
822 }
823 EXPORT_SYMBOL_GPL(memory_add_physaddr_to_nid);
824 #endif
825