30 lines
617 B
C
30 lines
617 B
C
|
#include <linux/nodemask.h>
|
||
|
|
#include <linux/module.h>
|
||
|
|
#include <linux/random.h>
|
||
|
|
|
||
|
|
int __next_node_in(int node, const nodemask_t *srcp)
|
||
|
|
{
|
||
|
|
int ret = __next_node(node, srcp);
|
||
|
|
|
||
|
|
if (ret == MAX_NUMNODES)
|
||
|
|
ret = __first_node(srcp);
|
||
|
|
return ret;
|
||
|
|
}
|
||
|
|
EXPORT_SYMBOL(__next_node_in);
|
||
|
|
|
||
|
|
#ifdef CONFIG_NUMA
|
||
|
|
/*
|
||
|
|
* Return the bit number of a random bit set in the nodemask.
|
||
|
|
* (returns NUMA_NO_NODE if nodemask is empty)
|
||
|
|
*/
|
||
|
|
int node_random(const nodemask_t *maskp)
|
||
|
|
{
|
||
|
|
int w, bit = NUMA_NO_NODE;
|
||
|
|
|
||
|
|
w = nodes_weight(*maskp);
|
||
|
|
if (w)
|
||
|
|
bit = bitmap_ord_to_pos(maskp->bits,
|
||
|
|
get_random_int() % w, MAX_NUMNODES);
|
||
|
|
return bit;
|
||
|
|
}
|
||
|
|
#endif
|