FIND_NEXT_BEST_NODE
Section: (9)
Updated: 09 October 2005
Index
Return to Main Contents
NAME
find_next_best_node - find the next node to include in a sched_domain
SYNOPSIS
"SYNOPSIS"
int find_next_best_node (int node, unsigned long * used_nodes);
ARGUMENTS
- node
-
node whose sched_domain we're building
- used_nodes
-
nodes already in the sched_domain
DESCRIPTION
Find the next node to include in a given scheduling domain. Simply
finds the closest node not already in the used_nodes map.
Should use nodemask_t.
Index
- NAME
-
- SYNOPSIS
-
- ARGUMENTS
-
- DESCRIPTION
-
This document was created by
man2html,
using the manual pages.
Time: 00:02:09 GMT, October 09, 2005