diff options
author | David Rientjes <rientjes@google.com> | 2009-11-17 17:27:32 -0500 |
---|---|---|
committer | Len Brown <len.brown@intel.com> | 2009-12-16 01:53:19 -0500 |
commit | b552a8c56db8a74ceffdcbb9269664009a81d536 (patch) | |
tree | 13a92ed5b350ca6678530d3cda3d747c401e45f5 /drivers/acpi/numa.c | |
parent | 2345baf4a8a0ac2e7e83f932048bb2d8ec1287e7 (diff) |
ACPI: remove NID_INVAL
NUMA_NO_NODE has been exported globally and thus it can replace NID_INVAL
in the acpi code.
Also removes the unused acpi_unmap_pxm_to_node() function.
[akpm@linux-foundation.org: coding-style fixes]
Cc: Cyrill Gorcunov <gorcunov@openvz.org>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
Reviewed-by: Christoph Lameter <cl@linux-foundation.org>
Signed-off-by: David Rientjes <rientjes@google.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Len Brown <len.brown@intel.com>
Diffstat (limited to 'drivers/acpi/numa.c')
-rw-r--r-- | drivers/acpi/numa.c | 21 |
1 files changed, 6 insertions, 15 deletions
diff --git a/drivers/acpi/numa.c b/drivers/acpi/numa.c index 202dd0c976a3..90f1884e8a51 100644 --- a/drivers/acpi/numa.c +++ b/drivers/acpi/numa.c | |||
@@ -28,6 +28,7 @@ | |||
28 | #include <linux/types.h> | 28 | #include <linux/types.h> |
29 | #include <linux/errno.h> | 29 | #include <linux/errno.h> |
30 | #include <linux/acpi.h> | 30 | #include <linux/acpi.h> |
31 | #include <linux/numa.h> | ||
31 | #include <acpi/acpi_bus.h> | 32 | #include <acpi/acpi_bus.h> |
32 | 33 | ||
33 | #define PREFIX "ACPI: " | 34 | #define PREFIX "ACPI: " |
@@ -40,14 +41,14 @@ static nodemask_t nodes_found_map = NODE_MASK_NONE; | |||
40 | 41 | ||
41 | /* maps to convert between proximity domain and logical node ID */ | 42 | /* maps to convert between proximity domain and logical node ID */ |
42 | static int pxm_to_node_map[MAX_PXM_DOMAINS] | 43 | static int pxm_to_node_map[MAX_PXM_DOMAINS] |
43 | = { [0 ... MAX_PXM_DOMAINS - 1] = NID_INVAL }; | 44 | = { [0 ... MAX_PXM_DOMAINS - 1] = NUMA_NO_NODE }; |
44 | static int node_to_pxm_map[MAX_NUMNODES] | 45 | static int node_to_pxm_map[MAX_NUMNODES] |
45 | = { [0 ... MAX_NUMNODES - 1] = PXM_INVAL }; | 46 | = { [0 ... MAX_NUMNODES - 1] = PXM_INVAL }; |
46 | 47 | ||
47 | int pxm_to_node(int pxm) | 48 | int pxm_to_node(int pxm) |
48 | { | 49 | { |
49 | if (pxm < 0) | 50 | if (pxm < 0) |
50 | return NID_INVAL; | 51 | return NUMA_NO_NODE; |
51 | return pxm_to_node_map[pxm]; | 52 | return pxm_to_node_map[pxm]; |
52 | } | 53 | } |
53 | 54 | ||
@@ -68,9 +69,9 @@ int acpi_map_pxm_to_node(int pxm) | |||
68 | { | 69 | { |
69 | int node = pxm_to_node_map[pxm]; | 70 | int node = pxm_to_node_map[pxm]; |
70 | 71 | ||
71 | if (node < 0){ | 72 | if (node < 0) { |
72 | if (nodes_weight(nodes_found_map) >= MAX_NUMNODES) | 73 | if (nodes_weight(nodes_found_map) >= MAX_NUMNODES) |
73 | return NID_INVAL; | 74 | return NUMA_NO_NODE; |
74 | node = first_unset_node(nodes_found_map); | 75 | node = first_unset_node(nodes_found_map); |
75 | __acpi_map_pxm_to_node(pxm, node); | 76 | __acpi_map_pxm_to_node(pxm, node); |
76 | node_set(node, nodes_found_map); | 77 | node_set(node, nodes_found_map); |
@@ -79,16 +80,6 @@ int acpi_map_pxm_to_node(int pxm) | |||
79 | return node; | 80 | return node; |
80 | } | 81 | } |
81 | 82 | ||
82 | #if 0 | ||
83 | void __cpuinit acpi_unmap_pxm_to_node(int node) | ||
84 | { | ||
85 | int pxm = node_to_pxm_map[node]; | ||
86 | pxm_to_node_map[pxm] = NID_INVAL; | ||
87 | node_to_pxm_map[node] = PXM_INVAL; | ||
88 | node_clear(node, nodes_found_map); | ||
89 | } | ||
90 | #endif /* 0 */ | ||
91 | |||
92 | static void __init | 83 | static void __init |
93 | acpi_table_print_srat_entry(struct acpi_subtable_header *header) | 84 | acpi_table_print_srat_entry(struct acpi_subtable_header *header) |
94 | { | 85 | { |