1 /*****************************************************************************
2 * slicetype.c: h264 encoder library
3 *****************************************************************************
4 * Copyright (C) 2005-2008 x264 project
6 * Authors: Fiona Glaser <fiona@x264.com>
7 * Loren Merritt <lorenm@u.washington.edu>
8 * Dylan Yudaken <dyudaken@gmail.com>
10 * This program is free software; you can redistribute it and/or modify
11 * it under the terms of the GNU General Public License as published by
12 * the Free Software Foundation; either version 2 of the License, or
13 * (at your option) any later version.
15 * This program is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 * GNU General Public License for more details.
20 * You should have received a copy of the GNU General Public License
21 * along with this program; if not, write to the Free Software
22 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111, USA.
23 *****************************************************************************/
27 #include "common/common.h"
28 #include "macroblock.h"
31 // Indexed by pic_struct values
32 static const uint8_t delta_tfi_divisor[10] = { 0, 2, 1, 1, 2, 2, 3, 3, 4, 6 };
34 static int x264_slicetype_frame_cost( x264_t *h, x264_mb_analysis_t *a,
35 x264_frame_t **frames, int p0, int p1, int b,
36 int b_intra_penalty );
38 static void x264_lowres_context_init( x264_t *h, x264_mb_analysis_t *a )
40 a->i_qp = X264_LOOKAHEAD_QP;
41 a->i_lambda = x264_lambda_tab[ a->i_qp ];
42 x264_mb_analyse_load_costs( h, a );
43 if( h->param.analyse.i_subpel_refine > 1 )
45 h->mb.i_me_method = X264_MIN( X264_ME_HEX, h->param.analyse.i_me_method );
46 h->mb.i_subpel_refine = 4;
50 h->mb.i_me_method = X264_ME_DIA;
51 h->mb.i_subpel_refine = 2;
53 h->mb.b_chroma_me = 0;
56 /* makes a non-h264 weight (i.e. fix7), into an h264 weight */
57 static void x264_weight_get_h264( unsigned int weight_nonh264, int offset, x264_weight_t *w )
61 w->i_scale = weight_nonh264;
62 while( w->i_denom > 0 && (w->i_scale > 127 || !(w->i_scale & 1)) )
67 w->i_scale = X264_MIN( w->i_scale, 127 );
70 static NOINLINE pixel *x264_weight_cost_init_luma( x264_t *h, x264_frame_t *fenc, x264_frame_t *ref, pixel *dest )
72 int ref0_distance = fenc->i_frame - ref->i_frame - 1;
73 /* Note: this will never run during lookahead as weights_analyse is only called if no
74 * motion search has been done. */
75 if( fenc->lowres_mvs[0][ref0_distance][0][0] != 0x7FFF )
77 int i_stride = fenc->i_stride_lowres;
78 int i_lines = fenc->i_lines_lowres;
79 int i_width = fenc->i_width_lowres;
83 for( int y = 0; y < i_lines; y += 8, p += i_stride*8 )
84 for( int x = 0; x < i_width; x += 8, i_mb_xy++ )
86 int mvx = fenc->lowres_mvs[0][ref0_distance][i_mb_xy][0];
87 int mvy = fenc->lowres_mvs[0][ref0_distance][i_mb_xy][1];
88 h->mc.mc_luma( p+x, i_stride, ref->lowres, i_stride,
89 mvx+(x<<2), mvy+(y<<2), 8, 8, weight_none );
95 return ref->lowres[0];
98 static NOINLINE unsigned int x264_weight_cost( x264_t *h, x264_frame_t *fenc, pixel *src, x264_weight_t *w )
100 unsigned int cost = 0;
101 int i_stride = fenc->i_stride_lowres;
102 int i_lines = fenc->i_lines_lowres;
103 int i_width = fenc->i_width_lowres;
104 pixel *fenc_plane = fenc->lowres[0];
105 ALIGNED_ARRAY_8( pixel, buf,[8*8] );
111 for( int y = 0; y < i_lines; y += 8, pixoff = y*i_stride )
112 for( int x = 0; x < i_width; x += 8, i_mb++, pixoff += 8)
114 w->weightfn[8>>2]( buf, 8, &src[pixoff], i_stride, w, 8 );
115 cost += X264_MIN( h->pixf.mbcmp[PIXEL_8x8]( buf, 8, &fenc_plane[pixoff], i_stride ), fenc->i_intra_cost[i_mb] );
117 /* Add cost of weights in the slice header. */
119 if( h->param.i_slice_count )
120 numslices = h->param.i_slice_count;
121 else if( h->param.i_slice_max_mbs )
122 numslices = (h->mb.i_mb_width * h->mb.i_mb_height + h->param.i_slice_max_mbs-1) / h->param.i_slice_max_mbs;
125 /* FIXME: find a way to account for --slice-max-size?
126 * Multiply by 2 as there will be a duplicate. 10 bits added as if there is a weighted frame, then an additional duplicate is used.
127 * Since using lowres frames, assume lambda = 1. */
128 cost += numslices * ( 10 + 2 * ( bs_size_ue( w[0].i_denom ) + bs_size_se( w[0].i_scale ) + bs_size_se( w[0].i_offset ) ) );
131 for( int y = 0; y < i_lines; y += 8, pixoff = y*i_stride )
132 for( int x = 0; x < i_width; x += 8, i_mb++, pixoff += 8 )
133 cost += X264_MIN( h->pixf.mbcmp[PIXEL_8x8]( &src[pixoff], i_stride, &fenc_plane[pixoff], i_stride ), fenc->i_intra_cost[i_mb] );
138 void x264_weights_analyse( x264_t *h, x264_frame_t *fenc, x264_frame_t *ref, int b_lookahead )
140 float fenc_mean, ref_mean, fenc_var, ref_var;
142 int minoff, minscale, mindenom;
143 unsigned int minscore, origscore;
144 int i_delta_index = fenc->i_frame - ref->i_frame - 1;
145 /* epsilon is chosen to require at least a numerator of 127 (with denominator = 128) */
146 const float epsilon = 1.0/128.0;
149 x264_weight_t *weights = fenc->weight[0];
151 fenc_var = round( sqrt( fenc->i_pixel_ssd[0] ) );
152 ref_var = round( sqrt( ref->i_pixel_ssd[0] ) );
153 fenc_mean = (float)fenc->i_pixel_sum[0] / (fenc->i_lines[0] * fenc->i_width[0]);
154 ref_mean = (float) ref->i_pixel_sum[0] / (fenc->i_lines[0] * fenc->i_width[0]);
157 if( fabs( ref_mean - fenc_mean ) < 0.5 && fabs( 1 - fenc_var / ref_var ) < epsilon )
159 SET_WEIGHT( weights[0], 0, 1, 0, 0 );
163 guess_scale = ref_var ? fenc_var/ref_var : 0;
164 x264_weight_get_h264( round( guess_scale * 128 ), 0, &weights[0] );
167 mindenom = weights[0].i_denom;
168 minscale = weights[0].i_scale;
170 offset_search = x264_clip3( floor( fenc_mean - ref_mean * minscale / (1 << mindenom) + 0.5f*b_lookahead ), -128, 126 );
172 if( !fenc->b_intra_calculated )
174 x264_mb_analysis_t a;
175 x264_lowres_context_init( h, &a );
176 x264_slicetype_frame_cost( h, &a, &fenc, 0, 0, 0, 0 );
178 pixel *mcbuf = x264_weight_cost_init_luma( h, fenc, ref, h->mb.p_weight_buf[0] );
179 origscore = minscore = x264_weight_cost( h, fenc, mcbuf, 0 );
183 SET_WEIGHT( weights[0], 0, 1, 0, 0 );
187 // This gives a slight improvement due to rounding errors but only tests
188 // one offset on lookahead.
189 // TODO: currently searches only offset +1. try other offsets/multipliers/combinations thereof?
190 for( int i_off = offset_search; i_off <= offset_search+!b_lookahead; i_off++ )
192 SET_WEIGHT( weights[0], 1, minscale, mindenom, i_off );
193 unsigned int s = x264_weight_cost( h, fenc, mcbuf, &weights[0] );
194 COPY3_IF_LT( minscore, s, minoff, i_off, found, 1 );
198 /* FIXME: More analysis can be done here on SAD vs. SATD termination. */
199 /* 0.2% termination derived experimentally to avoid weird weights in frames that are mostly intra. */
200 if( !found || (minscale == 1<<mindenom && minoff == 0) || (float)minscore / origscore > 0.998 )
202 SET_WEIGHT( weights[0], 0, 1, 0, 0 );
206 SET_WEIGHT( weights[0], 1, minscale, mindenom, minoff );
208 if( h->param.analyse.i_weighted_pred == X264_WEIGHTP_FAKE && weights[0].weightfn )
209 fenc->f_weighted_cost_delta[i_delta_index] = (float)minscore / origscore;
211 if( weights[0].weightfn && b_lookahead )
213 //scale lowres in lookahead for slicetype_frame_cost
214 pixel *src = ref->buffer_lowres[0];
215 pixel *dst = h->mb.p_weight_buf[0];
216 int width = ref->i_width_lowres + PADH*2;
217 int height = ref->i_lines_lowres + PADV*2;
218 x264_weight_scale_plane( h, dst, ref->i_stride_lowres, src, ref->i_stride_lowres,
219 width, height, &weights[0] );
220 fenc->weighted[0] = h->mb.p_weight_buf[0] + PADH + ref->i_stride_lowres * PADV;
224 static void x264_slicetype_mb_cost( x264_t *h, x264_mb_analysis_t *a,
225 x264_frame_t **frames, int p0, int p1, int b,
226 int dist_scale_factor, int do_search[2], const x264_weight_t *w )
228 x264_frame_t *fref0 = frames[p0];
229 x264_frame_t *fref1 = frames[p1];
230 x264_frame_t *fenc = frames[b];
231 const int b_bidir = (b < p1);
232 const int i_mb_x = h->mb.i_mb_x;
233 const int i_mb_y = h->mb.i_mb_y;
234 const int i_mb_stride = h->mb.i_mb_width;
235 const int i_mb_xy = i_mb_x + i_mb_y * i_mb_stride;
236 const int i_stride = fenc->i_stride_lowres;
237 const int i_pel_offset = 8 * (i_mb_x + i_mb_y * i_stride);
238 const int i_bipred_weight = h->param.analyse.b_weighted_bipred ? 64 - (dist_scale_factor>>2) : 32;
239 int16_t (*fenc_mvs[2])[2] = { &frames[b]->lowres_mvs[0][b-p0-1][i_mb_xy], &frames[b]->lowres_mvs[1][p1-b-1][i_mb_xy] };
240 int (*fenc_costs[2]) = { &frames[b]->lowres_mv_costs[0][b-p0-1][i_mb_xy], &frames[b]->lowres_mv_costs[1][p1-b-1][i_mb_xy] };
241 int b_frame_score_mb = (i_mb_x > 0 && i_mb_x < h->mb.i_mb_width - 1 &&
242 i_mb_y > 0 && i_mb_y < h->mb.i_mb_height - 1) ||
243 h->mb.i_mb_width <= 2 || h->mb.i_mb_height <= 2;
245 ALIGNED_ARRAY_8( pixel, pix1,[9*FDEC_STRIDE] );
246 pixel *pix2 = pix1+8;
248 int i_bcost = COST_MAX;
251 h->mb.pic.p_fenc[0] = h->mb.pic.fenc_buf;
252 h->mc.copy[PIXEL_8x8]( h->mb.pic.p_fenc[0], FENC_STRIDE, &fenc->lowres[0][i_pel_offset], i_stride, 8 );
255 goto lowres_intra_mb;
257 // no need for h->mb.mv_min[]
258 h->mb.mv_min_fpel[0] = -8*h->mb.i_mb_x - 4;
259 h->mb.mv_max_fpel[0] = 8*( h->mb.i_mb_width - h->mb.i_mb_x - 1 ) + 4;
260 h->mb.mv_min_spel[0] = 4*( h->mb.mv_min_fpel[0] - 8 );
261 h->mb.mv_max_spel[0] = 4*( h->mb.mv_max_fpel[0] + 8 );
262 if( h->mb.i_mb_x >= h->mb.i_mb_width - 2 )
264 h->mb.mv_min_fpel[1] = -8*h->mb.i_mb_y - 4;
265 h->mb.mv_max_fpel[1] = 8*( h->mb.i_mb_height - h->mb.i_mb_y - 1 ) + 4;
266 h->mb.mv_min_spel[1] = 4*( h->mb.mv_min_fpel[1] - 8 );
267 h->mb.mv_max_spel[1] = 4*( h->mb.mv_max_fpel[1] + 8 );
270 #define LOAD_HPELS_LUMA(dst, src) \
272 (dst)[0] = &(src)[0][i_pel_offset]; \
273 (dst)[1] = &(src)[1][i_pel_offset]; \
274 (dst)[2] = &(src)[2][i_pel_offset]; \
275 (dst)[3] = &(src)[3][i_pel_offset]; \
277 #define LOAD_WPELS_LUMA(dst,src) \
278 (dst) = &(src)[i_pel_offset];
280 #define CLIP_MV( mv ) \
282 mv[0] = x264_clip3( mv[0], h->mb.mv_min_spel[0], h->mb.mv_max_spel[0] ); \
283 mv[1] = x264_clip3( mv[1], h->mb.mv_min_spel[1], h->mb.mv_max_spel[1] ); \
285 #define TRY_BIDIR( mv0, mv1, penalty ) \
288 if( h->param.analyse.i_subpel_refine <= 1 ) \
290 int hpel_idx1 = (((mv0)[0]&2)>>1) + ((mv0)[1]&2); \
291 int hpel_idx2 = (((mv1)[0]&2)>>1) + ((mv1)[1]&2); \
292 pixel *src1 = m[0].p_fref[hpel_idx1] + ((mv0)[0]>>2) + ((mv0)[1]>>2) * m[0].i_stride[0]; \
293 pixel *src2 = m[1].p_fref[hpel_idx2] + ((mv1)[0]>>2) + ((mv1)[1]>>2) * m[1].i_stride[0]; \
294 h->mc.avg[PIXEL_8x8]( pix1, 16, src1, m[0].i_stride[0], src2, m[1].i_stride[0], i_bipred_weight ); \
298 int stride1 = 16, stride2 = 16; \
299 pixel *src1, *src2; \
300 src1 = h->mc.get_ref( pix1, &stride1, m[0].p_fref, m[0].i_stride[0], \
301 (mv0)[0], (mv0)[1], 8, 8, w ); \
302 src2 = h->mc.get_ref( pix2, &stride2, m[1].p_fref, m[1].i_stride[0], \
303 (mv1)[0], (mv1)[1], 8, 8, w ); \
304 h->mc.avg[PIXEL_8x8]( pix1, 16, src1, stride1, src2, stride2, i_bipred_weight ); \
306 i_cost = penalty + h->pixf.mbcmp[PIXEL_8x8]( \
307 m[0].p_fenc[0], FENC_STRIDE, pix1, 16 ); \
308 COPY2_IF_LT( i_bcost, i_cost, list_used, 3 ); \
311 m[0].i_pixel = PIXEL_8x8;
312 m[0].p_cost_mv = a->p_cost_mv;
313 m[0].i_stride[0] = i_stride;
314 m[0].p_fenc[0] = h->mb.pic.p_fenc[0];
317 LOAD_HPELS_LUMA( m[0].p_fref, fref0->lowres );
318 m[0].p_fref_w = m[0].p_fref[0];
320 LOAD_WPELS_LUMA( m[0].p_fref_w, fenc->weighted[0] );
324 int16_t *mvr = fref1->lowres_mvs[0][p1-p0-1][i_mb_xy];
325 ALIGNED_ARRAY_8( int16_t, dmv,[2],[2] );
327 m[1].i_pixel = PIXEL_8x8;
328 m[1].p_cost_mv = a->p_cost_mv;
329 m[1].i_stride[0] = i_stride;
330 m[1].p_fenc[0] = h->mb.pic.p_fenc[0];
332 m[1].weight = weight_none;
333 LOAD_HPELS_LUMA( m[1].p_fref, fref1->lowres );
334 m[1].p_fref_w = m[1].p_fref[0];
336 dmv[0][0] = ( mvr[0] * dist_scale_factor + 128 ) >> 8;
337 dmv[0][1] = ( mvr[1] * dist_scale_factor + 128 ) >> 8;
338 dmv[1][0] = dmv[0][0] - mvr[0];
339 dmv[1][1] = dmv[0][1] - mvr[1];
342 if( h->param.analyse.i_subpel_refine <= 1 )
343 M64( dmv ) &= ~0x0001000100010001ULL; /* mv & ~1 */
345 TRY_BIDIR( dmv[0], dmv[1], 0 );
349 h->mc.avg[PIXEL_8x8]( pix1, 16, m[0].p_fref[0], m[0].i_stride[0], m[1].p_fref[0], m[1].i_stride[0], i_bipred_weight );
350 i_cost = h->pixf.mbcmp[PIXEL_8x8]( m[0].p_fenc[0], FENC_STRIDE, pix1, 16 );
351 COPY2_IF_LT( i_bcost, i_cost, list_used, 3 );
355 for( int l = 0; l < 1 + b_bidir; l++ )
360 int16_t (*fenc_mv)[2] = fenc_mvs[l];
361 ALIGNED_4( int16_t mvc[4][2] );
363 /* Reverse-order MV prediction. */
366 #define MVC(mv) { CP32( mvc[i_mvc], mv ); i_mvc++; }
367 if( i_mb_x < h->mb.i_mb_width - 1 )
369 if( i_mb_y < h->mb.i_mb_height - 1 )
371 MVC( fenc_mv[i_mb_stride] );
373 MVC( fenc_mv[i_mb_stride-1] );
374 if( i_mb_x < h->mb.i_mb_width - 1 )
375 MVC( fenc_mv[i_mb_stride+1] );
379 CP32( m[l].mvp, mvc[0] );
381 x264_median_mv( m[l].mvp, mvc[0], mvc[1], mvc[2] );
383 /* Fast skip for cases of near-zero residual. Shortcut: don't bother except in the mv0 case,
384 * since anything else is likely to have enough residual to not trigger the skip. */
385 if( !M32( m[l].mvp ) )
387 m[l].cost = h->pixf.mbcmp[PIXEL_8x8]( m[l].p_fenc[0], FENC_STRIDE, m[l].p_fref[0], m[l].i_stride[0] );
395 x264_me_search( h, &m[l], mvc, i_mvc );
396 m[l].cost -= 2; // remove mvcost from skip mbs
401 CP32( fenc_mvs[l], m[l].mv );
402 *fenc_costs[l] = m[l].cost;
406 CP32( m[l].mv, fenc_mvs[l] );
407 m[l].cost = *fenc_costs[l];
409 COPY2_IF_LT( i_bcost, m[l].cost, list_used, l+1 );
412 if( b_bidir && ( M32( m[0].mv ) || M32( m[1].mv ) ) )
413 TRY_BIDIR( m[0].mv, m[1].mv, 5 );
416 if( !fenc->b_intra_calculated )
418 ALIGNED_ARRAY_16( pixel, edge,[33] );
419 pixel *pix = &pix1[8+FDEC_STRIDE - 1];
420 pixel *src = &fenc->lowres[0][i_pel_offset - 1];
421 const int intra_penalty = 5;
424 memcpy( pix-FDEC_STRIDE, src-i_stride, 17 * sizeof(pixel) );
425 for( int i = 0; i < 8; i++ )
426 pix[i*FDEC_STRIDE] = src[i*i_stride];
429 if( h->pixf.intra_mbcmp_x3_8x8c )
430 h->pixf.intra_mbcmp_x3_8x8c( h->mb.pic.p_fenc[0], pix, satds );
433 for( int i = 0; i < 3; i++ )
435 h->predict_8x8c[i]( pix );
436 satds[i] = h->pixf.mbcmp[PIXEL_8x8]( pix, FDEC_STRIDE, h->mb.pic.p_fenc[0], FENC_STRIDE );
439 int i_icost = X264_MIN3( satds[0], satds[1], satds[2] );
441 if( h->param.analyse.i_subpel_refine > 1 )
443 h->predict_8x8c[I_PRED_CHROMA_P]( pix );
444 int satd = h->pixf.mbcmp[PIXEL_8x8]( pix, FDEC_STRIDE, h->mb.pic.p_fenc[0], FENC_STRIDE );
445 i_icost = X264_MIN( i_icost, satd );
446 h->predict_8x8_filter( pix, edge, ALL_NEIGHBORS, ALL_NEIGHBORS );
447 for( int i = 3; i < 9; i++ )
449 h->predict_8x8[i]( pix, edge );
450 satd = h->pixf.mbcmp[PIXEL_8x8]( pix, FDEC_STRIDE, h->mb.pic.p_fenc[0], FENC_STRIDE );
451 i_icost = X264_MIN( i_icost, satd );
455 i_icost += intra_penalty;
456 fenc->i_intra_cost[i_mb_xy] = i_icost;
457 if( b_frame_score_mb )
459 int *row_satd_intra = frames[b]->i_row_satds[0][0];
460 int i_icost_aq = i_icost;
461 if( h->param.rc.i_aq_mode )
462 i_icost_aq = (i_icost_aq * frames[b]->i_inv_qscale_factor[i_mb_xy] + 128) >> 8;
463 fenc->i_cost_est[0][0] += i_icost;
464 fenc->i_cost_est_aq[0][0] += i_icost_aq;
465 row_satd_intra[h->mb.i_mb_y] += i_icost_aq;
469 /* forbid intra-mbs in B-frames, because it's rare and not worth checking */
470 /* FIXME: Should we still forbid them now that we cache intra scores? */
473 int i_icost = fenc->i_intra_cost[i_mb_xy];
474 int b_intra = i_icost < i_bcost;
480 if( b_frame_score_mb )
481 fenc->i_intra_mbs[b-p0] += b_intra;
484 /* In an I-frame, we've already added the results above in the intra section. */
487 int i_bcost_aq = i_bcost;
488 if( h->param.rc.i_aq_mode )
489 i_bcost_aq = (i_bcost_aq * frames[b]->i_inv_qscale_factor[i_mb_xy] + 128) >> 8;
490 fenc->i_row_satds[b-p0][p1-b][h->mb.i_mb_y] += i_bcost_aq;
491 if( b_frame_score_mb )
493 /* Don't use AQ-weighted costs for slicetype decision, only for ratecontrol. */
494 frames[b]->i_cost_est[b-p0][p1-b] += i_bcost;
495 frames[b]->i_cost_est_aq[b-p0][p1-b] += i_bcost_aq;
499 fenc->lowres_costs[b-p0][p1-b][i_mb_xy] = i_bcost + (list_used << LOWRES_COST_SHIFT);
504 (h->mb.i_mb_width > 2 && h->mb.i_mb_height > 2 ?\
505 (h->mb.i_mb_width - 2) * (h->mb.i_mb_height - 2) :\
506 h->mb.i_mb_width * h->mb.i_mb_height)
508 static int x264_slicetype_frame_cost( x264_t *h, x264_mb_analysis_t *a,
509 x264_frame_t **frames, int p0, int p1, int b,
510 int b_intra_penalty )
514 const x264_weight_t *w = weight_none;
515 /* Check whether we already evaluated this frame
516 * If we have tried this frame as P, then we have also tried
517 * the preceding frames as B. (is this still true?) */
518 /* Also check that we already calculated the row SATDs for the current frame. */
519 if( frames[b]->i_cost_est[b-p0][p1-b] >= 0 && (!h->param.rc.i_vbv_buffer_size || frames[b]->i_row_satds[b-p0][p1-b][0] != -1) )
520 i_score = frames[b]->i_cost_est[b-p0][p1-b];
523 int dist_scale_factor = 128;
524 int *row_satd = frames[b]->i_row_satds[b-p0][p1-b];
525 int *row_satd_intra = frames[b]->i_row_satds[0][0];
527 /* For each list, check to see whether we have lowres motion-searched this reference frame before. */
528 do_search[0] = b != p0 && frames[b]->lowres_mvs[0][b-p0-1][0][0] == 0x7FFF;
529 do_search[1] = b != p1 && frames[b]->lowres_mvs[1][p1-b-1][0][0] == 0x7FFF;
532 if( ( h->param.analyse.i_weighted_pred == X264_WEIGHTP_SMART ||
533 h->param.analyse.i_weighted_pred == X264_WEIGHTP_FAKE ) && b == p1 )
536 x264_weights_analyse( h, frames[b], frames[p0], 1 );
537 w = frames[b]->weight[0];
539 frames[b]->lowres_mvs[0][b-p0-1][0][0] = 0;
541 if( do_search[1] ) frames[b]->lowres_mvs[1][p1-b-1][0][0] = 0;
544 frames[b]->i_intra_mbs[b-p0] = 0;
545 if( !frames[b]->b_intra_calculated )
547 frames[b]->i_cost_est[0][0] = 0;
548 frames[b]->i_cost_est_aq[0][0] = 0;
551 dist_scale_factor = ( ((b-p0) << 8) + ((p1-p0) >> 1) ) / (p1-p0);
553 frames[b]->i_cost_est[b-p0][p1-b] = 0;
554 frames[b]->i_cost_est_aq[b-p0][p1-b] = 0;
556 /* Lowres lookahead goes backwards because the MVs are used as predictors in the main encode.
557 * This considerably improves MV prediction overall. */
559 /* The edge mbs seem to reduce the predictive quality of the
560 * whole frame's score, but are needed for a spatial distribution. */
561 if( h->param.rc.b_mb_tree || h->param.rc.i_vbv_buffer_size ||
562 h->mb.i_mb_width <= 2 || h->mb.i_mb_height <= 2 )
564 for( h->mb.i_mb_y = h->mb.i_mb_height - 1; h->mb.i_mb_y >= 0; h->mb.i_mb_y-- )
566 row_satd[h->mb.i_mb_y] = 0;
567 if( !frames[b]->b_intra_calculated )
568 row_satd_intra[h->mb.i_mb_y] = 0;
569 for( h->mb.i_mb_x = h->mb.i_mb_width - 1; h->mb.i_mb_x >= 0; h->mb.i_mb_x-- )
570 x264_slicetype_mb_cost( h, a, frames, p0, p1, b, dist_scale_factor, do_search, w );
575 for( h->mb.i_mb_y = h->mb.i_mb_height - 2; h->mb.i_mb_y >= 1; h->mb.i_mb_y-- )
576 for( h->mb.i_mb_x = h->mb.i_mb_width - 2; h->mb.i_mb_x >= 1; h->mb.i_mb_x-- )
577 x264_slicetype_mb_cost( h, a, frames, p0, p1, b, dist_scale_factor, do_search, w );
580 i_score = frames[b]->i_cost_est[b-p0][p1-b];
582 i_score = (uint64_t)i_score * 100 / (120 + h->param.i_bframe_bias);
584 frames[b]->b_intra_calculated = 1;
586 frames[b]->i_cost_est[b-p0][p1-b] = i_score;
590 if( b_intra_penalty )
592 // arbitrary penalty for I-blocks after B-frames
594 i_score += i_score * frames[b]->i_intra_mbs[b-p0] / (nmb * 8);
599 /* If MB-tree changes the quantizers, we need to recalculate the frame cost without
600 * re-running lookahead. */
601 static int x264_slicetype_frame_cost_recalculate( x264_t *h, x264_frame_t **frames, int p0, int p1, int b )
604 int *row_satd = frames[b]->i_row_satds[b-p0][p1-b];
605 float *qp_offset = IS_X264_TYPE_B(frames[b]->i_type) ? frames[b]->f_qp_offset_aq : frames[b]->f_qp_offset;
607 for( h->mb.i_mb_y = h->mb.i_mb_height - 1; h->mb.i_mb_y >= 0; h->mb.i_mb_y-- )
609 row_satd[ h->mb.i_mb_y ] = 0;
610 for( h->mb.i_mb_x = h->mb.i_mb_width - 1; h->mb.i_mb_x >= 0; h->mb.i_mb_x-- )
612 int i_mb_xy = h->mb.i_mb_x + h->mb.i_mb_y*h->mb.i_mb_stride;
613 int i_mb_cost = frames[b]->lowres_costs[b-p0][p1-b][i_mb_xy] & LOWRES_COST_MASK;
614 float qp_adj = qp_offset[i_mb_xy];
615 i_mb_cost = (i_mb_cost * x264_exp2fix8(qp_adj) + 128) >> 8;
616 row_satd[ h->mb.i_mb_y ] += i_mb_cost;
617 if( (h->mb.i_mb_y > 0 && h->mb.i_mb_y < h->mb.i_mb_height - 1 &&
618 h->mb.i_mb_x > 0 && h->mb.i_mb_x < h->mb.i_mb_width - 1) ||
619 h->mb.i_mb_width <= 2 || h->mb.i_mb_height <= 2 )
621 i_score += i_mb_cost;
628 static void x264_macroblock_tree_finish( x264_t *h, x264_frame_t *frame, int ref0_distance )
631 float weightdelta = 0.0;
632 if( ref0_distance && frame->f_weighted_cost_delta[ref0_distance-1] > 0 )
633 weightdelta = (1.0 - frame->f_weighted_cost_delta[ref0_distance-1]);
635 /* Allow the strength to be adjusted via qcompress, since the two
636 * concepts are very similar. */
637 float strength = 5.0f * (1.0f - h->param.rc.f_qcompress);
638 for( int mb_index = 0; mb_index < h->mb.i_mb_count; mb_index++ )
640 int intra_cost = (frame->i_intra_cost[mb_index] * frame->i_inv_qscale_factor[mb_index]+128)>>8;
643 int propagate_cost = frame->i_propagate_cost[mb_index];
644 float log2_ratio = x264_log2(intra_cost + propagate_cost) - x264_log2(intra_cost) + weightdelta;
645 frame->f_qp_offset[mb_index] = frame->f_qp_offset_aq[mb_index] - strength * log2_ratio;
650 static void x264_macroblock_tree_propagate( x264_t *h, x264_frame_t **frames, int p0, int p1, int b, int referenced )
652 uint16_t *ref_costs[2] = {frames[p0]->i_propagate_cost,frames[p1]->i_propagate_cost};
653 int dist_scale_factor = ( ((b-p0) << 8) + ((p1-p0) >> 1) ) / (p1-p0);
654 int i_bipred_weight = h->param.analyse.b_weighted_bipred ? 64 - (dist_scale_factor>>2) : 32;
655 int16_t (*mvs[2])[2] = { frames[b]->lowres_mvs[0][b-p0-1], frames[b]->lowres_mvs[1][p1-b-1] };
656 int bipred_weights[2] = {i_bipred_weight, 64 - i_bipred_weight};
657 int *buf = h->scratch_buffer;
658 uint16_t *propagate_cost = frames[b]->i_propagate_cost;
660 /* For non-reffed frames the source costs are always zero, so just memset one row and re-use it. */
662 memset( frames[b]->i_propagate_cost, 0, h->mb.i_mb_width * sizeof(uint16_t) );
664 for( h->mb.i_mb_y = 0; h->mb.i_mb_y < h->mb.i_mb_height; h->mb.i_mb_y++ )
666 int mb_index = h->mb.i_mb_y*h->mb.i_mb_stride;
667 h->mc.mbtree_propagate_cost( buf, propagate_cost,
668 frames[b]->i_intra_cost+mb_index, frames[b]->lowres_costs[b-p0][p1-b]+mb_index,
669 frames[b]->i_inv_qscale_factor+mb_index, h->mb.i_mb_width );
671 propagate_cost += h->mb.i_mb_width;
672 for( h->mb.i_mb_x = 0; h->mb.i_mb_x < h->mb.i_mb_width; h->mb.i_mb_x++, mb_index++ )
674 int propagate_amount = buf[h->mb.i_mb_x];
675 /* Don't propagate for an intra block. */
676 if( propagate_amount > 0 )
678 /* Access width-2 bitfield. */
679 int lists_used = frames[b]->lowres_costs[b-p0][p1-b][mb_index] >> LOWRES_COST_SHIFT;
680 /* Follow the MVs to the previous frame(s). */
681 for( int list = 0; list < 2; list++ )
682 if( (lists_used >> list)&1 )
684 #define CLIP_ADD(s,x) (s) = X264_MIN((s)+(x),(1<<16)-1)
685 int listamount = propagate_amount;
686 /* Apply bipred weighting. */
687 if( lists_used == 3 )
688 listamount = (listamount * bipred_weights[list] + 32) >> 6;
690 /* Early termination for simple case of mv0. */
691 if( !M32( mvs[list][mb_index] ) )
693 CLIP_ADD( ref_costs[list][mb_index], listamount );
697 int x = mvs[list][mb_index][0];
698 int y = mvs[list][mb_index][1];
699 int mbx = (x>>5)+h->mb.i_mb_x;
700 int mby = (y>>5)+h->mb.i_mb_y;
701 int idx0 = mbx + mby * h->mb.i_mb_stride;
703 int idx2 = idx0 + h->mb.i_mb_stride;
704 int idx3 = idx0 + h->mb.i_mb_stride + 1;
707 int idx0weight = (32-y)*(32-x);
708 int idx1weight = (32-y)*x;
709 int idx2weight = y*(32-x);
710 int idx3weight = y*x;
712 /* We could just clip the MVs, but pixels that lie outside the frame probably shouldn't
714 if( mbx < h->mb.i_mb_width-1 && mby < h->mb.i_mb_height-1 && mbx >= 0 && mby >= 0 )
716 CLIP_ADD( ref_costs[list][idx0], (listamount*idx0weight+512)>>10 );
717 CLIP_ADD( ref_costs[list][idx1], (listamount*idx1weight+512)>>10 );
718 CLIP_ADD( ref_costs[list][idx2], (listamount*idx2weight+512)>>10 );
719 CLIP_ADD( ref_costs[list][idx3], (listamount*idx3weight+512)>>10 );
721 else /* Check offsets individually */
723 if( mbx < h->mb.i_mb_width && mby < h->mb.i_mb_height && mbx >= 0 && mby >= 0 )
724 CLIP_ADD( ref_costs[list][idx0], (listamount*idx0weight+512)>>10 );
725 if( mbx+1 < h->mb.i_mb_width && mby < h->mb.i_mb_height && mbx+1 >= 0 && mby >= 0 )
726 CLIP_ADD( ref_costs[list][idx1], (listamount*idx1weight+512)>>10 );
727 if( mbx < h->mb.i_mb_width && mby+1 < h->mb.i_mb_height && mbx >= 0 && mby+1 >= 0 )
728 CLIP_ADD( ref_costs[list][idx2], (listamount*idx2weight+512)>>10 );
729 if( mbx+1 < h->mb.i_mb_width && mby+1 < h->mb.i_mb_height && mbx+1 >= 0 && mby+1 >= 0 )
730 CLIP_ADD( ref_costs[list][idx3], (listamount*idx3weight+512)>>10 );
737 if( h->param.rc.i_vbv_buffer_size && h->param.rc.i_lookahead && referenced )
738 x264_macroblock_tree_finish( h, frames[b], b == p1 ? b - p0 : 0 );
741 static void x264_macroblock_tree( x264_t *h, x264_mb_analysis_t *a, x264_frame_t **frames, int num_frames, int b_intra )
744 int last_nonb, cur_nonb = 1;
749 x264_slicetype_frame_cost( h, a, frames, 0, 0, 0, 0 );
751 while( i > 0 && frames[i]->i_type == X264_TYPE_B )
755 /* Lookaheadless MB-tree is not a theoretically distinct case; the same extrapolation could
756 * be applied to the end of a lookahead buffer of any size. However, it's most needed when
757 * lookahead=0, so that's what's currently implemented. */
758 if( !h->param.rc.i_lookahead )
762 memset( frames[0]->i_propagate_cost, 0, h->mb.i_mb_count * sizeof(uint16_t) );
763 memcpy( frames[0]->f_qp_offset, frames[0]->f_qp_offset_aq, h->mb.i_mb_count * sizeof(float) );
766 XCHG( uint16_t*, frames[last_nonb]->i_propagate_cost, frames[0]->i_propagate_cost );
767 memset( frames[0]->i_propagate_cost, 0, h->mb.i_mb_count * sizeof(uint16_t) );
771 if( last_nonb < idx )
773 memset( frames[last_nonb]->i_propagate_cost, 0, h->mb.i_mb_count * sizeof(uint16_t) );
779 while( frames[cur_nonb]->i_type == X264_TYPE_B && cur_nonb > 0 )
783 x264_slicetype_frame_cost( h, a, frames, cur_nonb, last_nonb, last_nonb, 0 );
784 memset( frames[cur_nonb]->i_propagate_cost, 0, h->mb.i_mb_count * sizeof(uint16_t) );
785 bframes = last_nonb - cur_nonb - 1;
786 if( h->param.i_bframe_pyramid && bframes > 1 )
788 int middle = (bframes + 1)/2 + cur_nonb;
789 x264_slicetype_frame_cost( h, a, frames, cur_nonb, last_nonb, middle, 0 );
790 memset( frames[middle]->i_propagate_cost, 0, h->mb.i_mb_count * sizeof(uint16_t) );
791 while( i > cur_nonb )
793 int p0 = i > middle ? middle : cur_nonb;
794 int p1 = i < middle ? middle : last_nonb;
797 x264_slicetype_frame_cost( h, a, frames, p0, p1, i, 0 );
798 x264_macroblock_tree_propagate( h, frames, p0, p1, i, 0 );
802 x264_macroblock_tree_propagate( h, frames, cur_nonb, last_nonb, middle, 1 );
806 while( i > cur_nonb )
808 x264_slicetype_frame_cost( h, a, frames, cur_nonb, last_nonb, i, 0 );
809 x264_macroblock_tree_propagate( h, frames, cur_nonb, last_nonb, i, 0 );
813 x264_macroblock_tree_propagate( h, frames, cur_nonb, last_nonb, last_nonb, 1 );
814 last_nonb = cur_nonb;
817 if( !h->param.rc.i_lookahead )
819 x264_macroblock_tree_propagate( h, frames, 0, last_nonb, last_nonb, 1 );
820 XCHG( uint16_t*, frames[last_nonb]->i_propagate_cost, frames[0]->i_propagate_cost );
823 x264_macroblock_tree_finish( h, frames[last_nonb], last_nonb );
824 if( h->param.i_bframe_pyramid && bframes > 1 && !h->param.rc.i_vbv_buffer_size )
825 x264_macroblock_tree_finish( h, frames[last_nonb+(bframes+1)/2], 0 );
828 static int x264_vbv_frame_cost( x264_t *h, x264_mb_analysis_t *a, x264_frame_t **frames, int p0, int p1, int b )
830 int cost = x264_slicetype_frame_cost( h, a, frames, p0, p1, b, 0 );
831 if( h->param.rc.i_aq_mode )
833 if( h->param.rc.b_mb_tree )
834 return x264_slicetype_frame_cost_recalculate( h, frames, p0, p1, b );
836 return frames[b]->i_cost_est_aq[b-p0][p1-b];
841 static void x264_calculate_durations( x264_t *h, x264_frame_t *cur_frame, x264_frame_t *prev_frame, int *i_cpb_delay, int *i_coded_fields )
843 cur_frame->i_cpb_delay = *i_cpb_delay;
844 cur_frame->i_dpb_output_delay = cur_frame->i_field_cnt - *i_coded_fields;
846 // add a correction term for frame reordering
847 cur_frame->i_dpb_output_delay += h->sps->vui.i_num_reorder_frames*2;
849 // fix possible negative dpb_output_delay because of pulldown changes and reordering
850 if( cur_frame->i_dpb_output_delay < 0 )
852 cur_frame->i_cpb_delay += cur_frame->i_dpb_output_delay;
853 cur_frame->i_dpb_output_delay = 0;
855 prev_frame->i_cpb_duration += cur_frame->i_dpb_output_delay;
858 if( cur_frame->b_keyframe )
861 *i_cpb_delay += cur_frame->i_duration;
862 *i_coded_fields += cur_frame->i_duration;
863 cur_frame->i_cpb_duration = cur_frame->i_duration;
866 static void x264_vbv_lookahead( x264_t *h, x264_mb_analysis_t *a, x264_frame_t **frames, int num_frames, int keyframe )
868 int last_nonb = 0, cur_nonb = 1, idx = 0;
869 x264_frame_t *prev_frame = NULL;
870 int prev_frame_idx = 0;
871 while( cur_nonb < num_frames && frames[cur_nonb]->i_type == X264_TYPE_B )
873 int next_nonb = keyframe ? last_nonb : cur_nonb;
875 if( frames[cur_nonb]->i_coded_fields_lookahead >= 0 )
877 h->i_coded_fields_lookahead = frames[cur_nonb]->i_coded_fields_lookahead;
878 h->i_cpb_delay_lookahead = frames[cur_nonb]->i_cpb_delay_lookahead;
881 while( cur_nonb < num_frames )
883 /* P/I cost: This shouldn't include the cost of next_nonb */
884 if( next_nonb != cur_nonb )
886 int p0 = IS_X264_TYPE_I( frames[cur_nonb]->i_type ) ? cur_nonb : last_nonb;
887 frames[next_nonb]->i_planned_satd[idx] = x264_vbv_frame_cost( h, a, frames, p0, cur_nonb, cur_nonb );
888 frames[next_nonb]->i_planned_type[idx] = frames[cur_nonb]->i_type;
889 frames[cur_nonb]->i_coded_fields_lookahead = h->i_coded_fields_lookahead;
890 frames[cur_nonb]->i_cpb_delay_lookahead = h->i_cpb_delay_lookahead;
891 x264_calculate_durations( h, frames[cur_nonb], prev_frame, &h->i_cpb_delay_lookahead, &h->i_coded_fields_lookahead );
894 frames[next_nonb]->f_planned_cpb_duration[prev_frame_idx] = (double)prev_frame->i_cpb_duration *
895 h->sps->vui.i_num_units_in_tick / h->sps->vui.i_time_scale;
897 frames[next_nonb]->f_planned_cpb_duration[idx] = (double)frames[cur_nonb]->i_cpb_duration *
898 h->sps->vui.i_num_units_in_tick / h->sps->vui.i_time_scale;
899 prev_frame = frames[cur_nonb];
900 prev_frame_idx = idx;
903 /* Handle the B-frames: coded order */
904 for( int i = last_nonb+1; i < cur_nonb; i++, idx++ )
906 frames[next_nonb]->i_planned_satd[idx] = x264_vbv_frame_cost( h, a, frames, last_nonb, cur_nonb, i );
907 frames[next_nonb]->i_planned_type[idx] = X264_TYPE_B;
908 frames[i]->i_coded_fields_lookahead = h->i_coded_fields_lookahead;
909 frames[i]->i_cpb_delay_lookahead = h->i_cpb_delay_lookahead;
910 x264_calculate_durations( h, frames[i], prev_frame, &h->i_cpb_delay_lookahead, &h->i_coded_fields_lookahead );
913 frames[next_nonb]->f_planned_cpb_duration[prev_frame_idx] = (double)prev_frame->i_cpb_duration *
914 h->sps->vui.i_num_units_in_tick / h->sps->vui.i_time_scale;
916 frames[next_nonb]->f_planned_cpb_duration[idx] = (double)frames[i]->i_cpb_duration *
917 h->sps->vui.i_num_units_in_tick / h->sps->vui.i_time_scale;
918 prev_frame = frames[i];
919 prev_frame_idx = idx;
921 last_nonb = cur_nonb;
923 while( cur_nonb <= num_frames && frames[cur_nonb]->i_type == X264_TYPE_B )
926 frames[next_nonb]->i_planned_type[idx] = X264_TYPE_AUTO;
929 static int x264_slicetype_path_cost( x264_t *h, x264_mb_analysis_t *a, x264_frame_t **frames, char *path, int threshold )
934 path--; /* Since the 1st path element is really the second frame */
938 /* Find the location of the next P-frame. */
939 while( path[next_p] != 'P' )
942 /* Add the cost of the P-frame found above */
943 cost += x264_slicetype_frame_cost( h, a, frames, cur_p, next_p, next_p, 0 );
944 /* Early terminate if the cost we have found is larger than the best path cost so far */
945 if( cost > threshold )
948 if( h->param.i_bframe_pyramid && next_p - cur_p > 2 )
950 int middle = cur_p + (next_p - cur_p)/2;
951 cost += x264_slicetype_frame_cost( h, a, frames, cur_p, next_p, middle, 0 );
952 for( int next_b = loc; next_b < middle && cost < threshold; next_b++ )
953 cost += x264_slicetype_frame_cost( h, a, frames, cur_p, middle, next_b, 0 );
954 for( int next_b = middle+1; next_b < next_p && cost < threshold; next_b++ )
955 cost += x264_slicetype_frame_cost( h, a, frames, middle, next_p, next_b, 0 );
958 for( int next_b = loc; next_b < next_p && cost < threshold; next_b++ )
959 cost += x264_slicetype_frame_cost( h, a, frames, cur_p, next_p, next_b, 0 );
967 /* Viterbi/trellis slicetype decision algorithm. */
968 /* Uses strings due to the fact that the speed of the control functions is
969 negligible compared to the cost of running slicetype_frame_cost, and because
970 it makes debugging easier. */
971 static void x264_slicetype_path( x264_t *h, x264_mb_analysis_t *a, x264_frame_t **frames, int length, char (*best_paths)[X264_LOOKAHEAD_MAX] )
973 char paths[2][X264_LOOKAHEAD_MAX];
974 int num_paths = X264_MIN( h->param.i_bframe+1, length );
975 int best_cost = COST_MAX;
978 /* Iterate over all currently possible paths */
979 for( int path = 0; path < num_paths; path++ )
981 /* Add suffixes to the current path */
982 int len = length - (path + 1);
983 memcpy( paths[idx], best_paths[len % (X264_BFRAME_MAX+1)], len );
984 memset( paths[idx]+len, 'B', path );
985 strcpy( paths[idx]+len+path, "P" );
987 /* Calculate the actual cost of the current path */
988 int cost = x264_slicetype_path_cost( h, a, frames, paths[idx], best_cost );
989 if( cost < best_cost )
996 /* Store the best path. */
997 memcpy( best_paths[length % (X264_BFRAME_MAX+1)], paths[idx^1], length );
1000 static int scenecut_internal( x264_t *h, x264_mb_analysis_t *a, x264_frame_t **frames, int p0, int p1, int print )
1002 x264_frame_t *frame = frames[p1];
1003 x264_slicetype_frame_cost( h, a, frames, p0, p1, p1, 0 );
1005 int icost = frame->i_cost_est[0][0];
1006 int pcost = frame->i_cost_est[p1-p0][0];
1008 int i_gop_size = frame->i_frame - h->lookahead->i_last_keyframe;
1009 float f_thresh_max = h->param.i_scenecut_threshold / 100.0;
1010 /* magic numbers pulled out of thin air */
1011 float f_thresh_min = f_thresh_max * h->param.i_keyint_min
1012 / ( h->param.i_keyint_max * 4 );
1015 if( h->param.i_keyint_min == h->param.i_keyint_max )
1016 f_thresh_min= f_thresh_max;
1017 if( i_gop_size < h->param.i_keyint_min / 4 || h->param.b_intra_refresh )
1018 f_bias = f_thresh_min / 4;
1019 else if( i_gop_size <= h->param.i_keyint_min )
1020 f_bias = f_thresh_min * i_gop_size / h->param.i_keyint_min;
1023 f_bias = f_thresh_min
1024 + ( f_thresh_max - f_thresh_min )
1025 * ( i_gop_size - h->param.i_keyint_min )
1026 / ( h->param.i_keyint_max - h->param.i_keyint_min ) ;
1029 res = pcost >= (1.0 - f_bias) * icost;
1032 int imb = frame->i_intra_mbs[p1-p0];
1033 int pmb = NUM_MBS - imb;
1034 x264_log( h, X264_LOG_DEBUG, "scene cut at %d Icost:%d Pcost:%d ratio:%.4f bias:%.4f gop:%d (imb:%d pmb:%d)\n",
1036 icost, pcost, 1. - (double)pcost / icost,
1037 f_bias, i_gop_size, imb, pmb );
1042 static int scenecut( x264_t *h, x264_mb_analysis_t *a, x264_frame_t **frames, int p0, int p1, int real_scenecut, int num_frames )
1044 /* Only do analysis during a normal scenecut check. */
1045 if( real_scenecut && h->param.i_bframe )
1048 /* Look ahead to avoid coding short flashes as scenecuts. */
1049 if( h->param.i_bframe_adaptive == X264_B_ADAPT_TRELLIS )
1050 /* Don't analyse any more frames than the trellis would have covered. */
1051 maxp1 += h->param.i_bframe;
1054 maxp1 = X264_MIN( maxp1, num_frames );
1056 /* Where A and B are scenes: AAAAAABBBAAAAAA
1057 * If BBB is shorter than (maxp1-p0), it is detected as a flash
1058 * and not considered a scenecut. */
1059 for( int curp1 = p1; curp1 <= maxp1; curp1++ )
1060 if( !scenecut_internal( h, a, frames, p0, curp1, 0 ) )
1061 /* Any frame in between p0 and cur_p1 cannot be a real scenecut. */
1062 for( int i = curp1; i > p0; i-- )
1063 frames[i]->b_scenecut = 0;
1065 /* Where A-F are scenes: AAAAABBCCDDEEFFFFFF
1066 * If each of BB ... EE are shorter than (maxp1-p0), they are
1067 * detected as flashes and not considered scenecuts.
1068 * Instead, the first F frame becomes a scenecut. */
1069 for( int curp0 = p0; curp0 < maxp1; curp0++ )
1070 if( scenecut_internal( h, a, frames, curp0, maxp1, 0 ) )
1071 /* If cur_p0 is the p0 of a scenecut, it cannot be the p1 of a scenecut. */
1072 frames[curp0]->b_scenecut = 0;
1075 /* Ignore frames that are part of a flash, i.e. cannot be real scenecuts. */
1076 if( !frames[p1]->b_scenecut )
1078 return scenecut_internal( h, a, frames, p0, p1, real_scenecut );
1081 void x264_slicetype_analyse( x264_t *h, int keyframe )
1083 x264_mb_analysis_t a;
1084 x264_frame_t *frames[X264_LOOKAHEAD_MAX+3] = { NULL, };
1085 int num_frames, orig_num_frames, keyint_limit, framecnt;
1086 int i_mb_count = NUM_MBS;
1087 int cost1p0, cost2p0, cost1b1, cost2p1;
1088 int i_max_search = X264_MIN( h->lookahead->next.i_size, X264_LOOKAHEAD_MAX );
1089 int vbv_lookahead = h->param.rc.i_vbv_buffer_size && h->param.rc.i_lookahead;
1090 if( h->param.b_deterministic )
1091 i_max_search = X264_MIN( i_max_search, h->lookahead->i_slicetype_length + !keyframe );
1093 assert( h->frames.b_have_lowres );
1095 if( !h->lookahead->last_nonb )
1097 frames[0] = h->lookahead->last_nonb;
1098 for( framecnt = 0; framecnt < i_max_search && h->lookahead->next.list[framecnt]->i_type == X264_TYPE_AUTO; framecnt++ )
1099 frames[framecnt+1] = h->lookahead->next.list[framecnt];
1103 if( h->param.rc.b_mb_tree )
1104 x264_macroblock_tree( h, &a, frames, 0, keyframe );
1108 keyint_limit = h->param.i_keyint_max - frames[0]->i_frame + h->lookahead->i_last_keyframe - 1;
1109 orig_num_frames = num_frames = h->param.b_intra_refresh ? framecnt : X264_MIN( framecnt, keyint_limit );
1111 x264_lowres_context_init( h, &a );
1113 /* This is important psy-wise: if we have a non-scenecut keyframe,
1114 * there will be significant visual artifacts if the frames just before
1115 * go down in quality due to being referenced less, despite it being
1116 * more RD-optimal. */
1117 if( (h->param.analyse.b_psy && h->param.rc.b_mb_tree) || vbv_lookahead )
1118 num_frames = framecnt;
1119 else if( num_frames == 0 )
1121 frames[1]->i_type = X264_TYPE_I;
1125 int num_bframes = 0;
1126 int num_analysed_frames = num_frames;
1128 if( h->param.i_scenecut_threshold && scenecut( h, &a, frames, 0, 1, 1, orig_num_frames ) )
1130 frames[1]->i_type = X264_TYPE_I;
1134 if( h->param.i_bframe )
1136 if( h->param.i_bframe_adaptive == X264_B_ADAPT_TRELLIS )
1138 if( num_frames > 1 )
1140 char best_paths[X264_BFRAME_MAX+1][X264_LOOKAHEAD_MAX] = {"","P"};
1141 int best_path_index = (num_frames-1) % (X264_BFRAME_MAX+1);
1143 /* Perform the frametype analysis. */
1144 for( int j = 2; j < num_frames; j++ )
1145 x264_slicetype_path( h, &a, frames, j, best_paths );
1147 num_bframes = strspn( best_paths[best_path_index], "B" );
1148 /* Load the results of the analysis into the frame types. */
1149 for( int j = 1; j < num_frames; j++ )
1150 frames[j]->i_type = best_paths[best_path_index][j-1] == 'B' ? X264_TYPE_B : X264_TYPE_P;
1152 frames[num_frames]->i_type = X264_TYPE_P;
1154 else if( h->param.i_bframe_adaptive == X264_B_ADAPT_FAST )
1156 for( int i = 0; i <= num_frames-2; )
1158 cost2p1 = x264_slicetype_frame_cost( h, &a, frames, i+0, i+2, i+2, 1 );
1159 if( frames[i+2]->i_intra_mbs[2] > i_mb_count / 2 )
1161 frames[i+1]->i_type = X264_TYPE_P;
1162 frames[i+2]->i_type = X264_TYPE_P;
1167 cost1b1 = x264_slicetype_frame_cost( h, &a, frames, i+0, i+2, i+1, 0 );
1168 cost1p0 = x264_slicetype_frame_cost( h, &a, frames, i+0, i+1, i+1, 0 );
1169 cost2p0 = x264_slicetype_frame_cost( h, &a, frames, i+1, i+2, i+2, 0 );
1171 if( cost1p0 + cost2p0 < cost1b1 + cost2p1 )
1173 frames[i+1]->i_type = X264_TYPE_P;
1178 // arbitrary and untuned
1179 #define INTER_THRESH 300
1180 #define P_SENS_BIAS (50 - h->param.i_bframe_bias)
1181 frames[i+1]->i_type = X264_TYPE_B;
1184 for( j = i+2; j <= X264_MIN( i+h->param.i_bframe, num_frames-1 ); j++ )
1186 int pthresh = X264_MAX(INTER_THRESH - P_SENS_BIAS * (j-i-1), INTER_THRESH/10);
1187 int pcost = x264_slicetype_frame_cost( h, &a, frames, i+0, j+1, j+1, 1 );
1188 if( pcost > pthresh*i_mb_count || frames[j+1]->i_intra_mbs[j-i+1] > i_mb_count/3 )
1190 frames[j]->i_type = X264_TYPE_B;
1192 frames[j]->i_type = X264_TYPE_P;
1195 frames[num_frames]->i_type = X264_TYPE_P;
1197 while( num_bframes < num_frames && frames[num_bframes+1]->i_type == X264_TYPE_B )
1202 num_bframes = X264_MIN(num_frames-1, h->param.i_bframe);
1203 for( int j = 1; j < num_frames; j++ )
1204 frames[j]->i_type = (j%(num_bframes+1)) ? X264_TYPE_B : X264_TYPE_P;
1205 frames[num_frames]->i_type = X264_TYPE_P;
1208 /* Check scenecut on the first minigop. */
1209 for( int j = 1; j < num_bframes+1; j++ )
1210 if( h->param.i_scenecut_threshold && scenecut( h, &a, frames, j, j+1, 0, orig_num_frames ) )
1212 frames[j]->i_type = X264_TYPE_P;
1213 num_analysed_frames = j;
1217 reset_start = keyframe ? 1 : X264_MIN( num_bframes+2, num_analysed_frames+1 );
1221 for( int j = 1; j <= num_frames; j++ )
1222 frames[j]->i_type = X264_TYPE_P;
1223 reset_start = !keyframe + 1;
1227 /* Perform the actual macroblock tree analysis.
1228 * Don't go farther than the maximum keyframe interval; this helps in short GOPs. */
1229 if( h->param.rc.b_mb_tree )
1230 x264_macroblock_tree( h, &a, frames, X264_MIN(num_frames, h->param.i_keyint_max), keyframe );
1232 /* Enforce keyframe limit. */
1233 if( !h->param.b_intra_refresh )
1234 for( int i = keyint_limit+1; i <= num_frames; i += h->param.i_keyint_max )
1236 frames[i]->i_type = X264_TYPE_I;
1237 reset_start = X264_MIN( reset_start, i+1 );
1238 if( h->param.i_open_gop == X264_OPEN_GOP_BLURAY )
1239 while( IS_X264_TYPE_B( frames[i-1]->i_type ) )
1244 x264_vbv_lookahead( h, &a, frames, num_frames, keyframe );
1246 /* Restore frametypes for all frames that haven't actually been decided yet. */
1247 for( int j = reset_start; j <= num_frames; j++ )
1248 frames[j]->i_type = X264_TYPE_AUTO;
1251 void x264_slicetype_decide( x264_t *h )
1253 x264_frame_t *frames[X264_BFRAME_MAX+2];
1258 if( !h->lookahead->next.i_size )
1261 int lookahead_size = h->lookahead->next.i_size;
1263 if( h->param.rc.i_rc_method == X264_RC_ABR || h->param.rc.b_stat_write || h->param.rc.i_vbv_buffer_size )
1265 for( int i = 0; i < h->lookahead->next.i_size; i++ )
1267 if( h->param.b_vfr_input )
1269 if( lookahead_size-- > 1 )
1270 h->lookahead->next.list[i]->i_duration = 2 * (h->lookahead->next.list[i+1]->i_pts - h->lookahead->next.list[i]->i_pts);
1272 h->lookahead->next.list[i]->i_duration = h->i_prev_duration;
1275 h->lookahead->next.list[i]->i_duration = delta_tfi_divisor[h->lookahead->next.list[i]->i_pic_struct];
1276 h->i_prev_duration = h->lookahead->next.list[i]->i_duration;
1278 if( h->lookahead->next.list[i]->i_frame > h->i_disp_fields_last_frame && lookahead_size > 0 )
1280 h->lookahead->next.list[i]->i_field_cnt = h->i_disp_fields;
1281 h->i_disp_fields += h->lookahead->next.list[i]->i_duration;
1282 h->i_disp_fields_last_frame = h->lookahead->next.list[i]->i_frame;
1284 else if( lookahead_size == 0 )
1286 h->lookahead->next.list[i]->i_field_cnt = h->i_disp_fields;
1287 h->lookahead->next.list[i]->i_duration = h->i_prev_duration;
1292 if( h->param.rc.b_stat_read )
1294 /* Use the frame types from the first pass */
1295 for( int i = 0; i < h->lookahead->next.i_size; i++ )
1296 h->lookahead->next.list[i]->i_type =
1297 x264_ratecontrol_slice_type( h, h->lookahead->next.list[i]->i_frame );
1299 else if( (h->param.i_bframe && h->param.i_bframe_adaptive)
1300 || h->param.i_scenecut_threshold
1301 || h->param.rc.b_mb_tree
1302 || (h->param.rc.i_vbv_buffer_size && h->param.rc.i_lookahead) )
1303 x264_slicetype_analyse( h, 0 );
1305 for( bframes = 0, brefs = 0;; bframes++ )
1307 frm = h->lookahead->next.list[bframes];
1308 if( frm->i_type == X264_TYPE_BREF && h->param.i_bframe_pyramid < X264_B_PYRAMID_NORMAL &&
1309 brefs == h->param.i_bframe_pyramid )
1311 frm->i_type = X264_TYPE_B;
1312 x264_log( h, X264_LOG_WARNING, "B-ref at frame %d incompatible with B-pyramid %s \n",
1313 frm->i_frame, x264_b_pyramid_names[h->param.i_bframe_pyramid] );
1315 /* pyramid with multiple B-refs needs a big enough dpb that the preceding P-frame stays available.
1316 smaller dpb could be supported by smart enough use of mmco, but it's easier just to forbid it. */
1317 else if( frm->i_type == X264_TYPE_BREF && h->param.i_bframe_pyramid == X264_B_PYRAMID_NORMAL &&
1318 brefs && h->param.i_frame_reference <= (brefs+3) )
1320 frm->i_type = X264_TYPE_B;
1321 x264_log( h, X264_LOG_WARNING, "B-ref at frame %d incompatible with B-pyramid %s and %d reference frames\n",
1322 frm->i_frame, x264_b_pyramid_names[h->param.i_bframe_pyramid], h->param.i_frame_reference );
1325 if( frm->i_type == X264_TYPE_KEYFRAME )
1326 frm->i_type = h->param.i_open_gop ? X264_TYPE_I : X264_TYPE_IDR;
1328 /* Limit GOP size */
1329 if( (!h->param.b_intra_refresh || frm->i_frame == 0) && frm->i_frame - h->lookahead->i_last_keyframe >= h->param.i_keyint_max )
1331 if( frm->i_type == X264_TYPE_AUTO || frm->i_type == X264_TYPE_I )
1332 frm->i_type = h->param.i_open_gop && h->lookahead->i_last_keyframe >= 0 ? X264_TYPE_I : X264_TYPE_IDR;
1333 int warn = frm->i_type != X264_TYPE_IDR;
1334 if( warn && h->param.i_open_gop )
1335 warn &= frm->i_type != X264_TYPE_I;
1337 x264_log( h, X264_LOG_WARNING, "specified frame type (%d) at %d is not compatible with keyframe interval\n", frm->i_type, frm->i_frame );
1339 if( frm->i_type == X264_TYPE_I && frm->i_frame - h->lookahead->i_last_keyframe >= h->param.i_keyint_min )
1341 if( h->param.i_open_gop )
1343 h->lookahead->i_last_keyframe = frm->i_frame; // Use display order
1344 if( h->param.i_open_gop == X264_OPEN_GOP_BLURAY )
1345 h->lookahead->i_last_keyframe -= bframes; // Use bluray order
1346 frm->b_keyframe = 1;
1349 frm->i_type = X264_TYPE_IDR;
1351 if( frm->i_type == X264_TYPE_IDR )
1354 h->lookahead->i_last_keyframe = frm->i_frame;
1355 frm->b_keyframe = 1;
1359 h->lookahead->next.list[bframes]->i_type = X264_TYPE_P;
1363 if( bframes == h->param.i_bframe ||
1364 !h->lookahead->next.list[bframes+1] )
1366 if( IS_X264_TYPE_B( frm->i_type ) )
1367 x264_log( h, X264_LOG_WARNING, "specified frame type is not compatible with max B-frames\n" );
1368 if( frm->i_type == X264_TYPE_AUTO
1369 || IS_X264_TYPE_B( frm->i_type ) )
1370 frm->i_type = X264_TYPE_P;
1373 if( frm->i_type == X264_TYPE_BREF )
1376 if( frm->i_type == X264_TYPE_AUTO )
1377 frm->i_type = X264_TYPE_B;
1379 else if( !IS_X264_TYPE_B( frm->i_type ) ) break;
1383 h->lookahead->next.list[bframes-1]->b_last_minigop_bframe = 1;
1384 h->lookahead->next.list[bframes]->i_bframes = bframes;
1386 /* insert a bref into the sequence */
1387 if( h->param.i_bframe_pyramid && bframes > 1 && !brefs )
1389 h->lookahead->next.list[bframes/2]->i_type = X264_TYPE_BREF;
1393 /* calculate the frame costs ahead of time for x264_rc_analyse_slice while we still have lowres */
1394 if( h->param.rc.i_rc_method != X264_RC_CQP )
1396 x264_mb_analysis_t a;
1398 p1 = b = bframes + 1;
1400 x264_lowres_context_init( h, &a );
1402 frames[0] = h->lookahead->last_nonb;
1403 memcpy( &frames[1], h->lookahead->next.list, (bframes+1) * sizeof(x264_frame_t*) );
1404 if( IS_X264_TYPE_I( h->lookahead->next.list[bframes]->i_type ) )
1409 x264_slicetype_frame_cost( h, &a, frames, p0, p1, b, 0 );
1411 if( (p0 != p1 || bframes) && h->param.rc.i_vbv_buffer_size )
1413 /* We need the intra costs for row SATDs. */
1414 x264_slicetype_frame_cost( h, &a, frames, b, b, b, 0 );
1416 /* We need B-frame costs for row SATDs. */
1418 for( b = 1; b <= bframes; b++ )
1420 if( frames[b]->i_type == X264_TYPE_B )
1421 for( p1 = b; frames[p1]->i_type == X264_TYPE_B; )
1425 x264_slicetype_frame_cost( h, &a, frames, p0, p1, b, 0 );
1426 if( frames[b]->i_type == X264_TYPE_BREF )
1432 /* Analyse for weighted P frames */
1433 if( !h->param.rc.b_stat_read && h->lookahead->next.list[bframes]->i_type == X264_TYPE_P
1434 && h->param.analyse.i_weighted_pred == X264_WEIGHTP_SMART )
1437 x264_weights_analyse( h, h->lookahead->next.list[bframes], h->lookahead->last_nonb, 0 );
1440 /* shift sequence to coded order.
1441 use a small temporary list to avoid shifting the entire next buffer around */
1442 int i_coded = h->lookahead->next.list[0]->i_frame;
1445 int idx_list[] = { brefs+1, 1 };
1446 for( int i = 0; i < bframes; i++ )
1448 int idx = idx_list[h->lookahead->next.list[i]->i_type == X264_TYPE_BREF]++;
1449 frames[idx] = h->lookahead->next.list[i];
1450 frames[idx]->i_reordered_pts = h->lookahead->next.list[idx]->i_pts;
1452 frames[0] = h->lookahead->next.list[bframes];
1453 frames[0]->i_reordered_pts = h->lookahead->next.list[0]->i_pts;
1454 memcpy( h->lookahead->next.list, frames, (bframes+1) * sizeof(x264_frame_t*) );
1457 for( int i = 0; i <= bframes; i++ )
1459 h->lookahead->next.list[i]->i_coded = i_coded++;
1460 if( h->param.rc.i_rc_method == X264_RC_ABR || h->param.rc.b_stat_write || h->param.rc.i_vbv_buffer_size )
1464 x264_calculate_durations( h, h->lookahead->next.list[i], h->lookahead->next.list[i-1], &h->i_cpb_delay, &h->i_coded_fields );
1465 h->lookahead->next.list[0]->f_planned_cpb_duration[i-1] = (double)h->lookahead->next.list[i-1]->i_cpb_duration *
1466 h->sps->vui.i_num_units_in_tick / h->sps->vui.i_time_scale;
1469 x264_calculate_durations( h, h->lookahead->next.list[i], NULL, &h->i_cpb_delay, &h->i_coded_fields );
1471 h->lookahead->next.list[0]->f_planned_cpb_duration[i] = (double)h->lookahead->next.list[i]->i_cpb_duration *
1472 h->sps->vui.i_num_units_in_tick / h->sps->vui.i_time_scale;
1477 int x264_rc_analyse_slice( x264_t *h )
1483 if( IS_X264_TYPE_I(h->fenc->i_type) )
1485 else if( h->fenc->i_type == X264_TYPE_P )
1486 p1 = b = h->fenc->i_bframes + 1;
1489 p1 = (h->fref1[0]->i_poc - h->fref0[0]->i_poc)/2;
1490 b = (h->fenc->i_poc - h->fref0[0]->i_poc)/2;
1492 /* We don't need to assign p0/p1 since we are not performing any real analysis here. */
1493 x264_frame_t **frames = &h->fenc - b;
1495 /* cost should have been already calculated by x264_slicetype_decide */
1496 cost = frames[b]->i_cost_est[b-p0][p1-b];
1497 assert( cost >= 0 );
1499 if( h->param.rc.b_mb_tree && !h->param.rc.b_stat_read )
1501 cost = x264_slicetype_frame_cost_recalculate( h, frames, p0, p1, b );
1502 if( b && h->param.rc.i_vbv_buffer_size )
1503 x264_slicetype_frame_cost_recalculate( h, frames, b, b, b );
1505 /* In AQ, use the weighted score instead. */
1506 else if( h->param.rc.i_aq_mode )
1507 cost = frames[b]->i_cost_est_aq[b-p0][p1-b];
1509 h->fenc->i_row_satd = h->fenc->i_row_satds[b-p0][p1-b];
1510 h->fdec->i_row_satd = h->fdec->i_row_satds[b-p0][p1-b];
1511 h->fdec->i_satd = cost;
1512 memcpy( h->fdec->i_row_satd, h->fenc->i_row_satd, h->mb.i_mb_height * sizeof(int) );
1513 if( !IS_X264_TYPE_I(h->fenc->i_type) )
1514 memcpy( h->fdec->i_row_satds[0][0], h->fenc->i_row_satds[0][0], h->mb.i_mb_height * sizeof(int) );
1516 if( h->param.b_intra_refresh && h->param.rc.i_vbv_buffer_size && h->fenc->i_type == X264_TYPE_P )
1518 int ip_factor = 256 * h->param.rc.f_ip_factor; /* fix8 */
1519 for( int y = 0; y < h->mb.i_mb_height; y++ )
1521 int mb_xy = y * h->mb.i_mb_stride;
1522 for( int x = h->fdec->i_pir_start_col; x <= h->fdec->i_pir_end_col; x++, mb_xy++ )
1524 int intra_cost = (h->fenc->i_intra_cost[mb_xy] * ip_factor + 128) >> 8;
1525 int inter_cost = h->fenc->lowres_costs[b-p0][p1-b][mb_xy] & LOWRES_COST_MASK;
1526 int diff = intra_cost - inter_cost;
1527 if( h->param.rc.i_aq_mode )
1528 h->fdec->i_row_satd[y] += (diff * frames[b]->i_inv_qscale_factor[mb_xy] + 128) >> 8;
1530 h->fdec->i_row_satd[y] += diff;