1 /* $Id: common.c,v 1.15 2005/03/17 19:22:47 titer Exp $
3 This file is part of the HandBrake source code.
4 Homepage: <http://handbrake.m0k.org/>.
5 It may be used under the terms of the GNU General Public License. */
13 /**********************************************************************
15 *********************************************************************/
16 hb_rate_t hb_video_rates[] =
17 { { "5", 5400000 }, { "10", 2700000 }, { "12", 2250000 },
18 { "15", 1800000 }, { "23.976", 1126125 }, { "24", 1125000 },
19 { "25", 1080000 }, { "29.97", 900900 } };
20 int hb_video_rates_count = sizeof( hb_video_rates ) /
23 hb_rate_t hb_audio_rates[] =
24 { { "22.05", 22050 }, { "24", 24000 }, { "32", 32000 },
25 { "44.1", 44100 }, { "48", 48000 } };
26 int hb_audio_rates_count = sizeof( hb_audio_rates ) /
28 int hb_audio_rates_default = 3; /* 44100 Hz */
30 hb_rate_t hb_audio_bitrates[] =
31 { { "32", 32 }, { "40", 40 }, { "48", 48 }, { "56", 56 },
32 { "64", 64 }, { "80", 80 }, { "96", 96 }, { "112", 112 },
33 { "128", 128 }, { "160", 160 }, { "192", 192 }, { "224", 224 },
34 { "256", 256 }, { "320", 320 } };
35 int hb_audio_bitrates_count = sizeof( hb_audio_bitrates ) /
37 int hb_audio_bitrates_default = 8; /* 128 kbps */
39 /**********************************************************************
41 **********************************************************************
42 * Given the output width (if HB_KEEP_WIDTH) or height
43 * (HB_KEEP_HEIGHT) and the current crop values, calculates the
44 * correct height or width in order to respect the DVD aspect ratio
45 *********************************************************************/
46 void hb_fix_aspect( hb_job_t * job, int keep )
48 hb_title_t * title = job->title;
52 Widths and heights must be multiples of 16 and greater than or
54 Crop values must be multiples of 2, greater than or equal to 0
55 and less than half of the dimension */
56 job->width = MULTIPLE_16( job->width );
57 job->height = MULTIPLE_16( job->height );
58 job->width = MAX( 16, job->width );
59 job->height = MAX( 16, job->height );
60 for( i = 0; i < 4; i++ )
62 job->crop[i] = EVEN( job->crop[i] );
63 job->crop[i] = MAX( 0, job->crop[i] );
67 job->crop[i] = MIN( job->crop[i], ( title->height / 2 ) - 2 );
72 job->crop[i] = MIN( job->crop[i], ( title->width / 2 ) - 2 );
76 if( keep == HB_KEEP_WIDTH )
78 job->height = MULTIPLE_16(
79 (uint64_t) job->width * title->width * HB_ASPECT_BASE *
80 ( title->height - job->crop[0] - job->crop[1] ) /
81 ( (uint64_t) title->height * title->aspect *
82 ( title->width - job->crop[2] - job->crop[3] ) ) );
83 job->height = MAX( 16, job->height );
87 job->width = MULTIPLE_16(
88 (uint64_t) job->height * title->height * title->aspect *
89 ( title->width - job->crop[2] - job->crop[3] ) /
90 ( (uint64_t) title->width * HB_ASPECT_BASE *
91 ( title->height - job->crop[0] - job->crop[1] ) ) );
92 job->width = MAX( 16, job->width );
96 /**********************************************************************
98 **********************************************************************
100 *********************************************************************/
101 int hb_calc_bitrate( hb_job_t * job, int size )
103 int64_t avail = (int64_t) size * 1024 * 1024;
106 int samples_per_frame;
109 hb_title_t * title = job->title;
110 hb_chapter_t * chapter;
113 /* How many overhead bytes are used for each frame
132 /* How many audio samples we put in each frame */
133 switch( job->acodec )
136 case HB_ACODEC_VORBIS:
137 samples_per_frame = 1024;
140 samples_per_frame = 1152;
143 samples_per_frame = 1536;
149 /* Get the duration in seconds */
151 for( i = job->chapter_start; i <= job->chapter_end; i++ )
153 chapter = hb_list_item( title->list_chapter, i - 1 );
154 length += chapter->duration;
160 avail -= length * job->vrate * overhead / job->vrate_base;
162 for( i = 0; job->audios[i] >= 0; i++ )
166 if( job->acodec & HB_ACODEC_AC3 )
168 audio = hb_list_item( title->list_audio, job->audios[i] );
169 abitrate = audio->bitrate / 8;
173 abitrate = job->abitrate * 1000 / 8;
175 avail -= length * abitrate;
178 avail -= length * job->arate * overhead / samples_per_frame;
186 return ( avail / ( 125 * length ) );
189 /**********************************************************************
190 * hb_list implementation
191 **********************************************************************
192 * Basic and slow, but enough for what we need
193 *********************************************************************/
195 #define HB_LIST_DEFAULT_SIZE 20
199 /* Pointers to items in the list */
202 /* How many (void *) allocated in 'items' */
205 /* How many valid pointers in 'items' */
209 /**********************************************************************
211 **********************************************************************
212 * Allocates an empty list ready for HB_LIST_DEFAULT_SIZE items
213 *********************************************************************/
214 hb_list_t * hb_list_init()
218 l = calloc( sizeof( hb_list_t ), 1 );
219 l->items = calloc( HB_LIST_DEFAULT_SIZE * sizeof( void * ), 1 );
220 l->items_alloc = HB_LIST_DEFAULT_SIZE;
225 /**********************************************************************
227 **********************************************************************
228 * Returns the number of items currently in the list
229 *********************************************************************/
230 int hb_list_count( hb_list_t * l )
232 return l->items_count;
235 /**********************************************************************
237 **********************************************************************
238 * Adds an item at the end of the list, making it bigger if necessary.
239 * Can safely be called with a NULL pointer to add, it will be ignored.
240 *********************************************************************/
241 void hb_list_add( hb_list_t * l, void * p )
248 if( l->items_count == l->items_alloc )
250 /* We need a bigger boat */
251 l->items_alloc += HB_LIST_DEFAULT_SIZE;
252 l->items = realloc( l->items,
253 l->items_alloc * sizeof( void * ) );
256 l->items[l->items_count] = p;
260 /**********************************************************************
262 **********************************************************************
263 * Remove an item from the list. Bad things will happen if called
264 * with a NULL pointer or if the item is not in the list.
265 *********************************************************************/
266 void hb_list_rem( hb_list_t * l, void * p )
270 /* Find the item in the list */
271 for( i = 0; i < l->items_count; i++ )
273 if( l->items[i] == p )
279 /* Shift all items after it sizeof( void * ) bytes earlier */
280 memmove( &l->items[i], &l->items[i+1],
281 ( l->items_count - i - 1 ) * sizeof( void * ) );
286 /**********************************************************************
288 **********************************************************************
289 * Returns item at position i, or NULL if there are not that many
291 *********************************************************************/
292 void * hb_list_item( hb_list_t * l, int i )
294 if( i < 0 || i >= l->items_count )
302 /**********************************************************************
304 **********************************************************************
305 * Assuming all items are of type hb_buffer_t, returns the total
306 * number of bytes in the list
307 *********************************************************************/
308 int hb_list_bytes( hb_list_t * l )
315 for( i = 0; i < hb_list_count( l ); i++ )
317 buf = hb_list_item( l, i );
318 ret += buf->size - buf->cur;
324 /**********************************************************************
326 **********************************************************************
327 * Assuming all items are of type hb_buffer_t, copy <size> bytes from
328 * the list to <dst>, keeping the list unmodified.
329 *********************************************************************/
330 void hb_list_seebytes( hb_list_t * l, uint8_t * dst, int size )
337 for( i = 0, copied = 0; copied < size; i++ )
339 buf = hb_list_item( l, i );
340 copying = MIN( buf->size - buf->cur, size - copied );
341 memcpy( &dst[copied], &buf->data[buf->cur], copying );
346 /**********************************************************************
348 **********************************************************************
349 * Assuming all items are of type hb_buffer_t, copy <size> bytes from
350 * the list to <dst>. What's copied is removed from the list.
351 * The variable pointed by <pts> is set to the PTS of the buffer the
352 * first byte has been got from.
353 * The variable pointed by <pos> is set to the position of that byte
355 *********************************************************************/
356 void hb_list_getbytes( hb_list_t * l, uint8_t * dst, int size,
357 uint64_t * pts, int * pos )
364 /* So we won't have to deal with NULL pointers */
367 if( !pts ) pts = &dummy1;
368 if( !pos ) pos = &dummy2;
370 for( copied = 0, has_pts = 0; copied < size; )
372 buf = hb_list_item( l, 0 );
373 copying = MIN( buf->size - buf->cur, size - copied );
374 memcpy( &dst[copied], &buf->data[buf->cur], copying );
384 if( buf->cur >= buf->size )
386 hb_list_rem( l, buf );
387 hb_buffer_close( &buf );
394 /**********************************************************************
396 **********************************************************************
397 * Assuming all items are of type hb_buffer_t, close them all and
399 *********************************************************************/
400 void hb_list_empty( hb_list_t ** _l )
405 while( ( b = hb_list_item( l, 0 ) ) )
408 hb_buffer_close( &b );
414 /**********************************************************************
416 **********************************************************************
417 * Free memory allocated by hb_list_init. Does NOT free contents of
418 * items still in the list.
419 *********************************************************************/
420 void hb_list_close( hb_list_t ** _l )
430 /**********************************************************************
432 **********************************************************************
433 * If verbose mode is one, print message with timestamp. Messages
434 * longer than 80 characters are stripped ;p
435 *********************************************************************/
436 void hb_log( char * log, ... )
438 char string[82]; /* 80 chars + \n + \0 */
443 if( !getenv( "HB_DEBUG" ) )
445 /* We don't want to print it */
451 now = localtime( &_now );
452 sprintf( string, "[%02d:%02d:%02d] ",
453 now->tm_hour, now->tm_min, now->tm_sec );
455 /* Convert the message to a string */
456 va_start( args, log );
457 vsnprintf( string + 11, 69, log, args );
460 /* Add the end of line */
461 strcat( string, "\n" );
464 fprintf( stderr, "%s", string );
467 /**********************************************************************
469 **********************************************************************
471 *********************************************************************/
472 hb_title_t * hb_title_init( char * dvd, int index )
476 t = calloc( sizeof( hb_title_t ), 1 );
479 t->list_audio = hb_list_init();
480 t->list_chapter = hb_list_init();
481 t->list_subtitle = hb_list_init();
482 strcat( t->dvd, dvd );
487 /**********************************************************************
489 **********************************************************************
491 *********************************************************************/
492 void hb_title_close( hb_title_t ** _t )
494 hb_title_t * t = *_t;
496 hb_list_close( &t->list_audio );
497 hb_list_close( &t->list_chapter );
498 hb_list_close( &t->list_subtitle );