1 /*****************************************************************************
2 * ratecontrol.c: ratecontrol
3 *****************************************************************************
4 * Copyright (C) 2005-2010 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
34 #include "common/common.h"
35 #include "ratecontrol.h"
47 uint64_t expected_bits; /*total expected bits up to the current frame (current one excluded)*/
54 float blurred_complexity;
57 int16_t i_weight_denom;
62 } ratecontrol_entry_t;
72 struct x264_ratecontrol_t
81 double rate_tolerance;
83 int nmb; /* number of macroblocks in a frame */
87 ratecontrol_entry_t *rce;
88 int qp; /* qp for current frame */
89 float qpm; /* qp for current macroblock: precise float for AQ */
90 float qpa_rc; /* average of macroblocks' qp before aq */
91 float qpa_aq; /* average of macroblocks' qp after aq */
92 float qp_novbv; /* QP for the current frame if 1-pass VBV was disabled. */
97 int64_t buffer_fill_final;
98 double buffer_fill; /* planned buffer, if all in-progress frames hit their bit budget */
99 double buffer_rate; /* # of bits added to buffer_fill after each frame */
100 double vbv_max_rate; /* # of bits added to buffer_fill per second */
101 predictor_t *pred; /* predict frame size from satd */
102 int single_frame_vbv;
103 double rate_factor_max_increment; /* Don't allow RF above (CRF + this value). */
108 double cplxr_sum; /* sum of bits*qscale/rceq */
109 double expected_bits_sum; /* sum of qscale2bits after rceq, ratefactor, and overflow, only includes finished frames */
110 int64_t filler_bits_sum; /* sum in bits of finished frames' filler data */
111 double wanted_bits_window; /* target bitrate * window */
113 double short_term_cplxsum;
114 double short_term_cplxcount;
115 double rate_factor_constant;
120 FILE *p_stat_file_out;
121 char *psz_stat_file_tmpname;
122 FILE *p_mbtree_stat_file_out;
123 char *psz_mbtree_stat_file_tmpname;
124 char *psz_mbtree_stat_file_name;
125 FILE *p_mbtree_stat_file_in;
127 int num_entries; /* number of ratecontrol_entry_ts */
128 ratecontrol_entry_t *entry; /* FIXME: copy needed data and free this once init is done */
130 double last_qscale_for[3]; /* last qscale for a specific pict type, used for max_diff & ipb factor stuff */
131 int last_non_b_pict_type;
132 double accum_p_qp; /* for determining I-frame quant */
134 double last_accum_p_norm;
135 double lmin[3]; /* min qscale by frame type */
137 double lstep; /* max change (multiply) in qscale per frame */
138 uint16_t *qp_buffer[2]; /* Global buffers for converting MB-tree quantizer data. */
139 int qpbuf_pos; /* In order to handle pyramid reordering, QP buffer acts as a stack.
140 * This value is the current position (0 or 1). */
143 float frame_size_estimated; /* Access to this variable must be atomic: double is
144 * not atomic on all arches we care about */
145 double frame_size_maximum; /* Maximum frame size due to MinCR */
146 double frame_size_planned;
147 double slice_size_planned;
148 predictor_t (*row_pred)[2];
149 predictor_t row_preds[3][2];
150 predictor_t *pred_b_from_p; /* predict B-frame size from P-frame satd */
151 int bframes; /* # consecutive B-frames before this P-frame */
152 int bframe_bits; /* total cost of those frames */
156 x264_zone_t *prev_zone;
159 int initial_cpb_removal_delay;
160 int initial_cpb_removal_delay_offset;
161 double nrt_first_access_unit; /* nominal removal time */
162 double previous_cpb_final_arrival_time;
163 uint64_t hrd_multiply_denom;
167 static int parse_zones( x264_t *h );
168 static int init_pass2(x264_t *);
169 static float rate_estimate_qscale( x264_t *h );
170 static int update_vbv( x264_t *h, int bits );
171 static void update_vbv_plan( x264_t *h, int overhead );
172 static double predict_size( predictor_t *p, double q, double var );
173 static void update_predictor( predictor_t *p, double q, double var, double bits );
175 #define CMP_OPT_FIRST_PASS( opt, param_val )\
177 if( ( p = strstr( opts, opt "=" ) ) && sscanf( p, opt "=%d" , &i ) && param_val != i )\
179 x264_log( h, X264_LOG_ERROR, "different " opt " setting than first pass (%d vs %d)\n", param_val, i );\
185 * qp = h.264's quantizer
186 * qscale = linearized quantizer = Lagrange multiplier
188 static inline double qp2qscale( double qp )
190 return 0.85 * pow( 2.0, ( qp - 12.0 ) / 6.0 );
192 static inline double qscale2qp( double qscale )
194 return 12.0 + 6.0 * log2( qscale/0.85 );
197 /* Texture bitrate is not quite inversely proportional to qscale,
198 * probably due the the changing number of SKIP blocks.
199 * MV bits level off at about qp<=12, because the lambda used
200 * for motion estimation is constant there. */
201 static inline double qscale2bits( ratecontrol_entry_t *rce, double qscale )
205 return (rce->tex_bits + .1) * pow( rce->qscale / qscale, 1.1 )
206 + rce->mv_bits * pow( X264_MAX(rce->qscale, 1) / X264_MAX(qscale, 1), 0.5 )
210 static ALWAYS_INLINE uint32_t ac_energy_var( uint64_t sum_ssd, int shift, x264_frame_t *frame, int i )
212 uint32_t sum = sum_ssd;
213 uint32_t ssd = sum_ssd >> 32;
214 frame->i_pixel_sum[i] += sum;
215 frame->i_pixel_ssd[i] += ssd;
216 return ssd - ((uint64_t)sum * sum >> shift);
219 static ALWAYS_INLINE uint32_t ac_energy_plane( x264_t *h, int mb_x, int mb_y, x264_frame_t *frame, int i )
222 int stride = frame->i_stride[i];
223 int offset = h->mb.b_interlaced
224 ? 16 * mb_x + w * (mb_y&~1) * stride + (mb_y&1) * stride
225 : 16 * mb_x + w * mb_y * stride;
226 stride <<= h->mb.b_interlaced;
229 ALIGNED_ARRAY_16( pixel, pix,[FENC_STRIDE*8] );
230 h->mc.load_deinterleave_8x8x2_fenc( pix, frame->plane[1] + offset, stride );
231 return ac_energy_var( h->pixf.var[PIXEL_8x8]( pix, FENC_STRIDE ), 6, frame, i )
232 + ac_energy_var( h->pixf.var[PIXEL_8x8]( pix+FENC_STRIDE/2, FENC_STRIDE ), 6, frame, i );
235 return ac_energy_var( h->pixf.var[PIXEL_16x16]( frame->plane[0] + offset, stride ), 8, frame, i );
238 // Find the total AC energy of the block in all planes.
239 static NOINLINE uint32_t x264_ac_energy_mb( x264_t *h, int mb_x, int mb_y, x264_frame_t *frame )
241 /* This function contains annoying hacks because GCC has a habit of reordering emms
242 * and putting it after floating point ops. As a result, we put the emms at the end of the
243 * function and make sure that its always called before the float math. Noinline makes
244 * sure no reordering goes on. */
245 uint32_t var = ac_energy_plane( h, mb_x, mb_y, frame, 0 );
246 var += ac_energy_plane( h, mb_x, mb_y, frame, 1 );
251 void x264_adaptive_quant_frame( x264_t *h, x264_frame_t *frame, float *quant_offsets )
253 /* constants chosen to result in approximately the same overall bitrate as without AQ.
254 * FIXME: while they're written in 5 significant digits, they're only tuned to 2. */
257 /* Initialize frame stats */
258 for( int i = 0; i < 3; i++ )
260 frame->i_pixel_sum[i] = 0;
261 frame->i_pixel_ssd[i] = 0;
264 /* Degenerate cases */
265 if( h->param.rc.i_aq_mode == X264_AQ_NONE || h->param.rc.f_aq_strength == 0 )
267 /* Need to init it anyways for MB tree */
268 if( h->param.rc.i_aq_mode && h->param.rc.f_aq_strength == 0 )
272 for( int mb_xy = 0; mb_xy < h->mb.i_mb_count; mb_xy++ )
273 frame->f_qp_offset[mb_xy] = frame->f_qp_offset_aq[mb_xy] = quant_offsets[mb_xy];
274 if( h->frames.b_have_lowres )
275 for( int mb_xy = 0; mb_xy < h->mb.i_mb_count; mb_xy++ )
276 frame->i_inv_qscale_factor[mb_xy] = x264_exp2fix8( frame->f_qp_offset[mb_xy] );
280 memset( frame->f_qp_offset, 0, h->mb.i_mb_count * sizeof(float) );
281 memset( frame->f_qp_offset_aq, 0, h->mb.i_mb_count * sizeof(float) );
282 if( h->frames.b_have_lowres )
283 for( int mb_xy = 0; mb_xy < h->mb.i_mb_count; mb_xy++ )
284 frame->i_inv_qscale_factor[mb_xy] = 256;
287 /* Need variance data for weighted prediction */
288 if( h->param.analyse.i_weighted_pred == X264_WEIGHTP_FAKE || h->param.analyse.i_weighted_pred == X264_WEIGHTP_SMART )
290 for( int mb_y = 0; mb_y < h->mb.i_mb_height; mb_y++ )
291 for( int mb_x = 0; mb_x < h->mb.i_mb_width; mb_x++ )
292 x264_ac_energy_mb( h, mb_x, mb_y, frame );
297 /* Actual adaptive quantization */
300 if( h->param.rc.i_aq_mode == X264_AQ_AUTOVARIANCE )
302 float bit_depth_correction = powf(1 << (BIT_DEPTH-8), 0.5f);
303 float avg_adj_pow2 = 0.f;
304 for( int mb_y = 0; mb_y < h->mb.i_mb_height; mb_y++ )
305 for( int mb_x = 0; mb_x < h->mb.i_mb_width; mb_x++ )
307 uint32_t energy = x264_ac_energy_mb( h, mb_x, mb_y, frame );
308 float qp_adj = powf( energy + 1, 0.125f );
309 frame->f_qp_offset[mb_x + mb_y*h->mb.i_mb_stride] = qp_adj;
311 avg_adj_pow2 += qp_adj * qp_adj;
313 avg_adj /= h->mb.i_mb_count;
314 avg_adj_pow2 /= h->mb.i_mb_count;
315 strength = h->param.rc.f_aq_strength * avg_adj / bit_depth_correction;
316 avg_adj = avg_adj - 0.5f * (avg_adj_pow2 - (14.f * bit_depth_correction)) / avg_adj;
319 strength = h->param.rc.f_aq_strength * 1.0397f;
321 for( int mb_y = 0; mb_y < h->mb.i_mb_height; mb_y++ )
322 for( int mb_x = 0; mb_x < h->mb.i_mb_width; mb_x++ )
325 int mb_xy = mb_x + mb_y*h->mb.i_mb_stride;
326 if( h->param.rc.i_aq_mode == X264_AQ_AUTOVARIANCE )
328 qp_adj = frame->f_qp_offset[mb_xy];
329 qp_adj = strength * (qp_adj - avg_adj);
333 uint32_t energy = x264_ac_energy_mb( h, mb_x, mb_y, frame );
334 qp_adj = strength * (x264_log2( X264_MAX(energy, 1) ) - (14.427f + 2*(BIT_DEPTH-8)));
337 qp_adj += quant_offsets[mb_xy];
338 frame->f_qp_offset[mb_xy] =
339 frame->f_qp_offset_aq[mb_xy] = qp_adj;
340 if( h->frames.b_have_lowres )
341 frame->i_inv_qscale_factor[mb_xy] = x264_exp2fix8(qp_adj);
345 /* Remove mean from SSD calculation */
346 for( int i = 0; i < 3; i++ )
348 uint64_t ssd = frame->i_pixel_ssd[i];
349 uint64_t sum = frame->i_pixel_sum[i];
350 int width = h->mb.i_mb_width*16>>!!i;
351 int height = h->mb.i_mb_height*16>>!!i;
352 frame->i_pixel_ssd[i] = ssd - (sum * sum + width * height / 2) / (width * height);
356 int x264_macroblock_tree_read( x264_t *h, x264_frame_t *frame, float *quant_offsets )
358 x264_ratecontrol_t *rc = h->rc;
359 uint8_t i_type_actual = rc->entry[frame->i_frame].pict_type;
361 if( rc->entry[frame->i_frame].kept_as_ref )
364 if( rc->qpbuf_pos < 0 )
370 if( !fread( &i_type, 1, 1, rc->p_mbtree_stat_file_in ) )
372 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 )
375 if( i_type != i_type_actual && rc->qpbuf_pos == 1 )
377 x264_log(h, X264_LOG_ERROR, "MB-tree frametype %d doesn't match actual frametype %d.\n", i_type, i_type_actual);
380 } while( i_type != i_type_actual );
383 for( int i = 0; i < h->mb.i_mb_count; i++ )
385 frame->f_qp_offset[i] = ((float)(int16_t)endian_fix16( rc->qp_buffer[rc->qpbuf_pos][i] )) * (1/256.0);
386 if( h->frames.b_have_lowres )
387 frame->i_inv_qscale_factor[i] = x264_exp2fix8(frame->f_qp_offset[i]);
392 x264_stack_align( x264_adaptive_quant_frame, h, frame, quant_offsets );
395 x264_log(h, X264_LOG_ERROR, "Incomplete MB-tree stats file.\n");
399 int x264_reference_build_list_optimal( x264_t *h )
401 ratecontrol_entry_t *rce = h->rc->rce;
402 x264_frame_t *frames[16];
403 x264_weight_t weights[16][3];
406 if( rce->refs != h->i_ref0 )
409 memcpy( frames, h->fref0, sizeof(frames) );
410 memcpy( refcount, rce->refcount, sizeof(refcount) );
411 memcpy( weights, h->fenc->weight, sizeof(weights) );
412 memset( &h->fenc->weight[1][0], 0, sizeof(x264_weight_t[15][3]) );
414 /* For now don't reorder ref 0; it seems to lower quality
415 in most cases due to skips. */
416 for( int ref = 1; ref < h->i_ref0; ref++ )
421 for( int i = 1; i < h->i_ref0; i++ )
422 /* Favor lower POC as a tiebreaker. */
423 COPY2_IF_GT( max, refcount[i], bestref, i );
425 /* FIXME: If there are duplicates from frames other than ref0 then it is possible
426 * that the optimal ordering doesnt place every duplicate. */
428 refcount[bestref] = -1;
429 h->fref0[ref] = frames[bestref];
430 memcpy( h->fenc->weight[ref], weights[bestref], sizeof(weights[bestref]) );
436 static char *x264_strcat_filename( char *input, char *suffix )
438 char *output = x264_malloc( strlen( input ) + strlen( suffix ) + 1 );
441 strcpy( output, input );
442 strcat( output, suffix );
446 void x264_ratecontrol_init_reconfigurable( x264_t *h, int b_init )
448 x264_ratecontrol_t *rc = h->rc;
449 if( !b_init && rc->b_2pass )
452 if( h->param.rc.i_rc_method == X264_RC_CRF )
454 /* Arbitrary rescaling to make CRF somewhat similar to QP.
455 * Try to compensate for MB-tree's effects as well. */
456 double base_cplx = h->mb.i_mb_count * (h->param.i_bframe ? 120 : 80);
457 double mbtree_offset = h->param.rc.b_mb_tree ? (1.0-h->param.rc.f_qcompress)*13.5 : 0;
458 rc->rate_factor_constant = pow( base_cplx, 1 - rc->qcompress )
459 / qp2qscale( h->param.rc.f_rf_constant + mbtree_offset );
462 if( h->param.rc.i_vbv_max_bitrate > 0 && h->param.rc.i_vbv_buffer_size > 0 )
464 if( h->param.rc.i_vbv_buffer_size < (int)(h->param.rc.i_vbv_max_bitrate / rc->fps) )
466 h->param.rc.i_vbv_buffer_size = h->param.rc.i_vbv_max_bitrate / rc->fps;
467 x264_log( h, X264_LOG_WARNING, "VBV buffer size cannot be smaller than one frame, using %d kbit\n",
468 h->param.rc.i_vbv_buffer_size );
471 /* We don't support changing the ABR bitrate right now,
472 so if the stream starts as CBR, keep it CBR. */
473 if( rc->b_vbv_min_rate )
474 h->param.rc.i_vbv_max_bitrate = h->param.rc.i_bitrate;
476 int vbv_buffer_size = h->param.rc.i_vbv_buffer_size * 1000;
477 int vbv_max_bitrate = h->param.rc.i_vbv_max_bitrate * 1000;
480 h->sps->vui.hrd.i_bit_rate_unscaled = vbv_max_bitrate;
481 h->sps->vui.hrd.i_cpb_size_unscaled = vbv_buffer_size;
482 if( h->param.i_nal_hrd && b_init )
484 h->sps->vui.hrd.i_cpb_cnt = 1;
485 h->sps->vui.hrd.b_cbr_hrd = h->param.i_nal_hrd == X264_NAL_HRD_CBR;
486 h->sps->vui.hrd.i_time_offset_length = 0;
491 int bitrate = 1000*h->param.rc.i_vbv_max_bitrate;
492 int bufsize = 1000*h->param.rc.i_vbv_buffer_size;
494 // normalize HRD size and rate to the value / scale notation
495 h->sps->vui.hrd.i_bit_rate_scale = x264_clip3( x264_ctz( bitrate ) - BR_SHIFT, 0, 15 );
496 h->sps->vui.hrd.i_bit_rate_value = bitrate >> ( h->sps->vui.hrd.i_bit_rate_scale + BR_SHIFT );
497 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 );
498 h->sps->vui.hrd.i_cpb_size_scale = x264_clip3( x264_ctz( bufsize ) - CPB_SHIFT, 0, 15 );
499 h->sps->vui.hrd.i_cpb_size_value = bufsize >> ( h->sps->vui.hrd.i_cpb_size_scale + CPB_SHIFT );
500 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 );
506 #define MAX_DURATION 0.5
508 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 );
509 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;
510 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);
512 h->sps->vui.hrd.i_initial_cpb_removal_delay_length = 2 + x264_clip3( 32 - x264_clz( max_delay ), 4, 22 );
513 h->sps->vui.hrd.i_cpb_removal_delay_length = x264_clip3( 32 - x264_clz( max_cpb_output_delay ), 4, 31 );
514 h->sps->vui.hrd.i_dpb_output_delay_length = x264_clip3( 32 - x264_clz( max_dpb_output_delay ), 4, 31 );
518 vbv_buffer_size = h->sps->vui.hrd.i_cpb_size_unscaled;
519 vbv_max_bitrate = h->sps->vui.hrd.i_bit_rate_unscaled;
521 else if( h->param.i_nal_hrd && !b_init )
523 x264_log( h, X264_LOG_WARNING, "VBV parameters cannot be changed when NAL HRD is in use\n" );
527 rc->buffer_rate = vbv_max_bitrate / rc->fps;
528 rc->vbv_max_rate = vbv_max_bitrate;
529 rc->buffer_size = vbv_buffer_size;
530 rc->single_frame_vbv = rc->buffer_rate * 1.1 > rc->buffer_size;
531 rc->cbr_decay = 1.0 - rc->buffer_rate / rc->buffer_size
532 * 0.5 * X264_MAX(0, 1.5 - rc->buffer_rate * rc->fps / rc->bitrate);
533 if( h->param.rc.i_rc_method == X264_RC_CRF && h->param.rc.f_rf_constant_max )
535 rc->rate_factor_max_increment = h->param.rc.f_rf_constant_max - h->param.rc.f_rf_constant;
536 if( rc->rate_factor_max_increment <= 0 )
538 x264_log( h, X264_LOG_WARNING, "CRF max must be greater than CRF\n" );
539 rc->rate_factor_max_increment = 0;
544 if( h->param.rc.f_vbv_buffer_init > 1. )
545 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 );
546 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);
547 rc->buffer_fill_final = rc->buffer_size * h->param.rc.f_vbv_buffer_init * h->sps->vui.i_time_scale;
549 rc->b_vbv_min_rate = !rc->b_2pass
550 && h->param.rc.i_rc_method == X264_RC_ABR
551 && h->param.rc.i_vbv_max_bitrate <= h->param.rc.i_bitrate;
556 int x264_ratecontrol_new( x264_t *h )
558 x264_ratecontrol_t *rc;
562 CHECKED_MALLOCZERO( h->rc, h->param.i_threads * sizeof(x264_ratecontrol_t) );
565 rc->b_abr = h->param.rc.i_rc_method != X264_RC_CQP && !h->param.rc.b_stat_read;
566 rc->b_2pass = h->param.rc.i_rc_method == X264_RC_ABR && h->param.rc.b_stat_read;
568 /* FIXME: use integers */
569 if( h->param.i_fps_num > 0 && h->param.i_fps_den > 0 )
570 rc->fps = (float) h->param.i_fps_num / h->param.i_fps_den;
574 if( h->param.rc.b_mb_tree )
576 h->param.rc.f_pb_factor = 1;
580 rc->qcompress = h->param.rc.f_qcompress;
582 rc->bitrate = h->param.rc.i_bitrate * 1000.;
583 rc->rate_tolerance = h->param.rc.f_rate_tolerance;
584 rc->nmb = h->mb.i_mb_count;
585 rc->last_non_b_pict_type = -1;
588 if( h->param.rc.i_rc_method == X264_RC_CRF && h->param.rc.b_stat_read )
590 x264_log(h, X264_LOG_ERROR, "constant rate-factor is incompatible with 2pass.\n");
594 x264_ratecontrol_init_reconfigurable( h, 1 );
596 if( h->param.i_nal_hrd )
598 uint64_t denom = (uint64_t)h->sps->vui.hrd.i_bit_rate_unscaled * h->sps->vui.i_time_scale;
599 uint64_t num = 180000;
600 x264_reduce_fraction64( &num, &denom );
601 rc->hrd_multiply_denom = 180000 / num;
603 double bits_required = log2( 180000 / rc->hrd_multiply_denom )
604 + log2( h->sps->vui.i_time_scale )
605 + log2( h->sps->vui.hrd.i_cpb_size_unscaled );
606 if( bits_required >= 63 )
608 x264_log( h, X264_LOG_ERROR, "HRD with very large timescale and bufsize not supported\n" );
613 if( rc->rate_tolerance < 0.01 )
615 x264_log(h, X264_LOG_WARNING, "bitrate tolerance too small, using .01\n");
616 rc->rate_tolerance = 0.01;
619 h->mb.b_variable_qp = rc->b_vbv || h->param.rc.i_aq_mode;
623 /* FIXME ABR_INIT_QP is actually used only in CRF */
624 #define ABR_INIT_QP ( h->param.rc.i_rc_method == X264_RC_CRF ? h->param.rc.f_rf_constant : 24 )
625 rc->accum_p_norm = .01;
626 rc->accum_p_qp = ABR_INIT_QP * rc->accum_p_norm;
627 /* estimated ratio that produces a reasonable QP for the first I-frame */
628 rc->cplxr_sum = .01 * pow( 7.0e5, rc->qcompress ) * pow( h->mb.i_mb_count, 0.5 );
629 rc->wanted_bits_window = 1.0 * rc->bitrate / rc->fps;
630 rc->last_non_b_pict_type = SLICE_TYPE_I;
633 rc->ip_offset = 6.0 * log2f( h->param.rc.f_ip_factor );
634 rc->pb_offset = 6.0 * log2f( h->param.rc.f_pb_factor );
635 rc->qp_constant[SLICE_TYPE_P] = h->param.rc.i_qp_constant;
636 rc->qp_constant[SLICE_TYPE_I] = x264_clip3( h->param.rc.i_qp_constant - rc->ip_offset + 0.5, 0, QP_MAX );
637 rc->qp_constant[SLICE_TYPE_B] = x264_clip3( h->param.rc.i_qp_constant + rc->pb_offset + 0.5, 0, QP_MAX );
638 h->mb.ip_offset = rc->ip_offset + 0.5;
640 rc->lstep = pow( 2, h->param.rc.i_qp_step / 6.0 );
641 rc->last_qscale = qp2qscale( 26 );
642 int num_preds = h->param.b_sliced_threads * h->param.i_threads + 1;
643 CHECKED_MALLOC( rc->pred, 5 * sizeof(predictor_t) * num_preds );
644 CHECKED_MALLOC( rc->pred_b_from_p, sizeof(predictor_t) );
645 for( int i = 0; i < 3; i++ )
647 rc->last_qscale_for[i] = qp2qscale( ABR_INIT_QP );
648 rc->lmin[i] = qp2qscale( h->param.rc.i_qp_min );
649 rc->lmax[i] = qp2qscale( h->param.rc.i_qp_max );
650 for( int j = 0; j < num_preds; j++ )
652 rc->pred[i+j*5].coeff= 2.0;
653 rc->pred[i+j*5].count= 1.0;
654 rc->pred[i+j*5].decay= 0.5;
655 rc->pred[i+j*5].offset= 0.0;
657 for( int j = 0; j < 2; j++ )
659 rc->row_preds[i][j].coeff= .25;
660 rc->row_preds[i][j].count= 1.0;
661 rc->row_preds[i][j].decay= 0.5;
662 rc->row_preds[i][j].offset= 0.0;
665 *rc->pred_b_from_p = rc->pred[0];
667 if( parse_zones( h ) < 0 )
669 x264_log( h, X264_LOG_ERROR, "failed to parse zones\n" );
673 /* Load stat file and init 2pass algo */
674 if( h->param.rc.b_stat_read )
676 char *p, *stats_in, *stats_buf;
678 /* read 1st pass stats */
679 assert( h->param.rc.psz_stat_in );
680 stats_buf = stats_in = x264_slurp_file( h->param.rc.psz_stat_in );
683 x264_log(h, X264_LOG_ERROR, "ratecontrol_init: can't open stats file\n");
686 if( h->param.rc.b_mb_tree )
688 char *mbtree_stats_in = x264_strcat_filename( h->param.rc.psz_stat_in, ".mbtree" );
689 if( !mbtree_stats_in )
691 rc->p_mbtree_stat_file_in = fopen( mbtree_stats_in, "rb" );
692 x264_free( mbtree_stats_in );
693 if( !rc->p_mbtree_stat_file_in )
695 x264_log(h, X264_LOG_ERROR, "ratecontrol_init: can't open mbtree stats file\n");
700 /* check whether 1st pass options were compatible with current options */
701 if( !strncmp( stats_buf, "#options:", 9 ) )
705 char *opts = stats_buf;
706 stats_in = strchr( stats_buf, '\n' );
711 if( sscanf( opts, "#options: %dx%d", &i, &j ) != 2 )
713 x264_log( h, X264_LOG_ERROR, "resolution specified in stats file not valid\n" );
716 else if( h->param.rc.b_mb_tree && (i != h->param.i_width || j != h->param.i_height) )
718 x264_log( h, X264_LOG_ERROR, "MB-tree doesn't support different resolution than 1st pass (%dx%d vs %dx%d)\n",
719 h->param.i_width, h->param.i_height, i, j );
723 if( ( p = strstr( opts, "timebase=" ) ) && sscanf( p, "timebase=%u/%u", &k, &l ) != 2 )
725 x264_log( h, X264_LOG_ERROR, "timebase specified in stats file not valid\n" );
728 if( k != h->param.i_timebase_num || l != h->param.i_timebase_den )
730 x264_log( h, X264_LOG_ERROR, "timebase mismatch with 1st pass (%u/%u vs %u/%u)\n",
731 h->param.i_timebase_num, h->param.i_timebase_den, k, l );
735 CMP_OPT_FIRST_PASS( "weightp", X264_MAX( 0, h->param.analyse.i_weighted_pred ) );
736 CMP_OPT_FIRST_PASS( "bframes", h->param.i_bframe );
737 CMP_OPT_FIRST_PASS( "b_pyramid", h->param.i_bframe_pyramid );
738 CMP_OPT_FIRST_PASS( "intra_refresh", h->param.b_intra_refresh );
739 CMP_OPT_FIRST_PASS( "open_gop", h->param.i_open_gop );
741 if( (p = strstr( opts, "keyint=" )) )
744 char buf[13] = "infinite ";
745 if( h->param.i_keyint_max != X264_KEYINT_MAX_INFINITE )
746 sprintf( buf, "%d ", h->param.i_keyint_max );
747 if( strncmp( p, buf, strlen(buf) ) )
749 x264_log( h, X264_LOG_ERROR, "different keyint setting than first pass (%.*s vs %.*s)\n",
750 strlen(buf)-1, buf, strcspn(p, " "), p );
755 if( strstr( opts, "qp=0" ) && h->param.rc.i_rc_method == X264_RC_ABR )
756 x264_log( h, X264_LOG_WARNING, "1st pass was lossless, bitrate prediction will be inaccurate\n" );
758 if( !strstr( opts, "direct=3" ) && h->param.analyse.i_direct_mv_pred == X264_DIRECT_PRED_AUTO )
760 x264_log( h, X264_LOG_WARNING, "direct=auto not used on the first pass\n" );
761 h->mb.b_direct_auto_write = 1;
764 if( ( p = strstr( opts, "b_adapt=" ) ) && sscanf( p, "b_adapt=%d", &i ) && i >= X264_B_ADAPT_NONE && i <= X264_B_ADAPT_TRELLIS )
765 h->param.i_bframe_adaptive = i;
766 else if( h->param.i_bframe )
768 x264_log( h, X264_LOG_ERROR, "b_adapt method specified in stats file not valid\n" );
772 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 ) )
773 h->param.rc.i_lookahead = i;
776 /* find number of pics */
779 for( num_entries = -1; p; num_entries++ )
780 p = strchr( p + 1, ';' );
783 x264_log(h, X264_LOG_ERROR, "empty stats file\n");
786 rc->num_entries = num_entries;
788 if( h->param.i_frame_total < rc->num_entries && h->param.i_frame_total > 0 )
790 x264_log( h, X264_LOG_WARNING, "2nd pass has fewer frames than 1st pass (%d vs %d)\n",
791 h->param.i_frame_total, rc->num_entries );
793 if( h->param.i_frame_total > rc->num_entries )
795 x264_log( h, X264_LOG_ERROR, "2nd pass has more frames than 1st pass (%d vs %d)\n",
796 h->param.i_frame_total, rc->num_entries );
800 CHECKED_MALLOCZERO( rc->entry, rc->num_entries * sizeof(ratecontrol_entry_t) );
802 /* init all to skipped p frames */
803 for( int i = 0; i < rc->num_entries; i++ )
805 ratecontrol_entry_t *rce = &rc->entry[i];
806 rce->pict_type = SLICE_TYPE_P;
807 rce->qscale = rce->new_qscale = qp2qscale( 20 );
808 rce->misc_bits = rc->nmb + 10;
814 for( int i = 0; i < rc->num_entries; i++ )
816 ratecontrol_entry_t *rce;
824 next= strchr(p, ';');
826 *next++ = 0; //sscanf is unbelievably slow on long strings
827 e = sscanf( p, " in:%d ", &frame_number );
829 if( frame_number < 0 || frame_number >= rc->num_entries )
831 x264_log( h, X264_LOG_ERROR, "bad frame number (%d) at stats line %d\n", frame_number, i );
834 rce = &rc->entry[frame_number];
835 rce->direct_mode = 0;
837 e += sscanf( p, " in:%*d out:%*d type:%c dur:%d cpbdur:%d q:%f tex:%d mv:%d misc:%d imb:%d pmb:%d smb:%d d:%c",
838 &pict_type, &rce->i_duration, &rce->i_cpb_duration, &qp, &rce->tex_bits,
839 &rce->mv_bits, &rce->misc_bits, &rce->i_count, &rce->p_count,
840 &rce->s_count, &rce->direct_mode );
842 p = strstr( p, "ref:" );
846 for( ref = 0; ref < 16; ref++ )
848 if( sscanf( p, " %d", &rce->refcount[ref] ) != 1 )
850 p = strchr( p+1, ' ' );
857 rce->i_weight_denom = -1;
858 char *w = strchr( p, 'w' );
860 if( sscanf( w, "w:%hd,%hd,%hd", &rce->i_weight_denom, &rce->weight[0], &rce->weight[1] ) != 3 )
861 rce->i_weight_denom = -1;
863 if( pict_type != 'b' )
864 rce->kept_as_ref = 1;
868 rce->frame_type = X264_TYPE_IDR;
869 rce->pict_type = SLICE_TYPE_I;
872 rce->frame_type = X264_TYPE_I;
873 rce->pict_type = SLICE_TYPE_I;
876 rce->frame_type = X264_TYPE_P;
877 rce->pict_type = SLICE_TYPE_P;
880 rce->frame_type = X264_TYPE_BREF;
881 rce->pict_type = SLICE_TYPE_B;
884 rce->frame_type = X264_TYPE_B;
885 rce->pict_type = SLICE_TYPE_B;
887 default: e = -1; break;
892 x264_log( h, X264_LOG_ERROR, "statistics are damaged at line %d, parser out=%d\n", i, e );
895 rce->qscale = qp2qscale( qp );
899 x264_free( stats_buf );
901 if( h->param.rc.i_rc_method == X264_RC_ABR )
903 if( init_pass2( h ) < 0 )
905 } /* else we're using constant quant, so no need to run the bitrate allocation */
908 /* Open output file */
909 /* If input and output files are the same, output to a temp file
910 * and move it to the real name only when it's complete */
911 if( h->param.rc.b_stat_write )
914 rc->psz_stat_file_tmpname = x264_strcat_filename( h->param.rc.psz_stat_out, ".temp" );
915 if( !rc->psz_stat_file_tmpname )
918 rc->p_stat_file_out = fopen( rc->psz_stat_file_tmpname, "wb" );
919 if( rc->p_stat_file_out == NULL )
921 x264_log(h, X264_LOG_ERROR, "ratecontrol_init: can't open stats file\n");
925 p = x264_param2string( &h->param, 1 );
927 fprintf( rc->p_stat_file_out, "#options: %s\n", p );
929 if( h->param.rc.b_mb_tree && !h->param.rc.b_stat_read )
931 rc->psz_mbtree_stat_file_tmpname = x264_strcat_filename( h->param.rc.psz_stat_out, ".mbtree.temp" );
932 rc->psz_mbtree_stat_file_name = x264_strcat_filename( h->param.rc.psz_stat_out, ".mbtree" );
933 if( !rc->psz_mbtree_stat_file_tmpname || !rc->psz_mbtree_stat_file_name )
936 rc->p_mbtree_stat_file_out = fopen( rc->psz_mbtree_stat_file_tmpname, "wb" );
937 if( rc->p_mbtree_stat_file_out == NULL )
939 x264_log(h, X264_LOG_ERROR, "ratecontrol_init: can't open mbtree stats file\n");
945 if( h->param.rc.b_mb_tree && (h->param.rc.b_stat_read || h->param.rc.b_stat_write) )
947 CHECKED_MALLOC( rc->qp_buffer[0], h->mb.i_mb_count * sizeof(uint16_t) );
948 if( h->param.i_bframe_pyramid && h->param.rc.b_stat_read )
949 CHECKED_MALLOC( rc->qp_buffer[1], h->mb.i_mb_count * sizeof(uint16_t) );
953 for( int i = 0; i<h->param.i_threads; i++ )
955 h->thread[i]->rc = rc+i;
959 h->thread[i]->param = h->param;
960 h->thread[i]->mb.b_variable_qp = h->mb.b_variable_qp;
969 static int parse_zone( x264_t *h, x264_zone_t *z, char *p )
972 char *tok, UNUSED *saveptr=NULL;
974 z->f_bitrate_factor = 1;
975 if( 3 <= sscanf(p, "%u,%u,q=%u%n", &z->i_start, &z->i_end, &z->i_qp, &len) )
977 else if( 3 <= sscanf(p, "%u,%u,b=%f%n", &z->i_start, &z->i_end, &z->f_bitrate_factor, &len) )
979 else if( 2 <= sscanf(p, "%u,%u%n", &z->i_start, &z->i_end, &len) )
983 x264_log( h, X264_LOG_ERROR, "invalid zone: \"%s\"\n", p );
989 CHECKED_MALLOC( z->param, sizeof(x264_param_t) );
990 memcpy( z->param, &h->param, sizeof(x264_param_t) );
991 z->param->param_free = x264_free;
992 while( (tok = strtok_r( p, ",", &saveptr )) )
994 char *val = strchr( tok, '=' );
1000 if( x264_param_parse( z->param, tok, val ) )
1002 x264_log( h, X264_LOG_ERROR, "invalid zone param: %s = %s\n", tok, val );
1012 static int parse_zones( x264_t *h )
1014 x264_ratecontrol_t *rc = h->rc;
1015 if( h->param.rc.psz_zones && !h->param.rc.i_zones )
1017 char *psz_zones, *p;
1018 CHECKED_MALLOC( psz_zones, strlen( h->param.rc.psz_zones )+1 );
1019 strcpy( psz_zones, h->param.rc.psz_zones );
1020 h->param.rc.i_zones = 1;
1021 for( p = psz_zones; *p; p++ )
1022 h->param.rc.i_zones += (*p == '/');
1023 CHECKED_MALLOC( h->param.rc.zones, h->param.rc.i_zones * sizeof(x264_zone_t) );
1025 for( int i = 0; i < h->param.rc.i_zones; i++ )
1027 int i_tok = strcspn( p, "/" );
1029 if( parse_zone( h, &h->param.rc.zones[i], p ) )
1033 x264_free( psz_zones );
1036 if( h->param.rc.i_zones > 0 )
1038 for( int i = 0; i < h->param.rc.i_zones; i++ )
1040 x264_zone_t z = h->param.rc.zones[i];
1041 if( z.i_start < 0 || z.i_start > z.i_end )
1043 x264_log( h, X264_LOG_ERROR, "invalid zone: start=%d end=%d\n",
1044 z.i_start, z.i_end );
1047 else if( !z.b_force_qp && z.f_bitrate_factor <= 0 )
1049 x264_log( h, X264_LOG_ERROR, "invalid zone: bitrate_factor=%f\n",
1050 z.f_bitrate_factor );
1055 rc->i_zones = h->param.rc.i_zones + 1;
1056 CHECKED_MALLOC( rc->zones, rc->i_zones * sizeof(x264_zone_t) );
1057 memcpy( rc->zones+1, h->param.rc.zones, (rc->i_zones-1) * sizeof(x264_zone_t) );
1059 // default zone to fall back to if none of the others match
1060 rc->zones[0].i_start = 0;
1061 rc->zones[0].i_end = INT_MAX;
1062 rc->zones[0].b_force_qp = 0;
1063 rc->zones[0].f_bitrate_factor = 1;
1064 CHECKED_MALLOC( rc->zones[0].param, sizeof(x264_param_t) );
1065 memcpy( rc->zones[0].param, &h->param, sizeof(x264_param_t) );
1066 for( int i = 1; i < rc->i_zones; i++ )
1068 if( !rc->zones[i].param )
1069 rc->zones[i].param = rc->zones[0].param;
1078 static x264_zone_t *get_zone( x264_t *h, int frame_num )
1080 for( int i = h->rc->i_zones - 1; i >= 0; i-- )
1082 x264_zone_t *z = &h->rc->zones[i];
1083 if( frame_num >= z->i_start && frame_num <= z->i_end )
1089 void x264_ratecontrol_summary( x264_t *h )
1091 x264_ratecontrol_t *rc = h->rc;
1092 if( rc->b_abr && h->param.rc.i_rc_method == X264_RC_ABR && rc->cbr_decay > .9999 )
1094 double base_cplx = h->mb.i_mb_count * (h->param.i_bframe ? 120 : 80);
1095 double mbtree_offset = h->param.rc.b_mb_tree ? (1.0-h->param.rc.f_qcompress)*13.5 : 0;
1096 x264_log( h, X264_LOG_INFO, "final ratefactor: %.2f\n",
1097 qscale2qp( pow( base_cplx, 1 - rc->qcompress )
1098 * rc->cplxr_sum / rc->wanted_bits_window ) - mbtree_offset );
1102 void x264_ratecontrol_delete( x264_t *h )
1104 x264_ratecontrol_t *rc = h->rc;
1107 if( rc->p_stat_file_out )
1109 b_regular_file = x264_is_regular_file( rc->p_stat_file_out );
1110 fclose( rc->p_stat_file_out );
1111 if( h->i_frame >= rc->num_entries && b_regular_file )
1112 if( rename( rc->psz_stat_file_tmpname, h->param.rc.psz_stat_out ) != 0 )
1114 x264_log( h, X264_LOG_ERROR, "failed to rename \"%s\" to \"%s\"\n",
1115 rc->psz_stat_file_tmpname, h->param.rc.psz_stat_out );
1117 x264_free( rc->psz_stat_file_tmpname );
1119 if( rc->p_mbtree_stat_file_out )
1121 b_regular_file = x264_is_regular_file( rc->p_mbtree_stat_file_out );
1122 fclose( rc->p_mbtree_stat_file_out );
1123 if( h->i_frame >= rc->num_entries && b_regular_file )
1124 if( rename( rc->psz_mbtree_stat_file_tmpname, rc->psz_mbtree_stat_file_name ) != 0 )
1126 x264_log( h, X264_LOG_ERROR, "failed to rename \"%s\" to \"%s\"\n",
1127 rc->psz_mbtree_stat_file_tmpname, rc->psz_mbtree_stat_file_name );
1129 x264_free( rc->psz_mbtree_stat_file_tmpname );
1130 x264_free( rc->psz_mbtree_stat_file_name );
1132 if( rc->p_mbtree_stat_file_in )
1133 fclose( rc->p_mbtree_stat_file_in );
1134 x264_free( rc->pred );
1135 x264_free( rc->pred_b_from_p );
1136 x264_free( rc->entry );
1137 x264_free( rc->qp_buffer[0] );
1138 x264_free( rc->qp_buffer[1] );
1141 x264_free( rc->zones[0].param );
1142 for( int i = 1; i < rc->i_zones; i++ )
1143 if( rc->zones[i].param != rc->zones[0].param && rc->zones[i].param->param_free )
1144 rc->zones[i].param->param_free( rc->zones[i].param );
1145 x264_free( rc->zones );
1150 static void accum_p_qp_update( x264_t *h, float qp )
1152 x264_ratecontrol_t *rc = h->rc;
1153 rc->accum_p_qp *= .95;
1154 rc->accum_p_norm *= .95;
1155 rc->accum_p_norm += 1;
1156 if( h->sh.i_type == SLICE_TYPE_I )
1157 rc->accum_p_qp += qp + rc->ip_offset;
1159 rc->accum_p_qp += qp;
1162 /* Before encoding a frame, choose a QP for it */
1163 void x264_ratecontrol_start( x264_t *h, int i_force_qp, int overhead )
1165 x264_ratecontrol_t *rc = h->rc;
1166 ratecontrol_entry_t *rce = NULL;
1167 x264_zone_t *zone = get_zone( h, h->fenc->i_frame );
1172 if( zone && (!rc->prev_zone || zone->param != rc->prev_zone->param) )
1173 x264_encoder_reconfig( h, zone->param );
1174 rc->prev_zone = zone;
1176 rc->qp_force = i_force_qp;
1178 if( h->param.rc.b_stat_read )
1180 int frame = h->fenc->i_frame;
1181 assert( frame >= 0 && frame < rc->num_entries );
1182 rce = h->rc->rce = &h->rc->entry[frame];
1184 if( h->sh.i_type == SLICE_TYPE_B
1185 && h->param.analyse.i_direct_mv_pred == X264_DIRECT_PRED_AUTO )
1187 h->sh.b_direct_spatial_mv_pred = ( rce->direct_mode == 's' );
1188 h->mb.b_direct_auto_read = ( rce->direct_mode == 's' || rce->direct_mode == 't' );
1194 memset( h->fdec->i_row_bits, 0, h->mb.i_mb_height * sizeof(int) );
1195 rc->row_pred = &rc->row_preds[h->sh.i_type];
1196 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;
1197 update_vbv_plan( h, overhead );
1199 const x264_level_t *l = x264_levels;
1200 while( l->level_idc != 0 && l->level_idc != h->param.i_level_idc )
1203 int mincr = l->mincr;
1205 /* Blu-ray requires this */
1206 if( l->level_idc == 41 && h->param.i_nal_hrd )
1209 /* High 10 doesn't require minCR, so just set the maximum to a large value. */
1210 if( h->sps->i_profile_idc == PROFILE_HIGH10 )
1211 rc->frame_size_maximum = 1e9;
1214 /* The spec has a bizarre special case for the first frame. */
1215 if( h->i_frame == 0 )
1217 //384 * ( Max( PicSizeInMbs, fR * MaxMBPS ) + MaxMBPS * ( tr( 0 ) - tr,n( 0 ) ) ) / MinCR
1218 double fr = 1. / 172;
1219 int pic_size_in_mbs = h->mb.i_mb_width * h->mb.i_mb_height;
1220 rc->frame_size_maximum = 384 * BIT_DEPTH * X264_MAX( pic_size_in_mbs, fr*l->mbps ) / mincr;
1224 //384 * MaxMBPS * ( tr( n ) - tr( n - 1 ) ) / MinCR
1225 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;
1230 if( h->sh.i_type != SLICE_TYPE_B )
1231 rc->bframes = h->fenc->i_bframes;
1237 else if( rc->b_abr )
1239 q = qscale2qp( rate_estimate_qscale( h ) );
1241 else if( rc->b_2pass )
1243 rce->new_qscale = rate_estimate_qscale( h );
1244 q = qscale2qp( rce->new_qscale );
1248 if( h->sh.i_type == SLICE_TYPE_B && h->fdec->b_kept_as_ref )
1249 q = ( rc->qp_constant[ SLICE_TYPE_B ] + rc->qp_constant[ SLICE_TYPE_P ] ) / 2;
1251 q = rc->qp_constant[ h->sh.i_type ];
1255 if( zone->b_force_qp )
1256 q += zone->i_qp - rc->qp_constant[SLICE_TYPE_P];
1258 q -= 6*log2f( zone->f_bitrate_factor );
1262 q = x264_clip3f( q, h->param.rc.i_qp_min, h->param.rc.i_qp_max );
1266 rc->qp = x264_clip3( (int)(q + 0.5), 0, QP_MAX );
1267 h->fdec->f_qp_avg_rc =
1268 h->fdec->f_qp_avg_aq =
1271 rce->new_qp = rc->qp;
1273 accum_p_qp_update( h, rc->qpm );
1275 if( h->sh.i_type != SLICE_TYPE_B )
1276 rc->last_non_b_pict_type = h->sh.i_type;
1279 static double predict_row_size( x264_t *h, int y, double qp )
1281 /* average between two predictors:
1282 * absolute SATD, and scaled bit cost of the colocated row in the previous frame */
1283 x264_ratecontrol_t *rc = h->rc;
1284 double pred_s = predict_size( rc->row_pred[0], qp2qscale( qp ), h->fdec->i_row_satd[y] );
1286 if( h->sh.i_type == SLICE_TYPE_I || qp >= h->fref0[0]->f_row_qp[y] )
1288 if( h->sh.i_type == SLICE_TYPE_P
1289 && h->fref0[0]->i_type == h->fdec->i_type
1290 && h->fref0[0]->i_row_satd[y] > 0
1291 && (abs(h->fref0[0]->i_row_satd[y] - h->fdec->i_row_satd[y]) < h->fdec->i_row_satd[y]/2))
1293 pred_t = h->fref0[0]->i_row_bits[y] * h->fdec->i_row_satd[y] / h->fref0[0]->i_row_satd[y]
1294 * qp2qscale( h->fref0[0]->f_row_qp[y] ) / qp2qscale( qp );
1298 return (pred_s + pred_t) / 2;
1300 /* Our QP is lower than the reference! */
1303 double pred_intra = predict_size( rc->row_pred[1], qp2qscale( qp ), h->fdec->i_row_satds[0][0][y] );
1304 /* Sum: better to overestimate than underestimate by using only one of the two predictors. */
1305 return pred_intra + pred_s;
1309 static double row_bits_so_far( x264_t *h, int y )
1312 for( int i = h->i_threadslice_start; i <= y; i++ )
1313 bits += h->fdec->i_row_bits[i];
1317 static double predict_row_size_sum( x264_t *h, int y, double qp )
1319 double bits = row_bits_so_far(h, y);
1320 for( int i = y+1; i < h->i_threadslice_end; i++ )
1321 bits += predict_row_size( h, i, qp );
1326 void x264_ratecontrol_mb( x264_t *h, int bits )
1328 x264_ratecontrol_t *rc = h->rc;
1329 const int y = h->mb.i_mb_y;
1333 h->fdec->i_row_bits[y] += bits;
1334 rc->qpa_rc += rc->qpm;
1335 rc->qpa_aq += h->mb.i_qp;
1337 if( h->mb.i_mb_x != h->mb.i_mb_width - 1 || !rc->b_vbv )
1340 h->fdec->f_row_qp[y] = rc->qpm;
1342 update_predictor( rc->row_pred[0], qp2qscale( rc->qpm ), h->fdec->i_row_satd[y], h->fdec->i_row_bits[y] );
1343 if( h->sh.i_type == SLICE_TYPE_P && rc->qpm < h->fref0[0]->f_row_qp[y] )
1344 update_predictor( rc->row_pred[1], qp2qscale( rc->qpm ), h->fdec->i_row_satds[0][0][y], h->fdec->i_row_bits[y] );
1346 /* tweak quality based on difference from predicted size */
1347 if( y < h->i_threadslice_end-1 )
1349 float prev_row_qp = h->fdec->f_row_qp[y];
1350 float qp_min = X264_MAX( prev_row_qp - h->param.rc.i_qp_step, h->param.rc.i_qp_min );
1351 float qp_absolute_max = h->param.rc.i_qp_max;
1352 if( rc->rate_factor_max_increment )
1353 qp_absolute_max = X264_MIN( qp_absolute_max, rc->qp_novbv + rc->rate_factor_max_increment );
1354 float qp_max = X264_MIN( prev_row_qp + h->param.rc.i_qp_step, qp_absolute_max );
1355 float step_size = 0.5;
1357 /* B-frames shouldn't use lower QP than their reference frames. */
1358 if( h->sh.i_type == SLICE_TYPE_B )
1360 qp_min = X264_MAX( qp_min, X264_MAX( h->fref0[0]->f_row_qp[y+1], h->fref1[0]->f_row_qp[y+1] ) );
1361 rc->qpm = X264_MAX( rc->qpm, qp_min );
1364 float buffer_left_planned = rc->buffer_fill - rc->frame_size_planned;
1365 float slice_size_planned = h->param.b_sliced_threads ? rc->slice_size_planned : rc->frame_size_planned;
1366 float max_frame_error = X264_MAX( 0.05, 1.0 / (h->mb.i_mb_height) );
1367 float size_of_other_slices = 0;
1368 if( h->param.b_sliced_threads )
1370 float size_of_other_slices_planned = 0;
1371 for( int i = 0; i < h->param.i_threads; i++ )
1372 if( h != h->thread[i] )
1374 size_of_other_slices += h->thread[i]->rc->frame_size_estimated;
1375 size_of_other_slices_planned += h->thread[i]->rc->slice_size_planned;
1377 float weight = rc->slice_size_planned / rc->frame_size_planned;
1378 size_of_other_slices = (size_of_other_slices - size_of_other_slices_planned) * weight + size_of_other_slices_planned;
1381 /* More threads means we have to be more cautious in letting ratecontrol use up extra bits. */
1382 float rc_tol = buffer_left_planned / h->param.i_threads * rc->rate_tolerance;
1383 int b1 = predict_row_size_sum( h, y, rc->qpm ) + size_of_other_slices;
1385 /* Don't modify the row QPs until a sufficent amount of the bits of the frame have been processed, in case a flat */
1386 /* area at the top of the frame was measured inaccurately. */
1387 if( row_bits_so_far( h, y ) < 0.05 * slice_size_planned )
1390 if( h->sh.i_type != SLICE_TYPE_I )
1393 if( !rc->b_vbv_min_rate )
1394 qp_min = X264_MAX( qp_min, rc->qp_novbv );
1396 while( rc->qpm < qp_max
1397 && ((b1 > rc->frame_size_planned + rc_tol) ||
1398 (rc->buffer_fill - b1 < buffer_left_planned * 0.5) ||
1399 (b1 > rc->frame_size_planned && rc->qpm < rc->qp_novbv)) )
1401 rc->qpm += step_size;
1402 b1 = predict_row_size_sum( h, y, rc->qpm ) + size_of_other_slices;
1405 while( rc->qpm > qp_min
1406 && (rc->qpm > h->fdec->f_row_qp[0] || rc->single_frame_vbv)
1407 && ((b1 < rc->frame_size_planned * 0.8 && rc->qpm <= prev_row_qp)
1408 || b1 < (rc->buffer_fill - rc->buffer_size + rc->buffer_rate) * 1.1) )
1410 rc->qpm -= step_size;
1411 b1 = predict_row_size_sum( h, y, rc->qpm ) + size_of_other_slices;
1414 /* avoid VBV underflow or MinCR violation */
1415 while( (rc->qpm < qp_absolute_max)
1416 && ((rc->buffer_fill - b1 < rc->buffer_rate * max_frame_error) ||
1417 (rc->frame_size_maximum - b1 < rc->frame_size_maximum * max_frame_error)))
1419 rc->qpm += step_size;
1420 b1 = predict_row_size_sum( h, y, rc->qpm ) + size_of_other_slices;
1423 h->rc->frame_size_estimated = predict_row_size_sum( h, y, rc->qpm );
1427 int x264_ratecontrol_qp( x264_t *h )
1430 return x264_clip3( h->rc->qpm + .5, h->param.rc.i_qp_min, h->param.rc.i_qp_max );
1433 int x264_ratecontrol_mb_qp( x264_t *h )
1436 float qp = h->rc->qpm;
1437 if( h->param.rc.i_aq_mode )
1438 /* MB-tree currently doesn't adjust quantizers in unreferenced frames. */
1439 qp += 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];
1440 return x264_clip3( qp + .5, h->param.rc.i_qp_min, h->param.rc.i_qp_max );
1443 /* In 2pass, force the same frame types as in the 1st pass */
1444 int x264_ratecontrol_slice_type( x264_t *h, int frame_num )
1446 x264_ratecontrol_t *rc = h->rc;
1447 if( h->param.rc.b_stat_read )
1449 if( frame_num >= rc->num_entries )
1451 /* We could try to initialize everything required for ABR and
1452 * adaptive B-frames, but that would be complicated.
1453 * So just calculate the average QP used so far. */
1454 h->param.rc.i_qp_constant = (h->stat.i_frame_count[SLICE_TYPE_P] == 0) ? 24
1455 : 1 + h->stat.f_frame_qp[SLICE_TYPE_P] / h->stat.i_frame_count[SLICE_TYPE_P];
1456 rc->qp_constant[SLICE_TYPE_P] = x264_clip3( h->param.rc.i_qp_constant, 0, QP_MAX );
1457 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 );
1458 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 );
1460 x264_log(h, X264_LOG_ERROR, "2nd pass has more frames than 1st pass (%d)\n", rc->num_entries);
1461 x264_log(h, X264_LOG_ERROR, "continuing anyway, at constant QP=%d\n", h->param.rc.i_qp_constant);
1462 if( h->param.i_bframe_adaptive )
1463 x264_log(h, X264_LOG_ERROR, "disabling adaptive B-frames\n");
1465 for( int i = 0; i < h->param.i_threads; i++ )
1467 h->thread[i]->rc->b_abr = 0;
1468 h->thread[i]->rc->b_2pass = 0;
1469 h->thread[i]->param.rc.i_rc_method = X264_RC_CQP;
1470 h->thread[i]->param.rc.b_stat_read = 0;
1471 h->thread[i]->param.i_bframe_adaptive = 0;
1472 h->thread[i]->param.i_scenecut_threshold = 0;
1473 h->thread[i]->param.rc.b_mb_tree = 0;
1474 if( h->thread[i]->param.i_bframe > 1 )
1475 h->thread[i]->param.i_bframe = 1;
1477 return X264_TYPE_AUTO;
1479 return rc->entry[frame_num].frame_type;
1482 return X264_TYPE_AUTO;
1485 void x264_ratecontrol_set_weights( x264_t *h, x264_frame_t *frm )
1487 ratecontrol_entry_t *rce = &h->rc->entry[frm->i_frame];
1488 if( h->param.analyse.i_weighted_pred <= 0 )
1490 if( rce->i_weight_denom >= 0 )
1491 SET_WEIGHT( frm->weight[0][0], 1, rce->weight[0], rce->i_weight_denom, rce->weight[1] );
1494 /* After encoding one frame, save stats and update ratecontrol state */
1495 int x264_ratecontrol_end( x264_t *h, int bits, int *filler )
1497 x264_ratecontrol_t *rc = h->rc;
1498 const int *mbs = h->stat.frame.i_mb_count;
1502 h->stat.frame.i_mb_count_skip = mbs[P_SKIP] + mbs[B_SKIP];
1503 h->stat.frame.i_mb_count_i = mbs[I_16x16] + mbs[I_8x8] + mbs[I_4x4];
1504 h->stat.frame.i_mb_count_p = mbs[P_L0] + mbs[P_8x8];
1505 for( int i = B_DIRECT; i < B_8x8; i++ )
1506 h->stat.frame.i_mb_count_p += mbs[i];
1508 h->fdec->f_qp_avg_rc = rc->qpa_rc /= h->mb.i_mb_count;
1509 h->fdec->f_qp_avg_aq = rc->qpa_aq /= h->mb.i_mb_count;
1511 if( h->param.rc.b_stat_write )
1513 char c_type = h->sh.i_type==SLICE_TYPE_I ? (h->fenc->i_poc==0 ? 'I' : 'i')
1514 : h->sh.i_type==SLICE_TYPE_P ? 'P'
1515 : h->fenc->b_kept_as_ref ? 'B' : 'b';
1516 int dir_frame = h->stat.frame.i_direct_score[1] - h->stat.frame.i_direct_score[0];
1517 int dir_avg = h->stat.i_direct_score[1] - h->stat.i_direct_score[0];
1518 char c_direct = h->mb.b_direct_auto_write ?
1519 ( dir_frame>0 ? 's' : dir_frame<0 ? 't' :
1520 dir_avg>0 ? 's' : dir_avg<0 ? 't' : '-' )
1522 if( fprintf( rc->p_stat_file_out,
1523 "in:%d out:%d type:%c dur:%d cpbdur:%d q:%.2f tex:%d mv:%d misc:%d imb:%d pmb:%d smb:%d d:%c ref:",
1524 h->fenc->i_frame, h->i_frame,
1525 c_type, h->fenc->i_duration,
1526 h->fenc->i_cpb_duration, rc->qpa_rc,
1527 h->stat.frame.i_tex_bits,
1528 h->stat.frame.i_mv_bits,
1529 h->stat.frame.i_misc_bits,
1530 h->stat.frame.i_mb_count_i,
1531 h->stat.frame.i_mb_count_p,
1532 h->stat.frame.i_mb_count_skip,
1536 /* Only write information for reference reordering once. */
1537 int use_old_stats = h->param.rc.b_stat_read && rc->rce->refs > 1;
1538 for( int i = 0; i < (use_old_stats ? rc->rce->refs : h->i_ref0); i++ )
1540 int refcount = use_old_stats ? rc->rce->refcount[i]
1541 : h->param.b_interlaced ? h->stat.frame.i_mb_count_ref[0][i*2]
1542 + h->stat.frame.i_mb_count_ref[0][i*2+1]
1543 : h->stat.frame.i_mb_count_ref[0][i];
1544 if( fprintf( rc->p_stat_file_out, "%d ", refcount ) < 0 )
1548 if( h->sh.weight[0][0].weightfn )
1550 if( fprintf( rc->p_stat_file_out, "w:%"PRId32",%"PRId32",%"PRId32, h->sh.weight[0][0].i_denom, h->sh.weight[0][0].i_scale, h->sh.weight[0][0].i_offset ) < 0 )
1554 if( fprintf( rc->p_stat_file_out, ";\n") < 0 )
1557 /* Don't re-write the data in multi-pass mode. */
1558 if( h->param.rc.b_mb_tree && h->fenc->b_kept_as_ref && !h->param.rc.b_stat_read )
1560 uint8_t i_type = h->sh.i_type;
1561 /* Values are stored as big-endian FIX8.8 */
1562 for( int i = 0; i < h->mb.i_mb_count; i++ )
1563 rc->qp_buffer[0][i] = endian_fix16( h->fenc->f_qp_offset[i]*256.0 );
1564 if( fwrite( &i_type, 1, 1, rc->p_mbtree_stat_file_out ) < 1 )
1566 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 )
1573 if( h->sh.i_type != SLICE_TYPE_B )
1574 rc->cplxr_sum += bits * qp2qscale( rc->qpa_rc ) / rc->last_rceq;
1577 /* Depends on the fact that B-frame's QP is an offset from the following P-frame's.
1578 * Not perfectly accurate with B-refs, but good enough. */
1579 rc->cplxr_sum += bits * qp2qscale( rc->qpa_rc ) / (rc->last_rceq * fabs( h->param.rc.f_pb_factor ));
1581 rc->cplxr_sum *= rc->cbr_decay;
1582 double frame_duration = (double)h->fenc->i_duration * h->sps->vui.i_num_units_in_tick / h->sps->vui.i_time_scale;
1584 rc->wanted_bits_window += frame_duration * rc->bitrate;
1585 rc->wanted_bits_window *= rc->cbr_decay;
1589 rc->expected_bits_sum += qscale2bits( rc->rce, qp2qscale( rc->rce->new_qp ) );
1591 if( h->mb.b_variable_qp )
1593 if( h->sh.i_type == SLICE_TYPE_B )
1595 rc->bframe_bits += bits;
1596 if( h->fenc->b_last_minigop_bframe )
1598 update_predictor( rc->pred_b_from_p, qp2qscale( rc->qpa_rc ),
1599 h->fref1[h->i_ref1-1]->i_satd, rc->bframe_bits / rc->bframes );
1600 rc->bframe_bits = 0;
1605 *filler = update_vbv( h, bits );
1606 rc->filler_bits_sum += *filler * 8;
1608 if( h->sps->vui.b_nal_hrd_parameters_present )
1610 if( h->fenc->i_frame == 0 )
1612 // access unit initialises the HRD
1613 h->fenc->hrd_timing.cpb_initial_arrival_time = 0;
1614 rc->initial_cpb_removal_delay = h->initial_cpb_removal_delay;
1615 rc->initial_cpb_removal_delay_offset = h->initial_cpb_removal_delay_offset;
1616 h->fenc->hrd_timing.cpb_removal_time = rc->nrt_first_access_unit = (double)rc->initial_cpb_removal_delay / 90000;
1620 h->fenc->hrd_timing.cpb_removal_time = rc->nrt_first_access_unit + (double)h->fenc->i_cpb_delay *
1621 h->sps->vui.i_num_units_in_tick / h->sps->vui.i_time_scale;
1623 double cpb_earliest_arrival_time = h->fenc->hrd_timing.cpb_removal_time - (double)rc->initial_cpb_removal_delay / 90000;
1624 if( h->fenc->b_keyframe )
1626 rc->nrt_first_access_unit = h->fenc->hrd_timing.cpb_removal_time;
1627 rc->initial_cpb_removal_delay = h->initial_cpb_removal_delay;
1628 rc->initial_cpb_removal_delay_offset = h->initial_cpb_removal_delay_offset;
1631 cpb_earliest_arrival_time -= (double)rc->initial_cpb_removal_delay_offset / 90000;
1633 if( h->sps->vui.hrd.b_cbr_hrd )
1634 h->fenc->hrd_timing.cpb_initial_arrival_time = rc->previous_cpb_final_arrival_time;
1636 h->fenc->hrd_timing.cpb_initial_arrival_time = X264_MAX( rc->previous_cpb_final_arrival_time, cpb_earliest_arrival_time );
1638 int filler_bits = *filler ? X264_MAX( (FILLER_OVERHEAD - h->param.b_annexb), *filler )*8 : 0;
1640 h->fenc->hrd_timing.cpb_final_arrival_time = rc->previous_cpb_final_arrival_time = h->fenc->hrd_timing.cpb_initial_arrival_time +
1641 (double)(bits + filler_bits) / h->sps->vui.hrd.i_bit_rate_unscaled;
1643 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 +
1644 h->fenc->hrd_timing.cpb_removal_time;
1649 x264_log(h, X264_LOG_ERROR, "ratecontrol_end: stats file could not be written to\n");
1653 /****************************************************************************
1655 ***************************************************************************/
1658 * modify the bitrate curve from pass1 for one frame
1660 static double get_qscale(x264_t *h, ratecontrol_entry_t *rce, double rate_factor, int frame_num)
1662 x264_ratecontrol_t *rcc= h->rc;
1663 x264_zone_t *zone = get_zone( h, frame_num );
1664 double q = pow( rce->blurred_complexity, 1 - rcc->qcompress );
1666 // avoid NaN's in the rc_eq
1667 if( !isfinite(q) || rce->tex_bits + rce->mv_bits == 0 )
1668 q = rcc->last_qscale_for[rce->pict_type];
1673 rcc->last_qscale = q;
1678 if( zone->b_force_qp )
1679 q = qp2qscale( zone->i_qp );
1681 q /= zone->f_bitrate_factor;
1687 static double get_diff_limited_q(x264_t *h, ratecontrol_entry_t *rce, double q)
1689 x264_ratecontrol_t *rcc = h->rc;
1690 const int pict_type = rce->pict_type;
1692 // force I/B quants as a function of P quants
1693 const double last_p_q = rcc->last_qscale_for[SLICE_TYPE_P];
1694 const double last_non_b_q= rcc->last_qscale_for[rcc->last_non_b_pict_type];
1695 if( pict_type == SLICE_TYPE_I )
1698 double pq = qp2qscale( rcc->accum_p_qp / rcc->accum_p_norm );
1699 double ip_factor = fabs( h->param.rc.f_ip_factor );
1700 /* don't apply ip_factor if the following frame is also I */
1701 if( rcc->accum_p_norm <= 0 )
1703 else if( h->param.rc.f_ip_factor < 0 )
1705 else if( rcc->accum_p_norm >= 1 )
1708 q = rcc->accum_p_norm * pq / ip_factor + (1 - rcc->accum_p_norm) * iq;
1710 else if( pict_type == SLICE_TYPE_B )
1712 if( h->param.rc.f_pb_factor > 0 )
1714 if( !rce->kept_as_ref )
1715 q *= fabs( h->param.rc.f_pb_factor );
1717 else if( pict_type == SLICE_TYPE_P
1718 && rcc->last_non_b_pict_type == SLICE_TYPE_P
1719 && rce->tex_bits == 0 )
1724 /* last qscale / qdiff stuff */
1725 if( rcc->last_non_b_pict_type == pict_type &&
1726 (pict_type!=SLICE_TYPE_I || rcc->last_accum_p_norm < 1) )
1728 double last_q = rcc->last_qscale_for[pict_type];
1729 double max_qscale = last_q * rcc->lstep;
1730 double min_qscale = last_q / rcc->lstep;
1732 if ( q > max_qscale ) q = max_qscale;
1733 else if( q < min_qscale ) q = min_qscale;
1736 rcc->last_qscale_for[pict_type] = q;
1737 if( pict_type != SLICE_TYPE_B )
1738 rcc->last_non_b_pict_type = pict_type;
1739 if( pict_type == SLICE_TYPE_I )
1741 rcc->last_accum_p_norm = rcc->accum_p_norm;
1742 rcc->accum_p_norm = 0;
1743 rcc->accum_p_qp = 0;
1745 if( pict_type == SLICE_TYPE_P )
1747 float mask = 1 - pow( (float)rce->i_count / rcc->nmb, 2 );
1748 rcc->accum_p_qp = mask * (qscale2qp( q ) + rcc->accum_p_qp);
1749 rcc->accum_p_norm = mask * (1 + rcc->accum_p_norm);
1754 static double predict_size( predictor_t *p, double q, double var )
1756 return (p->coeff*var + p->offset) / (q*p->count);
1759 static void update_predictor( predictor_t *p, double q, double var, double bits )
1761 const double range = 1.5;
1764 double old_coeff = p->coeff / p->count;
1765 double new_coeff = bits*q / var;
1766 double new_coeff_clipped = x264_clip3f( new_coeff, old_coeff/range, old_coeff*range );
1767 double new_offset = bits*q - new_coeff_clipped * var;
1768 if( new_offset >= 0 )
1769 new_coeff = new_coeff_clipped;
1772 p->count *= p->decay;
1773 p->coeff *= p->decay;
1774 p->offset *= p->decay;
1776 p->coeff += new_coeff;
1777 p->offset += new_offset;
1780 // update VBV after encoding a frame
1781 static int update_vbv( x264_t *h, int bits )
1784 int bitrate = h->sps->vui.hrd.i_bit_rate_unscaled;
1785 x264_ratecontrol_t *rcc = h->rc;
1786 x264_ratecontrol_t *rct = h->thread[0]->rc;
1787 uint64_t buffer_size = (uint64_t)h->sps->vui.hrd.i_cpb_size_unscaled * h->sps->vui.i_time_scale;
1789 if( rcc->last_satd >= h->mb.i_mb_count )
1790 update_predictor( &rct->pred[h->sh.i_type], qp2qscale( rcc->qpa_rc ), rcc->last_satd, bits );
1795 rct->buffer_fill_final -= (uint64_t)bits * h->sps->vui.i_time_scale;
1797 if( rct->buffer_fill_final < 0 )
1798 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 );
1799 rct->buffer_fill_final = X264_MAX( rct->buffer_fill_final, 0 );
1800 rct->buffer_fill_final += (uint64_t)bitrate * h->sps->vui.i_num_units_in_tick * h->fenc->i_cpb_duration;
1802 if( h->sps->vui.hrd.b_cbr_hrd && rct->buffer_fill_final > buffer_size )
1804 filler = ceil( (rct->buffer_fill_final - buffer_size) / (8. * h->sps->vui.i_time_scale) );
1805 bits = X264_MAX( (FILLER_OVERHEAD - h->param.b_annexb), filler ) * 8;
1806 rct->buffer_fill_final -= (uint64_t)bits * h->sps->vui.i_time_scale;
1809 rct->buffer_fill_final = X264_MIN( rct->buffer_fill_final, buffer_size );
1814 void x264_hrd_fullness( x264_t *h )
1816 x264_ratecontrol_t *rct = h->thread[0]->rc;
1817 uint64_t denom = (uint64_t)h->sps->vui.hrd.i_bit_rate_unscaled * h->sps->vui.i_time_scale / rct->hrd_multiply_denom;
1818 uint64_t cpb_state = rct->buffer_fill_final;
1819 uint64_t cpb_size = (uint64_t)h->sps->vui.hrd.i_cpb_size_unscaled * h->sps->vui.i_time_scale;
1820 uint64_t multiply_factor = 180000 / rct->hrd_multiply_denom;
1822 if( rct->buffer_fill_final < 0 || rct->buffer_fill_final > cpb_size )
1824 x264_log( h, X264_LOG_WARNING, "CPB %s: %.0lf bits in a %.0lf-bit buffer\n",
1825 rct->buffer_fill_final < 0 ? "underflow" : "overflow", (float)rct->buffer_fill_final/denom, (float)cpb_size/denom );
1828 h->initial_cpb_removal_delay = (multiply_factor * cpb_state + denom) / (2*denom);
1829 h->initial_cpb_removal_delay_offset = (multiply_factor * cpb_size + denom) / (2*denom) - h->initial_cpb_removal_delay;
1832 // provisionally update VBV according to the planned size of all frames currently in progress
1833 static void update_vbv_plan( x264_t *h, int overhead )
1835 x264_ratecontrol_t *rcc = h->rc;
1836 rcc->buffer_fill = h->thread[0]->rc->buffer_fill_final / h->sps->vui.i_time_scale;
1837 if( h->i_thread_frames > 1 )
1839 int j = h->rc - h->thread[0]->rc;
1840 for( int i = 1; i < h->i_thread_frames; i++ )
1842 x264_t *t = h->thread[ (j+i)%h->i_thread_frames ];
1843 double bits = t->rc->frame_size_planned;
1844 if( !t->b_thread_active )
1846 bits = X264_MAX(bits, t->rc->frame_size_estimated);
1847 rcc->buffer_fill -= bits;
1848 rcc->buffer_fill = X264_MAX( rcc->buffer_fill, 0 );
1849 rcc->buffer_fill += t->rc->buffer_rate;
1850 rcc->buffer_fill = X264_MIN( rcc->buffer_fill, rcc->buffer_size );
1853 rcc->buffer_fill = X264_MIN( rcc->buffer_fill, rcc->buffer_size );
1854 rcc->buffer_fill -= overhead;
1857 // apply VBV constraints and clip qscale to between lmin and lmax
1858 static double clip_qscale( x264_t *h, int pict_type, double q )
1860 x264_ratecontrol_t *rcc = h->rc;
1861 double lmin = rcc->lmin[pict_type];
1862 double lmax = rcc->lmax[pict_type];
1863 if( rcc->rate_factor_max_increment )
1864 lmax = X264_MIN( lmax, qp2qscale( rcc->qp_novbv + rcc->rate_factor_max_increment ) );
1867 /* B-frames are not directly subject to VBV,
1868 * since they are controlled by the P-frames' QPs. */
1870 if( rcc->b_vbv && rcc->last_satd > 0 )
1872 /* Lookahead VBV: raise the quantizer as necessary such that no frames in
1873 * the lookahead overflow and such that the buffer is in a reasonable state
1874 * by the end of the lookahead. */
1875 if( h->param.rc.i_lookahead )
1879 /* Avoid an infinite loop. */
1880 for( int iterations = 0; iterations < 1000 && terminate != 3; iterations++ )
1883 double cur_bits = predict_size( &rcc->pred[h->sh.i_type], q, rcc->last_satd );
1884 double buffer_fill_cur = rcc->buffer_fill - cur_bits;
1886 double total_duration = 0;
1887 frame_q[0] = h->sh.i_type == SLICE_TYPE_I ? q * h->param.rc.f_ip_factor : q;
1888 frame_q[1] = frame_q[0] * h->param.rc.f_pb_factor;
1889 frame_q[2] = frame_q[0] / h->param.rc.f_ip_factor;
1891 /* Loop over the planned future frames. */
1892 for( int j = 0; buffer_fill_cur >= 0 && buffer_fill_cur <= rcc->buffer_size; j++ )
1894 total_duration += h->fenc->f_planned_cpb_duration[j];
1895 buffer_fill_cur += rcc->vbv_max_rate * h->fenc->f_planned_cpb_duration[j];
1896 int i_type = h->fenc->i_planned_type[j];
1897 int i_satd = h->fenc->i_planned_satd[j];
1898 if( i_type == X264_TYPE_AUTO )
1900 i_type = IS_X264_TYPE_I( i_type ) ? SLICE_TYPE_I : IS_X264_TYPE_B( i_type ) ? SLICE_TYPE_B : SLICE_TYPE_P;
1901 cur_bits = predict_size( &rcc->pred[i_type], frame_q[i_type], i_satd );
1902 buffer_fill_cur -= cur_bits;
1904 /* Try to get to get the buffer at least 50% filled, but don't set an impossible goal. */
1905 target_fill = X264_MIN( rcc->buffer_fill + total_duration * rcc->vbv_max_rate * 0.5, rcc->buffer_size * 0.5 );
1906 if( buffer_fill_cur < target_fill )
1912 /* Try to get the buffer no more than 80% filled, but don't set an impossible goal. */
1913 target_fill = x264_clip3f( rcc->buffer_fill - total_duration * rcc->vbv_max_rate * 0.5, rcc->buffer_size * 0.8, rcc->buffer_size );
1914 if( rcc->b_vbv_min_rate && buffer_fill_cur > target_fill )
1923 /* Fallback to old purely-reactive algorithm: no lookahead. */
1926 if( ( pict_type == SLICE_TYPE_P ||
1927 ( pict_type == SLICE_TYPE_I && rcc->last_non_b_pict_type == SLICE_TYPE_I ) ) &&
1928 rcc->buffer_fill/rcc->buffer_size < 0.5 )
1930 q /= x264_clip3f( 2.0*rcc->buffer_fill/rcc->buffer_size, 0.5, 1.0 );
1933 /* Now a hard threshold to make sure the frame fits in VBV.
1934 * This one is mostly for I-frames. */
1935 double bits = predict_size( &rcc->pred[h->sh.i_type], q, rcc->last_satd );
1937 /* For small VBVs, allow the frame to use up the entire VBV. */
1938 double max_fill_factor = h->param.rc.i_vbv_buffer_size >= 5*h->param.rc.i_vbv_max_bitrate / rcc->fps ? 2 : 1;
1939 /* For single-frame VBVs, request that the frame use up the entire VBV. */
1940 double min_fill_factor = rcc->single_frame_vbv ? 1 : 2;
1942 if( bits > rcc->buffer_fill/max_fill_factor )
1943 qf = x264_clip3f( rcc->buffer_fill/(max_fill_factor*bits), 0.2, 1.0 );
1946 if( bits < rcc->buffer_rate/min_fill_factor )
1947 q *= bits*min_fill_factor/rcc->buffer_rate;
1948 q = X264_MAX( q0, q );
1951 /* Apply MinCR restrictions */
1952 double bits = predict_size( &rcc->pred[h->sh.i_type], q, rcc->last_satd );
1953 if( bits > rcc->frame_size_maximum )
1954 q *= bits / rcc->frame_size_maximum;
1955 bits = predict_size( &rcc->pred[h->sh.i_type], q, rcc->last_satd );
1957 /* Check B-frame complexity, and use up any bits that would
1958 * overflow before the next P-frame. */
1959 if( h->sh.i_type == SLICE_TYPE_P && !rcc->single_frame_vbv )
1961 int nb = rcc->bframes;
1962 double pbbits = bits;
1963 double bbits = predict_size( rcc->pred_b_from_p, q * h->param.rc.f_pb_factor, rcc->last_satd );
1965 double bframe_cpb_duration = 0;
1966 double minigop_cpb_duration;
1967 for( int i = 0; i < nb; i++ )
1968 bframe_cpb_duration += h->fenc->f_planned_cpb_duration[1+i];
1970 if( bbits * nb > bframe_cpb_duration * rcc->vbv_max_rate )
1972 pbbits += nb * bbits;
1974 minigop_cpb_duration = bframe_cpb_duration + h->fenc->f_planned_cpb_duration[0];
1975 space = rcc->buffer_fill + minigop_cpb_duration*rcc->vbv_max_rate - rcc->buffer_size;
1976 if( pbbits < space )
1978 q *= X264_MAX( pbbits / space, bits / (0.5 * rcc->buffer_size) );
1980 q = X264_MAX( q0-5, q );
1983 if( !rcc->b_vbv_min_rate )
1984 q = X264_MAX( q0, q );
1989 else if( rcc->b_2pass )
1991 double min2 = log( lmin );
1992 double max2 = log( lmax );
1993 q = (log(q) - min2)/(max2-min2) - 0.5;
1994 q = 1.0/(1.0 + exp( -4*q ));
1995 q = q*(max2-min2) + min2;
1999 return x264_clip3f( q, lmin, lmax );
2002 // update qscale for 1 frame based on actual bits used so far
2003 static float rate_estimate_qscale( x264_t *h )
2006 x264_ratecontrol_t *rcc = h->rc;
2007 ratecontrol_entry_t rce;
2008 int pict_type = h->sh.i_type;
2009 int64_t total_bits = 8*(h->stat.i_frame_size[SLICE_TYPE_I]
2010 + h->stat.i_frame_size[SLICE_TYPE_P]
2011 + h->stat.i_frame_size[SLICE_TYPE_B])
2012 - rcc->filler_bits_sum;
2017 if( pict_type != rce.pict_type )
2019 x264_log( h, X264_LOG_ERROR, "slice=%c but 2pass stats say %c\n",
2020 slice_type_to_char[pict_type], slice_type_to_char[rce.pict_type] );
2024 if( pict_type == SLICE_TYPE_B )
2026 /* B-frames don't have independent ratecontrol, but rather get the
2027 * average QP of the two adjacent P-frames + an offset */
2029 int i0 = IS_X264_TYPE_I(h->fref0[0]->i_type);
2030 int i1 = IS_X264_TYPE_I(h->fref1[0]->i_type);
2031 int dt0 = abs(h->fenc->i_poc - h->fref0[0]->i_poc);
2032 int dt1 = abs(h->fenc->i_poc - h->fref1[0]->i_poc);
2033 float q0 = h->fref0[0]->f_qp_avg_rc;
2034 float q1 = h->fref1[0]->f_qp_avg_rc;
2036 if( h->fref0[0]->i_type == X264_TYPE_BREF )
2037 q0 -= rcc->pb_offset/2;
2038 if( h->fref1[0]->i_type == X264_TYPE_BREF )
2039 q1 -= rcc->pb_offset/2;
2042 q = (q0 + q1) / 2 + rcc->ip_offset;
2048 q = (q0*dt1 + q1*dt0) / (dt0 + dt1);
2050 if( h->fenc->b_kept_as_ref )
2051 q += rcc->pb_offset/2;
2053 q += rcc->pb_offset;
2055 if( rcc->b_2pass && rcc->b_vbv )
2056 rcc->frame_size_planned = qscale2bits( &rce, qp2qscale( q ) );
2058 rcc->frame_size_planned = predict_size( rcc->pred_b_from_p, qp2qscale( q ), h->fref1[h->i_ref1-1]->i_satd );
2059 h->rc->frame_size_estimated = rcc->frame_size_planned;
2063 rcc->last_satd = x264_rc_analyse_slice( h );
2065 return qp2qscale( q );
2069 double abr_buffer = 2 * rcc->rate_tolerance * rcc->bitrate;
2073 double lmin = rcc->lmin[pict_type];
2074 double lmax = rcc->lmax[pict_type];
2076 int64_t predicted_bits = total_bits;
2080 if( h->i_thread_frames > 1 )
2082 int j = h->rc - h->thread[0]->rc;
2083 for( int i = 1; i < h->i_thread_frames; i++ )
2085 x264_t *t = h->thread[ (j+i)%h->i_thread_frames ];
2086 double bits = t->rc->frame_size_planned;
2087 if( !t->b_thread_active )
2089 bits = X264_MAX(bits, t->rc->frame_size_estimated);
2090 predicted_bits += (int64_t)bits;
2096 if( h->i_frame < h->i_thread_frames )
2097 predicted_bits += (int64_t)h->i_frame * rcc->bitrate / rcc->fps;
2099 predicted_bits += (int64_t)(h->i_thread_frames - 1) * rcc->bitrate / rcc->fps;
2102 /* Adjust ABR buffer based on distance to the end of the video. */
2103 if( rcc->num_entries > h->i_frame )
2105 double final_bits = rcc->entry[rcc->num_entries-1].expected_bits;
2106 double video_pos = rce.expected_bits / final_bits;
2107 double scale_factor = sqrt( (1 - video_pos) * rcc->num_entries );
2108 abr_buffer *= 0.5 * X264_MAX( scale_factor, 0.5 );
2111 diff = predicted_bits - (int64_t)rce.expected_bits;
2113 q /= x264_clip3f((double)(abr_buffer - diff) / abr_buffer, .5, 2);
2114 if( ((h->i_frame + 1 - h->i_thread_frames) >= rcc->fps) &&
2115 (rcc->expected_bits_sum > 0))
2117 /* Adjust quant based on the difference between
2118 * achieved and expected bitrate so far */
2119 double cur_time = (double)h->i_frame / rcc->num_entries;
2120 double w = x264_clip3f( cur_time*100, 0.0, 1.0 );
2121 q *= pow( (double)total_bits / rcc->expected_bits_sum, w );
2125 /* Do not overflow vbv */
2126 double expected_size = qscale2bits( &rce, q );
2127 double expected_vbv = rcc->buffer_fill + rcc->buffer_rate - expected_size;
2128 double expected_fullness = rce.expected_vbv / rcc->buffer_size;
2129 double qmax = q*(2 - expected_fullness);
2130 double size_constraint = 1 + expected_fullness;
2131 qmax = X264_MAX( qmax, rce.new_qscale );
2132 if( expected_fullness < .05 )
2134 qmax = X264_MIN(qmax, lmax);
2135 while( ((expected_vbv < rce.expected_vbv/size_constraint) && (q < qmax)) ||
2136 ((expected_vbv < 0) && (q < lmax)))
2139 expected_size = qscale2bits(&rce, q);
2140 expected_vbv = rcc->buffer_fill + rcc->buffer_rate - expected_size;
2142 rcc->last_satd = x264_rc_analyse_slice( h );
2144 q = x264_clip3f( q, lmin, lmax );
2146 else /* 1pass ABR */
2148 /* Calculate the quantizer which would have produced the desired
2149 * average bitrate if it had been applied to all frames so far.
2150 * Then modulate that quant based on the current frame's complexity
2151 * relative to the average complexity so far (using the 2pass RCEQ).
2152 * Then bias the quant up or down if total size so far was far from
2154 * Result: Depending on the value of rate_tolerance, there is a
2155 * tradeoff between quality and bitrate precision. But at large
2156 * tolerances, the bit distribution approaches that of 2pass. */
2158 double wanted_bits, overflow = 1;
2160 rcc->last_satd = x264_rc_analyse_slice( h );
2161 rcc->short_term_cplxsum *= 0.5;
2162 rcc->short_term_cplxcount *= 0.5;
2163 rcc->short_term_cplxsum += rcc->last_satd;
2164 rcc->short_term_cplxcount ++;
2166 rce.tex_bits = rcc->last_satd;
2167 rce.blurred_complexity = rcc->short_term_cplxsum / rcc->short_term_cplxcount;
2169 rce.p_count = rcc->nmb;
2173 rce.pict_type = pict_type;
2175 if( h->param.rc.i_rc_method == X264_RC_CRF )
2177 q = get_qscale( h, &rce, rcc->rate_factor_constant, h->fenc->i_frame );
2181 q = get_qscale( h, &rce, rcc->wanted_bits_window / rcc->cplxr_sum, h->fenc->i_frame );
2183 /* ABR code can potentially be counterproductive in CBR, so just don't bother.
2184 * Don't run it if the frame complexity is zero either. */
2185 if( !rcc->b_vbv_min_rate && rcc->last_satd )
2187 // FIXME is it simpler to keep track of wanted_bits in ratecontrol_end?
2188 int i_frame_done = h->i_frame + 1 - h->i_thread_frames;
2189 double time_done = i_frame_done / rcc->fps;
2190 if( h->param.b_vfr_input && i_frame_done > 0 )
2191 time_done = ((double)(h->fenc->i_reordered_pts - h->i_reordered_pts_delay)) * h->param.i_timebase_num / h->param.i_timebase_den;
2192 wanted_bits = time_done * rcc->bitrate;
2193 if( wanted_bits > 0 )
2195 abr_buffer *= X264_MAX( 1, sqrt( time_done ) );
2196 overflow = x264_clip3f( 1.0 + (total_bits - wanted_bits) / abr_buffer, .5, 2 );
2202 if( pict_type == SLICE_TYPE_I && h->param.i_keyint_max > 1
2203 /* should test _next_ pict type, but that isn't decided yet */
2204 && rcc->last_non_b_pict_type != SLICE_TYPE_I )
2206 q = qp2qscale( rcc->accum_p_qp / rcc->accum_p_norm );
2207 q /= fabs( h->param.rc.f_ip_factor );
2209 else if( h->i_frame > 0 )
2211 /* Asymmetric clipping, because symmetric would prevent
2212 * overflow control in areas of rapidly oscillating complexity */
2213 double lmin = rcc->last_qscale_for[pict_type] / rcc->lstep;
2214 double lmax = rcc->last_qscale_for[pict_type] * rcc->lstep;
2215 if( overflow > 1.1 && h->i_frame > 3 )
2217 else if( overflow < 0.9 )
2220 q = x264_clip3f(q, lmin, lmax);
2222 else if( h->param.rc.i_rc_method == X264_RC_CRF && rcc->qcompress != 1 )
2224 q = qp2qscale( ABR_INIT_QP ) / fabs( h->param.rc.f_ip_factor );
2226 rcc->qp_novbv = qscale2qp( q );
2228 //FIXME use get_diff_limited_q() ?
2229 q = clip_qscale( h, pict_type, q );
2232 rcc->last_qscale_for[pict_type] =
2233 rcc->last_qscale = q;
2235 if( !(rcc->b_2pass && !rcc->b_vbv) && h->fenc->i_frame == 0 )
2236 rcc->last_qscale_for[SLICE_TYPE_P] = q * fabs( h->param.rc.f_ip_factor );
2238 if( rcc->b_2pass && rcc->b_vbv )
2239 rcc->frame_size_planned = qscale2bits(&rce, q);
2241 rcc->frame_size_planned = predict_size( &rcc->pred[h->sh.i_type], q, rcc->last_satd );
2243 /* Always use up the whole VBV in this case. */
2244 if( rcc->single_frame_vbv )
2245 rcc->frame_size_planned = rcc->buffer_rate;
2246 h->rc->frame_size_estimated = rcc->frame_size_planned;
2251 void x264_threads_normalize_predictors( x264_t *h )
2253 double totalsize = 0;
2254 for( int i = 0; i < h->param.i_threads; i++ )
2255 totalsize += h->thread[i]->rc->slice_size_planned;
2256 double factor = h->rc->frame_size_planned / totalsize;
2257 for( int i = 0; i < h->param.i_threads; i++ )
2258 h->thread[i]->rc->slice_size_planned *= factor;
2261 void x264_threads_distribute_ratecontrol( x264_t *h )
2264 x264_ratecontrol_t *rc = h->rc;
2266 /* Initialize row predictors */
2267 if( h->i_frame == 0 )
2268 for( int i = 0; i < h->param.i_threads; i++ )
2270 x264_ratecontrol_t *t = h->thread[i]->rc;
2271 memcpy( t->row_preds, rc->row_preds, sizeof(rc->row_preds) );
2274 for( int i = 0; i < h->param.i_threads; i++ )
2276 x264_t *t = h->thread[i];
2277 memcpy( t->rc, rc, offsetof(x264_ratecontrol_t, row_pred) );
2278 t->rc->row_pred = &t->rc->row_preds[h->sh.i_type];
2279 /* Calculate the planned slice size. */
2280 if( rc->b_vbv && rc->frame_size_planned )
2283 for( row = t->i_threadslice_start; row < t->i_threadslice_end; row++ )
2284 size += h->fdec->i_row_satd[row];
2285 t->rc->slice_size_planned = predict_size( &rc->pred[h->sh.i_type + (i+1)*5], rc->qpm, size );
2288 t->rc->slice_size_planned = 0;
2290 if( rc->b_vbv && rc->frame_size_planned )
2292 x264_threads_normalize_predictors( h );
2294 if( rc->single_frame_vbv )
2296 /* Compensate for our max frame error threshold: give more bits (proportionally) to smaller slices. */
2297 for( int i = 0; i < h->param.i_threads; i++ )
2299 x264_t *t = h->thread[i];
2300 float max_frame_error = X264_MAX( 0.05, 1.0 / (t->i_threadslice_end - t->i_threadslice_start) );
2301 t->rc->slice_size_planned += 2 * max_frame_error * rc->frame_size_planned;
2303 x264_threads_normalize_predictors( h );
2306 for( int i = 0; i < h->param.i_threads; i++ )
2307 h->thread[i]->rc->frame_size_estimated = h->thread[i]->rc->slice_size_planned;
2311 void x264_threads_merge_ratecontrol( x264_t *h )
2313 x264_ratecontrol_t *rc = h->rc;
2316 for( int i = 0; i < h->param.i_threads; i++ )
2318 x264_t *t = h->thread[i];
2319 x264_ratecontrol_t *rct = h->thread[i]->rc;
2320 if( h->param.rc.i_vbv_buffer_size )
2323 for( int row = t->i_threadslice_start; row < t->i_threadslice_end; row++ )
2324 size += h->fdec->i_row_satd[row];
2325 int bits = t->stat.frame.i_mv_bits + t->stat.frame.i_tex_bits + t->stat.frame.i_misc_bits;
2326 int mb_count = (t->i_threadslice_end - t->i_threadslice_start) * h->mb.i_mb_width;
2327 update_predictor( &rc->pred[h->sh.i_type+(i+1)*5], qp2qscale( rct->qpa_rc/mb_count ), size, bits );
2331 rc->qpa_rc += rct->qpa_rc;
2332 rc->qpa_aq += rct->qpa_aq;
2336 void x264_thread_sync_ratecontrol( x264_t *cur, x264_t *prev, x264_t *next )
2340 #define COPY(var) memcpy(&cur->rc->var, &prev->rc->var, sizeof(cur->rc->var))
2341 /* these vars are updated in x264_ratecontrol_start()
2342 * so copy them from the context that most recently started (prev)
2343 * to the context that's about to start (cur). */
2348 COPY(last_qscale_for);
2349 COPY(last_non_b_pict_type);
2350 COPY(short_term_cplxsum);
2351 COPY(short_term_cplxcount);
2355 /* these vars can be updated by x264_ratecontrol_init_reconfigurable */
2358 COPY(single_frame_vbv);
2360 COPY(b_vbv_min_rate);
2361 COPY(rate_factor_constant);
2367 #define COPY(var) next->rc->var = cur->rc->var
2368 /* these vars are updated in x264_ratecontrol_end()
2369 * so copy them from the context that most recently ended (cur)
2370 * to the context that's about to end (next) */
2372 COPY(expected_bits_sum);
2373 COPY(filler_bits_sum);
2374 COPY(wanted_bits_window);
2376 COPY(initial_cpb_removal_delay);
2377 COPY(initial_cpb_removal_delay_offset);
2378 COPY(nrt_first_access_unit);
2379 COPY(previous_cpb_final_arrival_time);
2382 //FIXME row_preds[] (not strictly necessary, but would improve prediction)
2383 /* the rest of the variables are either constant or thread-local */
2386 static int find_underflow( x264_t *h, double *fills, int *t0, int *t1, int over )
2388 /* find an interval ending on an overflow or underflow (depending on whether
2389 * we're adding or removing bits), and starting on the earliest frame that
2390 * can influence the buffer fill of that end frame. */
2391 x264_ratecontrol_t *rcc = h->rc;
2392 const double buffer_min = (over ? .1 : .1) * rcc->buffer_size;
2393 const double buffer_max = .9 * rcc->buffer_size;
2394 double fill = fills[*t0-1];
2395 double parity = over ? 1. : -1.;
2396 int start = -1, end = -1;
2397 for( int i = *t0; i < rcc->num_entries; i++ )
2399 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 -
2400 qscale2bits( &rcc->entry[i], rcc->entry[i].new_qscale )) * parity;
2401 fill = x264_clip3f(fill, 0, rcc->buffer_size);
2403 if( fill <= buffer_min || i == 0 )
2409 else if( fill >= buffer_max && start >= 0 )
2414 return start >= 0 && end >= 0;
2417 static int fix_underflow( x264_t *h, int t0, int t1, double adjustment, double qscale_min, double qscale_max)
2419 x264_ratecontrol_t *rcc = h->rc;
2420 double qscale_orig, qscale_new;
2424 for( int i = t0; i <= t1; i++ )
2426 qscale_orig = rcc->entry[i].new_qscale;
2427 qscale_orig = x264_clip3f( qscale_orig, qscale_min, qscale_max );
2428 qscale_new = qscale_orig * adjustment;
2429 qscale_new = x264_clip3f( qscale_new, qscale_min, qscale_max );
2430 rcc->entry[i].new_qscale = qscale_new;
2431 adjusted = adjusted || (qscale_new != qscale_orig);
2436 static double count_expected_bits( x264_t *h )
2438 x264_ratecontrol_t *rcc = h->rc;
2439 double expected_bits = 0;
2440 for( int i = 0; i < rcc->num_entries; i++ )
2442 ratecontrol_entry_t *rce = &rcc->entry[i];
2443 rce->expected_bits = expected_bits;
2444 expected_bits += qscale2bits( rce, rce->new_qscale );
2446 return expected_bits;
2449 static int vbv_pass2( x264_t *h, double all_available_bits )
2451 /* for each interval of buffer_full .. underflow, uniformly increase the qp of all
2452 * frames in the interval until either buffer is full at some intermediate frame or the
2453 * last frame in the interval no longer underflows. Recompute intervals and repeat.
2454 * Then do the converse to put bits back into overflow areas until target size is met */
2456 x264_ratecontrol_t *rcc = h->rc;
2458 double expected_bits = 0;
2460 double prev_bits = 0;
2462 double qscale_min = qp2qscale( h->param.rc.i_qp_min );
2463 double qscale_max = qp2qscale( h->param.rc.i_qp_max );
2465 int adj_min, adj_max;
2466 CHECKED_MALLOC( fills, (rcc->num_entries+1)*sizeof(double) );
2470 /* adjust overall stream size */
2474 prev_bits = expected_bits;
2477 { /* not first iteration */
2478 adjustment = X264_MAX(X264_MIN(expected_bits / all_available_bits, 0.999), 0.9);
2479 fills[-1] = rcc->buffer_size * h->param.rc.f_vbv_buffer_init;
2483 while(adj_min && find_underflow( h, fills, &t0, &t1, 1 ))
2485 adj_min = fix_underflow( h, t0, t1, adjustment, qscale_min, qscale_max );
2490 fills[-1] = rcc->buffer_size * (1. - h->param.rc.f_vbv_buffer_init);
2492 /* fix underflows -- should be done after overflow, as we'd better undersize target than underflowing VBV */
2494 while( adj_max && find_underflow( h, fills, &t0, &t1, 0 ) )
2495 adj_max = fix_underflow( h, t0, t1, 1.001, qscale_min, qscale_max );
2497 expected_bits = count_expected_bits( h );
2498 } while( (expected_bits < .995*all_available_bits) && ((int64_t)(expected_bits+.5) > (int64_t)(prev_bits+.5)) );
2501 x264_log( h, X264_LOG_WARNING, "vbv-maxrate issue, qpmax or vbv-maxrate too low\n");
2503 /* store expected vbv filling values for tracking when encoding */
2504 for( int i = 0; i < rcc->num_entries; i++ )
2505 rcc->entry[i].expected_vbv = rcc->buffer_size - fills[i];
2507 x264_free( fills-1 );
2513 static int init_pass2( x264_t *h )
2515 x264_ratecontrol_t *rcc = h->rc;
2516 uint64_t all_const_bits = 0;
2517 double duration = 0;
2518 for( int i = 0; i < rcc->num_entries; i++ )
2519 duration += rcc->entry[i].i_duration;
2520 duration *= (double)h->sps->vui.i_num_units_in_tick / h->sps->vui.i_time_scale;
2521 uint64_t all_available_bits = h->param.rc.i_bitrate * 1000. * duration;
2522 double rate_factor, step_mult;
2523 double qblur = h->param.rc.f_qblur;
2524 double cplxblur = h->param.rc.f_complexity_blur;
2525 const int filter_size = (int)(qblur*4) | 1;
2526 double expected_bits;
2527 double *qscale, *blurred_qscale;
2528 double base_cplx = h->mb.i_mb_count * (h->param.i_bframe ? 120 : 80);
2530 /* find total/average complexity & const_bits */
2531 for( int i = 0; i < rcc->num_entries; i++ )
2533 ratecontrol_entry_t *rce = &rcc->entry[i];
2534 all_const_bits += rce->misc_bits;
2537 if( all_available_bits < all_const_bits)
2539 x264_log( h, X264_LOG_ERROR, "requested bitrate is too low. estimated minimum is %d kbps\n",
2540 (int)(all_const_bits * rcc->fps / (rcc->num_entries * 1000.)) );
2544 /* Blur complexities, to reduce local fluctuation of QP.
2545 * We don't blur the QPs directly, because then one very simple frame
2546 * could drag down the QP of a nearby complex frame and give it more
2547 * bits than intended. */
2548 for( int i = 0; i < rcc->num_entries; i++ )
2550 ratecontrol_entry_t *rce = &rcc->entry[i];
2551 double weight_sum = 0;
2552 double cplx_sum = 0;
2553 double weight = 1.0;
2554 double gaussian_weight;
2555 /* weighted average of cplx of future frames */
2556 for( int j = 1; j < cplxblur*2 && j < rcc->num_entries-i; j++ )
2558 ratecontrol_entry_t *rcj = &rcc->entry[i+j];
2559 weight *= 1 - pow( (float)rcj->i_count / rcc->nmb, 2 );
2560 if( weight < .0001 )
2562 gaussian_weight = weight * exp( -j*j/200.0 );
2563 weight_sum += gaussian_weight;
2564 cplx_sum += gaussian_weight * (qscale2bits(rcj, 1) - rcj->misc_bits);
2566 /* weighted average of cplx of past frames */
2568 for( int j = 0; j <= cplxblur*2 && j <= i; j++ )
2570 ratecontrol_entry_t *rcj = &rcc->entry[i-j];
2571 gaussian_weight = weight * exp( -j*j/200.0 );
2572 weight_sum += gaussian_weight;
2573 cplx_sum += gaussian_weight * (qscale2bits( rcj, 1 ) - rcj->misc_bits);
2574 weight *= 1 - pow( (float)rcj->i_count / rcc->nmb, 2 );
2575 if( weight < .0001 )
2578 rce->blurred_complexity = cplx_sum / weight_sum;
2581 CHECKED_MALLOC( qscale, sizeof(double)*rcc->num_entries );
2582 if( filter_size > 1 )
2583 CHECKED_MALLOC( blurred_qscale, sizeof(double)*rcc->num_entries );
2585 blurred_qscale = qscale;
2587 /* Search for a factor which, when multiplied by the RCEQ values from
2588 * each frame, adds up to the desired total size.
2589 * There is no exact closed-form solution because of VBV constraints and
2590 * because qscale2bits is not invertible, but we can start with the simple
2591 * approximation of scaling the 1st pass by the ratio of bitrates.
2592 * The search range is probably overkill, but speed doesn't matter here. */
2595 for( int i = 0; i < rcc->num_entries; i++ )
2597 double q = get_qscale(h, &rcc->entry[i], 1.0, i);
2598 expected_bits += qscale2bits(&rcc->entry[i], q);
2599 rcc->last_qscale_for[rcc->entry[i].pict_type] = q;
2601 step_mult = all_available_bits / expected_bits;
2604 for( double step = 1E4 * step_mult; step > 1E-7 * step_mult; step *= 0.5)
2607 rate_factor += step;
2609 rcc->last_non_b_pict_type = -1;
2610 rcc->last_accum_p_norm = 1;
2611 rcc->accum_p_norm = 0;
2613 rcc->last_qscale_for[0] =
2614 rcc->last_qscale_for[1] =
2615 rcc->last_qscale_for[2] = pow( base_cplx, 1 - rcc->qcompress ) / rate_factor;
2618 for( int i = 0; i < rcc->num_entries; i++ )
2620 qscale[i] = get_qscale( h, &rcc->entry[i], rate_factor, i );
2621 rcc->last_qscale_for[rcc->entry[i].pict_type] = qscale[i];
2624 /* fixed I/B qscale relative to P */
2625 for( int i = rcc->num_entries-1; i >= 0; i-- )
2627 qscale[i] = get_diff_limited_q( h, &rcc->entry[i], qscale[i] );
2628 assert(qscale[i] >= 0);
2632 if( filter_size > 1 )
2634 assert( filter_size%2 == 1 );
2635 for( int i = 0; i < rcc->num_entries; i++ )
2637 ratecontrol_entry_t *rce = &rcc->entry[i];
2638 double q = 0.0, sum = 0.0;
2640 for( int j = 0; j < filter_size; j++ )
2642 int idx = i+j-filter_size/2;
2644 double coeff = qblur==0 ? 1.0 : exp( -d*d/(qblur*qblur) );
2645 if( idx < 0 || idx >= rcc->num_entries )
2647 if( rce->pict_type != rcc->entry[idx].pict_type )
2649 q += qscale[idx] * coeff;
2652 blurred_qscale[i] = q/sum;
2656 /* find expected bits */
2657 for( int i = 0; i < rcc->num_entries; i++ )
2659 ratecontrol_entry_t *rce = &rcc->entry[i];
2660 rce->new_qscale = clip_qscale( h, rce->pict_type, blurred_qscale[i] );
2661 assert(rce->new_qscale >= 0);
2662 expected_bits += qscale2bits( rce, rce->new_qscale );
2665 if( expected_bits > all_available_bits )
2666 rate_factor -= step;
2669 x264_free( qscale );
2670 if( filter_size > 1 )
2671 x264_free( blurred_qscale );
2674 if( vbv_pass2( h, all_available_bits ) )
2676 expected_bits = count_expected_bits( h );
2678 if( fabs( expected_bits/all_available_bits - 1.0 ) > 0.01 )
2681 for( int i = 0; i < rcc->num_entries; i++ )
2682 avgq += rcc->entry[i].new_qscale;
2683 avgq = qscale2qp( avgq / rcc->num_entries );
2685 if( expected_bits > all_available_bits || !rcc->b_vbv )
2686 x264_log( h, X264_LOG_WARNING, "Error: 2pass curve failed to converge\n" );
2687 x264_log( h, X264_LOG_WARNING, "target: %.2f kbit/s, expected: %.2f kbit/s, avg QP: %.4f\n",
2688 (float)h->param.rc.i_bitrate,
2689 expected_bits * rcc->fps / (rcc->num_entries * 1000.),
2691 if( expected_bits < all_available_bits && avgq < h->param.rc.i_qp_min + 2 )
2693 if( h->param.rc.i_qp_min > 0 )
2694 x264_log( h, X264_LOG_WARNING, "try reducing target bitrate or reducing qp_min (currently %d)\n", h->param.rc.i_qp_min );
2696 x264_log( h, X264_LOG_WARNING, "try reducing target bitrate\n" );
2698 else if( expected_bits > all_available_bits && avgq > h->param.rc.i_qp_max - 2 )
2700 if( h->param.rc.i_qp_max < QP_MAX )
2701 x264_log( h, X264_LOG_WARNING, "try increasing target bitrate or increasing qp_max (currently %d)\n", h->param.rc.i_qp_max );
2703 x264_log( h, X264_LOG_WARNING, "try increasing target bitrate\n");
2705 else if( !(rcc->b_2pass && rcc->b_vbv) )
2706 x264_log( h, X264_LOG_WARNING, "internal error\n" );