[deliverable/linux.git] / arch / x86 / kernel / srat_32.c

/*
 * 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>
#include <asm/smp.h>

/*
 * 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) 
static u8 pxm_bitmap[PXM_BITMAP_LEN];	/* bitmap of proximity domains */

#define MAX_CHUNKS_PER_NODE	3
#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
};
static struct node_memory_chunk_s node_memory_chunk[MAXCHUNKS];

static int num_memory_chunks;		/* total number of memory chunks */
static u8 __initdata apicid_to_pxm[MAX_APICID];

/* Identify CPU proximity domains */
static void __init parse_cpu_affinity_structure(char *p)
{
	struct acpi_srat_cpu_affinity *cpu_affinity =
				(struct acpi_srat_cpu_affinity *) p;

	if ((cpu_affinity->flags & ACPI_SRAT_CPU_ENABLED) == 0)
		return;		/* empty entry */

	/* mark this node as "seen" in node bitmap */
	BMAP_SET(pxm_bitmap, cpu_affinity->proximity_domain_lo);

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

	printk("CPU 0x%02X in proximity domain 0x%02X\n",
		cpu_affinity->apic_id, cpu_affinity->proximity_domain_lo);
}

/*
 * Identify memory proximity domains and hot-remove capabilities.
 * Fill node memory chunk list structure.
 */
static void __init parse_memory_affinity_structure (char *sratp)
{
	unsigned long long paddr, size;
	unsigned long start_pfn, end_pfn;
	u8 pxm;
	struct node_memory_chunk_s *p, *q, *pend;
	struct acpi_srat_mem_affinity *memory_affinity =
			(struct acpi_srat_mem_affinity *) sratp;

	if ((memory_affinity->flags & ACPI_SRAT_MEM_ENABLED) == 0)
		return;		/* empty entry */

	pxm = memory_affinity->proximity_domain & 0xff;

	/* mark this node as "seen" in node bitmap */
	BMAP_SET(pxm_bitmap, pxm);

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

	start_pfn = paddr >> PAGE_SHIFT;
	end_pfn = (paddr + size) >> PAGE_SHIFT;


	if (num_memory_chunks >= MAXCHUNKS) {
		printk("Too many mem chunks in SRAT. Ignoring %lld MBytes at %llx\n",
			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++;

	printk("Memory range 0x%lX to 0x%lX (type 0x%X) in proximity domain 0x%02X %s\n",
		start_pfn, end_pfn,
		memory_affinity->memory_type,
		pxm,
		((memory_affinity->flags & ACPI_SRAT_MEM_HOT_PLUGGABLE) ?
		 "enabled and removable" : "enabled" ) );
}

/*
 * 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.
 */
static __init void node_read_chunk(int nid, struct node_memory_chunk_s *memory_chunk)
{
	/*
	 * 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) {
		printk (KERN_INFO "Ignoring SRAT pfns: 0x%08lx -> %08lx\n",
			memory_chunk->start_pfn, memory_chunk->end_pfn);
		return;
	}
	if (memory_chunk->nid != nid)
		return;

	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;
}

/* Parse the ACPI Static Resource Affinity Table */
static int __init acpi20_parse_srat(struct acpi_table_srat *sratp)
{
	u8 *start, *end, *p;
	int i, j, nid;

	start = (u8 *)(&(sratp->reserved) + 1);	/* skip header */
	p = start;
	end = (u8 *)sratp + sratp->header.length;

	memset(pxm_bitmap, 0, sizeof(pxm_bitmap));	/* init proximity domain bitmap */
	memset(node_memory_chunk, 0, sizeof(node_memory_chunk));

	num_memory_chunks = 0;
	while (p < end) {
		switch (*p) {
		case ACPI_SRAT_TYPE_CPU_AFFINITY:
			parse_cpu_affinity_structure(p);
			break;
		case ACPI_SRAT_TYPE_MEMORY_AFFINITY:
			parse_memory_affinity_structure(p);
			break;
		default:
			printk("ACPI 2.0 SRAT: unknown entry skipped: type=0x%02X, len=%d\n", p[0], p[1]);
			break;
		}
		p += p[1];
		if (p[1] == 0) {
			printk("acpi20_parse_srat: Entry length value is zero;"
				" can't parse any further!\n");
			break;
		}
	}

	if (num_memory_chunks == 0) {
		printk("could not finy any ACPI SRAT memory areas.\n");
		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)) {
			int nid = acpi_map_pxm_to_node(i);
			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++)
		node_memory_chunk[i].nid = pxm_to_node(node_memory_chunk[i].pxm);

	printk("pxm bitmap: ");
	for (i = 0; i < sizeof(pxm_bitmap); i++) {
		printk("%02X ", pxm_bitmap[i]);
	}
	printk("\n");
	printk("Number of logical nodes in system = %d\n", num_online_nodes());
	printk("Number of memory chunks in system = %d\n", num_memory_chunks);

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

	for (j = 0; j < num_memory_chunks; j++){
		struct node_memory_chunk_s * chunk = &node_memory_chunk[j];
		printk("chunk %d nid %d start_pfn %08lx end_pfn %08lx\n",
		       j, chunk->nid, chunk->start_pfn, chunk->end_pfn);
		node_read_chunk(chunk->nid, chunk);
		add_active_range(chunk->nid, chunk->start_pfn, chunk->end_pfn);
	}
 
	for_each_online_node(nid) {
		unsigned long start = node_start_pfn[nid];
		unsigned long end = node_end_pfn[nid];

		memory_present(nid, start, end);
		node_remap_size[nid] = node_memmap_size_bytes(nid, start, end);
	}
	return 1;
out_fail:
	return 0;
}

struct acpi_static_rsdt {
	struct acpi_table_rsdt table;
	u32 padding[7]; /* Allow for 7 more table entries */
};

int __init get_memcfg_from_srat(void)
{
	struct acpi_table_header *header = NULL;
	struct acpi_table_rsdp *rsdp = NULL;
	struct acpi_table_rsdt *rsdt = NULL;
	acpi_native_uint rsdp_address = 0;
	struct acpi_static_rsdt saved_rsdt;
	int tables = 0;
	int i = 0;

	rsdp_address = acpi_os_get_root_pointer();
	if (!rsdp_address) {
		printk("%s: System description tables not found\n",
		       __func__);
		goto out_err;
	}

	printk("%s: assigning address to rsdp\n", __func__);
	rsdp = (struct acpi_table_rsdp *)(u32)rsdp_address;
	if (!rsdp) {
		printk("%s: Didn't find ACPI root!\n", __func__);
		goto out_err;
	}

	printk(KERN_INFO "%.8s v%d [%.6s]\n", rsdp->signature, rsdp->revision,
		rsdp->oem_id);

	if (strncmp(rsdp->signature, ACPI_SIG_RSDP,strlen(ACPI_SIG_RSDP))) {
		printk(KERN_WARNING "%s: RSDP table signature incorrect\n", __func__);
		goto out_err;
	}

	rsdt = (struct acpi_table_rsdt *)
	    early_ioremap(rsdp->rsdt_physical_address, sizeof(struct acpi_table_rsdt));

	if (!rsdt) {
		printk(KERN_WARNING
		       "%s: ACPI: Invalid root system description tables (RSDT)\n",
		       __func__);
		goto out_err;
	}

	header = &rsdt->header;

	if (strncmp(header->signature, ACPI_SIG_RSDT, strlen(ACPI_SIG_RSDT))) {
		printk(KERN_WARNING "ACPI: RSDT signature incorrect\n");
		goto out_err;
	}

	/* 
	 * The number of tables is computed by taking the 
	 * size of all entries (header size minus total 
	 * size of RSDT) divided by the size of each entry
	 * (4-byte table pointers).
	 */
	tables = (header->length - sizeof(struct acpi_table_header)) / 4;

	if (!tables)
		goto out_err;

	memcpy(&saved_rsdt, rsdt, sizeof(saved_rsdt));

	if (saved_rsdt.table.header.length > sizeof(saved_rsdt)) {
		printk(KERN_WARNING "ACPI: Too big length in RSDT: %d\n",
		       saved_rsdt.table.header.length);
		goto out_err;
	}

	printk("Begin SRAT table scan....\n");

	for (i = 0; i < tables; i++) {
		/* Map in header, then map in full table length. */
		header = (struct acpi_table_header *)
			early_ioremap(saved_rsdt.table.table_offset_entry[i], sizeof(struct acpi_table_header));
		if (!header)
			break;
		header = (struct acpi_table_header *)
			early_ioremap(saved_rsdt.table.table_offset_entry[i], header->length);
		if (!header)
			break;

		if (strncmp((char *) &header->signature, ACPI_SIG_SRAT, 4))
			continue;

		/* we've found the srat table. don't need to look at any more tables */
		return acpi20_parse_srat((struct acpi_table_srat *)header);
	}
out_err:
	remove_all_active_ranges();
	printk("failed to get NUMA memory information from SRAT table\n");
	return 0;
}
Commit	Line	Data
1da177e4 LT	1	/*
	2	* Some of the code in this file has been gleaned from the 64 bit
	3	* discontigmem support code base.
	4	*
	5	* Copyright (C) 2002, IBM Corp.
	6	*
	7	* All rights reserved.
	8	*
	9	* This program is free software; you can redistribute it and/or modify
	10	* it under the terms of the GNU General Public License as published by
	11	* the Free Software Foundation; either version 2 of the License, or
	12	* (at your option) any later version.
	13	*
	14	* This program is distributed in the hope that it will be useful, but
	15	* WITHOUT ANY WARRANTY; without even the implied warranty of
	16	* MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE, GOOD TITLE or
	17	* NON INFRINGEMENT. See the GNU General Public License for more
	18	* details.
	19	*
	20	* You should have received a copy of the GNU General Public License
	21	* along with this program; if not, write to the Free Software
	22	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
	23	*
	24	* Send feedback to Pat Gaughen <gone@us.ibm.com>
	25	*/
1da177e4 LT	26	#include <linux/mm.h>
	27	#include <linux/bootmem.h>
	28	#include <linux/mmzone.h>
	29	#include <linux/acpi.h>
	30	#include <linux/nodemask.h>
	31	#include <asm/srat.h>
	32	#include <asm/topology.h>
3b08606d	33	#include <asm/smp.h>
1da177e4 LT	34
	35	/*
	36	* proximity macros and definitions
	37	*/
	38	#define NODE_ARRAY_INDEX(x) ((x) / 8) /* 8 bits/char */
	39	#define NODE_ARRAY_OFFSET(x) ((x) % 8) /* 8 bits/char */
	40	#define BMAP_SET(bmap, bit) ((bmap)[NODE_ARRAY_INDEX(bit)] \|= 1 << NODE_ARRAY_OFFSET(bit))
	41	#define BMAP_TEST(bmap, bit) ((bmap)[NODE_ARRAY_INDEX(bit)] & (1 << NODE_ARRAY_OFFSET(bit)))
1da177e4 LT	42	/* bitmap length; _PXM is at most 255 */
	43	#define PXM_BITMAP_LEN (MAX_PXM_DOMAINS / 8)
	44	static u8 pxm_bitmap[PXM_BITMAP_LEN]; /* bitmap of proximity domains */
	45
b9b15780	46	#define MAX_CHUNKS_PER_NODE 3
1da177e4 LT	47	#define MAXCHUNKS (MAX_CHUNKS_PER_NODE * MAX_NUMNODES)
	48	struct node_memory_chunk_s {
	49	unsigned long start_pfn;
	50	unsigned long end_pfn;
	51	u8 pxm; // proximity domain of node
	52	u8 nid; // which cnode contains this chunk?
	53	u8 bank; // which mem bank on this node
	54	};
	55	static struct node_memory_chunk_s node_memory_chunk[MAXCHUNKS];
	56
	57	static int num_memory_chunks; /* total number of memory chunks */
3b08606d	58	static u8 __initdata apicid_to_pxm[MAX_APICID];
1da177e4	59
1da177e4 LT	60	/* Identify CPU proximity domains */
	61	static void __init parse_cpu_affinity_structure(char *p)
	62	{
0e568335 AS	63	struct acpi_srat_cpu_affinity *cpu_affinity =
0e568335 AS	64	(struct acpi_srat_cpu_affinity *) p;
1da177e4	65
0e568335	66	if ((cpu_affinity->flags & ACPI_SRAT_CPU_ENABLED) == 0)
1da177e4 LT	67	return; /* empty entry */
	68
	69	/* mark this node as "seen" in node bitmap */
0e568335	70	BMAP_SET(pxm_bitmap, cpu_affinity->proximity_domain_lo);
1da177e4	71
0e568335	72	apicid_to_pxm[cpu_affinity->apic_id] = cpu_affinity->proximity_domain_lo;
3b08606d	73
1da177e4	74	printk("CPU 0x%02X in proximity domain 0x%02X\n",
0e568335	75	cpu_affinity->apic_id, cpu_affinity->proximity_domain_lo);
1da177e4 LT	76	}
	77
	78	/*
	79	* Identify memory proximity domains and hot-remove capabilities.
	80	* Fill node memory chunk list structure.
	81	*/
	82	static void __init parse_memory_affinity_structure (char *sratp)
	83	{
	84	unsigned long long paddr, size;
0e568335	85	unsigned long start_pfn, end_pfn;
1da177e4 LT	86	u8 pxm;
1da177e4 LT	87	struct node_memory_chunk_s p, q, *pend;
0e568335 AS	88	struct acpi_srat_mem_affinity *memory_affinity =
0e568335 AS	89	(struct acpi_srat_mem_affinity *) sratp;
1da177e4	90
0e568335	91	if ((memory_affinity->flags & ACPI_SRAT_MEM_ENABLED) == 0)
1da177e4 LT	92	return; /* empty entry */
1da177e4 LT	93
0e568335 AS	94	pxm = memory_affinity->proximity_domain & 0xff;
0e568335 AS	95
1da177e4	96	/* mark this node as "seen" in node bitmap */
0e568335	97	BMAP_SET(pxm_bitmap, pxm);
1da177e4 LT	98
1da177e4 LT	99	/* calculate info for memory chunk structure */
0e568335 AS	100	paddr = memory_affinity->base_address;
	101	size = memory_affinity->length;
	102
1da177e4 LT	103	start_pfn = paddr >> PAGE_SHIFT;
1da177e4 LT	104	end_pfn = (paddr + size) >> PAGE_SHIFT;
0e568335	105
1da177e4 LT	106
	107	if (num_memory_chunks >= MAXCHUNKS) {
	108	printk("Too many mem chunks in SRAT. Ignoring %lld MBytes at %llx\n",
	109	size/(1024*1024), paddr);
	110	return;
	111	}
	112
	113	/* Insertion sort based on base address */
	114	pend = &node_memory_chunk[num_memory_chunks];
	115	for (p = &node_memory_chunk[0]; p < pend; p++) {
	116	if (start_pfn < p->start_pfn)
	117	break;
	118	}
	119	if (p < pend) {
	120	for (q = pend; q >= p; q--)
	121	(q + 1) = q;
	122	}
	123	p->start_pfn = start_pfn;
	124	p->end_pfn = end_pfn;
	125	p->pxm = pxm;
	126
	127	num_memory_chunks++;
	128
	129	printk("Memory range 0x%lX to 0x%lX (type 0x%X) in proximity domain 0x%02X %s\n",
	130	start_pfn, end_pfn,
	131	memory_affinity->memory_type,
0e568335 AS	132	pxm,
0e568335 AS	133	((memory_affinity->flags & ACPI_SRAT_MEM_HOT_PLUGGABLE) ?
1da177e4 LT	134	"enabled and removable" : "enabled" ) );
	135	}
	136
1da177e4 LT	137	/*
	138	* The SRAT table always lists ascending addresses, so can always
	139	* assume that the first "start" address that you see is the real
	140	* start of the node, and that the current "end" address is after
	141	* the previous one.
	142	*/
	143	static __init void node_read_chunk(int nid, struct node_memory_chunk_s *memory_chunk)
	144	{
	145	/*
	146	* Only add present memory as told by the e820.
	147	* There is no guarantee from the SRAT that the memory it
	148	* enumerates is present at boot time because it represents
	149	* possible memory hotplug areas the same as normal RAM.
	150	*/
	151	if (memory_chunk->start_pfn >= max_pfn) {
	152	printk (KERN_INFO "Ignoring SRAT pfns: 0x%08lx -> %08lx\n",
	153	memory_chunk->start_pfn, memory_chunk->end_pfn);
	154	return;
	155	}
	156	if (memory_chunk->nid != nid)
	157	return;
	158
	159	if (!node_has_online_mem(nid))
	160	node_start_pfn[nid] = memory_chunk->start_pfn;
	161
	162	if (node_start_pfn[nid] > memory_chunk->start_pfn)
	163	node_start_pfn[nid] = memory_chunk->start_pfn;
	164
	165	if (node_end_pfn[nid] < memory_chunk->end_pfn)
	166	node_end_pfn[nid] = memory_chunk->end_pfn;
	167	}
	168
	169	/* Parse the ACPI Static Resource Affinity Table */
	170	static int __init acpi20_parse_srat(struct acpi_table_srat *sratp)
	171	{
	172	u8 start, end, *p;
	173	int i, j, nid;
1da177e4 LT	174
	175	start = (u8 )(&(sratp->reserved) + 1); / skip header */
	176	p = start;
	177	end = (u8 *)sratp + sratp->header.length;
	178
	179	memset(pxm_bitmap, 0, sizeof(pxm_bitmap)); /* init proximity domain bitmap */
	180	memset(node_memory_chunk, 0, sizeof(node_memory_chunk));
1da177e4	181
1da177e4 LT	182	num_memory_chunks = 0;
	183	while (p < end) {
	184	switch (*p) {
0e568335	185	case ACPI_SRAT_TYPE_CPU_AFFINITY:
1da177e4 LT	186	parse_cpu_affinity_structure(p);
1da177e4 LT	187	break;
0e568335	188	case ACPI_SRAT_TYPE_MEMORY_AFFINITY:
1da177e4 LT	189	parse_memory_affinity_structure(p);
	190	break;
	191	default:
	192	printk("ACPI 2.0 SRAT: unknown entry skipped: type=0x%02X, len=%d\n", p[0], p[1]);
	193	break;
	194	}
	195	p += p[1];
	196	if (p[1] == 0) {
	197	printk("acpi20_parse_srat: Entry length value is zero;"
	198	" can't parse any further!\n");
	199	break;
	200	}
	201	}
	202
	203	if (num_memory_chunks == 0) {
	204	printk("could not finy any ACPI SRAT memory areas.\n");
	205	goto out_fail;
	206	}
	207
	208	/* Calculate total number of nodes in system from PXM bitmap and create
	209	* a set of sequential node IDs starting at zero. (ACPI doesn't seem
	210	* to specify the range of _PXM values.)
	211	*/
	212	/*
	213	* MCD - we no longer HAVE to number nodes sequentially. PXM domain
	214	* numbers could go as high as 256, and MAX_NUMNODES for i386 is typically
	215	* 32, so we will continue numbering them in this manner until MAX_NUMNODES
	216	* approaches MAX_PXM_DOMAINS for i386.
	217	*/
	218	nodes_clear(node_online_map);
	219	for (i = 0; i < MAX_PXM_DOMAINS; i++) {
	220	if (BMAP_TEST(pxm_bitmap, i)) {
762834e8	221	int nid = acpi_map_pxm_to_node(i);
1da177e4 LT	222	node_set_online(nid);
	223	}
	224	}
	225	BUG_ON(num_online_nodes() == 0);
	226
	227	/* set cnode id in memory chunk structure */
	228	for (i = 0; i < num_memory_chunks; i++)
762834e8	229	node_memory_chunk[i].nid = pxm_to_node(node_memory_chunk[i].pxm);
1da177e4 LT	230
	231	printk("pxm bitmap: ");
	232	for (i = 0; i < sizeof(pxm_bitmap); i++) {
	233	printk("%02X ", pxm_bitmap[i]);
	234	}
	235	printk("\n");
	236	printk("Number of logical nodes in system = %d\n", num_online_nodes());
	237	printk("Number of memory chunks in system = %d\n", num_memory_chunks);
	238
3b08606d	239	for (i = 0; i < MAX_APICID; i++)
	240	apicid_2_node[i] = pxm_to_node(apicid_to_pxm[i]);
	241
1da177e4 LT	242	for (j = 0; j < num_memory_chunks; j++){
	243	struct node_memory_chunk_s * chunk = &node_memory_chunk[j];
	244	printk("chunk %d nid %d start_pfn %08lx end_pfn %08lx\n",
	245	j, chunk->nid, chunk->start_pfn, chunk->end_pfn);
	246	node_read_chunk(chunk->nid, chunk);
4cfee88a	247	add_active_range(chunk->nid, chunk->start_pfn, chunk->end_pfn);
1da177e4 LT	248	}
	249
	250	for_each_online_node(nid) {
	251	unsigned long start = node_start_pfn[nid];
	252	unsigned long end = node_end_pfn[nid];
	253
	254	memory_present(nid, start, end);
	255	node_remap_size[nid] = node_memmap_size_bytes(nid, start, end);
	256	}
	257	return 1;
	258	out_fail:
	259	return 0;
	260	}
	261
0e568335 AS	262	struct acpi_static_rsdt {
	263	struct acpi_table_rsdt table;
	264	u32 padding[7]; /* Allow for 7 more table entries */
	265	};
	266
1da177e4 LT	267	int __init get_memcfg_from_srat(void)
	268	{
	269	struct acpi_table_header *header = NULL;
	270	struct acpi_table_rsdp *rsdp = NULL;
	271	struct acpi_table_rsdt *rsdt = NULL;
0e568335 AS	272	acpi_native_uint rsdp_address = 0;
0e568335 AS	273	struct acpi_static_rsdt saved_rsdt;
1da177e4 LT	274	int tables = 0;
	275	int i = 0;
	276
239665a3	277	rsdp_address = acpi_os_get_root_pointer();
0e568335	278	if (!rsdp_address) {
5d357040	279	printk("%s: System description tables not found\n",
77bf90ed	280	__func__);
5d357040 MD	281	goto out_err;
5d357040 MD	282	}
1da177e4	283
77bf90ed	284	printk("%s: assigning address to rsdp\n", __func__);
0e568335	285	rsdp = (struct acpi_table_rsdp *)(u32)rsdp_address;
1da177e4	286	if (!rsdp) {
77bf90ed	287	printk("%s: Didn't find ACPI root!\n", __func__);
1da177e4 LT	288	goto out_err;
	289	}
	290
	291	printk(KERN_INFO "%.8s v%d [%.6s]\n", rsdp->signature, rsdp->revision,
	292	rsdp->oem_id);
	293
0e568335	294	if (strncmp(rsdp->signature, ACPI_SIG_RSDP,strlen(ACPI_SIG_RSDP))) {
77bf90ed	295	printk(KERN_WARNING "%s: RSDP table signature incorrect\n", __func__);
1da177e4 LT	296	goto out_err;
	297	}
	298
	299	rsdt = (struct acpi_table_rsdt *)
beacfaac	300	early_ioremap(rsdp->rsdt_physical_address, sizeof(struct acpi_table_rsdt));
1da177e4 LT	301
	302	if (!rsdt) {
	303	printk(KERN_WARNING
	304	"%s: ACPI: Invalid root system description tables (RSDT)\n",
77bf90ed	305	__func__);
1da177e4 LT	306	goto out_err;
	307	}
	308
0e568335	309	header = &rsdt->header;
1da177e4	310
0e568335	311	if (strncmp(header->signature, ACPI_SIG_RSDT, strlen(ACPI_SIG_RSDT))) {
1da177e4 LT	312	printk(KERN_WARNING "ACPI: RSDT signature incorrect\n");
	313	goto out_err;
	314	}
	315
	316	/*
	317	* The number of tables is computed by taking the
	318	* size of all entries (header size minus total
	319	* size of RSDT) divided by the size of each entry
	320	* (4-byte table pointers).
	321	*/
	322	tables = (header->length - sizeof(struct acpi_table_header)) / 4;
	323
	324	if (!tables)
	325	goto out_err;
	326
	327	memcpy(&saved_rsdt, rsdt, sizeof(saved_rsdt));
	328
0e568335	329	if (saved_rsdt.table.header.length > sizeof(saved_rsdt)) {
1da177e4	330	printk(KERN_WARNING "ACPI: Too big length in RSDT: %d\n",
0e568335	331	saved_rsdt.table.header.length);
1da177e4 LT	332	goto out_err;
	333	}
	334
	335	printk("Begin SRAT table scan....\n");
	336
	337	for (i = 0; i < tables; i++) {
	338	/* Map in header, then map in full table length. */
	339	header = (struct acpi_table_header *)
beacfaac	340	early_ioremap(saved_rsdt.table.table_offset_entry[i], sizeof(struct acpi_table_header));
1da177e4 LT	341	if (!header)
	342	break;
	343	header = (struct acpi_table_header *)
beacfaac	344	early_ioremap(saved_rsdt.table.table_offset_entry[i], header->length);
1da177e4 LT	345	if (!header)
	346	break;
	347
0e568335	348	if (strncmp((char *) &header->signature, ACPI_SIG_SRAT, 4))
1da177e4 LT	349	continue;
	350
	351	/* we've found the srat table. don't need to look at any more tables */
	352	return acpi20_parse_srat((struct acpi_table_srat *)header);
	353	}
	354	out_err:
4cfee88a	355	remove_all_active_ranges();
1da177e4 LT	356	printk("failed to get NUMA memory information from SRAT table\n");
	357	return 0;
	358	}