.\" 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_RESERVABLE_WINDOW" "9" "09 October 2005" "" ""

.SH NAME
find_next_reservable_window \- 
.SH SYNOPSIS
"SYNOPSIS"
.sp
\fB
.sp
int find_next_reservable_window  (struct ext3_reserve_window_node * \fIsearch_head\fB, struct ext3_reserve_window_node * \fImy_rsv\fB, struct super_block * \fIsb\fB, int \fIstart_block\fB, int \fIlast_block\fB);
\fR
.SH "ARGUMENTS"
.TP
\fB\fIsearch_head\fB\fR
the head of the searching list;
This is not necessarily the list head of the whole filesystem
.TP
\fB\fImy_rsv\fB\fR
-- undescribed --
.TP
\fB\fIsb\fB\fR
-- undescribed --
.TP
\fB\fIstart_block\fB\fR
-- undescribed --
.TP
\fB\fIlast_block\fB\fR
the maximum block number that our goal reservable space
could start from. This is normally the last block in this
group. The search will end when we found the start of next
possible reservable space is out of this boundary.
This could handle the cross boundary reservation window
request.
.SH "DESCRIPTION"
.PP
basically we search from the given range, rather than the whole
reservation double linked list, (start_block, last_block)
to find a free region that is of my size and has not
been reserved.
.SH "IT DOES NOT ALLOCATE THE RESERVATION WINDOW FOR NOW"
.PP
\fBalloc_new_reservation\fR will do the work later.
.SH "DESCRIPTION"
.PP
basically we search from the given range, rather than the whole
reservation double linked list, (start_block, last_block)
to find a free region that is of my size and has not
been reserved.
.SH "DESCRIPTION"
.PP
basically we search from the given range, rather than the whole
reservation double linked list, (start_block, last_block)
to find a free region that is of my size and has not
been reserved.