numa.c 8.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333
  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. #include <acpi/acpi_bus.h>
  33. #define PREFIX "ACPI: "
  34. #define ACPI_NUMA 0x80000000
  35. #define _COMPONENT ACPI_NUMA
  36. ACPI_MODULE_NAME("numa");
  37. static nodemask_t nodes_found_map = NODE_MASK_NONE;
  38. /* maps to convert between proximity domain and logical node ID */
  39. static int pxm_to_node_map[MAX_PXM_DOMAINS]
  40. = { [0 ... MAX_PXM_DOMAINS - 1] = NUMA_NO_NODE };
  41. static int node_to_pxm_map[MAX_NUMNODES]
  42. = { [0 ... MAX_NUMNODES - 1] = PXM_INVAL };
  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. 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 < 0) {
  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\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. }
  110. #endif /* ACPI_DEBUG_OUTPUT */
  111. break;
  112. case ACPI_SRAT_TYPE_X2APIC_CPU_AFFINITY:
  113. #ifdef ACPI_DEBUG_OUTPUT
  114. {
  115. struct acpi_srat_x2apic_cpu_affinity *p =
  116. (struct acpi_srat_x2apic_cpu_affinity *)header;
  117. ACPI_DEBUG_PRINT((ACPI_DB_INFO,
  118. "SRAT Processor (x2apicid[0x%08x]) in"
  119. " proximity domain %d %s\n",
  120. p->apic_id,
  121. p->proximity_domain,
  122. (p->flags & ACPI_SRAT_CPU_ENABLED) ?
  123. "enabled" : "disabled"));
  124. }
  125. #endif /* ACPI_DEBUG_OUTPUT */
  126. break;
  127. default:
  128. printk(KERN_WARNING PREFIX
  129. "Found unsupported SRAT entry (type = 0x%x)\n",
  130. header->type);
  131. break;
  132. }
  133. }
  134. /*
  135. * A lot of BIOS fill in 10 (= no distance) everywhere. This messes
  136. * up the NUMA heuristics which wants the local node to have a smaller
  137. * distance than the others.
  138. * Do some quick checks here and only use the SLIT if it passes.
  139. */
  140. static __init int slit_valid(struct acpi_table_slit *slit)
  141. {
  142. int i, j;
  143. int d = slit->locality_count;
  144. for (i = 0; i < d; i++) {
  145. for (j = 0; j < d; j++) {
  146. u8 val = slit->entry[d*i + j];
  147. if (i == j) {
  148. if (val != LOCAL_DISTANCE)
  149. return 0;
  150. } else if (val <= LOCAL_DISTANCE)
  151. return 0;
  152. }
  153. }
  154. return 1;
  155. }
  156. static int __init acpi_parse_slit(struct acpi_table_header *table)
  157. {
  158. struct acpi_table_slit *slit;
  159. if (!table)
  160. return -EINVAL;
  161. slit = (struct acpi_table_slit *)table;
  162. if (!slit_valid(slit)) {
  163. printk(KERN_INFO "ACPI: SLIT table looks invalid. Not used.\n");
  164. return -EINVAL;
  165. }
  166. acpi_numa_slit_init(slit);
  167. return 0;
  168. }
  169. void __init __attribute__ ((weak))
  170. acpi_numa_x2apic_affinity_init(struct acpi_srat_x2apic_cpu_affinity *pa)
  171. {
  172. printk(KERN_WARNING PREFIX
  173. "Found unsupported x2apic [0x%08x] SRAT entry\n", pa->apic_id);
  174. return;
  175. }
  176. static int __init
  177. acpi_parse_x2apic_affinity(struct acpi_subtable_header *header,
  178. const unsigned long end)
  179. {
  180. struct acpi_srat_x2apic_cpu_affinity *processor_affinity;
  181. processor_affinity = (struct acpi_srat_x2apic_cpu_affinity *)header;
  182. if (!processor_affinity)
  183. return -EINVAL;
  184. acpi_table_print_srat_entry(header);
  185. /* let architecture-dependent part to do it */
  186. acpi_numa_x2apic_affinity_init(processor_affinity);
  187. return 0;
  188. }
  189. static int __init
  190. acpi_parse_processor_affinity(struct acpi_subtable_header *header,
  191. const unsigned long end)
  192. {
  193. struct acpi_srat_cpu_affinity *processor_affinity;
  194. processor_affinity = (struct acpi_srat_cpu_affinity *)header;
  195. if (!processor_affinity)
  196. return -EINVAL;
  197. acpi_table_print_srat_entry(header);
  198. /* let architecture-dependent part to do it */
  199. acpi_numa_processor_affinity_init(processor_affinity);
  200. return 0;
  201. }
  202. static int __init
  203. acpi_parse_memory_affinity(struct acpi_subtable_header * header,
  204. const unsigned long end)
  205. {
  206. struct acpi_srat_mem_affinity *memory_affinity;
  207. memory_affinity = (struct acpi_srat_mem_affinity *)header;
  208. if (!memory_affinity)
  209. return -EINVAL;
  210. acpi_table_print_srat_entry(header);
  211. /* let architecture-dependent part to do it */
  212. acpi_numa_memory_affinity_init(memory_affinity);
  213. return 0;
  214. }
  215. static int __init acpi_parse_srat(struct acpi_table_header *table)
  216. {
  217. if (!table)
  218. return -EINVAL;
  219. /* Real work done in acpi_table_parse_srat below. */
  220. return 0;
  221. }
  222. static int __init
  223. acpi_table_parse_srat(enum acpi_srat_type id,
  224. acpi_table_entry_handler handler, unsigned int max_entries)
  225. {
  226. return acpi_table_parse_entries(ACPI_SIG_SRAT,
  227. sizeof(struct acpi_table_srat), id,
  228. handler, max_entries);
  229. }
  230. int __init acpi_numa_init(void)
  231. {
  232. int cnt = 0;
  233. /*
  234. * Should not limit number with cpu num that is from NR_CPUS or nr_cpus=
  235. * SRAT cpu entries could have different order with that in MADT.
  236. * So go over all cpu entries in SRAT to get apicid to node mapping.
  237. */
  238. /* SRAT: Static Resource Affinity Table */
  239. if (!acpi_table_parse(ACPI_SIG_SRAT, acpi_parse_srat)) {
  240. acpi_table_parse_srat(ACPI_SRAT_TYPE_X2APIC_CPU_AFFINITY,
  241. acpi_parse_x2apic_affinity, 0);
  242. acpi_table_parse_srat(ACPI_SRAT_TYPE_CPU_AFFINITY,
  243. acpi_parse_processor_affinity, 0);
  244. cnt = acpi_table_parse_srat(ACPI_SRAT_TYPE_MEMORY_AFFINITY,
  245. acpi_parse_memory_affinity,
  246. NR_NODE_MEMBLKS);
  247. }
  248. /* SLIT: System Locality Information Table */
  249. acpi_table_parse(ACPI_SIG_SLIT, acpi_parse_slit);
  250. acpi_numa_arch_fixup();
  251. if (cnt <= 0)
  252. return cnt ?: -ENOENT;
  253. return 0;
  254. }
  255. int acpi_get_pxm(acpi_handle h)
  256. {
  257. unsigned long long pxm;
  258. acpi_status status;
  259. acpi_handle handle;
  260. acpi_handle phandle = h;
  261. do {
  262. handle = phandle;
  263. status = acpi_evaluate_integer(handle, "_PXM", NULL, &pxm);
  264. if (ACPI_SUCCESS(status))
  265. return pxm;
  266. status = acpi_get_parent(handle, &phandle);
  267. } while (ACPI_SUCCESS(status));
  268. return -1;
  269. }
  270. int acpi_get_node(acpi_handle *handle)
  271. {
  272. int pxm, node = -1;
  273. pxm = acpi_get_pxm(handle);
  274. if (pxm >= 0 && pxm < MAX_PXM_DOMAINS)
  275. node = acpi_map_pxm_to_node(pxm);
  276. return node;
  277. }
  278. EXPORT_SYMBOL(acpi_get_node);