1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
|
/*
* ACPI 3.0 based NUMA setup
* Copyright 2004 Andi Kleen, SuSE Labs.
*
* Reads the ACPI SRAT table to figure out what memory belongs to which CPUs.
*
* Called from acpi_numa_init while reading the SRAT and SLIT tables.
* Assumes all memory regions belonging to a single proximity domain
* are in one chunk. Holes between them will be included in the node.
*
* Adapted for Xen: Ryan Harper <ryanh@us.ibm.com>
*/
#include <xen/init.h>
#include <xen/mm.h>
#include <xen/inttypes.h>
#include <xen/nodemask.h>
#include <xen/acpi.h>
#include <xen/numa.h>
#include <xen/pfn.h>
#include <asm/e820.h>
#include <asm/page.h>
#include <asm/spec_ctrl.h>
static struct acpi_table_slit *__read_mostly acpi_slit;
struct pxm2node {
unsigned pxm;
nodeid_t node;
};
static struct pxm2node __read_mostly pxm2node[MAX_NUMNODES] =
{ [0 ... MAX_NUMNODES - 1] = {.node = NUMA_NO_NODE} };
static inline bool node_found(unsigned idx, unsigned pxm)
{
return ((pxm2node[idx].pxm == pxm) &&
(pxm2node[idx].node != NUMA_NO_NODE));
}
nodeid_t pxm_to_node(unsigned pxm)
{
unsigned i;
if ((pxm < ARRAY_SIZE(pxm2node)) && node_found(pxm, pxm))
return pxm2node[pxm].node;
for (i = 0; i < ARRAY_SIZE(pxm2node); i++)
if (node_found(i, pxm))
return pxm2node[i].node;
return NUMA_NO_NODE;
}
nodeid_t setup_node(unsigned pxm)
{
nodeid_t node;
unsigned idx;
static bool warned;
static unsigned nodes_found;
BUILD_BUG_ON(MAX_NUMNODES >= NUMA_NO_NODE);
if (pxm < ARRAY_SIZE(pxm2node)) {
if (node_found(pxm, pxm))
return pxm2node[pxm].node;
/* Try to maintain indexing of pxm2node by pxm */
if (pxm2node[pxm].node == NUMA_NO_NODE) {
idx = pxm;
goto finish;
}
}
for (idx = 0; idx < ARRAY_SIZE(pxm2node); idx++)
if (pxm2node[idx].node == NUMA_NO_NODE)
goto finish;
if (!warned) {
printk(KERN_WARNING "SRAT: Too many proximity domains (%#x)\n",
pxm);
warned = true;
}
return NUMA_NO_NODE;
finish:
node = nodes_found++;
if (node >= MAX_NUMNODES)
return NUMA_NO_NODE;
pxm2node[idx].pxm = pxm;
pxm2node[idx].node = node;
return node;
}
void __init numa_fw_bad(void)
{
int i;
printk(KERN_ERR "SRAT: SRAT not used.\n");
acpi_numa = -1;
for (i = 0; i < MAX_LOCAL_APIC; i++)
apicid_to_node[i] = NUMA_NO_NODE;
for (i = 0; i < ARRAY_SIZE(pxm2node); i++)
pxm2node[i].node = NUMA_NO_NODE;
mem_hotplug = 0;
}
/*
* A lot of BIOS fill in 10 (= no distance) everywhere. This messes
* up the NUMA heuristics which wants the local node to have a smaller
* distance than the others.
* Do some quick checks here and only use the SLIT if it passes.
*/
static __init int slit_valid(struct acpi_table_slit *slit)
{
int i, j;
int d = slit->locality_count;
for (i = 0; i < d; i++) {
for (j = 0; j < d; j++) {
u8 val = slit->entry[d*i + j];
if (i == j) {
if (val != 10)
return 0;
} else if (val <= 10)
return 0;
}
}
return 1;
}
/* Callback for SLIT parsing */
void __init acpi_numa_slit_init(struct acpi_table_slit *slit)
{
mfn_t mfn;
if (!slit_valid(slit)) {
printk(KERN_INFO "ACPI: SLIT table looks invalid. "
"Not used.\n");
return;
}
mfn = alloc_boot_pages(PFN_UP(slit->header.length), 1);
acpi_slit = mfn_to_virt(mfn_x(mfn));
memcpy(acpi_slit, slit, slit->header.length);
}
/* Callback for Proximity Domain -> x2APIC mapping */
void __init
acpi_numa_x2apic_affinity_init(const struct acpi_srat_x2apic_cpu_affinity *pa)
{
unsigned pxm;
nodeid_t node;
if (numa_disabled())
return;
if (pa->header.length < sizeof(struct acpi_srat_x2apic_cpu_affinity)) {
numa_fw_bad();
return;
}
if (!(pa->flags & ACPI_SRAT_CPU_ENABLED))
return;
if (pa->apic_id >= MAX_LOCAL_APIC) {
printk(KERN_INFO "SRAT: APIC %08x ignored\n", pa->apic_id);
return;
}
pxm = pa->proximity_domain;
node = setup_node(pxm);
if (node == NUMA_NO_NODE) {
numa_fw_bad();
return;
}
apicid_to_node[pa->apic_id] = node;
numa_set_processor_nodes_parsed(node);
acpi_numa = 1;
if (opt_acpi_verbose)
printk(KERN_INFO "SRAT: PXM %u -> APIC %08x -> Node %u\n",
pxm, pa->apic_id, node);
}
/* Callback for Proximity Domain -> LAPIC mapping */
void __init
acpi_numa_processor_affinity_init(const struct acpi_srat_cpu_affinity *pa)
{
unsigned pxm;
nodeid_t node;
if (numa_disabled())
return;
if (pa->header.length != sizeof(struct acpi_srat_cpu_affinity)) {
numa_fw_bad();
return;
}
if (!(pa->flags & ACPI_SRAT_CPU_ENABLED))
return;
pxm = pa->proximity_domain_lo;
if (srat_rev >= 2) {
pxm |= pa->proximity_domain_hi[0] << 8;
pxm |= pa->proximity_domain_hi[1] << 16;
pxm |= pa->proximity_domain_hi[2] << 24;
}
node = setup_node(pxm);
if (node == NUMA_NO_NODE) {
numa_fw_bad();
return;
}
apicid_to_node[pa->apic_id] = node;
numa_set_processor_nodes_parsed(node);
acpi_numa = 1;
if (opt_acpi_verbose)
printk(KERN_INFO "SRAT: PXM %u -> APIC %02x -> Node %u\n",
pxm, pa->apic_id, node);
}
/* Callback for parsing of the Proximity Domain <-> Memory Area mappings */
void __init
acpi_numa_memory_affinity_init(const struct acpi_srat_mem_affinity *ma)
{
unsigned pxm;
nodeid_t node;
if (numa_disabled())
return;
if (ma->header.length != sizeof(struct acpi_srat_mem_affinity)) {
numa_fw_bad();
return;
}
if (!(ma->flags & ACPI_SRAT_MEM_ENABLED))
return;
/* Supplement the heuristics in l1tf_calculations(). */
l1tf_safe_maddr = max(l1tf_safe_maddr,
ROUNDUP(ma->base_address + ma->length,
PAGE_SIZE));
if (!numa_memblks_available()) {
dprintk(XENLOG_WARNING,
"Too many numa entries, try bigger NR_NODE_MEMBLKS!\n");
numa_fw_bad();
return;
}
pxm = ma->proximity_domain;
if (srat_rev < 2)
pxm &= 0xff;
node = setup_node(pxm);
if (node == NUMA_NO_NODE) {
numa_fw_bad();
return;
}
/*
* In an extremely unlikely case, srat_parse_regions might not
* be called. So set the variable here just in case.
*/
numa_fw_nid_name = "PXM";
if (!numa_update_node_memblks(node, pxm, ma->base_address, ma->length,
ma->flags & ACPI_SRAT_MEM_HOT_PLUGGABLE))
numa_fw_bad();
}
void __init acpi_numa_arch_fixup(void) {}
static uint64_t __initdata srat_region_mask;
static int __init cf_check srat_parse_region(
struct acpi_subtable_header *header, const unsigned long end)
{
struct acpi_srat_mem_affinity *ma;
if (!header)
return -EINVAL;
ma = container_of(header, struct acpi_srat_mem_affinity, header);
if (!ma->length ||
!(ma->flags & ACPI_SRAT_MEM_ENABLED) ||
(ma->flags & ACPI_SRAT_MEM_NON_VOLATILE))
return 0;
if (numa_off)
printk(KERN_INFO "SRAT: %013"PRIx64"-%013"PRIx64"\n",
ma->base_address, ma->base_address + ma->length - 1);
srat_region_mask |= ma->base_address |
pdx_region_mask(ma->base_address, ma->length);
return 0;
}
void __init srat_parse_regions(paddr_t addr)
{
u64 mask;
unsigned int i;
if (acpi_disabled || acpi_numa < 0 ||
acpi_table_parse(ACPI_SIG_SRAT, acpi_parse_srat))
return;
/* Set "PXM" as early as feasible. */
numa_fw_nid_name = "PXM";
srat_region_mask = pdx_init_mask(addr);
acpi_table_parse_srat(ACPI_SRAT_TYPE_MEMORY_AFFINITY,
srat_parse_region, 0);
for (mask = srat_region_mask, i = 0; mask && i < e820.nr_map; i++) {
if (e820.map[i].type != E820_RAM)
continue;
if (~mask & pdx_region_mask(e820.map[i].addr, e820.map[i].size))
mask = 0;
}
pfn_pdx_hole_setup(mask >> PAGE_SHIFT);
}
unsigned int numa_node_to_arch_nid(nodeid_t n)
{
unsigned int i;
if ((n < ARRAY_SIZE(pxm2node)) && (pxm2node[n].node == n))
return pxm2node[n].pxm;
for (i = 0; i < ARRAY_SIZE(pxm2node); i++)
if (pxm2node[i].node == n)
return pxm2node[i].pxm;
return 0;
}
u8 __node_distance(nodeid_t a, nodeid_t b)
{
unsigned index;
u8 slit_val;
if (!acpi_slit)
return a == b ? 10 : 20;
index = acpi_slit->locality_count * numa_node_to_arch_nid(a);
slit_val = acpi_slit->entry[index + numa_node_to_arch_nid(b)];
/* ACPI defines 0xff as an unreachable node and 0-9 are undefined */
if ((slit_val == 0xff) || (slit_val <= 9))
return NUMA_NO_DISTANCE;
else
return slit_val;
}
EXPORT_SYMBOL(__node_distance);
|