blob: b9e2dbfe55c36feda159e6c97c102d546d38328c [file] [log] [blame]
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +01001/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07002 * AMD K8 NUMA support.
3 * Discover the memory map and associated nodes.
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +01004 *
Linus Torvalds1da177e2005-04-16 15:20:36 -07005 * This version reads it directly from the K8 northbridge.
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +01006 *
Linus Torvalds1da177e2005-04-16 15:20:36 -07007 * Copyright 2002,2003 Andi Kleen, SuSE Labs.
8 */
9#include <linux/kernel.h>
10#include <linux/init.h>
11#include <linux/string.h>
12#include <linux/module.h>
13#include <linux/nodemask.h>
14#include <asm/io.h>
15#include <linux/pci_ids.h>
Yinghai Lucbf9bd62008-02-19 03:21:06 -080016#include <linux/acpi.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070017#include <asm/types.h>
18#include <asm/mmzone.h>
19#include <asm/proto.h>
20#include <asm/e820.h>
21#include <asm/pci-direct.h>
22#include <asm/numa.h>
Yinghai Lucbf9bd62008-02-19 03:21:06 -080023#include <asm/mpspec.h>
24#include <asm/apic.h>
Thomas Gleixner0eafe232008-05-12 15:43:35 +020025#include <asm/k8.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070026
David Rientjes8ee2deb2009-09-25 15:20:00 -070027static struct bootnode __initdata nodes[8];
28static nodemask_t __initdata nodes_parsed = NODE_MASK_NONE;
29
Linus Torvalds1da177e2005-04-16 15:20:36 -070030static __init int find_northbridge(void)
31{
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +010032 int num;
Linus Torvalds1da177e2005-04-16 15:20:36 -070033
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +010034 for (num = 0; num < 32; num++) {
Linus Torvalds1da177e2005-04-16 15:20:36 -070035 u32 header;
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +010036
37 header = read_pci_config(0, num, 0, 0x00);
Joachim Deguarabb4a1d62008-01-30 13:34:12 +010038 if (header != (PCI_VENDOR_ID_AMD | (0x1100<<16)) &&
39 header != (PCI_VENDOR_ID_AMD | (0x1200<<16)) &&
40 header != (PCI_VENDOR_ID_AMD | (0x1300<<16)))
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +010041 continue;
Linus Torvalds1da177e2005-04-16 15:20:36 -070042
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +010043 header = read_pci_config(0, num, 1, 0x00);
Joachim Deguarabb4a1d62008-01-30 13:34:12 +010044 if (header != (PCI_VENDOR_ID_AMD | (0x1101<<16)) &&
45 header != (PCI_VENDOR_ID_AMD | (0x1201<<16)) &&
46 header != (PCI_VENDOR_ID_AMD | (0x1301<<16)))
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +010047 continue;
48 return num;
49 }
Linus Torvalds1da177e2005-04-16 15:20:36 -070050
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +010051 return -1;
Linus Torvalds1da177e2005-04-16 15:20:36 -070052}
53
Yinghai Lucbf9bd62008-02-19 03:21:06 -080054static __init void early_get_boot_cpu_id(void)
55{
56 /*
57 * need to get boot_cpu_id so can use that to create apicid_to_node
58 * in k8_scan_nodes()
59 */
60 /*
61 * Find possible boot-time SMP configuration:
62 */
Yinghai Lua4caa182008-06-19 12:15:01 -070063#ifdef CONFIG_X86_MPPARSE
Yinghai Lucbf9bd62008-02-19 03:21:06 -080064 early_find_smp_config();
Yinghai Lua4caa182008-06-19 12:15:01 -070065#endif
Yinghai Lucbf9bd62008-02-19 03:21:06 -080066#ifdef CONFIG_ACPI
67 /*
68 * Read APIC information from ACPI tables.
69 */
70 early_acpi_boot_init();
71#endif
Yinghai Lua4caa182008-06-19 12:15:01 -070072#ifdef CONFIG_X86_MPPARSE
Yinghai Lucbf9bd62008-02-19 03:21:06 -080073 /*
74 * get boot-time SMP configuration:
75 */
76 if (smp_found_config)
77 early_get_smp_config();
Yinghai Lua4caa182008-06-19 12:15:01 -070078#endif
Yinghai Lucbf9bd62008-02-19 03:21:06 -080079 early_init_lapic_mapping();
80}
81
David Rientjes8ee2deb2009-09-25 15:20:00 -070082int __init k8_get_nodes(struct bootnode *physnodes)
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +010083{
David Rientjes8ee2deb2009-09-25 15:20:00 -070084 int i;
85 int ret = 0;
86
87 for_each_node_mask(i, nodes_parsed) {
88 physnodes[ret].start = nodes[i].start;
89 physnodes[ret].end = nodes[i].end;
90 ret++;
91 }
92 return ret;
93}
94
95int __init k8_numa_init(unsigned long start_pfn, unsigned long end_pfn)
96{
97 unsigned long start = PFN_PHYS(start_pfn);
98 unsigned long end = PFN_PHYS(end_pfn);
99 unsigned numnodes;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700100 unsigned long prevbase;
David Rientjes8ee2deb2009-09-25 15:20:00 -0700101 int i, nb, found = 0;
Thomas Gleixnerd34c0892008-05-12 15:43:35 +0200102 u32 nodeid, reg;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700103
Andi Kleen0637a702006-09-26 10:52:41 +0200104 if (!early_pci_allowed())
105 return -1;
106
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +0100107 nb = find_northbridge();
108 if (nb < 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700109 return nb;
110
David Rientjes1af5ba52009-09-25 15:19:47 -0700111 pr_info("Scanning NUMA topology in Northbridge %d\n", nb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700112
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +0100113 reg = read_pci_config(0, nb, 0, 0x60);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700114 numnodes = ((reg >> 4) & 0xF) + 1;
Andi Kleen3bea9c92007-05-02 19:27:21 +0200115 if (numnodes <= 1)
116 return -1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700117
David Rientjes8ee2deb2009-09-25 15:20:00 -0700118 pr_info("Number of physical nodes %d\n", numnodes);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700119
Linus Torvalds1da177e2005-04-16 15:20:36 -0700120 prevbase = 0;
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +0100121 for (i = 0; i < 8; i++) {
122 unsigned long base, limit;
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +0100123
Linus Torvalds1da177e2005-04-16 15:20:36 -0700124 base = read_pci_config(0, nb, 1, 0x40 + i*8);
125 limit = read_pci_config(0, nb, 1, 0x44 + i*8);
126
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +0100127 nodeid = limit & 7;
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +0100128 if ((base & 3) == 0) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700129 if (i < numnodes)
David Rientjes1af5ba52009-09-25 15:19:47 -0700130 pr_info("Skipping disabled node %d\n", i);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700131 continue;
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +0100132 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700133 if (nodeid >= numnodes) {
David Rientjes1af5ba52009-09-25 15:19:47 -0700134 pr_info("Ignoring excess node %d (%lx:%lx)\n", nodeid,
135 base, limit);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700136 continue;
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +0100137 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700138
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +0100139 if (!limit) {
David Rientjes1af5ba52009-09-25 15:19:47 -0700140 pr_info("Skipping node entry %d (base %lx)\n",
141 i, base);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700142 continue;
143 }
144 if ((base >> 8) & 3 || (limit >> 8) & 3) {
David Rientjes1af5ba52009-09-25 15:19:47 -0700145 pr_err("Node %d using interleaving mode %lx/%lx\n",
146 nodeid, (base >> 8) & 3, (limit >> 8) & 3);
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +0100147 return -1;
148 }
David Rientjes8ee2deb2009-09-25 15:20:00 -0700149 if (node_isset(nodeid, nodes_parsed)) {
David Rientjes1af5ba52009-09-25 15:19:47 -0700150 pr_info("Node %d already present, skipping\n",
151 nodeid);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700152 continue;
153 }
154
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +0100155 limit >>= 16;
156 limit <<= 24;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700157 limit |= (1<<24)-1;
Magnus Dammffd10a22005-11-05 17:25:54 +0100158 limit++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700159
David Rientjes8ee2deb2009-09-25 15:20:00 -0700160 if (limit > end)
161 limit = end;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700162 if (limit <= base)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700163 continue;
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +0100164
165 base >>= 16;
166 base <<= 24;
167
168 if (base < start)
169 base = start;
170 if (limit > end)
171 limit = end;
172 if (limit == base) {
David Rientjes1af5ba52009-09-25 15:19:47 -0700173 pr_err("Empty node %d\n", nodeid);
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +0100174 continue;
175 }
176 if (limit < base) {
David Rientjes1af5ba52009-09-25 15:19:47 -0700177 pr_err("Node %d bogus settings %lx-%lx.\n",
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +0100178 nodeid, base, limit);
179 continue;
180 }
181
Linus Torvalds1da177e2005-04-16 15:20:36 -0700182 /* Could sort here, but pun for now. Should not happen anyroads. */
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +0100183 if (prevbase > base) {
David Rientjes1af5ba52009-09-25 15:19:47 -0700184 pr_err("Node map not sorted %lx,%lx\n",
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +0100185 prevbase, base);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700186 return -1;
187 }
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +0100188
David Rientjes1af5ba52009-09-25 15:19:47 -0700189 pr_info("Node %d MemBase %016lx Limit %016lx\n",
190 nodeid, base, limit);
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +0100191
Linus Torvalds1da177e2005-04-16 15:20:36 -0700192 found++;
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +0100193
194 nodes[nodeid].start = base;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700195 nodes[nodeid].end = limit;
196
197 prevbase = base;
198
David Rientjes8ee2deb2009-09-25 15:20:00 -0700199 node_set(nodeid, nodes_parsed);
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +0100200 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700201
202 if (!found)
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +0100203 return -1;
David Rientjes8ee2deb2009-09-25 15:20:00 -0700204 return 0;
205}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700206
David Rientjes8ee2deb2009-09-25 15:20:00 -0700207int __init k8_scan_nodes(void)
208{
209 unsigned int bits;
210 unsigned int cores;
211 unsigned int apicid_base;
212 int i;
213
214 BUG_ON(nodes_empty(nodes_parsed));
215 node_possible_map = nodes_parsed;
Suresh Siddha6ec6e0d2008-03-25 10:14:35 -0700216 memnode_shift = compute_hash_shift(nodes, 8, NULL);
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +0100217 if (memnode_shift < 0) {
David Rientjes1af5ba52009-09-25 15:19:47 -0700218 pr_err("No NUMA node hash function found. Contact maintainer\n");
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +0100219 return -1;
220 }
David Rientjes1af5ba52009-09-25 15:19:47 -0700221 pr_info("Using node hash shift of %d\n", memnode_shift);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700222
Yinghai Lu3f6e5a12008-01-30 13:30:39 +0100223 /* use the coreid bits from early_identify_cpu */
224 bits = boot_cpu_data.x86_coreid_bits;
225 cores = (1<<bits);
Yinghai Lucbf9bd62008-02-19 03:21:06 -0800226 apicid_base = 0;
227 /* need to get boot_cpu_id early for system with apicid lifting */
228 early_get_boot_cpu_id();
229 if (boot_cpu_physical_apicid > 0) {
David Rientjes1af5ba52009-09-25 15:19:47 -0700230 pr_info("BSP APIC ID: %02x\n", boot_cpu_physical_apicid);
Yinghai Lucbf9bd62008-02-19 03:21:06 -0800231 apicid_base = boot_cpu_physical_apicid;
232 }
Yinghai Lu3f6e5a12008-01-30 13:30:39 +0100233
David Rientjes8ee2deb2009-09-25 15:20:00 -0700234 for_each_node_mask(i, node_possible_map) {
235 int j;
Yinghai Lu40bcc692009-01-05 18:39:01 -0800236
237 e820_register_active_regions(i,
238 nodes[i].start >> PAGE_SHIFT,
239 nodes[i].end >> PAGE_SHIFT);
240 for (j = apicid_base; j < cores + apicid_base; j++)
241 apicid_to_node[(i << bits) + j] = i;
242 setup_node_bootmem(i, nodes[i].start, nodes[i].end);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700243 }
244
245 numa_init_array();
246 return 0;
Carlos R. Mafra3aa88cd2008-01-30 13:32:36 +0100247}