void bli_pool_shrink( dim_t num_blocks_sub, pool_t* pool )
{
pblk_t* block_ptrs;
dim_t num_blocks;
dim_t num_blocks_avail;
dim_t num_blocks_new;
dim_t top_index;
dim_t i;
// Query the total number of blocks presently allocated.
num_blocks = bli_pool_num_blocks( pool );
// Query the top_index of the pool.
top_index = bli_pool_top_index( pool );
// Compute the number of blocks available to be checked out
// (and thus available for removal).
num_blocks_avail = num_blocks - top_index;
// If the requested decrease is more than the number of available
// blocks in the pool, only remove the number of blocks available.
if ( num_blocks_avail < num_blocks_sub )
num_blocks_sub = num_blocks_avail;
// If the effective requested decrease is zero (or the requested
// decrease was negative), return early.
if ( num_blocks_sub < 1 ) return;
// Query the current block_ptrs array.
block_ptrs = bli_pool_block_ptrs( pool );
// Compute the new total number of blocks.
num_blocks_new = num_blocks - num_blocks_sub;
// Free the individual blocks.
for ( i = num_blocks_new; i < num_blocks; ++i )
{
bli_pool_free_block( &(block_ptrs[i]) );
}
// Update the pool_t struct.
bli_pool_set_num_blocks( num_blocks_new, pool );
// Note that after shrinking the pool, num_blocks < block_ptrs_len.
// This means the pool can grow again by num_blocks_sub before
// a re-allocation of block_ptrs is triggered.
}
void bli_pool_finalize( pool_t* pool )
{
pblk_t* block_ptrs;
dim_t num_blocks;
dim_t top_index;
dim_t i;
// NOTE: This implementation assumes that either:
// - all blocks have been checked in by all threads, or
// - some subset of blocks have been checked in and the caller
// is bli_pool_reinit().
// Query the current block_ptrs array.
block_ptrs = bli_pool_block_ptrs( pool );
// Query the total number of blocks presently allocated.
num_blocks = bli_pool_num_blocks( pool );
// Query the top_index of the pool.
top_index = bli_pool_top_index( pool );
// Free the individual blocks currently in the pool.
for ( i = top_index; i < num_blocks; ++i )
{
bli_pool_free_block( &(block_ptrs[i]) );
}
// Free the block_ptrs array.
bli_free( block_ptrs );
// Clear the contents of the pool_t struct.
bli_pool_set_block_ptrs( NULL, pool );
bli_pool_set_block_ptrs_len( 0, pool );
bli_pool_set_num_blocks( 0, pool );
bli_pool_set_top_index( 0, pool );
bli_pool_set_block_size( 0, pool );
bli_pool_set_align_size( 0, pool );
}
void bli_pool_finalize( pool_t* pool )
{
pblk_t* block_ptrs;
dim_t num_blocks;
dim_t i;
// NOTE: This implementation assumes that all blocks have been
// checked in by all threads.
// Query the current block_ptrs array and total number of blocks
// presently allocated.
block_ptrs = bli_pool_block_ptrs( pool );
num_blocks = bli_pool_num_blocks( pool );
// Free the individual blocks.
for ( i = 0; i < num_blocks; ++i )
{
bli_pool_free_block( &(block_ptrs[i]) );
}
// Free the block_ptrs array.
bli_free( block_ptrs );
}
