2 * Generic VM initialization for x86-64 NUMA setups.
3 * Copyright 2002,2003 Andi Kleen, SuSE Labs.
5 #include <linux/kernel.h>
7 #include <linux/string.h>
8 #include <linux/init.h>
9 #include <linux/bootmem.h>
10 #include <linux/memblock.h>
11 #include <linux/mmzone.h>
12 #include <linux/ctype.h>
13 #include <linux/module.h>
14 #include <linux/nodemask.h>
15 #include <linux/sched.h>
18 #include <asm/proto.h>
24 struct pglist_data *node_data[MAX_NUMNODES] __read_mostly;
25 EXPORT_SYMBOL(node_data);
27 struct memnode memnode;
29 s16 apicid_to_node[MAX_LOCAL_APIC] __cpuinitdata = {
30 [0 ... MAX_LOCAL_APIC-1] = NUMA_NO_NODE
33 int numa_off __initdata;
34 static unsigned long __initdata nodemap_addr;
35 static unsigned long __initdata nodemap_size;
38 * Map cpu index to node index
40 DEFINE_EARLY_PER_CPU(int, x86_cpu_to_node_map, NUMA_NO_NODE);
41 EXPORT_EARLY_PER_CPU_SYMBOL(x86_cpu_to_node_map);
44 * Given a shift value, try to populate memnodemap[]
47 * 0 if memnodmap[] too small (of shift too small)
48 * -1 if node overlap or lost ram (shift too big)
50 static int __init populate_memnodemap(const struct bootnode *nodes,
51 int numnodes, int shift, int *nodeids)
53 unsigned long addr, end;
56 memset(memnodemap, 0xff, sizeof(s16)*memnodemapsize);
57 for (i = 0; i < numnodes; i++) {
58 addr = nodes[i].start;
62 if ((end >> shift) >= memnodemapsize)
65 if (memnodemap[addr >> shift] != NUMA_NO_NODE)
69 memnodemap[addr >> shift] = i;
71 memnodemap[addr >> shift] = nodeids[i];
73 addr += (1UL << shift);
80 static int __init allocate_cachealigned_memnodemap(void)
84 memnodemap = memnode.embedded_map;
85 if (memnodemapsize <= ARRAY_SIZE(memnode.embedded_map))
89 nodemap_size = roundup(sizeof(s16) * memnodemapsize, L1_CACHE_BYTES);
90 nodemap_addr = memblock_find_in_range(addr, max_pfn<<PAGE_SHIFT,
91 nodemap_size, L1_CACHE_BYTES);
92 if (nodemap_addr == MEMBLOCK_ERROR) {
94 "NUMA: Unable to allocate Memory to Node hash map\n");
95 nodemap_addr = nodemap_size = 0;
98 memnodemap = phys_to_virt(nodemap_addr);
99 memblock_x86_reserve_range(nodemap_addr, nodemap_addr + nodemap_size, "MEMNODEMAP");
101 printk(KERN_DEBUG "NUMA: Allocated memnodemap from %lx - %lx\n",
102 nodemap_addr, nodemap_addr + nodemap_size);
107 * The LSB of all start and end addresses in the node map is the value of the
108 * maximum possible shift.
110 static int __init extract_lsb_from_nodes(const struct bootnode *nodes,
113 int i, nodes_used = 0;
114 unsigned long start, end;
115 unsigned long bitfield = 0, memtop = 0;
117 for (i = 0; i < numnodes; i++) {
118 start = nodes[i].start;
130 i = find_first_bit(&bitfield, sizeof(unsigned long)*8);
131 memnodemapsize = (memtop >> i)+1;
135 int __init compute_hash_shift(struct bootnode *nodes, int numnodes,
140 shift = extract_lsb_from_nodes(nodes, numnodes);
141 if (allocate_cachealigned_memnodemap())
143 printk(KERN_DEBUG "NUMA: Using %d for the hash shift.\n",
146 if (populate_memnodemap(nodes, numnodes, shift, nodeids) != 1) {
147 printk(KERN_INFO "Your memory is not aligned you need to "
148 "rebuild your kernel with a bigger NODEMAPSIZE "
149 "shift=%d\n", shift);
155 int __meminit __early_pfn_to_nid(unsigned long pfn)
157 return phys_to_nid(pfn << PAGE_SHIFT);
160 static void * __init early_node_mem(int nodeid, unsigned long start,
161 unsigned long end, unsigned long size,
167 * put it on high as possible
168 * something will go with NODE_DATA
170 if (start < (MAX_DMA_PFN<<PAGE_SHIFT))
171 start = MAX_DMA_PFN<<PAGE_SHIFT;
172 if (start < (MAX_DMA32_PFN<<PAGE_SHIFT) &&
173 end > (MAX_DMA32_PFN<<PAGE_SHIFT))
174 start = MAX_DMA32_PFN<<PAGE_SHIFT;
175 mem = memblock_x86_find_in_range_node(nodeid, start, end, size, align);
176 if (mem != MEMBLOCK_ERROR)
179 /* extend the search scope */
180 end = max_pfn_mapped << PAGE_SHIFT;
181 if (end > (MAX_DMA32_PFN<<PAGE_SHIFT))
182 start = MAX_DMA32_PFN<<PAGE_SHIFT;
184 start = MAX_DMA_PFN<<PAGE_SHIFT;
185 mem = memblock_x86_find_in_range_node(nodeid, start, end, size, align);
186 if (mem != MEMBLOCK_ERROR)
189 printk(KERN_ERR "Cannot find %lu bytes in node %d\n",
195 /* Initialize bootmem allocator for a node */
197 setup_node_bootmem(int nodeid, unsigned long start, unsigned long end)
199 unsigned long start_pfn, last_pfn, nodedata_phys;
200 const int pgdat_size = roundup(sizeof(pg_data_t), PAGE_SIZE);
202 #ifndef CONFIG_NO_BOOTMEM
203 unsigned long bootmap_start, bootmap_pages, bootmap_size;
211 * Don't confuse VM with a node that doesn't have the
212 * minimum amount of memory:
214 if (end && (end - start) < NODE_MIN_SIZE)
217 start = roundup(start, ZONE_ALIGN);
219 printk(KERN_INFO "Initmem setup node %d %016lx-%016lx\n", nodeid,
222 start_pfn = start >> PAGE_SHIFT;
223 last_pfn = end >> PAGE_SHIFT;
225 node_data[nodeid] = early_node_mem(nodeid, start, end, pgdat_size,
227 if (node_data[nodeid] == NULL)
229 nodedata_phys = __pa(node_data[nodeid]);
230 memblock_x86_reserve_range(nodedata_phys, nodedata_phys + pgdat_size, "NODE_DATA");
231 printk(KERN_INFO " NODE_DATA [%016lx - %016lx]\n", nodedata_phys,
232 nodedata_phys + pgdat_size - 1);
233 nid = phys_to_nid(nodedata_phys);
235 printk(KERN_INFO " NODE_DATA(%d) on node %d\n", nodeid, nid);
237 memset(NODE_DATA(nodeid), 0, sizeof(pg_data_t));
238 NODE_DATA(nodeid)->node_id = nodeid;
239 NODE_DATA(nodeid)->node_start_pfn = start_pfn;
240 NODE_DATA(nodeid)->node_spanned_pages = last_pfn - start_pfn;
242 #ifndef CONFIG_NO_BOOTMEM
243 NODE_DATA(nodeid)->bdata = &bootmem_node_data[nodeid];
246 * Find a place for the bootmem map
247 * nodedata_phys could be on other nodes by alloc_bootmem,
248 * so need to sure bootmap_start not to be small, otherwise
249 * early_node_mem will get that with memblock_find_in_range instead
250 * of alloc_bootmem, that could clash with reserved range
252 bootmap_pages = bootmem_bootmap_pages(last_pfn - start_pfn);
253 bootmap_start = roundup(nodedata_phys + pgdat_size, PAGE_SIZE);
255 * SMP_CACHE_BYTES could be enough, but init_bootmem_node like
256 * to use that to align to PAGE_SIZE
258 bootmap = early_node_mem(nodeid, bootmap_start, end,
259 bootmap_pages<<PAGE_SHIFT, PAGE_SIZE);
260 if (bootmap == NULL) {
261 memblock_x86_free_range(nodedata_phys, nodedata_phys + pgdat_size);
262 node_data[nodeid] = NULL;
265 bootmap_start = __pa(bootmap);
266 memblock_x86_reserve_range(bootmap_start, bootmap_start+(bootmap_pages<<PAGE_SHIFT),
269 bootmap_size = init_bootmem_node(NODE_DATA(nodeid),
270 bootmap_start >> PAGE_SHIFT,
271 start_pfn, last_pfn);
273 printk(KERN_INFO " bootmap [%016lx - %016lx] pages %lx\n",
274 bootmap_start, bootmap_start + bootmap_size - 1,
276 nid = phys_to_nid(bootmap_start);
278 printk(KERN_INFO " bootmap(%d) on node %d\n", nodeid, nid);
280 free_bootmem_with_active_regions(nodeid, end);
283 node_set_online(nodeid);
287 * There are unfortunately some poorly designed mainboards around that
288 * only connect memory to a single CPU. This breaks the 1:1 cpu->node
289 * mapping. To avoid this fill in the mapping for all possible CPUs,
290 * as the number of CPUs is not known yet. We round robin the existing
293 void __init numa_init_array(void)
297 rr = first_node(node_online_map);
298 for (i = 0; i < nr_cpu_ids; i++) {
299 if (early_cpu_to_node(i) != NUMA_NO_NODE)
301 numa_set_node(i, rr);
302 rr = next_node(rr, node_online_map);
303 if (rr == MAX_NUMNODES)
304 rr = first_node(node_online_map);
308 #ifdef CONFIG_NUMA_EMU
310 static struct bootnode nodes[MAX_NUMNODES] __initdata;
311 static struct bootnode physnodes[MAX_NUMNODES] __initdata;
312 static char *cmdline __initdata;
314 static int __init setup_physnodes(unsigned long start, unsigned long end,
321 #ifdef CONFIG_ACPI_NUMA
323 nr_nodes = acpi_get_nodes(physnodes);
325 #ifdef CONFIG_K8_NUMA
327 nr_nodes = k8_get_nodes(physnodes);
330 * Basic sanity checking on the physical node map: there may be errors
331 * if the SRAT or K8 incorrectly reported the topology or the mem=
332 * kernel parameter is used.
334 for (i = 0; i < nr_nodes; i++) {
335 if (physnodes[i].start == physnodes[i].end)
337 if (physnodes[i].start > end) {
338 physnodes[i].end = physnodes[i].start;
341 if (physnodes[i].end < start) {
342 physnodes[i].start = physnodes[i].end;
345 if (physnodes[i].start < start)
346 physnodes[i].start = start;
347 if (physnodes[i].end > end)
348 physnodes[i].end = end;
352 * Remove all nodes that have no memory or were truncated because of the
353 * limited address range.
355 for (i = 0; i < nr_nodes; i++) {
356 if (physnodes[i].start == physnodes[i].end)
358 physnodes[ret].start = physnodes[i].start;
359 physnodes[ret].end = physnodes[i].end;
364 * If no physical topology was detected, a single node is faked to cover
365 * the entire address space.
368 physnodes[ret].start = start;
369 physnodes[ret].end = end;
376 * Setups up nid to range from addr to addr + size. If the end
377 * boundary is greater than max_addr, then max_addr is used instead.
378 * The return value is 0 if there is additional memory left for
379 * allocation past addr and -1 otherwise. addr is adjusted to be at
380 * the end of the node.
382 static int __init setup_node_range(int nid, u64 *addr, u64 size, u64 max_addr)
385 nodes[nid].start = *addr;
387 if (*addr >= max_addr) {
391 nodes[nid].end = *addr;
392 node_set(nid, node_possible_map);
393 printk(KERN_INFO "Faking node %d at %016Lx-%016Lx (%LuMB)\n", nid,
394 nodes[nid].start, nodes[nid].end,
395 (nodes[nid].end - nodes[nid].start) >> 20);
400 * Sets up nr_nodes fake nodes interleaved over physical nodes ranging from addr
401 * to max_addr. The return value is the number of nodes allocated.
403 static int __init split_nodes_interleave(u64 addr, u64 max_addr,
404 int nr_phys_nodes, int nr_nodes)
406 nodemask_t physnode_mask = NODE_MASK_NONE;
414 if (nr_nodes > MAX_NUMNODES) {
415 pr_info("numa=fake=%d too large, reducing to %d\n",
416 nr_nodes, MAX_NUMNODES);
417 nr_nodes = MAX_NUMNODES;
420 size = (max_addr - addr - memblock_x86_hole_size(addr, max_addr)) / nr_nodes;
422 * Calculate the number of big nodes that can be allocated as a result
423 * of consolidating the remainder.
425 big = ((size & ~FAKE_NODE_MIN_HASH_MASK) * nr_nodes) /
428 size &= FAKE_NODE_MIN_HASH_MASK;
430 pr_err("Not enough memory for each node. "
431 "NUMA emulation disabled.\n");
435 for (i = 0; i < nr_phys_nodes; i++)
436 if (physnodes[i].start != physnodes[i].end)
437 node_set(i, physnode_mask);
440 * Continue to fill physical nodes with fake nodes until there is no
441 * memory left on any of them.
443 while (nodes_weight(physnode_mask)) {
444 for_each_node_mask(i, physnode_mask) {
445 u64 end = physnodes[i].start + size;
446 u64 dma32_end = PFN_PHYS(MAX_DMA32_PFN);
449 end += FAKE_NODE_MIN_SIZE;
452 * Continue to add memory to this fake node if its
453 * non-reserved memory is less than the per-node size.
455 while (end - physnodes[i].start -
456 memblock_x86_hole_size(physnodes[i].start, end) < size) {
457 end += FAKE_NODE_MIN_SIZE;
458 if (end > physnodes[i].end) {
459 end = physnodes[i].end;
465 * If there won't be at least FAKE_NODE_MIN_SIZE of
466 * non-reserved memory in ZONE_DMA32 for the next node,
467 * this one must extend to the boundary.
469 if (end < dma32_end && dma32_end - end -
470 memblock_x86_hole_size(end, dma32_end) < FAKE_NODE_MIN_SIZE)
474 * If there won't be enough non-reserved memory for the
475 * next node, this one must extend to the end of the
478 if (physnodes[i].end - end -
479 memblock_x86_hole_size(end, physnodes[i].end) < size)
480 end = physnodes[i].end;
483 * Avoid allocating more nodes than requested, which can
484 * happen as a result of rounding down each node's size
485 * to FAKE_NODE_MIN_SIZE.
487 if (nodes_weight(physnode_mask) + ret >= nr_nodes)
488 end = physnodes[i].end;
490 if (setup_node_range(ret++, &physnodes[i].start,
491 end - physnodes[i].start,
492 physnodes[i].end) < 0)
493 node_clear(i, physnode_mask);
500 * Returns the end address of a node so that there is at least `size' amount of
501 * non-reserved memory or `max_addr' is reached.
503 static u64 __init find_end_of_node(u64 start, u64 max_addr, u64 size)
505 u64 end = start + size;
507 while (end - start - memblock_x86_hole_size(start, end) < size) {
508 end += FAKE_NODE_MIN_SIZE;
509 if (end > max_addr) {
518 * Sets up fake nodes of `size' interleaved over physical nodes ranging from
519 * `addr' to `max_addr'. The return value is the number of nodes allocated.
521 static int __init split_nodes_size_interleave(u64 addr, u64 max_addr, u64 size)
523 nodemask_t physnode_mask = NODE_MASK_NONE;
531 * The limit on emulated nodes is MAX_NUMNODES, so the size per node is
532 * increased accordingly if the requested size is too small. This
533 * creates a uniform distribution of node sizes across the entire
534 * machine (but not necessarily over physical nodes).
536 min_size = (max_addr - addr - memblock_x86_hole_size(addr, max_addr)) /
538 min_size = max(min_size, FAKE_NODE_MIN_SIZE);
539 if ((min_size & FAKE_NODE_MIN_HASH_MASK) < min_size)
540 min_size = (min_size + FAKE_NODE_MIN_SIZE) &
541 FAKE_NODE_MIN_HASH_MASK;
542 if (size < min_size) {
543 pr_err("Fake node size %LuMB too small, increasing to %LuMB\n",
544 size >> 20, min_size >> 20);
547 size &= FAKE_NODE_MIN_HASH_MASK;
549 for (i = 0; i < MAX_NUMNODES; i++)
550 if (physnodes[i].start != physnodes[i].end)
551 node_set(i, physnode_mask);
553 * Fill physical nodes with fake nodes of size until there is no memory
554 * left on any of them.
556 while (nodes_weight(physnode_mask)) {
557 for_each_node_mask(i, physnode_mask) {
558 u64 dma32_end = MAX_DMA32_PFN << PAGE_SHIFT;
561 end = find_end_of_node(physnodes[i].start,
562 physnodes[i].end, size);
564 * If there won't be at least FAKE_NODE_MIN_SIZE of
565 * non-reserved memory in ZONE_DMA32 for the next node,
566 * this one must extend to the boundary.
568 if (end < dma32_end && dma32_end - end -
569 memblock_x86_hole_size(end, dma32_end) < FAKE_NODE_MIN_SIZE)
573 * If there won't be enough non-reserved memory for the
574 * next node, this one must extend to the end of the
577 if (physnodes[i].end - end -
578 memblock_x86_hole_size(end, physnodes[i].end) < size)
579 end = physnodes[i].end;
582 * Setup the fake node that will be allocated as bootmem
583 * later. If setup_node_range() returns non-zero, there
584 * is no more memory available on this physical node.
586 if (setup_node_range(ret++, &physnodes[i].start,
587 end - physnodes[i].start,
588 physnodes[i].end) < 0)
589 node_clear(i, physnode_mask);
596 * Sets up the system RAM area from start_pfn to last_pfn according to the
597 * numa=fake command-line option.
599 static int __init numa_emulation(unsigned long start_pfn,
600 unsigned long last_pfn, int acpi, int k8)
602 u64 addr = start_pfn << PAGE_SHIFT;
603 u64 max_addr = last_pfn << PAGE_SHIFT;
608 num_phys_nodes = setup_physnodes(addr, max_addr, acpi, k8);
610 * If the numa=fake command-line contains a 'M' or 'G', it represents
611 * the fixed node size. Otherwise, if it is just a single number N,
612 * split the system RAM into N fake nodes.
614 if (strchr(cmdline, 'M') || strchr(cmdline, 'G')) {
617 size = memparse(cmdline, &cmdline);
618 num_nodes = split_nodes_size_interleave(addr, max_addr, size);
622 n = simple_strtoul(cmdline, NULL, 0);
623 num_nodes = split_nodes_interleave(addr, max_addr, num_phys_nodes, n);
628 memnode_shift = compute_hash_shift(nodes, num_nodes, NULL);
629 if (memnode_shift < 0) {
631 printk(KERN_ERR "No NUMA hash function found. NUMA emulation "
637 * We need to vacate all active ranges that may have been registered for
638 * the e820 memory map.
640 remove_all_active_ranges();
641 for_each_node_mask(i, node_possible_map) {
642 memblock_x86_register_active_regions(i, nodes[i].start >> PAGE_SHIFT,
643 nodes[i].end >> PAGE_SHIFT);
644 setup_node_bootmem(i, nodes[i].start, nodes[i].end);
646 acpi_fake_nodes(nodes, num_nodes);
650 #endif /* CONFIG_NUMA_EMU */
652 void __init initmem_init(unsigned long start_pfn, unsigned long last_pfn,
657 nodes_clear(node_possible_map);
658 nodes_clear(node_online_map);
660 #ifdef CONFIG_NUMA_EMU
661 if (cmdline && !numa_emulation(start_pfn, last_pfn, acpi, k8))
663 nodes_clear(node_possible_map);
664 nodes_clear(node_online_map);
667 #ifdef CONFIG_ACPI_NUMA
668 if (!numa_off && acpi && !acpi_scan_nodes(start_pfn << PAGE_SHIFT,
669 last_pfn << PAGE_SHIFT))
671 nodes_clear(node_possible_map);
672 nodes_clear(node_online_map);
675 #ifdef CONFIG_K8_NUMA
676 if (!numa_off && k8 && !k8_scan_nodes())
678 nodes_clear(node_possible_map);
679 nodes_clear(node_online_map);
681 printk(KERN_INFO "%s\n",
682 numa_off ? "NUMA turned off" : "No NUMA configuration found");
684 printk(KERN_INFO "Faking a node at %016lx-%016lx\n",
685 start_pfn << PAGE_SHIFT,
686 last_pfn << PAGE_SHIFT);
687 /* setup dummy node covering all memory */
689 memnodemap = memnode.embedded_map;
692 node_set(0, node_possible_map);
693 for (i = 0; i < nr_cpu_ids; i++)
695 memblock_x86_register_active_regions(0, start_pfn, last_pfn);
696 setup_node_bootmem(0, start_pfn << PAGE_SHIFT, last_pfn << PAGE_SHIFT);
699 unsigned long __init numa_free_all_bootmem(void)
701 unsigned long pages = 0;
704 for_each_online_node(i)
705 pages += free_all_bootmem_node(NODE_DATA(i));
707 #ifdef CONFIG_NO_BOOTMEM
708 pages += free_all_memory_core_early(MAX_NUMNODES);
714 static __init int numa_setup(char *opt)
718 if (!strncmp(opt, "off", 3))
720 #ifdef CONFIG_NUMA_EMU
721 if (!strncmp(opt, "fake=", 5))
724 #ifdef CONFIG_ACPI_NUMA
725 if (!strncmp(opt, "noacpi", 6))
730 early_param("numa", numa_setup);
734 static __init int find_near_online_node(int node)
737 int min_val = INT_MAX;
740 for_each_online_node(n) {
741 val = node_distance(node, n);
753 * Setup early cpu_to_node.
755 * Populate cpu_to_node[] only if x86_cpu_to_apicid[],
756 * and apicid_to_node[] tables have valid entries for a CPU.
757 * This means we skip cpu_to_node[] initialisation for NUMA
758 * emulation and faking node case (when running a kernel compiled
759 * for NUMA on a non NUMA box), which is OK as cpu_to_node[]
760 * is already initialized in a round robin manner at numa_init_array,
761 * prior to this call, and this initialization is good enough
762 * for the fake NUMA cases.
764 * Called before the per_cpu areas are setup.
766 void __init init_cpu_to_node(void)
769 u16 *cpu_to_apicid = early_per_cpu_ptr(x86_cpu_to_apicid);
771 BUG_ON(cpu_to_apicid == NULL);
773 for_each_possible_cpu(cpu) {
775 u16 apicid = cpu_to_apicid[cpu];
777 if (apicid == BAD_APICID)
779 node = apicid_to_node[apicid];
780 if (node == NUMA_NO_NODE)
782 if (!node_online(node))
783 node = find_near_online_node(node);
784 numa_set_node(cpu, node);
790 void __cpuinit numa_set_node(int cpu, int node)
792 int *cpu_to_node_map = early_per_cpu_ptr(x86_cpu_to_node_map);
794 /* early setting, no percpu area yet */
795 if (cpu_to_node_map) {
796 cpu_to_node_map[cpu] = node;
800 #ifdef CONFIG_DEBUG_PER_CPU_MAPS
801 if (cpu >= nr_cpu_ids || !cpu_possible(cpu)) {
802 printk(KERN_ERR "numa_set_node: invalid cpu# (%d)\n", cpu);
807 per_cpu(x86_cpu_to_node_map, cpu) = node;
809 if (node != NUMA_NO_NODE)
810 set_cpu_numa_node(cpu, node);
813 void __cpuinit numa_clear_node(int cpu)
815 numa_set_node(cpu, NUMA_NO_NODE);
818 #ifndef CONFIG_DEBUG_PER_CPU_MAPS
820 void __cpuinit numa_add_cpu(int cpu)
822 cpumask_set_cpu(cpu, node_to_cpumask_map[early_cpu_to_node(cpu)]);
825 void __cpuinit numa_remove_cpu(int cpu)
827 cpumask_clear_cpu(cpu, node_to_cpumask_map[early_cpu_to_node(cpu)]);
830 #else /* CONFIG_DEBUG_PER_CPU_MAPS */
833 * --------- debug versions of the numa functions ---------
835 static void __cpuinit numa_set_cpumask(int cpu, int enable)
837 int node = early_cpu_to_node(cpu);
838 struct cpumask *mask;
841 mask = node_to_cpumask_map[node];
843 printk(KERN_ERR "node_to_cpumask_map[%i] NULL\n", node);
849 cpumask_set_cpu(cpu, mask);
851 cpumask_clear_cpu(cpu, mask);
853 cpulist_scnprintf(buf, sizeof(buf), mask);
854 printk(KERN_DEBUG "%s cpu %d node %d: mask now %s\n",
855 enable ? "numa_add_cpu" : "numa_remove_cpu", cpu, node, buf);
858 void __cpuinit numa_add_cpu(int cpu)
860 numa_set_cpumask(cpu, 1);
863 void __cpuinit numa_remove_cpu(int cpu)
865 numa_set_cpumask(cpu, 0);
868 int __cpu_to_node(int cpu)
870 if (early_per_cpu_ptr(x86_cpu_to_node_map)) {
872 "cpu_to_node(%d): usage too early!\n", cpu);
874 return early_per_cpu_ptr(x86_cpu_to_node_map)[cpu];
876 return per_cpu(x86_cpu_to_node_map, cpu);
878 EXPORT_SYMBOL(__cpu_to_node);
881 * Same function as cpu_to_node() but used if called before the
882 * per_cpu areas are setup.
884 int early_cpu_to_node(int cpu)
886 if (early_per_cpu_ptr(x86_cpu_to_node_map))
887 return early_per_cpu_ptr(x86_cpu_to_node_map)[cpu];
889 if (!cpu_possible(cpu)) {
891 "early_cpu_to_node(%d): no per_cpu area!\n", cpu);
895 return per_cpu(x86_cpu_to_node_map, cpu);
899 * --------- end of debug versions of the numa functions ---------
902 #endif /* CONFIG_DEBUG_PER_CPU_MAPS */