1 /* $Id: fifo.c,v 1.17 2005/10/15 18:05:03 titer Exp $
3 This file is part of the HandBrake source code.
4 Homepage: <http://handbrake.fr/>.
5 It may be used under the terms of the GNU General Public License. */
13 #define FIFO_TIMEOUT 200
19 hb_cond_t * cond_full;
21 hb_cond_t * cond_empty;
31 /* we round the requested buffer size up to the next power of 2 so there can
32 * be at most 32 possible pools when the size is a 32 bit int. To avoid a lot
33 * of slow & error-prone run-time checking we allow for all 32. */
34 #define MAX_BUFFER_POOLS 32
35 /* the buffer pool only exists to avoid the two malloc and two free calls that
36 * it would otherwise take to allocate & free a buffer. but we don't want to
37 * tie up a lot of memory in the pool because this allocator isn't as general
38 * as malloc so memory tied up here puts more pressure on the malloc pool.
39 * A pool of 16 elements will avoid 94% of the malloc/free calls without wasting
41 #define BUFFER_POOL_MAX_ELEMENTS 32
43 struct hb_buffer_pools_s
47 hb_fifo_t *pool[MAX_BUFFER_POOLS];
51 void hb_buffer_pool_init( void )
53 buffers.lock = hb_lock_init();
54 buffers.allocated = 0;
56 /* we allocate pools for sizes 2^10 through 2^25. requests larger than
57 * 2^25 will get passed through to malloc. */
59 for ( i = 10; i < 26; ++i )
61 buffers.pool[i] = hb_fifo_init(BUFFER_POOL_MAX_ELEMENTS, 1);
62 buffers.pool[i]->buffer_size = 1 << i;
64 /* requests smaller than 2^10 are satisfied from the 2^10 pool. */
65 for ( i = 1; i < 10; ++i )
67 buffers.pool[i] = buffers.pool[10];
71 void hb_buffer_pool_free( void )
78 hb_lock(buffers.lock);
80 for( i = 10; i < 26; ++i)
83 while( ( b = hb_fifo_get(buffers.pool[i]) ) )
95 hb_deep_log( 2, "Freed %d buffers of size %d", count,
96 buffers.pool[i]->buffer_size);
100 hb_deep_log( 2, "Allocated %"PRId64" bytes of buffers on this pass and Freed %"PRId64" bytes, "
101 "%"PRId64" bytes leaked", buffers.allocated, freed, buffers.allocated - freed);
102 buffers.allocated = 0;
103 hb_unlock(buffers.lock);
106 static hb_fifo_t *size_to_pool( int size )
109 for ( i = 0; i < 30; ++i )
111 if ( size <= (1 << i) )
113 return buffers.pool[i];
119 hb_buffer_t * hb_buffer_init( int size )
122 hb_fifo_t *buffer_pool = size_to_pool( size );
126 b = hb_fifo_get( buffer_pool );
131 * Zero the contents of the buffer, would be nice if we
132 * didn't have to do this.
134 uint8_t *data = b->data;
135 memset( b, 0, sizeof(hb_buffer_t) );
136 b->alloc = buffer_pool->buffer_size;
144 * No existing buffers, create a new one
146 if( !( b = calloc( sizeof( hb_buffer_t ), 1 ) ) )
148 hb_log( "out of memory" );
153 b->alloc = buffer_pool? buffer_pool->buffer_size : size;
157 #if defined( SYS_DARWIN ) || defined( SYS_FREEBSD ) || defined( SYS_MINGW )
158 b->data = malloc( b->alloc );
159 #elif defined( SYS_CYGWIN )
161 b->data = malloc( b->alloc + 17 );
163 b->data = memalign( 16, b->alloc );
167 hb_log( "out of memory" );
171 hb_lock(buffers.lock);
172 buffers.allocated += b->alloc;
173 hb_unlock(buffers.lock);
178 void hb_buffer_realloc( hb_buffer_t * b, int size )
180 if ( size > b->alloc )
182 uint32_t orig = b->alloc;
183 size = size_to_pool( size )->buffer_size;
184 b->data = realloc( b->data, size );
187 hb_lock(buffers.lock);
188 buffers.allocated += size - orig;
189 hb_unlock(buffers.lock);
193 void hb_buffer_close( hb_buffer_t ** _b )
195 hb_buffer_t * b = *_b;
199 hb_buffer_t * next = b->next;
200 hb_fifo_t *buffer_pool = size_to_pool( b->alloc );
204 if( buffer_pool && b->data && !hb_fifo_is_full( buffer_pool ) )
206 hb_fifo_push_head( buffer_pool, b );
210 // either the pool is full or this size doesn't use a pool
215 hb_lock(buffers.lock);
216 buffers.allocated -= b->alloc;
217 hb_unlock(buffers.lock);
225 void hb_buffer_copy_settings( hb_buffer_t * dst, const hb_buffer_t * src )
227 dst->start = src->start;
228 dst->stop = src->stop;
229 dst->new_chap = src->new_chap;
230 dst->frametype = src->frametype;
231 dst->flags = src->flags;
234 hb_fifo_t * hb_fifo_init( int capacity, int thresh )
237 f = calloc( sizeof( hb_fifo_t ), 1 );
238 f->lock = hb_lock_init();
239 f->cond_full = hb_cond_init();
240 f->cond_empty = hb_cond_init();
241 f->capacity = capacity;
247 int hb_fifo_size_bytes( hb_fifo_t * f )
259 hb_unlock( f->lock );
264 int hb_fifo_size( hb_fifo_t * f )
270 hb_unlock( f->lock );
275 int hb_fifo_is_full( hb_fifo_t * f )
280 ret = ( f->size >= f->capacity );
281 hb_unlock( f->lock );
286 float hb_fifo_percent_full( hb_fifo_t * f )
291 ret = f->size / f->capacity;
292 hb_unlock( f->lock );
297 hb_buffer_t * hb_fifo_get_wait( hb_fifo_t * f )
305 hb_cond_timedwait( f->cond_empty, f->lock, FIFO_TIMEOUT );
308 hb_unlock( f->lock );
316 if( f->wait_full && f->size == f->capacity - f->thresh )
319 hb_cond_signal( f->cond_full );
321 hb_unlock( f->lock );
326 hb_buffer_t * hb_fifo_get( hb_fifo_t * f )
333 hb_unlock( f->lock );
340 if( f->wait_full && f->size == f->capacity - f->thresh )
343 hb_cond_signal( f->cond_full );
345 hb_unlock( f->lock );
350 hb_buffer_t * hb_fifo_see_wait( hb_fifo_t * f )
358 hb_cond_timedwait( f->cond_empty, f->lock, FIFO_TIMEOUT );
361 hb_unlock( f->lock );
366 hb_unlock( f->lock );
371 hb_buffer_t * hb_fifo_see( hb_fifo_t * f )
378 hb_unlock( f->lock );
382 hb_unlock( f->lock );
387 hb_buffer_t * hb_fifo_see2( hb_fifo_t * f )
394 hb_unlock( f->lock );
398 hb_unlock( f->lock );
403 int hb_fifo_full_wait( hb_fifo_t * f )
408 if( f->size >= f->capacity )
411 hb_cond_timedwait( f->cond_full, f->lock, FIFO_TIMEOUT );
413 result = ( f->size < f->capacity );
414 hb_unlock( f->lock );
418 void hb_fifo_push_wait( hb_fifo_t * f, hb_buffer_t * b )
426 if( f->size >= f->capacity )
429 hb_cond_timedwait( f->cond_full, f->lock, FIFO_TIMEOUT );
441 while( f->last->next )
444 f->last = f->last->next;
446 if( f->wait_empty && f->size >= f->thresh )
449 hb_cond_signal( f->cond_empty );
451 hb_unlock( f->lock );
454 void hb_fifo_push( hb_fifo_t * f, hb_buffer_t * b )
472 while( f->last->next )
475 f->last = f->last->next;
477 if( f->wait_empty && f->size >= f->thresh )
480 hb_cond_signal( f->cond_empty );
482 hb_unlock( f->lock );
485 void hb_fifo_push_head( hb_fifo_t * f, hb_buffer_t * b )
498 * If there are a chain of buffers prepend the lot
509 tmp->next = f->first;
517 f->size += ( size + 1 );
519 hb_unlock( f->lock );
522 void hb_fifo_close( hb_fifo_t ** _f )
527 hb_deep_log( 2, "fifo_close: trashing %d buffer(s)", hb_fifo_size( f ) );
528 while( ( b = hb_fifo_get( f ) ) )
530 hb_buffer_close( &b );
533 hb_lock_close( &f->lock );
534 hb_cond_close( &f->cond_empty );
535 hb_cond_close( &f->cond_full );
541 void hb_fifo_flush( hb_fifo_t * f )
545 while( ( b = hb_fifo_get( f ) ) )
547 hb_buffer_close( &b );
550 hb_cond_signal( f->cond_empty );
551 hb_cond_signal( f->cond_full );
552 hb_unlock( f->lock );