GitHub-Mirror/linux-bl808
2
0
Fork 0
mirror of https://github.com/Fishwaldo/linux-bl808.git synced 2025-06-17 20:25:19 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

[PATCH] cpumask: add highest_possible_node_id

Browse source 
cpumask: add highest_possible_node_id(), analogous to
highest_possible_processor_id().

[pj@sgi.com: fix typo]
Signed-off-by: Greg Banks <gnb@melbourne.sgi.com>
Signed-off-by: Paul Jackson <pj@sgi.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
This commit is contained in:
Greg Banks 2006-10-02 02:17:39 -07:00 • committed by Linus Torvalds
parent ca8af48676
commit 0f532f3861
2 changed files with 18 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

2
include/linux/nodemask.h
View file

@ -352,6 +352,7 @@ extern nodemask_t node_possible_map;
#define node_possible(node) node_isset((node), node_possible_map) #define node_possible(node) node_isset((node), node_possible_map)
#define first_online_node first_node(node_online_map) #define first_online_node first_node(node_online_map)
#define next_online_node(nid) next_node((nid), node_online_map) #define next_online_node(nid) next_node((nid), node_online_map)
int highest_possible_node_id(void);
#else #else
#define num_online_nodes() 1 #define num_online_nodes() 1
#define num_possible_nodes() 1 #define num_possible_nodes() 1
@ -359,6 +360,7 @@ extern nodemask_t node_possible_map;
#define node_possible(node) ((node) == 0) #define node_possible(node) ((node) == 0)
#define first_online_node 0 #define first_online_node 0
#define next_online_node(nid) (MAX_NUMNODES) #define next_online_node(nid) (MAX_NUMNODES)
#define highest_possible_node_id() 0
#endif #endif
#define any_online_node(mask) \ #define any_online_node(mask) \

16
lib/cpumask.c
View file

@ -43,3 +43,19 @@ int __any_online_cpu(const cpumask_t *mask)
return cpu; return cpu;
} }
EXPORT_SYMBOL(__any_online_cpu); EXPORT_SYMBOL(__any_online_cpu);
#if MAX_NUMNODES > 1
/*
* Find the highest possible node id.
*/
int highest_possible_node_id(void)
{
unsigned int node;
unsigned int highest = 0;
for_each_node_mask(node, node_possible_map)
highest = node;
return highest;
}
EXPORT_SYMBOL(highest_possible_node_id);
#endif