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 hb_mixdown_t hb_audio_mixdowns[] =
40 { { "Mono", "HB_AMIXDOWN_MONO", "mono", HB_AMIXDOWN_MONO },
41 { "Stereo", "HB_AMIXDOWN_STEREO", "stereo", HB_AMIXDOWN_STEREO },
42 { "Dolby Surround", "HB_AMIXDOWN_DOLBY", "dpl1", HB_AMIXDOWN_DOLBY },
43 { "Dolby Pro Logic II", "HB_AMIXDOWN_DOLBYPLII", "dpl2", HB_AMIXDOWN_DOLBYPLII },
44 { "6-channel discrete", "HB_AMIXDOWN_6CH", "6ch", HB_AMIXDOWN_6CH } };
45 int hb_audio_mixdowns_count = sizeof( hb_audio_mixdowns ) /
46 sizeof( hb_mixdown_t );
48 /**********************************************************************
50 **********************************************************************
51 * Given a numerator (num) and a denominator (den), reduce them to an
52 * equivalent fraction and store the result in x and y.
53 *********************************************************************/
54 void hb_reduce( int *x, int *y, int num, int den )
56 int lower = MIN( num, den );
60 for( i = lower - 1; i > 1; --i )
62 if( ( num % i == 0 ) && ( den % i == 0 ) )
71 /**********************************************************************
73 **********************************************************************
74 * Given the output width (if HB_KEEP_WIDTH) or height
75 * (HB_KEEP_HEIGHT) and the current crop values, calculates the
76 * correct height or width in order to respect the DVD aspect ratio
77 *********************************************************************/
78 void hb_fix_aspect( hb_job_t * job, int keep )
80 hb_title_t * title = job->title;
84 Widths and heights must be multiples of 16 and greater than or
86 Crop values must be multiples of 2, greater than or equal to 0
87 and less than half of the dimension */
88 job->width = MULTIPLE_16( job->width );
89 job->height = MULTIPLE_16( job->height );
90 job->width = MAX( 16, job->width );
91 job->height = MAX( 16, job->height );
92 for( i = 0; i < 4; i++ )
94 job->crop[i] = EVEN( job->crop[i] );
95 job->crop[i] = MAX( 0, job->crop[i] );
99 job->crop[i] = MIN( job->crop[i], ( title->height / 2 ) - 2 );
104 job->crop[i] = MIN( job->crop[i], ( title->width / 2 ) - 2 );
108 if( keep == HB_KEEP_WIDTH )
110 job->height = MULTIPLE_16(
111 (uint64_t) job->width * title->width * HB_ASPECT_BASE *
112 ( title->height - job->crop[0] - job->crop[1] ) /
113 ( (uint64_t) title->height * title->aspect *
114 ( title->width - job->crop[2] - job->crop[3] ) ) );
115 job->height = MAX( 16, job->height );
119 job->width = MULTIPLE_16(
120 (uint64_t) job->height * title->height * title->aspect *
121 ( title->width - job->crop[2] - job->crop[3] ) /
122 ( (uint64_t) title->width * HB_ASPECT_BASE *
123 ( title->height - job->crop[0] - job->crop[1] ) ) );
124 job->width = MAX( 16, job->width );
128 /**********************************************************************
130 **********************************************************************
132 *********************************************************************/
133 int hb_calc_bitrate( hb_job_t * job, int size )
135 int64_t avail = (int64_t) size * 1024 * 1024;
138 int samples_per_frame;
141 hb_title_t * title = job->title;
142 hb_chapter_t * chapter;
145 /* How many overhead bytes are used for each frame
164 /* How many audio samples we put in each frame */
165 switch( job->acodec )
168 case HB_ACODEC_VORBIS:
169 samples_per_frame = 1024;
172 samples_per_frame = 1152;
175 samples_per_frame = 1536;
181 /* Get the duration in seconds */
183 for( i = job->chapter_start; i <= job->chapter_end; i++ )
185 chapter = hb_list_item( title->list_chapter, i - 1 );
186 length += chapter->duration;
192 avail -= length * job->vrate * overhead / job->vrate_base;
194 for( i = 0; job->audios[i] >= 0; i++ )
198 if( job->acodec & HB_ACODEC_AC3 )
200 audio = hb_list_item( title->list_audio, job->audios[i] );
201 abitrate = audio->bitrate / 8;
205 abitrate = job->abitrate * 1000 / 8;
207 avail -= length * abitrate;
210 avail -= length * job->arate * overhead / samples_per_frame;
218 return ( avail / ( 125 * length ) );
221 /**********************************************************************
222 * hb_list implementation
223 **********************************************************************
224 * Basic and slow, but enough for what we need
225 *********************************************************************/
227 #define HB_LIST_DEFAULT_SIZE 20
231 /* Pointers to items in the list */
234 /* How many (void *) allocated in 'items' */
237 /* How many valid pointers in 'items' */
241 /**********************************************************************
243 **********************************************************************
244 * Allocates an empty list ready for HB_LIST_DEFAULT_SIZE items
245 *********************************************************************/
246 hb_list_t * hb_list_init()
250 l = calloc( sizeof( hb_list_t ), 1 );
251 l->items = calloc( HB_LIST_DEFAULT_SIZE * sizeof( void * ), 1 );
252 l->items_alloc = HB_LIST_DEFAULT_SIZE;
257 /**********************************************************************
259 **********************************************************************
260 * Returns the number of items currently in the list
261 *********************************************************************/
262 int hb_list_count( hb_list_t * l )
264 return l->items_count;
267 /**********************************************************************
269 **********************************************************************
270 * Adds an item at the end of the list, making it bigger if necessary.
271 * Can safely be called with a NULL pointer to add, it will be ignored.
272 *********************************************************************/
273 void hb_list_add( hb_list_t * l, void * p )
280 if( l->items_count == l->items_alloc )
282 /* We need a bigger boat */
283 l->items_alloc += HB_LIST_DEFAULT_SIZE;
284 l->items = realloc( l->items,
285 l->items_alloc * sizeof( void * ) );
288 l->items[l->items_count] = p;
292 /**********************************************************************
294 **********************************************************************
295 * Remove an item from the list. Bad things will happen if called
296 * with a NULL pointer or if the item is not in the list.
297 *********************************************************************/
298 void hb_list_rem( hb_list_t * l, void * p )
302 /* Find the item in the list */
303 for( i = 0; i < l->items_count; i++ )
305 if( l->items[i] == p )
311 /* Shift all items after it sizeof( void * ) bytes earlier */
312 memmove( &l->items[i], &l->items[i+1],
313 ( l->items_count - i - 1 ) * sizeof( void * ) );
318 /**********************************************************************
320 **********************************************************************
321 * Returns item at position i, or NULL if there are not that many
323 *********************************************************************/
324 void * hb_list_item( hb_list_t * l, int i )
326 if( i < 0 || i >= l->items_count )
334 /**********************************************************************
336 **********************************************************************
337 * Assuming all items are of type hb_buffer_t, returns the total
338 * number of bytes in the list
339 *********************************************************************/
340 int hb_list_bytes( hb_list_t * l )
347 for( i = 0; i < hb_list_count( l ); i++ )
349 buf = hb_list_item( l, i );
350 ret += buf->size - buf->cur;
356 /**********************************************************************
358 **********************************************************************
359 * Assuming all items are of type hb_buffer_t, copy <size> bytes from
360 * the list to <dst>, keeping the list unmodified.
361 *********************************************************************/
362 void hb_list_seebytes( hb_list_t * l, uint8_t * dst, int size )
369 for( i = 0, copied = 0; copied < size; i++ )
371 buf = hb_list_item( l, i );
372 copying = MIN( buf->size - buf->cur, size - copied );
373 memcpy( &dst[copied], &buf->data[buf->cur], copying );
378 /**********************************************************************
380 **********************************************************************
381 * Assuming all items are of type hb_buffer_t, copy <size> bytes from
382 * the list to <dst>. What's copied is removed from the list.
383 * The variable pointed by <pts> is set to the PTS of the buffer the
384 * first byte has been got from.
385 * The variable pointed by <pos> is set to the position of that byte
387 *********************************************************************/
388 void hb_list_getbytes( hb_list_t * l, uint8_t * dst, int size,
389 uint64_t * pts, uint64_t * pos )
396 /* So we won't have to deal with NULL pointers */
397 uint64_t dummy1, dummy2;
399 if( !pts ) pts = &dummy1;
400 if( !pos ) pos = &dummy2;
402 for( copied = 0, has_pts = 0; copied < size; )
404 buf = hb_list_item( l, 0 );
405 copying = MIN( buf->size - buf->cur, size - copied );
406 memcpy( &dst[copied], &buf->data[buf->cur], copying );
416 if( buf->cur >= buf->size )
418 hb_list_rem( l, buf );
419 hb_buffer_close( &buf );
426 /**********************************************************************
428 **********************************************************************
429 * Assuming all items are of type hb_buffer_t, close them all and
431 *********************************************************************/
432 void hb_list_empty( hb_list_t ** _l )
437 while( ( b = hb_list_item( l, 0 ) ) )
440 hb_buffer_close( &b );
446 /**********************************************************************
448 **********************************************************************
449 * Free memory allocated by hb_list_init. Does NOT free contents of
450 * items still in the list.
451 *********************************************************************/
452 void hb_list_close( hb_list_t ** _l )
462 /**********************************************************************
464 **********************************************************************
465 * If verbose mode is one, print message with timestamp. Messages
466 * longer than 80 characters are stripped ;p
467 *********************************************************************/
468 void hb_log( char * log, ... )
470 char string[82]; /* 80 chars + \n + \0 */
475 if( !getenv( "HB_DEBUG" ) )
477 /* We don't want to print it */
483 now = localtime( &_now );
484 sprintf( string, "[%02d:%02d:%02d] ",
485 now->tm_hour, now->tm_min, now->tm_sec );
487 /* Convert the message to a string */
488 va_start( args, log );
489 vsnprintf( string + 11, 69, log, args );
492 /* Add the end of line */
493 strcat( string, "\n" );
496 fprintf( stderr, "%s", string );
499 /**********************************************************************
501 **********************************************************************
503 *********************************************************************/
504 hb_title_t * hb_title_init( char * dvd, int index )
508 t = calloc( sizeof( hb_title_t ), 1 );
511 t->list_audio = hb_list_init();
512 t->list_chapter = hb_list_init();
513 t->list_subtitle = hb_list_init();
514 strcat( t->dvd, dvd );
519 /**********************************************************************
521 **********************************************************************
523 *********************************************************************/
524 void hb_title_close( hb_title_t ** _t )
526 hb_title_t * t = *_t;
528 hb_chapter_t * chapter;
529 hb_subtitle_t * subtitle;
531 while( ( audio = hb_list_item( t->list_audio, 0 ) ) )
533 hb_list_rem( t->list_audio, audio );
536 hb_list_close( &t->list_audio );
538 while( ( chapter = hb_list_item( t->list_chapter, 0 ) ) )
540 hb_list_rem( t->list_chapter, chapter );
543 hb_list_close( &t->list_chapter );
545 while( ( subtitle = hb_list_item( t->list_subtitle, 0 ) ) )
547 hb_list_rem( t->list_subtitle, subtitle );
550 hb_list_close( &t->list_subtitle );