1 /*****************************************************************************
2 * ratecontrol.c: ratecontrol
3 *****************************************************************************
4 * Copyright (C) 2005-2011 x264 project
6 * Authors: Loren Merritt <lorenm@u.washington.edu>
7 * Michael Niedermayer <michaelni@gmx.at>
8 * Gabriel Bouvigne <gabriel.bouvigne@joost.com>
9 * Fiona Glaser <fiona@x264.com>
10 * Måns Rullgård <mru@mru.ath.cx>
12 * This program is free software; you can redistribute it and/or modify
13 * it under the terms of the GNU General Public License as published by
14 * the Free Software Foundation; either version 2 of the License, or
15 * (at your option) any later version.
17 * This program is distributed in the hope that it will be useful,
18 * but WITHOUT ANY WARRANTY; without even the implied warranty of
19 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20 * GNU General Public License for more details.
22 * You should have received a copy of the GNU General Public License
23 * along with this program; if not, write to the Free Software
24 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111, USA.
26 * This program is also available under a commercial proprietary license.
27 * For more information, contact us at licensing@x264.com.
28 *****************************************************************************/
30 #define _ISOC99_SOURCE
31 #undef NDEBUG // always check asserts, the speed effect is far too small to disable them
33 #include "common/common.h"
34 #include "ratecontrol.h"
46 uint64_t expected_bits; /*total expected bits up to the current frame (current one excluded)*/
53 float blurred_complexity;
56 int16_t i_weight_denom[2];
60 int64_t i_cpb_duration;
61 } ratecontrol_entry_t;
71 struct x264_ratecontrol_t
80 double rate_tolerance;
82 int nmb; /* number of macroblocks in a frame */
86 ratecontrol_entry_t *rce;
87 int qp; /* qp for current frame */
88 float qpm; /* qp for current macroblock: precise float for AQ */
89 float qpa_rc; /* average of macroblocks' qp before aq */
90 int qpa_aq; /* average of macroblocks' qp after aq */
91 float qp_novbv; /* QP for the current frame if 1-pass VBV was disabled. */
95 int64_t buffer_fill_final;
96 double buffer_fill; /* planned buffer, if all in-progress frames hit their bit budget */
97 double buffer_rate; /* # of bits added to buffer_fill after each frame */
98 double vbv_max_rate; /* # of bits added to buffer_fill per second */
99 predictor_t *pred; /* predict frame size from satd */
100 int single_frame_vbv;
101 double rate_factor_max_increment; /* Don't allow RF above (CRF + this value). */
106 double cplxr_sum; /* sum of bits*qscale/rceq */
107 double expected_bits_sum; /* sum of qscale2bits after rceq, ratefactor, and overflow, only includes finished frames */
108 int64_t filler_bits_sum; /* sum in bits of finished frames' filler data */
109 double wanted_bits_window; /* target bitrate * window */
111 double short_term_cplxsum;
112 double short_term_cplxcount;
113 double rate_factor_constant;
118 FILE *p_stat_file_out;
119 char *psz_stat_file_tmpname;
120 FILE *p_mbtree_stat_file_out;
121 char *psz_mbtree_stat_file_tmpname;
122 char *psz_mbtree_stat_file_name;
123 FILE *p_mbtree_stat_file_in;
125 int num_entries; /* number of ratecontrol_entry_ts */
126 ratecontrol_entry_t *entry; /* FIXME: copy needed data and free this once init is done */
128 double last_qscale_for[3]; /* last qscale for a specific pict type, used for max_diff & ipb factor stuff */
129 int last_non_b_pict_type;
130 double accum_p_qp; /* for determining I-frame quant */
132 double last_accum_p_norm;
133 double lmin[3]; /* min qscale by frame type */
135 double lstep; /* max change (multiply) in qscale per frame */
136 uint16_t *qp_buffer[2]; /* Global buffers for converting MB-tree quantizer data. */
137 int qpbuf_pos; /* In order to handle pyramid reordering, QP buffer acts as a stack.
138 * This value is the current position (0 or 1). */
141 float frame_size_estimated; /* Access to this variable must be atomic: double is
142 * not atomic on all arches we care about */
143 double frame_size_maximum; /* Maximum frame size due to MinCR */
144 double frame_size_planned;
145 double slice_size_planned;
146 predictor_t (*row_pred)[2];
147 predictor_t row_preds[3][2];
148 predictor_t *pred_b_from_p; /* predict B-frame size from P-frame satd */
149 int bframes; /* # consecutive B-frames before this P-frame */
150 int bframe_bits; /* total cost of those frames */
154 x264_zone_t *prev_zone;
157 int initial_cpb_removal_delay;
158 int initial_cpb_removal_delay_offset;
159 double nrt_first_access_unit; /* nominal removal time */
160 double previous_cpb_final_arrival_time;
161 uint64_t hrd_multiply_denom;
165 static int parse_zones( x264_t *h );
166 static int init_pass2(x264_t *);
167 static float rate_estimate_qscale( x264_t *h );
168 static int update_vbv( x264_t *h, int bits );
169 static void update_vbv_plan( x264_t *h, int overhead );
170 static float predict_size( predictor_t *p, float q, float var );
171 static void update_predictor( predictor_t *p, float q, float var, float bits );
173 #define CMP_OPT_FIRST_PASS( opt, param_val )\
175 if( ( p = strstr( opts, opt "=" ) ) && sscanf( p, opt "=%d" , &i ) && param_val != i )\
177 x264_log( h, X264_LOG_ERROR, "different " opt " setting than first pass (%d vs %d)\n", param_val, i );\
183 * qp = h.264's quantizer
184 * qscale = linearized quantizer = Lagrange multiplier
186 static inline float qp2qscale( float qp )
188 return 0.85f * powf( 2.0f, ( qp - 12.0f ) / 6.0f );
190 static inline float qscale2qp( float qscale )
192 return 12.0f + 6.0f * log2f( qscale/0.85f );
195 /* Texture bitrate is not quite inversely proportional to qscale,
196 * probably due the the changing number of SKIP blocks.
197 * MV bits level off at about qp<=12, because the lambda used
198 * for motion estimation is constant there. */
199 static inline double qscale2bits( ratecontrol_entry_t *rce, double qscale )
203 return (rce->tex_bits + .1) * pow( rce->qscale / qscale, 1.1 )
204 + rce->mv_bits * pow( X264_MAX(rce->qscale, 1) / X264_MAX(qscale, 1), 0.5 )
208 static ALWAYS_INLINE uint32_t ac_energy_var( uint64_t sum_ssd, int shift, x264_frame_t *frame, int i, int b_store )
210 uint32_t sum = sum_ssd;
211 uint32_t ssd = sum_ssd >> 32;
214 frame->i_pixel_sum[i] += sum;
215 frame->i_pixel_ssd[i] += ssd;
217 return ssd - ((uint64_t)sum * sum >> shift);
220 static ALWAYS_INLINE uint32_t ac_energy_plane( x264_t *h, int mb_x, int mb_y, x264_frame_t *frame, int i, int b_chroma, int b_field, int b_store )
222 int w = b_chroma ? 8 : 16;
223 int stride = frame->i_stride[i];
225 ? 16 * mb_x + w * (mb_y&~1) * stride + (mb_y&1) * stride
226 : 16 * mb_x + w * mb_y * stride;
230 ALIGNED_ARRAY_16( pixel, pix,[FENC_STRIDE*8] );
231 h->mc.load_deinterleave_8x8x2_fenc( pix, frame->plane[1] + offset, stride );
232 return ac_energy_var( h->pixf.var[PIXEL_8x8]( pix, FENC_STRIDE ), 6, frame, 1, b_store )
233 + ac_energy_var( h->pixf.var[PIXEL_8x8]( pix+FENC_STRIDE/2, FENC_STRIDE ), 6, frame, 2, b_store );
236 return ac_energy_var( h->pixf.var[PIXEL_16x16]( frame->plane[i] + offset, stride ), 8, frame, i, b_store );
239 // Find the total AC energy of the block in all planes.
240 static NOINLINE uint32_t x264_ac_energy_mb( x264_t *h, int mb_x, int mb_y, x264_frame_t *frame )
242 /* This function contains annoying hacks because GCC has a habit of reordering emms
243 * and putting it after floating point ops. As a result, we put the emms at the end of the
244 * function and make sure that its always called before the float math. Noinline makes
245 * sure no reordering goes on. */
247 if( h->mb.b_adaptive_mbaff )
249 /* We don't know the super-MB mode we're going to pick yet, so
250 * simply try both and pick the lower of the two. */
251 uint32_t var_interlaced, var_progressive;
252 var_interlaced = ac_energy_plane( h, mb_x, mb_y, frame, 0, 0, 1, 1 );
253 var_progressive = ac_energy_plane( h, mb_x, mb_y, frame, 0, 0, 0, 0 );
256 var_interlaced += ac_energy_plane( h, mb_x, mb_y, frame, 1, 0, 1, 1 );
257 var_progressive += ac_energy_plane( h, mb_x, mb_y, frame, 1, 0, 0, 0 );
258 var_interlaced += ac_energy_plane( h, mb_x, mb_y, frame, 2, 0, 1, 1 );
259 var_progressive += ac_energy_plane( h, mb_x, mb_y, frame, 2, 0, 0, 0 );
263 var_interlaced += ac_energy_plane( h, mb_x, mb_y, frame, 1, 1, 1, 1 );
264 var_progressive += ac_energy_plane( h, mb_x, mb_y, frame, 1, 1, 0, 0 );
266 var = X264_MIN( var_interlaced, var_progressive );
270 var = ac_energy_plane( h, mb_x, mb_y, frame, 0, 0, PARAM_INTERLACED, 1 );
273 var += ac_energy_plane( h, mb_x, mb_y, frame, 1, 0, PARAM_INTERLACED, 1 );
274 var += ac_energy_plane( h, mb_x, mb_y, frame, 2, 0, PARAM_INTERLACED, 1 );
277 var += ac_energy_plane( h, mb_x, mb_y, frame, 1, 1, PARAM_INTERLACED, 1 );
283 void x264_adaptive_quant_frame( x264_t *h, x264_frame_t *frame, float *quant_offsets )
285 /* constants chosen to result in approximately the same overall bitrate as without AQ.
286 * FIXME: while they're written in 5 significant digits, they're only tuned to 2. */
289 /* Initialize frame stats */
290 for( int i = 0; i < 3; i++ )
292 frame->i_pixel_sum[i] = 0;
293 frame->i_pixel_ssd[i] = 0;
296 /* Degenerate cases */
297 if( h->param.rc.i_aq_mode == X264_AQ_NONE || h->param.rc.f_aq_strength == 0 )
299 /* Need to init it anyways for MB tree */
300 if( h->param.rc.i_aq_mode && h->param.rc.f_aq_strength == 0 )
304 for( int mb_xy = 0; mb_xy < h->mb.i_mb_count; mb_xy++ )
305 frame->f_qp_offset[mb_xy] = frame->f_qp_offset_aq[mb_xy] = quant_offsets[mb_xy];
306 if( h->frames.b_have_lowres )
307 for( int mb_xy = 0; mb_xy < h->mb.i_mb_count; mb_xy++ )
308 frame->i_inv_qscale_factor[mb_xy] = x264_exp2fix8( frame->f_qp_offset[mb_xy] );
312 memset( frame->f_qp_offset, 0, h->mb.i_mb_count * sizeof(float) );
313 memset( frame->f_qp_offset_aq, 0, h->mb.i_mb_count * sizeof(float) );
314 if( h->frames.b_have_lowres )
315 for( int mb_xy = 0; mb_xy < h->mb.i_mb_count; mb_xy++ )
316 frame->i_inv_qscale_factor[mb_xy] = 256;
319 /* Need variance data for weighted prediction */
320 if( h->param.analyse.i_weighted_pred )
322 for( int mb_y = 0; mb_y < h->mb.i_mb_height; mb_y++ )
323 for( int mb_x = 0; mb_x < h->mb.i_mb_width; mb_x++ )
324 x264_ac_energy_mb( h, mb_x, mb_y, frame );
329 /* Actual adaptive quantization */
332 if( h->param.rc.i_aq_mode == X264_AQ_AUTOVARIANCE )
334 float bit_depth_correction = powf(1 << (BIT_DEPTH-8), 0.5f);
335 float avg_adj_pow2 = 0.f;
336 for( int mb_y = 0; mb_y < h->mb.i_mb_height; mb_y++ )
337 for( int mb_x = 0; mb_x < h->mb.i_mb_width; mb_x++ )
339 uint32_t energy = x264_ac_energy_mb( h, mb_x, mb_y, frame );
340 float qp_adj = powf( energy + 1, 0.125f );
341 frame->f_qp_offset[mb_x + mb_y*h->mb.i_mb_stride] = qp_adj;
343 avg_adj_pow2 += qp_adj * qp_adj;
345 avg_adj /= h->mb.i_mb_count;
346 avg_adj_pow2 /= h->mb.i_mb_count;
347 strength = h->param.rc.f_aq_strength * avg_adj / bit_depth_correction;
348 avg_adj = avg_adj - 0.5f * (avg_adj_pow2 - (14.f * bit_depth_correction)) / avg_adj;
351 strength = h->param.rc.f_aq_strength * 1.0397f;
353 for( int mb_y = 0; mb_y < h->mb.i_mb_height; mb_y++ )
354 for( int mb_x = 0; mb_x < h->mb.i_mb_width; mb_x++ )
357 int mb_xy = mb_x + mb_y*h->mb.i_mb_stride;
358 if( h->param.rc.i_aq_mode == X264_AQ_AUTOVARIANCE )
360 qp_adj = frame->f_qp_offset[mb_xy];
361 qp_adj = strength * (qp_adj - avg_adj);
365 uint32_t energy = x264_ac_energy_mb( h, mb_x, mb_y, frame );
366 qp_adj = strength * (x264_log2( X264_MAX(energy, 1) ) - (14.427f + 2*(BIT_DEPTH-8)));
369 qp_adj += quant_offsets[mb_xy];
370 frame->f_qp_offset[mb_xy] =
371 frame->f_qp_offset_aq[mb_xy] = qp_adj;
372 if( h->frames.b_have_lowres )
373 frame->i_inv_qscale_factor[mb_xy] = x264_exp2fix8(qp_adj);
377 /* Remove mean from SSD calculation */
378 for( int i = 0; i < 3; i++ )
380 uint64_t ssd = frame->i_pixel_ssd[i];
381 uint64_t sum = frame->i_pixel_sum[i];
382 int size = CHROMA444 || !i ? 16 : 8;
383 int width = h->mb.i_mb_width*size;
384 int height = h->mb.i_mb_height*size;
385 frame->i_pixel_ssd[i] = ssd - (sum * sum + width * height / 2) / (width * height);
389 int x264_macroblock_tree_read( x264_t *h, x264_frame_t *frame, float *quant_offsets )
391 x264_ratecontrol_t *rc = h->rc;
392 uint8_t i_type_actual = rc->entry[frame->i_frame].pict_type;
394 if( rc->entry[frame->i_frame].kept_as_ref )
397 if( rc->qpbuf_pos < 0 )
403 if( !fread( &i_type, 1, 1, rc->p_mbtree_stat_file_in ) )
405 if( fread( rc->qp_buffer[rc->qpbuf_pos], sizeof(uint16_t), h->mb.i_mb_count, rc->p_mbtree_stat_file_in ) != h->mb.i_mb_count )
408 if( i_type != i_type_actual && rc->qpbuf_pos == 1 )
410 x264_log( h, X264_LOG_ERROR, "MB-tree frametype %d doesn't match actual frametype %d.\n", i_type, i_type_actual );
413 } while( i_type != i_type_actual );
416 for( int i = 0; i < h->mb.i_mb_count; i++ )
418 frame->f_qp_offset[i] = ((float)(int16_t)endian_fix16( rc->qp_buffer[rc->qpbuf_pos][i] )) * (1/256.0);
419 if( h->frames.b_have_lowres )
420 frame->i_inv_qscale_factor[i] = x264_exp2fix8(frame->f_qp_offset[i]);
425 x264_stack_align( x264_adaptive_quant_frame, h, frame, quant_offsets );
428 x264_log( h, X264_LOG_ERROR, "Incomplete MB-tree stats file.\n" );
432 int x264_reference_build_list_optimal( x264_t *h )
434 ratecontrol_entry_t *rce = h->rc->rce;
435 x264_frame_t *frames[16];
436 x264_weight_t weights[16][3];
439 if( rce->refs != h->i_ref[0] )
442 memcpy( frames, h->fref[0], sizeof(frames) );
443 memcpy( refcount, rce->refcount, sizeof(refcount) );
444 memcpy( weights, h->fenc->weight, sizeof(weights) );
445 memset( &h->fenc->weight[1][0], 0, sizeof(x264_weight_t[15][3]) );
447 /* For now don't reorder ref 0; it seems to lower quality
448 in most cases due to skips. */
449 for( int ref = 1; ref < h->i_ref[0]; ref++ )
454 for( int i = 1; i < h->i_ref[0]; i++ )
455 /* Favor lower POC as a tiebreaker. */
456 COPY2_IF_GT( max, refcount[i], bestref, i );
458 /* FIXME: If there are duplicates from frames other than ref0 then it is possible
459 * that the optimal ordering doesnt place every duplicate. */
461 refcount[bestref] = -1;
462 h->fref[0][ref] = frames[bestref];
463 memcpy( h->fenc->weight[ref], weights[bestref], sizeof(weights[bestref]) );
469 static char *x264_strcat_filename( char *input, char *suffix )
471 char *output = x264_malloc( strlen( input ) + strlen( suffix ) + 1 );
474 strcpy( output, input );
475 strcat( output, suffix );
479 void x264_ratecontrol_init_reconfigurable( x264_t *h, int b_init )
481 x264_ratecontrol_t *rc = h->rc;
482 if( !b_init && rc->b_2pass )
485 if( h->param.rc.i_rc_method == X264_RC_CRF )
487 /* Arbitrary rescaling to make CRF somewhat similar to QP.
488 * Try to compensate for MB-tree's effects as well. */
489 double base_cplx = h->mb.i_mb_count * (h->param.i_bframe ? 120 : 80);
490 double mbtree_offset = h->param.rc.b_mb_tree ? (1.0-h->param.rc.f_qcompress)*13.5 : 0;
491 rc->rate_factor_constant = pow( base_cplx, 1 - rc->qcompress )
492 / qp2qscale( h->param.rc.f_rf_constant + mbtree_offset + QP_BD_OFFSET );
495 if( h->param.rc.i_vbv_max_bitrate > 0 && h->param.rc.i_vbv_buffer_size > 0 )
497 /* We don't support changing the ABR bitrate right now,
498 so if the stream starts as CBR, keep it CBR. */
499 if( rc->b_vbv_min_rate )
500 h->param.rc.i_vbv_max_bitrate = h->param.rc.i_bitrate;
502 if( h->param.rc.i_vbv_buffer_size < (int)(h->param.rc.i_vbv_max_bitrate / rc->fps) )
504 h->param.rc.i_vbv_buffer_size = h->param.rc.i_vbv_max_bitrate / rc->fps;
505 x264_log( h, X264_LOG_WARNING, "VBV buffer size cannot be smaller than one frame, using %d kbit\n",
506 h->param.rc.i_vbv_buffer_size );
509 int vbv_buffer_size = h->param.rc.i_vbv_buffer_size * 1000;
510 int vbv_max_bitrate = h->param.rc.i_vbv_max_bitrate * 1000;
513 if( h->param.i_nal_hrd && b_init )
515 h->sps->vui.hrd.i_cpb_cnt = 1;
516 h->sps->vui.hrd.b_cbr_hrd = h->param.i_nal_hrd == X264_NAL_HRD_CBR;
517 h->sps->vui.hrd.i_time_offset_length = 0;
522 int bitrate = 1000*h->param.rc.i_vbv_max_bitrate;
523 int bufsize = 1000*h->param.rc.i_vbv_buffer_size;
525 // normalize HRD size and rate to the value / scale notation
526 h->sps->vui.hrd.i_bit_rate_scale = x264_clip3( x264_ctz( bitrate ) - BR_SHIFT, 0, 15 );
527 h->sps->vui.hrd.i_bit_rate_value = bitrate >> ( h->sps->vui.hrd.i_bit_rate_scale + BR_SHIFT );
528 h->sps->vui.hrd.i_bit_rate_unscaled = h->sps->vui.hrd.i_bit_rate_value << ( h->sps->vui.hrd.i_bit_rate_scale + BR_SHIFT );
529 h->sps->vui.hrd.i_cpb_size_scale = x264_clip3( x264_ctz( bufsize ) - CPB_SHIFT, 0, 15 );
530 h->sps->vui.hrd.i_cpb_size_value = bufsize >> ( h->sps->vui.hrd.i_cpb_size_scale + CPB_SHIFT );
531 h->sps->vui.hrd.i_cpb_size_unscaled = h->sps->vui.hrd.i_cpb_size_value << ( h->sps->vui.hrd.i_cpb_size_scale + CPB_SHIFT );
537 #define MAX_DURATION 0.5
539 int max_cpb_output_delay = X264_MIN( h->param.i_keyint_max * MAX_DURATION * h->sps->vui.i_time_scale / h->sps->vui.i_num_units_in_tick, INT_MAX );
540 int max_dpb_output_delay = h->sps->vui.i_max_dec_frame_buffering * MAX_DURATION * h->sps->vui.i_time_scale / h->sps->vui.i_num_units_in_tick;
541 int max_delay = (int)(90000.0 * (double)h->sps->vui.hrd.i_cpb_size_unscaled / h->sps->vui.hrd.i_bit_rate_unscaled + 0.5);
543 h->sps->vui.hrd.i_initial_cpb_removal_delay_length = 2 + x264_clip3( 32 - x264_clz( max_delay ), 4, 22 );
544 h->sps->vui.hrd.i_cpb_removal_delay_length = x264_clip3( 32 - x264_clz( max_cpb_output_delay ), 4, 31 );
545 h->sps->vui.hrd.i_dpb_output_delay_length = x264_clip3( 32 - x264_clz( max_dpb_output_delay ), 4, 31 );
549 vbv_buffer_size = h->sps->vui.hrd.i_cpb_size_unscaled;
550 vbv_max_bitrate = h->sps->vui.hrd.i_bit_rate_unscaled;
552 else if( h->param.i_nal_hrd && !b_init )
554 x264_log( h, X264_LOG_WARNING, "VBV parameters cannot be changed when NAL HRD is in use\n" );
557 h->sps->vui.hrd.i_bit_rate_unscaled = vbv_max_bitrate;
558 h->sps->vui.hrd.i_cpb_size_unscaled = vbv_buffer_size;
560 if( rc->b_vbv_min_rate )
561 rc->bitrate = h->param.rc.i_bitrate * 1000.;
562 rc->buffer_rate = vbv_max_bitrate / rc->fps;
563 rc->vbv_max_rate = vbv_max_bitrate;
564 rc->buffer_size = vbv_buffer_size;
565 rc->single_frame_vbv = rc->buffer_rate * 1.1 > rc->buffer_size;
566 rc->cbr_decay = 1.0 - rc->buffer_rate / rc->buffer_size
567 * 0.5 * X264_MAX(0, 1.5 - rc->buffer_rate * rc->fps / rc->bitrate);
568 if( h->param.rc.i_rc_method == X264_RC_CRF && h->param.rc.f_rf_constant_max )
570 rc->rate_factor_max_increment = h->param.rc.f_rf_constant_max - h->param.rc.f_rf_constant;
571 if( rc->rate_factor_max_increment <= 0 )
573 x264_log( h, X264_LOG_WARNING, "CRF max must be greater than CRF\n" );
574 rc->rate_factor_max_increment = 0;
579 if( h->param.rc.f_vbv_buffer_init > 1. )
580 h->param.rc.f_vbv_buffer_init = x264_clip3f( h->param.rc.f_vbv_buffer_init / h->param.rc.i_vbv_buffer_size, 0, 1 );
581 h->param.rc.f_vbv_buffer_init = x264_clip3f( X264_MAX( h->param.rc.f_vbv_buffer_init, rc->buffer_rate / rc->buffer_size ), 0, 1);
582 rc->buffer_fill_final = rc->buffer_size * h->param.rc.f_vbv_buffer_init * h->sps->vui.i_time_scale;
584 rc->b_vbv_min_rate = !rc->b_2pass
585 && h->param.rc.i_rc_method == X264_RC_ABR
586 && h->param.rc.i_vbv_max_bitrate <= h->param.rc.i_bitrate;
591 int x264_ratecontrol_new( x264_t *h )
593 x264_ratecontrol_t *rc;
597 CHECKED_MALLOCZERO( h->rc, h->param.i_threads * sizeof(x264_ratecontrol_t) );
600 rc->b_abr = h->param.rc.i_rc_method != X264_RC_CQP && !h->param.rc.b_stat_read;
601 rc->b_2pass = h->param.rc.i_rc_method == X264_RC_ABR && h->param.rc.b_stat_read;
603 /* FIXME: use integers */
604 if( h->param.i_fps_num > 0 && h->param.i_fps_den > 0 )
605 rc->fps = (float) h->param.i_fps_num / h->param.i_fps_den;
609 if( h->param.rc.b_mb_tree )
611 h->param.rc.f_pb_factor = 1;
615 rc->qcompress = h->param.rc.f_qcompress;
617 rc->bitrate = h->param.rc.i_bitrate * 1000.;
618 rc->rate_tolerance = h->param.rc.f_rate_tolerance;
619 rc->nmb = h->mb.i_mb_count;
620 rc->last_non_b_pict_type = -1;
623 if( h->param.rc.i_rc_method == X264_RC_CRF && h->param.rc.b_stat_read )
625 x264_log( h, X264_LOG_ERROR, "constant rate-factor is incompatible with 2pass.\n" );
629 x264_ratecontrol_init_reconfigurable( h, 1 );
631 if( h->param.i_nal_hrd )
633 uint64_t denom = (uint64_t)h->sps->vui.hrd.i_bit_rate_unscaled * h->sps->vui.i_time_scale;
634 uint64_t num = 180000;
635 x264_reduce_fraction64( &num, &denom );
636 rc->hrd_multiply_denom = 180000 / num;
638 double bits_required = log2( 180000 / rc->hrd_multiply_denom )
639 + log2( h->sps->vui.i_time_scale )
640 + log2( h->sps->vui.hrd.i_cpb_size_unscaled );
641 if( bits_required >= 63 )
643 x264_log( h, X264_LOG_ERROR, "HRD with very large timescale and bufsize not supported\n" );
648 if( rc->rate_tolerance < 0.01 )
650 x264_log( h, X264_LOG_WARNING, "bitrate tolerance too small, using .01\n" );
651 rc->rate_tolerance = 0.01;
654 h->mb.b_variable_qp = rc->b_vbv || h->param.rc.i_aq_mode;
658 /* FIXME ABR_INIT_QP is actually used only in CRF */
659 #define ABR_INIT_QP (( h->param.rc.i_rc_method == X264_RC_CRF ? h->param.rc.f_rf_constant : 24 ) + QP_BD_OFFSET)
660 rc->accum_p_norm = .01;
661 rc->accum_p_qp = ABR_INIT_QP * rc->accum_p_norm;
662 /* estimated ratio that produces a reasonable QP for the first I-frame */
663 rc->cplxr_sum = .01 * pow( 7.0e5, rc->qcompress ) * pow( h->mb.i_mb_count, 0.5 );
664 rc->wanted_bits_window = 1.0 * rc->bitrate / rc->fps;
665 rc->last_non_b_pict_type = SLICE_TYPE_I;
668 rc->ip_offset = 6.0 * log2f( h->param.rc.f_ip_factor );
669 rc->pb_offset = 6.0 * log2f( h->param.rc.f_pb_factor );
670 rc->qp_constant[SLICE_TYPE_P] = h->param.rc.i_qp_constant;
671 rc->qp_constant[SLICE_TYPE_I] = x264_clip3( h->param.rc.i_qp_constant - rc->ip_offset + 0.5, 0, QP_MAX );
672 rc->qp_constant[SLICE_TYPE_B] = x264_clip3( h->param.rc.i_qp_constant + rc->pb_offset + 0.5, 0, QP_MAX );
673 h->mb.ip_offset = rc->ip_offset + 0.5;
675 rc->lstep = pow( 2, h->param.rc.i_qp_step / 6.0 );
676 rc->last_qscale = qp2qscale( 26 );
677 int num_preds = h->param.b_sliced_threads * h->param.i_threads + 1;
678 CHECKED_MALLOC( rc->pred, 5 * sizeof(predictor_t) * num_preds );
679 CHECKED_MALLOC( rc->pred_b_from_p, sizeof(predictor_t) );
680 for( int i = 0; i < 3; i++ )
682 rc->last_qscale_for[i] = qp2qscale( ABR_INIT_QP );
683 rc->lmin[i] = qp2qscale( h->param.rc.i_qp_min );
684 rc->lmax[i] = qp2qscale( h->param.rc.i_qp_max );
685 for( int j = 0; j < num_preds; j++ )
687 rc->pred[i+j*5].coeff= 2.0;
688 rc->pred[i+j*5].count= 1.0;
689 rc->pred[i+j*5].decay= 0.5;
690 rc->pred[i+j*5].offset= 0.0;
692 for( int j = 0; j < 2; j++ )
694 rc->row_preds[i][j].coeff= .25;
695 rc->row_preds[i][j].count= 1.0;
696 rc->row_preds[i][j].decay= 0.5;
697 rc->row_preds[i][j].offset= 0.0;
700 *rc->pred_b_from_p = rc->pred[0];
702 if( parse_zones( h ) < 0 )
704 x264_log( h, X264_LOG_ERROR, "failed to parse zones\n" );
708 /* Load stat file and init 2pass algo */
709 if( h->param.rc.b_stat_read )
711 char *p, *stats_in, *stats_buf;
713 /* read 1st pass stats */
714 assert( h->param.rc.psz_stat_in );
715 stats_buf = stats_in = x264_slurp_file( h->param.rc.psz_stat_in );
718 x264_log( h, X264_LOG_ERROR, "ratecontrol_init: can't open stats file\n" );
721 if( h->param.rc.b_mb_tree )
723 char *mbtree_stats_in = x264_strcat_filename( h->param.rc.psz_stat_in, ".mbtree" );
724 if( !mbtree_stats_in )
726 rc->p_mbtree_stat_file_in = fopen( mbtree_stats_in, "rb" );
727 x264_free( mbtree_stats_in );
728 if( !rc->p_mbtree_stat_file_in )
730 x264_log( h, X264_LOG_ERROR, "ratecontrol_init: can't open mbtree stats file\n" );
735 /* check whether 1st pass options were compatible with current options */
736 if( strncmp( stats_buf, "#options:", 9 ) )
738 x264_log( h, X264_LOG_ERROR, "options list in stats file not valid\n" );
742 float res_factor, res_factor_bits;
746 char *opts = stats_buf;
747 stats_in = strchr( stats_buf, '\n' );
752 if( sscanf( opts, "#options: %dx%d", &i, &j ) != 2 )
754 x264_log( h, X264_LOG_ERROR, "resolution specified in stats file not valid\n" );
757 else if( h->param.rc.b_mb_tree && (i != h->param.i_width || j != h->param.i_height) )
759 x264_log( h, X264_LOG_ERROR, "MB-tree doesn't support different resolution than 1st pass (%dx%d vs %dx%d)\n",
760 h->param.i_width, h->param.i_height, i, j );
763 res_factor = (float)h->param.i_width * h->param.i_height / (i*j);
764 /* Change in bits relative to resolution isn't quite linear on typical sources,
765 * so we'll at least try to roughly approximate this effect. */
766 res_factor_bits = powf( res_factor, 0.7 );
768 if( ( p = strstr( opts, "timebase=" ) ) && sscanf( p, "timebase=%u/%u", &k, &l ) != 2 )
770 x264_log( h, X264_LOG_ERROR, "timebase specified in stats file not valid\n" );
773 if( k != h->param.i_timebase_num || l != h->param.i_timebase_den )
775 x264_log( h, X264_LOG_ERROR, "timebase mismatch with 1st pass (%u/%u vs %u/%u)\n",
776 h->param.i_timebase_num, h->param.i_timebase_den, k, l );
780 CMP_OPT_FIRST_PASS( "bitdepth", BIT_DEPTH );
781 CMP_OPT_FIRST_PASS( "weightp", X264_MAX( 0, h->param.analyse.i_weighted_pred ) );
782 CMP_OPT_FIRST_PASS( "bframes", h->param.i_bframe );
783 CMP_OPT_FIRST_PASS( "b_pyramid", h->param.i_bframe_pyramid );
784 CMP_OPT_FIRST_PASS( "intra_refresh", h->param.b_intra_refresh );
785 CMP_OPT_FIRST_PASS( "open_gop", h->param.b_open_gop );
786 CMP_OPT_FIRST_PASS( "bluray_compat", h->param.b_bluray_compat );
788 if( (p = strstr( opts, "interlaced=" )) )
790 char *current = h->param.b_interlaced ? h->param.b_tff ? "tff" : "bff" : h->param.b_fake_interlaced ? "fake" : "0";
792 sscanf( p, "interlaced=%4s", buf );
793 if( strcmp( current, buf ) )
795 x264_log( h, X264_LOG_ERROR, "different interlaced setting than first pass (%s vs %s)\n", current, buf );
800 if( (p = strstr( opts, "keyint=" )) )
803 char buf[13] = "infinite ";
804 if( h->param.i_keyint_max != X264_KEYINT_MAX_INFINITE )
805 sprintf( buf, "%d ", h->param.i_keyint_max );
806 if( strncmp( p, buf, strlen(buf) ) )
808 x264_log( h, X264_LOG_ERROR, "different keyint setting than first pass (%.*s vs %.*s)\n",
809 strlen(buf)-1, buf, strcspn(p, " "), p );
814 if( strstr( opts, "qp=0" ) && h->param.rc.i_rc_method == X264_RC_ABR )
815 x264_log( h, X264_LOG_WARNING, "1st pass was lossless, bitrate prediction will be inaccurate\n" );
817 if( !strstr( opts, "direct=3" ) && h->param.analyse.i_direct_mv_pred == X264_DIRECT_PRED_AUTO )
819 x264_log( h, X264_LOG_WARNING, "direct=auto not used on the first pass\n" );
820 h->mb.b_direct_auto_write = 1;
823 if( ( p = strstr( opts, "b_adapt=" ) ) && sscanf( p, "b_adapt=%d", &i ) && i >= X264_B_ADAPT_NONE && i <= X264_B_ADAPT_TRELLIS )
824 h->param.i_bframe_adaptive = i;
825 else if( h->param.i_bframe )
827 x264_log( h, X264_LOG_ERROR, "b_adapt method specified in stats file not valid\n" );
831 if( (h->param.rc.b_mb_tree || h->param.rc.i_vbv_buffer_size) && ( p = strstr( opts, "rc_lookahead=" ) ) && sscanf( p, "rc_lookahead=%d", &i ) )
832 h->param.rc.i_lookahead = i;
835 /* find number of pics */
838 for( num_entries = -1; p; num_entries++ )
839 p = strchr( p + 1, ';' );
842 x264_log( h, X264_LOG_ERROR, "empty stats file\n" );
845 rc->num_entries = num_entries;
847 if( h->param.i_frame_total < rc->num_entries && h->param.i_frame_total > 0 )
849 x264_log( h, X264_LOG_WARNING, "2nd pass has fewer frames than 1st pass (%d vs %d)\n",
850 h->param.i_frame_total, rc->num_entries );
852 if( h->param.i_frame_total > rc->num_entries )
854 x264_log( h, X264_LOG_ERROR, "2nd pass has more frames than 1st pass (%d vs %d)\n",
855 h->param.i_frame_total, rc->num_entries );
859 CHECKED_MALLOCZERO( rc->entry, rc->num_entries * sizeof(ratecontrol_entry_t) );
861 /* init all to skipped p frames */
862 for( int i = 0; i < rc->num_entries; i++ )
864 ratecontrol_entry_t *rce = &rc->entry[i];
865 rce->pict_type = SLICE_TYPE_P;
866 rce->qscale = rce->new_qscale = qp2qscale( 20 );
867 rce->misc_bits = rc->nmb + 10;
873 for( int i = 0; i < rc->num_entries; i++ )
875 ratecontrol_entry_t *rce;
883 next= strchr(p, ';');
885 *next++ = 0; //sscanf is unbelievably slow on long strings
886 e = sscanf( p, " in:%d ", &frame_number );
888 if( frame_number < 0 || frame_number >= rc->num_entries )
890 x264_log( h, X264_LOG_ERROR, "bad frame number (%d) at stats line %d\n", frame_number, i );
893 rce = &rc->entry[frame_number];
894 rce->direct_mode = 0;
896 e += sscanf( p, " in:%*d out:%*d type:%c dur:%"SCNd64" cpbdur:%"SCNd64" q:%f tex:%d mv:%d misc:%d imb:%d pmb:%d smb:%d d:%c",
897 &pict_type, &rce->i_duration, &rce->i_cpb_duration, &qp, &rce->tex_bits,
898 &rce->mv_bits, &rce->misc_bits, &rce->i_count, &rce->p_count,
899 &rce->s_count, &rce->direct_mode );
900 rce->tex_bits *= res_factor_bits;
901 rce->mv_bits *= res_factor_bits;
902 rce->misc_bits *= res_factor_bits;
903 rce->i_count *= res_factor;
904 rce->p_count *= res_factor;
905 rce->s_count *= res_factor;
907 p = strstr( p, "ref:" );
911 for( ref = 0; ref < 16; ref++ )
913 if( sscanf( p, " %d", &rce->refcount[ref] ) != 1 )
915 p = strchr( p+1, ' ' );
922 rce->i_weight_denom[0] = rce->i_weight_denom[1] = -1;
923 char *w = strchr( p, 'w' );
926 int count = sscanf( w, "w:%hd,%hd,%hd,%hd,%hd,%hd,%hd,%hd",
927 &rce->i_weight_denom[0], &rce->weight[0][0], &rce->weight[0][1],
928 &rce->i_weight_denom[1], &rce->weight[1][0], &rce->weight[1][1],
929 &rce->weight[2][0], &rce->weight[2][1] );
931 rce->i_weight_denom[1] = -1;
932 else if ( count != 8 )
933 rce->i_weight_denom[0] = rce->i_weight_denom[1] = -1;
936 if( pict_type != 'b' )
937 rce->kept_as_ref = 1;
941 rce->frame_type = X264_TYPE_IDR;
942 rce->pict_type = SLICE_TYPE_I;
945 rce->frame_type = X264_TYPE_I;
946 rce->pict_type = SLICE_TYPE_I;
949 rce->frame_type = X264_TYPE_P;
950 rce->pict_type = SLICE_TYPE_P;
953 rce->frame_type = X264_TYPE_BREF;
954 rce->pict_type = SLICE_TYPE_B;
957 rce->frame_type = X264_TYPE_B;
958 rce->pict_type = SLICE_TYPE_B;
960 default: e = -1; break;
965 x264_log( h, X264_LOG_ERROR, "statistics are damaged at line %d, parser out=%d\n", i, e );
968 rce->qscale = qp2qscale( qp );
972 x264_free( stats_buf );
974 if( h->param.rc.i_rc_method == X264_RC_ABR )
976 if( init_pass2( h ) < 0 )
978 } /* else we're using constant quant, so no need to run the bitrate allocation */
981 /* Open output file */
982 /* If input and output files are the same, output to a temp file
983 * and move it to the real name only when it's complete */
984 if( h->param.rc.b_stat_write )
987 rc->psz_stat_file_tmpname = x264_strcat_filename( h->param.rc.psz_stat_out, ".temp" );
988 if( !rc->psz_stat_file_tmpname )
991 rc->p_stat_file_out = fopen( rc->psz_stat_file_tmpname, "wb" );
992 if( rc->p_stat_file_out == NULL )
994 x264_log( h, X264_LOG_ERROR, "ratecontrol_init: can't open stats file\n" );
998 p = x264_param2string( &h->param, 1 );
1000 fprintf( rc->p_stat_file_out, "#options: %s\n", p );
1002 if( h->param.rc.b_mb_tree && !h->param.rc.b_stat_read )
1004 rc->psz_mbtree_stat_file_tmpname = x264_strcat_filename( h->param.rc.psz_stat_out, ".mbtree.temp" );
1005 rc->psz_mbtree_stat_file_name = x264_strcat_filename( h->param.rc.psz_stat_out, ".mbtree" );
1006 if( !rc->psz_mbtree_stat_file_tmpname || !rc->psz_mbtree_stat_file_name )
1009 rc->p_mbtree_stat_file_out = fopen( rc->psz_mbtree_stat_file_tmpname, "wb" );
1010 if( rc->p_mbtree_stat_file_out == NULL )
1012 x264_log( h, X264_LOG_ERROR, "ratecontrol_init: can't open mbtree stats file\n" );
1018 if( h->param.rc.b_mb_tree && (h->param.rc.b_stat_read || h->param.rc.b_stat_write) )
1020 CHECKED_MALLOC( rc->qp_buffer[0], h->mb.i_mb_count * sizeof(uint16_t) );
1021 if( h->param.i_bframe_pyramid && h->param.rc.b_stat_read )
1022 CHECKED_MALLOC( rc->qp_buffer[1], h->mb.i_mb_count * sizeof(uint16_t) );
1026 for( int i = 0; i<h->param.i_threads; i++ )
1028 h->thread[i]->rc = rc+i;
1032 h->thread[i]->param = h->param;
1033 h->thread[i]->mb.b_variable_qp = h->mb.b_variable_qp;
1034 h->thread[i]->mb.ip_offset = h->mb.ip_offset;
1043 static int parse_zone( x264_t *h, x264_zone_t *z, char *p )
1046 char *tok, UNUSED *saveptr=NULL;
1048 z->f_bitrate_factor = 1;
1049 if( 3 <= sscanf(p, "%d,%d,q=%d%n", &z->i_start, &z->i_end, &z->i_qp, &len) )
1051 else if( 3 <= sscanf(p, "%d,%d,b=%f%n", &z->i_start, &z->i_end, &z->f_bitrate_factor, &len) )
1053 else if( 2 <= sscanf(p, "%d,%d%n", &z->i_start, &z->i_end, &len) )
1057 x264_log( h, X264_LOG_ERROR, "invalid zone: \"%s\"\n", p );
1063 CHECKED_MALLOC( z->param, sizeof(x264_param_t) );
1064 memcpy( z->param, &h->param, sizeof(x264_param_t) );
1065 z->param->param_free = x264_free;
1066 while( (tok = strtok_r( p, ",", &saveptr )) )
1068 char *val = strchr( tok, '=' );
1074 if( x264_param_parse( z->param, tok, val ) )
1076 x264_log( h, X264_LOG_ERROR, "invalid zone param: %s = %s\n", tok, val );
1086 static int parse_zones( x264_t *h )
1088 x264_ratecontrol_t *rc = h->rc;
1089 if( h->param.rc.psz_zones && !h->param.rc.i_zones )
1091 char *psz_zones, *p;
1092 CHECKED_MALLOC( psz_zones, strlen( h->param.rc.psz_zones )+1 );
1093 strcpy( psz_zones, h->param.rc.psz_zones );
1094 h->param.rc.i_zones = 1;
1095 for( p = psz_zones; *p; p++ )
1096 h->param.rc.i_zones += (*p == '/');
1097 CHECKED_MALLOC( h->param.rc.zones, h->param.rc.i_zones * sizeof(x264_zone_t) );
1099 for( int i = 0; i < h->param.rc.i_zones; i++ )
1101 int i_tok = strcspn( p, "/" );
1103 if( parse_zone( h, &h->param.rc.zones[i], p ) )
1107 x264_free( psz_zones );
1110 if( h->param.rc.i_zones > 0 )
1112 for( int i = 0; i < h->param.rc.i_zones; i++ )
1114 x264_zone_t z = h->param.rc.zones[i];
1115 if( z.i_start < 0 || z.i_start > z.i_end )
1117 x264_log( h, X264_LOG_ERROR, "invalid zone: start=%d end=%d\n",
1118 z.i_start, z.i_end );
1121 else if( !z.b_force_qp && z.f_bitrate_factor <= 0 )
1123 x264_log( h, X264_LOG_ERROR, "invalid zone: bitrate_factor=%f\n",
1124 z.f_bitrate_factor );
1129 rc->i_zones = h->param.rc.i_zones + 1;
1130 CHECKED_MALLOC( rc->zones, rc->i_zones * sizeof(x264_zone_t) );
1131 memcpy( rc->zones+1, h->param.rc.zones, (rc->i_zones-1) * sizeof(x264_zone_t) );
1133 // default zone to fall back to if none of the others match
1134 rc->zones[0].i_start = 0;
1135 rc->zones[0].i_end = INT_MAX;
1136 rc->zones[0].b_force_qp = 0;
1137 rc->zones[0].f_bitrate_factor = 1;
1138 CHECKED_MALLOC( rc->zones[0].param, sizeof(x264_param_t) );
1139 memcpy( rc->zones[0].param, &h->param, sizeof(x264_param_t) );
1140 for( int i = 1; i < rc->i_zones; i++ )
1142 if( !rc->zones[i].param )
1143 rc->zones[i].param = rc->zones[0].param;
1152 static x264_zone_t *get_zone( x264_t *h, int frame_num )
1154 for( int i = h->rc->i_zones - 1; i >= 0; i-- )
1156 x264_zone_t *z = &h->rc->zones[i];
1157 if( frame_num >= z->i_start && frame_num <= z->i_end )
1163 void x264_ratecontrol_summary( x264_t *h )
1165 x264_ratecontrol_t *rc = h->rc;
1166 if( rc->b_abr && h->param.rc.i_rc_method == X264_RC_ABR && rc->cbr_decay > .9999 )
1168 double base_cplx = h->mb.i_mb_count * (h->param.i_bframe ? 120 : 80);
1169 double mbtree_offset = h->param.rc.b_mb_tree ? (1.0-h->param.rc.f_qcompress)*13.5 : 0;
1170 x264_log( h, X264_LOG_INFO, "final ratefactor: %.2f\n",
1171 qscale2qp( pow( base_cplx, 1 - rc->qcompress )
1172 * rc->cplxr_sum / rc->wanted_bits_window ) - mbtree_offset - QP_BD_OFFSET );
1176 void x264_ratecontrol_delete( x264_t *h )
1178 x264_ratecontrol_t *rc = h->rc;
1181 if( rc->p_stat_file_out )
1183 b_regular_file = x264_is_regular_file( rc->p_stat_file_out );
1184 fclose( rc->p_stat_file_out );
1185 if( h->i_frame >= rc->num_entries && b_regular_file )
1186 if( rename( rc->psz_stat_file_tmpname, h->param.rc.psz_stat_out ) != 0 )
1188 x264_log( h, X264_LOG_ERROR, "failed to rename \"%s\" to \"%s\"\n",
1189 rc->psz_stat_file_tmpname, h->param.rc.psz_stat_out );
1191 x264_free( rc->psz_stat_file_tmpname );
1193 if( rc->p_mbtree_stat_file_out )
1195 b_regular_file = x264_is_regular_file( rc->p_mbtree_stat_file_out );
1196 fclose( rc->p_mbtree_stat_file_out );
1197 if( h->i_frame >= rc->num_entries && b_regular_file )
1198 if( rename( rc->psz_mbtree_stat_file_tmpname, rc->psz_mbtree_stat_file_name ) != 0 )
1200 x264_log( h, X264_LOG_ERROR, "failed to rename \"%s\" to \"%s\"\n",
1201 rc->psz_mbtree_stat_file_tmpname, rc->psz_mbtree_stat_file_name );
1203 x264_free( rc->psz_mbtree_stat_file_tmpname );
1204 x264_free( rc->psz_mbtree_stat_file_name );
1206 if( rc->p_mbtree_stat_file_in )
1207 fclose( rc->p_mbtree_stat_file_in );
1208 x264_free( rc->pred );
1209 x264_free( rc->pred_b_from_p );
1210 x264_free( rc->entry );
1211 x264_free( rc->qp_buffer[0] );
1212 x264_free( rc->qp_buffer[1] );
1215 x264_free( rc->zones[0].param );
1216 for( int i = 1; i < rc->i_zones; i++ )
1217 if( rc->zones[i].param != rc->zones[0].param && rc->zones[i].param->param_free )
1218 rc->zones[i].param->param_free( rc->zones[i].param );
1219 x264_free( rc->zones );
1224 static void accum_p_qp_update( x264_t *h, float qp )
1226 x264_ratecontrol_t *rc = h->rc;
1227 rc->accum_p_qp *= .95;
1228 rc->accum_p_norm *= .95;
1229 rc->accum_p_norm += 1;
1230 if( h->sh.i_type == SLICE_TYPE_I )
1231 rc->accum_p_qp += qp + rc->ip_offset;
1233 rc->accum_p_qp += qp;
1236 /* Before encoding a frame, choose a QP for it */
1237 void x264_ratecontrol_start( x264_t *h, int i_force_qp, int overhead )
1239 x264_ratecontrol_t *rc = h->rc;
1240 ratecontrol_entry_t *rce = NULL;
1241 x264_zone_t *zone = get_zone( h, h->fenc->i_frame );
1246 if( zone && (!rc->prev_zone || zone->param != rc->prev_zone->param) )
1247 x264_encoder_reconfig( h, zone->param );
1248 rc->prev_zone = zone;
1250 if( h->param.rc.b_stat_read )
1252 int frame = h->fenc->i_frame;
1253 assert( frame >= 0 && frame < rc->num_entries );
1254 rce = h->rc->rce = &h->rc->entry[frame];
1256 if( h->sh.i_type == SLICE_TYPE_B
1257 && h->param.analyse.i_direct_mv_pred == X264_DIRECT_PRED_AUTO )
1259 h->sh.b_direct_spatial_mv_pred = ( rce->direct_mode == 's' );
1260 h->mb.b_direct_auto_read = ( rce->direct_mode == 's' || rce->direct_mode == 't' );
1266 memset( h->fdec->i_row_bits, 0, h->mb.i_mb_height * sizeof(int) );
1267 memset( h->fdec->f_row_qp, 0, h->mb.i_mb_height * sizeof(float) );
1268 memset( h->fdec->f_row_qscale, 0, h->mb.i_mb_height * sizeof(float) );
1269 rc->row_pred = &rc->row_preds[h->sh.i_type];
1270 rc->buffer_rate = h->fenc->i_cpb_duration * rc->vbv_max_rate * h->sps->vui.i_num_units_in_tick / h->sps->vui.i_time_scale;
1271 update_vbv_plan( h, overhead );
1273 const x264_level_t *l = x264_levels;
1274 while( l->level_idc != 0 && l->level_idc != h->param.i_level_idc )
1277 int mincr = l->mincr;
1279 if( h->param.b_bluray_compat )
1282 /* High 10 / High 4:4:4 Predictive doesn't require minCR, so just set the maximum to a large value. */
1283 if( h->sps->i_profile_idc >= PROFILE_HIGH10 )
1284 rc->frame_size_maximum = 1e9;
1287 /* The spec has a bizarre special case for the first frame. */
1288 if( h->i_frame == 0 )
1290 //384 * ( Max( PicSizeInMbs, fR * MaxMBPS ) + MaxMBPS * ( tr( 0 ) - tr,n( 0 ) ) ) / MinCR
1291 double fr = 1. / 172;
1292 int pic_size_in_mbs = h->mb.i_mb_width * h->mb.i_mb_height;
1293 rc->frame_size_maximum = 384 * BIT_DEPTH * X264_MAX( pic_size_in_mbs, fr*l->mbps ) / mincr;
1297 //384 * MaxMBPS * ( tr( n ) - tr( n - 1 ) ) / MinCR
1298 rc->frame_size_maximum = 384 * BIT_DEPTH * ((double)h->fenc->i_cpb_duration * h->sps->vui.i_num_units_in_tick / h->sps->vui.i_time_scale) * l->mbps / mincr;
1303 if( h->sh.i_type != SLICE_TYPE_B )
1304 rc->bframes = h->fenc->i_bframes;
1308 q = qscale2qp( rate_estimate_qscale( h ) );
1310 else if( rc->b_2pass )
1312 rce->new_qscale = rate_estimate_qscale( h );
1313 q = qscale2qp( rce->new_qscale );
1317 if( h->sh.i_type == SLICE_TYPE_B && h->fdec->b_kept_as_ref )
1318 q = ( rc->qp_constant[ SLICE_TYPE_B ] + rc->qp_constant[ SLICE_TYPE_P ] ) / 2;
1320 q = rc->qp_constant[ h->sh.i_type ];
1324 if( zone->b_force_qp )
1325 q += zone->i_qp - rc->qp_constant[SLICE_TYPE_P];
1327 q -= 6*log2f( zone->f_bitrate_factor );
1330 if( i_force_qp != X264_QP_AUTO )
1333 q = x264_clip3f( q, h->param.rc.i_qp_min, h->param.rc.i_qp_max );
1337 rc->qp = x264_clip3( q + 0.5f, 0, QP_MAX );
1338 h->fdec->f_qp_avg_rc =
1339 h->fdec->f_qp_avg_aq =
1342 rce->new_qp = rc->qp;
1344 accum_p_qp_update( h, rc->qpm );
1346 if( h->sh.i_type != SLICE_TYPE_B )
1347 rc->last_non_b_pict_type = h->sh.i_type;
1350 static float predict_row_size( x264_t *h, int y, float qscale )
1352 /* average between two predictors:
1353 * absolute SATD, and scaled bit cost of the colocated row in the previous frame */
1354 x264_ratecontrol_t *rc = h->rc;
1355 float pred_s = predict_size( rc->row_pred[0], qscale, h->fdec->i_row_satd[y] );
1356 if( h->sh.i_type == SLICE_TYPE_I || qscale >= h->fref[0][0]->f_row_qscale[y] )
1358 if( h->sh.i_type == SLICE_TYPE_P
1359 && h->fref[0][0]->i_type == h->fdec->i_type
1360 && h->fref[0][0]->f_row_qscale[y] > 0
1361 && h->fref[0][0]->i_row_satd[y] > 0
1362 && (abs(h->fref[0][0]->i_row_satd[y] - h->fdec->i_row_satd[y]) < h->fdec->i_row_satd[y]/2))
1364 float pred_t = h->fref[0][0]->i_row_bits[y] * h->fdec->i_row_satd[y] / h->fref[0][0]->i_row_satd[y]
1365 * h->fref[0][0]->f_row_qscale[y] / qscale;
1366 return (pred_s + pred_t) * 0.5f;
1370 /* Our QP is lower than the reference! */
1373 float pred_intra = predict_size( rc->row_pred[1], qscale, h->fdec->i_row_satds[0][0][y] );
1374 /* Sum: better to overestimate than underestimate by using only one of the two predictors. */
1375 return pred_intra + pred_s;
1379 static int row_bits_so_far( x264_t *h, int y )
1382 for( int i = h->i_threadslice_start; i <= y; i++ )
1383 bits += h->fdec->i_row_bits[i];
1387 static float predict_row_size_sum( x264_t *h, int y, float qp )
1389 float qscale = qp2qscale( qp );
1390 float bits = row_bits_so_far( h, y );
1391 for( int i = y+1; i < h->i_threadslice_end; i++ )
1392 bits += predict_row_size( h, i, qscale );
1397 * eliminate all use of qp in row ratecontrol: make it entirely qscale-based.
1398 * make this function stop being needlessly O(N^2)
1399 * update more often than once per row? */
1400 void x264_ratecontrol_mb( x264_t *h, int bits )
1402 x264_ratecontrol_t *rc = h->rc;
1403 const int y = h->mb.i_mb_y;
1405 h->fdec->i_row_bits[y] += bits;
1406 rc->qpa_aq += h->mb.i_qp;
1408 if( h->mb.i_mb_x != h->mb.i_mb_width - 1 )
1412 rc->qpa_rc += rc->qpm * h->mb.i_mb_width;
1417 float qscale = qp2qscale( rc->qpm );
1418 h->fdec->f_row_qp[y] = rc->qpm;
1419 h->fdec->f_row_qscale[y] = qscale;
1421 update_predictor( rc->row_pred[0], qscale, h->fdec->i_row_satd[y], h->fdec->i_row_bits[y] );
1422 if( h->sh.i_type == SLICE_TYPE_P && rc->qpm < h->fref[0][0]->f_row_qp[y] )
1423 update_predictor( rc->row_pred[1], qscale, h->fdec->i_row_satds[0][0][y], h->fdec->i_row_bits[y] );
1425 /* update ratecontrol per-mbpair in MBAFF */
1426 if( SLICE_MBAFF && !(y&1) )
1429 /* tweak quality based on difference from predicted size */
1430 if( y < h->i_threadslice_end-1 )
1432 float prev_row_qp = h->fdec->f_row_qp[y];
1433 float qp_min = X264_MAX( prev_row_qp - h->param.rc.i_qp_step, h->param.rc.i_qp_min );
1434 float qp_absolute_max = h->param.rc.i_qp_max;
1435 if( rc->rate_factor_max_increment )
1436 qp_absolute_max = X264_MIN( qp_absolute_max, rc->qp_novbv + rc->rate_factor_max_increment );
1437 float qp_max = X264_MIN( prev_row_qp + h->param.rc.i_qp_step, qp_absolute_max );
1438 float step_size = 0.5f;
1440 /* B-frames shouldn't use lower QP than their reference frames. */
1441 if( h->sh.i_type == SLICE_TYPE_B )
1443 qp_min = X264_MAX( qp_min, X264_MAX( h->fref[0][0]->f_row_qp[y+1], h->fref[1][0]->f_row_qp[y+1] ) );
1444 rc->qpm = X264_MAX( rc->qpm, qp_min );
1447 float buffer_left_planned = rc->buffer_fill - rc->frame_size_planned;
1448 float slice_size_planned = h->param.b_sliced_threads ? rc->slice_size_planned : rc->frame_size_planned;
1449 float max_frame_error = X264_MAX( 0.05f, 1.0f / h->mb.i_mb_height );
1450 float size_of_other_slices = 0;
1451 if( h->param.b_sliced_threads )
1453 float size_of_other_slices_planned = 0;
1454 for( int i = 0; i < h->param.i_threads; i++ )
1455 if( h != h->thread[i] )
1457 size_of_other_slices += h->thread[i]->rc->frame_size_estimated;
1458 size_of_other_slices_planned += h->thread[i]->rc->slice_size_planned;
1460 float weight = rc->slice_size_planned / rc->frame_size_planned;
1461 size_of_other_slices = (size_of_other_slices - size_of_other_slices_planned) * weight + size_of_other_slices_planned;
1464 /* More threads means we have to be more cautious in letting ratecontrol use up extra bits. */
1465 float rc_tol = buffer_left_planned / h->param.i_threads * rc->rate_tolerance;
1466 float b1 = predict_row_size_sum( h, y, rc->qpm ) + size_of_other_slices;
1468 /* Don't modify the row QPs until a sufficent amount of the bits of the frame have been processed, in case a flat */
1469 /* area at the top of the frame was measured inaccurately. */
1470 if( row_bits_so_far( h, y ) < 0.05f * slice_size_planned )
1473 if( h->sh.i_type != SLICE_TYPE_I )
1476 if( !rc->b_vbv_min_rate )
1477 qp_min = X264_MAX( qp_min, rc->qp_novbv );
1479 while( rc->qpm < qp_max
1480 && ((b1 > rc->frame_size_planned + rc_tol) ||
1481 (rc->buffer_fill - b1 < buffer_left_planned * 0.5f) ||
1482 (b1 > rc->frame_size_planned && rc->qpm < rc->qp_novbv)) )
1484 rc->qpm += step_size;
1485 b1 = predict_row_size_sum( h, y, rc->qpm ) + size_of_other_slices;
1488 while( rc->qpm > qp_min
1489 && (rc->qpm > h->fdec->f_row_qp[0] || rc->single_frame_vbv)
1490 && ((b1 < rc->frame_size_planned * 0.8f && rc->qpm <= prev_row_qp)
1491 || b1 < (rc->buffer_fill - rc->buffer_size + rc->buffer_rate) * 1.1f) )
1493 rc->qpm -= step_size;
1494 b1 = predict_row_size_sum( h, y, rc->qpm ) + size_of_other_slices;
1497 /* avoid VBV underflow or MinCR violation */
1498 while( (rc->qpm < qp_absolute_max)
1499 && ((rc->buffer_fill - b1 < rc->buffer_rate * max_frame_error) ||
1500 (rc->frame_size_maximum - b1 < rc->frame_size_maximum * max_frame_error)))
1502 rc->qpm += step_size;
1503 b1 = predict_row_size_sum( h, y, rc->qpm ) + size_of_other_slices;
1506 h->rc->frame_size_estimated = b1 - size_of_other_slices;
1509 h->rc->frame_size_estimated = predict_row_size_sum( h, y, rc->qpm );
1512 int x264_ratecontrol_qp( x264_t *h )
1515 return x264_clip3( h->rc->qpm + 0.5f, h->param.rc.i_qp_min, h->param.rc.i_qp_max );
1518 int x264_ratecontrol_mb_qp( x264_t *h )
1521 float qp = h->rc->qpm;
1522 if( h->param.rc.i_aq_mode )
1524 /* MB-tree currently doesn't adjust quantizers in unreferenced frames. */
1525 float qp_offset = h->fdec->b_kept_as_ref ? h->fenc->f_qp_offset[h->mb.i_mb_xy] : h->fenc->f_qp_offset_aq[h->mb.i_mb_xy];
1526 /* Scale AQ's effect towards zero in emergency mode. */
1527 if( qp > QP_MAX_SPEC )
1528 qp_offset *= (QP_MAX - qp) / (QP_MAX - QP_MAX_SPEC);
1531 return x264_clip3( qp + 0.5f, h->param.rc.i_qp_min, h->param.rc.i_qp_max );
1534 /* In 2pass, force the same frame types as in the 1st pass */
1535 int x264_ratecontrol_slice_type( x264_t *h, int frame_num )
1537 x264_ratecontrol_t *rc = h->rc;
1538 if( h->param.rc.b_stat_read )
1540 if( frame_num >= rc->num_entries )
1542 /* We could try to initialize everything required for ABR and
1543 * adaptive B-frames, but that would be complicated.
1544 * So just calculate the average QP used so far. */
1545 h->param.rc.i_qp_constant = (h->stat.i_frame_count[SLICE_TYPE_P] == 0) ? 24 + QP_BD_OFFSET
1546 : 1 + h->stat.f_frame_qp[SLICE_TYPE_P] / h->stat.i_frame_count[SLICE_TYPE_P];
1547 rc->qp_constant[SLICE_TYPE_P] = x264_clip3( h->param.rc.i_qp_constant, 0, QP_MAX );
1548 rc->qp_constant[SLICE_TYPE_I] = x264_clip3( (int)( qscale2qp( qp2qscale( h->param.rc.i_qp_constant ) / fabs( h->param.rc.f_ip_factor )) + 0.5 ), 0, QP_MAX );
1549 rc->qp_constant[SLICE_TYPE_B] = x264_clip3( (int)( qscale2qp( qp2qscale( h->param.rc.i_qp_constant ) * fabs( h->param.rc.f_pb_factor )) + 0.5 ), 0, QP_MAX );
1551 x264_log( h, X264_LOG_ERROR, "2nd pass has more frames than 1st pass (%d)\n", rc->num_entries );
1552 x264_log( h, X264_LOG_ERROR, "continuing anyway, at constant QP=%d\n", h->param.rc.i_qp_constant );
1553 if( h->param.i_bframe_adaptive )
1554 x264_log( h, X264_LOG_ERROR, "disabling adaptive B-frames\n" );
1556 for( int i = 0; i < h->param.i_threads; i++ )
1558 h->thread[i]->rc->b_abr = 0;
1559 h->thread[i]->rc->b_2pass = 0;
1560 h->thread[i]->param.rc.i_rc_method = X264_RC_CQP;
1561 h->thread[i]->param.rc.b_stat_read = 0;
1562 h->thread[i]->param.i_bframe_adaptive = 0;
1563 h->thread[i]->param.i_scenecut_threshold = 0;
1564 h->thread[i]->param.rc.b_mb_tree = 0;
1565 if( h->thread[i]->param.i_bframe > 1 )
1566 h->thread[i]->param.i_bframe = 1;
1568 return X264_TYPE_AUTO;
1570 return rc->entry[frame_num].frame_type;
1573 return X264_TYPE_AUTO;
1576 void x264_ratecontrol_set_weights( x264_t *h, x264_frame_t *frm )
1578 ratecontrol_entry_t *rce = &h->rc->entry[frm->i_frame];
1579 if( h->param.analyse.i_weighted_pred <= 0 )
1582 if( rce->i_weight_denom[0] >= 0 )
1583 SET_WEIGHT( frm->weight[0][0], 1, rce->weight[0][0], rce->i_weight_denom[0], rce->weight[0][1] );
1585 if( rce->i_weight_denom[1] >= 0 )
1587 SET_WEIGHT( frm->weight[0][1], 1, rce->weight[1][0], rce->i_weight_denom[1], rce->weight[1][1] );
1588 SET_WEIGHT( frm->weight[0][2], 1, rce->weight[2][0], rce->i_weight_denom[1], rce->weight[2][1] );
1592 /* After encoding one frame, save stats and update ratecontrol state */
1593 int x264_ratecontrol_end( x264_t *h, int bits, int *filler )
1595 x264_ratecontrol_t *rc = h->rc;
1596 const int *mbs = h->stat.frame.i_mb_count;
1600 h->stat.frame.i_mb_count_skip = mbs[P_SKIP] + mbs[B_SKIP];
1601 h->stat.frame.i_mb_count_i = mbs[I_16x16] + mbs[I_8x8] + mbs[I_4x4];
1602 h->stat.frame.i_mb_count_p = mbs[P_L0] + mbs[P_8x8];
1603 for( int i = B_DIRECT; i < B_8x8; i++ )
1604 h->stat.frame.i_mb_count_p += mbs[i];
1606 h->fdec->f_qp_avg_rc = rc->qpa_rc /= h->mb.i_mb_count;
1607 h->fdec->f_qp_avg_aq = (float)rc->qpa_aq / h->mb.i_mb_count;
1609 if( h->param.rc.b_stat_write )
1611 char c_type = h->sh.i_type==SLICE_TYPE_I ? (h->fenc->i_poc==0 ? 'I' : 'i')
1612 : h->sh.i_type==SLICE_TYPE_P ? 'P'
1613 : h->fenc->b_kept_as_ref ? 'B' : 'b';
1614 int dir_frame = h->stat.frame.i_direct_score[1] - h->stat.frame.i_direct_score[0];
1615 int dir_avg = h->stat.i_direct_score[1] - h->stat.i_direct_score[0];
1616 char c_direct = h->mb.b_direct_auto_write ?
1617 ( dir_frame>0 ? 's' : dir_frame<0 ? 't' :
1618 dir_avg>0 ? 's' : dir_avg<0 ? 't' : '-' )
1620 if( fprintf( rc->p_stat_file_out,
1621 "in:%d out:%d type:%c dur:%"PRId64" cpbdur:%"PRId64" q:%.2f tex:%d mv:%d misc:%d imb:%d pmb:%d smb:%d d:%c ref:",
1622 h->fenc->i_frame, h->i_frame,
1623 c_type, h->fenc->i_duration,
1624 h->fenc->i_cpb_duration, rc->qpa_rc,
1625 h->stat.frame.i_tex_bits,
1626 h->stat.frame.i_mv_bits,
1627 h->stat.frame.i_misc_bits,
1628 h->stat.frame.i_mb_count_i,
1629 h->stat.frame.i_mb_count_p,
1630 h->stat.frame.i_mb_count_skip,
1634 /* Only write information for reference reordering once. */
1635 int use_old_stats = h->param.rc.b_stat_read && rc->rce->refs > 1;
1636 for( int i = 0; i < (use_old_stats ? rc->rce->refs : h->i_ref[0]); i++ )
1638 int refcount = use_old_stats ? rc->rce->refcount[i]
1639 : PARAM_INTERLACED ? h->stat.frame.i_mb_count_ref[0][i*2]
1640 + h->stat.frame.i_mb_count_ref[0][i*2+1]
1641 : h->stat.frame.i_mb_count_ref[0][i];
1642 if( fprintf( rc->p_stat_file_out, "%d ", refcount ) < 0 )
1646 if( h->param.analyse.i_weighted_pred >= X264_WEIGHTP_SIMPLE && h->sh.weight[0][0].weightfn )
1648 if( fprintf( rc->p_stat_file_out, "w:%d,%d,%d",
1649 h->sh.weight[0][0].i_denom, h->sh.weight[0][0].i_scale, h->sh.weight[0][0].i_offset ) < 0 )
1651 if( h->sh.weight[0][1].weightfn || h->sh.weight[0][2].weightfn )
1653 if( fprintf( rc->p_stat_file_out, ",%d,%d,%d,%d,%d ",
1654 h->sh.weight[0][1].i_denom, h->sh.weight[0][1].i_scale, h->sh.weight[0][1].i_offset,
1655 h->sh.weight[0][2].i_scale, h->sh.weight[0][2].i_offset ) < 0 )
1658 else if( fprintf( rc->p_stat_file_out, " " ) < 0 )
1662 if( fprintf( rc->p_stat_file_out, ";\n") < 0 )
1665 /* Don't re-write the data in multi-pass mode. */
1666 if( h->param.rc.b_mb_tree && h->fenc->b_kept_as_ref && !h->param.rc.b_stat_read )
1668 uint8_t i_type = h->sh.i_type;
1669 /* Values are stored as big-endian FIX8.8 */
1670 for( int i = 0; i < h->mb.i_mb_count; i++ )
1671 rc->qp_buffer[0][i] = endian_fix16( h->fenc->f_qp_offset[i]*256.0 );
1672 if( fwrite( &i_type, 1, 1, rc->p_mbtree_stat_file_out ) < 1 )
1674 if( fwrite( rc->qp_buffer[0], sizeof(uint16_t), h->mb.i_mb_count, rc->p_mbtree_stat_file_out ) < h->mb.i_mb_count )
1681 if( h->sh.i_type != SLICE_TYPE_B )
1682 rc->cplxr_sum += bits * qp2qscale( rc->qpa_rc ) / rc->last_rceq;
1685 /* Depends on the fact that B-frame's QP is an offset from the following P-frame's.
1686 * Not perfectly accurate with B-refs, but good enough. */
1687 rc->cplxr_sum += bits * qp2qscale( rc->qpa_rc ) / (rc->last_rceq * fabs( h->param.rc.f_pb_factor ));
1689 rc->cplxr_sum *= rc->cbr_decay;
1690 rc->wanted_bits_window += h->fenc->f_duration * rc->bitrate;
1691 rc->wanted_bits_window *= rc->cbr_decay;
1695 rc->expected_bits_sum += qscale2bits( rc->rce, qp2qscale( rc->rce->new_qp ) );
1697 if( h->mb.b_variable_qp )
1699 if( h->sh.i_type == SLICE_TYPE_B )
1701 rc->bframe_bits += bits;
1702 if( h->fenc->b_last_minigop_bframe )
1704 update_predictor( rc->pred_b_from_p, qp2qscale( rc->qpa_rc ),
1705 h->fref[1][h->i_ref[1]-1]->i_satd, rc->bframe_bits / rc->bframes );
1706 rc->bframe_bits = 0;
1711 *filler = update_vbv( h, bits );
1712 rc->filler_bits_sum += *filler * 8;
1714 if( h->sps->vui.b_nal_hrd_parameters_present )
1716 if( h->fenc->i_frame == 0 )
1718 // access unit initialises the HRD
1719 h->fenc->hrd_timing.cpb_initial_arrival_time = 0;
1720 rc->initial_cpb_removal_delay = h->initial_cpb_removal_delay;
1721 rc->initial_cpb_removal_delay_offset = h->initial_cpb_removal_delay_offset;
1722 h->fenc->hrd_timing.cpb_removal_time = rc->nrt_first_access_unit = (double)rc->initial_cpb_removal_delay / 90000;
1726 h->fenc->hrd_timing.cpb_removal_time = rc->nrt_first_access_unit + (double)(h->fenc->i_cpb_delay - h->i_cpb_delay_pir_offset) *
1727 h->sps->vui.i_num_units_in_tick / h->sps->vui.i_time_scale;
1729 double cpb_earliest_arrival_time = h->fenc->hrd_timing.cpb_removal_time - (double)rc->initial_cpb_removal_delay / 90000;
1730 if( h->fenc->b_keyframe )
1732 rc->nrt_first_access_unit = h->fenc->hrd_timing.cpb_removal_time;
1733 rc->initial_cpb_removal_delay = h->initial_cpb_removal_delay;
1734 rc->initial_cpb_removal_delay_offset = h->initial_cpb_removal_delay_offset;
1737 cpb_earliest_arrival_time -= (double)rc->initial_cpb_removal_delay_offset / 90000;
1739 if( h->sps->vui.hrd.b_cbr_hrd )
1740 h->fenc->hrd_timing.cpb_initial_arrival_time = rc->previous_cpb_final_arrival_time;
1742 h->fenc->hrd_timing.cpb_initial_arrival_time = X264_MAX( rc->previous_cpb_final_arrival_time, cpb_earliest_arrival_time );
1744 int filler_bits = *filler ? X264_MAX( (FILLER_OVERHEAD - h->param.b_annexb), *filler )*8 : 0;
1746 h->fenc->hrd_timing.cpb_final_arrival_time = rc->previous_cpb_final_arrival_time = h->fenc->hrd_timing.cpb_initial_arrival_time +
1747 (double)(bits + filler_bits) / h->sps->vui.hrd.i_bit_rate_unscaled;
1749 h->fenc->hrd_timing.dpb_output_time = (double)h->fenc->i_dpb_output_delay * h->sps->vui.i_num_units_in_tick / h->sps->vui.i_time_scale +
1750 h->fenc->hrd_timing.cpb_removal_time;
1755 x264_log( h, X264_LOG_ERROR, "ratecontrol_end: stats file could not be written to\n" );
1759 /****************************************************************************
1761 ***************************************************************************/
1764 * modify the bitrate curve from pass1 for one frame
1766 static double get_qscale(x264_t *h, ratecontrol_entry_t *rce, double rate_factor, int frame_num)
1768 x264_ratecontrol_t *rcc= h->rc;
1769 x264_zone_t *zone = get_zone( h, frame_num );
1771 if( h->param.rc.b_mb_tree )
1773 double timescale = (double)h->sps->vui.i_num_units_in_tick / h->sps->vui.i_time_scale;
1774 q = pow( BASE_FRAME_DURATION / CLIP_DURATION(rce->i_duration * timescale), 1 - h->param.rc.f_qcompress );
1777 q = pow( rce->blurred_complexity, 1 - rcc->qcompress );
1779 // avoid NaN's in the rc_eq
1780 if( !isfinite(q) || rce->tex_bits + rce->mv_bits == 0 )
1781 q = rcc->last_qscale_for[rce->pict_type];
1786 rcc->last_qscale = q;
1791 if( zone->b_force_qp )
1792 q = qp2qscale( zone->i_qp );
1794 q /= zone->f_bitrate_factor;
1800 static double get_diff_limited_q(x264_t *h, ratecontrol_entry_t *rce, double q, int frame_num)
1802 x264_ratecontrol_t *rcc = h->rc;
1803 const int pict_type = rce->pict_type;
1804 x264_zone_t *zone = get_zone( h, frame_num );
1806 // force I/B quants as a function of P quants
1807 const double last_p_q = rcc->last_qscale_for[SLICE_TYPE_P];
1808 const double last_non_b_q= rcc->last_qscale_for[rcc->last_non_b_pict_type];
1809 if( pict_type == SLICE_TYPE_I )
1812 double pq = qp2qscale( rcc->accum_p_qp / rcc->accum_p_norm );
1813 double ip_factor = fabs( h->param.rc.f_ip_factor );
1814 /* don't apply ip_factor if the following frame is also I */
1815 if( rcc->accum_p_norm <= 0 )
1817 else if( h->param.rc.f_ip_factor < 0 )
1819 else if( rcc->accum_p_norm >= 1 )
1822 q = rcc->accum_p_norm * pq / ip_factor + (1 - rcc->accum_p_norm) * iq;
1824 else if( pict_type == SLICE_TYPE_B )
1826 if( h->param.rc.f_pb_factor > 0 )
1828 if( !rce->kept_as_ref )
1829 q *= fabs( h->param.rc.f_pb_factor );
1831 else if( pict_type == SLICE_TYPE_P
1832 && rcc->last_non_b_pict_type == SLICE_TYPE_P
1833 && rce->tex_bits == 0 )
1838 /* last qscale / qdiff stuff */
1839 if( rcc->last_non_b_pict_type == pict_type &&
1840 (pict_type!=SLICE_TYPE_I || rcc->last_accum_p_norm < 1) )
1842 double last_q = rcc->last_qscale_for[pict_type];
1843 double max_qscale = last_q * rcc->lstep;
1844 double min_qscale = last_q / rcc->lstep;
1846 if ( q > max_qscale ) q = max_qscale;
1847 else if( q < min_qscale ) q = min_qscale;
1850 rcc->last_qscale_for[pict_type] = q;
1851 if( pict_type != SLICE_TYPE_B )
1852 rcc->last_non_b_pict_type = pict_type;
1853 if( pict_type == SLICE_TYPE_I )
1855 rcc->last_accum_p_norm = rcc->accum_p_norm;
1856 rcc->accum_p_norm = 0;
1857 rcc->accum_p_qp = 0;
1859 if( pict_type == SLICE_TYPE_P )
1861 float mask = 1 - pow( (float)rce->i_count / rcc->nmb, 2 );
1862 rcc->accum_p_qp = mask * (qscale2qp( q ) + rcc->accum_p_qp);
1863 rcc->accum_p_norm = mask * (1 + rcc->accum_p_norm);
1868 if( zone->b_force_qp )
1869 q = qp2qscale( zone->i_qp );
1871 q /= zone->f_bitrate_factor;
1877 static float predict_size( predictor_t *p, float q, float var )
1879 return (p->coeff*var + p->offset) / (q*p->count);
1882 static void update_predictor( predictor_t *p, float q, float var, float bits )
1887 float old_coeff = p->coeff / p->count;
1888 float new_coeff = bits*q / var;
1889 float new_coeff_clipped = x264_clip3f( new_coeff, old_coeff/range, old_coeff*range );
1890 float new_offset = bits*q - new_coeff_clipped * var;
1891 if( new_offset >= 0 )
1892 new_coeff = new_coeff_clipped;
1895 p->count *= p->decay;
1896 p->coeff *= p->decay;
1897 p->offset *= p->decay;
1899 p->coeff += new_coeff;
1900 p->offset += new_offset;
1903 // update VBV after encoding a frame
1904 static int update_vbv( x264_t *h, int bits )
1907 int bitrate = h->sps->vui.hrd.i_bit_rate_unscaled;
1908 x264_ratecontrol_t *rcc = h->rc;
1909 x264_ratecontrol_t *rct = h->thread[0]->rc;
1910 uint64_t buffer_size = (uint64_t)h->sps->vui.hrd.i_cpb_size_unscaled * h->sps->vui.i_time_scale;
1912 if( rcc->last_satd >= h->mb.i_mb_count )
1913 update_predictor( &rct->pred[h->sh.i_type], qp2qscale( rcc->qpa_rc ), rcc->last_satd, bits );
1918 rct->buffer_fill_final -= (uint64_t)bits * h->sps->vui.i_time_scale;
1920 if( rct->buffer_fill_final < 0 )
1921 x264_log( h, X264_LOG_WARNING, "VBV underflow (frame %d, %.0f bits)\n", h->i_frame, (double)rct->buffer_fill_final / h->sps->vui.i_time_scale );
1922 rct->buffer_fill_final = X264_MAX( rct->buffer_fill_final, 0 );
1923 rct->buffer_fill_final += (uint64_t)bitrate * h->sps->vui.i_num_units_in_tick * h->fenc->i_cpb_duration;
1925 if( h->sps->vui.hrd.b_cbr_hrd && rct->buffer_fill_final > buffer_size )
1927 int64_t scale = (int64_t)h->sps->vui.i_time_scale * 8;
1928 filler = (rct->buffer_fill_final - buffer_size + scale - 1) / scale;
1929 bits = X264_MAX( (FILLER_OVERHEAD - h->param.b_annexb), filler ) * 8;
1930 rct->buffer_fill_final -= (uint64_t)bits * h->sps->vui.i_time_scale;
1933 rct->buffer_fill_final = X264_MIN( rct->buffer_fill_final, buffer_size );
1938 void x264_hrd_fullness( x264_t *h )
1940 x264_ratecontrol_t *rct = h->thread[0]->rc;
1941 uint64_t denom = (uint64_t)h->sps->vui.hrd.i_bit_rate_unscaled * h->sps->vui.i_time_scale / rct->hrd_multiply_denom;
1942 uint64_t cpb_state = rct->buffer_fill_final;
1943 uint64_t cpb_size = (uint64_t)h->sps->vui.hrd.i_cpb_size_unscaled * h->sps->vui.i_time_scale;
1944 uint64_t multiply_factor = 180000 / rct->hrd_multiply_denom;
1946 if( rct->buffer_fill_final < 0 || rct->buffer_fill_final > cpb_size )
1948 x264_log( h, X264_LOG_WARNING, "CPB %s: %.0lf bits in a %.0lf-bit buffer\n",
1949 rct->buffer_fill_final < 0 ? "underflow" : "overflow", (float)rct->buffer_fill_final/denom, (float)cpb_size/denom );
1952 h->initial_cpb_removal_delay = (multiply_factor * cpb_state + denom) / (2*denom);
1953 h->initial_cpb_removal_delay_offset = (multiply_factor * cpb_size + denom) / (2*denom) - h->initial_cpb_removal_delay;
1956 // provisionally update VBV according to the planned size of all frames currently in progress
1957 static void update_vbv_plan( x264_t *h, int overhead )
1959 x264_ratecontrol_t *rcc = h->rc;
1960 rcc->buffer_fill = h->thread[0]->rc->buffer_fill_final / h->sps->vui.i_time_scale;
1961 if( h->i_thread_frames > 1 )
1963 int j = h->rc - h->thread[0]->rc;
1964 for( int i = 1; i < h->i_thread_frames; i++ )
1966 x264_t *t = h->thread[ (j+i)%h->i_thread_frames ];
1967 double bits = t->rc->frame_size_planned;
1968 if( !t->b_thread_active )
1970 bits = X264_MAX(bits, t->rc->frame_size_estimated);
1971 rcc->buffer_fill -= bits;
1972 rcc->buffer_fill = X264_MAX( rcc->buffer_fill, 0 );
1973 rcc->buffer_fill += t->rc->buffer_rate;
1974 rcc->buffer_fill = X264_MIN( rcc->buffer_fill, rcc->buffer_size );
1977 rcc->buffer_fill = X264_MIN( rcc->buffer_fill, rcc->buffer_size );
1978 rcc->buffer_fill -= overhead;
1981 // apply VBV constraints and clip qscale to between lmin and lmax
1982 static double clip_qscale( x264_t *h, int pict_type, double q )
1984 x264_ratecontrol_t *rcc = h->rc;
1985 double lmin = rcc->lmin[pict_type];
1986 double lmax = rcc->lmax[pict_type];
1987 if( rcc->rate_factor_max_increment )
1988 lmax = X264_MIN( lmax, qp2qscale( rcc->qp_novbv + rcc->rate_factor_max_increment ) );
1991 /* B-frames are not directly subject to VBV,
1992 * since they are controlled by the P-frames' QPs. */
1994 if( rcc->b_vbv && rcc->last_satd > 0 )
1996 /* Lookahead VBV: raise the quantizer as necessary such that no frames in
1997 * the lookahead overflow and such that the buffer is in a reasonable state
1998 * by the end of the lookahead. */
1999 if( h->param.rc.i_lookahead )
2003 /* Avoid an infinite loop. */
2004 for( int iterations = 0; iterations < 1000 && terminate != 3; iterations++ )
2007 double cur_bits = predict_size( &rcc->pred[h->sh.i_type], q, rcc->last_satd );
2008 double buffer_fill_cur = rcc->buffer_fill - cur_bits;
2010 double total_duration = 0;
2011 frame_q[0] = h->sh.i_type == SLICE_TYPE_I ? q * h->param.rc.f_ip_factor : q;
2012 frame_q[1] = frame_q[0] * h->param.rc.f_pb_factor;
2013 frame_q[2] = frame_q[0] / h->param.rc.f_ip_factor;
2015 /* Loop over the planned future frames. */
2016 for( int j = 0; buffer_fill_cur >= 0 && buffer_fill_cur <= rcc->buffer_size; j++ )
2018 total_duration += h->fenc->f_planned_cpb_duration[j];
2019 buffer_fill_cur += rcc->vbv_max_rate * h->fenc->f_planned_cpb_duration[j];
2020 int i_type = h->fenc->i_planned_type[j];
2021 int i_satd = h->fenc->i_planned_satd[j];
2022 if( i_type == X264_TYPE_AUTO )
2024 i_type = IS_X264_TYPE_I( i_type ) ? SLICE_TYPE_I : IS_X264_TYPE_B( i_type ) ? SLICE_TYPE_B : SLICE_TYPE_P;
2025 cur_bits = predict_size( &rcc->pred[i_type], frame_q[i_type], i_satd );
2026 buffer_fill_cur -= cur_bits;
2028 /* Try to get to get the buffer at least 50% filled, but don't set an impossible goal. */
2029 target_fill = X264_MIN( rcc->buffer_fill + total_duration * rcc->vbv_max_rate * 0.5, rcc->buffer_size * 0.5 );
2030 if( buffer_fill_cur < target_fill )
2036 /* Try to get the buffer no more than 80% filled, but don't set an impossible goal. */
2037 target_fill = x264_clip3f( rcc->buffer_fill - total_duration * rcc->vbv_max_rate * 0.5, rcc->buffer_size * 0.8, rcc->buffer_size );
2038 if( rcc->b_vbv_min_rate && buffer_fill_cur > target_fill )
2047 /* Fallback to old purely-reactive algorithm: no lookahead. */
2050 if( ( pict_type == SLICE_TYPE_P ||
2051 ( pict_type == SLICE_TYPE_I && rcc->last_non_b_pict_type == SLICE_TYPE_I ) ) &&
2052 rcc->buffer_fill/rcc->buffer_size < 0.5 )
2054 q /= x264_clip3f( 2.0*rcc->buffer_fill/rcc->buffer_size, 0.5, 1.0 );
2057 /* Now a hard threshold to make sure the frame fits in VBV.
2058 * This one is mostly for I-frames. */
2059 double bits = predict_size( &rcc->pred[h->sh.i_type], q, rcc->last_satd );
2061 /* For small VBVs, allow the frame to use up the entire VBV. */
2062 double max_fill_factor = h->param.rc.i_vbv_buffer_size >= 5*h->param.rc.i_vbv_max_bitrate / rcc->fps ? 2 : 1;
2063 /* For single-frame VBVs, request that the frame use up the entire VBV. */
2064 double min_fill_factor = rcc->single_frame_vbv ? 1 : 2;
2066 if( bits > rcc->buffer_fill/max_fill_factor )
2067 qf = x264_clip3f( rcc->buffer_fill/(max_fill_factor*bits), 0.2, 1.0 );
2070 if( bits < rcc->buffer_rate/min_fill_factor )
2071 q *= bits*min_fill_factor/rcc->buffer_rate;
2072 q = X264_MAX( q0, q );
2075 /* Apply MinCR restrictions */
2076 double bits = predict_size( &rcc->pred[h->sh.i_type], q, rcc->last_satd );
2077 if( bits > rcc->frame_size_maximum )
2078 q *= bits / rcc->frame_size_maximum;
2079 bits = predict_size( &rcc->pred[h->sh.i_type], q, rcc->last_satd );
2081 /* Check B-frame complexity, and use up any bits that would
2082 * overflow before the next P-frame. */
2083 if( h->sh.i_type == SLICE_TYPE_P && !rcc->single_frame_vbv )
2085 int nb = rcc->bframes;
2086 double pbbits = bits;
2087 double bbits = predict_size( rcc->pred_b_from_p, q * h->param.rc.f_pb_factor, rcc->last_satd );
2089 double bframe_cpb_duration = 0;
2090 double minigop_cpb_duration;
2091 for( int i = 0; i < nb; i++ )
2092 bframe_cpb_duration += h->fenc->f_planned_cpb_duration[1+i];
2094 if( bbits * nb > bframe_cpb_duration * rcc->vbv_max_rate )
2096 pbbits += nb * bbits;
2098 minigop_cpb_duration = bframe_cpb_duration + h->fenc->f_planned_cpb_duration[0];
2099 space = rcc->buffer_fill + minigop_cpb_duration*rcc->vbv_max_rate - rcc->buffer_size;
2100 if( pbbits < space )
2102 q *= X264_MAX( pbbits / space, bits / (0.5 * rcc->buffer_size) );
2104 q = X264_MAX( q0/2, q );
2107 if( !rcc->b_vbv_min_rate )
2108 q = X264_MAX( q0, q );
2113 else if( rcc->b_2pass )
2115 double min2 = log( lmin );
2116 double max2 = log( lmax );
2117 q = (log(q) - min2)/(max2-min2) - 0.5;
2118 q = 1.0/(1.0 + exp( -4*q ));
2119 q = q*(max2-min2) + min2;
2123 return x264_clip3f( q, lmin, lmax );
2126 // update qscale for 1 frame based on actual bits used so far
2127 static float rate_estimate_qscale( x264_t *h )
2130 x264_ratecontrol_t *rcc = h->rc;
2131 ratecontrol_entry_t UNINIT(rce);
2132 int pict_type = h->sh.i_type;
2133 int64_t total_bits = 8*(h->stat.i_frame_size[SLICE_TYPE_I]
2134 + h->stat.i_frame_size[SLICE_TYPE_P]
2135 + h->stat.i_frame_size[SLICE_TYPE_B])
2136 - rcc->filler_bits_sum;
2141 if( pict_type != rce.pict_type )
2143 x264_log( h, X264_LOG_ERROR, "slice=%c but 2pass stats say %c\n",
2144 slice_type_to_char[pict_type], slice_type_to_char[rce.pict_type] );
2148 if( pict_type == SLICE_TYPE_B )
2150 /* B-frames don't have independent ratecontrol, but rather get the
2151 * average QP of the two adjacent P-frames + an offset */
2153 int i0 = IS_X264_TYPE_I(h->fref_nearest[0]->i_type);
2154 int i1 = IS_X264_TYPE_I(h->fref_nearest[1]->i_type);
2155 int dt0 = abs(h->fenc->i_poc - h->fref_nearest[0]->i_poc);
2156 int dt1 = abs(h->fenc->i_poc - h->fref_nearest[1]->i_poc);
2157 float q0 = h->fref_nearest[0]->f_qp_avg_rc;
2158 float q1 = h->fref_nearest[1]->f_qp_avg_rc;
2160 if( h->fref_nearest[0]->i_type == X264_TYPE_BREF )
2161 q0 -= rcc->pb_offset/2;
2162 if( h->fref_nearest[1]->i_type == X264_TYPE_BREF )
2163 q1 -= rcc->pb_offset/2;
2166 q = (q0 + q1) / 2 + rcc->ip_offset;
2172 q = (q0*dt1 + q1*dt0) / (dt0 + dt1);
2174 if( h->fenc->b_kept_as_ref )
2175 q += rcc->pb_offset/2;
2177 q += rcc->pb_offset;
2179 if( rcc->b_2pass && rcc->b_vbv )
2180 rcc->frame_size_planned = qscale2bits( &rce, qp2qscale( q ) );
2182 rcc->frame_size_planned = predict_size( rcc->pred_b_from_p, qp2qscale( q ), h->fref[1][h->i_ref[1]-1]->i_satd );
2183 /* Limit planned size by MinCR */
2185 rcc->frame_size_planned = X264_MIN( rcc->frame_size_planned, rcc->frame_size_maximum );
2186 h->rc->frame_size_estimated = rcc->frame_size_planned;
2190 rcc->last_satd = x264_rc_analyse_slice( h );
2192 return qp2qscale( q );
2196 double abr_buffer = 2 * rcc->rate_tolerance * rcc->bitrate;
2200 double lmin = rcc->lmin[pict_type];
2201 double lmax = rcc->lmax[pict_type];
2203 int64_t predicted_bits = total_bits;
2207 if( h->i_thread_frames > 1 )
2209 int j = h->rc - h->thread[0]->rc;
2210 for( int i = 1; i < h->i_thread_frames; i++ )
2212 x264_t *t = h->thread[ (j+i)%h->i_thread_frames ];
2213 double bits = t->rc->frame_size_planned;
2214 if( !t->b_thread_active )
2216 bits = X264_MAX(bits, t->rc->frame_size_estimated);
2217 predicted_bits += (int64_t)bits;
2223 if( h->i_frame < h->i_thread_frames )
2224 predicted_bits += (int64_t)h->i_frame * rcc->bitrate / rcc->fps;
2226 predicted_bits += (int64_t)(h->i_thread_frames - 1) * rcc->bitrate / rcc->fps;
2229 /* Adjust ABR buffer based on distance to the end of the video. */
2230 if( rcc->num_entries > h->i_frame )
2232 double final_bits = rcc->entry[rcc->num_entries-1].expected_bits;
2233 double video_pos = rce.expected_bits / final_bits;
2234 double scale_factor = sqrt( (1 - video_pos) * rcc->num_entries );
2235 abr_buffer *= 0.5 * X264_MAX( scale_factor, 0.5 );
2238 diff = predicted_bits - (int64_t)rce.expected_bits;
2240 q /= x264_clip3f((double)(abr_buffer - diff) / abr_buffer, .5, 2);
2241 if( ((h->i_frame + 1 - h->i_thread_frames) >= rcc->fps) &&
2242 (rcc->expected_bits_sum > 0))
2244 /* Adjust quant based on the difference between
2245 * achieved and expected bitrate so far */
2246 double cur_time = (double)h->i_frame / rcc->num_entries;
2247 double w = x264_clip3f( cur_time*100, 0.0, 1.0 );
2248 q *= pow( (double)total_bits / rcc->expected_bits_sum, w );
2252 /* Do not overflow vbv */
2253 double expected_size = qscale2bits( &rce, q );
2254 double expected_vbv = rcc->buffer_fill + rcc->buffer_rate - expected_size;
2255 double expected_fullness = rce.expected_vbv / rcc->buffer_size;
2256 double qmax = q*(2 - expected_fullness);
2257 double size_constraint = 1 + expected_fullness;
2258 qmax = X264_MAX( qmax, rce.new_qscale );
2259 if( expected_fullness < .05 )
2261 qmax = X264_MIN(qmax, lmax);
2262 while( ((expected_vbv < rce.expected_vbv/size_constraint) && (q < qmax)) ||
2263 ((expected_vbv < 0) && (q < lmax)))
2266 expected_size = qscale2bits(&rce, q);
2267 expected_vbv = rcc->buffer_fill + rcc->buffer_rate - expected_size;
2269 rcc->last_satd = x264_rc_analyse_slice( h );
2271 q = x264_clip3f( q, lmin, lmax );
2273 else /* 1pass ABR */
2275 /* Calculate the quantizer which would have produced the desired
2276 * average bitrate if it had been applied to all frames so far.
2277 * Then modulate that quant based on the current frame's complexity
2278 * relative to the average complexity so far (using the 2pass RCEQ).
2279 * Then bias the quant up or down if total size so far was far from
2281 * Result: Depending on the value of rate_tolerance, there is a
2282 * tradeoff between quality and bitrate precision. But at large
2283 * tolerances, the bit distribution approaches that of 2pass. */
2285 double wanted_bits, overflow = 1;
2287 rcc->last_satd = x264_rc_analyse_slice( h );
2288 rcc->short_term_cplxsum *= 0.5;
2289 rcc->short_term_cplxcount *= 0.5;
2290 rcc->short_term_cplxsum += rcc->last_satd / (CLIP_DURATION(h->fenc->f_duration) / BASE_FRAME_DURATION);
2291 rcc->short_term_cplxcount ++;
2293 rce.tex_bits = rcc->last_satd;
2294 rce.blurred_complexity = rcc->short_term_cplxsum / rcc->short_term_cplxcount;
2296 rce.p_count = rcc->nmb;
2300 rce.pict_type = pict_type;
2301 rce.i_duration = h->fenc->i_duration;
2303 if( h->param.rc.i_rc_method == X264_RC_CRF )
2305 q = get_qscale( h, &rce, rcc->rate_factor_constant, h->fenc->i_frame );
2309 q = get_qscale( h, &rce, rcc->wanted_bits_window / rcc->cplxr_sum, h->fenc->i_frame );
2311 /* ABR code can potentially be counterproductive in CBR, so just don't bother.
2312 * Don't run it if the frame complexity is zero either. */
2313 if( !rcc->b_vbv_min_rate && rcc->last_satd )
2315 // FIXME is it simpler to keep track of wanted_bits in ratecontrol_end?
2316 int i_frame_done = h->i_frame + 1 - h->i_thread_frames;
2317 double time_done = i_frame_done / rcc->fps;
2318 if( h->param.b_vfr_input && i_frame_done > 0 )
2319 time_done = ((double)(h->fenc->i_reordered_pts - h->i_reordered_pts_delay)) * h->param.i_timebase_num / h->param.i_timebase_den;
2320 wanted_bits = time_done * rcc->bitrate;
2321 if( wanted_bits > 0 )
2323 abr_buffer *= X264_MAX( 1, sqrt( time_done ) );
2324 overflow = x264_clip3f( 1.0 + (total_bits - wanted_bits) / abr_buffer, .5, 2 );
2330 if( pict_type == SLICE_TYPE_I && h->param.i_keyint_max > 1
2331 /* should test _next_ pict type, but that isn't decided yet */
2332 && rcc->last_non_b_pict_type != SLICE_TYPE_I )
2334 q = qp2qscale( rcc->accum_p_qp / rcc->accum_p_norm );
2335 q /= fabs( h->param.rc.f_ip_factor );
2337 else if( h->i_frame > 0 )
2339 if( h->param.rc.i_rc_method != X264_RC_CRF )
2341 /* Asymmetric clipping, because symmetric would prevent
2342 * overflow control in areas of rapidly oscillating complexity */
2343 double lmin = rcc->last_qscale_for[pict_type] / rcc->lstep;
2344 double lmax = rcc->last_qscale_for[pict_type] * rcc->lstep;
2345 if( overflow > 1.1 && h->i_frame > 3 )
2347 else if( overflow < 0.9 )
2350 q = x264_clip3f(q, lmin, lmax);
2353 else if( h->param.rc.i_rc_method == X264_RC_CRF && rcc->qcompress != 1 )
2355 q = qp2qscale( ABR_INIT_QP ) / fabs( h->param.rc.f_ip_factor );
2357 rcc->qp_novbv = qscale2qp( q );
2359 //FIXME use get_diff_limited_q() ?
2360 q = clip_qscale( h, pict_type, q );
2363 rcc->last_qscale_for[pict_type] =
2364 rcc->last_qscale = q;
2366 if( !(rcc->b_2pass && !rcc->b_vbv) && h->fenc->i_frame == 0 )
2367 rcc->last_qscale_for[SLICE_TYPE_P] = q * fabs( h->param.rc.f_ip_factor );
2369 if( rcc->b_2pass && rcc->b_vbv )
2370 rcc->frame_size_planned = qscale2bits(&rce, q);
2372 rcc->frame_size_planned = predict_size( &rcc->pred[h->sh.i_type], q, rcc->last_satd );
2374 /* Always use up the whole VBV in this case. */
2375 if( rcc->single_frame_vbv )
2376 rcc->frame_size_planned = rcc->buffer_rate;
2377 /* Limit planned size by MinCR */
2379 rcc->frame_size_planned = X264_MIN( rcc->frame_size_planned, rcc->frame_size_maximum );
2380 h->rc->frame_size_estimated = rcc->frame_size_planned;
2385 void x264_threads_normalize_predictors( x264_t *h )
2387 double totalsize = 0;
2388 for( int i = 0; i < h->param.i_threads; i++ )
2389 totalsize += h->thread[i]->rc->slice_size_planned;
2390 double factor = h->rc->frame_size_planned / totalsize;
2391 for( int i = 0; i < h->param.i_threads; i++ )
2392 h->thread[i]->rc->slice_size_planned *= factor;
2395 void x264_threads_distribute_ratecontrol( x264_t *h )
2398 x264_ratecontrol_t *rc = h->rc;
2400 /* Initialize row predictors */
2401 if( h->i_frame == 0 )
2402 for( int i = 0; i < h->param.i_threads; i++ )
2404 x264_ratecontrol_t *t = h->thread[i]->rc;
2405 memcpy( t->row_preds, rc->row_preds, sizeof(rc->row_preds) );
2408 for( int i = 0; i < h->param.i_threads; i++ )
2410 x264_t *t = h->thread[i];
2411 memcpy( t->rc, rc, offsetof(x264_ratecontrol_t, row_pred) );
2412 t->rc->row_pred = &t->rc->row_preds[h->sh.i_type];
2413 /* Calculate the planned slice size. */
2414 if( rc->b_vbv && rc->frame_size_planned )
2417 for( row = t->i_threadslice_start; row < t->i_threadslice_end; row++ )
2418 size += h->fdec->i_row_satd[row];
2419 t->rc->slice_size_planned = predict_size( &rc->pred[h->sh.i_type + (i+1)*5], rc->qpm, size );
2422 t->rc->slice_size_planned = 0;
2424 if( rc->b_vbv && rc->frame_size_planned )
2426 x264_threads_normalize_predictors( h );
2428 if( rc->single_frame_vbv )
2430 /* Compensate for our max frame error threshold: give more bits (proportionally) to smaller slices. */
2431 for( int i = 0; i < h->param.i_threads; i++ )
2433 x264_t *t = h->thread[i];
2434 float max_frame_error = X264_MAX( 0.05, 1.0 / (t->i_threadslice_end - t->i_threadslice_start) );
2435 t->rc->slice_size_planned += 2 * max_frame_error * rc->frame_size_planned;
2437 x264_threads_normalize_predictors( h );
2440 for( int i = 0; i < h->param.i_threads; i++ )
2441 h->thread[i]->rc->frame_size_estimated = h->thread[i]->rc->slice_size_planned;
2445 void x264_threads_merge_ratecontrol( x264_t *h )
2447 x264_ratecontrol_t *rc = h->rc;
2450 for( int i = 0; i < h->param.i_threads; i++ )
2452 x264_t *t = h->thread[i];
2453 x264_ratecontrol_t *rct = h->thread[i]->rc;
2454 if( h->param.rc.i_vbv_buffer_size )
2457 for( int row = t->i_threadslice_start; row < t->i_threadslice_end; row++ )
2458 size += h->fdec->i_row_satd[row];
2459 int bits = t->stat.frame.i_mv_bits + t->stat.frame.i_tex_bits + t->stat.frame.i_misc_bits;
2460 int mb_count = (t->i_threadslice_end - t->i_threadslice_start) * h->mb.i_mb_width;
2461 update_predictor( &rc->pred[h->sh.i_type+(i+1)*5], qp2qscale( rct->qpa_rc/mb_count ), size, bits );
2465 rc->qpa_rc += rct->qpa_rc;
2466 rc->qpa_aq += rct->qpa_aq;
2470 void x264_thread_sync_ratecontrol( x264_t *cur, x264_t *prev, x264_t *next )
2474 #define COPY(var) memcpy(&cur->rc->var, &prev->rc->var, sizeof(cur->rc->var))
2475 /* these vars are updated in x264_ratecontrol_start()
2476 * so copy them from the context that most recently started (prev)
2477 * to the context that's about to start (cur). */
2482 COPY(last_qscale_for);
2483 COPY(last_non_b_pict_type);
2484 COPY(short_term_cplxsum);
2485 COPY(short_term_cplxcount);
2489 /* these vars can be updated by x264_ratecontrol_init_reconfigurable */
2494 COPY(single_frame_vbv);
2496 COPY(rate_factor_constant);
2497 COPY(rate_factor_max_increment);
2502 #define COPY(var) next->rc->var = cur->rc->var
2503 /* these vars are updated in x264_ratecontrol_end()
2504 * so copy them from the context that most recently ended (cur)
2505 * to the context that's about to end (next) */
2507 COPY(expected_bits_sum);
2508 COPY(filler_bits_sum);
2509 COPY(wanted_bits_window);
2511 COPY(initial_cpb_removal_delay);
2512 COPY(initial_cpb_removal_delay_offset);
2513 COPY(nrt_first_access_unit);
2514 COPY(previous_cpb_final_arrival_time);
2517 //FIXME row_preds[] (not strictly necessary, but would improve prediction)
2518 /* the rest of the variables are either constant or thread-local */
2521 static int find_underflow( x264_t *h, double *fills, int *t0, int *t1, int over )
2523 /* find an interval ending on an overflow or underflow (depending on whether
2524 * we're adding or removing bits), and starting on the earliest frame that
2525 * can influence the buffer fill of that end frame. */
2526 x264_ratecontrol_t *rcc = h->rc;
2527 const double buffer_min = (over ? .1 : .1) * rcc->buffer_size;
2528 const double buffer_max = .9 * rcc->buffer_size;
2529 double fill = fills[*t0-1];
2530 double parity = over ? 1. : -1.;
2531 int start = -1, end = -1;
2532 for( int i = *t0; i < rcc->num_entries; i++ )
2534 fill += (rcc->entry[i].i_cpb_duration * rcc->vbv_max_rate * h->sps->vui.i_num_units_in_tick / h->sps->vui.i_time_scale -
2535 qscale2bits( &rcc->entry[i], rcc->entry[i].new_qscale )) * parity;
2536 fill = x264_clip3f(fill, 0, rcc->buffer_size);
2538 if( fill <= buffer_min || i == 0 )
2544 else if( fill >= buffer_max && start >= 0 )
2549 return start >= 0 && end >= 0;
2552 static int fix_underflow( x264_t *h, int t0, int t1, double adjustment, double qscale_min, double qscale_max)
2554 x264_ratecontrol_t *rcc = h->rc;
2555 double qscale_orig, qscale_new;
2559 for( int i = t0; i <= t1; i++ )
2561 qscale_orig = rcc->entry[i].new_qscale;
2562 qscale_orig = x264_clip3f( qscale_orig, qscale_min, qscale_max );
2563 qscale_new = qscale_orig * adjustment;
2564 qscale_new = x264_clip3f( qscale_new, qscale_min, qscale_max );
2565 rcc->entry[i].new_qscale = qscale_new;
2566 adjusted = adjusted || (qscale_new != qscale_orig);
2571 static double count_expected_bits( x264_t *h )
2573 x264_ratecontrol_t *rcc = h->rc;
2574 double expected_bits = 0;
2575 for( int i = 0; i < rcc->num_entries; i++ )
2577 ratecontrol_entry_t *rce = &rcc->entry[i];
2578 rce->expected_bits = expected_bits;
2579 expected_bits += qscale2bits( rce, rce->new_qscale );
2581 return expected_bits;
2584 static int vbv_pass2( x264_t *h, double all_available_bits )
2586 /* for each interval of buffer_full .. underflow, uniformly increase the qp of all
2587 * frames in the interval until either buffer is full at some intermediate frame or the
2588 * last frame in the interval no longer underflows. Recompute intervals and repeat.
2589 * Then do the converse to put bits back into overflow areas until target size is met */
2591 x264_ratecontrol_t *rcc = h->rc;
2593 double expected_bits = 0;
2595 double prev_bits = 0;
2597 double qscale_min = qp2qscale( h->param.rc.i_qp_min );
2598 double qscale_max = qp2qscale( h->param.rc.i_qp_max );
2600 int adj_min, adj_max;
2601 CHECKED_MALLOC( fills, (rcc->num_entries+1)*sizeof(double) );
2605 /* adjust overall stream size */
2609 prev_bits = expected_bits;
2612 { /* not first iteration */
2613 adjustment = X264_MAX(X264_MIN(expected_bits / all_available_bits, 0.999), 0.9);
2614 fills[-1] = rcc->buffer_size * h->param.rc.f_vbv_buffer_init;
2618 while(adj_min && find_underflow( h, fills, &t0, &t1, 1 ))
2620 adj_min = fix_underflow( h, t0, t1, adjustment, qscale_min, qscale_max );
2625 fills[-1] = rcc->buffer_size * (1. - h->param.rc.f_vbv_buffer_init);
2627 /* fix underflows -- should be done after overflow, as we'd better undersize target than underflowing VBV */
2629 while( adj_max && find_underflow( h, fills, &t0, &t1, 0 ) )
2630 adj_max = fix_underflow( h, t0, t1, 1.001, qscale_min, qscale_max );
2632 expected_bits = count_expected_bits( h );
2633 } while( (expected_bits < .995*all_available_bits) && ((int64_t)(expected_bits+.5) > (int64_t)(prev_bits+.5)) );
2636 x264_log( h, X264_LOG_WARNING, "vbv-maxrate issue, qpmax or vbv-maxrate too low\n");
2638 /* store expected vbv filling values for tracking when encoding */
2639 for( int i = 0; i < rcc->num_entries; i++ )
2640 rcc->entry[i].expected_vbv = rcc->buffer_size - fills[i];
2642 x264_free( fills-1 );
2648 static int init_pass2( x264_t *h )
2650 x264_ratecontrol_t *rcc = h->rc;
2651 uint64_t all_const_bits = 0;
2652 double timescale = (double)h->sps->vui.i_num_units_in_tick / h->sps->vui.i_time_scale;
2653 double duration = 0;
2654 for( int i = 0; i < rcc->num_entries; i++ )
2655 duration += rcc->entry[i].i_duration;
2656 duration *= timescale;
2657 uint64_t all_available_bits = h->param.rc.i_bitrate * 1000. * duration;
2658 double rate_factor, step_mult;
2659 double qblur = h->param.rc.f_qblur;
2660 double cplxblur = h->param.rc.f_complexity_blur;
2661 const int filter_size = (int)(qblur*4) | 1;
2662 double expected_bits;
2663 double *qscale, *blurred_qscale;
2664 double base_cplx = h->mb.i_mb_count * (h->param.i_bframe ? 120 : 80);
2666 /* find total/average complexity & const_bits */
2667 for( int i = 0; i < rcc->num_entries; i++ )
2669 ratecontrol_entry_t *rce = &rcc->entry[i];
2670 all_const_bits += rce->misc_bits;
2673 if( all_available_bits < all_const_bits)
2675 x264_log( h, X264_LOG_ERROR, "requested bitrate is too low. estimated minimum is %d kbps\n",
2676 (int)(all_const_bits * rcc->fps / (rcc->num_entries * 1000.)) );
2680 /* Blur complexities, to reduce local fluctuation of QP.
2681 * We don't blur the QPs directly, because then one very simple frame
2682 * could drag down the QP of a nearby complex frame and give it more
2683 * bits than intended. */
2684 for( int i = 0; i < rcc->num_entries; i++ )
2686 ratecontrol_entry_t *rce = &rcc->entry[i];
2687 double weight_sum = 0;
2688 double cplx_sum = 0;
2689 double weight = 1.0;
2690 double gaussian_weight;
2691 /* weighted average of cplx of future frames */
2692 for( int j = 1; j < cplxblur*2 && j < rcc->num_entries-i; j++ )
2694 ratecontrol_entry_t *rcj = &rcc->entry[i+j];
2695 double frame_duration = CLIP_DURATION(rcj->i_duration * timescale) / BASE_FRAME_DURATION;
2696 weight *= 1 - pow( (float)rcj->i_count / rcc->nmb, 2 );
2697 if( weight < .0001 )
2699 gaussian_weight = weight * exp( -j*j/200.0 );
2700 weight_sum += gaussian_weight;
2701 cplx_sum += gaussian_weight * (qscale2bits( rcj, 1 ) - rcj->misc_bits) / frame_duration;
2703 /* weighted average of cplx of past frames */
2705 for( int j = 0; j <= cplxblur*2 && j <= i; j++ )
2707 ratecontrol_entry_t *rcj = &rcc->entry[i-j];
2708 double frame_duration = CLIP_DURATION(rcj->i_duration * timescale) / BASE_FRAME_DURATION;
2709 gaussian_weight = weight * exp( -j*j/200.0 );
2710 weight_sum += gaussian_weight;
2711 cplx_sum += gaussian_weight * (qscale2bits( rcj, 1 ) - rcj->misc_bits) / frame_duration;
2712 weight *= 1 - pow( (float)rcj->i_count / rcc->nmb, 2 );
2713 if( weight < .0001 )
2716 rce->blurred_complexity = cplx_sum / weight_sum;
2719 CHECKED_MALLOC( qscale, sizeof(double)*rcc->num_entries );
2720 if( filter_size > 1 )
2721 CHECKED_MALLOC( blurred_qscale, sizeof(double)*rcc->num_entries );
2723 blurred_qscale = qscale;
2725 /* Search for a factor which, when multiplied by the RCEQ values from
2726 * each frame, adds up to the desired total size.
2727 * There is no exact closed-form solution because of VBV constraints and
2728 * because qscale2bits is not invertible, but we can start with the simple
2729 * approximation of scaling the 1st pass by the ratio of bitrates.
2730 * The search range is probably overkill, but speed doesn't matter here. */
2733 for( int i = 0; i < rcc->num_entries; i++ )
2735 double q = get_qscale(h, &rcc->entry[i], 1.0, i);
2736 expected_bits += qscale2bits(&rcc->entry[i], q);
2737 rcc->last_qscale_for[rcc->entry[i].pict_type] = q;
2739 step_mult = all_available_bits / expected_bits;
2742 for( double step = 1E4 * step_mult; step > 1E-7 * step_mult; step *= 0.5)
2745 rate_factor += step;
2747 rcc->last_non_b_pict_type = -1;
2748 rcc->last_accum_p_norm = 1;
2749 rcc->accum_p_norm = 0;
2751 rcc->last_qscale_for[0] =
2752 rcc->last_qscale_for[1] =
2753 rcc->last_qscale_for[2] = pow( base_cplx, 1 - rcc->qcompress ) / rate_factor;
2756 for( int i = 0; i < rcc->num_entries; i++ )
2758 qscale[i] = get_qscale( h, &rcc->entry[i], rate_factor, -1 );
2759 rcc->last_qscale_for[rcc->entry[i].pict_type] = qscale[i];
2762 /* fixed I/B qscale relative to P */
2763 for( int i = rcc->num_entries-1; i >= 0; i-- )
2765 qscale[i] = get_diff_limited_q( h, &rcc->entry[i], qscale[i], i );
2766 assert(qscale[i] >= 0);
2770 if( filter_size > 1 )
2772 assert( filter_size%2 == 1 );
2773 for( int i = 0; i < rcc->num_entries; i++ )
2775 ratecontrol_entry_t *rce = &rcc->entry[i];
2776 double q = 0.0, sum = 0.0;
2778 for( int j = 0; j < filter_size; j++ )
2780 int idx = i+j-filter_size/2;
2782 double coeff = qblur==0 ? 1.0 : exp( -d*d/(qblur*qblur) );
2783 if( idx < 0 || idx >= rcc->num_entries )
2785 if( rce->pict_type != rcc->entry[idx].pict_type )
2787 q += qscale[idx] * coeff;
2790 blurred_qscale[i] = q/sum;
2794 /* find expected bits */
2795 for( int i = 0; i < rcc->num_entries; i++ )
2797 ratecontrol_entry_t *rce = &rcc->entry[i];
2798 rce->new_qscale = clip_qscale( h, rce->pict_type, blurred_qscale[i] );
2799 assert(rce->new_qscale >= 0);
2800 expected_bits += qscale2bits( rce, rce->new_qscale );
2803 if( expected_bits > all_available_bits )
2804 rate_factor -= step;
2807 x264_free( qscale );
2808 if( filter_size > 1 )
2809 x264_free( blurred_qscale );
2812 if( vbv_pass2( h, all_available_bits ) )
2814 expected_bits = count_expected_bits( h );
2816 if( fabs( expected_bits/all_available_bits - 1.0 ) > 0.01 )
2819 for( int i = 0; i < rcc->num_entries; i++ )
2820 avgq += rcc->entry[i].new_qscale;
2821 avgq = qscale2qp( avgq / rcc->num_entries );
2823 if( expected_bits > all_available_bits || !rcc->b_vbv )
2824 x264_log( h, X264_LOG_WARNING, "Error: 2pass curve failed to converge\n" );
2825 x264_log( h, X264_LOG_WARNING, "target: %.2f kbit/s, expected: %.2f kbit/s, avg QP: %.4f\n",
2826 (float)h->param.rc.i_bitrate,
2827 expected_bits * rcc->fps / (rcc->num_entries * 1000.),
2829 if( expected_bits < all_available_bits && avgq < h->param.rc.i_qp_min + 2 )
2831 if( h->param.rc.i_qp_min > 0 )
2832 x264_log( h, X264_LOG_WARNING, "try reducing target bitrate or reducing qp_min (currently %d)\n", h->param.rc.i_qp_min );
2834 x264_log( h, X264_LOG_WARNING, "try reducing target bitrate\n" );
2836 else if( expected_bits > all_available_bits && avgq > h->param.rc.i_qp_max - 2 )
2838 if( h->param.rc.i_qp_max < QP_MAX )
2839 x264_log( h, X264_LOG_WARNING, "try increasing target bitrate or increasing qp_max (currently %d)\n", h->param.rc.i_qp_max );
2841 x264_log( h, X264_LOG_WARNING, "try increasing target bitrate\n");
2843 else if( !(rcc->b_2pass && rcc->b_vbv) )
2844 x264_log( h, X264_LOG_WARNING, "internal error\n" );