.\" 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 "HTB_NEXT_RB_NODE" "" "06 October 2005" "" ""

.SH NAME
htb_next_rb_node \- finds next node in binary tree
.SH SYNOPSIS
"SYNOPSIS"
.sp
\fB
.sp
void htb_next_rb_node  (struct rb_node ** \fIn\fB);
\fR
.SH "ARGUMENTS"
.TP
\fB\fIn\fB\fR
-- undescribed --
.SH "DESCRIPTION"
.PP
.PP
When we are past last key we return NULL.
Average complexity is 2 steps per call.