| commit | 08705b89ecb0f4b0ba5735630ef988bd9fd9dd95 | |
| author | David Rientjes <rientjes@google.com> | |
| Sat, 21 Jul 2007 15:10:33 +0000 (21 17:10 +0200) | ||
| committer | Linus Torvalds <torvalds@woody.linux-foundation.org> | |
| Sun, 22 Jul 2007 01:37:10 +0000 (21 18:37 -0700) | ||
| tree | 1b6b51c28cb852dcef4b343c5d8ac0afe276ed0b | treesnapshot (tar.gz zip) |
| parent | 3484d79813707bb6045773953a809abba443dc20 | commitdiff |
x86_64: fake apicid_to_node mapping for fake numa
When we are in the emulated NUMA case, we need to make sure that all existing
apicid_to_node mappings that point to real node ID's now point to the
equivalent fake node ID's.
If we simply iterate over all apicid_to_node[] members for each node, we risk
remapping an entry if it shares a node ID with a real node. Since apicid's
may not be consecutive, we're forced to create an automatic array of
apicid_to_node mappings and then copy it over once we have finished remapping
fake to real nodes.
Signed-off-by: David Rientjes <rientjes@google.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Andi Kleen <ak@suse.de>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
When we are in the emulated NUMA case, we need to make sure that all existing
apicid_to_node mappings that point to real node ID's now point to the
equivalent fake node ID's.
If we simply iterate over all apicid_to_node[] members for each node, we risk
remapping an entry if it shares a node ID with a real node. Since apicid's
may not be consecutive, we're forced to create an automatic array of
apicid_to_node mappings and then copy it over once we have finished remapping
fake to real nodes.
Signed-off-by: David Rientjes <rientjes@google.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Andi Kleen <ak@suse.de>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
| arch/x86_64/mm/srat.c | diffblobblamehistory |