1 /*****************************************************************************
2 * ratecontrol.c: h264 encoder library (Rate Control)
3 *****************************************************************************
4 * Copyright (C) 2005-2008 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.
25 *****************************************************************************/
27 #define _ISOC99_SOURCE
28 #undef NDEBUG // always check asserts, the speed effect is far too small to disable them
31 #include "common/common.h"
32 #include "ratecontrol.h"
44 uint64_t expected_bits; /*total expected bits up to the current frame (current one excluded)*/
51 float blurred_complexity;
54 int16_t i_weight_denom;
59 } ratecontrol_entry_t;
69 struct x264_ratecontrol_t
78 double rate_tolerance;
80 int nmb; /* number of macroblocks in a frame */
84 ratecontrol_entry_t *rce;
85 int qp; /* qp for current frame */
86 float qpm; /* qp for current macroblock: precise float for AQ */
87 float qpa_rc; /* average of macroblocks' qp before aq */
88 float qpa_aq; /* average of macroblocks' qp after aq */
89 float qp_novbv; /* QP for the current frame if 1-pass VBV was disabled. */
94 int64_t buffer_fill_final;
95 double buffer_fill; /* planned buffer, if all in-progress frames hit their bit budget */
96 double buffer_rate; /* # of bits added to buffer_fill after each frame */
97 double vbv_max_rate; /* # of bits added to buffer_fill per second */
98 predictor_t *pred; /* predict frame size from satd */
100 double rate_factor_max_increment; /* Don't allow RF above (CRF + this value). */
105 double cplxr_sum; /* sum of bits*qscale/rceq */
106 double expected_bits_sum; /* sum of qscale2bits after rceq, ratefactor, and overflow, only includes finished frames */
107 double wanted_bits_window; /* target bitrate * window */
109 double short_term_cplxsum;
110 double short_term_cplxcount;
111 double rate_factor_constant;
116 FILE *p_stat_file_out;
117 char *psz_stat_file_tmpname;
118 FILE *p_mbtree_stat_file_out;
119 char *psz_mbtree_stat_file_tmpname;
120 char *psz_mbtree_stat_file_name;
121 FILE *p_mbtree_stat_file_in;
123 int num_entries; /* number of ratecontrol_entry_ts */
124 ratecontrol_entry_t *entry; /* FIXME: copy needed data and free this once init is done */
126 double last_qscale_for[5]; /* last qscale for a specific pict type, used for max_diff & ipb factor stuff */
127 int last_non_b_pict_type;
128 double accum_p_qp; /* for determining I-frame quant */
130 double last_accum_p_norm;
131 double lmin[5]; /* min qscale by frame type */
133 double lstep; /* max change (multiply) in qscale per frame */
134 uint16_t *qp_buffer[2]; /* Global buffers for converting MB-tree quantizer data. */
135 int qpbuf_pos; /* In order to handle pyramid reordering, QP buffer acts as a stack.
136 * This value is the current position (0 or 1). */
139 float frame_size_estimated; /* Access to this variable must be atomic: double is
140 * not atomic on all arches we care about */
141 double frame_size_maximum; /* Maximum frame size due to MinCR */
142 double frame_size_planned;
143 double slice_size_planned;
144 double max_frame_error;
145 predictor_t (*row_pred)[2];
146 predictor_t row_preds[5][2];
147 predictor_t *pred_b_from_p; /* predict B-frame size from P-frame satd */
148 int bframes; /* # consecutive B-frames before this P-frame */
149 int bframe_bits; /* total cost of those frames */
153 x264_zone_t *prev_zone;
156 int initial_cpb_removal_delay;
157 int initial_cpb_removal_delay_offset;
158 double nrt_first_access_unit; /* nominal removal time */
159 double previous_cpb_final_arrival_time;
160 uint64_t hrd_multiply_denom;
164 static int parse_zones( x264_t *h );
165 static int init_pass2(x264_t *);
166 static float rate_estimate_qscale( x264_t *h );
167 static int update_vbv( x264_t *h, int bits );
168 static void update_vbv_plan( x264_t *h, int overhead );
169 static double predict_size( predictor_t *p, double q, double var );
170 static void update_predictor( predictor_t *p, double q, double var, double bits );
172 #define CMP_OPT_FIRST_PASS( opt, param_val )\
174 if( ( p = strstr( opts, opt "=" ) ) && sscanf( p, opt "=%d" , &i ) && param_val != i )\
176 x264_log( h, X264_LOG_ERROR, "different " opt " setting than first pass (%d vs %d)\n", param_val, i );\
182 * qp = h.264's quantizer
183 * qscale = linearized quantizer = Lagrange multiplier
185 static inline double qp2qscale( double qp )
187 return 0.85 * pow( 2.0, ( qp - 12.0 ) / 6.0 );
189 static inline double qscale2qp( double qscale )
191 return 12.0 + 6.0 * log2( qscale/0.85 );
194 /* Texture bitrate is not quite inversely proportional to qscale,
195 * probably due the the changing number of SKIP blocks.
196 * MV bits level off at about qp<=12, because the lambda used
197 * for motion estimation is constant there. */
198 static inline double qscale2bits( ratecontrol_entry_t *rce, double qscale )
202 return (rce->tex_bits + .1) * pow( rce->qscale / qscale, 1.1 )
203 + rce->mv_bits * pow( X264_MAX(rce->qscale, 1) / X264_MAX(qscale, 1), 0.5 )
207 static ALWAYS_INLINE uint32_t ac_energy_plane( x264_t *h, int mb_x, int mb_y, x264_frame_t *frame, int i )
210 int shift = i ? 6 : 8;
211 int stride = frame->i_stride[i];
212 int offset = h->mb.b_interlaced
213 ? w * (mb_x + (mb_y&~1) * stride) + (mb_y&1) * stride
214 : w * (mb_x + mb_y * stride);
215 int pix = i ? PIXEL_8x8 : PIXEL_16x16;
216 stride <<= h->mb.b_interlaced;
217 uint64_t res = h->pixf.var[pix]( frame->plane[i] + offset, stride );
218 uint32_t sum = (uint32_t)res;
219 uint32_t ssd = res >> 32;
220 frame->i_pixel_sum[i] += sum;
221 frame->i_pixel_ssd[i] += ssd;
222 return ssd - (sum * sum >> shift);
225 // Find the total AC energy of the block in all planes.
226 static NOINLINE uint32_t x264_ac_energy_mb( x264_t *h, int mb_x, int mb_y, x264_frame_t *frame )
228 /* This function contains annoying hacks because GCC has a habit of reordering emms
229 * and putting it after floating point ops. As a result, we put the emms at the end of the
230 * function and make sure that its always called before the float math. Noinline makes
231 * sure no reordering goes on. */
232 uint32_t var = ac_energy_plane( h, mb_x, mb_y, frame, 0 );
233 var += ac_energy_plane( h, mb_x, mb_y, frame, 1 );
234 var += ac_energy_plane( h, mb_x, mb_y, frame, 2 );
239 void x264_adaptive_quant_frame( x264_t *h, x264_frame_t *frame, float *quant_offsets )
241 /* constants chosen to result in approximately the same overall bitrate as without AQ.
242 * FIXME: while they're written in 5 significant digits, they're only tuned to 2. */
245 /* Initialize frame stats */
246 for( int i = 0; i < 3; i++ )
248 frame->i_pixel_sum[i] = 0;
249 frame->i_pixel_ssd[i] = 0;
252 /* Degenerate cases */
253 if( h->param.rc.i_aq_mode == X264_AQ_NONE || h->param.rc.f_aq_strength == 0 )
255 /* Need to init it anyways for MB tree */
256 if( h->param.rc.i_aq_mode && h->param.rc.f_aq_strength == 0 )
260 for( int mb_xy = 0; mb_xy < h->mb.i_mb_count; mb_xy++ )
261 frame->f_qp_offset[mb_xy] = frame->f_qp_offset_aq[mb_xy] = quant_offsets[mb_xy];
262 if( h->frames.b_have_lowres )
263 for( int mb_xy = 0; mb_xy < h->mb.i_mb_count; mb_xy++ )
264 frame->i_inv_qscale_factor[mb_xy] = x264_exp2fix8( frame->f_qp_offset[mb_xy] );
268 memset( frame->f_qp_offset, 0, h->mb.i_mb_count * sizeof(float) );
269 memset( frame->f_qp_offset_aq, 0, h->mb.i_mb_count * sizeof(float) );
270 if( h->frames.b_have_lowres )
271 for( int mb_xy = 0; mb_xy < h->mb.i_mb_count; mb_xy++ )
272 frame->i_inv_qscale_factor[mb_xy] = 256;
275 /* Need variance data for weighted prediction */
276 if( h->param.analyse.i_weighted_pred == X264_WEIGHTP_FAKE || h->param.analyse.i_weighted_pred == X264_WEIGHTP_SMART )
278 for( int mb_y = 0; mb_y < h->mb.i_mb_height; mb_y++ )
279 for( int mb_x = 0; mb_x < h->mb.i_mb_width; mb_x++ )
280 x264_ac_energy_mb( h, mb_x, mb_y, frame );
285 /* Actual adaptive quantization */
288 if( h->param.rc.i_aq_mode == X264_AQ_AUTOVARIANCE )
290 float avg_adj_pow2 = 0.f;
291 for( int mb_y = 0; mb_y < h->mb.i_mb_height; mb_y++ )
292 for( int mb_x = 0; mb_x < h->mb.i_mb_width; mb_x++ )
294 uint32_t energy = x264_ac_energy_mb( h, mb_x, mb_y, frame );
295 float qp_adj = powf( energy + 1, 0.125f );
296 frame->f_qp_offset[mb_x + mb_y*h->mb.i_mb_stride] = qp_adj;
298 avg_adj_pow2 += qp_adj * qp_adj;
300 avg_adj /= h->mb.i_mb_count;
301 avg_adj_pow2 /= h->mb.i_mb_count;
302 strength = h->param.rc.f_aq_strength * avg_adj;
303 avg_adj = avg_adj - 0.5f * (avg_adj_pow2 - 14.f) / avg_adj;
306 strength = h->param.rc.f_aq_strength * 1.0397f;
308 for( int mb_y = 0; mb_y < h->mb.i_mb_height; mb_y++ )
309 for( int mb_x = 0; mb_x < h->mb.i_mb_width; mb_x++ )
312 int mb_xy = mb_x + mb_y*h->mb.i_mb_stride;
313 if( h->param.rc.i_aq_mode == X264_AQ_AUTOVARIANCE )
315 qp_adj = frame->f_qp_offset[mb_xy];
316 qp_adj = strength * (qp_adj - avg_adj);
320 uint32_t energy = x264_ac_energy_mb( h, mb_x, mb_y, frame );
321 qp_adj = strength * (x264_log2( X264_MAX(energy, 1) ) - 14.427f);
324 qp_adj += quant_offsets[mb_xy];
325 frame->f_qp_offset[mb_xy] =
326 frame->f_qp_offset_aq[mb_xy] = qp_adj;
327 if( h->frames.b_have_lowres )
328 frame->i_inv_qscale_factor[mb_xy] = x264_exp2fix8(qp_adj);
332 /* Remove mean from SSD calculation */
333 for( int i = 0; i < 3; i++ )
335 uint64_t ssd = frame->i_pixel_ssd[i];
336 uint64_t sum = frame->i_pixel_sum[i];
337 int width = h->mb.i_mb_width*16>>!!i;
338 int height = h->mb.i_mb_height*16>>!!i;
339 frame->i_pixel_ssd[i] = ssd - (sum * sum + width * height / 2) / (width * height);
343 int x264_macroblock_tree_read( x264_t *h, x264_frame_t *frame, float *quant_offsets )
345 x264_ratecontrol_t *rc = h->rc;
346 uint8_t i_type_actual = rc->entry[frame->i_frame].pict_type;
348 if( rc->entry[frame->i_frame].kept_as_ref )
351 if( rc->qpbuf_pos < 0 )
357 if( !fread( &i_type, 1, 1, rc->p_mbtree_stat_file_in ) )
359 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 )
362 if( i_type != i_type_actual && rc->qpbuf_pos == 1 )
364 x264_log(h, X264_LOG_ERROR, "MB-tree frametype %d doesn't match actual frametype %d.\n", i_type, i_type_actual);
367 } while( i_type != i_type_actual );
370 for( int i = 0; i < h->mb.i_mb_count; i++ )
372 frame->f_qp_offset[i] = ((float)(int16_t)endian_fix16( rc->qp_buffer[rc->qpbuf_pos][i] )) * (1/256.0);
373 if( h->frames.b_have_lowres )
374 frame->i_inv_qscale_factor[i] = x264_exp2fix8(frame->f_qp_offset[i]);
379 x264_adaptive_quant_frame( h, frame, quant_offsets );
382 x264_log(h, X264_LOG_ERROR, "Incomplete MB-tree stats file.\n");
386 int x264_reference_build_list_optimal( x264_t *h )
388 ratecontrol_entry_t *rce = h->rc->rce;
389 x264_frame_t *frames[16];
390 x264_weight_t weights[16][3];
393 if( rce->refs != h->i_ref0 )
396 memcpy( frames, h->fref0, sizeof(frames) );
397 memcpy( refcount, rce->refcount, sizeof(refcount) );
398 memcpy( weights, h->fenc->weight, sizeof(weights) );
399 memset( &h->fenc->weight[1][0], 0, sizeof(x264_weight_t[15][3]) );
401 /* For now don't reorder ref 0; it seems to lower quality
402 in most cases due to skips. */
403 for( int ref = 1; ref < h->i_ref0; ref++ )
408 for( int i = 1; i < h->i_ref0; i++ )
409 /* Favor lower POC as a tiebreaker. */
410 COPY2_IF_GT( max, refcount[i], bestref, i );
412 /* FIXME: If there are duplicates from frames other than ref0 then it is possible
413 * that the optimal ordering doesnt place every duplicate. */
415 refcount[bestref] = -1;
416 h->fref0[ref] = frames[bestref];
417 memcpy( h->fenc->weight[ref], weights[bestref], sizeof(weights[bestref]) );
423 static char *x264_strcat_filename( char *input, char *suffix )
425 char *output = x264_malloc( strlen( input ) + strlen( suffix ) + 1 );
428 strcpy( output, input );
429 strcat( output, suffix );
433 void x264_ratecontrol_init_reconfigurable( x264_t *h, int b_init )
435 x264_ratecontrol_t *rc = h->rc;
436 if( !b_init && rc->b_2pass )
439 if( h->param.rc.i_rc_method == X264_RC_CRF )
441 /* Arbitrary rescaling to make CRF somewhat similar to QP.
442 * Try to compensate for MB-tree's effects as well. */
443 double base_cplx = h->mb.i_mb_count * (h->param.i_bframe ? 120 : 80);
444 double mbtree_offset = h->param.rc.b_mb_tree ? (1.0-h->param.rc.f_qcompress)*13.5 : 0;
445 rc->rate_factor_constant = pow( base_cplx, 1 - rc->qcompress )
446 / qp2qscale( h->param.rc.f_rf_constant + mbtree_offset );
449 if( h->param.rc.i_vbv_max_bitrate > 0 && h->param.rc.i_vbv_buffer_size > 0 )
451 if( h->param.rc.i_vbv_buffer_size < (int)(h->param.rc.i_vbv_max_bitrate / rc->fps) )
453 h->param.rc.i_vbv_buffer_size = h->param.rc.i_vbv_max_bitrate / rc->fps;
454 x264_log( h, X264_LOG_WARNING, "VBV buffer size cannot be smaller than one frame, using %d kbit\n",
455 h->param.rc.i_vbv_buffer_size );
458 /* We don't support changing the ABR bitrate right now,
459 so if the stream starts as CBR, keep it CBR. */
460 if( rc->b_vbv_min_rate )
461 h->param.rc.i_vbv_max_bitrate = h->param.rc.i_bitrate;
463 int vbv_buffer_size = h->param.rc.i_vbv_buffer_size * 1000;
464 int vbv_max_bitrate = h->param.rc.i_vbv_max_bitrate * 1000;
467 h->sps->vui.hrd.i_bit_rate_unscaled = vbv_max_bitrate;
468 h->sps->vui.hrd.i_cpb_size_unscaled = vbv_buffer_size;
469 if( h->param.i_nal_hrd && b_init )
471 h->sps->vui.hrd.i_cpb_cnt = 1;
472 h->sps->vui.hrd.b_cbr_hrd = h->param.i_nal_hrd == X264_NAL_HRD_CBR;
473 h->sps->vui.hrd.i_time_offset_length = 0;
478 int bitrate = 1000*h->param.rc.i_vbv_max_bitrate;
479 int bufsize = 1000*h->param.rc.i_vbv_buffer_size;
481 // normalize HRD size and rate to the value / scale notation
482 h->sps->vui.hrd.i_bit_rate_scale = x264_clip3( x264_ctz( bitrate ) - BR_SHIFT, 0, 15 );
483 h->sps->vui.hrd.i_bit_rate_value = bitrate >> ( h->sps->vui.hrd.i_bit_rate_scale + BR_SHIFT );
484 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 );
485 h->sps->vui.hrd.i_cpb_size_scale = x264_clip3( x264_ctz( bufsize ) - CPB_SHIFT, 0, 15 );
486 h->sps->vui.hrd.i_cpb_size_value = bufsize >> ( h->sps->vui.hrd.i_cpb_size_scale + CPB_SHIFT );
487 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 );
493 #define MAX_DURATION 0.5
495 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 );
496 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;
497 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);
499 h->sps->vui.hrd.i_initial_cpb_removal_delay_length = 2 + x264_clip3( 32 - x264_clz( max_delay ), 4, 22 );
500 h->sps->vui.hrd.i_cpb_removal_delay_length = x264_clip3( 32 - x264_clz( max_cpb_output_delay ), 4, 31 );
501 h->sps->vui.hrd.i_dpb_output_delay_length = x264_clip3( 32 - x264_clz( max_dpb_output_delay ), 4, 31 );
505 vbv_buffer_size = h->sps->vui.hrd.i_cpb_size_unscaled;
506 vbv_max_bitrate = h->sps->vui.hrd.i_bit_rate_unscaled;
508 else if( h->param.i_nal_hrd && !b_init )
510 x264_log( h, X264_LOG_WARNING, "VBV parameters cannot be changed when NAL HRD is in use\n" );
514 rc->buffer_rate = vbv_max_bitrate / rc->fps;
515 rc->vbv_max_rate = vbv_max_bitrate;
516 rc->buffer_size = vbv_buffer_size;
517 rc->single_frame_vbv = rc->buffer_rate * 1.1 > rc->buffer_size;
518 rc->cbr_decay = 1.0 - rc->buffer_rate / rc->buffer_size
519 * 0.5 * X264_MAX(0, 1.5 - rc->buffer_rate * rc->fps / rc->bitrate);
520 if( h->param.rc.i_rc_method == X264_RC_CRF && h->param.rc.f_rf_constant_max )
522 rc->rate_factor_max_increment = h->param.rc.f_rf_constant_max - h->param.rc.f_rf_constant;
523 if( rc->rate_factor_max_increment <= 0 )
525 x264_log( h, X264_LOG_WARNING, "CRF max must be greater than CRF\n" );
526 rc->rate_factor_max_increment = 0;
531 if( h->param.rc.f_vbv_buffer_init > 1. )
532 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 );
533 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);
534 rc->buffer_fill_final = rc->buffer_size * h->param.rc.f_vbv_buffer_init * h->sps->vui.i_time_scale;
536 rc->b_vbv_min_rate = !rc->b_2pass
537 && h->param.rc.i_rc_method == X264_RC_ABR
538 && h->param.rc.i_vbv_max_bitrate <= h->param.rc.i_bitrate;
543 int x264_ratecontrol_new( x264_t *h )
545 x264_ratecontrol_t *rc;
549 CHECKED_MALLOCZERO( h->rc, h->param.i_threads * sizeof(x264_ratecontrol_t) );
552 rc->b_abr = h->param.rc.i_rc_method != X264_RC_CQP && !h->param.rc.b_stat_read;
553 rc->b_2pass = h->param.rc.i_rc_method == X264_RC_ABR && h->param.rc.b_stat_read;
555 /* FIXME: use integers */
556 if( h->param.i_fps_num > 0 && h->param.i_fps_den > 0 )
557 rc->fps = (float) h->param.i_fps_num / h->param.i_fps_den;
561 if( h->param.rc.b_mb_tree )
563 h->param.rc.f_pb_factor = 1;
567 rc->qcompress = h->param.rc.f_qcompress;
569 rc->bitrate = h->param.rc.i_bitrate * 1000.;
570 rc->rate_tolerance = h->param.rc.f_rate_tolerance;
571 rc->nmb = h->mb.i_mb_count;
572 rc->last_non_b_pict_type = -1;
575 if( h->param.rc.i_rc_method == X264_RC_CRF && h->param.rc.b_stat_read )
577 x264_log(h, X264_LOG_ERROR, "constant rate-factor is incompatible with 2pass.\n");
581 x264_ratecontrol_init_reconfigurable( h, 1 );
583 if( h->param.i_nal_hrd )
585 uint64_t denom = (uint64_t)h->sps->vui.hrd.i_bit_rate_unscaled * h->sps->vui.i_time_scale;
586 uint64_t num = 180000;
587 x264_reduce_fraction64( &num, &denom );
588 rc->hrd_multiply_denom = 180000 / num;
590 double bits_required = log2( 180000 / rc->hrd_multiply_denom )
591 + log2( h->sps->vui.i_time_scale )
592 + log2( h->sps->vui.hrd.i_cpb_size_unscaled );
593 if( bits_required >= 63 )
595 x264_log( h, X264_LOG_ERROR, "HRD with very large timescale and bufsize not supported\n" );
600 if( rc->rate_tolerance < 0.01 )
602 x264_log(h, X264_LOG_WARNING, "bitrate tolerance too small, using .01\n");
603 rc->rate_tolerance = 0.01;
606 h->mb.b_variable_qp = rc->b_vbv || h->param.rc.i_aq_mode;
610 /* FIXME ABR_INIT_QP is actually used only in CRF */
611 #define ABR_INIT_QP ( h->param.rc.i_rc_method == X264_RC_CRF ? h->param.rc.f_rf_constant : 24 )
612 rc->accum_p_norm = .01;
613 rc->accum_p_qp = ABR_INIT_QP * rc->accum_p_norm;
614 /* estimated ratio that produces a reasonable QP for the first I-frame */
615 rc->cplxr_sum = .01 * pow( 7.0e5, rc->qcompress ) * pow( h->mb.i_mb_count, 0.5 );
616 rc->wanted_bits_window = 1.0 * rc->bitrate / rc->fps;
617 rc->last_non_b_pict_type = SLICE_TYPE_I;
620 rc->ip_offset = 6.0 * log2f( h->param.rc.f_ip_factor );
621 rc->pb_offset = 6.0 * log2f( h->param.rc.f_pb_factor );
622 rc->qp_constant[SLICE_TYPE_P] = h->param.rc.i_qp_constant;
623 rc->qp_constant[SLICE_TYPE_I] = x264_clip3( h->param.rc.i_qp_constant - rc->ip_offset + 0.5, 0, 51 );
624 rc->qp_constant[SLICE_TYPE_B] = x264_clip3( h->param.rc.i_qp_constant + rc->pb_offset + 0.5, 0, 51 );
625 h->mb.ip_offset = rc->ip_offset + 0.5;
627 rc->lstep = pow( 2, h->param.rc.i_qp_step / 6.0 );
628 rc->last_qscale = qp2qscale( 26 );
629 int num_preds = h->param.b_sliced_threads * h->param.i_threads + 1;
630 CHECKED_MALLOC( rc->pred, 5 * sizeof(predictor_t) * num_preds );
631 CHECKED_MALLOC( rc->pred_b_from_p, sizeof(predictor_t) );
632 for( int i = 0; i < 5; i++ )
634 rc->last_qscale_for[i] = qp2qscale( ABR_INIT_QP );
635 rc->lmin[i] = qp2qscale( h->param.rc.i_qp_min );
636 rc->lmax[i] = qp2qscale( h->param.rc.i_qp_max );
637 for( int j = 0; j < num_preds; j++ )
639 rc->pred[i+j*5].coeff= 2.0;
640 rc->pred[i+j*5].count= 1.0;
641 rc->pred[i+j*5].decay= 0.5;
642 rc->pred[i+j*5].offset= 0.0;
644 for( int j = 0; j < 2; j++ )
646 rc->row_preds[i][j].coeff= .25;
647 rc->row_preds[i][j].count= 1.0;
648 rc->row_preds[i][j].decay= 0.5;
649 rc->row_preds[i][j].offset= 0.0;
652 *rc->pred_b_from_p = rc->pred[0];
654 if( parse_zones( h ) < 0 )
656 x264_log( h, X264_LOG_ERROR, "failed to parse zones\n" );
660 /* Load stat file and init 2pass algo */
661 if( h->param.rc.b_stat_read )
663 char *p, *stats_in, *stats_buf;
665 /* read 1st pass stats */
666 assert( h->param.rc.psz_stat_in );
667 stats_buf = stats_in = x264_slurp_file( h->param.rc.psz_stat_in );
670 x264_log(h, X264_LOG_ERROR, "ratecontrol_init: can't open stats file\n");
673 if( h->param.rc.b_mb_tree )
675 char *mbtree_stats_in = x264_strcat_filename( h->param.rc.psz_stat_in, ".mbtree" );
676 if( !mbtree_stats_in )
678 rc->p_mbtree_stat_file_in = fopen( mbtree_stats_in, "rb" );
679 x264_free( mbtree_stats_in );
680 if( !rc->p_mbtree_stat_file_in )
682 x264_log(h, X264_LOG_ERROR, "ratecontrol_init: can't open mbtree stats file\n");
687 /* check whether 1st pass options were compatible with current options */
688 if( !strncmp( stats_buf, "#options:", 9 ) )
692 char *opts = stats_buf;
693 stats_in = strchr( stats_buf, '\n' );
698 if( sscanf( opts, "#options: %dx%d", &i, &j ) != 2 )
700 x264_log( h, X264_LOG_ERROR, "resolution specified in stats file not valid\n" );
703 else if( h->param.rc.b_mb_tree && (i != h->param.i_width || j != h->param.i_height) )
705 x264_log( h, X264_LOG_ERROR, "MB-tree doesn't support different resolution than 1st pass (%dx%d vs %dx%d)\n",
706 h->param.i_width, h->param.i_height, i, j );
710 if( ( p = strstr( opts, "timebase=" ) ) && sscanf( p, "timebase=%u/%u", &k, &l ) != 2 )
712 x264_log( h, X264_LOG_ERROR, "timebase specified in stats file not valid\n" );
715 if( k != h->param.i_timebase_num || l != h->param.i_timebase_den )
717 x264_log( h, X264_LOG_ERROR, "timebase mismatch with 1st pass (%u/%u vs %u/%u)\n",
718 h->param.i_timebase_num, h->param.i_timebase_den, k, l );
722 CMP_OPT_FIRST_PASS( "weightp", X264_MAX( 0, h->param.analyse.i_weighted_pred ) );
723 CMP_OPT_FIRST_PASS( "bframes", h->param.i_bframe );
724 CMP_OPT_FIRST_PASS( "b_pyramid", h->param.i_bframe_pyramid );
725 CMP_OPT_FIRST_PASS( "intra_refresh", h->param.b_intra_refresh );
726 CMP_OPT_FIRST_PASS( "keyint", h->param.i_keyint_max );
727 CMP_OPT_FIRST_PASS( "open_gop", h->param.i_open_gop );
729 if( strstr( opts, "qp=0" ) && h->param.rc.i_rc_method == X264_RC_ABR )
730 x264_log( h, X264_LOG_WARNING, "1st pass was lossless, bitrate prediction will be inaccurate\n" );
732 if( !strstr( opts, "direct=3" ) && h->param.analyse.i_direct_mv_pred == X264_DIRECT_PRED_AUTO )
734 x264_log( h, X264_LOG_WARNING, "direct=auto not used on the first pass\n" );
735 h->mb.b_direct_auto_write = 1;
738 if( ( p = strstr( opts, "b_adapt=" ) ) && sscanf( p, "b_adapt=%d", &i ) && i >= X264_B_ADAPT_NONE && i <= X264_B_ADAPT_TRELLIS )
739 h->param.i_bframe_adaptive = i;
740 else if( h->param.i_bframe )
742 x264_log( h, X264_LOG_ERROR, "b_adapt method specified in stats file not valid\n" );
746 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 ) )
747 h->param.rc.i_lookahead = i;
750 /* find number of pics */
753 for( num_entries = -1; p; num_entries++ )
754 p = strchr( p + 1, ';' );
757 x264_log(h, X264_LOG_ERROR, "empty stats file\n");
760 rc->num_entries = num_entries;
762 if( h->param.i_frame_total < rc->num_entries && h->param.i_frame_total > 0 )
764 x264_log( h, X264_LOG_WARNING, "2nd pass has fewer frames than 1st pass (%d vs %d)\n",
765 h->param.i_frame_total, rc->num_entries );
767 if( h->param.i_frame_total > rc->num_entries )
769 x264_log( h, X264_LOG_ERROR, "2nd pass has more frames than 1st pass (%d vs %d)\n",
770 h->param.i_frame_total, rc->num_entries );
774 CHECKED_MALLOCZERO( rc->entry, rc->num_entries * sizeof(ratecontrol_entry_t) );
776 /* init all to skipped p frames */
777 for( int i = 0; i < rc->num_entries; i++ )
779 ratecontrol_entry_t *rce = &rc->entry[i];
780 rce->pict_type = SLICE_TYPE_P;
781 rce->qscale = rce->new_qscale = qp2qscale( 20 );
782 rce->misc_bits = rc->nmb + 10;
788 for( int i = 0; i < rc->num_entries; i++ )
790 ratecontrol_entry_t *rce;
798 next= strchr(p, ';');
800 *next++ = 0; //sscanf is unbelievably slow on long strings
801 e = sscanf( p, " in:%d ", &frame_number );
803 if( frame_number < 0 || frame_number >= rc->num_entries )
805 x264_log( h, X264_LOG_ERROR, "bad frame number (%d) at stats line %d\n", frame_number, i );
808 rce = &rc->entry[frame_number];
809 rce->direct_mode = 0;
811 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",
812 &pict_type, &rce->i_duration, &rce->i_cpb_duration, &qp, &rce->tex_bits,
813 &rce->mv_bits, &rce->misc_bits, &rce->i_count, &rce->p_count,
814 &rce->s_count, &rce->direct_mode );
816 p = strstr( p, "ref:" );
820 for( ref = 0; ref < 16; ref++ )
822 if( sscanf( p, " %d", &rce->refcount[ref] ) != 1 )
824 p = strchr( p+1, ' ' );
831 rce->i_weight_denom = -1;
832 char *w = strchr( p, 'w' );
834 if( sscanf( w, "w:%hd,%hd,%hd", &rce->i_weight_denom, &rce->weight[0], &rce->weight[1] ) != 3 )
835 rce->i_weight_denom = -1;
837 if( pict_type != 'b' )
838 rce->kept_as_ref = 1;
842 rce->frame_type = X264_TYPE_IDR;
843 rce->pict_type = SLICE_TYPE_I;
846 rce->frame_type = X264_TYPE_I;
847 rce->pict_type = SLICE_TYPE_I;
850 rce->frame_type = X264_TYPE_P;
851 rce->pict_type = SLICE_TYPE_P;
854 rce->frame_type = X264_TYPE_BREF;
855 rce->pict_type = SLICE_TYPE_B;
858 rce->frame_type = X264_TYPE_B;
859 rce->pict_type = SLICE_TYPE_B;
861 default: e = -1; break;
866 x264_log( h, X264_LOG_ERROR, "statistics are damaged at line %d, parser out=%d\n", i, e );
869 rce->qscale = qp2qscale( qp );
873 x264_free( stats_buf );
875 if( h->param.rc.i_rc_method == X264_RC_ABR )
877 if( init_pass2( h ) < 0 )
879 } /* else we're using constant quant, so no need to run the bitrate allocation */
882 /* Open output file */
883 /* If input and output files are the same, output to a temp file
884 * and move it to the real name only when it's complete */
885 if( h->param.rc.b_stat_write )
888 rc->psz_stat_file_tmpname = x264_strcat_filename( h->param.rc.psz_stat_out, ".temp" );
889 if( !rc->psz_stat_file_tmpname )
892 rc->p_stat_file_out = fopen( rc->psz_stat_file_tmpname, "wb" );
893 if( rc->p_stat_file_out == NULL )
895 x264_log(h, X264_LOG_ERROR, "ratecontrol_init: can't open stats file\n");
899 p = x264_param2string( &h->param, 1 );
901 fprintf( rc->p_stat_file_out, "#options: %s\n", p );
903 if( h->param.rc.b_mb_tree && !h->param.rc.b_stat_read )
905 rc->psz_mbtree_stat_file_tmpname = x264_strcat_filename( h->param.rc.psz_stat_out, ".mbtree.temp" );
906 rc->psz_mbtree_stat_file_name = x264_strcat_filename( h->param.rc.psz_stat_out, ".mbtree" );
907 if( !rc->psz_mbtree_stat_file_tmpname || !rc->psz_mbtree_stat_file_name )
910 rc->p_mbtree_stat_file_out = fopen( rc->psz_mbtree_stat_file_tmpname, "wb" );
911 if( rc->p_mbtree_stat_file_out == NULL )
913 x264_log(h, X264_LOG_ERROR, "ratecontrol_init: can't open mbtree stats file\n");
919 if( h->param.rc.b_mb_tree && (h->param.rc.b_stat_read || h->param.rc.b_stat_write) )
921 CHECKED_MALLOC( rc->qp_buffer[0], h->mb.i_mb_count * sizeof(uint16_t) );
922 if( h->param.i_bframe_pyramid && h->param.rc.b_stat_read )
923 CHECKED_MALLOC( rc->qp_buffer[1], h->mb.i_mb_count * sizeof(uint16_t) );
927 for( int i = 0; i<h->param.i_threads; i++ )
929 h->thread[i]->rc = rc+i;
933 h->thread[i]->param = h->param;
934 h->thread[i]->mb.b_variable_qp = h->mb.b_variable_qp;
943 static int parse_zone( x264_t *h, x264_zone_t *z, char *p )
946 char *tok, UNUSED *saveptr=NULL;
948 z->f_bitrate_factor = 1;
949 if( 3 <= sscanf(p, "%u,%u,q=%u%n", &z->i_start, &z->i_end, &z->i_qp, &len) )
951 else if( 3 <= sscanf(p, "%u,%u,b=%f%n", &z->i_start, &z->i_end, &z->f_bitrate_factor, &len) )
953 else if( 2 <= sscanf(p, "%u,%u%n", &z->i_start, &z->i_end, &len) )
957 x264_log( h, X264_LOG_ERROR, "invalid zone: \"%s\"\n", p );
963 CHECKED_MALLOC( z->param, sizeof(x264_param_t) );
964 memcpy( z->param, &h->param, sizeof(x264_param_t) );
965 z->param->param_free = x264_free;
966 while( (tok = strtok_r( p, ",", &saveptr )) )
968 char *val = strchr( tok, '=' );
974 if( x264_param_parse( z->param, tok, val ) )
976 x264_log( h, X264_LOG_ERROR, "invalid zone param: %s = %s\n", tok, val );
986 static int parse_zones( x264_t *h )
988 x264_ratecontrol_t *rc = h->rc;
989 if( h->param.rc.psz_zones && !h->param.rc.i_zones )
992 CHECKED_MALLOC( psz_zones, strlen( h->param.rc.psz_zones )+1 );
993 strcpy( psz_zones, h->param.rc.psz_zones );
994 h->param.rc.i_zones = 1;
995 for( p = psz_zones; *p; p++ )
996 h->param.rc.i_zones += (*p == '/');
997 CHECKED_MALLOC( h->param.rc.zones, h->param.rc.i_zones * sizeof(x264_zone_t) );
999 for( int i = 0; i < h->param.rc.i_zones; i++ )
1001 int i_tok = strcspn( p, "/" );
1003 if( parse_zone( h, &h->param.rc.zones[i], p ) )
1007 x264_free( psz_zones );
1010 if( h->param.rc.i_zones > 0 )
1012 for( int i = 0; i < h->param.rc.i_zones; i++ )
1014 x264_zone_t z = h->param.rc.zones[i];
1015 if( z.i_start < 0 || z.i_start > z.i_end )
1017 x264_log( h, X264_LOG_ERROR, "invalid zone: start=%d end=%d\n",
1018 z.i_start, z.i_end );
1021 else if( !z.b_force_qp && z.f_bitrate_factor <= 0 )
1023 x264_log( h, X264_LOG_ERROR, "invalid zone: bitrate_factor=%f\n",
1024 z.f_bitrate_factor );
1029 rc->i_zones = h->param.rc.i_zones + 1;
1030 CHECKED_MALLOC( rc->zones, rc->i_zones * sizeof(x264_zone_t) );
1031 memcpy( rc->zones+1, h->param.rc.zones, (rc->i_zones-1) * sizeof(x264_zone_t) );
1033 // default zone to fall back to if none of the others match
1034 rc->zones[0].i_start = 0;
1035 rc->zones[0].i_end = INT_MAX;
1036 rc->zones[0].b_force_qp = 0;
1037 rc->zones[0].f_bitrate_factor = 1;
1038 CHECKED_MALLOC( rc->zones[0].param, sizeof(x264_param_t) );
1039 memcpy( rc->zones[0].param, &h->param, sizeof(x264_param_t) );
1040 for( int i = 1; i < rc->i_zones; i++ )
1042 if( !rc->zones[i].param )
1043 rc->zones[i].param = rc->zones[0].param;
1052 static x264_zone_t *get_zone( x264_t *h, int frame_num )
1054 for( int i = h->rc->i_zones - 1; i >= 0; i-- )
1056 x264_zone_t *z = &h->rc->zones[i];
1057 if( frame_num >= z->i_start && frame_num <= z->i_end )
1063 void x264_ratecontrol_summary( x264_t *h )
1065 x264_ratecontrol_t *rc = h->rc;
1066 if( rc->b_abr && h->param.rc.i_rc_method == X264_RC_ABR && rc->cbr_decay > .9999 )
1068 double base_cplx = h->mb.i_mb_count * (h->param.i_bframe ? 120 : 80);
1069 double mbtree_offset = h->param.rc.b_mb_tree ? (1.0-h->param.rc.f_qcompress)*13.5 : 0;
1070 x264_log( h, X264_LOG_INFO, "final ratefactor: %.2f\n",
1071 qscale2qp( pow( base_cplx, 1 - rc->qcompress )
1072 * rc->cplxr_sum / rc->wanted_bits_window ) - mbtree_offset );
1076 void x264_ratecontrol_delete( x264_t *h )
1078 x264_ratecontrol_t *rc = h->rc;
1081 if( rc->p_stat_file_out )
1083 b_regular_file = x264_is_regular_file( rc->p_stat_file_out );
1084 fclose( rc->p_stat_file_out );
1085 if( h->i_frame >= rc->num_entries && b_regular_file )
1086 if( rename( rc->psz_stat_file_tmpname, h->param.rc.psz_stat_out ) != 0 )
1088 x264_log( h, X264_LOG_ERROR, "failed to rename \"%s\" to \"%s\"\n",
1089 rc->psz_stat_file_tmpname, h->param.rc.psz_stat_out );
1091 x264_free( rc->psz_stat_file_tmpname );
1093 if( rc->p_mbtree_stat_file_out )
1095 b_regular_file = x264_is_regular_file( rc->p_mbtree_stat_file_out );
1096 fclose( rc->p_mbtree_stat_file_out );
1097 if( h->i_frame >= rc->num_entries && b_regular_file )
1098 if( rename( rc->psz_mbtree_stat_file_tmpname, rc->psz_mbtree_stat_file_name ) != 0 )
1100 x264_log( h, X264_LOG_ERROR, "failed to rename \"%s\" to \"%s\"\n",
1101 rc->psz_mbtree_stat_file_tmpname, rc->psz_mbtree_stat_file_name );
1103 x264_free( rc->psz_mbtree_stat_file_tmpname );
1104 x264_free( rc->psz_mbtree_stat_file_name );
1106 if( rc->p_mbtree_stat_file_in )
1107 fclose( rc->p_mbtree_stat_file_in );
1108 x264_free( rc->pred );
1109 x264_free( rc->pred_b_from_p );
1110 x264_free( rc->entry );
1111 x264_free( rc->qp_buffer[0] );
1112 x264_free( rc->qp_buffer[1] );
1115 x264_free( rc->zones[0].param );
1116 for( int i = 1; i < rc->i_zones; i++ )
1117 if( rc->zones[i].param != rc->zones[0].param && rc->zones[i].param->param_free )
1118 rc->zones[i].param->param_free( rc->zones[i].param );
1119 x264_free( rc->zones );
1124 static void accum_p_qp_update( x264_t *h, float qp )
1126 x264_ratecontrol_t *rc = h->rc;
1127 rc->accum_p_qp *= .95;
1128 rc->accum_p_norm *= .95;
1129 rc->accum_p_norm += 1;
1130 if( h->sh.i_type == SLICE_TYPE_I )
1131 rc->accum_p_qp += qp + rc->ip_offset;
1133 rc->accum_p_qp += qp;
1136 /* Before encoding a frame, choose a QP for it */
1137 void x264_ratecontrol_start( x264_t *h, int i_force_qp, int overhead )
1139 x264_ratecontrol_t *rc = h->rc;
1140 ratecontrol_entry_t *rce = NULL;
1141 x264_zone_t *zone = get_zone( h, h->fenc->i_frame );
1146 if( zone && (!rc->prev_zone || zone->param != rc->prev_zone->param) )
1147 x264_encoder_reconfig( h, zone->param );
1148 rc->prev_zone = zone;
1150 rc->qp_force = i_force_qp;
1152 if( h->param.rc.b_stat_read )
1154 int frame = h->fenc->i_frame;
1155 assert( frame >= 0 && frame < rc->num_entries );
1156 rce = h->rc->rce = &h->rc->entry[frame];
1158 if( h->sh.i_type == SLICE_TYPE_B
1159 && h->param.analyse.i_direct_mv_pred == X264_DIRECT_PRED_AUTO )
1161 h->sh.b_direct_spatial_mv_pred = ( rce->direct_mode == 's' );
1162 h->mb.b_direct_auto_read = ( rce->direct_mode == 's' || rce->direct_mode == 't' );
1168 memset( h->fdec->i_row_bits, 0, h->mb.i_mb_height * sizeof(int) );
1169 rc->row_pred = &rc->row_preds[h->sh.i_type];
1170 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;
1171 update_vbv_plan( h, overhead );
1173 const x264_level_t *l = x264_levels;
1174 while( l->level_idc != 0 && l->level_idc != h->param.i_level_idc )
1177 int mincr = l->mincr;
1179 /* Blu-ray requires this */
1180 if( l->level_idc == 41 && h->param.i_nal_hrd )
1183 /* The spec has a bizarre special case for the first frame. */
1184 if( h->i_frame == 0 )
1186 //384 * ( Max( PicSizeInMbs, fR * MaxMBPS ) + MaxMBPS * ( tr( 0 ) - tr,n( 0 ) ) ) / MinCR
1187 double fr = 1. / 172;
1188 int pic_size_in_mbs = h->mb.i_mb_width * h->mb.i_mb_height;
1189 rc->frame_size_maximum = 384 * 8 * X264_MAX( pic_size_in_mbs, fr*l->mbps ) / mincr;
1193 //384 * MaxMBPS * ( tr( n ) - tr( n - 1 ) ) / MinCR
1194 rc->frame_size_maximum = 384 * 8 * ((double)h->fenc->i_cpb_duration * h->sps->vui.i_num_units_in_tick / h->sps->vui.i_time_scale) * l->mbps / mincr;
1198 if( h->sh.i_type != SLICE_TYPE_B )
1199 rc->bframes = h->fenc->i_bframes;
1205 else if( rc->b_abr )
1207 q = qscale2qp( rate_estimate_qscale( h ) );
1209 else if( rc->b_2pass )
1211 rce->new_qscale = rate_estimate_qscale( h );
1212 q = qscale2qp( rce->new_qscale );
1216 if( h->sh.i_type == SLICE_TYPE_B && h->fdec->b_kept_as_ref )
1217 q = ( rc->qp_constant[ SLICE_TYPE_B ] + rc->qp_constant[ SLICE_TYPE_P ] ) / 2;
1219 q = rc->qp_constant[ h->sh.i_type ];
1223 if( zone->b_force_qp )
1224 q += zone->i_qp - rc->qp_constant[SLICE_TYPE_P];
1226 q -= 6*log2f( zone->f_bitrate_factor );
1230 q = x264_clip3f( q, h->param.rc.i_qp_min, h->param.rc.i_qp_max );
1234 rc->qp = x264_clip3( (int)(q + 0.5), 0, 51 );
1235 h->fdec->f_qp_avg_rc =
1236 h->fdec->f_qp_avg_aq =
1239 rce->new_qp = rc->qp;
1241 accum_p_qp_update( h, rc->qpm );
1243 if( h->sh.i_type != SLICE_TYPE_B )
1244 rc->last_non_b_pict_type = h->sh.i_type;
1247 static double predict_row_size( x264_t *h, int y, double qp )
1249 /* average between two predictors:
1250 * absolute SATD, and scaled bit cost of the colocated row in the previous frame */
1251 x264_ratecontrol_t *rc = h->rc;
1252 double pred_s = predict_size( rc->row_pred[0], qp2qscale( qp ), h->fdec->i_row_satd[y] );
1254 if( h->sh.i_type == SLICE_TYPE_I || qp >= h->fref0[0]->f_row_qp[y] )
1256 if( h->sh.i_type == SLICE_TYPE_P
1257 && h->fref0[0]->i_type == h->fdec->i_type
1258 && h->fref0[0]->i_row_satd[y] > 0
1259 && (abs(h->fref0[0]->i_row_satd[y] - h->fdec->i_row_satd[y]) < h->fdec->i_row_satd[y]/2))
1261 pred_t = h->fref0[0]->i_row_bits[y] * h->fdec->i_row_satd[y] / h->fref0[0]->i_row_satd[y]
1262 * qp2qscale( h->fref0[0]->f_row_qp[y] ) / qp2qscale( qp );
1266 return (pred_s + pred_t) / 2;
1268 /* Our QP is lower than the reference! */
1271 double pred_intra = predict_size( rc->row_pred[1], qp2qscale( qp ), h->fdec->i_row_satds[0][0][y] );
1272 /* Sum: better to overestimate than underestimate by using only one of the two predictors. */
1273 return pred_intra + pred_s;
1277 static double row_bits_so_far( x264_t *h, int y )
1280 for( int i = h->i_threadslice_start; i <= y; i++ )
1281 bits += h->fdec->i_row_bits[i];
1285 static double predict_row_size_sum( x264_t *h, int y, double qp )
1287 double bits = row_bits_so_far(h, y);
1288 for( int i = y+1; i < h->i_threadslice_end; i++ )
1289 bits += predict_row_size( h, i, qp );
1294 void x264_ratecontrol_mb( x264_t *h, int bits )
1296 x264_ratecontrol_t *rc = h->rc;
1297 const int y = h->mb.i_mb_y;
1301 h->fdec->i_row_bits[y] += bits;
1302 rc->qpa_rc += rc->qpm;
1303 rc->qpa_aq += h->mb.i_qp;
1305 if( h->mb.i_mb_x != h->mb.i_mb_width - 1 || !rc->b_vbv )
1308 h->fdec->f_row_qp[y] = rc->qpm;
1310 update_predictor( rc->row_pred[0], qp2qscale( rc->qpm ), h->fdec->i_row_satd[y], h->fdec->i_row_bits[y] );
1311 if( h->sh.i_type == SLICE_TYPE_P && rc->qpm < h->fref0[0]->f_row_qp[y] )
1312 update_predictor( rc->row_pred[1], qp2qscale( rc->qpm ), h->fdec->i_row_satds[0][0][y], h->fdec->i_row_bits[y] );
1314 /* tweak quality based on difference from predicted size */
1315 if( y < h->i_threadslice_end-1 )
1317 float prev_row_qp = h->fdec->f_row_qp[y];
1318 float qp_min = X264_MAX( prev_row_qp - h->param.rc.i_qp_step, h->param.rc.i_qp_min );
1319 float qp_absolute_max = h->param.rc.i_qp_max;
1320 if( rc->rate_factor_max_increment )
1321 qp_absolute_max = X264_MIN( qp_absolute_max, rc->qp_novbv + rc->rate_factor_max_increment );
1322 float qp_max = X264_MIN( prev_row_qp + h->param.rc.i_qp_step, qp_absolute_max );
1323 float step_size = 0.5;
1325 /* B-frames shouldn't use lower QP than their reference frames. */
1326 if( h->sh.i_type == SLICE_TYPE_B )
1328 qp_min = X264_MAX( qp_min, X264_MAX( h->fref0[0]->f_row_qp[y+1], h->fref1[0]->f_row_qp[y+1] ) );
1329 rc->qpm = X264_MAX( rc->qpm, qp_min );
1332 float buffer_left_planned = rc->buffer_fill - rc->frame_size_planned;
1333 float slice_size_planned = h->param.b_sliced_threads ? rc->slice_size_planned : rc->frame_size_planned;
1334 float size_of_other_slices = 0;
1335 if( h->param.b_sliced_threads )
1337 for( int i = 0; i < h->param.i_threads; i++ )
1338 if( h != h->thread[i] )
1339 size_of_other_slices += h->thread[i]->rc->frame_size_estimated;
1342 rc->max_frame_error = X264_MAX( 0.05, 1.0 / (h->mb.i_mb_width) );
1344 /* More threads means we have to be more cautious in letting ratecontrol use up extra bits. */
1345 float rc_tol = buffer_left_planned / h->param.i_threads * rc->rate_tolerance;
1346 int b1 = predict_row_size_sum( h, y, rc->qpm ) + size_of_other_slices;
1348 /* Don't modify the row QPs until a sufficent amount of the bits of the frame have been processed, in case a flat */
1349 /* area at the top of the frame was measured inaccurately. */
1350 if( row_bits_so_far( h, y ) < 0.05 * slice_size_planned )
1353 if( h->sh.i_type != SLICE_TYPE_I )
1356 if( !rc->b_vbv_min_rate )
1357 qp_min = X264_MAX( qp_min, rc->qp_novbv );
1359 while( rc->qpm < qp_max
1360 && ((b1 > rc->frame_size_planned + rc_tol) ||
1361 (rc->buffer_fill - b1 < buffer_left_planned * 0.5) ||
1362 (b1 > rc->frame_size_planned && rc->qpm < rc->qp_novbv)) )
1364 rc->qpm += step_size;
1365 b1 = predict_row_size_sum( h, y, rc->qpm ) + size_of_other_slices;
1368 while( rc->qpm > qp_min
1369 && (rc->qpm > h->fdec->f_row_qp[0] || rc->single_frame_vbv)
1370 && ((b1 < rc->frame_size_planned * 0.8 && rc->qpm <= prev_row_qp)
1371 || b1 < (rc->buffer_fill - rc->buffer_size + rc->buffer_rate) * 1.1) )
1373 rc->qpm -= step_size;
1374 b1 = predict_row_size_sum( h, y, rc->qpm ) + size_of_other_slices;
1377 /* avoid VBV underflow or MinCR violation */
1378 while( (rc->qpm < qp_absolute_max)
1379 && ((rc->buffer_fill - b1 < rc->buffer_rate * rc->max_frame_error) ||
1380 (rc->frame_size_maximum - b1 < rc->frame_size_maximum * rc->max_frame_error)))
1382 rc->qpm += step_size;
1383 b1 = predict_row_size_sum( h, y, rc->qpm ) + size_of_other_slices;
1386 h->rc->frame_size_estimated = predict_row_size_sum( h, y, rc->qpm );
1390 int x264_ratecontrol_qp( x264_t *h )
1393 return x264_clip3( h->rc->qpm + .5, h->param.rc.i_qp_min, h->param.rc.i_qp_max );
1396 int x264_ratecontrol_mb_qp( x264_t *h )
1399 float qp = h->rc->qpm;
1400 if( h->param.rc.i_aq_mode )
1401 /* MB-tree currently doesn't adjust quantizers in unreferenced frames. */
1402 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];
1403 return x264_clip3( qp + .5, h->param.rc.i_qp_min, h->param.rc.i_qp_max );
1406 /* In 2pass, force the same frame types as in the 1st pass */
1407 int x264_ratecontrol_slice_type( x264_t *h, int frame_num )
1409 x264_ratecontrol_t *rc = h->rc;
1410 if( h->param.rc.b_stat_read )
1412 if( frame_num >= rc->num_entries )
1414 /* We could try to initialize everything required for ABR and
1415 * adaptive B-frames, but that would be complicated.
1416 * So just calculate the average QP used so far. */
1417 h->param.rc.i_qp_constant = (h->stat.i_frame_count[SLICE_TYPE_P] == 0) ? 24
1418 : 1 + h->stat.f_frame_qp[SLICE_TYPE_P] / h->stat.i_frame_count[SLICE_TYPE_P];
1419 rc->qp_constant[SLICE_TYPE_P] = x264_clip3( h->param.rc.i_qp_constant, 0, 51 );
1420 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, 51 );
1421 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, 51 );
1423 x264_log(h, X264_LOG_ERROR, "2nd pass has more frames than 1st pass (%d)\n", rc->num_entries);
1424 x264_log(h, X264_LOG_ERROR, "continuing anyway, at constant QP=%d\n", h->param.rc.i_qp_constant);
1425 if( h->param.i_bframe_adaptive )
1426 x264_log(h, X264_LOG_ERROR, "disabling adaptive B-frames\n");
1428 for( int i = 0; i < h->param.i_threads; i++ )
1430 h->thread[i]->rc->b_abr = 0;
1431 h->thread[i]->rc->b_2pass = 0;
1432 h->thread[i]->param.rc.i_rc_method = X264_RC_CQP;
1433 h->thread[i]->param.rc.b_stat_read = 0;
1434 h->thread[i]->param.i_bframe_adaptive = 0;
1435 h->thread[i]->param.i_scenecut_threshold = 0;
1436 h->thread[i]->param.rc.b_mb_tree = 0;
1437 if( h->thread[i]->param.i_bframe > 1 )
1438 h->thread[i]->param.i_bframe = 1;
1440 return X264_TYPE_AUTO;
1442 return rc->entry[frame_num].frame_type;
1445 return X264_TYPE_AUTO;
1448 void x264_ratecontrol_set_weights( x264_t *h, x264_frame_t *frm )
1450 ratecontrol_entry_t *rce = &h->rc->entry[frm->i_frame];
1451 if( h->param.analyse.i_weighted_pred <= 0 )
1453 if( rce->i_weight_denom >= 0 )
1454 SET_WEIGHT( frm->weight[0][0], 1, rce->weight[0], rce->i_weight_denom, rce->weight[1] );
1457 /* After encoding one frame, save stats and update ratecontrol state */
1458 int x264_ratecontrol_end( x264_t *h, int bits, int *filler )
1460 x264_ratecontrol_t *rc = h->rc;
1461 const int *mbs = h->stat.frame.i_mb_count;
1465 h->stat.frame.i_mb_count_skip = mbs[P_SKIP] + mbs[B_SKIP];
1466 h->stat.frame.i_mb_count_i = mbs[I_16x16] + mbs[I_8x8] + mbs[I_4x4];
1467 h->stat.frame.i_mb_count_p = mbs[P_L0] + mbs[P_8x8];
1468 for( int i = B_DIRECT; i < B_8x8; i++ )
1469 h->stat.frame.i_mb_count_p += mbs[i];
1471 h->fdec->f_qp_avg_rc = rc->qpa_rc /= h->mb.i_mb_count;
1472 h->fdec->f_qp_avg_aq = rc->qpa_aq /= h->mb.i_mb_count;
1474 if( h->param.rc.b_stat_write )
1476 char c_type = h->sh.i_type==SLICE_TYPE_I ? (h->fenc->i_poc==0 ? 'I' : 'i')
1477 : h->sh.i_type==SLICE_TYPE_P ? 'P'
1478 : h->fenc->b_kept_as_ref ? 'B' : 'b';
1479 int dir_frame = h->stat.frame.i_direct_score[1] - h->stat.frame.i_direct_score[0];
1480 int dir_avg = h->stat.i_direct_score[1] - h->stat.i_direct_score[0];
1481 char c_direct = h->mb.b_direct_auto_write ?
1482 ( dir_frame>0 ? 's' : dir_frame<0 ? 't' :
1483 dir_avg>0 ? 's' : dir_avg<0 ? 't' : '-' )
1485 if( fprintf( rc->p_stat_file_out,
1486 "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:",
1487 h->fenc->i_frame, h->i_frame,
1488 c_type, h->fenc->i_duration,
1489 h->fenc->i_cpb_duration, rc->qpa_rc,
1490 h->stat.frame.i_tex_bits,
1491 h->stat.frame.i_mv_bits,
1492 h->stat.frame.i_misc_bits,
1493 h->stat.frame.i_mb_count_i,
1494 h->stat.frame.i_mb_count_p,
1495 h->stat.frame.i_mb_count_skip,
1499 /* Only write information for reference reordering once. */
1500 int use_old_stats = h->param.rc.b_stat_read && rc->rce->refs > 1;
1501 for( int i = 0; i < (use_old_stats ? rc->rce->refs : h->i_ref0); i++ )
1503 int refcount = use_old_stats ? rc->rce->refcount[i]
1504 : h->param.b_interlaced ? h->stat.frame.i_mb_count_ref[0][i*2]
1505 + h->stat.frame.i_mb_count_ref[0][i*2+1]
1506 : h->stat.frame.i_mb_count_ref[0][i];
1507 if( fprintf( rc->p_stat_file_out, "%d ", refcount ) < 0 )
1511 if( h->sh.weight[0][0].weightfn )
1513 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 )
1517 if( fprintf( rc->p_stat_file_out, ";\n") < 0 )
1520 /* Don't re-write the data in multi-pass mode. */
1521 if( h->param.rc.b_mb_tree && h->fenc->b_kept_as_ref && !h->param.rc.b_stat_read )
1523 uint8_t i_type = h->sh.i_type;
1524 /* Values are stored as big-endian FIX8.8 */
1525 for( int i = 0; i < h->mb.i_mb_count; i++ )
1526 rc->qp_buffer[0][i] = endian_fix16( h->fenc->f_qp_offset[i]*256.0 );
1527 if( fwrite( &i_type, 1, 1, rc->p_mbtree_stat_file_out ) < 1 )
1529 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 )
1536 if( h->sh.i_type != SLICE_TYPE_B )
1537 rc->cplxr_sum += bits * qp2qscale( rc->qpa_rc ) / rc->last_rceq;
1540 /* Depends on the fact that B-frame's QP is an offset from the following P-frame's.
1541 * Not perfectly accurate with B-refs, but good enough. */
1542 rc->cplxr_sum += bits * qp2qscale( rc->qpa_rc ) / (rc->last_rceq * fabs( h->param.rc.f_pb_factor ));
1544 rc->cplxr_sum *= rc->cbr_decay;
1545 double frame_duration = (double)h->fenc->i_duration * h->sps->vui.i_num_units_in_tick / h->sps->vui.i_time_scale;
1547 rc->wanted_bits_window += frame_duration * rc->bitrate;
1548 rc->wanted_bits_window *= rc->cbr_decay;
1552 rc->expected_bits_sum += qscale2bits( rc->rce, qp2qscale( rc->rce->new_qp ) );
1554 if( h->mb.b_variable_qp )
1556 if( h->sh.i_type == SLICE_TYPE_B )
1558 rc->bframe_bits += bits;
1559 if( h->fenc->b_last_minigop_bframe )
1561 update_predictor( rc->pred_b_from_p, qp2qscale( rc->qpa_rc ),
1562 h->fref1[h->i_ref1-1]->i_satd, rc->bframe_bits / rc->bframes );
1563 rc->bframe_bits = 0;
1568 *filler = update_vbv( h, bits );
1570 if( h->sps->vui.b_nal_hrd_parameters_present )
1572 if( h->fenc->i_frame == 0 )
1574 // access unit initialises the HRD
1575 h->fenc->hrd_timing.cpb_initial_arrival_time = 0;
1576 rc->initial_cpb_removal_delay = h->initial_cpb_removal_delay;
1577 rc->initial_cpb_removal_delay_offset = h->initial_cpb_removal_delay_offset;
1578 h->fenc->hrd_timing.cpb_removal_time = rc->nrt_first_access_unit = (double)rc->initial_cpb_removal_delay / 90000;
1582 h->fenc->hrd_timing.cpb_removal_time = rc->nrt_first_access_unit + (double)h->fenc->i_cpb_delay *
1583 h->sps->vui.i_num_units_in_tick / h->sps->vui.i_time_scale;
1585 double cpb_earliest_arrival_time = h->fenc->hrd_timing.cpb_removal_time - (double)rc->initial_cpb_removal_delay / 90000;
1586 if( h->fenc->b_keyframe )
1588 rc->nrt_first_access_unit = h->fenc->hrd_timing.cpb_removal_time;
1589 rc->initial_cpb_removal_delay = h->initial_cpb_removal_delay;
1590 rc->initial_cpb_removal_delay_offset = h->initial_cpb_removal_delay_offset;
1593 cpb_earliest_arrival_time -= (double)rc->initial_cpb_removal_delay_offset / 90000;
1595 if( h->sps->vui.hrd.b_cbr_hrd )
1596 h->fenc->hrd_timing.cpb_initial_arrival_time = rc->previous_cpb_final_arrival_time;
1598 h->fenc->hrd_timing.cpb_initial_arrival_time = X264_MAX( rc->previous_cpb_final_arrival_time, cpb_earliest_arrival_time );
1600 int filler_bits = *filler ? X264_MAX( (FILLER_OVERHEAD - h->param.b_annexb), *filler )*8 : 0;
1602 h->fenc->hrd_timing.cpb_final_arrival_time = rc->previous_cpb_final_arrival_time = h->fenc->hrd_timing.cpb_initial_arrival_time +
1603 (double)(bits + filler_bits) / h->sps->vui.hrd.i_bit_rate_unscaled;
1605 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 +
1606 h->fenc->hrd_timing.cpb_removal_time;
1611 x264_log(h, X264_LOG_ERROR, "ratecontrol_end: stats file could not be written to\n");
1615 /****************************************************************************
1617 ***************************************************************************/
1620 * modify the bitrate curve from pass1 for one frame
1622 static double get_qscale(x264_t *h, ratecontrol_entry_t *rce, double rate_factor, int frame_num)
1624 x264_ratecontrol_t *rcc= h->rc;
1625 x264_zone_t *zone = get_zone( h, frame_num );
1626 double q = pow( rce->blurred_complexity, 1 - rcc->qcompress );
1628 // avoid NaN's in the rc_eq
1629 if( !isfinite(q) || rce->tex_bits + rce->mv_bits == 0 )
1630 q = rcc->last_qscale_for[rce->pict_type];
1635 rcc->last_qscale = q;
1640 if( zone->b_force_qp )
1641 q = qp2qscale( zone->i_qp );
1643 q /= zone->f_bitrate_factor;
1649 static double get_diff_limited_q(x264_t *h, ratecontrol_entry_t *rce, double q)
1651 x264_ratecontrol_t *rcc = h->rc;
1652 const int pict_type = rce->pict_type;
1654 // force I/B quants as a function of P quants
1655 const double last_p_q = rcc->last_qscale_for[SLICE_TYPE_P];
1656 const double last_non_b_q= rcc->last_qscale_for[rcc->last_non_b_pict_type];
1657 if( pict_type == SLICE_TYPE_I )
1660 double pq = qp2qscale( rcc->accum_p_qp / rcc->accum_p_norm );
1661 double ip_factor = fabs( h->param.rc.f_ip_factor );
1662 /* don't apply ip_factor if the following frame is also I */
1663 if( rcc->accum_p_norm <= 0 )
1665 else if( h->param.rc.f_ip_factor < 0 )
1667 else if( rcc->accum_p_norm >= 1 )
1670 q = rcc->accum_p_norm * pq / ip_factor + (1 - rcc->accum_p_norm) * iq;
1672 else if( pict_type == SLICE_TYPE_B )
1674 if( h->param.rc.f_pb_factor > 0 )
1676 if( !rce->kept_as_ref )
1677 q *= fabs( h->param.rc.f_pb_factor );
1679 else if( pict_type == SLICE_TYPE_P
1680 && rcc->last_non_b_pict_type == SLICE_TYPE_P
1681 && rce->tex_bits == 0 )
1686 /* last qscale / qdiff stuff */
1687 if( rcc->last_non_b_pict_type == pict_type &&
1688 (pict_type!=SLICE_TYPE_I || rcc->last_accum_p_norm < 1) )
1690 double last_q = rcc->last_qscale_for[pict_type];
1691 double max_qscale = last_q * rcc->lstep;
1692 double min_qscale = last_q / rcc->lstep;
1694 if ( q > max_qscale ) q = max_qscale;
1695 else if( q < min_qscale ) q = min_qscale;
1698 rcc->last_qscale_for[pict_type] = q;
1699 if( pict_type != SLICE_TYPE_B )
1700 rcc->last_non_b_pict_type = pict_type;
1701 if( pict_type == SLICE_TYPE_I )
1703 rcc->last_accum_p_norm = rcc->accum_p_norm;
1704 rcc->accum_p_norm = 0;
1705 rcc->accum_p_qp = 0;
1707 if( pict_type == SLICE_TYPE_P )
1709 float mask = 1 - pow( (float)rce->i_count / rcc->nmb, 2 );
1710 rcc->accum_p_qp = mask * (qscale2qp( q ) + rcc->accum_p_qp);
1711 rcc->accum_p_norm = mask * (1 + rcc->accum_p_norm);
1716 static double predict_size( predictor_t *p, double q, double var )
1718 return (p->coeff*var + p->offset) / (q*p->count);
1721 static void update_predictor( predictor_t *p, double q, double var, double bits )
1723 const double range = 1.5;
1726 double old_coeff = p->coeff / p->count;
1727 double new_coeff = bits*q / var;
1728 double new_coeff_clipped = x264_clip3f( new_coeff, old_coeff/range, old_coeff*range );
1729 double new_offset = bits*q - new_coeff_clipped * var;
1730 if( new_offset >= 0 )
1731 new_coeff = new_coeff_clipped;
1734 p->count *= p->decay;
1735 p->coeff *= p->decay;
1736 p->offset *= p->decay;
1738 p->coeff += new_coeff;
1739 p->offset += new_offset;
1742 // update VBV after encoding a frame
1743 static int update_vbv( x264_t *h, int bits )
1746 int bitrate = h->sps->vui.hrd.i_bit_rate_unscaled;
1747 x264_ratecontrol_t *rcc = h->rc;
1748 x264_ratecontrol_t *rct = h->thread[0]->rc;
1749 uint64_t buffer_size = (uint64_t)h->sps->vui.hrd.i_cpb_size_unscaled * h->sps->vui.i_time_scale;
1751 if( rcc->last_satd >= h->mb.i_mb_count )
1752 update_predictor( &rct->pred[h->sh.i_type], qp2qscale( rcc->qpa_rc ), rcc->last_satd, bits );
1757 rct->buffer_fill_final -= (uint64_t)bits * h->sps->vui.i_time_scale;
1759 if( rct->buffer_fill_final < 0 )
1760 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 );
1761 rct->buffer_fill_final = X264_MAX( rct->buffer_fill_final, 0 );
1762 rct->buffer_fill_final += (uint64_t)bitrate * h->sps->vui.i_num_units_in_tick * h->fenc->i_cpb_duration;
1764 if( h->sps->vui.hrd.b_cbr_hrd && rct->buffer_fill_final > buffer_size )
1766 filler = ceil( (rct->buffer_fill_final - buffer_size) / (8. * h->sps->vui.i_time_scale) );
1767 bits = X264_MAX( (FILLER_OVERHEAD - h->param.b_annexb), filler ) * 8;
1768 rct->buffer_fill_final -= (uint64_t)bits * h->sps->vui.i_time_scale;
1771 rct->buffer_fill_final = X264_MIN( rct->buffer_fill_final, buffer_size );
1776 void x264_hrd_fullness( x264_t *h )
1778 x264_ratecontrol_t *rct = h->thread[0]->rc;
1779 uint64_t denom = (uint64_t)h->sps->vui.hrd.i_bit_rate_unscaled * h->sps->vui.i_time_scale / rct->hrd_multiply_denom;
1780 uint64_t cpb_state = rct->buffer_fill_final;
1781 uint64_t cpb_size = (uint64_t)h->sps->vui.hrd.i_cpb_size_unscaled * h->sps->vui.i_time_scale;
1782 uint64_t multiply_factor = 180000 / rct->hrd_multiply_denom;
1784 if( rct->buffer_fill_final < 0 || rct->buffer_fill_final > cpb_size )
1786 x264_log( h, X264_LOG_WARNING, "CPB %s: %.0lf bits in a %.0lf-bit buffer\n",
1787 rct->buffer_fill_final < 0 ? "underflow" : "overflow", (float)rct->buffer_fill_final/denom, (float)cpb_size/denom );
1790 h->initial_cpb_removal_delay = (multiply_factor * cpb_state + denom) / (2*denom);
1791 h->initial_cpb_removal_delay_offset = (multiply_factor * cpb_size + denom) / (2*denom) - h->initial_cpb_removal_delay;
1794 // provisionally update VBV according to the planned size of all frames currently in progress
1795 static void update_vbv_plan( x264_t *h, int overhead )
1797 x264_ratecontrol_t *rcc = h->rc;
1798 rcc->buffer_fill = h->thread[0]->rc->buffer_fill_final / h->sps->vui.i_time_scale;
1799 if( h->i_thread_frames > 1 )
1801 int j = h->rc - h->thread[0]->rc;
1802 for( int i = 1; i < h->i_thread_frames; i++ )
1804 x264_t *t = h->thread[ (j+i)%h->i_thread_frames ];
1805 double bits = t->rc->frame_size_planned;
1806 if( !t->b_thread_active )
1808 bits = X264_MAX(bits, t->rc->frame_size_estimated);
1809 rcc->buffer_fill -= bits;
1810 rcc->buffer_fill = X264_MAX( rcc->buffer_fill, 0 );
1811 rcc->buffer_fill += t->rc->buffer_rate;
1812 rcc->buffer_fill = X264_MIN( rcc->buffer_fill, rcc->buffer_size );
1815 rcc->buffer_fill = X264_MIN( rcc->buffer_fill, rcc->buffer_size );
1816 rcc->buffer_fill -= overhead;
1819 // apply VBV constraints and clip qscale to between lmin and lmax
1820 static double clip_qscale( x264_t *h, int pict_type, double q )
1822 x264_ratecontrol_t *rcc = h->rc;
1823 double lmin = rcc->lmin[pict_type];
1824 double lmax = rcc->lmax[pict_type];
1825 if( rcc->rate_factor_max_increment )
1826 lmax = X264_MIN( lmax, qp2qscale( rcc->qp_novbv + rcc->rate_factor_max_increment ) );
1829 /* B-frames are not directly subject to VBV,
1830 * since they are controlled by the P-frames' QPs. */
1832 if( rcc->b_vbv && rcc->last_satd > 0 )
1834 /* Lookahead VBV: raise the quantizer as necessary such that no frames in
1835 * the lookahead overflow and such that the buffer is in a reasonable state
1836 * by the end of the lookahead. */
1837 if( h->param.rc.i_lookahead )
1841 /* Avoid an infinite loop. */
1842 for( int iterations = 0; iterations < 1000 && terminate != 3; iterations++ )
1845 double cur_bits = predict_size( &rcc->pred[h->sh.i_type], q, rcc->last_satd );
1846 double buffer_fill_cur = rcc->buffer_fill - cur_bits;
1848 double total_duration = 0;
1849 frame_q[0] = h->sh.i_type == SLICE_TYPE_I ? q * h->param.rc.f_ip_factor : q;
1850 frame_q[1] = frame_q[0] * h->param.rc.f_pb_factor;
1851 frame_q[2] = frame_q[0] / h->param.rc.f_ip_factor;
1853 /* Loop over the planned future frames. */
1854 for( int j = 0; buffer_fill_cur >= 0 && buffer_fill_cur <= rcc->buffer_size; j++ )
1856 total_duration += h->fenc->f_planned_cpb_duration[j];
1857 buffer_fill_cur += rcc->vbv_max_rate * h->fenc->f_planned_cpb_duration[j];
1858 int i_type = h->fenc->i_planned_type[j];
1859 int i_satd = h->fenc->i_planned_satd[j];
1860 if( i_type == X264_TYPE_AUTO )
1862 i_type = IS_X264_TYPE_I( i_type ) ? SLICE_TYPE_I : IS_X264_TYPE_B( i_type ) ? SLICE_TYPE_B : SLICE_TYPE_P;
1863 cur_bits = predict_size( &rcc->pred[i_type], frame_q[i_type], i_satd );
1864 buffer_fill_cur -= cur_bits;
1866 /* Try to get to get the buffer at least 50% filled, but don't set an impossible goal. */
1867 target_fill = X264_MIN( rcc->buffer_fill + total_duration * rcc->vbv_max_rate * 0.5, rcc->buffer_size * 0.5 );
1868 if( buffer_fill_cur < target_fill )
1874 /* Try to get the buffer no more than 80% filled, but don't set an impossible goal. */
1875 target_fill = x264_clip3f( rcc->buffer_fill - total_duration * rcc->vbv_max_rate * 0.5, rcc->buffer_size * 0.8, rcc->buffer_size );
1876 if( rcc->b_vbv_min_rate && buffer_fill_cur > target_fill )
1885 /* Fallback to old purely-reactive algorithm: no lookahead. */
1888 if( ( pict_type == SLICE_TYPE_P ||
1889 ( pict_type == SLICE_TYPE_I && rcc->last_non_b_pict_type == SLICE_TYPE_I ) ) &&
1890 rcc->buffer_fill/rcc->buffer_size < 0.5 )
1892 q /= x264_clip3f( 2.0*rcc->buffer_fill/rcc->buffer_size, 0.5, 1.0 );
1895 /* Now a hard threshold to make sure the frame fits in VBV.
1896 * This one is mostly for I-frames. */
1897 double bits = predict_size( &rcc->pred[h->sh.i_type], q, rcc->last_satd );
1899 /* For small VBVs, allow the frame to use up the entire VBV. */
1900 double max_fill_factor = h->param.rc.i_vbv_buffer_size >= 5*h->param.rc.i_vbv_max_bitrate / rcc->fps ? 2 : 1;
1901 /* For single-frame VBVs, request that the frame use up the entire VBV. */
1902 double min_fill_factor = rcc->single_frame_vbv ? 1 : 2;
1904 if( bits > rcc->buffer_fill/max_fill_factor )
1905 qf = x264_clip3f( rcc->buffer_fill/(max_fill_factor*bits), 0.2, 1.0 );
1908 if( bits < rcc->buffer_rate/min_fill_factor )
1909 q *= bits*min_fill_factor/rcc->buffer_rate;
1910 q = X264_MAX( q0, q );
1913 /* Apply MinCR restrictions */
1914 double bits = predict_size( &rcc->pred[h->sh.i_type], q, rcc->last_satd );
1915 if( bits > rcc->frame_size_maximum )
1916 q *= bits / rcc->frame_size_maximum;
1917 bits = predict_size( &rcc->pred[h->sh.i_type], q, rcc->last_satd );
1919 /* Check B-frame complexity, and use up any bits that would
1920 * overflow before the next P-frame. */
1921 if( h->sh.i_type == SLICE_TYPE_P && !rcc->single_frame_vbv )
1923 int nb = rcc->bframes;
1924 double pbbits = bits;
1925 double bbits = predict_size( rcc->pred_b_from_p, q * h->param.rc.f_pb_factor, rcc->last_satd );
1927 double bframe_cpb_duration = 0;
1928 double minigop_cpb_duration;
1929 for( int i = 0; i < nb; i++ )
1930 bframe_cpb_duration += h->fenc->f_planned_cpb_duration[1+i];
1932 if( bbits * nb > bframe_cpb_duration * rcc->vbv_max_rate )
1934 pbbits += nb * bbits;
1936 minigop_cpb_duration = bframe_cpb_duration + h->fenc->f_planned_cpb_duration[0];
1937 space = rcc->buffer_fill + minigop_cpb_duration*rcc->vbv_max_rate - rcc->buffer_size;
1938 if( pbbits < space )
1940 q *= X264_MAX( pbbits / space, bits / (0.5 * rcc->buffer_size) );
1942 q = X264_MAX( q0-5, q );
1945 if( !rcc->b_vbv_min_rate )
1946 q = X264_MAX( q0, q );
1951 else if( rcc->b_2pass )
1953 double min2 = log( lmin );
1954 double max2 = log( lmax );
1955 q = (log(q) - min2)/(max2-min2) - 0.5;
1956 q = 1.0/(1.0 + exp( -4*q ));
1957 q = q*(max2-min2) + min2;
1961 return x264_clip3f( q, lmin, lmax );
1964 // update qscale for 1 frame based on actual bits used so far
1965 static float rate_estimate_qscale( x264_t *h )
1968 x264_ratecontrol_t *rcc = h->rc;
1969 ratecontrol_entry_t rce;
1970 int pict_type = h->sh.i_type;
1971 int64_t total_bits = 8*(h->stat.i_frame_size[SLICE_TYPE_I]
1972 + h->stat.i_frame_size[SLICE_TYPE_P]
1973 + h->stat.i_frame_size[SLICE_TYPE_B]);
1978 if( pict_type != rce.pict_type )
1980 x264_log( h, X264_LOG_ERROR, "slice=%c but 2pass stats say %c\n",
1981 slice_type_to_char[pict_type], slice_type_to_char[rce.pict_type] );
1985 if( pict_type == SLICE_TYPE_B )
1987 /* B-frames don't have independent ratecontrol, but rather get the
1988 * average QP of the two adjacent P-frames + an offset */
1990 int i0 = IS_X264_TYPE_I(h->fref0[0]->i_type);
1991 int i1 = IS_X264_TYPE_I(h->fref1[0]->i_type);
1992 int dt0 = abs(h->fenc->i_poc - h->fref0[0]->i_poc);
1993 int dt1 = abs(h->fenc->i_poc - h->fref1[0]->i_poc);
1994 float q0 = h->fref0[0]->f_qp_avg_rc;
1995 float q1 = h->fref1[0]->f_qp_avg_rc;
1997 if( h->fref0[0]->i_type == X264_TYPE_BREF )
1998 q0 -= rcc->pb_offset/2;
1999 if( h->fref1[0]->i_type == X264_TYPE_BREF )
2000 q1 -= rcc->pb_offset/2;
2003 q = (q0 + q1) / 2 + rcc->ip_offset;
2009 q = (q0*dt1 + q1*dt0) / (dt0 + dt1);
2011 if( h->fenc->b_kept_as_ref )
2012 q += rcc->pb_offset/2;
2014 q += rcc->pb_offset;
2016 if( rcc->b_2pass && rcc->b_vbv )
2017 rcc->frame_size_planned = qscale2bits( &rce, q );
2019 rcc->frame_size_planned = predict_size( rcc->pred_b_from_p, q, h->fref1[h->i_ref1-1]->i_satd );
2020 h->rc->frame_size_estimated = rcc->frame_size_planned;
2024 rcc->last_satd = x264_rc_analyse_slice( h );
2026 return qp2qscale( q );
2030 double abr_buffer = 2 * rcc->rate_tolerance * rcc->bitrate;
2034 double lmin = rcc->lmin[pict_type];
2035 double lmax = rcc->lmax[pict_type];
2037 int64_t predicted_bits = total_bits;
2041 if( h->i_thread_frames > 1 )
2043 int j = h->rc - h->thread[0]->rc;
2044 for( int i = 1; i < h->i_thread_frames; i++ )
2046 x264_t *t = h->thread[ (j+i)%h->i_thread_frames ];
2047 double bits = t->rc->frame_size_planned;
2048 if( !t->b_thread_active )
2050 bits = X264_MAX(bits, t->rc->frame_size_estimated);
2051 predicted_bits += (int64_t)bits;
2057 if( h->i_frame < h->i_thread_frames )
2058 predicted_bits += (int64_t)h->i_frame * rcc->bitrate / rcc->fps;
2060 predicted_bits += (int64_t)(h->i_thread_frames - 1) * rcc->bitrate / rcc->fps;
2063 /* Adjust ABR buffer based on distance to the end of the video. */
2064 if( rcc->num_entries > h->i_frame )
2066 double final_bits = rcc->entry[rcc->num_entries-1].expected_bits;
2067 double video_pos = rce.expected_bits / final_bits;
2068 double scale_factor = sqrt( (1 - video_pos) * rcc->num_entries );
2069 abr_buffer *= 0.5 * X264_MAX( scale_factor, 0.5 );
2072 diff = predicted_bits - (int64_t)rce.expected_bits;
2074 q /= x264_clip3f((double)(abr_buffer - diff) / abr_buffer, .5, 2);
2075 if( ((h->i_frame + 1 - h->i_thread_frames) >= rcc->fps) &&
2076 (rcc->expected_bits_sum > 0))
2078 /* Adjust quant based on the difference between
2079 * achieved and expected bitrate so far */
2080 double cur_time = (double)h->i_frame / rcc->num_entries;
2081 double w = x264_clip3f( cur_time*100, 0.0, 1.0 );
2082 q *= pow( (double)total_bits / rcc->expected_bits_sum, w );
2086 /* Do not overflow vbv */
2087 double expected_size = qscale2bits( &rce, q );
2088 double expected_vbv = rcc->buffer_fill + rcc->buffer_rate - expected_size;
2089 double expected_fullness = rce.expected_vbv / rcc->buffer_size;
2090 double qmax = q*(2 - expected_fullness);
2091 double size_constraint = 1 + expected_fullness;
2092 qmax = X264_MAX( qmax, rce.new_qscale );
2093 if( expected_fullness < .05 )
2095 qmax = X264_MIN(qmax, lmax);
2096 while( ((expected_vbv < rce.expected_vbv/size_constraint) && (q < qmax)) ||
2097 ((expected_vbv < 0) && (q < lmax)))
2100 expected_size = qscale2bits(&rce, q);
2101 expected_vbv = rcc->buffer_fill + rcc->buffer_rate - expected_size;
2103 rcc->last_satd = x264_rc_analyse_slice( h );
2105 q = x264_clip3f( q, lmin, lmax );
2107 else /* 1pass ABR */
2109 /* Calculate the quantizer which would have produced the desired
2110 * average bitrate if it had been applied to all frames so far.
2111 * Then modulate that quant based on the current frame's complexity
2112 * relative to the average complexity so far (using the 2pass RCEQ).
2113 * Then bias the quant up or down if total size so far was far from
2115 * Result: Depending on the value of rate_tolerance, there is a
2116 * tradeoff between quality and bitrate precision. But at large
2117 * tolerances, the bit distribution approaches that of 2pass. */
2119 double wanted_bits, overflow = 1;
2121 rcc->last_satd = x264_rc_analyse_slice( h );
2122 rcc->short_term_cplxsum *= 0.5;
2123 rcc->short_term_cplxcount *= 0.5;
2124 rcc->short_term_cplxsum += rcc->last_satd;
2125 rcc->short_term_cplxcount ++;
2127 rce.tex_bits = rcc->last_satd;
2128 rce.blurred_complexity = rcc->short_term_cplxsum / rcc->short_term_cplxcount;
2130 rce.p_count = rcc->nmb;
2134 rce.pict_type = pict_type;
2136 if( h->param.rc.i_rc_method == X264_RC_CRF )
2138 q = get_qscale( h, &rce, rcc->rate_factor_constant, h->fenc->i_frame );
2142 q = get_qscale( h, &rce, rcc->wanted_bits_window / rcc->cplxr_sum, h->fenc->i_frame );
2144 /* ABR code can potentially be counterproductive in CBR, so just don't bother.
2145 * Don't run it if the frame complexity is zero either. */
2146 if( !rcc->b_vbv_min_rate && rcc->last_satd )
2148 // FIXME is it simpler to keep track of wanted_bits in ratecontrol_end?
2149 int i_frame_done = h->i_frame + 1 - h->i_thread_frames;
2150 double time_done = i_frame_done / rcc->fps;
2151 if( h->param.b_vfr_input && i_frame_done > 0 )
2152 time_done = ((double)(h->fenc->i_reordered_pts - h->i_reordered_pts_delay)) * h->param.i_timebase_num / h->param.i_timebase_den;
2153 wanted_bits = time_done * rcc->bitrate;
2154 if( wanted_bits > 0 )
2156 abr_buffer *= X264_MAX( 1, sqrt( time_done ) );
2157 overflow = x264_clip3f( 1.0 + (total_bits - wanted_bits) / abr_buffer, .5, 2 );
2163 if( pict_type == SLICE_TYPE_I && h->param.i_keyint_max > 1
2164 /* should test _next_ pict type, but that isn't decided yet */
2165 && rcc->last_non_b_pict_type != SLICE_TYPE_I )
2167 q = qp2qscale( rcc->accum_p_qp / rcc->accum_p_norm );
2168 q /= fabs( h->param.rc.f_ip_factor );
2170 else if( h->i_frame > 0 )
2172 /* Asymmetric clipping, because symmetric would prevent
2173 * overflow control in areas of rapidly oscillating complexity */
2174 double lmin = rcc->last_qscale_for[pict_type] / rcc->lstep;
2175 double lmax = rcc->last_qscale_for[pict_type] * rcc->lstep;
2176 if( overflow > 1.1 && h->i_frame > 3 )
2178 else if( overflow < 0.9 )
2181 q = x264_clip3f(q, lmin, lmax);
2183 else if( h->param.rc.i_rc_method == X264_RC_CRF && rcc->qcompress != 1 )
2185 q = qp2qscale( ABR_INIT_QP ) / fabs( h->param.rc.f_ip_factor );
2187 rcc->qp_novbv = qscale2qp( q );
2189 //FIXME use get_diff_limited_q() ?
2190 q = clip_qscale( h, pict_type, q );
2193 rcc->last_qscale_for[pict_type] =
2194 rcc->last_qscale = q;
2196 if( !(rcc->b_2pass && !rcc->b_vbv) && h->fenc->i_frame == 0 )
2197 rcc->last_qscale_for[SLICE_TYPE_P] = q * fabs( h->param.rc.f_ip_factor );
2199 if( rcc->b_2pass && rcc->b_vbv )
2200 rcc->frame_size_planned = qscale2bits(&rce, q);
2202 rcc->frame_size_planned = predict_size( &rcc->pred[h->sh.i_type], q, rcc->last_satd );
2204 /* Always use up the whole VBV in this case. */
2205 if( rcc->single_frame_vbv )
2206 rcc->frame_size_planned = rcc->buffer_rate;
2207 h->rc->frame_size_estimated = rcc->frame_size_planned;
2212 void x264_threads_normalize_predictors( x264_t *h )
2214 double totalsize = 0;
2215 for( int i = 0; i < h->param.i_threads; i++ )
2216 totalsize += h->thread[i]->rc->slice_size_planned;
2217 double factor = h->rc->frame_size_planned / totalsize;
2218 for( int i = 0; i < h->param.i_threads; i++ )
2219 h->thread[i]->rc->slice_size_planned *= factor;
2222 void x264_threads_distribute_ratecontrol( x264_t *h )
2225 x264_ratecontrol_t *rc = h->rc;
2227 /* Initialize row predictors */
2228 if( h->i_frame == 0 )
2229 for( int i = 0; i < h->param.i_threads; i++ )
2231 x264_ratecontrol_t *t = h->thread[i]->rc;
2232 memcpy( t->row_preds, rc->row_preds, sizeof(rc->row_preds) );
2235 for( int i = 0; i < h->param.i_threads; i++ )
2237 x264_t *t = h->thread[i];
2238 memcpy( t->rc, rc, offsetof(x264_ratecontrol_t, row_pred) );
2239 t->rc->row_pred = &t->rc->row_preds[h->sh.i_type];
2240 /* Calculate the planned slice size. */
2241 if( rc->b_vbv && rc->frame_size_planned )
2244 for( row = t->i_threadslice_start; row < t->i_threadslice_end; row++ )
2245 size += h->fdec->i_row_satd[row];
2246 t->rc->slice_size_planned = predict_size( &rc->pred[h->sh.i_type + (i+1)*5], rc->qpm, size );
2249 t->rc->slice_size_planned = 0;
2251 if( rc->b_vbv && rc->frame_size_planned )
2253 x264_threads_normalize_predictors( h );
2255 if( rc->single_frame_vbv )
2257 /* Compensate for our max frame error threshold: give more bits (proportionally) to smaller slices. */
2258 for( int i = 0; i < h->param.i_threads; i++ )
2260 x264_t *t = h->thread[i];
2261 t->rc->max_frame_error = X264_MAX( 0.05, 1.0 / (t->i_threadslice_end - t->i_threadslice_start) );
2262 t->rc->slice_size_planned += 2 * t->rc->max_frame_error * rc->frame_size_planned;
2264 x264_threads_normalize_predictors( h );
2267 for( int i = 0; i < h->param.i_threads; i++ )
2268 h->thread[i]->rc->frame_size_estimated = h->thread[i]->rc->slice_size_planned;
2272 void x264_threads_merge_ratecontrol( x264_t *h )
2274 x264_ratecontrol_t *rc = h->rc;
2277 for( int i = 0; i < h->param.i_threads; i++ )
2279 x264_t *t = h->thread[i];
2280 x264_ratecontrol_t *rct = h->thread[i]->rc;
2281 if( h->param.rc.i_vbv_buffer_size )
2284 for( int row = t->i_threadslice_start; row < t->i_threadslice_end; row++ )
2285 size += h->fdec->i_row_satd[row];
2286 int bits = t->stat.frame.i_mv_bits + t->stat.frame.i_tex_bits + t->stat.frame.i_misc_bits;
2287 int mb_count = (t->i_threadslice_end - t->i_threadslice_start) * h->mb.i_mb_width;
2288 update_predictor( &rc->pred[h->sh.i_type+5*i], qp2qscale( rct->qpa_rc/mb_count ), size, bits );
2292 rc->qpa_rc += rct->qpa_rc;
2293 rc->qpa_aq += rct->qpa_aq;
2297 void x264_thread_sync_ratecontrol( x264_t *cur, x264_t *prev, x264_t *next )
2301 #define COPY(var) memcpy(&cur->rc->var, &prev->rc->var, sizeof(cur->rc->var))
2302 /* these vars are updated in x264_ratecontrol_start()
2303 * so copy them from the context that most recently started (prev)
2304 * to the context that's about to start (cur). */
2309 COPY(last_qscale_for);
2310 COPY(last_non_b_pict_type);
2311 COPY(short_term_cplxsum);
2312 COPY(short_term_cplxcount);
2316 /* these vars can be updated by x264_ratecontrol_init_reconfigurable */
2319 COPY(single_frame_vbv);
2321 COPY(b_vbv_min_rate);
2322 COPY(rate_factor_constant);
2328 #define COPY(var) next->rc->var = cur->rc->var
2329 /* these vars are updated in x264_ratecontrol_end()
2330 * so copy them from the context that most recently ended (cur)
2331 * to the context that's about to end (next) */
2333 COPY(expected_bits_sum);
2334 COPY(wanted_bits_window);
2336 COPY(initial_cpb_removal_delay);
2337 COPY(initial_cpb_removal_delay_offset);
2338 COPY(nrt_first_access_unit);
2339 COPY(previous_cpb_final_arrival_time);
2342 //FIXME row_preds[] (not strictly necessary, but would improve prediction)
2343 /* the rest of the variables are either constant or thread-local */
2346 static int find_underflow( x264_t *h, double *fills, int *t0, int *t1, int over )
2348 /* find an interval ending on an overflow or underflow (depending on whether
2349 * we're adding or removing bits), and starting on the earliest frame that
2350 * can influence the buffer fill of that end frame. */
2351 x264_ratecontrol_t *rcc = h->rc;
2352 const double buffer_min = (over ? .1 : .1) * rcc->buffer_size;
2353 const double buffer_max = .9 * rcc->buffer_size;
2354 double fill = fills[*t0-1];
2355 double parity = over ? 1. : -1.;
2356 int start = -1, end = -1;
2357 for( int i = *t0; i < rcc->num_entries; i++ )
2359 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 -
2360 qscale2bits( &rcc->entry[i], rcc->entry[i].new_qscale )) * parity;
2361 fill = x264_clip3f(fill, 0, rcc->buffer_size);
2363 if( fill <= buffer_min || i == 0 )
2369 else if( fill >= buffer_max && start >= 0 )
2374 return start >= 0 && end >= 0;
2377 static int fix_underflow( x264_t *h, int t0, int t1, double adjustment, double qscale_min, double qscale_max)
2379 x264_ratecontrol_t *rcc = h->rc;
2380 double qscale_orig, qscale_new;
2384 for( int i = t0; i <= t1; i++ )
2386 qscale_orig = rcc->entry[i].new_qscale;
2387 qscale_orig = x264_clip3f( qscale_orig, qscale_min, qscale_max );
2388 qscale_new = qscale_orig * adjustment;
2389 qscale_new = x264_clip3f( qscale_new, qscale_min, qscale_max );
2390 rcc->entry[i].new_qscale = qscale_new;
2391 adjusted = adjusted || (qscale_new != qscale_orig);
2396 static double count_expected_bits( x264_t *h )
2398 x264_ratecontrol_t *rcc = h->rc;
2399 double expected_bits = 0;
2400 for( int i = 0; i < rcc->num_entries; i++ )
2402 ratecontrol_entry_t *rce = &rcc->entry[i];
2403 rce->expected_bits = expected_bits;
2404 expected_bits += qscale2bits( rce, rce->new_qscale );
2406 return expected_bits;
2409 static int vbv_pass2( x264_t *h, double all_available_bits )
2411 /* for each interval of buffer_full .. underflow, uniformly increase the qp of all
2412 * frames in the interval until either buffer is full at some intermediate frame or the
2413 * last frame in the interval no longer underflows. Recompute intervals and repeat.
2414 * Then do the converse to put bits back into overflow areas until target size is met */
2416 x264_ratecontrol_t *rcc = h->rc;
2418 double expected_bits = 0;
2420 double prev_bits = 0;
2422 double qscale_min = qp2qscale( h->param.rc.i_qp_min );
2423 double qscale_max = qp2qscale( h->param.rc.i_qp_max );
2425 int adj_min, adj_max;
2426 CHECKED_MALLOC( fills, (rcc->num_entries+1)*sizeof(double) );
2430 /* adjust overall stream size */
2434 prev_bits = expected_bits;
2437 { /* not first iteration */
2438 adjustment = X264_MAX(X264_MIN(expected_bits / all_available_bits, 0.999), 0.9);
2439 fills[-1] = rcc->buffer_size * h->param.rc.f_vbv_buffer_init;
2443 while(adj_min && find_underflow( h, fills, &t0, &t1, 1 ))
2445 adj_min = fix_underflow( h, t0, t1, adjustment, qscale_min, qscale_max );
2450 fills[-1] = rcc->buffer_size * (1. - h->param.rc.f_vbv_buffer_init);
2452 /* fix underflows -- should be done after overflow, as we'd better undersize target than underflowing VBV */
2454 while( adj_max && find_underflow( h, fills, &t0, &t1, 0 ) )
2455 adj_max = fix_underflow( h, t0, t1, 1.001, qscale_min, qscale_max );
2457 expected_bits = count_expected_bits( h );
2458 } while( (expected_bits < .995*all_available_bits) && ((int64_t)(expected_bits+.5) > (int64_t)(prev_bits+.5)) );
2461 x264_log( h, X264_LOG_WARNING, "vbv-maxrate issue, qpmax or vbv-maxrate too low\n");
2463 /* store expected vbv filling values for tracking when encoding */
2464 for( int i = 0; i < rcc->num_entries; i++ )
2465 rcc->entry[i].expected_vbv = rcc->buffer_size - fills[i];
2467 x264_free( fills-1 );
2473 static int init_pass2( x264_t *h )
2475 x264_ratecontrol_t *rcc = h->rc;
2476 uint64_t all_const_bits = 0;
2477 double duration = 0;
2478 for( int i = 0; i < rcc->num_entries; i++ )
2479 duration += rcc->entry[i].i_duration;
2480 duration *= (double)h->sps->vui.i_num_units_in_tick / h->sps->vui.i_time_scale;
2481 uint64_t all_available_bits = h->param.rc.i_bitrate * 1000. * duration;
2482 double rate_factor, step_mult;
2483 double qblur = h->param.rc.f_qblur;
2484 double cplxblur = h->param.rc.f_complexity_blur;
2485 const int filter_size = (int)(qblur*4) | 1;
2486 double expected_bits;
2487 double *qscale, *blurred_qscale;
2489 /* find total/average complexity & const_bits */
2490 for( int i = 0; i < rcc->num_entries; i++ )
2492 ratecontrol_entry_t *rce = &rcc->entry[i];
2493 all_const_bits += rce->misc_bits;
2496 if( all_available_bits < all_const_bits)
2498 x264_log( h, X264_LOG_ERROR, "requested bitrate is too low. estimated minimum is %d kbps\n",
2499 (int)(all_const_bits * rcc->fps / (rcc->num_entries * 1000.)) );
2503 /* Blur complexities, to reduce local fluctuation of QP.
2504 * We don't blur the QPs directly, because then one very simple frame
2505 * could drag down the QP of a nearby complex frame and give it more
2506 * bits than intended. */
2507 for( int i = 0; i < rcc->num_entries; i++ )
2509 ratecontrol_entry_t *rce = &rcc->entry[i];
2510 double weight_sum = 0;
2511 double cplx_sum = 0;
2512 double weight = 1.0;
2513 double gaussian_weight;
2514 /* weighted average of cplx of future frames */
2515 for( int j = 1; j < cplxblur*2 && j < rcc->num_entries-i; j++ )
2517 ratecontrol_entry_t *rcj = &rcc->entry[i+j];
2518 weight *= 1 - pow( (float)rcj->i_count / rcc->nmb, 2 );
2519 if( weight < .0001 )
2521 gaussian_weight = weight * exp( -j*j/200.0 );
2522 weight_sum += gaussian_weight;
2523 cplx_sum += gaussian_weight * (qscale2bits(rcj, 1) - rcj->misc_bits);
2525 /* weighted average of cplx of past frames */
2527 for( int j = 0; j <= cplxblur*2 && j <= i; j++ )
2529 ratecontrol_entry_t *rcj = &rcc->entry[i-j];
2530 gaussian_weight = weight * exp( -j*j/200.0 );
2531 weight_sum += gaussian_weight;
2532 cplx_sum += gaussian_weight * (qscale2bits( rcj, 1 ) - rcj->misc_bits);
2533 weight *= 1 - pow( (float)rcj->i_count / rcc->nmb, 2 );
2534 if( weight < .0001 )
2537 rce->blurred_complexity = cplx_sum / weight_sum;
2540 CHECKED_MALLOC( qscale, sizeof(double)*rcc->num_entries );
2541 if( filter_size > 1 )
2542 CHECKED_MALLOC( blurred_qscale, sizeof(double)*rcc->num_entries );
2544 blurred_qscale = qscale;
2546 /* Search for a factor which, when multiplied by the RCEQ values from
2547 * each frame, adds up to the desired total size.
2548 * There is no exact closed-form solution because of VBV constraints and
2549 * because qscale2bits is not invertible, but we can start with the simple
2550 * approximation of scaling the 1st pass by the ratio of bitrates.
2551 * The search range is probably overkill, but speed doesn't matter here. */
2554 for( int i = 0; i < rcc->num_entries; i++ )
2556 double q = get_qscale(h, &rcc->entry[i], 1.0, i);
2557 expected_bits += qscale2bits(&rcc->entry[i], q);
2558 rcc->last_qscale_for[rcc->entry[i].pict_type] = q;
2560 step_mult = all_available_bits / expected_bits;
2563 for( double step = 1E4 * step_mult; step > 1E-7 * step_mult; step *= 0.5)
2566 rate_factor += step;
2568 rcc->last_non_b_pict_type = -1;
2569 rcc->last_accum_p_norm = 1;
2570 rcc->accum_p_norm = 0;
2573 for( int i = 0; i < rcc->num_entries; i++ )
2575 qscale[i] = get_qscale( h, &rcc->entry[i], rate_factor, i );
2576 rcc->last_qscale_for[rcc->entry[i].pict_type] = qscale[i];
2579 /* fixed I/B qscale relative to P */
2580 for( int i = rcc->num_entries-1; i >= 0; i-- )
2582 qscale[i] = get_diff_limited_q( h, &rcc->entry[i], qscale[i] );
2583 assert(qscale[i] >= 0);
2587 if( filter_size > 1 )
2589 assert( filter_size%2 == 1 );
2590 for( int i = 0; i < rcc->num_entries; i++ )
2592 ratecontrol_entry_t *rce = &rcc->entry[i];
2593 double q = 0.0, sum = 0.0;
2595 for( int j = 0; j < filter_size; j++ )
2597 int idx = i+j-filter_size/2;
2599 double coeff = qblur==0 ? 1.0 : exp( -d*d/(qblur*qblur) );
2600 if( idx < 0 || idx >= rcc->num_entries )
2602 if( rce->pict_type != rcc->entry[idx].pict_type )
2604 q += qscale[idx] * coeff;
2607 blurred_qscale[i] = q/sum;
2611 /* find expected bits */
2612 for( int i = 0; i < rcc->num_entries; i++ )
2614 ratecontrol_entry_t *rce = &rcc->entry[i];
2615 rce->new_qscale = clip_qscale( h, rce->pict_type, blurred_qscale[i] );
2616 assert(rce->new_qscale >= 0);
2617 expected_bits += qscale2bits( rce, rce->new_qscale );
2620 if( expected_bits > all_available_bits )
2621 rate_factor -= step;
2624 x264_free( qscale );
2625 if( filter_size > 1 )
2626 x264_free( blurred_qscale );
2629 if( vbv_pass2( h, all_available_bits ) )
2631 expected_bits = count_expected_bits( h );
2633 if( fabs( expected_bits/all_available_bits - 1.0 ) > 0.01 )
2636 for( int i = 0; i < rcc->num_entries; i++ )
2637 avgq += rcc->entry[i].new_qscale;
2638 avgq = qscale2qp( avgq / rcc->num_entries );
2640 if( expected_bits > all_available_bits || !rcc->b_vbv )
2641 x264_log( h, X264_LOG_WARNING, "Error: 2pass curve failed to converge\n" );
2642 x264_log( h, X264_LOG_WARNING, "target: %.2f kbit/s, expected: %.2f kbit/s, avg QP: %.4f\n",
2643 (float)h->param.rc.i_bitrate,
2644 expected_bits * rcc->fps / (rcc->num_entries * 1000.),
2646 if( expected_bits < all_available_bits && avgq < h->param.rc.i_qp_min + 2 )
2648 if( h->param.rc.i_qp_min > 0 )
2649 x264_log( h, X264_LOG_WARNING, "try reducing target bitrate or reducing qp_min (currently %d)\n", h->param.rc.i_qp_min );
2651 x264_log( h, X264_LOG_WARNING, "try reducing target bitrate\n" );
2653 else if( expected_bits > all_available_bits && avgq > h->param.rc.i_qp_max - 2 )
2655 if( h->param.rc.i_qp_max < 51 )
2656 x264_log( h, X264_LOG_WARNING, "try increasing target bitrate or increasing qp_max (currently %d)\n", h->param.rc.i_qp_max );
2658 x264_log( h, X264_LOG_WARNING, "try increasing target bitrate\n");
2660 else if( !(rcc->b_2pass && rcc->b_vbv) )
2661 x264_log( h, X264_LOG_WARNING, "internal error\n" );