diff options
author | Yinghai Lu <yinghai@kernel.org> | 2014-01-26 16:01:42 -0500 |
---|---|---|
committer | Ingo Molnar <mingo@kernel.org> | 2014-02-09 09:32:31 -0500 |
commit | ba6a328f7dfc95b20df5e0eb33c698187e997190 (patch) | |
tree | c881a44f413b591ada817e44b1d6374adbd8e643 /arch/x86/mm | |
parent | 494479038d97f1b9f76fc633a360a681acdf035c (diff) |
x86/mm: Avoid duplicated pxm_to_node() calls
In slit init code, too many pxm_to_node() function calls are done.
We can store from_node/to_node instead of keep calling
pxm_to_node().
- Before this patch: pxm_to_node() is called n*(1+n*3) times.
- After this patch: pxm_to_node() is called n*(1+n) times.
for 8 sockets, it will be 72 instead of 200.
for 32 sockets, it will be 1056 instead of 3104.
Signed-off-by: Yinghai Lu <yinghai@kernel.org>
Cc: Toshi Kani <toshi.kani@hp.com>
Cc: David Rientjes <rientjes@google.com>
Link: http://lkml.kernel.org/r/1390770102-4007-1-git-send-email-yinghai@kernel.org
Signed-off-by: Ingo Molnar <mingo@kernel.org>
Diffstat (limited to 'arch/x86/mm')
-rw-r--r-- | arch/x86/mm/srat.c | 12 |
1 files changed, 9 insertions, 3 deletions
diff --git a/arch/x86/mm/srat.c b/arch/x86/mm/srat.c index 1953e9c9391a..66338a60aa6e 100644 --- a/arch/x86/mm/srat.c +++ b/arch/x86/mm/srat.c | |||
@@ -52,12 +52,18 @@ void __init acpi_numa_slit_init(struct acpi_table_slit *slit) | |||
52 | int i, j; | 52 | int i, j; |
53 | 53 | ||
54 | for (i = 0; i < slit->locality_count; i++) { | 54 | for (i = 0; i < slit->locality_count; i++) { |
55 | if (pxm_to_node(i) == NUMA_NO_NODE) | 55 | const int from_node = pxm_to_node(i); |
56 | |||
57 | if (from_node == NUMA_NO_NODE) | ||
56 | continue; | 58 | continue; |
59 | |||
57 | for (j = 0; j < slit->locality_count; j++) { | 60 | for (j = 0; j < slit->locality_count; j++) { |
58 | if (pxm_to_node(j) == NUMA_NO_NODE) | 61 | const int to_node = pxm_to_node(j); |
62 | |||
63 | if (to_node == NUMA_NO_NODE) | ||
59 | continue; | 64 | continue; |
60 | numa_set_distance(pxm_to_node(i), pxm_to_node(j), | 65 | |
66 | numa_set_distance(from_node, to_node, | ||
61 | slit->entry[slit->locality_count * i + j]); | 67 | slit->entry[slit->locality_count * i + j]); |
62 | } | 68 | } |
63 | } | 69 | } |