srat_32.c 8.0 KB
Newer Older
L
Linus Torvalds 已提交
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
/*
 * Some of the code in this file has been gleaned from the 64 bit 
 * discontigmem support code base.
 *
 * Copyright (C) 2002, IBM Corp.
 *
 * All rights reserved.          
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE, GOOD TITLE or
 * NON INFRINGEMENT.  See the GNU General Public License for more
 * details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 *
 * Send feedback to Pat Gaughen <gone@us.ibm.com>
 */
#include <linux/mm.h>
#include <linux/bootmem.h>
#include <linux/mmzone.h>
#include <linux/acpi.h>
#include <linux/nodemask.h>
#include <asm/srat.h>
#include <asm/topology.h>
33
#include <asm/smp.h>
34
#include <asm/e820.h>
L
Linus Torvalds 已提交
35 36 37 38 39 40 41 42 43 44

/*
 * proximity macros and definitions
 */
#define NODE_ARRAY_INDEX(x)	((x) / 8)	/* 8 bits/char */
#define NODE_ARRAY_OFFSET(x)	((x) % 8)	/* 8 bits/char */
#define BMAP_SET(bmap, bit)	((bmap)[NODE_ARRAY_INDEX(bit)] |= 1 << NODE_ARRAY_OFFSET(bit))
#define BMAP_TEST(bmap, bit)	((bmap)[NODE_ARRAY_INDEX(bit)] & (1 << NODE_ARRAY_OFFSET(bit)))
/* bitmap length; _PXM is at most 255 */
#define PXM_BITMAP_LEN (MAX_PXM_DOMAINS / 8) 
45
static u8 __initdata pxm_bitmap[PXM_BITMAP_LEN];	/* bitmap of proximity domains */
L
Linus Torvalds 已提交
46

47
#define MAX_CHUNKS_PER_NODE	3
L
Linus Torvalds 已提交
48 49 50 51 52 53 54 55
#define MAXCHUNKS		(MAX_CHUNKS_PER_NODE * MAX_NUMNODES)
struct node_memory_chunk_s {
	unsigned long	start_pfn;
	unsigned long	end_pfn;
	u8	pxm;		// proximity domain of node
	u8	nid;		// which cnode contains this chunk?
	u8	bank;		// which mem bank on this node
};
56
static struct node_memory_chunk_s __initdata node_memory_chunk[MAXCHUNKS];
L
Linus Torvalds 已提交
57

58
static int __initdata num_memory_chunks; /* total number of memory chunks */
59
static u8 __initdata apicid_to_pxm[MAX_APICID];
L
Linus Torvalds 已提交
60

61 62 63 64 65 66 67 68 69 70 71 72 73 74 75
int numa_off __initdata;
int acpi_numa __initdata;

static __init void bad_srat(void)
{
        printk(KERN_ERR "SRAT: SRAT not used.\n");
        acpi_numa = -1;
	num_memory_chunks = 0;
}

static __init inline int srat_disabled(void)
{
	return numa_off || acpi_numa < 0;
}

L
Linus Torvalds 已提交
76
/* Identify CPU proximity domains */
77 78
void __init
acpi_numa_processor_affinity_init(struct acpi_srat_cpu_affinity *cpu_affinity)
L
Linus Torvalds 已提交
79
{
80 81 82 83 84 85 86
	if (srat_disabled())
		return;
	if (cpu_affinity->header.length !=
	     sizeof(struct acpi_srat_cpu_affinity)) {
		bad_srat();
		return;
	}
L
Linus Torvalds 已提交
87

88
	if ((cpu_affinity->flags & ACPI_SRAT_CPU_ENABLED) == 0)
L
Linus Torvalds 已提交
89 90 91
		return;		/* empty entry */

	/* mark this node as "seen" in node bitmap */
92
	BMAP_SET(pxm_bitmap, cpu_affinity->proximity_domain_lo);
L
Linus Torvalds 已提交
93

94
	apicid_to_pxm[cpu_affinity->apic_id] = cpu_affinity->proximity_domain_lo;
95

96
	printk(KERN_DEBUG "CPU %02x in proximity domain %02x\n",
97
		cpu_affinity->apic_id, cpu_affinity->proximity_domain_lo);
L
Linus Torvalds 已提交
98 99 100 101 102 103
}

/*
 * Identify memory proximity domains and hot-remove capabilities.
 * Fill node memory chunk list structure.
 */
104 105
void __init
acpi_numa_memory_affinity_init(struct acpi_srat_mem_affinity *memory_affinity)
L
Linus Torvalds 已提交
106 107
{
	unsigned long long paddr, size;
108
	unsigned long start_pfn, end_pfn;
L
Linus Torvalds 已提交
109 110
	u8 pxm;
	struct node_memory_chunk_s *p, *q, *pend;
111 112 113 114 115 116 117 118

	if (srat_disabled())
		return;
	if (memory_affinity->header.length !=
	     sizeof(struct acpi_srat_mem_affinity)) {
		bad_srat();
		return;
	}
L
Linus Torvalds 已提交
119

120
	if ((memory_affinity->flags & ACPI_SRAT_MEM_ENABLED) == 0)
L
Linus Torvalds 已提交
121 122
		return;		/* empty entry */

123 124
	pxm = memory_affinity->proximity_domain & 0xff;

L
Linus Torvalds 已提交
125
	/* mark this node as "seen" in node bitmap */
126
	BMAP_SET(pxm_bitmap, pxm);
L
Linus Torvalds 已提交
127 128

	/* calculate info for memory chunk structure */
129 130 131
	paddr = memory_affinity->base_address;
	size = memory_affinity->length;

L
Linus Torvalds 已提交
132 133
	start_pfn = paddr >> PAGE_SHIFT;
	end_pfn = (paddr + size) >> PAGE_SHIFT;
134

L
Linus Torvalds 已提交
135 136

	if (num_memory_chunks >= MAXCHUNKS) {
137 138
		printk(KERN_WARNING "Too many mem chunks in SRAT."
			" Ignoring %lld MBytes at %llx\n",
L
Linus Torvalds 已提交
139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158
			size/(1024*1024), paddr);
		return;
	}

	/* Insertion sort based on base address */
	pend = &node_memory_chunk[num_memory_chunks];
	for (p = &node_memory_chunk[0]; p < pend; p++) {
		if (start_pfn < p->start_pfn)
			break;
	}
	if (p < pend) {
		for (q = pend; q >= p; q--)
			*(q + 1) = *q;
	}
	p->start_pfn = start_pfn;
	p->end_pfn = end_pfn;
	p->pxm = pxm;

	num_memory_chunks++;

159
	printk(KERN_DEBUG "Memory range %08lx to %08lx"
160
			  " in proximity domain %02x %s\n",
L
Linus Torvalds 已提交
161
		start_pfn, end_pfn,
162 163
		pxm,
		((memory_affinity->flags & ACPI_SRAT_MEM_HOT_PLUGGABLE) ?
L
Linus Torvalds 已提交
164 165 166
		 "enabled and removable" : "enabled" ) );
}

167 168 169 170 171 172 173 174
/* Callback for SLIT parsing */
void __init acpi_numa_slit_init(struct acpi_table_slit *slit)
{
}

void acpi_numa_arch_fixup(void)
{
}
L
Linus Torvalds 已提交
175 176 177 178 179 180
/*
 * The SRAT table always lists ascending addresses, so can always
 * assume that the first "start" address that you see is the real
 * start of the node, and that the current "end" address is after
 * the previous one.
 */
181
static __init int node_read_chunk(int nid, struct node_memory_chunk_s *memory_chunk)
L
Linus Torvalds 已提交
182 183 184 185 186 187 188 189
{
	/*
	 * Only add present memory as told by the e820.
	 * There is no guarantee from the SRAT that the memory it
	 * enumerates is present at boot time because it represents
	 * *possible* memory hotplug areas the same as normal RAM.
	 */
	if (memory_chunk->start_pfn >= max_pfn) {
190
		printk(KERN_INFO "Ignoring SRAT pfns: %08lx - %08lx\n",
L
Linus Torvalds 已提交
191
			memory_chunk->start_pfn, memory_chunk->end_pfn);
192
		return -1;
L
Linus Torvalds 已提交
193 194
	}
	if (memory_chunk->nid != nid)
195
		return -1;
L
Linus Torvalds 已提交
196 197 198 199 200 201 202 203 204

	if (!node_has_online_mem(nid))
		node_start_pfn[nid] = memory_chunk->start_pfn;

	if (node_start_pfn[nid] > memory_chunk->start_pfn)
		node_start_pfn[nid] = memory_chunk->start_pfn;

	if (node_end_pfn[nid] < memory_chunk->end_pfn)
		node_end_pfn[nid] = memory_chunk->end_pfn;
205 206

	return 0;
L
Linus Torvalds 已提交
207 208
}

209
int __init get_memcfg_from_srat(void)
L
Linus Torvalds 已提交
210 211 212 213
{
	int i, j, nid;


214 215
	if (srat_disabled())
		goto out_fail;
L
Linus Torvalds 已提交
216 217

	if (num_memory_chunks == 0) {
218
		printk(KERN_DEBUG
219
			 "could not find any ACPI SRAT memory areas.\n");
L
Linus Torvalds 已提交
220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235
		goto out_fail;
	}

	/* Calculate total number of nodes in system from PXM bitmap and create
	 * a set of sequential node IDs starting at zero.  (ACPI doesn't seem
	 * to specify the range of _PXM values.)
	 */
	/*
	 * MCD - we no longer HAVE to number nodes sequentially.  PXM domain
	 * numbers could go as high as 256, and MAX_NUMNODES for i386 is typically
	 * 32, so we will continue numbering them in this manner until MAX_NUMNODES
	 * approaches MAX_PXM_DOMAINS for i386.
	 */
	nodes_clear(node_online_map);
	for (i = 0; i < MAX_PXM_DOMAINS; i++) {
		if (BMAP_TEST(pxm_bitmap, i)) {
236
			int nid = acpi_map_pxm_to_node(i);
L
Linus Torvalds 已提交
237 238 239 240 241 242 243
			node_set_online(nid);
		}
	}
	BUG_ON(num_online_nodes() == 0);

	/* set cnode id in memory chunk structure */
	for (i = 0; i < num_memory_chunks; i++)
244
		node_memory_chunk[i].nid = pxm_to_node(node_memory_chunk[i].pxm);
L
Linus Torvalds 已提交
245

246
	printk(KERN_DEBUG "pxm bitmap: ");
L
Linus Torvalds 已提交
247
	for (i = 0; i < sizeof(pxm_bitmap); i++) {
248
		printk(KERN_CONT "%02x ", pxm_bitmap[i]);
L
Linus Torvalds 已提交
249
	}
250 251 252 253 254
	printk(KERN_CONT "\n");
	printk(KERN_DEBUG "Number of logical nodes in system = %d\n",
			 num_online_nodes());
	printk(KERN_DEBUG "Number of memory chunks in system = %d\n",
			 num_memory_chunks);
L
Linus Torvalds 已提交
255

256 257 258
	for (i = 0; i < MAX_APICID; i++)
		apicid_2_node[i] = pxm_to_node(apicid_to_pxm[i]);

L
Linus Torvalds 已提交
259 260
	for (j = 0; j < num_memory_chunks; j++){
		struct node_memory_chunk_s * chunk = &node_memory_chunk[j];
261 262
		printk(KERN_DEBUG
			"chunk %d nid %d start_pfn %08lx end_pfn %08lx\n",
L
Linus Torvalds 已提交
263
		       j, chunk->nid, chunk->start_pfn, chunk->end_pfn);
264 265 266
		if (node_read_chunk(chunk->nid, chunk))
			continue;

267 268
		e820_register_active_regions(chunk->nid, chunk->start_pfn,
					     min(chunk->end_pfn, max_pfn));
I
Ingo Molnar 已提交
269
	}
270 271
	/* for out of order entries in SRAT */
	sort_node_map();
272

I
Ingo Molnar 已提交
273 274
	for_each_online_node(nid) {
		unsigned long start = node_start_pfn[nid];
275
		unsigned long end = min(node_end_pfn[nid], max_pfn);
I
Ingo Molnar 已提交
276 277 278

		memory_present(nid, start, end);
		node_remap_size[nid] = node_memmap_size_bytes(nid, start, end);
L
Linus Torvalds 已提交
279 280 281
	}
	return 1;
out_fail:
282
	printk(KERN_DEBUG "failed to get NUMA memory information from SRAT"
283
			" table\n");
L
Linus Torvalds 已提交
284 285
	return 0;
}