numa.c 8.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329
  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 <acpi/acpi_bus.h>
  32. #define ACPI_NUMA 0x80000000
  33. #define _COMPONENT ACPI_NUMA
  34. ACPI_MODULE_NAME("numa");
  35. static nodemask_t nodes_found_map = NODE_MASK_NONE;
  36. /* maps to convert between proximity domain and logical node ID */
  37. static int pxm_to_node_map[MAX_PXM_DOMAINS]
  38. = { [0 ... MAX_PXM_DOMAINS - 1] = NID_INVAL };
  39. static int node_to_pxm_map[MAX_NUMNODES]
  40. = { [0 ... MAX_NUMNODES - 1] = PXM_INVAL };
  41. int pxm_to_node(int pxm)
  42. {
  43. if (pxm < 0)
  44. return NID_INVAL;
  45. return pxm_to_node_map[pxm];
  46. }
  47. int node_to_pxm(int node)
  48. {
  49. if (node < 0)
  50. return PXM_INVAL;
  51. return node_to_pxm_map[node];
  52. }
  53. void __acpi_map_pxm_to_node(int pxm, int node)
  54. {
  55. pxm_to_node_map[pxm] = node;
  56. node_to_pxm_map[node] = pxm;
  57. }
  58. int acpi_map_pxm_to_node(int pxm)
  59. {
  60. int node = pxm_to_node_map[pxm];
  61. if (node < 0){
  62. if (nodes_weight(nodes_found_map) >= MAX_NUMNODES)
  63. return NID_INVAL;
  64. node = first_unset_node(nodes_found_map);
  65. __acpi_map_pxm_to_node(pxm, node);
  66. node_set(node, nodes_found_map);
  67. }
  68. return node;
  69. }
  70. #if 0
  71. void __cpuinit acpi_unmap_pxm_to_node(int node)
  72. {
  73. int pxm = node_to_pxm_map[node];
  74. pxm_to_node_map[pxm] = NID_INVAL;
  75. node_to_pxm_map[node] = PXM_INVAL;
  76. node_clear(node, nodes_found_map);
  77. }
  78. #endif /* 0 */
  79. static void __init
  80. acpi_table_print_srat_entry(struct acpi_subtable_header *header)
  81. {
  82. ACPI_FUNCTION_NAME("acpi_table_print_srat_entry");
  83. if (!header)
  84. return;
  85. switch (header->type) {
  86. case ACPI_SRAT_TYPE_CPU_AFFINITY:
  87. #ifdef ACPI_DEBUG_OUTPUT
  88. {
  89. struct acpi_srat_cpu_affinity *p =
  90. (struct acpi_srat_cpu_affinity *)header;
  91. ACPI_DEBUG_PRINT((ACPI_DB_INFO,
  92. "SRAT Processor (id[0x%02x] eid[0x%02x]) in proximity domain %d %s\n",
  93. p->apic_id, p->local_sapic_eid,
  94. p->proximity_domain_lo,
  95. (p->flags & ACPI_SRAT_CPU_ENABLED)?
  96. "enabled" : "disabled"));
  97. }
  98. #endif /* ACPI_DEBUG_OUTPUT */
  99. break;
  100. case ACPI_SRAT_TYPE_MEMORY_AFFINITY:
  101. #ifdef ACPI_DEBUG_OUTPUT
  102. {
  103. struct acpi_srat_mem_affinity *p =
  104. (struct acpi_srat_mem_affinity *)header;
  105. ACPI_DEBUG_PRINT((ACPI_DB_INFO,
  106. "SRAT Memory (0x%lx length 0x%lx) in proximity domain %d %s%s\n",
  107. (unsigned long)p->base_address,
  108. (unsigned long)p->length,
  109. p->proximity_domain,
  110. (p->flags & ACPI_SRAT_MEM_ENABLED)?
  111. "enabled" : "disabled",
  112. (p->flags & ACPI_SRAT_MEM_HOT_PLUGGABLE)?
  113. " hot-pluggable" : ""));
  114. }
  115. #endif /* ACPI_DEBUG_OUTPUT */
  116. break;
  117. case ACPI_SRAT_TYPE_X2APIC_CPU_AFFINITY:
  118. #ifdef ACPI_DEBUG_OUTPUT
  119. {
  120. struct acpi_srat_x2apic_cpu_affinity *p =
  121. (struct acpi_srat_x2apic_cpu_affinity *)header;
  122. ACPI_DEBUG_PRINT((ACPI_DB_INFO,
  123. "SRAT Processor (x2apicid[0x%08x]) in"
  124. " proximity domain %d %s\n",
  125. p->apic_id,
  126. p->proximity_domain,
  127. (p->flags & ACPI_SRAT_CPU_ENABLED) ?
  128. "enabled" : "disabled"));
  129. }
  130. #endif /* ACPI_DEBUG_OUTPUT */
  131. break;
  132. default:
  133. printk(KERN_WARNING PREFIX
  134. "Found unsupported SRAT entry (type = 0x%x)\n",
  135. header->type);
  136. break;
  137. }
  138. }
  139. /*
  140. * A lot of BIOS fill in 10 (= no distance) everywhere. This messes
  141. * up the NUMA heuristics which wants the local node to have a smaller
  142. * distance than the others.
  143. * Do some quick checks here and only use the SLIT if it passes.
  144. */
  145. static __init int slit_valid(struct acpi_table_slit *slit)
  146. {
  147. int i, j;
  148. int d = slit->locality_count;
  149. for (i = 0; i < d; i++) {
  150. for (j = 0; j < d; j++) {
  151. u8 val = slit->entry[d*i + j];
  152. if (i == j) {
  153. if (val != LOCAL_DISTANCE)
  154. return 0;
  155. } else if (val <= LOCAL_DISTANCE)
  156. return 0;
  157. }
  158. }
  159. return 1;
  160. }
  161. static int __init acpi_parse_slit(struct acpi_table_header *table)
  162. {
  163. struct acpi_table_slit *slit;
  164. if (!table)
  165. return -EINVAL;
  166. slit = (struct acpi_table_slit *)table;
  167. if (!slit_valid(slit)) {
  168. printk(KERN_INFO "ACPI: SLIT table looks invalid. Not used.\n");
  169. return -EINVAL;
  170. }
  171. acpi_numa_slit_init(slit);
  172. return 0;
  173. }
  174. void __init __attribute__ ((weak))
  175. acpi_numa_x2apic_affinity_init(struct acpi_srat_x2apic_cpu_affinity *pa)
  176. {
  177. printk(KERN_WARNING PREFIX
  178. "Found unsupported x2apic [0x%08x] SRAT entry\n", pa->apic_id);
  179. return;
  180. }
  181. static int __init
  182. acpi_parse_x2apic_affinity(struct acpi_subtable_header *header,
  183. const unsigned long end)
  184. {
  185. struct acpi_srat_x2apic_cpu_affinity *processor_affinity;
  186. processor_affinity = (struct acpi_srat_x2apic_cpu_affinity *)header;
  187. if (!processor_affinity)
  188. return -EINVAL;
  189. acpi_table_print_srat_entry(header);
  190. /* let architecture-dependent part to do it */
  191. acpi_numa_x2apic_affinity_init(processor_affinity);
  192. return 0;
  193. }
  194. static int __init
  195. acpi_parse_processor_affinity(struct acpi_subtable_header *header,
  196. const unsigned long end)
  197. {
  198. struct acpi_srat_cpu_affinity *processor_affinity;
  199. processor_affinity = (struct acpi_srat_cpu_affinity *)header;
  200. if (!processor_affinity)
  201. return -EINVAL;
  202. acpi_table_print_srat_entry(header);
  203. /* let architecture-dependent part to do it */
  204. acpi_numa_processor_affinity_init(processor_affinity);
  205. return 0;
  206. }
  207. static int __init
  208. acpi_parse_memory_affinity(struct acpi_subtable_header * header,
  209. const unsigned long end)
  210. {
  211. struct acpi_srat_mem_affinity *memory_affinity;
  212. memory_affinity = (struct acpi_srat_mem_affinity *)header;
  213. if (!memory_affinity)
  214. return -EINVAL;
  215. acpi_table_print_srat_entry(header);
  216. /* let architecture-dependent part to do it */
  217. acpi_numa_memory_affinity_init(memory_affinity);
  218. return 0;
  219. }
  220. static int __init acpi_parse_srat(struct acpi_table_header *table)
  221. {
  222. struct acpi_table_srat *srat;
  223. if (!table)
  224. return -EINVAL;
  225. srat = (struct acpi_table_srat *)table;
  226. return 0;
  227. }
  228. static int __init
  229. acpi_table_parse_srat(enum acpi_srat_type id,
  230. acpi_table_entry_handler handler, unsigned int max_entries)
  231. {
  232. return acpi_table_parse_entries(ACPI_SIG_SRAT,
  233. sizeof(struct acpi_table_srat), id,
  234. handler, max_entries);
  235. }
  236. int __init acpi_numa_init(void)
  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, NR_CPUS);
  242. acpi_table_parse_srat(ACPI_SRAT_TYPE_CPU_AFFINITY,
  243. acpi_parse_processor_affinity, NR_CPUS);
  244. 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. return 0;
  252. }
  253. int acpi_get_pxm(acpi_handle h)
  254. {
  255. unsigned long long pxm;
  256. acpi_status status;
  257. acpi_handle handle;
  258. acpi_handle phandle = h;
  259. do {
  260. handle = phandle;
  261. status = acpi_evaluate_integer(handle, "_PXM", NULL, &pxm);
  262. if (ACPI_SUCCESS(status))
  263. return pxm;
  264. status = acpi_get_parent(handle, &phandle);
  265. } while (ACPI_SUCCESS(status));
  266. return -1;
  267. }
  268. int acpi_get_node(acpi_handle *handle)
  269. {
  270. int pxm, node = -1;
  271. pxm = acpi_get_pxm(handle);
  272. if (pxm >= 0 && pxm < MAX_PXM_DOMAINS)
  273. node = acpi_map_pxm_to_node(pxm);
  274. return node;
  275. }
  276. EXPORT_SYMBOL(acpi_get_node);