blob: 3695c9e8b9b6dc052ad254a89c9a0da90766b9dd [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * AMD K8 NUMA support.
3 * Discover the memory map and associated nodes.
4 *
5 * This version reads it directly from the K8 northbridge.
6 *
7 * 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>
16#include <asm/types.h>
17#include <asm/mmzone.h>
18#include <asm/proto.h>
19#include <asm/e820.h>
20#include <asm/pci-direct.h>
21#include <asm/numa.h>
22
23static __init int find_northbridge(void)
24{
25 int num;
26
27 for (num = 0; num < 32; num++) {
28 u32 header;
29
30 header = read_pci_config(0, num, 0, 0x00);
31 if (header != (PCI_VENDOR_ID_AMD | (0x1100<<16)))
32 continue;
33
34 header = read_pci_config(0, num, 1, 0x00);
35 if (header != (PCI_VENDOR_ID_AMD | (0x1101<<16)))
36 continue;
37 return num;
38 }
39
40 return -1;
41}
42
43int __init k8_scan_nodes(unsigned long start, unsigned long end)
44{
45 unsigned long prevbase;
Andi Kleenabe059e2006-03-25 16:29:12 +010046 struct bootnode nodes[8];
Yinghai Lu3f6e5a12008-01-30 13:30:39 +010047 int nodeid, i, nb;
Andi Kleen3f098c22005-09-12 18:49:24 +020048 unsigned char nodeids[8];
Linus Torvalds1da177e2005-04-16 15:20:36 -070049 int found = 0;
50 u32 reg;
51 unsigned numnodes;
Yinghai Lu3f6e5a12008-01-30 13:30:39 +010052 unsigned cores;
53 unsigned bits;
54 int j;
Linus Torvalds1da177e2005-04-16 15:20:36 -070055
Andi Kleen0637a702006-09-26 10:52:41 +020056 if (!early_pci_allowed())
57 return -1;
58
Linus Torvalds1da177e2005-04-16 15:20:36 -070059 nb = find_northbridge();
60 if (nb < 0)
61 return nb;
62
63 printk(KERN_INFO "Scanning NUMA topology in Northbridge %d\n", nb);
64
65 reg = read_pci_config(0, nb, 0, 0x60);
66 numnodes = ((reg >> 4) & 0xF) + 1;
Andi Kleen3bea9c92007-05-02 19:27:21 +020067 if (numnodes <= 1)
68 return -1;
Linus Torvalds1da177e2005-04-16 15:20:36 -070069
70 printk(KERN_INFO "Number of nodes %d\n", numnodes);
71
72 memset(&nodes,0,sizeof(nodes));
73 prevbase = 0;
74 for (i = 0; i < 8; i++) {
75 unsigned long base,limit;
Andi Kleen3f098c22005-09-12 18:49:24 +020076 u32 nodeid;
77
Linus Torvalds1da177e2005-04-16 15:20:36 -070078 base = read_pci_config(0, nb, 1, 0x40 + i*8);
79 limit = read_pci_config(0, nb, 1, 0x44 + i*8);
80
81 nodeid = limit & 7;
Andi Kleen3f098c22005-09-12 18:49:24 +020082 nodeids[i] = nodeid;
Linus Torvalds1da177e2005-04-16 15:20:36 -070083 if ((base & 3) == 0) {
84 if (i < numnodes)
85 printk("Skipping disabled node %d\n", i);
86 continue;
87 }
88 if (nodeid >= numnodes) {
89 printk("Ignoring excess node %d (%lx:%lx)\n", nodeid,
90 base, limit);
91 continue;
92 }
93
94 if (!limit) {
95 printk(KERN_INFO "Skipping node entry %d (base %lx)\n", i,
96 base);
97 continue;
98 }
99 if ((base >> 8) & 3 || (limit >> 8) & 3) {
100 printk(KERN_ERR "Node %d using interleaving mode %lx/%lx\n",
101 nodeid, (base>>8)&3, (limit>>8) & 3);
102 return -1;
103 }
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200104 if (node_isset(nodeid, node_possible_map)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700105 printk(KERN_INFO "Node %d already present. Skipping\n",
106 nodeid);
107 continue;
108 }
109
110 limit >>= 16;
111 limit <<= 24;
112 limit |= (1<<24)-1;
Magnus Dammffd10a22005-11-05 17:25:54 +0100113 limit++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700114
115 if (limit > end_pfn << PAGE_SHIFT)
116 limit = end_pfn << PAGE_SHIFT;
117 if (limit <= base)
118 continue;
119
120 base >>= 16;
121 base <<= 24;
122
123 if (base < start)
124 base = start;
125 if (limit > end)
126 limit = end;
127 if (limit == base) {
128 printk(KERN_ERR "Empty node %d\n", nodeid);
129 continue;
130 }
131 if (limit < base) {
132 printk(KERN_ERR "Node %d bogus settings %lx-%lx.\n",
133 nodeid, base, limit);
134 continue;
135 }
136
137 /* Could sort here, but pun for now. Should not happen anyroads. */
138 if (prevbase > base) {
139 printk(KERN_ERR "Node map not sorted %lx,%lx\n",
140 prevbase,base);
141 return -1;
142 }
143
144 printk(KERN_INFO "Node %d MemBase %016lx Limit %016lx\n",
145 nodeid, base, limit);
146
147 found++;
148
149 nodes[nodeid].start = base;
150 nodes[nodeid].end = limit;
Mel Gorman5cb248a2006-09-27 01:49:52 -0700151 e820_register_active_regions(nodeid,
152 nodes[nodeid].start >> PAGE_SHIFT,
153 nodes[nodeid].end >> PAGE_SHIFT);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700154
155 prevbase = base;
156
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200157 node_set(nodeid, node_possible_map);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700158 }
159
160 if (!found)
161 return -1;
162
Andi Kleen2aed7112006-02-16 23:42:16 +0100163 memnode_shift = compute_hash_shift(nodes, 8);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700164 if (memnode_shift < 0) {
165 printk(KERN_ERR "No NUMA node hash function found. Contact maintainer\n");
166 return -1;
167 }
168 printk(KERN_INFO "Using node hash shift of %d\n", memnode_shift);
169
Yinghai Lu3f6e5a12008-01-30 13:30:39 +0100170 /* use the coreid bits from early_identify_cpu */
171 bits = boot_cpu_data.x86_coreid_bits;
172 cores = (1<<bits);
173
Linus Torvalds1da177e2005-04-16 15:20:36 -0700174 for (i = 0; i < 8; i++) {
175 if (nodes[i].start != nodes[i].end) {
Andi Kleen3f098c22005-09-12 18:49:24 +0200176 nodeid = nodeids[i];
Yinghai Lu3f6e5a12008-01-30 13:30:39 +0100177 for (j = 0; j < cores; j++)
178 apicid_to_node[(nodeid << bits) + j] = i;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700179 setup_node_bootmem(i, nodes[i].start, nodes[i].end);
180 }
181 }
182
183 numa_init_array();
184 return 0;
185}