/* assume 1:1 NODE:CPU */ cpu_to_node[i] = i; 
nodeid = nodeids[i]; apicid_to_node[nodeid << dualcore] = i; apicid_to_node[(nodeid << dualcore) + dualcore] = i; 
int __init k8_scan_nodes(unsigned long start, unsigned long end){ 	unsigned long prevbase;	struct node nodes[8];	int nodeid, i, nb; 	int found = 0;	u32 reg;	unsigned numnodes;	nodemask_t nodes_parsed;	nodes_clear(nodes_parsed);	nb = find_northbridge(); 	if (nb < 0) 		return nb;	printk(KERN_INFO "Scanning NUMA topology in Northbridge %d\n", nb); 	reg = read_pci_config(0, nb, 0, 0x60); 	numnodes = ((reg >> 4) & 0xF) + 1;	printk(KERN_INFO "Number of nodes %d\n", numnodes);	memset(&nodes,0,sizeof(nodes)); 	prevbase = 0;	for (i = 0; i < 8; i++) { 		unsigned long base,limit; 		base = read_pci_config(0, nb, 1, 0x40 + i*8);		limit = read_pci_config(0, nb, 1, 0x44 + i*8);		nodeid = limit & 7; 		if ((base & 3) == 0) { 			if (i < numnodes)				printk("Skipping disabled node %d\n", i); 			continue;		} 		if (nodeid >= numnodes) {			printk("Ignoring excess node %d (%lx:%lx)\n", nodeid,			       base, limit); 			continue;		} 		if (!limit) { 			printk(KERN_INFO "Skipping node entry %d (base %lx)\n", i,			       base);			continue;		}		if ((base >> 8) & 3 || (limit >> 8) & 3) {			printk(KERN_ERR "Node %d using interleaving mode %lx/%lx\n", 			       nodeid, (base>>8)&3, (limit>>8) & 3); 			return -1; 		}			if (node_isset(nodeid, nodes_parsed)) { 			printk(KERN_INFO "Node %d already present. Skipping\n", 			       nodeid);			continue;		}		limit >>= 16; 		limit <<= 24; 		limit |= (1<<24)-1;		if (limit > end_pfn << PAGE_SHIFT)			limit = end_pfn << PAGE_SHIFT;		if (limit <= base)			continue; 					base >>= 16;		base <<= 24; 		if (base < start) 			base = start; 		if (limit > end) 			limit = end; 		if (limit == base) { 			printk(KERN_ERR "Empty node %d\n", nodeid); 			continue; 		}		if (limit < base) { 			printk(KERN_ERR "Node %d bogus settings %lx-%lx.\n",			       nodeid, base, limit); 			       			continue;		} 				/* Could sort here, but pun for now. Should not happen anyroads. */		if (prevbase > base) { 			printk(KERN_ERR "Node map not sorted %lx,%lx\n",			       prevbase,base);			return -1;		}					printk(KERN_INFO "Node %d MemBase %016lx Limit %016lx\n", 		       nodeid, base, limit); 				found++;				nodes[nodeid].start = base; 		nodes[nodeid].end = limit;		prevbase = base;		node_set(nodeid, nodes_parsed);	} 	if (!found)		return -1; 	memnode_shift = compute_hash_shift(nodes, numnodes);	if (memnode_shift < 0) { 		printk(KERN_ERR "No NUMA node hash function found. Contact maintainer\n"); 		return -1; 	} 	printk(KERN_INFO "Using node hash shift of %d\n", memnode_shift); 	for (i = 0; i < 8; i++) {		if (nodes[i].start != nodes[i].end) { 			/* assume 1:1 NODE:CPU */			cpu_to_node[i] = i; 			setup_node_bootmem(i, nodes[i].start, nodes[i].end); 		} 	}	numa_init_array();	return 0;} 
4520	/local/tlutelli/issta_data/temp/c/2005_temp/2005/4520/3f098c2605bdf50176b26f4fa724e9b9c99e5242/k8topology.c/buggy/arch/x86_64/mm/k8topology.c