numa_32.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454
  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. /*
  43. * numa interface - we expect the numa architecture specific code to have
  44. * populated the following initialisation.
  45. *
  46. * 1) node_online_map - the map of all nodes configured (online) in the system
  47. * 2) node_start_pfn - the starting page frame number for a node
  48. * 3) node_end_pfn - the ending page fram number for a node
  49. */
  50. unsigned long node_start_pfn[MAX_NUMNODES] __read_mostly;
  51. unsigned long node_end_pfn[MAX_NUMNODES] __read_mostly;
  52. #ifdef CONFIG_DISCONTIGMEM
  53. /*
  54. * 4) physnode_map - the mapping between a pfn and owning node
  55. * physnode_map keeps track of the physical memory layout of a generic
  56. * numa node on a 64Mb break (each element of the array will
  57. * represent 64Mb of memory and will be marked by the node id. so,
  58. * if the first gig is on node 0, and the second gig is on node 1
  59. * physnode_map will contain:
  60. *
  61. * physnode_map[0-15] = 0;
  62. * physnode_map[16-31] = 1;
  63. * physnode_map[32- ] = -1;
  64. */
  65. s8 physnode_map[MAX_ELEMENTS] __read_mostly = { [0 ... (MAX_ELEMENTS - 1)] = -1};
  66. EXPORT_SYMBOL(physnode_map);
  67. void memory_present(int nid, unsigned long start, unsigned long end)
  68. {
  69. unsigned long pfn;
  70. printk(KERN_INFO "Node: %d, start_pfn: %lx, end_pfn: %lx\n",
  71. nid, start, end);
  72. printk(KERN_DEBUG " Setting physnode_map array to node %d for pfns:\n", nid);
  73. printk(KERN_DEBUG " ");
  74. for (pfn = start; pfn < end; pfn += PAGES_PER_ELEMENT) {
  75. physnode_map[pfn / PAGES_PER_ELEMENT] = nid;
  76. printk(KERN_CONT "%lx ", pfn);
  77. }
  78. printk(KERN_CONT "\n");
  79. }
  80. unsigned long node_memmap_size_bytes(int nid, unsigned long start_pfn,
  81. unsigned long end_pfn)
  82. {
  83. unsigned long nr_pages = end_pfn - start_pfn;
  84. if (!nr_pages)
  85. return 0;
  86. return (nr_pages + 1) * sizeof(struct page);
  87. }
  88. #endif
  89. extern unsigned long find_max_low_pfn(void);
  90. extern unsigned long highend_pfn, highstart_pfn;
  91. #define LARGE_PAGE_BYTES (PTRS_PER_PTE * PAGE_SIZE)
  92. unsigned long node_remap_size[MAX_NUMNODES];
  93. static void *node_remap_start_vaddr[MAX_NUMNODES];
  94. void set_pmd_pfn(unsigned long vaddr, unsigned long pfn, pgprot_t flags);
  95. static unsigned long kva_start_pfn;
  96. static unsigned long kva_pages;
  97. /*
  98. * FLAT - support for basic PC memory model with discontig enabled, essentially
  99. * a single node with all available processors in it with a flat
  100. * memory map.
  101. */
  102. int __init get_memcfg_numa_flat(void)
  103. {
  104. printk(KERN_DEBUG "NUMA - single node, flat memory mode\n");
  105. node_start_pfn[0] = 0;
  106. node_end_pfn[0] = max_pfn;
  107. e820_register_active_regions(0, 0, max_pfn);
  108. memory_present(0, 0, max_pfn);
  109. node_remap_size[0] = node_memmap_size_bytes(0, 0, max_pfn);
  110. /* Indicate there is one node available. */
  111. nodes_clear(node_online_map);
  112. node_set_online(0);
  113. return 1;
  114. }
  115. /*
  116. * Find the highest page frame number we have available for the node
  117. */
  118. static void __init propagate_e820_map_node(int nid)
  119. {
  120. if (node_end_pfn[nid] > max_pfn)
  121. node_end_pfn[nid] = max_pfn;
  122. /*
  123. * if a user has given mem=XXXX, then we need to make sure
  124. * that the node _starts_ before that, too, not just ends
  125. */
  126. if (node_start_pfn[nid] > max_pfn)
  127. node_start_pfn[nid] = max_pfn;
  128. BUG_ON(node_start_pfn[nid] > node_end_pfn[nid]);
  129. }
  130. /*
  131. * Allocate memory for the pg_data_t for this node via a crude pre-bootmem
  132. * method. For node zero take this from the bottom of memory, for
  133. * subsequent nodes place them at node_remap_start_vaddr which contains
  134. * node local data in physically node local memory. See setup_memory()
  135. * for details.
  136. */
  137. static void __init allocate_pgdat(int nid)
  138. {
  139. char buf[16];
  140. if (node_has_online_mem(nid) && node_remap_start_vaddr[nid])
  141. NODE_DATA(nid) = (pg_data_t *)node_remap_start_vaddr[nid];
  142. else {
  143. unsigned long pgdat_phys;
  144. pgdat_phys = find_e820_area(min_low_pfn<<PAGE_SHIFT,
  145. max_pfn_mapped<<PAGE_SHIFT,
  146. sizeof(pg_data_t),
  147. PAGE_SIZE);
  148. NODE_DATA(nid) = (pg_data_t *)(pfn_to_kaddr(pgdat_phys>>PAGE_SHIFT));
  149. memset(buf, 0, sizeof(buf));
  150. sprintf(buf, "NODE_DATA %d", nid);
  151. reserve_early(pgdat_phys, pgdat_phys + sizeof(pg_data_t), buf);
  152. }
  153. printk(KERN_DEBUG "allocate_pgdat: node %d NODE_DATA %08lx\n",
  154. nid, (unsigned long)NODE_DATA(nid));
  155. }
  156. /*
  157. * In the DISCONTIGMEM and SPARSEMEM memory model, a portion of the kernel
  158. * virtual address space (KVA) is reserved and portions of nodes are mapped
  159. * using it. This is to allow node-local memory to be allocated for
  160. * structures that would normally require ZONE_NORMAL. The memory is
  161. * allocated with alloc_remap() and callers should be prepared to allocate
  162. * from the bootmem allocator instead.
  163. */
  164. static unsigned long node_remap_start_pfn[MAX_NUMNODES];
  165. static void *node_remap_end_vaddr[MAX_NUMNODES];
  166. static void *node_remap_alloc_vaddr[MAX_NUMNODES];
  167. static unsigned long node_remap_offset[MAX_NUMNODES];
  168. void *alloc_remap(int nid, unsigned long size)
  169. {
  170. void *allocation = node_remap_alloc_vaddr[nid];
  171. size = ALIGN(size, L1_CACHE_BYTES);
  172. if (!allocation || (allocation + size) >= node_remap_end_vaddr[nid])
  173. return NULL;
  174. node_remap_alloc_vaddr[nid] += size;
  175. memset(allocation, 0, size);
  176. return allocation;
  177. }
  178. static void __init remap_numa_kva(void)
  179. {
  180. void *vaddr;
  181. unsigned long pfn;
  182. int node;
  183. for_each_online_node(node) {
  184. printk(KERN_DEBUG "remap_numa_kva: node %d\n", node);
  185. for (pfn=0; pfn < node_remap_size[node]; pfn += PTRS_PER_PTE) {
  186. vaddr = node_remap_start_vaddr[node]+(pfn<<PAGE_SHIFT);
  187. printk(KERN_DEBUG "remap_numa_kva: %08lx to pfn %08lx\n",
  188. (unsigned long)vaddr,
  189. node_remap_start_pfn[node] + pfn);
  190. set_pmd_pfn((ulong) vaddr,
  191. node_remap_start_pfn[node] + pfn,
  192. PAGE_KERNEL_LARGE);
  193. }
  194. }
  195. }
  196. #ifdef CONFIG_HIBERNATION
  197. /**
  198. * resume_map_numa_kva - add KVA mapping to the temporary page tables created
  199. * during resume from hibernation
  200. * @pgd_base - temporary resume page directory
  201. */
  202. void resume_map_numa_kva(pgd_t *pgd_base)
  203. {
  204. int node;
  205. for_each_online_node(node) {
  206. unsigned long start_va, start_pfn, size, pfn;
  207. start_va = (unsigned long)node_remap_start_vaddr[node];
  208. start_pfn = node_remap_start_pfn[node];
  209. size = node_remap_size[node];
  210. printk(KERN_DEBUG "%s: node %d\n", __func__, node);
  211. for (pfn = 0; pfn < size; pfn += PTRS_PER_PTE) {
  212. unsigned long vaddr = start_va + (pfn << PAGE_SHIFT);
  213. pgd_t *pgd = pgd_base + pgd_index(vaddr);
  214. pud_t *pud = pud_offset(pgd, vaddr);
  215. pmd_t *pmd = pmd_offset(pud, vaddr);
  216. set_pmd(pmd, pfn_pmd(start_pfn + pfn,
  217. PAGE_KERNEL_LARGE_EXEC));
  218. printk(KERN_DEBUG "%s: %08lx -> pfn %08lx\n",
  219. __func__, vaddr, start_pfn + pfn);
  220. }
  221. }
  222. }
  223. #endif
  224. static __init unsigned long calculate_numa_remap_pages(void)
  225. {
  226. int nid;
  227. unsigned long size, reserve_pages = 0;
  228. for_each_online_node(nid) {
  229. u64 node_kva_target;
  230. u64 node_kva_final;
  231. /*
  232. * The acpi/srat node info can show hot-add memroy zones
  233. * where memory could be added but not currently present.
  234. */
  235. printk(KERN_DEBUG "node %d pfn: [%lx - %lx]\n",
  236. nid, node_start_pfn[nid], node_end_pfn[nid]);
  237. if (node_start_pfn[nid] > max_pfn)
  238. continue;
  239. if (!node_end_pfn[nid])
  240. continue;
  241. if (node_end_pfn[nid] > max_pfn)
  242. node_end_pfn[nid] = max_pfn;
  243. /* ensure the remap includes space for the pgdat. */
  244. size = node_remap_size[nid] + sizeof(pg_data_t);
  245. /* convert size to large (pmd size) pages, rounding up */
  246. size = (size + LARGE_PAGE_BYTES - 1) / LARGE_PAGE_BYTES;
  247. /* now the roundup is correct, convert to PAGE_SIZE pages */
  248. size = size * PTRS_PER_PTE;
  249. node_kva_target = round_down(node_end_pfn[nid] - size,
  250. PTRS_PER_PTE);
  251. node_kva_target <<= PAGE_SHIFT;
  252. do {
  253. node_kva_final = find_e820_area(node_kva_target,
  254. ((u64)node_end_pfn[nid])<<PAGE_SHIFT,
  255. ((u64)size)<<PAGE_SHIFT,
  256. LARGE_PAGE_BYTES);
  257. node_kva_target -= LARGE_PAGE_BYTES;
  258. } while (node_kva_final == -1ULL &&
  259. (node_kva_target>>PAGE_SHIFT) > (node_start_pfn[nid]));
  260. if (node_kva_final == -1ULL)
  261. panic("Can not get kva ram\n");
  262. node_remap_size[nid] = size;
  263. node_remap_offset[nid] = reserve_pages;
  264. reserve_pages += size;
  265. printk(KERN_DEBUG "Reserving %ld pages of KVA for lmem_map of"
  266. " node %d at %llx\n",
  267. size, nid, node_kva_final>>PAGE_SHIFT);
  268. /*
  269. * prevent kva address below max_low_pfn want it on system
  270. * with less memory later.
  271. * layout will be: KVA address , KVA RAM
  272. *
  273. * we are supposed to only record the one less then max_low_pfn
  274. * but we could have some hole in high memory, and it will only
  275. * check page_is_ram(pfn) && !page_is_reserved_early(pfn) to decide
  276. * to use it as free.
  277. * So reserve_early here, hope we don't run out of that array
  278. */
  279. reserve_early(node_kva_final,
  280. node_kva_final+(((u64)size)<<PAGE_SHIFT),
  281. "KVA RAM");
  282. node_remap_start_pfn[nid] = node_kva_final>>PAGE_SHIFT;
  283. remove_active_range(nid, node_remap_start_pfn[nid],
  284. node_remap_start_pfn[nid] + size);
  285. }
  286. printk(KERN_INFO "Reserving total of %lx pages for numa KVA remap\n",
  287. reserve_pages);
  288. return reserve_pages;
  289. }
  290. static void init_remap_allocator(int nid)
  291. {
  292. node_remap_start_vaddr[nid] = pfn_to_kaddr(
  293. kva_start_pfn + node_remap_offset[nid]);
  294. node_remap_end_vaddr[nid] = node_remap_start_vaddr[nid] +
  295. (node_remap_size[nid] * PAGE_SIZE);
  296. node_remap_alloc_vaddr[nid] = node_remap_start_vaddr[nid] +
  297. ALIGN(sizeof(pg_data_t), PAGE_SIZE);
  298. printk(KERN_DEBUG "node %d will remap to vaddr %08lx - %08lx\n", nid,
  299. (ulong) node_remap_start_vaddr[nid],
  300. (ulong) node_remap_end_vaddr[nid]);
  301. }
  302. void __init initmem_init(unsigned long start_pfn,
  303. unsigned long end_pfn)
  304. {
  305. int nid;
  306. long kva_target_pfn;
  307. /*
  308. * When mapping a NUMA machine we allocate the node_mem_map arrays
  309. * from node local memory. They are then mapped directly into KVA
  310. * between zone normal and vmalloc space. Calculate the size of
  311. * this space and use it to adjust the boundary between ZONE_NORMAL
  312. * and ZONE_HIGHMEM.
  313. */
  314. get_memcfg_numa();
  315. kva_pages = roundup(calculate_numa_remap_pages(), PTRS_PER_PTE);
  316. kva_target_pfn = round_down(max_low_pfn - kva_pages, PTRS_PER_PTE);
  317. do {
  318. kva_start_pfn = find_e820_area(kva_target_pfn<<PAGE_SHIFT,
  319. max_low_pfn<<PAGE_SHIFT,
  320. kva_pages<<PAGE_SHIFT,
  321. PTRS_PER_PTE<<PAGE_SHIFT) >> PAGE_SHIFT;
  322. kva_target_pfn -= PTRS_PER_PTE;
  323. } while (kva_start_pfn == -1UL && kva_target_pfn > min_low_pfn);
  324. if (kva_start_pfn == -1UL)
  325. panic("Can not get kva space\n");
  326. printk(KERN_INFO "kva_start_pfn ~ %lx max_low_pfn ~ %lx\n",
  327. kva_start_pfn, max_low_pfn);
  328. printk(KERN_INFO "max_pfn = %lx\n", max_pfn);
  329. /* avoid clash with initrd */
  330. reserve_early(kva_start_pfn<<PAGE_SHIFT,
  331. (kva_start_pfn + kva_pages)<<PAGE_SHIFT,
  332. "KVA PG");
  333. #ifdef CONFIG_HIGHMEM
  334. highstart_pfn = highend_pfn = max_pfn;
  335. if (max_pfn > max_low_pfn)
  336. highstart_pfn = max_low_pfn;
  337. printk(KERN_NOTICE "%ldMB HIGHMEM available.\n",
  338. pages_to_mb(highend_pfn - highstart_pfn));
  339. num_physpages = highend_pfn;
  340. high_memory = (void *) __va(highstart_pfn * PAGE_SIZE - 1) + 1;
  341. #else
  342. num_physpages = max_low_pfn;
  343. high_memory = (void *) __va(max_low_pfn * PAGE_SIZE - 1) + 1;
  344. #endif
  345. printk(KERN_NOTICE "%ldMB LOWMEM available.\n",
  346. pages_to_mb(max_low_pfn));
  347. printk(KERN_DEBUG "max_low_pfn = %lx, highstart_pfn = %lx\n",
  348. max_low_pfn, highstart_pfn);
  349. printk(KERN_DEBUG "Low memory ends at vaddr %08lx\n",
  350. (ulong) pfn_to_kaddr(max_low_pfn));
  351. for_each_online_node(nid) {
  352. init_remap_allocator(nid);
  353. allocate_pgdat(nid);
  354. }
  355. remap_numa_kva();
  356. printk(KERN_DEBUG "High memory starts at vaddr %08lx\n",
  357. (ulong) pfn_to_kaddr(highstart_pfn));
  358. for_each_online_node(nid)
  359. propagate_e820_map_node(nid);
  360. for_each_online_node(nid) {
  361. memset(NODE_DATA(nid), 0, sizeof(struct pglist_data));
  362. NODE_DATA(nid)->bdata = &bootmem_node_data[nid];
  363. }
  364. setup_bootmem_allocator();
  365. }
  366. #ifdef CONFIG_MEMORY_HOTPLUG
  367. static int paddr_to_nid(u64 addr)
  368. {
  369. int nid;
  370. unsigned long pfn = PFN_DOWN(addr);
  371. for_each_node(nid)
  372. if (node_start_pfn[nid] <= pfn &&
  373. pfn < node_end_pfn[nid])
  374. return nid;
  375. return -1;
  376. }
  377. /*
  378. * This function is used to ask node id BEFORE memmap and mem_section's
  379. * initialization (pfn_to_nid() can't be used yet).
  380. * If _PXM is not defined on ACPI's DSDT, node id must be found by this.
  381. */
  382. int memory_add_physaddr_to_nid(u64 addr)
  383. {
  384. int nid = paddr_to_nid(addr);
  385. return (nid >= 0) ? nid : 0;
  386. }
  387. EXPORT_SYMBOL_GPL(memory_add_physaddr_to_nid);
  388. #endif