srat_32.c 8.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286
  1. /*
  2. * Some of the code in this file has been gleaned from the 64 bit
  3. * discontigmem support code base.
  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. * Send feedback to Pat Gaughen <gone@us.ibm.com>
  25. */
  26. #include <linux/mm.h>
  27. #include <linux/bootmem.h>
  28. #include <linux/memblock.h>
  29. #include <linux/mmzone.h>
  30. #include <linux/acpi.h>
  31. #include <linux/nodemask.h>
  32. #include <asm/srat.h>
  33. #include <asm/topology.h>
  34. #include <asm/smp.h>
  35. #include <asm/e820.h>
  36. /*
  37. * proximity macros and definitions
  38. */
  39. #define NODE_ARRAY_INDEX(x) ((x) / 8) /* 8 bits/char */
  40. #define NODE_ARRAY_OFFSET(x) ((x) % 8) /* 8 bits/char */
  41. #define BMAP_SET(bmap, bit) ((bmap)[NODE_ARRAY_INDEX(bit)] |= 1 << NODE_ARRAY_OFFSET(bit))
  42. #define BMAP_TEST(bmap, bit) ((bmap)[NODE_ARRAY_INDEX(bit)] & (1 << NODE_ARRAY_OFFSET(bit)))
  43. /* bitmap length; _PXM is at most 255 */
  44. #define PXM_BITMAP_LEN (MAX_PXM_DOMAINS / 8)
  45. static u8 __initdata pxm_bitmap[PXM_BITMAP_LEN]; /* bitmap of proximity domains */
  46. #define MAX_CHUNKS_PER_NODE 3
  47. #define MAXCHUNKS (MAX_CHUNKS_PER_NODE * MAX_NUMNODES)
  48. struct node_memory_chunk_s {
  49. unsigned long start_pfn;
  50. unsigned long end_pfn;
  51. u8 pxm; // proximity domain of node
  52. u8 nid; // which cnode contains this chunk?
  53. u8 bank; // which mem bank on this node
  54. };
  55. static struct node_memory_chunk_s __initdata node_memory_chunk[MAXCHUNKS];
  56. static int __initdata num_memory_chunks; /* total number of memory chunks */
  57. static u8 __initdata apicid_to_pxm[MAX_LOCAL_APIC];
  58. int acpi_numa __initdata;
  59. static __init void bad_srat(void)
  60. {
  61. printk(KERN_ERR "SRAT: SRAT not used.\n");
  62. acpi_numa = -1;
  63. num_memory_chunks = 0;
  64. }
  65. static __init inline int srat_disabled(void)
  66. {
  67. return numa_off || acpi_numa < 0;
  68. }
  69. /* Identify CPU proximity domains */
  70. void __init
  71. acpi_numa_processor_affinity_init(struct acpi_srat_cpu_affinity *cpu_affinity)
  72. {
  73. if (srat_disabled())
  74. return;
  75. if (cpu_affinity->header.length !=
  76. sizeof(struct acpi_srat_cpu_affinity)) {
  77. bad_srat();
  78. return;
  79. }
  80. if ((cpu_affinity->flags & ACPI_SRAT_CPU_ENABLED) == 0)
  81. return; /* empty entry */
  82. /* mark this node as "seen" in node bitmap */
  83. BMAP_SET(pxm_bitmap, cpu_affinity->proximity_domain_lo);
  84. /* don't need to check apic_id here, because it is always 8 bits */
  85. apicid_to_pxm[cpu_affinity->apic_id] = cpu_affinity->proximity_domain_lo;
  86. printk(KERN_DEBUG "CPU %02x in proximity domain %02x\n",
  87. cpu_affinity->apic_id, cpu_affinity->proximity_domain_lo);
  88. }
  89. /*
  90. * Identify memory proximity domains and hot-remove capabilities.
  91. * Fill node memory chunk list structure.
  92. */
  93. void __init
  94. acpi_numa_memory_affinity_init(struct acpi_srat_mem_affinity *memory_affinity)
  95. {
  96. unsigned long long paddr, size;
  97. unsigned long start_pfn, end_pfn;
  98. u8 pxm;
  99. struct node_memory_chunk_s *p, *q, *pend;
  100. if (srat_disabled())
  101. return;
  102. if (memory_affinity->header.length !=
  103. sizeof(struct acpi_srat_mem_affinity)) {
  104. bad_srat();
  105. return;
  106. }
  107. if ((memory_affinity->flags & ACPI_SRAT_MEM_ENABLED) == 0)
  108. return; /* empty entry */
  109. pxm = memory_affinity->proximity_domain & 0xff;
  110. /* mark this node as "seen" in node bitmap */
  111. BMAP_SET(pxm_bitmap, pxm);
  112. /* calculate info for memory chunk structure */
  113. paddr = memory_affinity->base_address;
  114. size = memory_affinity->length;
  115. start_pfn = paddr >> PAGE_SHIFT;
  116. end_pfn = (paddr + size) >> PAGE_SHIFT;
  117. if (num_memory_chunks >= MAXCHUNKS) {
  118. printk(KERN_WARNING "Too many mem chunks in SRAT."
  119. " Ignoring %lld MBytes at %llx\n",
  120. size/(1024*1024), paddr);
  121. return;
  122. }
  123. /* Insertion sort based on base address */
  124. pend = &node_memory_chunk[num_memory_chunks];
  125. for (p = &node_memory_chunk[0]; p < pend; p++) {
  126. if (start_pfn < p->start_pfn)
  127. break;
  128. }
  129. if (p < pend) {
  130. for (q = pend; q >= p; q--)
  131. *(q + 1) = *q;
  132. }
  133. p->start_pfn = start_pfn;
  134. p->end_pfn = end_pfn;
  135. p->pxm = pxm;
  136. num_memory_chunks++;
  137. printk(KERN_DEBUG "Memory range %08lx to %08lx"
  138. " in proximity domain %02x %s\n",
  139. start_pfn, end_pfn,
  140. pxm,
  141. ((memory_affinity->flags & ACPI_SRAT_MEM_HOT_PLUGGABLE) ?
  142. "enabled and removable" : "enabled" ) );
  143. }
  144. /* Callback for SLIT parsing */
  145. void __init acpi_numa_slit_init(struct acpi_table_slit *slit)
  146. {
  147. }
  148. void acpi_numa_arch_fixup(void)
  149. {
  150. }
  151. /*
  152. * The SRAT table always lists ascending addresses, so can always
  153. * assume that the first "start" address that you see is the real
  154. * start of the node, and that the current "end" address is after
  155. * the previous one.
  156. */
  157. static __init int node_read_chunk(int nid, struct node_memory_chunk_s *memory_chunk)
  158. {
  159. /*
  160. * Only add present memory as told by the e820.
  161. * There is no guarantee from the SRAT that the memory it
  162. * enumerates is present at boot time because it represents
  163. * *possible* memory hotplug areas the same as normal RAM.
  164. */
  165. if (memory_chunk->start_pfn >= max_pfn) {
  166. printk(KERN_INFO "Ignoring SRAT pfns: %08lx - %08lx\n",
  167. memory_chunk->start_pfn, memory_chunk->end_pfn);
  168. return -1;
  169. }
  170. if (memory_chunk->nid != nid)
  171. return -1;
  172. if (!node_has_online_mem(nid))
  173. node_start_pfn[nid] = memory_chunk->start_pfn;
  174. if (node_start_pfn[nid] > memory_chunk->start_pfn)
  175. node_start_pfn[nid] = memory_chunk->start_pfn;
  176. if (node_end_pfn[nid] < memory_chunk->end_pfn)
  177. node_end_pfn[nid] = memory_chunk->end_pfn;
  178. return 0;
  179. }
  180. int __init get_memcfg_from_srat(void)
  181. {
  182. int i, j, nid;
  183. if (srat_disabled())
  184. goto out_fail;
  185. if (num_memory_chunks == 0) {
  186. printk(KERN_DEBUG
  187. "could not find any ACPI SRAT memory areas.\n");
  188. goto out_fail;
  189. }
  190. /* Calculate total number of nodes in system from PXM bitmap and create
  191. * a set of sequential node IDs starting at zero. (ACPI doesn't seem
  192. * to specify the range of _PXM values.)
  193. */
  194. /*
  195. * MCD - we no longer HAVE to number nodes sequentially. PXM domain
  196. * numbers could go as high as 256, and MAX_NUMNODES for i386 is typically
  197. * 32, so we will continue numbering them in this manner until MAX_NUMNODES
  198. * approaches MAX_PXM_DOMAINS for i386.
  199. */
  200. nodes_clear(node_online_map);
  201. for (i = 0; i < MAX_PXM_DOMAINS; i++) {
  202. if (BMAP_TEST(pxm_bitmap, i)) {
  203. int nid = acpi_map_pxm_to_node(i);
  204. node_set_online(nid);
  205. }
  206. }
  207. BUG_ON(num_online_nodes() == 0);
  208. /* set cnode id in memory chunk structure */
  209. for (i = 0; i < num_memory_chunks; i++)
  210. node_memory_chunk[i].nid = pxm_to_node(node_memory_chunk[i].pxm);
  211. printk(KERN_DEBUG "pxm bitmap: ");
  212. for (i = 0; i < sizeof(pxm_bitmap); i++) {
  213. printk(KERN_CONT "%02x ", pxm_bitmap[i]);
  214. }
  215. printk(KERN_CONT "\n");
  216. printk(KERN_DEBUG "Number of logical nodes in system = %d\n",
  217. num_online_nodes());
  218. printk(KERN_DEBUG "Number of memory chunks in system = %d\n",
  219. num_memory_chunks);
  220. for (i = 0; i < MAX_LOCAL_APIC; i++)
  221. set_apicid_to_node(i, pxm_to_node(apicid_to_pxm[i]));
  222. for (j = 0; j < num_memory_chunks; j++){
  223. struct node_memory_chunk_s * chunk = &node_memory_chunk[j];
  224. printk(KERN_DEBUG
  225. "chunk %d nid %d start_pfn %08lx end_pfn %08lx\n",
  226. j, chunk->nid, chunk->start_pfn, chunk->end_pfn);
  227. if (node_read_chunk(chunk->nid, chunk))
  228. continue;
  229. memblock_x86_register_active_regions(chunk->nid, chunk->start_pfn,
  230. min(chunk->end_pfn, max_pfn));
  231. }
  232. /* for out of order entries in SRAT */
  233. sort_node_map();
  234. for_each_online_node(nid) {
  235. unsigned long start = node_start_pfn[nid];
  236. unsigned long end = min(node_end_pfn[nid], max_pfn);
  237. memory_present(nid, start, end);
  238. node_remap_size[nid] = node_memmap_size_bytes(nid, start, end);
  239. }
  240. return 1;
  241. out_fail:
  242. printk(KERN_DEBUG "failed to get NUMA memory information from SRAT"
  243. " table\n");
  244. return 0;
  245. }