numa.c 8.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344
  1. /*
  2. * acpi_numa.c - ACPI NUMA support
  3. *
  4. * Copyright (C) 2002 Takayoshi Kochi <t-kochi@bq.jp.nec.com>
  5. *
  6. * ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  7. *
  8. * This program is free software; you can redistribute it and/or modify
  9. * it under the terms of the GNU General Public License as published by
  10. * the Free Software Foundation; either version 2 of the License, or
  11. * (at your option) any later version.
  12. *
  13. * This program is distributed in the hope that it will be useful,
  14. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  15. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  16. * GNU General Public License for more details.
  17. *
  18. * You should have received a copy of the GNU General Public License
  19. * along with this program; if not, write to the Free Software
  20. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  21. *
  22. * ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  23. *
  24. */
  25. #include <linux/module.h>
  26. #include <linux/init.h>
  27. #include <linux/kernel.h>
  28. #include <linux/types.h>
  29. #include <linux/errno.h>
  30. #include <linux/acpi.h>
  31. #include <linux/numa.h>
  32. #define PREFIX "ACPI: "
  33. #define ACPI_NUMA 0x80000000
  34. #define _COMPONENT ACPI_NUMA
  35. ACPI_MODULE_NAME("numa");
  36. static nodemask_t nodes_found_map = NODE_MASK_NONE;
  37. /* maps to convert between proximity domain and logical node ID */
  38. static int pxm_to_node_map[MAX_PXM_DOMAINS]
  39. = { [0 ... MAX_PXM_DOMAINS - 1] = NUMA_NO_NODE };
  40. static int node_to_pxm_map[MAX_NUMNODES]
  41. = { [0 ... MAX_NUMNODES - 1] = PXM_INVAL };
  42. unsigned char acpi_srat_revision __initdata;
  43. int pxm_to_node(int pxm)
  44. {
  45. if (pxm < 0)
  46. return NUMA_NO_NODE;
  47. return pxm_to_node_map[pxm];
  48. }
  49. int node_to_pxm(int node)
  50. {
  51. if (node < 0)
  52. return PXM_INVAL;
  53. return node_to_pxm_map[node];
  54. }
  55. static void __acpi_map_pxm_to_node(int pxm, int node)
  56. {
  57. if (pxm_to_node_map[pxm] == NUMA_NO_NODE || node < pxm_to_node_map[pxm])
  58. pxm_to_node_map[pxm] = node;
  59. if (node_to_pxm_map[node] == PXM_INVAL || pxm < node_to_pxm_map[node])
  60. node_to_pxm_map[node] = pxm;
  61. }
  62. int acpi_map_pxm_to_node(int pxm)
  63. {
  64. int node = pxm_to_node_map[pxm];
  65. if (node == NUMA_NO_NODE) {
  66. if (nodes_weight(nodes_found_map) >= MAX_NUMNODES)
  67. return NUMA_NO_NODE;
  68. node = first_unset_node(nodes_found_map);
  69. __acpi_map_pxm_to_node(pxm, node);
  70. node_set(node, nodes_found_map);
  71. }
  72. return node;
  73. }
  74. static void __init
  75. acpi_table_print_srat_entry(struct acpi_subtable_header *header)
  76. {
  77. ACPI_FUNCTION_NAME("acpi_table_print_srat_entry");
  78. if (!header)
  79. return;
  80. switch (header->type) {
  81. case ACPI_SRAT_TYPE_CPU_AFFINITY:
  82. #ifdef ACPI_DEBUG_OUTPUT
  83. {
  84. struct acpi_srat_cpu_affinity *p =
  85. (struct acpi_srat_cpu_affinity *)header;
  86. ACPI_DEBUG_PRINT((ACPI_DB_INFO,
  87. "SRAT Processor (id[0x%02x] eid[0x%02x]) in proximity domain %d %s\n",
  88. p->apic_id, p->local_sapic_eid,
  89. p->proximity_domain_lo,
  90. (p->flags & ACPI_SRAT_CPU_ENABLED)?
  91. "enabled" : "disabled"));
  92. }
  93. #endif /* ACPI_DEBUG_OUTPUT */
  94. break;
  95. case ACPI_SRAT_TYPE_MEMORY_AFFINITY:
  96. #ifdef ACPI_DEBUG_OUTPUT
  97. {
  98. struct acpi_srat_mem_affinity *p =
  99. (struct acpi_srat_mem_affinity *)header;
  100. ACPI_DEBUG_PRINT((ACPI_DB_INFO,
  101. "SRAT Memory (0x%lx length 0x%lx) in proximity domain %d %s%s%s\n",
  102. (unsigned long)p->base_address,
  103. (unsigned long)p->length,
  104. p->proximity_domain,
  105. (p->flags & ACPI_SRAT_MEM_ENABLED)?
  106. "enabled" : "disabled",
  107. (p->flags & ACPI_SRAT_MEM_HOT_PLUGGABLE)?
  108. " hot-pluggable" : "",
  109. (p->flags & ACPI_SRAT_MEM_NON_VOLATILE)?
  110. " non-volatile" : ""));
  111. }
  112. #endif /* ACPI_DEBUG_OUTPUT */
  113. break;
  114. case ACPI_SRAT_TYPE_X2APIC_CPU_AFFINITY:
  115. #ifdef ACPI_DEBUG_OUTPUT
  116. {
  117. struct acpi_srat_x2apic_cpu_affinity *p =
  118. (struct acpi_srat_x2apic_cpu_affinity *)header;
  119. ACPI_DEBUG_PRINT((ACPI_DB_INFO,
  120. "SRAT Processor (x2apicid[0x%08x]) in"
  121. " proximity domain %d %s\n",
  122. p->apic_id,
  123. p->proximity_domain,
  124. (p->flags & ACPI_SRAT_CPU_ENABLED) ?
  125. "enabled" : "disabled"));
  126. }
  127. #endif /* ACPI_DEBUG_OUTPUT */
  128. break;
  129. default:
  130. printk(KERN_WARNING PREFIX
  131. "Found unsupported SRAT entry (type = 0x%x)\n",
  132. header->type);
  133. break;
  134. }
  135. }
  136. /*
  137. * A lot of BIOS fill in 10 (= no distance) everywhere. This messes
  138. * up the NUMA heuristics which wants the local node to have a smaller
  139. * distance than the others.
  140. * Do some quick checks here and only use the SLIT if it passes.
  141. */
  142. static int __init slit_valid(struct acpi_table_slit *slit)
  143. {
  144. int i, j;
  145. int d = slit->locality_count;
  146. for (i = 0; i < d; i++) {
  147. for (j = 0; j < d; j++) {
  148. u8 val = slit->entry[d*i + j];
  149. if (i == j) {
  150. if (val != LOCAL_DISTANCE)
  151. return 0;
  152. } else if (val <= LOCAL_DISTANCE)
  153. return 0;
  154. }
  155. }
  156. return 1;
  157. }
  158. static int __init acpi_parse_slit(struct acpi_table_header *table)
  159. {
  160. struct acpi_table_slit *slit;
  161. if (!table)
  162. return -EINVAL;
  163. slit = (struct acpi_table_slit *)table;
  164. if (!slit_valid(slit)) {
  165. printk(KERN_INFO "ACPI: SLIT table looks invalid. Not used.\n");
  166. return -EINVAL;
  167. }
  168. acpi_numa_slit_init(slit);
  169. return 0;
  170. }
  171. void __init __weak
  172. acpi_numa_x2apic_affinity_init(struct acpi_srat_x2apic_cpu_affinity *pa)
  173. {
  174. printk(KERN_WARNING PREFIX
  175. "Found unsupported x2apic [0x%08x] SRAT entry\n", pa->apic_id);
  176. return;
  177. }
  178. static int __init
  179. acpi_parse_x2apic_affinity(struct acpi_subtable_header *header,
  180. const unsigned long end)
  181. {
  182. struct acpi_srat_x2apic_cpu_affinity *processor_affinity;
  183. processor_affinity = (struct acpi_srat_x2apic_cpu_affinity *)header;
  184. if (!processor_affinity)
  185. return -EINVAL;
  186. acpi_table_print_srat_entry(header);
  187. /* let architecture-dependent part to do it */
  188. acpi_numa_x2apic_affinity_init(processor_affinity);
  189. return 0;
  190. }
  191. static int __init
  192. acpi_parse_processor_affinity(struct acpi_subtable_header *header,
  193. const unsigned long end)
  194. {
  195. struct acpi_srat_cpu_affinity *processor_affinity;
  196. processor_affinity = (struct acpi_srat_cpu_affinity *)header;
  197. if (!processor_affinity)
  198. return -EINVAL;
  199. acpi_table_print_srat_entry(header);
  200. /* let architecture-dependent part to do it */
  201. acpi_numa_processor_affinity_init(processor_affinity);
  202. return 0;
  203. }
  204. static int __initdata parsed_numa_memblks;
  205. static int __init
  206. acpi_parse_memory_affinity(struct acpi_subtable_header * header,
  207. const unsigned long end)
  208. {
  209. struct acpi_srat_mem_affinity *memory_affinity;
  210. memory_affinity = (struct acpi_srat_mem_affinity *)header;
  211. if (!memory_affinity)
  212. return -EINVAL;
  213. acpi_table_print_srat_entry(header);
  214. /* let architecture-dependent part to do it */
  215. if (!acpi_numa_memory_affinity_init(memory_affinity))
  216. parsed_numa_memblks++;
  217. return 0;
  218. }
  219. static int __init acpi_parse_srat(struct acpi_table_header *table)
  220. {
  221. struct acpi_table_srat *srat;
  222. if (!table)
  223. return -EINVAL;
  224. srat = (struct acpi_table_srat *)table;
  225. acpi_srat_revision = srat->header.revision;
  226. /* Real work done in acpi_table_parse_srat below. */
  227. return 0;
  228. }
  229. static int __init
  230. acpi_table_parse_srat(enum acpi_srat_type id,
  231. acpi_tbl_entry_handler handler, unsigned int max_entries)
  232. {
  233. return acpi_table_parse_entries(ACPI_SIG_SRAT,
  234. sizeof(struct acpi_table_srat), id,
  235. handler, max_entries);
  236. }
  237. int __init acpi_numa_init(void)
  238. {
  239. int cnt = 0;
  240. /*
  241. * Should not limit number with cpu num that is from NR_CPUS or nr_cpus=
  242. * SRAT cpu entries could have different order with that in MADT.
  243. * So go over all cpu entries in SRAT to get apicid to node mapping.
  244. */
  245. /* SRAT: Static Resource Affinity Table */
  246. if (!acpi_table_parse(ACPI_SIG_SRAT, acpi_parse_srat)) {
  247. acpi_table_parse_srat(ACPI_SRAT_TYPE_X2APIC_CPU_AFFINITY,
  248. acpi_parse_x2apic_affinity, 0);
  249. acpi_table_parse_srat(ACPI_SRAT_TYPE_CPU_AFFINITY,
  250. acpi_parse_processor_affinity, 0);
  251. cnt = acpi_table_parse_srat(ACPI_SRAT_TYPE_MEMORY_AFFINITY,
  252. acpi_parse_memory_affinity,
  253. NR_NODE_MEMBLKS);
  254. }
  255. /* SLIT: System Locality Information Table */
  256. acpi_table_parse(ACPI_SIG_SLIT, acpi_parse_slit);
  257. acpi_numa_arch_fixup();
  258. if (cnt < 0)
  259. return cnt;
  260. else if (!parsed_numa_memblks)
  261. return -ENOENT;
  262. return 0;
  263. }
  264. static int acpi_get_pxm(acpi_handle h)
  265. {
  266. unsigned long long pxm;
  267. acpi_status status;
  268. acpi_handle handle;
  269. acpi_handle phandle = h;
  270. do {
  271. handle = phandle;
  272. status = acpi_evaluate_integer(handle, "_PXM", NULL, &pxm);
  273. if (ACPI_SUCCESS(status))
  274. return pxm;
  275. status = acpi_get_parent(handle, &phandle);
  276. } while (ACPI_SUCCESS(status));
  277. return -1;
  278. }
  279. int acpi_get_node(acpi_handle handle)
  280. {
  281. int pxm;
  282. pxm = acpi_get_pxm(handle);
  283. if (pxm < 0 || pxm >= MAX_PXM_DOMAINS)
  284. return NUMA_NO_NODE;
  285. return acpi_map_pxm_to_node(pxm);
  286. }
  287. EXPORT_SYMBOL(acpi_get_node);