FIND_NEXT_RESERVABLE_WINDOW

NAME

SYNOPSIS

int find_next_reservable_window (struct ext3_reserve_window_node * search_head, struct ext3_reserve_window_node * my_rsv, struct super_block * sb, int start_block, int last_block);  

ARGUMENTS

search_head

the head of the searching list; This is not necessarily the list head of the whole filesystem

my_rsv

-- undescribed --

sb

-- undescribed --

start_block

-- undescribed --

last_block

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.

DESCRIPTION

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.  

IT DOES NOT ALLOCATE THE RESERVATION WINDOW FOR NOW

alloc_new_reservation will do the work later.  

DESCRIPTION

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.  

DESCRIPTION

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.

Index

NAME

SYNOPSIS

ARGUMENTS

DESCRIPTION

IT DOES NOT ALLOCATE THE RESERVATION WINDOW FOR NOW

DESCRIPTION

DESCRIPTION