[Patch] 3/5 in support of hot-add memory x86_64 arch_find_node x86_64

[Patch] 3/5 in support of hot-add memory x86_64 arch_find_node x86_64

[keith mannthey]

[-- Attachment #1: Type: text/plain, Size: 317 bytes --]

Hello all
  This is a enablement of the generic arch_find_node for x86_64. It uses
the nodes_add date collected from the SRAT to do it's lookup. 

I suspect and i386 version will be needed when I get to that arch with
my work. 

This was built against 2.6.18-rc2.

Signed-off-by:  Keith Mannthey <kmannth@us.ibm.com>

[-- Attachment #2: patch-2.6.18-rc2-arch_find_node_x86_64 --]
[-- Type: text/x-patch, Size: 877 bytes --]

diff -urN orig/arch/x86_64/Kconfig work/arch/x86_64/Kconfig
--- orig/arch/x86_64/Kconfig	2006-07-28 13:57:35.000000000 -0400
+++ work/arch/x86_64/Kconfig	2006-07-28 21:20:16.000000000 -0400
@@ -343,6 +343,10 @@
 	def_bool y
 	depends on MEMORY_HOTPLUG
 
+config ARCH_FIND_NODE
+	def_bool y
+	depends on MEMORY_HOTPLUG
+
 config ARCH_FLATMEM_ENABLE
 	def_bool y
 	depends on !NUMA
diff -urN orig/arch/x86_64/mm/srat.c work/arch/x86_64/mm/srat.c
--- orig/arch/x86_64/mm/srat.c	2006-07-28 13:57:35.000000000 -0400
+++ work/arch/x86_64/mm/srat.c	2006-07-28 21:19:01.000000000 -0400
@@ -450,3 +450,15 @@
 }
 
 EXPORT_SYMBOL(__node_distance);
+
+int arch_find_node(unsigned long start, unsigned long size) 
+{
+	int i, ret = 0;
+	unsigned long end = start+size;
+	
+	for_each_node(i) {
+		if (nodes_add[i].start <= start && nodes_add[i].end >= end)
+			ret = i;
+	}
+	return ret;
+}

Re: [Lhms-devel] [Patch] 3/5 in support of hot-add memory x86_64 arch_find_node x86_64

[Yasunori Goto]

> diff -urN orig/arch/x86_64/mm/srat.c work/arch/x86_64/mm/srat.c
> --- orig/arch/x86_64/mm/srat.c	2006-07-28 13:57:35.000000000 -0400
> +++ work/arch/x86_64/mm/srat.c	2006-07-28 21:19:01.000000000 -0400
> @@ -450,3 +450,15 @@
>  }
>  
>  EXPORT_SYMBOL(__node_distance);
> +
> +int arch_find_node(unsigned long start, unsigned long size) 
> +{
> +	int i, ret = 0;
> +	unsigned long end = start+size;
> +	
> +	for_each_node(i) {
> +		if (nodes_add[i].start <= start && nodes_add[i].end >= end)
> +			ret = i;
> +	}
> +	return ret;
> +}

BTW, does anyone know why nodes_add[] becomes arch dependent code?

I know it is defined in x86-64. But I mean that SRAT is not
arch dependent. It is defined by just ACPI.
However, each arch which uses ACPI has a own code to parse SRAT table.
Is it hard to merge all of them? Are there any special case?

If they can be merged, this code can be written in driver/acpi/numa.c.


Bye.


-- 
Yasunori Goto 

Re: [Lhms-devel] [Patch] 3/5 in support of hot-add memory x86_64 arch_find_node x86_64

[Andi Kleen]

 
> I know it is defined in x86-64. But I mean that SRAT is not
> arch dependent. It is defined by just ACPI.
> However, each arch which uses ACPI has a own code to parse SRAT table.
> Is it hard to merge all of them? Are there any special case?

Node setup is architecture specific and quite different between x86-64
and ia64. I guess one could factor out some common sanity code though, but I'm 
not sure it is worth it. Iirc ia64 doesn't do much sanity checking because
they assume the firmware was written by sane people; x86-64 doesn't have
that luxury.

-Andi