2 * Written by: Patricia Gaughen <gone@us.ibm.com>, IBM Corporation
3 * August 2002: added remote node KVA remap - Martin J. Bligh
5 * Copyright (C) 2002, IBM Corp.
9 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License as published by
11 * the Free Software Foundation; either version 2 of the License, or
12 * (at your option) any later version.
14 * This program is distributed in the hope that it will be useful, but
15 * WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE, GOOD TITLE or
17 * NON INFRINGEMENT. See the GNU General Public License for more
20 * You should have received a copy of the GNU General Public License
21 * along with this program; if not, write to the Free Software
22 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
25 #include <linux/memblock.h>
26 #include <linux/init.h>
28 #include "numa_internal.h"
30 #ifdef CONFIG_DISCONTIGMEM
32 * 4) physnode_map - the mapping between a pfn and owning node
33 * physnode_map keeps track of the physical memory layout of a generic
34 * numa node on a 64Mb break (each element of the array will
35 * represent 64Mb of memory and will be marked by the node id. so,
36 * if the first gig is on node 0, and the second gig is on node 1
37 * physnode_map will contain:
39 * physnode_map[0-15] = 0;
40 * physnode_map[16-31] = 1;
41 * physnode_map[32- ] = -1;
43 s8 physnode_map
[MAX_SECTIONS
] __read_mostly
= { [0 ... (MAX_SECTIONS
- 1)] = -1};
44 EXPORT_SYMBOL(physnode_map
);
46 void memory_present(int nid
, unsigned long start
, unsigned long end
)
50 printk(KERN_INFO
"Node: %d, start_pfn: %lx, end_pfn: %lx\n",
52 printk(KERN_DEBUG
" Setting physnode_map array to node %d for pfns:\n", nid
);
53 printk(KERN_DEBUG
" ");
54 start
= round_down(start
, PAGES_PER_SECTION
);
55 end
= round_up(end
, PAGES_PER_SECTION
);
56 for (pfn
= start
; pfn
< end
; pfn
+= PAGES_PER_SECTION
) {
57 physnode_map
[pfn
/ PAGES_PER_SECTION
] = nid
;
58 printk(KERN_CONT
"%lx ", pfn
);
60 printk(KERN_CONT
"\n");
64 extern unsigned long highend_pfn
, highstart_pfn
;
66 void __init
initmem_init(void)
71 highstart_pfn
= highend_pfn
= max_pfn
;
72 if (max_pfn
> max_low_pfn
)
73 highstart_pfn
= max_low_pfn
;
74 printk(KERN_NOTICE
"%ldMB HIGHMEM available.\n",
75 pages_to_mb(highend_pfn
- highstart_pfn
));
76 high_memory
= (void *) __va(highstart_pfn
* PAGE_SIZE
- 1) + 1;
78 high_memory
= (void *) __va(max_low_pfn
* PAGE_SIZE
- 1) + 1;
80 printk(KERN_NOTICE
"%ldMB LOWMEM available.\n",
81 pages_to_mb(max_low_pfn
));
82 printk(KERN_DEBUG
"max_low_pfn = %lx, highstart_pfn = %lx\n",
83 max_low_pfn
, highstart_pfn
);
85 printk(KERN_DEBUG
"Low memory ends at vaddr %08lx\n",
86 (ulong
) pfn_to_kaddr(max_low_pfn
));
88 printk(KERN_DEBUG
"High memory starts at vaddr %08lx\n",
89 (ulong
) pfn_to_kaddr(highstart_pfn
));
91 __vmalloc_start_set
= true;
92 setup_bootmem_allocator();