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

.SH NAME
bitmap_find_free_region \- find a contiguous aligned mem region
.SH SYNOPSIS
"SYNOPSIS"
.sp
\fB
.sp
int bitmap_find_free_region  (unsigned long * \fIbitmap\fB, int \fIbits\fB, int \fIorder\fB);
\fR
.SH "ARGUMENTS"
.TP
\fB\fIbitmap\fB\fR
an array of unsigned longs corresponding to the bitmap
.TP
\fB\fIbits\fB\fR
number of bits in the bitmap
.TP
\fB\fIorder\fB\fR
region size to find (size is actually 1<<order)
.SH "DESCRIPTION"
.PP
This is used to allocate a memory region from a bitmap.  The idea is
that the region has to be 1<<order sized and 1<<order aligned (this
makes the search algorithm much faster).
.PP
The region is marked as set bits in the bitmap if a free one is
found.
.PP
Returns either beginning of region or negative error