.\" This manpage has been automatically generated by docbook2man 
.\" from a DocBook document.  This tool can be found at:
.\" <http://shell.ipoline.com/~elmert/comp/docbook2X/> 
.\" Please send any bug reports, improvements, comments, patches, 
.\" etc. to Steve Cheng <steve@ggi-project.org>.
.TH "FIND_NEXT_BEST_NODE" "9" "09 October 2005" "" ""

.SH NAME
find_next_best_node \- find the next node to include in a sched_domain
.SH SYNOPSIS
"SYNOPSIS"
.sp
\fB
.sp
int find_next_best_node  (int \fInode\fB, unsigned long * \fIused_nodes\fB);
\fR
.SH "ARGUMENTS"
.TP
\fB\fInode\fB\fR
node whose sched_domain we're building
.TP
\fB\fIused_nodes\fB\fR
nodes already in the sched_domain
.SH "DESCRIPTION"
.PP
Find the next node to include in a given scheduling domain.  Simply
finds the closest node not already in the \fIused_nodes\fR map.
.PP
Should use nodemask_t.