1 /***************************************************-*- coding: iso-8859-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 "common/cpu.h"
33 #include "ratecontrol.h"
45 uint64_t expected_bits; /*total expected bits up to the current frame (current one excluded)*/
52 float blurred_complexity;
55 int16_t i_weight_denom;
58 } ratecontrol_entry_t;
68 struct x264_ratecontrol_t
77 double rate_tolerance;
79 int nmb; /* number of macroblocks in a frame */
83 ratecontrol_entry_t *rce;
84 int qp; /* qp for current frame */
85 int qpm; /* qp for current macroblock */
86 float f_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 double buffer_fill_final; /* real buffer as of the last finished frame */
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 predictor_t *pred; /* predict frame size from satd */
103 double cplxr_sum; /* sum of bits*qscale/rceq */
104 double expected_bits_sum; /* sum of qscale2bits after rceq, ratefactor, and overflow, only includes finished frames */
105 double wanted_bits_window; /* target bitrate * window */
107 double short_term_cplxsum;
108 double short_term_cplxcount;
109 double rate_factor_constant;
114 FILE *p_stat_file_out;
115 char *psz_stat_file_tmpname;
116 FILE *p_mbtree_stat_file_out;
117 char *psz_mbtree_stat_file_tmpname;
118 char *psz_mbtree_stat_file_name;
119 FILE *p_mbtree_stat_file_in;
121 int num_entries; /* number of ratecontrol_entry_ts */
122 ratecontrol_entry_t *entry; /* FIXME: copy needed data and free this once init is done */
124 double last_qscale_for[5]; /* last qscale for a specific pict type, used for max_diff & ipb factor stuff */
125 int last_non_b_pict_type;
126 double accum_p_qp; /* for determining I-frame quant */
128 double last_accum_p_norm;
129 double lmin[5]; /* min qscale by frame type */
131 double lstep; /* max change (multiply) in qscale per frame */
132 uint16_t *qp_buffer[2]; /* Global buffers for converting MB-tree quantizer data. */
133 int qpbuf_pos; /* In order to handle pyramid reordering, QP buffer acts as a stack.
134 * This value is the current position (0 or 1). */
137 double frame_size_estimated;
138 double frame_size_planned;
139 double slice_size_planned;
140 predictor_t (*row_pred)[2];
141 predictor_t row_preds[5][2];
142 predictor_t *pred_b_from_p; /* predict B-frame size from P-frame satd */
143 int bframes; /* # consecutive B-frames before this P-frame */
144 int bframe_bits; /* total cost of those frames */
148 x264_zone_t *prev_zone;
152 static int parse_zones( x264_t *h );
153 static int init_pass2(x264_t *);
154 static float rate_estimate_qscale( x264_t *h );
155 static void update_vbv( x264_t *h, int bits );
156 static void update_vbv_plan( x264_t *h, int overhead );
157 static double predict_size( predictor_t *p, double q, double var );
158 static void update_predictor( predictor_t *p, double q, double var, double bits );
160 #define CMP_OPT_FIRST_PASS( opt, param_val )\
162 if( ( p = strstr( opts, opt "=" ) ) && sscanf( p, opt "=%d" , &i ) && param_val != i )\
164 x264_log( h, X264_LOG_ERROR, "different " opt " setting than first pass (%d vs %d)\n", param_val, i );\
170 * qp = h.264's quantizer
171 * qscale = linearized quantizer = Lagrange multiplier
173 static inline double qp2qscale(double qp)
175 return 0.85 * pow(2.0, ( qp - 12.0 ) / 6.0);
177 static inline double qscale2qp(double qscale)
179 return 12.0 + 6.0 * log(qscale/0.85) / log(2.0);
182 /* Texture bitrate is not quite inversely proportional to qscale,
183 * probably due the the changing number of SKIP blocks.
184 * MV bits level off at about qp<=12, because the lambda used
185 * for motion estimation is constant there. */
186 static inline double qscale2bits(ratecontrol_entry_t *rce, double qscale)
190 return (rce->tex_bits + .1) * pow( rce->qscale / qscale, 1.1 )
191 + rce->mv_bits * pow( X264_MAX(rce->qscale, 1) / X264_MAX(qscale, 1), 0.5 )
195 static ALWAYS_INLINE uint32_t ac_energy_plane( x264_t *h, int mb_x, int mb_y, x264_frame_t *frame, int i )
198 int shift = i ? 6 : 8;
199 int stride = frame->i_stride[i];
200 int offset = h->mb.b_interlaced
201 ? w * (mb_x + (mb_y&~1) * stride) + (mb_y&1) * stride
202 : w * (mb_x + mb_y * stride);
203 int pix = i ? PIXEL_8x8 : PIXEL_16x16;
204 stride <<= h->mb.b_interlaced;
205 uint64_t res = h->pixf.var[pix]( frame->plane[i] + offset, stride );
206 uint32_t sum = (uint32_t)res;
207 uint32_t sqr = res >> 32;
208 return sqr - (sum * sum >> shift);
211 // Find the total AC energy of the block in all planes.
212 static NOINLINE uint32_t ac_energy_mb( x264_t *h, int mb_x, int mb_y, x264_frame_t *frame )
214 /* This function contains annoying hacks because GCC has a habit of reordering emms
215 * and putting it after floating point ops. As a result, we put the emms at the end of the
216 * function and make sure that its always called before the float math. Noinline makes
217 * sure no reordering goes on. */
218 uint32_t var = ac_energy_plane( h, mb_x, mb_y, frame, 0 );
219 var += ac_energy_plane( h, mb_x, mb_y, frame, 1 );
220 var += ac_energy_plane( h, mb_x, mb_y, frame, 2 );
225 void x264_adaptive_quant_frame( x264_t *h, x264_frame_t *frame )
227 /* constants chosen to result in approximately the same overall bitrate as without AQ.
228 * FIXME: while they're written in 5 significant digits, they're only tuned to 2. */
232 /* Need to init it anyways for MB tree. */
233 if( h->param.rc.f_aq_strength == 0 )
236 memset( frame->f_qp_offset, 0, h->mb.i_mb_count * sizeof(float) );
237 memset( frame->f_qp_offset_aq, 0, h->mb.i_mb_count * sizeof(float) );
238 if( h->frames.b_have_lowres )
239 for( mb_xy = 0; mb_xy < h->mb.i_mb_count; mb_xy++ )
240 frame->i_inv_qscale_factor[mb_xy] = 256;
244 if( h->param.rc.i_aq_mode == X264_AQ_AUTOVARIANCE )
246 for( mb_y = 0; mb_y < h->sps->i_mb_height; mb_y++ )
247 for( mb_x = 0; mb_x < h->sps->i_mb_width; mb_x++ )
249 uint32_t energy = ac_energy_mb( h, mb_x, mb_y, frame );
250 float qp_adj = x264_log2( energy + 2 );
252 frame->f_qp_offset[mb_x + mb_y*h->mb.i_mb_stride] = qp_adj;
255 avg_adj /= h->mb.i_mb_count;
256 strength = h->param.rc.f_aq_strength * avg_adj * (1.f / 6000.f);
259 strength = h->param.rc.f_aq_strength * 1.0397f;
261 for( mb_y = 0; mb_y < h->sps->i_mb_height; mb_y++ )
262 for( mb_x = 0; mb_x < h->sps->i_mb_width; mb_x++ )
265 if( h->param.rc.i_aq_mode == X264_AQ_AUTOVARIANCE )
267 qp_adj = frame->f_qp_offset[mb_x + mb_y*h->mb.i_mb_stride];
268 qp_adj = strength * (qp_adj - avg_adj);
272 uint32_t energy = ac_energy_mb( h, mb_x, mb_y, frame );
273 qp_adj = strength * (x264_log2( X264_MAX(energy, 1) ) - 14.427f);
275 frame->f_qp_offset[mb_x + mb_y*h->mb.i_mb_stride] =
276 frame->f_qp_offset_aq[mb_x + mb_y*h->mb.i_mb_stride] = qp_adj;
277 if( h->frames.b_have_lowres )
278 frame->i_inv_qscale_factor[mb_x + mb_y*h->mb.i_mb_stride] = x264_exp2fix8(qp_adj);
283 /*****************************************************************************
284 * x264_adaptive_quant:
285 * adjust macroblock QP based on variance (AC energy) of the MB.
286 * high variance = higher QP
287 * low variance = lower QP
288 * This generally increases SSIM and lowers PSNR.
289 *****************************************************************************/
290 void x264_adaptive_quant( x264_t *h )
293 /* MB-tree currently doesn't adjust quantizers in unreferenced frames. */
294 float qp_offset = h->fdec->b_kept_as_ref ? h->fenc->f_qp_offset[h->mb.i_mb_xy] : h->fenc->f_qp_offset_aq[h->mb.i_mb_xy];
295 h->mb.i_qp = x264_clip3( h->rc->f_qpm + qp_offset + .5, h->param.rc.i_qp_min, h->param.rc.i_qp_max );
298 int x264_macroblock_tree_read( x264_t *h, x264_frame_t *frame )
300 x264_ratecontrol_t *rc = h->rc;
301 uint8_t i_type_actual = rc->entry[frame->i_frame].pict_type;
304 if( rc->entry[frame->i_frame].kept_as_ref )
307 if( rc->qpbuf_pos < 0 )
313 if( !fread( &i_type, 1, 1, rc->p_mbtree_stat_file_in ) )
315 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 )
318 if( i_type != i_type_actual && rc->qpbuf_pos == 1 )
320 x264_log(h, X264_LOG_ERROR, "MB-tree frametype %d doesn't match actual frametype %d.\n", i_type, i_type_actual);
323 } while( i_type != i_type_actual );
326 for( i = 0; i < h->mb.i_mb_count; i++ )
328 frame->f_qp_offset[i] = ((float)(int16_t)endian_fix16( rc->qp_buffer[rc->qpbuf_pos][i] )) * (1/256.0);
329 if( h->frames.b_have_lowres )
330 frame->i_inv_qscale_factor[i] = x264_exp2fix8(frame->f_qp_offset[i]);
335 x264_adaptive_quant_frame( h, frame );
338 x264_log(h, X264_LOG_ERROR, "Incomplete MB-tree stats file.\n");
342 int x264_reference_build_list_optimal( x264_t *h )
344 ratecontrol_entry_t *rce = h->rc->rce;
345 x264_frame_t *frames[16];
346 x264_weight_t weights[16][3];
350 if( rce->refs != h->i_ref0 )
353 memcpy( frames, h->fref0, sizeof(frames) );
354 memcpy( refcount, rce->refcount, sizeof(refcount) );
355 memcpy( weights, h->fenc->weight, sizeof(weights) );
356 memset( &h->fenc->weight[1][0], 0, sizeof(x264_weight_t[15][3]) );
358 /* For now don't reorder ref 0; it seems to lower quality
359 in most cases due to skips. */
360 for( ref = 1; ref < h->i_ref0; ref++ )
365 for( i = 1; i < h->i_ref0; i++ )
366 if( !frames[i]->b_duplicate || frames[i]->i_frame != h->fref0[ref-1]->i_frame )
367 /* Favor lower POC as a tiebreaker. */
368 COPY2_IF_GT( max, refcount[i], bestref, i );
370 /* FIXME: If there are duplicates from frames other than ref0 then it is possible
371 * that the optimal ordering doesnt place every duplicate. */
373 refcount[bestref] = -1;
374 h->fref0[ref] = frames[bestref];
375 memcpy( h->fenc->weight[ref], weights[bestref], sizeof(weights[bestref]) );
381 static char *x264_strcat_filename( char *input, char *suffix )
383 char *output = x264_malloc( strlen( input ) + strlen( suffix ) + 1 );
386 strcpy( output, input );
387 strcat( output, suffix );
391 void x264_ratecontrol_init_reconfigurable( x264_t *h, int b_init )
393 x264_ratecontrol_t *rc = h->rc;
394 if( !b_init && rc->b_2pass )
397 if( h->param.rc.i_vbv_max_bitrate > 0 && h->param.rc.i_vbv_buffer_size > 0 )
399 if( h->param.rc.i_vbv_buffer_size < (int)(h->param.rc.i_vbv_max_bitrate / rc->fps) )
401 h->param.rc.i_vbv_buffer_size = h->param.rc.i_vbv_max_bitrate / rc->fps;
402 x264_log( h, X264_LOG_WARNING, "VBV buffer size cannot be smaller than one frame, using %d kbit\n",
403 h->param.rc.i_vbv_buffer_size );
406 /* We don't support changing the ABR bitrate right now,
407 so if the stream starts as CBR, keep it CBR. */
408 if( rc->b_vbv_min_rate )
409 h->param.rc.i_vbv_max_bitrate = h->param.rc.i_bitrate;
410 rc->buffer_rate = h->param.rc.i_vbv_max_bitrate * 1000. / rc->fps;
411 rc->buffer_size = h->param.rc.i_vbv_buffer_size * 1000.;
412 rc->single_frame_vbv = rc->buffer_rate * 1.1 > rc->buffer_size;
413 rc->cbr_decay = 1.0 - rc->buffer_rate / rc->buffer_size
414 * 0.5 * X264_MAX(0, 1.5 - rc->buffer_rate * rc->fps / rc->bitrate);
417 if( h->param.rc.f_vbv_buffer_init > 1. )
418 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 );
419 h->param.rc.f_vbv_buffer_init = X264_MAX( h->param.rc.f_vbv_buffer_init, rc->buffer_rate / rc->buffer_size );
420 rc->buffer_fill_final = rc->buffer_size * h->param.rc.f_vbv_buffer_init;
422 rc->b_vbv_min_rate = !rc->b_2pass
423 && h->param.rc.i_rc_method == X264_RC_ABR
424 && h->param.rc.i_vbv_max_bitrate <= h->param.rc.i_bitrate;
427 if( h->param.rc.i_rc_method == X264_RC_CRF )
429 /* Arbitrary rescaling to make CRF somewhat similar to QP.
430 * Try to compensate for MB-tree's effects as well. */
431 double base_cplx = h->mb.i_mb_count * (h->param.i_bframe ? 120 : 80);
432 double mbtree_offset = h->param.rc.b_mb_tree ? (1.0-h->param.rc.f_qcompress)*13.5 : 0;
433 rc->rate_factor_constant = pow( base_cplx, 1 - rc->qcompress )
434 / qp2qscale( h->param.rc.f_rf_constant + mbtree_offset );
438 int x264_ratecontrol_new( x264_t *h )
440 x264_ratecontrol_t *rc;
445 CHECKED_MALLOCZERO( h->rc, h->param.i_threads * sizeof(x264_ratecontrol_t) );
448 rc->b_abr = h->param.rc.i_rc_method != X264_RC_CQP && !h->param.rc.b_stat_read;
449 rc->b_2pass = h->param.rc.i_rc_method == X264_RC_ABR && h->param.rc.b_stat_read;
451 /* FIXME: use integers */
452 if(h->param.i_fps_num > 0 && h->param.i_fps_den > 0)
453 rc->fps = (float) h->param.i_fps_num / h->param.i_fps_den;
457 if( h->param.rc.b_mb_tree )
459 h->param.rc.f_pb_factor = 1;
463 rc->qcompress = h->param.rc.f_qcompress;
465 rc->bitrate = h->param.rc.i_bitrate * 1000.;
466 rc->rate_tolerance = h->param.rc.f_rate_tolerance;
467 rc->nmb = h->mb.i_mb_count;
468 rc->last_non_b_pict_type = -1;
471 if( h->param.rc.i_rc_method == X264_RC_CRF && h->param.rc.b_stat_read )
473 x264_log(h, X264_LOG_ERROR, "constant rate-factor is incompatible with 2pass.\n");
477 x264_ratecontrol_init_reconfigurable( h, 1 );
479 if( rc->rate_tolerance < 0.01 )
481 x264_log(h, X264_LOG_WARNING, "bitrate tolerance too small, using .01\n");
482 rc->rate_tolerance = 0.01;
485 h->mb.b_variable_qp = rc->b_vbv || h->param.rc.i_aq_mode;
489 /* FIXME ABR_INIT_QP is actually used only in CRF */
490 #define ABR_INIT_QP ( h->param.rc.i_rc_method == X264_RC_CRF ? h->param.rc.f_rf_constant : 24 )
491 rc->accum_p_norm = .01;
492 rc->accum_p_qp = ABR_INIT_QP * rc->accum_p_norm;
493 /* estimated ratio that produces a reasonable QP for the first I-frame */
494 rc->cplxr_sum = .01 * pow( 7.0e5, rc->qcompress ) * pow( h->mb.i_mb_count, 0.5 );
495 rc->wanted_bits_window = 1.0 * rc->bitrate / rc->fps;
496 rc->last_non_b_pict_type = SLICE_TYPE_I;
499 rc->ip_offset = 6.0 * log(h->param.rc.f_ip_factor) / log(2.0);
500 rc->pb_offset = 6.0 * log(h->param.rc.f_pb_factor) / log(2.0);
501 rc->qp_constant[SLICE_TYPE_P] = h->param.rc.i_qp_constant;
502 rc->qp_constant[SLICE_TYPE_I] = x264_clip3( h->param.rc.i_qp_constant - rc->ip_offset + 0.5, 0, 51 );
503 rc->qp_constant[SLICE_TYPE_B] = x264_clip3( h->param.rc.i_qp_constant + rc->pb_offset + 0.5, 0, 51 );
504 h->mb.ip_offset = rc->ip_offset + 0.5;
506 rc->lstep = pow( 2, h->param.rc.i_qp_step / 6.0 );
507 rc->last_qscale = qp2qscale(26);
508 CHECKED_MALLOC( rc->pred, 5*sizeof(predictor_t) );
509 CHECKED_MALLOC( rc->pred_b_from_p, sizeof(predictor_t) );
510 for( i = 0; i < 5; i++ )
512 rc->last_qscale_for[i] = qp2qscale( ABR_INIT_QP );
513 rc->lmin[i] = qp2qscale( h->param.rc.i_qp_min );
514 rc->lmax[i] = qp2qscale( h->param.rc.i_qp_max );
515 rc->pred[i].coeff= 2.0;
516 rc->pred[i].count= 1.0;
517 rc->pred[i].decay= 0.5;
518 rc->pred[i].offset= 0.0;
519 for( j = 0; j < 2; j++ )
521 rc->row_preds[i][j].coeff= .25;
522 rc->row_preds[i][j].count= 1.0;
523 rc->row_preds[i][j].decay= 0.5;
524 rc->row_preds[i][j].offset= 0.0;
527 *rc->pred_b_from_p = rc->pred[0];
529 if( parse_zones( h ) < 0 )
531 x264_log( h, X264_LOG_ERROR, "failed to parse zones\n" );
535 /* Load stat file and init 2pass algo */
536 if( h->param.rc.b_stat_read )
538 char *p, *stats_in, *stats_buf;
540 /* read 1st pass stats */
541 assert( h->param.rc.psz_stat_in );
542 stats_buf = stats_in = x264_slurp_file( h->param.rc.psz_stat_in );
545 x264_log(h, X264_LOG_ERROR, "ratecontrol_init: can't open stats file\n");
548 if( h->param.rc.b_mb_tree )
550 char *mbtree_stats_in = x264_strcat_filename( h->param.rc.psz_stat_in, ".mbtree" );
551 if( !mbtree_stats_in )
553 rc->p_mbtree_stat_file_in = fopen( mbtree_stats_in, "rb" );
554 x264_free( mbtree_stats_in );
555 if( !rc->p_mbtree_stat_file_in )
557 x264_log(h, X264_LOG_ERROR, "ratecontrol_init: can't open mbtree stats file\n");
562 /* check whether 1st pass options were compatible with current options */
563 if( !strncmp( stats_buf, "#options:", 9 ) )
566 char *opts = stats_buf;
567 stats_in = strchr( stats_buf, '\n' );
572 if( sscanf( opts, "#options: %dx%d", &i, &j ) != 2 )
574 x264_log( h, X264_LOG_ERROR, "resolution specified in stats file not valid\n" );
577 else if( h->param.rc.b_mb_tree && (i != h->param.i_width || j != h->param.i_height) )
579 x264_log( h, X264_LOG_ERROR, "MB-tree doesn't support different resolution than 1st pass (%dx%d vs %dx%d)\n",
580 h->param.i_width, h->param.i_height, i, j );
584 CMP_OPT_FIRST_PASS( "wpredp", X264_MAX( 0, h->param.analyse.i_weighted_pred ) );
585 CMP_OPT_FIRST_PASS( "bframes", h->param.i_bframe );
586 CMP_OPT_FIRST_PASS( "b_pyramid", h->param.i_bframe_pyramid );
587 CMP_OPT_FIRST_PASS( "intra_refresh", h->param.b_intra_refresh );
588 CMP_OPT_FIRST_PASS( "keyint", h->param.i_keyint_max );
590 if( strstr( opts, "qp=0" ) && h->param.rc.i_rc_method == X264_RC_ABR )
591 x264_log( h, X264_LOG_WARNING, "1st pass was lossless, bitrate prediction will be inaccurate\n" );
593 if( !strstr( opts, "direct=3" ) && h->param.analyse.i_direct_mv_pred == X264_DIRECT_PRED_AUTO )
595 x264_log( h, X264_LOG_WARNING, "direct=auto not used on the first pass\n" );
596 h->mb.b_direct_auto_write = 1;
599 if( ( p = strstr( opts, "b_adapt=" ) ) && sscanf( p, "b_adapt=%d", &i ) && i >= X264_B_ADAPT_NONE && i <= X264_B_ADAPT_TRELLIS )
600 h->param.i_bframe_adaptive = i;
601 else if( h->param.i_bframe )
603 x264_log( h, X264_LOG_ERROR, "b_adapt method specified in stats file not valid\n" );
607 if( h->param.rc.b_mb_tree && ( p = strstr( opts, "rc_lookahead=" ) ) && sscanf( p, "rc_lookahead=%d", &i ) )
608 h->param.rc.i_lookahead = i;
611 /* find number of pics */
614 p = strchr(p+1, ';');
617 x264_log(h, X264_LOG_ERROR, "empty stats file\n");
622 if( h->param.i_frame_total < rc->num_entries && h->param.i_frame_total > 0 )
624 x264_log( h, X264_LOG_WARNING, "2nd pass has fewer frames than 1st pass (%d vs %d)\n",
625 h->param.i_frame_total, rc->num_entries );
627 if( h->param.i_frame_total > rc->num_entries )
629 x264_log( h, X264_LOG_ERROR, "2nd pass has more frames than 1st pass (%d vs %d)\n",
630 h->param.i_frame_total, rc->num_entries );
634 CHECKED_MALLOCZERO( rc->entry, rc->num_entries * sizeof(ratecontrol_entry_t) );
636 /* init all to skipped p frames */
637 for(i=0; i<rc->num_entries; i++)
639 ratecontrol_entry_t *rce = &rc->entry[i];
640 rce->pict_type = SLICE_TYPE_P;
641 rce->qscale = rce->new_qscale = qp2qscale(20);
642 rce->misc_bits = rc->nmb + 10;
648 for(i=0; i < rc->num_entries; i++)
650 ratecontrol_entry_t *rce;
658 next= strchr(p, ';');
661 (*next)=0; //sscanf is unbelievably slow on long strings
664 e = sscanf(p, " in:%d ", &frame_number);
666 if(frame_number < 0 || frame_number >= rc->num_entries)
668 x264_log(h, X264_LOG_ERROR, "bad frame number (%d) at stats line %d\n", frame_number, i);
671 rce = &rc->entry[frame_number];
672 rce->direct_mode = 0;
674 e += sscanf(p, " in:%*d out:%*d type:%c q:%f tex:%d mv:%d misc:%d imb:%d pmb:%d smb:%d d:%c",
675 &pict_type, &qp, &rce->tex_bits,
676 &rce->mv_bits, &rce->misc_bits, &rce->i_count, &rce->p_count,
677 &rce->s_count, &rce->direct_mode);
679 p = strstr( p, "ref:" );
683 for( ref = 0; ref < 16; ref++ )
685 if( sscanf( p, " %d", &rce->refcount[ref] ) != 1 )
687 p = strchr( p+1, ' ' );
694 rce->i_weight_denom = -1;
695 char *w = strchr( p, 'w' );
697 if( sscanf( w, "w:%hd,%hd,%hd", &rce->i_weight_denom, &rce->weight[0], &rce->weight[1] ) != 3 )
698 rce->i_weight_denom = -1;
700 if( pict_type != 'b' )
701 rce->kept_as_ref = 1;
705 rce->frame_type = X264_TYPE_IDR;
706 rce->pict_type = SLICE_TYPE_I;
709 rce->frame_type = X264_TYPE_I;
710 rce->pict_type = SLICE_TYPE_I;
713 rce->frame_type = X264_TYPE_P;
714 rce->pict_type = SLICE_TYPE_P;
717 rce->frame_type = X264_TYPE_BREF;
718 rce->pict_type = SLICE_TYPE_B;
721 rce->frame_type = X264_TYPE_B;
722 rce->pict_type = SLICE_TYPE_B;
724 default: e = -1; break;
729 x264_log(h, X264_LOG_ERROR, "statistics are damaged at line %d, parser out=%d\n", i, e);
732 rce->qscale = qp2qscale(qp);
736 x264_free(stats_buf);
738 if(h->param.rc.i_rc_method == X264_RC_ABR)
740 if(init_pass2(h) < 0) return -1;
741 } /* else we're using constant quant, so no need to run the bitrate allocation */
744 /* Open output file */
745 /* If input and output files are the same, output to a temp file
746 * and move it to the real name only when it's complete */
747 if( h->param.rc.b_stat_write )
750 rc->psz_stat_file_tmpname = x264_strcat_filename( h->param.rc.psz_stat_out, ".temp" );
751 if( !rc->psz_stat_file_tmpname )
754 rc->p_stat_file_out = fopen( rc->psz_stat_file_tmpname, "wb" );
755 if( rc->p_stat_file_out == NULL )
757 x264_log(h, X264_LOG_ERROR, "ratecontrol_init: can't open stats file\n");
761 p = x264_param2string( &h->param, 1 );
763 fprintf( rc->p_stat_file_out, "#options: %s\n", p );
765 if( h->param.rc.b_mb_tree && !h->param.rc.b_stat_read )
767 rc->psz_mbtree_stat_file_tmpname = x264_strcat_filename( h->param.rc.psz_stat_out, ".mbtree.temp" );
768 rc->psz_mbtree_stat_file_name = x264_strcat_filename( h->param.rc.psz_stat_out, ".mbtree" );
769 if( !rc->psz_mbtree_stat_file_tmpname || !rc->psz_mbtree_stat_file_name )
772 rc->p_mbtree_stat_file_out = fopen( rc->psz_mbtree_stat_file_tmpname, "wb" );
773 if( rc->p_mbtree_stat_file_out == NULL )
775 x264_log(h, X264_LOG_ERROR, "ratecontrol_init: can't open mbtree stats file\n");
781 if( h->param.rc.b_mb_tree && (h->param.rc.b_stat_read || h->param.rc.b_stat_write) )
783 CHECKED_MALLOC( rc->qp_buffer[0], h->mb.i_mb_count * sizeof(uint16_t) );
784 if( h->param.i_bframe_pyramid && h->param.rc.b_stat_read )
785 CHECKED_MALLOC( rc->qp_buffer[1], h->mb.i_mb_count * sizeof(uint16_t) );
789 for( i=0; i<h->param.i_threads; i++ )
791 h->thread[i]->rc = rc+i;
795 h->thread[i]->param = h->param;
796 h->thread[i]->mb.b_variable_qp = h->mb.b_variable_qp;
805 static int parse_zone( x264_t *h, x264_zone_t *z, char *p )
808 char *tok, UNUSED *saveptr=NULL;
810 z->f_bitrate_factor = 1;
811 if( 3 <= sscanf(p, "%u,%u,q=%u%n", &z->i_start, &z->i_end, &z->i_qp, &len) )
813 else if( 3 <= sscanf(p, "%u,%u,b=%f%n", &z->i_start, &z->i_end, &z->f_bitrate_factor, &len) )
815 else if( 2 <= sscanf(p, "%u,%u%n", &z->i_start, &z->i_end, &len) )
819 x264_log( h, X264_LOG_ERROR, "invalid zone: \"%s\"\n", p );
825 CHECKED_MALLOC( z->param, sizeof(x264_param_t) );
826 memcpy( z->param, &h->param, sizeof(x264_param_t) );
827 z->param->param_free = x264_free;
828 while( (tok = strtok_r( p, ",", &saveptr )) )
830 char *val = strchr( tok, '=' );
836 if( x264_param_parse( z->param, tok, val ) )
838 x264_log( h, X264_LOG_ERROR, "invalid zone param: %s = %s\n", tok, val );
848 static int parse_zones( x264_t *h )
850 x264_ratecontrol_t *rc = h->rc;
852 if( h->param.rc.psz_zones && !h->param.rc.i_zones )
855 CHECKED_MALLOC( psz_zones, strlen( h->param.rc.psz_zones )+1 );
856 strcpy( psz_zones, h->param.rc.psz_zones );
857 h->param.rc.i_zones = 1;
858 for( p = psz_zones; *p; p++ )
859 h->param.rc.i_zones += (*p == '/');
860 CHECKED_MALLOC( h->param.rc.zones, h->param.rc.i_zones * sizeof(x264_zone_t) );
862 for( i = 0; i < h->param.rc.i_zones; i++ )
864 int i_tok = strcspn( p, "/" );
866 if( parse_zone( h, &h->param.rc.zones[i], p ) )
870 x264_free( psz_zones );
873 if( h->param.rc.i_zones > 0 )
875 for( i = 0; i < h->param.rc.i_zones; i++ )
877 x264_zone_t z = h->param.rc.zones[i];
878 if( z.i_start < 0 || z.i_start > z.i_end )
880 x264_log( h, X264_LOG_ERROR, "invalid zone: start=%d end=%d\n",
881 z.i_start, z.i_end );
884 else if( !z.b_force_qp && z.f_bitrate_factor <= 0 )
886 x264_log( h, X264_LOG_ERROR, "invalid zone: bitrate_factor=%f\n",
887 z.f_bitrate_factor );
892 rc->i_zones = h->param.rc.i_zones + 1;
893 CHECKED_MALLOC( rc->zones, rc->i_zones * sizeof(x264_zone_t) );
894 memcpy( rc->zones+1, h->param.rc.zones, (rc->i_zones-1) * sizeof(x264_zone_t) );
896 // default zone to fall back to if none of the others match
897 rc->zones[0].i_start = 0;
898 rc->zones[0].i_end = INT_MAX;
899 rc->zones[0].b_force_qp = 0;
900 rc->zones[0].f_bitrate_factor = 1;
901 CHECKED_MALLOC( rc->zones[0].param, sizeof(x264_param_t) );
902 memcpy( rc->zones[0].param, &h->param, sizeof(x264_param_t) );
903 for( i = 1; i < rc->i_zones; i++ )
905 if( !rc->zones[i].param )
906 rc->zones[i].param = rc->zones[0].param;
915 static x264_zone_t *get_zone( x264_t *h, int frame_num )
918 for( i = h->rc->i_zones-1; i >= 0; i-- )
920 x264_zone_t *z = &h->rc->zones[i];
921 if( frame_num >= z->i_start && frame_num <= z->i_end )
927 void x264_ratecontrol_summary( x264_t *h )
929 x264_ratecontrol_t *rc = h->rc;
930 if( rc->b_abr && h->param.rc.i_rc_method == X264_RC_ABR && rc->cbr_decay > .9999 )
932 double base_cplx = h->mb.i_mb_count * (h->param.i_bframe ? 120 : 80);
933 double mbtree_offset = h->param.rc.b_mb_tree ? (1.0-h->param.rc.f_qcompress)*13.5 : 0;
934 x264_log( h, X264_LOG_INFO, "final ratefactor: %.2f\n",
935 qscale2qp( pow( base_cplx, 1 - rc->qcompress )
936 * rc->cplxr_sum / rc->wanted_bits_window ) - mbtree_offset );
940 void x264_ratecontrol_delete( x264_t *h )
942 x264_ratecontrol_t *rc = h->rc;
946 if( rc->p_stat_file_out )
948 b_regular_file = x264_is_regular_file( rc->p_stat_file_out );
949 fclose( rc->p_stat_file_out );
950 if( h->i_frame >= rc->num_entries && b_regular_file )
951 if( rename( rc->psz_stat_file_tmpname, h->param.rc.psz_stat_out ) != 0 )
953 x264_log( h, X264_LOG_ERROR, "failed to rename \"%s\" to \"%s\"\n",
954 rc->psz_stat_file_tmpname, h->param.rc.psz_stat_out );
956 x264_free( rc->psz_stat_file_tmpname );
958 if( rc->p_mbtree_stat_file_out )
960 b_regular_file = x264_is_regular_file( rc->p_mbtree_stat_file_out );
961 fclose( rc->p_mbtree_stat_file_out );
962 if( h->i_frame >= rc->num_entries && b_regular_file )
963 if( rename( rc->psz_mbtree_stat_file_tmpname, rc->psz_mbtree_stat_file_name ) != 0 )
965 x264_log( h, X264_LOG_ERROR, "failed to rename \"%s\" to \"%s\"\n",
966 rc->psz_mbtree_stat_file_tmpname, rc->psz_mbtree_stat_file_name );
968 x264_free( rc->psz_mbtree_stat_file_tmpname );
969 x264_free( rc->psz_mbtree_stat_file_name );
971 if( rc->p_mbtree_stat_file_in )
972 fclose( rc->p_mbtree_stat_file_in );
973 x264_free( rc->pred );
974 x264_free( rc->pred_b_from_p );
975 x264_free( rc->entry );
976 x264_free( rc->qp_buffer[0] );
977 x264_free( rc->qp_buffer[1] );
980 x264_free( rc->zones[0].param );
981 for( i=1; i<rc->i_zones; i++ )
982 if( rc->zones[i].param != rc->zones[0].param && rc->zones[i].param->param_free )
983 rc->zones[i].param->param_free( rc->zones[i].param );
984 x264_free( rc->zones );
989 void x264_ratecontrol_set_estimated_size( x264_t *h, int bits )
991 x264_pthread_mutex_lock( &h->fenc->mutex );
992 h->rc->frame_size_estimated = bits;
993 x264_pthread_mutex_unlock( &h->fenc->mutex );
996 int x264_ratecontrol_get_estimated_size( x264_t const *h)
999 x264_pthread_mutex_lock( &h->fenc->mutex );
1000 size = h->rc->frame_size_estimated;
1001 x264_pthread_mutex_unlock( &h->fenc->mutex );
1005 static void accum_p_qp_update( x264_t *h, float qp )
1007 x264_ratecontrol_t *rc = h->rc;
1008 rc->accum_p_qp *= .95;
1009 rc->accum_p_norm *= .95;
1010 rc->accum_p_norm += 1;
1011 if( h->sh.i_type == SLICE_TYPE_I )
1012 rc->accum_p_qp += qp + rc->ip_offset;
1014 rc->accum_p_qp += qp;
1017 /* Before encoding a frame, choose a QP for it */
1018 void x264_ratecontrol_start( x264_t *h, int i_force_qp, int overhead )
1020 x264_ratecontrol_t *rc = h->rc;
1021 ratecontrol_entry_t *rce = NULL;
1022 x264_zone_t *zone = get_zone( h, h->fenc->i_frame );
1027 if( zone && (!rc->prev_zone || zone->param != rc->prev_zone->param) )
1028 x264_encoder_reconfig( h, zone->param );
1029 rc->prev_zone = zone;
1031 rc->qp_force = i_force_qp;
1033 if( h->param.rc.b_stat_read )
1035 int frame = h->fenc->i_frame;
1036 assert( frame >= 0 && frame < rc->num_entries );
1037 rce = h->rc->rce = &h->rc->entry[frame];
1039 if( h->sh.i_type == SLICE_TYPE_B
1040 && h->param.analyse.i_direct_mv_pred == X264_DIRECT_PRED_AUTO )
1042 h->sh.b_direct_spatial_mv_pred = ( rce->direct_mode == 's' );
1043 h->mb.b_direct_auto_read = ( rce->direct_mode == 's' || rce->direct_mode == 't' );
1049 memset( h->fdec->i_row_bits, 0, h->sps->i_mb_height * sizeof(int) );
1050 rc->row_pred = &rc->row_preds[h->sh.i_type];
1051 update_vbv_plan( h, overhead );
1054 if( h->sh.i_type != SLICE_TYPE_B )
1055 rc->bframes = h->fenc->i_bframes;
1061 else if( rc->b_abr )
1063 q = qscale2qp( rate_estimate_qscale( h ) );
1065 else if( rc->b_2pass )
1067 rce->new_qscale = rate_estimate_qscale( h );
1068 q = qscale2qp( rce->new_qscale );
1072 if( h->sh.i_type == SLICE_TYPE_B && h->fdec->b_kept_as_ref )
1073 q = ( rc->qp_constant[ SLICE_TYPE_B ] + rc->qp_constant[ SLICE_TYPE_P ] ) / 2;
1075 q = rc->qp_constant[ h->sh.i_type ];
1079 if( zone->b_force_qp )
1080 q += zone->i_qp - rc->qp_constant[SLICE_TYPE_P];
1082 q -= 6*log(zone->f_bitrate_factor)/log(2);
1086 q = x264_clip3f( q, h->param.rc.i_qp_min, h->param.rc.i_qp_max );
1090 h->fdec->f_qp_avg_rc =
1091 h->fdec->f_qp_avg_aq =
1093 rc->qp = x264_clip3( (int)(q + 0.5), 0, 51 );
1096 rce->new_qp = rc->qp;
1098 accum_p_qp_update( h, rc->qp );
1100 if( h->sh.i_type != SLICE_TYPE_B )
1101 rc->last_non_b_pict_type = h->sh.i_type;
1104 static double predict_row_size( x264_t *h, int y, int qp )
1106 /* average between two predictors:
1107 * absolute SATD, and scaled bit cost of the colocated row in the previous frame */
1108 x264_ratecontrol_t *rc = h->rc;
1109 double pred_s = predict_size( rc->row_pred[0], qp2qscale(qp), h->fdec->i_row_satd[y] );
1111 if( h->sh.i_type == SLICE_TYPE_I || qp >= h->fref0[0]->i_row_qp[y] )
1113 if( h->sh.i_type == SLICE_TYPE_P
1114 && h->fref0[0]->i_type == h->fdec->i_type
1115 && h->fref0[0]->i_row_satd[y] > 0
1116 && (abs(h->fref0[0]->i_row_satd[y] - h->fdec->i_row_satd[y]) < h->fdec->i_row_satd[y]/2))
1118 pred_t = h->fref0[0]->i_row_bits[y] * h->fdec->i_row_satd[y] / h->fref0[0]->i_row_satd[y]
1119 * qp2qscale(h->fref0[0]->i_row_qp[y]) / qp2qscale(qp);
1123 return (pred_s + pred_t) / 2;
1125 /* Our QP is lower than the reference! */
1128 double pred_intra = predict_size( rc->row_pred[1], qp2qscale(qp), h->fdec->i_row_satds[0][0][y] );
1129 /* Sum: better to overestimate than underestimate by using only one of the two predictors. */
1130 return pred_intra + pred_s;
1134 static double row_bits_so_far( x264_t *h, int y )
1138 for( i = h->i_threadslice_start; i <= y; i++ )
1139 bits += h->fdec->i_row_bits[i];
1143 static double predict_row_size_sum( x264_t *h, int y, int qp )
1146 double bits = row_bits_so_far(h, y);
1147 for( i = y+1; i < h->i_threadslice_end; i++ )
1148 bits += predict_row_size( h, i, qp );
1153 void x264_ratecontrol_mb( x264_t *h, int bits )
1155 x264_ratecontrol_t *rc = h->rc;
1156 const int y = h->mb.i_mb_y;
1160 h->fdec->i_row_bits[y] += bits;
1161 rc->qpa_rc += rc->f_qpm;
1162 rc->qpa_aq += h->mb.i_qp;
1164 if( h->mb.i_mb_x != h->sps->i_mb_width - 1 || !rc->b_vbv )
1167 h->fdec->i_row_qp[y] = rc->qpm;
1169 update_predictor( rc->row_pred[0], qp2qscale(rc->qpm), h->fdec->i_row_satd[y], h->fdec->i_row_bits[y] );
1170 if( h->sh.i_type == SLICE_TYPE_P && rc->qpm < h->fref0[0]->i_row_qp[y] )
1171 update_predictor( rc->row_pred[1], qp2qscale(rc->qpm), h->fdec->i_row_satds[0][0][y], h->fdec->i_row_bits[y] );
1173 /* tweak quality based on difference from predicted size */
1174 if( y < h->i_threadslice_end-1 )
1176 int prev_row_qp = h->fdec->i_row_qp[y];
1177 int i_qp_max = X264_MIN( prev_row_qp + h->param.rc.i_qp_step, h->param.rc.i_qp_max );
1178 int i_qp_min = X264_MAX( prev_row_qp - h->param.rc.i_qp_step, h->param.rc.i_qp_min );
1180 /* B-frames shouldn't use lower QP than their reference frames. */
1181 if( h->sh.i_type == SLICE_TYPE_B )
1183 i_qp_min = X264_MAX( i_qp_min, X264_MAX( h->fref0[0]->i_row_qp[y+1], h->fref1[0]->i_row_qp[y+1] ) );
1184 rc->qpm = X264_MAX( rc->qpm, i_qp_min );
1187 float buffer_left_planned = rc->buffer_fill - rc->frame_size_planned;
1188 float slice_size_planned = h->param.b_sliced_threads ? rc->slice_size_planned : rc->frame_size_planned;
1189 float size_of_other_slices = rc->frame_size_planned - slice_size_planned;
1190 /* More threads means we have to be more cautious in letting ratecontrol use up extra bits. */
1191 float rc_tol = buffer_left_planned / h->param.i_threads * rc->rate_tolerance;
1192 float max_frame_error = X264_MAX( 0.05, 1.0 / h->sps->i_mb_height );
1193 int b1 = predict_row_size_sum( h, y, rc->qpm );
1195 /* Assume that if this slice has become larger than expected,
1196 * the other slices will have gotten equally larger. */
1197 b1 += X264_MAX( size_of_other_slices * b1 / slice_size_planned, size_of_other_slices );
1199 /* Don't modify the row QPs until a sufficent amount of the bits of the frame have been processed, in case a flat */
1200 /* area at the top of the frame was measured inaccurately. */
1201 if( row_bits_so_far(h,y) < 0.05 * (rc->frame_size_planned-size_of_other_slices) )
1204 if( h->sh.i_type != SLICE_TYPE_I )
1207 if( !rc->b_vbv_min_rate )
1208 i_qp_min = X264_MAX( i_qp_min, h->sh.i_qp );
1210 while( rc->qpm < i_qp_max
1211 && ((b1 > rc->frame_size_planned + rc_tol) ||
1212 (rc->buffer_fill - b1 < buffer_left_planned * 0.5) ||
1213 (b1 > rc->frame_size_planned && rc->qpm < rc->qp_novbv)) )
1216 b1 = predict_row_size_sum( h, y, rc->qpm );
1217 b1 += X264_MAX( size_of_other_slices * b1 / slice_size_planned, size_of_other_slices );
1220 while( rc->qpm > i_qp_min
1221 && (rc->qpm > h->fdec->i_row_qp[0] || rc->single_frame_vbv)
1222 && ((b1 < rc->frame_size_planned * 0.8 && rc->qpm <= prev_row_qp)
1223 || b1 < (rc->buffer_fill - rc->buffer_size + rc->buffer_rate) * 1.1) )
1226 b1 = predict_row_size_sum( h, y, rc->qpm );
1227 b1 += X264_MAX( size_of_other_slices * b1 / slice_size_planned, size_of_other_slices );
1230 /* avoid VBV underflow */
1231 while( (rc->qpm < h->param.rc.i_qp_max)
1232 && (rc->buffer_fill - b1 < rc->buffer_rate * max_frame_error) )
1235 b1 = predict_row_size_sum( h, y, rc->qpm );
1236 b1 += X264_MAX( size_of_other_slices * b1 / slice_size_planned, size_of_other_slices );
1239 x264_ratecontrol_set_estimated_size(h, b1);
1242 /* loses the fractional part of the frame-wise qp */
1243 rc->f_qpm = rc->qpm;
1246 int x264_ratecontrol_qp( x264_t *h )
1251 /* In 2pass, force the same frame types as in the 1st pass */
1252 int x264_ratecontrol_slice_type( x264_t *h, int frame_num )
1254 x264_ratecontrol_t *rc = h->rc;
1255 if( h->param.rc.b_stat_read )
1257 if( frame_num >= rc->num_entries )
1259 /* We could try to initialize everything required for ABR and
1260 * adaptive B-frames, but that would be complicated.
1261 * So just calculate the average QP used so far. */
1264 h->param.rc.i_qp_constant = (h->stat.i_frame_count[SLICE_TYPE_P] == 0) ? 24
1265 : 1 + h->stat.f_frame_qp[SLICE_TYPE_P] / h->stat.i_frame_count[SLICE_TYPE_P];
1266 rc->qp_constant[SLICE_TYPE_P] = x264_clip3( h->param.rc.i_qp_constant, 0, 51 );
1267 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 );
1268 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 );
1270 x264_log(h, X264_LOG_ERROR, "2nd pass has more frames than 1st pass (%d)\n", rc->num_entries);
1271 x264_log(h, X264_LOG_ERROR, "continuing anyway, at constant QP=%d\n", h->param.rc.i_qp_constant);
1272 if( h->param.i_bframe_adaptive )
1273 x264_log(h, X264_LOG_ERROR, "disabling adaptive B-frames\n");
1275 for( i = 0; i < h->param.i_threads; i++ )
1277 h->thread[i]->rc->b_abr = 0;
1278 h->thread[i]->rc->b_2pass = 0;
1279 h->thread[i]->param.rc.i_rc_method = X264_RC_CQP;
1280 h->thread[i]->param.rc.b_stat_read = 0;
1281 h->thread[i]->param.i_bframe_adaptive = 0;
1282 h->thread[i]->param.i_scenecut_threshold = 0;
1283 if( h->thread[i]->param.i_bframe > 1 )
1284 h->thread[i]->param.i_bframe = 1;
1286 return X264_TYPE_AUTO;
1288 return rc->entry[frame_num].frame_type;
1291 return X264_TYPE_AUTO;
1294 void x264_ratecontrol_set_weights( x264_t *h, x264_frame_t *frm )
1296 ratecontrol_entry_t *rce = &h->rc->entry[frm->i_frame];
1297 if( h->param.analyse.i_weighted_pred <= 0 )
1299 if( rce->i_weight_denom >= 0 )
1300 SET_WEIGHT( frm->weight[0][0], 1, rce->weight[0], rce->i_weight_denom, rce->weight[1] );
1303 /* After encoding one frame, save stats and update ratecontrol state */
1304 int x264_ratecontrol_end( x264_t *h, int bits )
1306 x264_ratecontrol_t *rc = h->rc;
1307 const int *mbs = h->stat.frame.i_mb_count;
1312 h->stat.frame.i_mb_count_skip = mbs[P_SKIP] + mbs[B_SKIP];
1313 h->stat.frame.i_mb_count_i = mbs[I_16x16] + mbs[I_8x8] + mbs[I_4x4];
1314 h->stat.frame.i_mb_count_p = mbs[P_L0] + mbs[P_8x8];
1315 for( i = B_DIRECT; i < B_8x8; i++ )
1316 h->stat.frame.i_mb_count_p += mbs[i];
1318 h->fdec->f_qp_avg_rc = rc->qpa_rc /= h->mb.i_mb_count;
1319 h->fdec->f_qp_avg_aq = rc->qpa_aq /= h->mb.i_mb_count;
1321 if( h->param.rc.b_stat_write )
1323 char c_type = h->sh.i_type==SLICE_TYPE_I ? (h->fenc->i_poc==0 ? 'I' : 'i')
1324 : h->sh.i_type==SLICE_TYPE_P ? 'P'
1325 : h->fenc->b_kept_as_ref ? 'B' : 'b';
1326 int dir_frame = h->stat.frame.i_direct_score[1] - h->stat.frame.i_direct_score[0];
1327 int dir_avg = h->stat.i_direct_score[1] - h->stat.i_direct_score[0];
1328 char c_direct = h->mb.b_direct_auto_write ?
1329 ( dir_frame>0 ? 's' : dir_frame<0 ? 't' :
1330 dir_avg>0 ? 's' : dir_avg<0 ? 't' : '-' )
1332 if( fprintf( rc->p_stat_file_out,
1333 "in:%d out:%d type:%c q:%.2f tex:%d mv:%d misc:%d imb:%d pmb:%d smb:%d d:%c ref:",
1334 h->fenc->i_frame, h->i_frame,
1336 h->stat.frame.i_tex_bits,
1337 h->stat.frame.i_mv_bits,
1338 h->stat.frame.i_misc_bits,
1339 h->stat.frame.i_mb_count_i,
1340 h->stat.frame.i_mb_count_p,
1341 h->stat.frame.i_mb_count_skip,
1345 /* Only write information for reference reordering once. */
1346 int use_old_stats = h->param.rc.b_stat_read && rc->rce->refs > 1;
1347 for( i = 0; i < (use_old_stats ? rc->rce->refs : h->i_ref0); i++ )
1349 int refcount = use_old_stats ? rc->rce->refcount[i]
1350 : h->param.b_interlaced ? h->stat.frame.i_mb_count_ref[0][i*2]
1351 + h->stat.frame.i_mb_count_ref[0][i*2+1]
1352 : h->stat.frame.i_mb_count_ref[0][i];
1353 if( fprintf( rc->p_stat_file_out, "%d ", refcount ) < 0 )
1357 if( h->sh.weight[0][0].weightfn )
1359 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 )
1363 if( fprintf( rc->p_stat_file_out, ";\n") < 0 )
1366 /* Don't re-write the data in multi-pass mode. */
1367 if( h->param.rc.b_mb_tree && h->fenc->b_kept_as_ref && !h->param.rc.b_stat_read )
1369 uint8_t i_type = h->sh.i_type;
1371 /* Values are stored as big-endian FIX8.8 */
1372 for( i = 0; i < h->mb.i_mb_count; i++ )
1373 rc->qp_buffer[0][i] = endian_fix16( h->fenc->f_qp_offset[i]*256.0 );
1374 if( fwrite( &i_type, 1, 1, rc->p_mbtree_stat_file_out ) < 1 )
1376 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 )
1383 if( h->sh.i_type != SLICE_TYPE_B )
1384 rc->cplxr_sum += bits * qp2qscale(rc->qpa_rc) / rc->last_rceq;
1387 /* Depends on the fact that B-frame's QP is an offset from the following P-frame's.
1388 * Not perfectly accurate with B-refs, but good enough. */
1389 rc->cplxr_sum += bits * qp2qscale(rc->qpa_rc) / (rc->last_rceq * fabs(h->param.rc.f_pb_factor));
1391 rc->cplxr_sum *= rc->cbr_decay;
1392 rc->wanted_bits_window += rc->bitrate / rc->fps;
1393 rc->wanted_bits_window *= rc->cbr_decay;
1398 rc->expected_bits_sum += qscale2bits( rc->rce, qp2qscale(rc->rce->new_qp) );
1401 if( h->mb.b_variable_qp )
1403 if( h->sh.i_type == SLICE_TYPE_B )
1405 rc->bframe_bits += bits;
1406 if( h->fenc->b_last_minigop_bframe )
1408 update_predictor( rc->pred_b_from_p, qp2qscale(rc->qpa_rc),
1409 h->fref1[h->i_ref1-1]->i_satd, rc->bframe_bits / rc->bframes );
1410 rc->bframe_bits = 0;
1415 update_vbv( h, bits );
1418 x264_log(h, X264_LOG_ERROR, "ratecontrol_end: stats file could not be written to\n");
1422 /****************************************************************************
1424 ***************************************************************************/
1427 * modify the bitrate curve from pass1 for one frame
1429 static double get_qscale(x264_t *h, ratecontrol_entry_t *rce, double rate_factor, int frame_num)
1431 x264_ratecontrol_t *rcc= h->rc;
1433 x264_zone_t *zone = get_zone( h, frame_num );
1435 q = pow( rce->blurred_complexity, 1 - rcc->qcompress );
1437 // avoid NaN's in the rc_eq
1438 if(!isfinite(q) || rce->tex_bits + rce->mv_bits == 0)
1439 q = rcc->last_qscale_for[rce->pict_type];
1444 rcc->last_qscale = q;
1449 if( zone->b_force_qp )
1450 q = qp2qscale(zone->i_qp);
1452 q /= zone->f_bitrate_factor;
1458 static double get_diff_limited_q(x264_t *h, ratecontrol_entry_t *rce, double q)
1460 x264_ratecontrol_t *rcc = h->rc;
1461 const int pict_type = rce->pict_type;
1463 // force I/B quants as a function of P quants
1464 const double last_p_q = rcc->last_qscale_for[SLICE_TYPE_P];
1465 const double last_non_b_q= rcc->last_qscale_for[rcc->last_non_b_pict_type];
1466 if( pict_type == SLICE_TYPE_I )
1469 double pq = qp2qscale( rcc->accum_p_qp / rcc->accum_p_norm );
1470 double ip_factor = fabs( h->param.rc.f_ip_factor );
1471 /* don't apply ip_factor if the following frame is also I */
1472 if( rcc->accum_p_norm <= 0 )
1474 else if( h->param.rc.f_ip_factor < 0 )
1476 else if( rcc->accum_p_norm >= 1 )
1479 q = rcc->accum_p_norm * pq / ip_factor + (1 - rcc->accum_p_norm) * iq;
1481 else if( pict_type == SLICE_TYPE_B )
1483 if( h->param.rc.f_pb_factor > 0 )
1485 if( !rce->kept_as_ref )
1486 q *= fabs( h->param.rc.f_pb_factor );
1488 else if( pict_type == SLICE_TYPE_P
1489 && rcc->last_non_b_pict_type == SLICE_TYPE_P
1490 && rce->tex_bits == 0 )
1495 /* last qscale / qdiff stuff */
1496 if(rcc->last_non_b_pict_type==pict_type
1497 && (pict_type!=SLICE_TYPE_I || rcc->last_accum_p_norm < 1))
1499 double last_q = rcc->last_qscale_for[pict_type];
1500 double max_qscale = last_q * rcc->lstep;
1501 double min_qscale = last_q / rcc->lstep;
1503 if (q > max_qscale) q = max_qscale;
1504 else if(q < min_qscale) q = min_qscale;
1507 rcc->last_qscale_for[pict_type] = q;
1508 if(pict_type!=SLICE_TYPE_B)
1509 rcc->last_non_b_pict_type = pict_type;
1510 if(pict_type==SLICE_TYPE_I)
1512 rcc->last_accum_p_norm = rcc->accum_p_norm;
1513 rcc->accum_p_norm = 0;
1514 rcc->accum_p_qp = 0;
1516 if(pict_type==SLICE_TYPE_P)
1518 float mask = 1 - pow( (float)rce->i_count / rcc->nmb, 2 );
1519 rcc->accum_p_qp = mask * (qscale2qp(q) + rcc->accum_p_qp);
1520 rcc->accum_p_norm = mask * (1 + rcc->accum_p_norm);
1525 static double predict_size( predictor_t *p, double q, double var )
1527 return (p->coeff*var + p->offset) / (q*p->count);
1530 static void update_predictor( predictor_t *p, double q, double var, double bits )
1532 const double range = 1.5;
1535 double old_coeff = p->coeff / p->count;
1536 double new_coeff = bits*q / var;
1537 double new_coeff_clipped = x264_clip3f( new_coeff, old_coeff/range, old_coeff*range );
1538 double new_offset = bits*q - new_coeff_clipped * var;
1539 if( new_offset >= 0 )
1540 new_coeff = new_coeff_clipped;
1543 p->count *= p->decay;
1544 p->coeff *= p->decay;
1545 p->offset *= p->decay;
1547 p->coeff += new_coeff;
1548 p->offset += new_offset;
1551 // update VBV after encoding a frame
1552 static void update_vbv( x264_t *h, int bits )
1554 x264_ratecontrol_t *rcc = h->rc;
1555 x264_ratecontrol_t *rct = h->thread[0]->rc;
1557 if( rcc->last_satd >= h->mb.i_mb_count )
1558 update_predictor( &rct->pred[h->sh.i_type], qp2qscale(rcc->qpa_rc), rcc->last_satd, bits );
1563 rct->buffer_fill_final -= bits;
1564 if( rct->buffer_fill_final < 0 )
1565 x264_log( h, X264_LOG_WARNING, "VBV underflow (frame %d, %.0f bits)\n", h->i_frame, rct->buffer_fill_final );
1566 rct->buffer_fill_final = X264_MAX( rct->buffer_fill_final, 0 );
1567 rct->buffer_fill_final += rcc->buffer_rate;
1568 rct->buffer_fill_final = X264_MIN( rct->buffer_fill_final, rcc->buffer_size );
1571 // provisionally update VBV according to the planned size of all frames currently in progress
1572 static void update_vbv_plan( x264_t *h, int overhead )
1574 x264_ratecontrol_t *rcc = h->rc;
1575 rcc->buffer_fill = h->thread[0]->rc->buffer_fill_final;
1576 if( h->i_thread_frames > 1 )
1578 int j = h->rc - h->thread[0]->rc;
1580 for( i=1; i<h->i_thread_frames; i++ )
1582 x264_t *t = h->thread[ (j+i)%h->i_thread_frames ];
1583 double bits = t->rc->frame_size_planned;
1584 if( !t->b_thread_active )
1586 bits = X264_MAX(bits, x264_ratecontrol_get_estimated_size(t));
1587 rcc->buffer_fill -= bits;
1588 rcc->buffer_fill = X264_MAX( rcc->buffer_fill, 0 );
1589 rcc->buffer_fill += rcc->buffer_rate;
1590 rcc->buffer_fill = X264_MIN( rcc->buffer_fill, rcc->buffer_size );
1593 rcc->buffer_fill = X264_MIN( rcc->buffer_fill, rcc->buffer_size );
1594 rcc->buffer_fill -= overhead;
1597 // apply VBV constraints and clip qscale to between lmin and lmax
1598 static double clip_qscale( x264_t *h, int pict_type, double q )
1600 x264_ratecontrol_t *rcc = h->rc;
1601 double lmin = rcc->lmin[pict_type];
1602 double lmax = rcc->lmax[pict_type];
1605 /* B-frames are not directly subject to VBV,
1606 * since they are controlled by the P-frames' QPs. */
1608 if( rcc->b_vbv && rcc->last_satd > 0 )
1610 /* Lookahead VBV: raise the quantizer as necessary such that no frames in
1611 * the lookahead overflow and such that the buffer is in a reasonable state
1612 * by the end of the lookahead. */
1613 if( h->param.rc.i_lookahead )
1615 int j, iterations, terminate = 0;
1617 /* Avoid an infinite loop. */
1618 for( iterations = 0; iterations < 1000 && terminate != 3; iterations++ )
1621 double cur_bits = predict_size( &rcc->pred[h->sh.i_type], q, rcc->last_satd );
1622 double buffer_fill_cur = rcc->buffer_fill - cur_bits;
1624 frame_q[0] = h->sh.i_type == SLICE_TYPE_I ? q * h->param.rc.f_ip_factor : q;
1625 frame_q[1] = frame_q[0] * h->param.rc.f_pb_factor;
1626 frame_q[2] = frame_q[0] / h->param.rc.f_ip_factor;
1628 /* Loop over the planned future frames. */
1629 for( j = 0; buffer_fill_cur >= 0 && buffer_fill_cur <= rcc->buffer_size; j++ )
1631 buffer_fill_cur += rcc->buffer_rate;
1632 int i_type = h->fenc->i_planned_type[j];
1633 int i_satd = h->fenc->i_planned_satd[j];
1634 if( i_type == X264_TYPE_AUTO )
1636 i_type = IS_X264_TYPE_I( i_type ) ? SLICE_TYPE_I : IS_X264_TYPE_B( i_type ) ? SLICE_TYPE_B : SLICE_TYPE_P;
1637 cur_bits = predict_size( &rcc->pred[i_type], frame_q[i_type], i_satd );
1638 buffer_fill_cur -= cur_bits;
1640 /* Try to get to get the buffer at least 50% filled, but don't set an impossible goal. */
1641 target_fill = X264_MIN( rcc->buffer_fill + j * rcc->buffer_rate * 0.5, rcc->buffer_size * 0.5 );
1642 if( buffer_fill_cur < target_fill )
1648 /* Try to get the buffer no more than 80% filled, but don't set an impossible goal. */
1649 target_fill = x264_clip3f( rcc->buffer_fill - j * rcc->buffer_rate * 0.5, rcc->buffer_size * 0.8, rcc->buffer_size );
1650 if( rcc->b_vbv_min_rate && buffer_fill_cur > target_fill )
1659 /* Fallback to old purely-reactive algorithm: no lookahead. */
1662 if( ( pict_type == SLICE_TYPE_P ||
1663 ( pict_type == SLICE_TYPE_I && rcc->last_non_b_pict_type == SLICE_TYPE_I ) ) &&
1664 rcc->buffer_fill/rcc->buffer_size < 0.5 )
1666 q /= x264_clip3f( 2.0*rcc->buffer_fill/rcc->buffer_size, 0.5, 1.0 );
1669 /* Now a hard threshold to make sure the frame fits in VBV.
1670 * This one is mostly for I-frames. */
1671 double bits = predict_size( &rcc->pred[h->sh.i_type], q, rcc->last_satd );
1673 /* For small VBVs, allow the frame to use up the entire VBV. */
1674 double max_fill_factor = h->param.rc.i_vbv_buffer_size >= 5*h->param.rc.i_vbv_max_bitrate / rcc->fps ? 2 : 1;
1675 /* For single-frame VBVs, request that the frame use up the entire VBV. */
1676 double min_fill_factor = rcc->single_frame_vbv ? 1 : 2;
1678 if( bits > rcc->buffer_fill/max_fill_factor )
1679 qf = x264_clip3f( rcc->buffer_fill/(max_fill_factor*bits), 0.2, 1.0 );
1682 if( bits < rcc->buffer_rate/min_fill_factor )
1683 q *= bits*min_fill_factor/rcc->buffer_rate;
1684 q = X264_MAX( q0, q );
1687 /* Check B-frame complexity, and use up any bits that would
1688 * overflow before the next P-frame. */
1689 if( h->sh.i_type == SLICE_TYPE_P && !rcc->single_frame_vbv )
1691 int nb = rcc->bframes;
1692 double bits = predict_size( &rcc->pred[h->sh.i_type], q, rcc->last_satd );
1693 double pbbits = bits;
1694 double bbits = predict_size( rcc->pred_b_from_p, q * h->param.rc.f_pb_factor, rcc->last_satd );
1696 if( bbits > rcc->buffer_rate )
1698 pbbits += nb * bbits;
1700 space = rcc->buffer_fill + (1+nb)*rcc->buffer_rate - rcc->buffer_size;
1701 if( pbbits < space )
1703 q *= X264_MAX( pbbits / space, bits / (0.5 * rcc->buffer_size) );
1705 q = X264_MAX( q0-5, q );
1708 if( !rcc->b_vbv_min_rate )
1709 q = X264_MAX( q0, q );
1714 else if(rcc->b_2pass)
1716 double min2 = log(lmin);
1717 double max2 = log(lmax);
1718 q = (log(q) - min2)/(max2-min2) - 0.5;
1719 q = 1.0/(1.0 + exp(-4*q));
1720 q = q*(max2-min2) + min2;
1724 return x264_clip3f(q, lmin, lmax);
1727 // update qscale for 1 frame based on actual bits used so far
1728 static float rate_estimate_qscale( x264_t *h )
1731 x264_ratecontrol_t *rcc = h->rc;
1732 ratecontrol_entry_t rce;
1733 int pict_type = h->sh.i_type;
1734 double lmin = rcc->lmin[pict_type];
1735 double lmax = rcc->lmax[pict_type];
1736 int64_t total_bits = 8*(h->stat.i_frame_size[SLICE_TYPE_I]
1737 + h->stat.i_frame_size[SLICE_TYPE_P]
1738 + h->stat.i_frame_size[SLICE_TYPE_B]);
1743 if(pict_type != rce.pict_type)
1745 x264_log(h, X264_LOG_ERROR, "slice=%c but 2pass stats say %c\n",
1746 slice_type_to_char[pict_type], slice_type_to_char[rce.pict_type]);
1750 if( pict_type == SLICE_TYPE_B )
1752 /* B-frames don't have independent ratecontrol, but rather get the
1753 * average QP of the two adjacent P-frames + an offset */
1755 int i0 = IS_X264_TYPE_I(h->fref0[0]->i_type);
1756 int i1 = IS_X264_TYPE_I(h->fref1[0]->i_type);
1757 int dt0 = abs(h->fenc->i_poc - h->fref0[0]->i_poc);
1758 int dt1 = abs(h->fenc->i_poc - h->fref1[0]->i_poc);
1759 float q0 = h->fref0[0]->f_qp_avg_rc;
1760 float q1 = h->fref1[0]->f_qp_avg_rc;
1762 if( h->fref0[0]->i_type == X264_TYPE_BREF )
1763 q0 -= rcc->pb_offset/2;
1764 if( h->fref1[0]->i_type == X264_TYPE_BREF )
1765 q1 -= rcc->pb_offset/2;
1768 q = (q0 + q1) / 2 + rcc->ip_offset;
1774 q = (q0*dt1 + q1*dt0) / (dt0 + dt1);
1776 if(h->fenc->b_kept_as_ref)
1777 q += rcc->pb_offset/2;
1779 q += rcc->pb_offset;
1781 if( rcc->b_2pass && rcc->b_vbv )
1782 rcc->frame_size_planned = qscale2bits( &rce, q );
1784 rcc->frame_size_planned = predict_size( rcc->pred_b_from_p, q, h->fref1[h->i_ref1-1]->i_satd );
1785 x264_ratecontrol_set_estimated_size(h, rcc->frame_size_planned);
1789 rcc->last_satd = x264_rc_analyse_slice( h );
1790 return qp2qscale(q);
1794 double abr_buffer = 2 * rcc->rate_tolerance * rcc->bitrate * h->i_thread_frames;
1798 //FIXME adjust abr_buffer based on distance to the end of the video
1800 int64_t predicted_bits = total_bits;
1804 if( h->i_thread_frames > 1 )
1806 int j = h->rc - h->thread[0]->rc;
1808 for( i=1; i<h->i_thread_frames; i++ )
1810 x264_t *t = h->thread[ (j+i)%h->i_thread_frames ];
1811 double bits = t->rc->frame_size_planned;
1812 if( !t->b_thread_active )
1814 bits = X264_MAX(bits, x264_ratecontrol_get_estimated_size(t));
1815 predicted_bits += (int64_t)bits;
1821 if( h->fenc->i_frame < h->i_thread_frames )
1822 predicted_bits += (int64_t)h->fenc->i_frame * rcc->bitrate / rcc->fps;
1824 predicted_bits += (int64_t)(h->i_thread_frames - 1) * rcc->bitrate / rcc->fps;
1827 diff = predicted_bits - (int64_t)rce.expected_bits;
1829 q /= x264_clip3f((double)(abr_buffer - diff) / abr_buffer, .5, 2);
1830 if( ((h->fenc->i_frame + 1 - h->i_thread_frames) >= rcc->fps) &&
1831 (rcc->expected_bits_sum > 0))
1833 /* Adjust quant based on the difference between
1834 * achieved and expected bitrate so far */
1835 double time = (double)h->fenc->i_frame / rcc->num_entries;
1836 double w = x264_clip3f( time*100, 0.0, 1.0 );
1837 q *= pow( (double)total_bits / rcc->expected_bits_sum, w );
1841 /* Do not overflow vbv */
1842 double expected_size = qscale2bits(&rce, q);
1843 double expected_vbv = rcc->buffer_fill + rcc->buffer_rate - expected_size;
1844 double expected_fullness = rce.expected_vbv / rcc->buffer_size;
1845 double qmax = q*(2 - expected_fullness);
1846 double size_constraint = 1 + expected_fullness;
1847 qmax = X264_MAX(qmax, rce.new_qscale);
1848 if (expected_fullness < .05)
1850 qmax = X264_MIN(qmax, lmax);
1851 while( ((expected_vbv < rce.expected_vbv/size_constraint) && (q < qmax)) ||
1852 ((expected_vbv < 0) && (q < lmax)))
1855 expected_size = qscale2bits(&rce, q);
1856 expected_vbv = rcc->buffer_fill + rcc->buffer_rate - expected_size;
1858 rcc->last_satd = x264_rc_analyse_slice( h );
1860 q = x264_clip3f( q, lmin, lmax );
1862 else /* 1pass ABR */
1864 /* Calculate the quantizer which would have produced the desired
1865 * average bitrate if it had been applied to all frames so far.
1866 * Then modulate that quant based on the current frame's complexity
1867 * relative to the average complexity so far (using the 2pass RCEQ).
1868 * Then bias the quant up or down if total size so far was far from
1870 * Result: Depending on the value of rate_tolerance, there is a
1871 * tradeoff between quality and bitrate precision. But at large
1872 * tolerances, the bit distribution approaches that of 2pass. */
1874 double wanted_bits, overflow=1, lmin, lmax;
1876 rcc->last_satd = x264_rc_analyse_slice( h );
1877 rcc->short_term_cplxsum *= 0.5;
1878 rcc->short_term_cplxcount *= 0.5;
1879 rcc->short_term_cplxsum += rcc->last_satd;
1880 rcc->short_term_cplxcount ++;
1882 rce.tex_bits = rcc->last_satd;
1883 rce.blurred_complexity = rcc->short_term_cplxsum / rcc->short_term_cplxcount;
1885 rce.p_count = rcc->nmb;
1889 rce.pict_type = pict_type;
1891 if( h->param.rc.i_rc_method == X264_RC_CRF )
1893 q = get_qscale( h, &rce, rcc->rate_factor_constant, h->fenc->i_frame );
1897 int i_frame_done = h->fenc->i_frame + 1 - h->i_thread_frames;
1899 q = get_qscale( h, &rce, rcc->wanted_bits_window / rcc->cplxr_sum, h->fenc->i_frame );
1901 // FIXME is it simpler to keep track of wanted_bits in ratecontrol_end?
1902 wanted_bits = i_frame_done * rcc->bitrate / rcc->fps;
1903 if( wanted_bits > 0 )
1905 abr_buffer *= X264_MAX( 1, sqrt(i_frame_done/25) );
1906 overflow = x264_clip3f( 1.0 + (total_bits - wanted_bits) / abr_buffer, .5, 2 );
1911 if( pict_type == SLICE_TYPE_I && h->param.i_keyint_max > 1
1912 /* should test _next_ pict type, but that isn't decided yet */
1913 && rcc->last_non_b_pict_type != SLICE_TYPE_I )
1915 q = qp2qscale( rcc->accum_p_qp / rcc->accum_p_norm );
1916 q /= fabs( h->param.rc.f_ip_factor );
1918 else if( h->i_frame > 0 )
1920 /* Asymmetric clipping, because symmetric would prevent
1921 * overflow control in areas of rapidly oscillating complexity */
1922 lmin = rcc->last_qscale_for[pict_type] / rcc->lstep;
1923 lmax = rcc->last_qscale_for[pict_type] * rcc->lstep;
1924 if( overflow > 1.1 && h->i_frame > 3 )
1926 else if( overflow < 0.9 )
1929 q = x264_clip3f(q, lmin, lmax);
1931 else if( h->param.rc.i_rc_method == X264_RC_CRF && rcc->qcompress != 1 )
1933 q = qp2qscale( ABR_INIT_QP ) / fabs( h->param.rc.f_ip_factor );
1935 rcc->qp_novbv = qscale2qp(q);
1937 //FIXME use get_diff_limited_q() ?
1938 q = clip_qscale( h, pict_type, q );
1941 rcc->last_qscale_for[pict_type] =
1942 rcc->last_qscale = q;
1944 if( !(rcc->b_2pass && !rcc->b_vbv) && h->fenc->i_frame == 0 )
1945 rcc->last_qscale_for[SLICE_TYPE_P] = q * fabs( h->param.rc.f_ip_factor );
1947 if( rcc->b_2pass && rcc->b_vbv )
1948 rcc->frame_size_planned = qscale2bits(&rce, q);
1950 rcc->frame_size_planned = predict_size( &rcc->pred[h->sh.i_type], q, rcc->last_satd );
1952 /* Always use up the whole VBV in this case. */
1953 if( rcc->single_frame_vbv )
1954 rcc->frame_size_planned = rcc->buffer_rate;
1955 x264_ratecontrol_set_estimated_size(h, rcc->frame_size_planned);
1960 void x264_threads_distribute_ratecontrol( x264_t *h )
1962 int i, row, totalsize = 0;
1964 for( row = 0; row < h->sps->i_mb_height; row++ )
1965 totalsize += h->fdec->i_row_satd[row];
1966 for( i = 0; i < h->param.i_threads; i++ )
1968 x264_t *t = h->thread[i];
1969 x264_ratecontrol_t *rc = h->rc;
1970 memcpy( t->rc, rc, sizeof(x264_ratecontrol_t) );
1971 /* Calculate the planned slice size. */
1972 if( h->rc->b_vbv && rc->frame_size_planned )
1975 for( row = t->i_threadslice_start; row < t->i_threadslice_end; row++ )
1976 size += h->fdec->i_row_satd[row];
1977 t->rc->slice_size_planned = size * rc->frame_size_planned / totalsize;
1980 t->rc->slice_size_planned = 0;
1984 void x264_threads_merge_ratecontrol( x264_t *h )
1987 x264_ratecontrol_t *rc = h->rc;
1990 for( i = 1; i < h->param.i_threads; i++ )
1992 x264_ratecontrol_t *t = h->thread[i]->rc;
1993 rc->qpa_rc += t->qpa_rc;
1994 rc->qpa_aq += t->qpa_aq;
1995 for( j = 0; j < 5; j++ )
1996 for( k = 0; k < 2; k++ )
1998 rc->row_preds[j][k].coeff += t->row_preds[j][k].coeff;
1999 rc->row_preds[j][k].offset += t->row_preds[j][k].offset;
2000 rc->row_preds[j][k].count += t->row_preds[j][k].count;
2003 for( j = 0; j < 5; j++ )
2004 for( k = 0; k < 2; k++ )
2006 rc->row_preds[j][k].coeff /= h->param.i_threads;
2007 rc->row_preds[j][k].offset /= h->param.i_threads;
2008 rc->row_preds[j][k].count /= h->param.i_threads;
2012 void x264_thread_sync_ratecontrol( x264_t *cur, x264_t *prev, x264_t *next )
2016 #define COPY(var) memcpy(&cur->rc->var, &prev->rc->var, sizeof(cur->rc->var))
2017 /* these vars are updated in x264_ratecontrol_start()
2018 * so copy them from the context that most recently started (prev)
2019 * to the context that's about to start (cur). */
2024 COPY(last_qscale_for);
2025 COPY(last_non_b_pict_type);
2026 COPY(short_term_cplxsum);
2027 COPY(short_term_cplxcount);
2031 /* these vars can be updated by x264_ratecontrol_init_reconfigurable */
2034 COPY(single_frame_vbv);
2036 COPY(b_vbv_min_rate);
2037 COPY(rate_factor_constant);
2043 #define COPY(var) next->rc->var = cur->rc->var
2044 /* these vars are updated in x264_ratecontrol_end()
2045 * so copy them from the context that most recently ended (cur)
2046 * to the context that's about to end (next) */
2048 COPY(expected_bits_sum);
2049 COPY(wanted_bits_window);
2053 //FIXME row_preds[] (not strictly necessary, but would improve prediction)
2054 /* the rest of the variables are either constant or thread-local */
2057 static int find_underflow( x264_t *h, double *fills, int *t0, int *t1, int over )
2059 /* find an interval ending on an overflow or underflow (depending on whether
2060 * we're adding or removing bits), and starting on the earliest frame that
2061 * can influence the buffer fill of that end frame. */
2062 x264_ratecontrol_t *rcc = h->rc;
2063 const double buffer_min = (over ? .1 : .1) * rcc->buffer_size;
2064 const double buffer_max = .9 * rcc->buffer_size;
2065 double fill = fills[*t0-1];
2066 double parity = over ? 1. : -1.;
2067 int i, start=-1, end=-1;
2068 for(i = *t0; i < rcc->num_entries; i++)
2070 fill += (rcc->buffer_rate - qscale2bits(&rcc->entry[i], rcc->entry[i].new_qscale)) * parity;
2071 fill = x264_clip3f(fill, 0, rcc->buffer_size);
2073 if(fill <= buffer_min || i == 0)
2079 else if(fill >= buffer_max && start >= 0)
2084 return start>=0 && end>=0;
2087 static int fix_underflow( x264_t *h, int t0, int t1, double adjustment, double qscale_min, double qscale_max)
2089 x264_ratecontrol_t *rcc = h->rc;
2090 double qscale_orig, qscale_new;
2095 for(i = t0; i <= t1; i++)
2097 qscale_orig = rcc->entry[i].new_qscale;
2098 qscale_orig = x264_clip3f(qscale_orig, qscale_min, qscale_max);
2099 qscale_new = qscale_orig * adjustment;
2100 qscale_new = x264_clip3f(qscale_new, qscale_min, qscale_max);
2101 rcc->entry[i].new_qscale = qscale_new;
2102 adjusted = adjusted || (qscale_new != qscale_orig);
2107 static double count_expected_bits( x264_t *h )
2109 x264_ratecontrol_t *rcc = h->rc;
2110 double expected_bits = 0;
2112 for(i = 0; i < rcc->num_entries; i++)
2114 ratecontrol_entry_t *rce = &rcc->entry[i];
2115 rce->expected_bits = expected_bits;
2116 expected_bits += qscale2bits(rce, rce->new_qscale);
2118 return expected_bits;
2121 static int vbv_pass2( x264_t *h )
2123 /* for each interval of buffer_full .. underflow, uniformly increase the qp of all
2124 * frames in the interval until either buffer is full at some intermediate frame or the
2125 * last frame in the interval no longer underflows. Recompute intervals and repeat.
2126 * Then do the converse to put bits back into overflow areas until target size is met */
2128 x264_ratecontrol_t *rcc = h->rc;
2130 double all_available_bits = h->param.rc.i_bitrate * 1000. * rcc->num_entries / rcc->fps;
2131 double expected_bits = 0;
2133 double prev_bits = 0;
2135 double qscale_min = qp2qscale(h->param.rc.i_qp_min);
2136 double qscale_max = qp2qscale(h->param.rc.i_qp_max);
2138 int adj_min, adj_max;
2139 CHECKED_MALLOC( fills, (rcc->num_entries+1)*sizeof(double) );
2143 /* adjust overall stream size */
2147 prev_bits = expected_bits;
2149 if(expected_bits != 0)
2150 { /* not first iteration */
2151 adjustment = X264_MAX(X264_MIN(expected_bits / all_available_bits, 0.999), 0.9);
2152 fills[-1] = rcc->buffer_size * h->param.rc.f_vbv_buffer_init;
2156 while(adj_min && find_underflow(h, fills, &t0, &t1, 1))
2158 adj_min = fix_underflow(h, t0, t1, adjustment, qscale_min, qscale_max);
2163 fills[-1] = rcc->buffer_size * (1. - h->param.rc.f_vbv_buffer_init);
2165 /* fix underflows -- should be done after overflow, as we'd better undersize target than underflowing VBV */
2167 while(adj_max && find_underflow(h, fills, &t0, &t1, 0))
2168 adj_max = fix_underflow(h, t0, t1, 1.001, qscale_min, qscale_max);
2170 expected_bits = count_expected_bits(h);
2171 } while((expected_bits < .995*all_available_bits) && ((int64_t)(expected_bits+.5) > (int64_t)(prev_bits+.5)) );
2174 x264_log( h, X264_LOG_WARNING, "vbv-maxrate issue, qpmax or vbv-maxrate too low\n");
2176 /* store expected vbv filling values for tracking when encoding */
2177 for(i = 0; i < rcc->num_entries; i++)
2178 rcc->entry[i].expected_vbv = rcc->buffer_size - fills[i];
2186 static int init_pass2( x264_t *h )
2188 x264_ratecontrol_t *rcc = h->rc;
2189 uint64_t all_const_bits = 0;
2190 uint64_t all_available_bits = (uint64_t)(h->param.rc.i_bitrate * 1000. * rcc->num_entries / rcc->fps);
2191 double rate_factor, step, step_mult;
2192 double qblur = h->param.rc.f_qblur;
2193 double cplxblur = h->param.rc.f_complexity_blur;
2194 const int filter_size = (int)(qblur*4) | 1;
2195 double expected_bits;
2196 double *qscale, *blurred_qscale;
2199 /* find total/average complexity & const_bits */
2200 for(i=0; i<rcc->num_entries; i++)
2202 ratecontrol_entry_t *rce = &rcc->entry[i];
2203 all_const_bits += rce->misc_bits;
2206 if( all_available_bits < all_const_bits)
2208 x264_log(h, X264_LOG_ERROR, "requested bitrate is too low. estimated minimum is %d kbps\n",
2209 (int)(all_const_bits * rcc->fps / (rcc->num_entries * 1000.)));
2213 /* Blur complexities, to reduce local fluctuation of QP.
2214 * We don't blur the QPs directly, because then one very simple frame
2215 * could drag down the QP of a nearby complex frame and give it more
2216 * bits than intended. */
2217 for(i=0; i<rcc->num_entries; i++)
2219 ratecontrol_entry_t *rce = &rcc->entry[i];
2220 double weight_sum = 0;
2221 double cplx_sum = 0;
2222 double weight = 1.0;
2223 double gaussian_weight;
2225 /* weighted average of cplx of future frames */
2226 for(j=1; j<cplxblur*2 && j<rcc->num_entries-i; j++)
2228 ratecontrol_entry_t *rcj = &rcc->entry[i+j];
2229 weight *= 1 - pow( (float)rcj->i_count / rcc->nmb, 2 );
2232 gaussian_weight = weight * exp(-j*j/200.0);
2233 weight_sum += gaussian_weight;
2234 cplx_sum += gaussian_weight * (qscale2bits(rcj, 1) - rcj->misc_bits);
2236 /* weighted average of cplx of past frames */
2238 for(j=0; j<=cplxblur*2 && j<=i; j++)
2240 ratecontrol_entry_t *rcj = &rcc->entry[i-j];
2241 gaussian_weight = weight * exp(-j*j/200.0);
2242 weight_sum += gaussian_weight;
2243 cplx_sum += gaussian_weight * (qscale2bits(rcj, 1) - rcj->misc_bits);
2244 weight *= 1 - pow( (float)rcj->i_count / rcc->nmb, 2 );
2248 rce->blurred_complexity = cplx_sum / weight_sum;
2251 CHECKED_MALLOC( qscale, sizeof(double)*rcc->num_entries );
2252 if( filter_size > 1 )
2253 CHECKED_MALLOC( blurred_qscale, sizeof(double)*rcc->num_entries );
2255 blurred_qscale = qscale;
2257 /* Search for a factor which, when multiplied by the RCEQ values from
2258 * each frame, adds up to the desired total size.
2259 * There is no exact closed-form solution because of VBV constraints and
2260 * because qscale2bits is not invertible, but we can start with the simple
2261 * approximation of scaling the 1st pass by the ratio of bitrates.
2262 * The search range is probably overkill, but speed doesn't matter here. */
2265 for(i=0; i<rcc->num_entries; i++)
2267 double q = get_qscale(h, &rcc->entry[i], 1.0, i);
2268 expected_bits += qscale2bits(&rcc->entry[i], q);
2269 rcc->last_qscale_for[rcc->entry[i].pict_type] = q;
2271 step_mult = all_available_bits / expected_bits;
2274 for(step = 1E4 * step_mult; step > 1E-7 * step_mult; step *= 0.5)
2277 rate_factor += step;
2279 rcc->last_non_b_pict_type = -1;
2280 rcc->last_accum_p_norm = 1;
2281 rcc->accum_p_norm = 0;
2284 for(i=0; i<rcc->num_entries; i++)
2286 qscale[i] = get_qscale(h, &rcc->entry[i], rate_factor, i);
2287 rcc->last_qscale_for[rcc->entry[i].pict_type] = qscale[i];
2290 /* fixed I/B qscale relative to P */
2291 for(i=rcc->num_entries-1; i>=0; i--)
2293 qscale[i] = get_diff_limited_q(h, &rcc->entry[i], qscale[i]);
2294 assert(qscale[i] >= 0);
2300 assert(filter_size%2==1);
2301 for(i=0; i<rcc->num_entries; i++)
2303 ratecontrol_entry_t *rce = &rcc->entry[i];
2305 double q=0.0, sum=0.0;
2307 for(j=0; j<filter_size; j++)
2309 int index = i+j-filter_size/2;
2311 double coeff = qblur==0 ? 1.0 : exp(-d*d/(qblur*qblur));
2312 if(index < 0 || index >= rcc->num_entries)
2314 if(rce->pict_type != rcc->entry[index].pict_type)
2316 q += qscale[index] * coeff;
2319 blurred_qscale[i] = q/sum;
2323 /* find expected bits */
2324 for(i=0; i<rcc->num_entries; i++)
2326 ratecontrol_entry_t *rce = &rcc->entry[i];
2327 rce->new_qscale = clip_qscale(h, rce->pict_type, blurred_qscale[i]);
2328 assert(rce->new_qscale >= 0);
2329 expected_bits += qscale2bits(rce, rce->new_qscale);
2332 if(expected_bits > all_available_bits) rate_factor -= step;
2337 x264_free(blurred_qscale);
2340 if( vbv_pass2( h ) )
2342 expected_bits = count_expected_bits(h);
2344 if(fabs(expected_bits/all_available_bits - 1.0) > 0.01)
2347 for(i=0; i<rcc->num_entries; i++)
2348 avgq += rcc->entry[i].new_qscale;
2349 avgq = qscale2qp(avgq / rcc->num_entries);
2351 if ((expected_bits > all_available_bits) || (!rcc->b_vbv))
2352 x264_log(h, X264_LOG_WARNING, "Error: 2pass curve failed to converge\n");
2353 x264_log(h, X264_LOG_WARNING, "target: %.2f kbit/s, expected: %.2f kbit/s, avg QP: %.4f\n",
2354 (float)h->param.rc.i_bitrate,
2355 expected_bits * rcc->fps / (rcc->num_entries * 1000.),
2357 if(expected_bits < all_available_bits && avgq < h->param.rc.i_qp_min + 2)
2359 if(h->param.rc.i_qp_min > 0)
2360 x264_log(h, X264_LOG_WARNING, "try reducing target bitrate or reducing qp_min (currently %d)\n", h->param.rc.i_qp_min);
2362 x264_log(h, X264_LOG_WARNING, "try reducing target bitrate\n");
2364 else if(expected_bits > all_available_bits && avgq > h->param.rc.i_qp_max - 2)
2366 if(h->param.rc.i_qp_max < 51)
2367 x264_log(h, X264_LOG_WARNING, "try increasing target bitrate or increasing qp_max (currently %d)\n", h->param.rc.i_qp_max);
2369 x264_log(h, X264_LOG_WARNING, "try increasing target bitrate\n");
2371 else if(!(rcc->b_2pass && rcc->b_vbv))
2372 x264_log(h, X264_LOG_WARNING, "internal error\n");