discontig_32.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477
  1. /*
  2. * Written by: Patricia Gaughen <gone@us.ibm.com>, IBM Corporation
  3. * August 2002: added remote node KVA remap - Martin J. Bligh
  4. *
  5. * Copyright (C) 2002, IBM Corp.
  6. *
  7. * All rights reserved.
  8. *
  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.
  13. *
  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
  18. * details.
  19. *
  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.
  23. */
  24. #include <linux/mm.h>
  25. #include <linux/bootmem.h>
  26. #include <linux/mmzone.h>
  27. #include <linux/highmem.h>
  28. #include <linux/initrd.h>
  29. #include <linux/nodemask.h>
  30. #include <linux/module.h>
  31. #include <linux/kexec.h>
  32. #include <linux/pfn.h>
  33. #include <linux/swap.h>
  34. #include <linux/acpi.h>
  35. #include <asm/e820.h>
  36. #include <asm/setup.h>
  37. #include <asm/mmzone.h>
  38. #include <asm/bios_ebda.h>
  39. #include <asm/proto.h>
  40. struct pglist_data *node_data[MAX_NUMNODES] __read_mostly;
  41. EXPORT_SYMBOL(node_data);
  42. static bootmem_data_t node0_bdata;
  43. /*
  44. * numa interface - we expect the numa architecture specific code to have
  45. * populated the following initialisation.
  46. *
  47. * 1) node_online_map - the map of all nodes configured (online) in the system
  48. * 2) node_start_pfn - the starting page frame number for a node
  49. * 3) node_end_pfn - the ending page fram number for a node
  50. */
  51. unsigned long node_start_pfn[MAX_NUMNODES] __read_mostly;
  52. unsigned long node_end_pfn[MAX_NUMNODES] __read_mostly;
  53. #ifdef CONFIG_DISCONTIGMEM
  54. /*
  55. * 4) physnode_map - the mapping between a pfn and owning node
  56. * physnode_map keeps track of the physical memory layout of a generic
  57. * numa node on a 64Mb break (each element of the array will
  58. * represent 64Mb of memory and will be marked by the node id. so,
  59. * if the first gig is on node 0, and the second gig is on node 1
  60. * physnode_map will contain:
  61. *
  62. * physnode_map[0-15] = 0;
  63. * physnode_map[16-31] = 1;
  64. * physnode_map[32- ] = -1;
  65. */
  66. s8 physnode_map[MAX_ELEMENTS] __read_mostly = { [0 ... (MAX_ELEMENTS - 1)] = -1};
  67. EXPORT_SYMBOL(physnode_map);
  68. void memory_present(int nid, unsigned long start, unsigned long end)
  69. {
  70. unsigned long pfn;
  71. printk(KERN_INFO "Node: %d, start_pfn: %ld, end_pfn: %ld\n",
  72. nid, start, end);
  73. printk(KERN_DEBUG " Setting physnode_map array to node %d for pfns:\n", nid);
  74. printk(KERN_DEBUG " ");
  75. for (pfn = start; pfn < end; pfn += PAGES_PER_ELEMENT) {
  76. physnode_map[pfn / PAGES_PER_ELEMENT] = nid;
  77. printk(KERN_CONT "%ld ", pfn);
  78. }
  79. printk(KERN_CONT "\n");
  80. }
  81. unsigned long node_memmap_size_bytes(int nid, unsigned long start_pfn,
  82. unsigned long end_pfn)
  83. {
  84. unsigned long nr_pages = end_pfn - start_pfn;
  85. if (!nr_pages)
  86. return 0;
  87. return (nr_pages + 1) * sizeof(struct page);
  88. }
  89. #endif
  90. extern unsigned long find_max_low_pfn(void);
  91. extern void add_one_highpage_init(struct page *, int, int);
  92. extern unsigned long highend_pfn, highstart_pfn;
  93. #define LARGE_PAGE_BYTES (PTRS_PER_PTE * PAGE_SIZE)
  94. unsigned long node_remap_size[MAX_NUMNODES];
  95. static void *node_remap_start_vaddr[MAX_NUMNODES];
  96. void set_pmd_pfn(unsigned long vaddr, unsigned long pfn, pgprot_t flags);
  97. static unsigned long kva_start_pfn;
  98. static unsigned long kva_pages;
  99. /*
  100. * FLAT - support for basic PC memory model with discontig enabled, essentially
  101. * a single node with all available processors in it with a flat
  102. * memory map.
  103. */
  104. int __init get_memcfg_numa_flat(void)
  105. {
  106. printk("NUMA - single node, flat memory mode\n");
  107. node_start_pfn[0] = 0;
  108. node_end_pfn[0] = max_pfn;
  109. e820_register_active_regions(0, 0, max_pfn);
  110. memory_present(0, 0, max_pfn);
  111. node_remap_size[0] = node_memmap_size_bytes(0, 0, max_pfn);
  112. /* Indicate there is one node available. */
  113. nodes_clear(node_online_map);
  114. node_set_online(0);
  115. return 1;
  116. }
  117. /*
  118. * Find the highest page frame number we have available for the node
  119. */
  120. static void __init propagate_e820_map_node(int nid)
  121. {
  122. if (node_end_pfn[nid] > max_pfn)
  123. node_end_pfn[nid] = max_pfn;
  124. /*
  125. * if a user has given mem=XXXX, then we need to make sure
  126. * that the node _starts_ before that, too, not just ends
  127. */
  128. if (node_start_pfn[nid] > max_pfn)
  129. node_start_pfn[nid] = max_pfn;
  130. BUG_ON(node_start_pfn[nid] > node_end_pfn[nid]);
  131. }
  132. /*
  133. * Allocate memory for the pg_data_t for this node via a crude pre-bootmem
  134. * method. For node zero take this from the bottom of memory, for
  135. * subsequent nodes place them at node_remap_start_vaddr which contains
  136. * node local data in physically node local memory. See setup_memory()
  137. * for details.
  138. */
  139. static void __init allocate_pgdat(int nid)
  140. {
  141. if (nid && node_has_online_mem(nid))
  142. NODE_DATA(nid) = (pg_data_t *)node_remap_start_vaddr[nid];
  143. else {
  144. unsigned long pgdat_phys;
  145. pgdat_phys = find_e820_area(min_low_pfn<<PAGE_SHIFT,
  146. (nid ? max_low_pfn:max_pfn_mapped)<<PAGE_SHIFT,
  147. sizeof(pg_data_t),
  148. PAGE_SIZE);
  149. NODE_DATA(nid) = (pg_data_t *)(pfn_to_kaddr(pgdat_phys>>PAGE_SHIFT));
  150. reserve_early(pgdat_phys, pgdat_phys + sizeof(pg_data_t),
  151. "NODE_DATA");
  152. }
  153. printk(KERN_DEBUG "allocate_pgdat: node %d NODE_DATA %08lx\n",
  154. nid, (unsigned long)NODE_DATA(nid));
  155. }
  156. #ifdef CONFIG_DISCONTIGMEM
  157. /*
  158. * In the discontig memory model, a portion of the kernel virtual area (KVA)
  159. * is reserved and portions of nodes are mapped using it. This is to allow
  160. * node-local memory to be allocated for structures that would normally require
  161. * ZONE_NORMAL. The memory is allocated with alloc_remap() and callers
  162. * should be prepared to allocate from the bootmem allocator instead. This KVA
  163. * mechanism is incompatible with SPARSEMEM as it makes assumptions about the
  164. * layout of memory that are broken if alloc_remap() succeeds for some of the
  165. * map and fails for others
  166. */
  167. static unsigned long node_remap_start_pfn[MAX_NUMNODES];
  168. static void *node_remap_end_vaddr[MAX_NUMNODES];
  169. static void *node_remap_alloc_vaddr[MAX_NUMNODES];
  170. static unsigned long node_remap_offset[MAX_NUMNODES];
  171. void *alloc_remap(int nid, unsigned long size)
  172. {
  173. void *allocation = node_remap_alloc_vaddr[nid];
  174. size = ALIGN(size, L1_CACHE_BYTES);
  175. if (!allocation || (allocation + size) >= node_remap_end_vaddr[nid])
  176. return 0;
  177. node_remap_alloc_vaddr[nid] += size;
  178. memset(allocation, 0, size);
  179. return allocation;
  180. }
  181. void __init remap_numa_kva(void)
  182. {
  183. void *vaddr;
  184. unsigned long pfn;
  185. int node;
  186. for_each_online_node(node) {
  187. printk(KERN_DEBUG "remap_numa_kva: node %d\n", node);
  188. for (pfn=0; pfn < node_remap_size[node]; pfn += PTRS_PER_PTE) {
  189. vaddr = node_remap_start_vaddr[node]+(pfn<<PAGE_SHIFT);
  190. printk(KERN_DEBUG "remap_numa_kva: %08lx to pfn %08lx\n",
  191. (unsigned long)vaddr,
  192. node_remap_start_pfn[node] + pfn);
  193. set_pmd_pfn((ulong) vaddr,
  194. node_remap_start_pfn[node] + pfn,
  195. PAGE_KERNEL_LARGE);
  196. }
  197. }
  198. }
  199. static unsigned long calculate_numa_remap_pages(void)
  200. {
  201. int nid;
  202. unsigned long size, reserve_pages = 0;
  203. unsigned long pfn;
  204. for_each_online_node(nid) {
  205. unsigned old_end_pfn = node_end_pfn[nid];
  206. /*
  207. * The acpi/srat node info can show hot-add memroy zones
  208. * where memory could be added but not currently present.
  209. */
  210. if (node_start_pfn[nid] > max_pfn)
  211. continue;
  212. if (node_end_pfn[nid] > max_pfn)
  213. node_end_pfn[nid] = max_pfn;
  214. /* ensure the remap includes space for the pgdat. */
  215. size = node_remap_size[nid] + sizeof(pg_data_t);
  216. /* convert size to large (pmd size) pages, rounding up */
  217. size = (size + LARGE_PAGE_BYTES - 1) / LARGE_PAGE_BYTES;
  218. /* now the roundup is correct, convert to PAGE_SIZE pages */
  219. size = size * PTRS_PER_PTE;
  220. /*
  221. * Validate the region we are allocating only contains valid
  222. * pages.
  223. */
  224. for (pfn = node_end_pfn[nid] - size;
  225. pfn < node_end_pfn[nid]; pfn++)
  226. if (!page_is_ram(pfn))
  227. break;
  228. if (pfn != node_end_pfn[nid])
  229. size = 0;
  230. printk("Reserving %ld pages of KVA for lmem_map of node %d\n",
  231. size, nid);
  232. node_remap_size[nid] = size;
  233. node_remap_offset[nid] = reserve_pages;
  234. reserve_pages += size;
  235. printk("Shrinking node %d from %ld pages to %ld pages\n",
  236. nid, node_end_pfn[nid], node_end_pfn[nid] - size);
  237. if (node_end_pfn[nid] & (PTRS_PER_PTE-1)) {
  238. /*
  239. * Align node_end_pfn[] and node_remap_start_pfn[] to
  240. * pmd boundary. remap_numa_kva will barf otherwise.
  241. */
  242. printk("Shrinking node %d further by %ld pages for proper alignment\n",
  243. nid, node_end_pfn[nid] & (PTRS_PER_PTE-1));
  244. size += node_end_pfn[nid] & (PTRS_PER_PTE-1);
  245. }
  246. node_end_pfn[nid] -= size;
  247. node_remap_start_pfn[nid] = node_end_pfn[nid];
  248. shrink_active_range(nid, old_end_pfn, node_end_pfn[nid]);
  249. }
  250. printk("Reserving total of %ld pages for numa KVA remap\n",
  251. reserve_pages);
  252. return reserve_pages;
  253. }
  254. static void init_remap_allocator(int nid)
  255. {
  256. node_remap_start_vaddr[nid] = pfn_to_kaddr(
  257. kva_start_pfn + node_remap_offset[nid]);
  258. node_remap_end_vaddr[nid] = node_remap_start_vaddr[nid] +
  259. (node_remap_size[nid] * PAGE_SIZE);
  260. node_remap_alloc_vaddr[nid] = node_remap_start_vaddr[nid] +
  261. ALIGN(sizeof(pg_data_t), PAGE_SIZE);
  262. printk ("node %d will remap to vaddr %08lx - %08lx\n", nid,
  263. (ulong) node_remap_start_vaddr[nid],
  264. (ulong) node_remap_end_vaddr[nid]);
  265. }
  266. #else
  267. void *alloc_remap(int nid, unsigned long size)
  268. {
  269. return NULL;
  270. }
  271. static unsigned long calculate_numa_remap_pages(void)
  272. {
  273. return 0;
  274. }
  275. static void init_remap_allocator(int nid)
  276. {
  277. }
  278. void __init remap_numa_kva(void)
  279. {
  280. }
  281. #endif /* CONFIG_DISCONTIGMEM */
  282. extern void setup_bootmem_allocator(void);
  283. unsigned long __init setup_memory(void)
  284. {
  285. int nid;
  286. unsigned long system_start_pfn, system_max_low_pfn;
  287. long kva_target_pfn;
  288. /*
  289. * When mapping a NUMA machine we allocate the node_mem_map arrays
  290. * from node local memory. They are then mapped directly into KVA
  291. * between zone normal and vmalloc space. Calculate the size of
  292. * this space and use it to adjust the boundary between ZONE_NORMAL
  293. * and ZONE_HIGHMEM.
  294. */
  295. /* call find_max_low_pfn at first, it could update max_pfn */
  296. system_max_low_pfn = max_low_pfn = find_max_low_pfn();
  297. remove_all_active_ranges();
  298. get_memcfg_numa();
  299. kva_pages = round_up(calculate_numa_remap_pages(), PTRS_PER_PTE);
  300. /* partially used pages are not usable - thus round upwards */
  301. system_start_pfn = min_low_pfn = PFN_UP(init_pg_tables_end);
  302. kva_target_pfn = round_down(max_low_pfn - kva_pages, PTRS_PER_PTE);
  303. do {
  304. kva_start_pfn = find_e820_area(kva_target_pfn<<PAGE_SHIFT,
  305. max_low_pfn<<PAGE_SHIFT,
  306. kva_pages<<PAGE_SHIFT,
  307. PTRS_PER_PTE<<PAGE_SHIFT) >> PAGE_SHIFT;
  308. kva_target_pfn -= PTRS_PER_PTE;
  309. } while (kva_start_pfn == -1UL && kva_target_pfn > min_low_pfn);
  310. if (kva_start_pfn == -1UL)
  311. panic("Can not get kva space\n");
  312. printk("kva_start_pfn ~ %ld find_max_low_pfn() ~ %ld\n",
  313. kva_start_pfn, max_low_pfn);
  314. printk("max_pfn = %ld\n", max_pfn);
  315. /* avoid clash with initrd */
  316. reserve_early(kva_start_pfn<<PAGE_SHIFT,
  317. (kva_start_pfn + kva_pages)<<PAGE_SHIFT,
  318. "KVA PG");
  319. #ifdef CONFIG_HIGHMEM
  320. highstart_pfn = highend_pfn = max_pfn;
  321. if (max_pfn > system_max_low_pfn)
  322. highstart_pfn = system_max_low_pfn;
  323. printk(KERN_NOTICE "%ldMB HIGHMEM available.\n",
  324. pages_to_mb(highend_pfn - highstart_pfn));
  325. num_physpages = highend_pfn;
  326. high_memory = (void *) __va(highstart_pfn * PAGE_SIZE - 1) + 1;
  327. #else
  328. num_physpages = system_max_low_pfn;
  329. high_memory = (void *) __va(system_max_low_pfn * PAGE_SIZE - 1) + 1;
  330. #endif
  331. printk(KERN_NOTICE "%ldMB LOWMEM available.\n",
  332. pages_to_mb(system_max_low_pfn));
  333. printk("min_low_pfn = %ld, max_low_pfn = %ld, highstart_pfn = %ld\n",
  334. min_low_pfn, max_low_pfn, highstart_pfn);
  335. printk("Low memory ends at vaddr %08lx\n",
  336. (ulong) pfn_to_kaddr(max_low_pfn));
  337. for_each_online_node(nid) {
  338. init_remap_allocator(nid);
  339. allocate_pgdat(nid);
  340. }
  341. printk("High memory starts at vaddr %08lx\n",
  342. (ulong) pfn_to_kaddr(highstart_pfn));
  343. for_each_online_node(nid)
  344. propagate_e820_map_node(nid);
  345. memset(NODE_DATA(0), 0, sizeof(struct pglist_data));
  346. NODE_DATA(0)->bdata = &node0_bdata;
  347. setup_bootmem_allocator();
  348. return max_low_pfn;
  349. }
  350. void __init zone_sizes_init(void)
  351. {
  352. unsigned long max_zone_pfns[MAX_NR_ZONES];
  353. memset(max_zone_pfns, 0, sizeof(max_zone_pfns));
  354. max_zone_pfns[ZONE_DMA] =
  355. virt_to_phys((char *)MAX_DMA_ADDRESS) >> PAGE_SHIFT;
  356. max_zone_pfns[ZONE_NORMAL] = max_low_pfn;
  357. #ifdef CONFIG_HIGHMEM
  358. max_zone_pfns[ZONE_HIGHMEM] = highend_pfn;
  359. #endif
  360. free_area_init_nodes(max_zone_pfns);
  361. return;
  362. }
  363. void __init set_highmem_pages_init(int bad_ppro)
  364. {
  365. #ifdef CONFIG_HIGHMEM
  366. struct zone *zone;
  367. struct page *page;
  368. for_each_zone(zone) {
  369. unsigned long node_pfn, zone_start_pfn, zone_end_pfn;
  370. if (!is_highmem(zone))
  371. continue;
  372. zone_start_pfn = zone->zone_start_pfn;
  373. zone_end_pfn = zone_start_pfn + zone->spanned_pages;
  374. printk("Initializing %s for node %d (%08lx:%08lx)\n",
  375. zone->name, zone_to_nid(zone),
  376. zone_start_pfn, zone_end_pfn);
  377. for (node_pfn = zone_start_pfn; node_pfn < zone_end_pfn; node_pfn++) {
  378. if (!pfn_valid(node_pfn))
  379. continue;
  380. page = pfn_to_page(node_pfn);
  381. add_one_highpage_init(page, node_pfn, bad_ppro);
  382. }
  383. }
  384. totalram_pages += totalhigh_pages;
  385. #endif
  386. }
  387. #ifdef CONFIG_MEMORY_HOTPLUG
  388. static int paddr_to_nid(u64 addr)
  389. {
  390. int nid;
  391. unsigned long pfn = PFN_DOWN(addr);
  392. for_each_node(nid)
  393. if (node_start_pfn[nid] <= pfn &&
  394. pfn < node_end_pfn[nid])
  395. return nid;
  396. return -1;
  397. }
  398. /*
  399. * This function is used to ask node id BEFORE memmap and mem_section's
  400. * initialization (pfn_to_nid() can't be used yet).
  401. * If _PXM is not defined on ACPI's DSDT, node id must be found by this.
  402. */
  403. int memory_add_physaddr_to_nid(u64 addr)
  404. {
  405. int nid = paddr_to_nid(addr);
  406. return (nid >= 0) ? nid : 0;
  407. }
  408. EXPORT_SYMBOL_GPL(memory_add_physaddr_to_nid);
  409. #endif