1 /*****************************************************************************
2 * slicetype.c: h264 encoder library
3 *****************************************************************************
4 * Copyright (C) 2005-2008 Loren Merritt <lorenm@u.washington.edu>
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111, USA.
19 *****************************************************************************/
24 #include "common/common.h"
25 #include "common/cpu.h"
26 #include "macroblock.h"
30 static void x264_lowres_context_init( x264_t *h, x264_mb_analysis_t *a )
32 a->i_qp = 12; // arbitrary, but low because SATD scores are 1/4 normal
33 a->i_lambda = x264_lambda_tab[ a->i_qp ];
34 x264_mb_analyse_load_costs( h, a );
35 h->mb.i_me_method = X264_MIN( X264_ME_HEX, h->param.analyse.i_me_method ); // maybe dia?
36 h->mb.i_subpel_refine = 4; // 3 should be enough, but not tweaking for speed now
37 h->mb.b_chroma_me = 0;
40 static int x264_slicetype_mb_cost( x264_t *h, x264_mb_analysis_t *a,
41 x264_frame_t **frames, int p0, int p1, int b,
42 int dist_scale_factor, int do_search[2] )
44 x264_frame_t *fref0 = frames[p0];
45 x264_frame_t *fref1 = frames[p1];
46 x264_frame_t *fenc = frames[b];
47 const int b_bidir = (b < p1);
48 const int i_mb_x = h->mb.i_mb_x;
49 const int i_mb_y = h->mb.i_mb_y;
50 const int i_mb_stride = h->sps->i_mb_width;
51 const int i_mb_xy = i_mb_x + i_mb_y * i_mb_stride;
52 const int i_stride = fenc->i_stride_lowres;
53 const int i_pel_offset = 8 * ( i_mb_x + i_mb_y * i_stride );
54 const int i_bipred_weight = h->param.analyse.b_weighted_bipred ? 64 - (dist_scale_factor>>2) : 32;
55 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] };
56 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] };
58 DECLARE_ALIGNED_8( uint8_t pix1[9*FDEC_STRIDE] );
59 uint8_t *pix2 = pix1+8;
61 int i_bcost = COST_MAX;
65 h->mb.pic.p_fenc[0] = h->mb.pic.fenc_buf;
66 h->mc.copy[PIXEL_8x8]( h->mb.pic.p_fenc[0], FENC_STRIDE, &fenc->lowres[0][i_pel_offset], i_stride, 8 );
68 if( !p0 && !p1 && !b )
71 // no need for h->mb.mv_min[]
72 h->mb.mv_min_fpel[0] = -8*h->mb.i_mb_x - 4;
73 h->mb.mv_max_fpel[0] = 8*( h->sps->i_mb_width - h->mb.i_mb_x - 1 ) + 4;
74 h->mb.mv_min_spel[0] = 4*( h->mb.mv_min_fpel[0] - 8 );
75 h->mb.mv_max_spel[0] = 4*( h->mb.mv_max_fpel[0] + 8 );
76 h->mb.mv_min_fpel[1] = -8*h->mb.i_mb_y - 4;
77 h->mb.mv_max_fpel[1] = 8*( h->sps->i_mb_height - h->mb.i_mb_y - 1 ) + 4;
78 h->mb.mv_min_spel[1] = 4*( h->mb.mv_min_fpel[1] - 8 );
79 h->mb.mv_max_spel[1] = 4*( h->mb.mv_max_fpel[1] + 8 );
81 #define LOAD_HPELS_LUMA(dst, src) \
83 (dst)[0] = &(src)[0][i_pel_offset]; \
84 (dst)[1] = &(src)[1][i_pel_offset]; \
85 (dst)[2] = &(src)[2][i_pel_offset]; \
86 (dst)[3] = &(src)[3][i_pel_offset]; \
88 #define CLIP_MV( mv ) \
90 mv[0] = x264_clip3( mv[0], h->mb.mv_min_spel[0], h->mb.mv_max_spel[0] ); \
91 mv[1] = x264_clip3( mv[1], h->mb.mv_min_spel[1], h->mb.mv_max_spel[1] ); \
93 #define TRY_BIDIR( mv0, mv1, penalty ) \
95 int stride1 = 16, stride2 = 16; \
96 uint8_t *src1, *src2; \
98 src1 = h->mc.get_ref( pix1, &stride1, m[0].p_fref, m[0].i_stride[0], \
99 (mv0)[0], (mv0)[1], 8, 8 ); \
100 src2 = h->mc.get_ref( pix2, &stride2, m[1].p_fref, m[1].i_stride[0], \
101 (mv1)[0], (mv1)[1], 8, 8 ); \
102 h->mc.avg[PIXEL_8x8]( pix1, 16, src1, stride1, src2, stride2, i_bipred_weight ); \
103 i_cost = penalty + h->pixf.mbcmp[PIXEL_8x8]( \
104 m[0].p_fenc[0], FENC_STRIDE, pix1, 16 ); \
105 if( i_bcost > i_cost ) \
109 m[0].i_pixel = PIXEL_8x8;
110 m[0].p_cost_mv = a->p_cost_mv;
111 m[0].i_stride[0] = i_stride;
112 m[0].p_fenc[0] = h->mb.pic.p_fenc[0];
113 LOAD_HPELS_LUMA( m[0].p_fref, fref0->lowres );
117 int16_t *mvr = fref1->lowres_mvs[0][p1-p0-1][i_mb_xy];
121 h->mc.memcpy_aligned( &m[1], &m[0], sizeof(x264_me_t) );
122 LOAD_HPELS_LUMA( m[1].p_fref, fref1->lowres );
124 dmv[0][0] = ( mvr[0] * dist_scale_factor + 128 ) >> 8;
125 dmv[0][1] = ( mvr[1] * dist_scale_factor + 128 ) >> 8;
126 dmv[1][0] = dmv[0][0] - mvr[0];
127 dmv[1][1] = dmv[0][1] - mvr[1];
131 TRY_BIDIR( dmv[0], dmv[1], 0 );
132 if( dmv[0][0] | dmv[0][1] | dmv[1][0] | dmv[1][1] )
133 TRY_BIDIR( mv0, mv0, 0 );
134 // if( i_bcost < 60 ) // arbitrary threshold
138 i_cost_bak = i_bcost;
139 for( l = 0; l < 1 + b_bidir; l++ )
141 DECLARE_ALIGNED_4(int16_t mvc[4][2]) = {{0}};
143 int16_t (*fenc_mv)[2] = fenc_mvs[l];
147 /* Reverse-order MV prediction. */
148 #define MVC(mv) { *(uint32_t*)mvc[i_mvc] = *(uint32_t*)mv; i_mvc++; }
149 if( i_mb_x < h->sps->i_mb_width - 1 )
151 if( i_mb_y < h->sps->i_mb_height - 1 )
153 MVC(fenc_mv[i_mb_stride]);
155 MVC(fenc_mv[i_mb_stride-1]);
156 if( i_mb_x < h->sps->i_mb_width - 1 )
157 MVC(fenc_mv[i_mb_stride+1]);
160 x264_median_mv( m[l].mvp, mvc[0], mvc[1], mvc[2] );
161 x264_me_search( h, &m[l], mvc, i_mvc );
163 m[l].cost -= 2; // remove mvcost from skip mbs
164 if( *(uint32_t*)m[l].mv )
166 *(uint32_t*)fenc_mvs[l] = *(uint32_t*)m[l].mv;
167 *fenc_costs[l] = m[l].cost;
171 *(uint32_t*)m[l].mv = *(uint32_t*)fenc_mvs[l];
172 m[l].cost = *fenc_costs[l];
174 i_bcost = X264_MIN( i_bcost, m[l].cost );
177 if( b_bidir && ( *(uint32_t*)m[0].mv || *(uint32_t*)m[1].mv ) )
178 TRY_BIDIR( m[0].mv, m[1].mv, 5 );
181 /* forbid intra-mbs in B-frames, because it's rare and not worth checking */
182 /* FIXME: Should we still forbid them now that we cache intra scores? */
185 int i_icost, b_intra;
186 if( !fenc->b_intra_calculated )
188 DECLARE_ALIGNED_16( uint8_t edge[33] );
189 uint8_t *pix = &pix1[8+FDEC_STRIDE - 1];
190 uint8_t *src = &fenc->lowres[0][i_pel_offset - 1];
191 const int intra_penalty = 5;
194 memcpy( pix-FDEC_STRIDE, src-i_stride, 17 );
196 pix[i*FDEC_STRIDE] = src[i*i_stride];
199 if( h->pixf.intra_satd_x3_8x8c && h->pixf.mbcmp[0] == h->pixf.satd[0] )
201 h->pixf.intra_satd_x3_8x8c( h->mb.pic.p_fenc[0], pix, satds );
202 h->predict_8x8c[I_PRED_CHROMA_P]( pix );
203 satds[I_PRED_CHROMA_P] =
204 h->pixf.satd[PIXEL_8x8]( pix, FDEC_STRIDE, h->mb.pic.p_fenc[0], FENC_STRIDE );
210 h->predict_8x8c[i]( pix );
211 satds[i] = h->pixf.mbcmp[PIXEL_8x8]( pix, FDEC_STRIDE, h->mb.pic.p_fenc[0], FENC_STRIDE );
214 i_icost = X264_MIN4( satds[0], satds[1], satds[2], satds[3] );
216 x264_predict_8x8_filter( pix, edge, ALL_NEIGHBORS, ALL_NEIGHBORS );
220 h->predict_8x8[i]( pix, edge );
221 satd = h->pixf.mbcmp[PIXEL_8x8]( pix, FDEC_STRIDE, h->mb.pic.p_fenc[0], FENC_STRIDE );
222 i_icost = X264_MIN( i_icost, satd );
225 i_icost += intra_penalty;
226 fenc->i_intra_cost[i_mb_xy] = i_icost;
229 i_icost = fenc->i_intra_cost[i_mb_xy];
230 b_intra = i_icost < i_bcost;
233 if( i_mb_x > 0 && i_mb_x < h->sps->i_mb_width - 1
234 && i_mb_y > 0 && i_mb_y < h->sps->i_mb_height - 1 )
236 fenc->i_intra_mbs[b-p0] += b_intra;
237 fenc->i_cost_est[0][0] += i_icost;
246 (h->sps->i_mb_width > 2 && h->sps->i_mb_height > 2 ?\
247 (h->sps->i_mb_width - 2) * (h->sps->i_mb_height - 2) :\
248 h->sps->i_mb_width * h->sps->i_mb_height)
250 static int x264_slicetype_frame_cost( x264_t *h, x264_mb_analysis_t *a,
251 x264_frame_t **frames, int p0, int p1, int b,
252 int b_intra_penalty )
255 /* Don't use the AQ'd scores for slicetype decision. */
259 /* Check whether we already evaluated this frame
260 * If we have tried this frame as P, then we have also tried
261 * the preceding frames as B. (is this still true?) */
262 /* Also check that we already calculated the row SATDs for the current frame. */
263 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) )
265 i_score = frames[b]->i_cost_est[b-p0][p1-b];
269 int dist_scale_factor = 128;
270 int *row_satd = frames[b]->i_row_satds[b-p0][p1-b];
272 /* For each list, check to see whether we have lowres motion-searched this reference frame before. */
273 do_search[0] = b != p0 && frames[b]->lowres_mvs[0][b-p0-1][0][0] == 0x7FFF;
274 do_search[1] = b != p1 && frames[b]->lowres_mvs[1][p1-b-1][0][0] == 0x7FFF;
275 if( do_search[0] ) frames[b]->lowres_mvs[0][b-p0-1][0][0] = 0;
276 if( do_search[1] ) frames[b]->lowres_mvs[1][p1-b-1][0][0] = 0;
280 frames[b]->i_intra_mbs[b-p0] = 0;
281 frames[b]->i_cost_est[0][0] = 0;
284 dist_scale_factor = ( ((b-p0) << 8) + ((p1-p0) >> 1) ) / (p1-p0);
286 /* Lowres lookahead goes backwards because the MVs are used as predictors in the main encode. */
287 /* This considerably improves MV prediction overall. */
288 if( h->sps->i_mb_width <= 2 || h->sps->i_mb_height <= 2 )
290 for( h->mb.i_mb_y = h->sps->i_mb_height - 1; h->mb.i_mb_y >= 0 ; h->mb.i_mb_y-- )
291 for( h->mb.i_mb_x = h->sps->i_mb_width - 1; h->mb.i_mb_x >= 0 ; h->mb.i_mb_x-- )
292 i_score += x264_slicetype_mb_cost( h, a, frames, p0, p1, b, dist_scale_factor, do_search );
294 /* the edge mbs seem to reduce the predictive quality of the
295 * whole frame's score, but are needed for a spatial distribution. */
296 else if( h->param.rc.i_vbv_buffer_size )
298 for( h->mb.i_mb_y = h->sps->i_mb_height - 1; h->mb.i_mb_y >= 0; h->mb.i_mb_y-- )
300 row_satd[ h->mb.i_mb_y ] = 0;
301 for( h->mb.i_mb_x = h->sps->i_mb_width - 1; h->mb.i_mb_x >= 0; h->mb.i_mb_x-- )
303 int i_mb_cost = x264_slicetype_mb_cost( h, a, frames, p0, p1, b, dist_scale_factor, do_search );
304 int i_mb_cost_aq = i_mb_cost;
305 if( h->param.rc.i_aq_mode )
308 i_mb_cost_aq *= pow(2.0,-(frames[b]->f_qp_offset[h->mb.i_mb_x + h->mb.i_mb_y*h->mb.i_mb_stride])/6.0);
310 row_satd[ h->mb.i_mb_y ] += i_mb_cost_aq;
311 if( h->mb.i_mb_y > 0 && h->mb.i_mb_y < h->sps->i_mb_height - 1 &&
312 h->mb.i_mb_x > 0 && h->mb.i_mb_x < h->sps->i_mb_width - 1 )
314 /* Don't use AQ-weighted costs for slicetype decision, only for ratecontrol. */
315 i_score += i_mb_cost;
316 i_score_aq += i_mb_cost_aq;
323 for( h->mb.i_mb_y = h->sps->i_mb_height - 2; h->mb.i_mb_y > 0; h->mb.i_mb_y-- )
324 for( h->mb.i_mb_x = h->sps->i_mb_width - 2; h->mb.i_mb_x > 0; h->mb.i_mb_x-- )
326 int i_mb_cost = x264_slicetype_mb_cost( h, a, frames, p0, p1, b, dist_scale_factor, do_search );
327 int i_mb_cost_aq = i_mb_cost;
328 if( h->param.rc.i_aq_mode )
331 i_mb_cost_aq *= pow(2.0,-(frames[b]->f_qp_offset[h->mb.i_mb_x + h->mb.i_mb_y*h->mb.i_mb_stride])/6.0);
333 i_score += i_mb_cost;
334 i_score_aq += i_mb_cost_aq;
339 i_score = i_score * 100 / (120 + h->param.i_bframe_bias);
341 frames[b]->b_intra_calculated = 1;
343 frames[b]->i_cost_est[b-p0][p1-b] = i_score;
344 frames[b]->i_cost_est_aq[b-p0][p1-b] = i_score_aq;
348 if( b_intra_penalty )
350 // arbitrary penalty for I-blocks after B-frames
352 i_score += i_score * frames[b]->i_intra_mbs[b-p0] / (nmb * 8);
357 #define MAX_LENGTH (X264_BFRAME_MAX*4)
359 static int x264_slicetype_path_cost( x264_t *h, x264_mb_analysis_t *a, x264_frame_t **frames, char *path, int threshold )
364 path--; /* Since the 1st path element is really the second frame */
369 /* Find the location of the next P-frame. */
370 while( path[next_p] && path[next_p] != 'P' )
372 /* Return if the path doesn't end on a P-frame. */
373 if( path[next_p] != 'P' )
376 /* Add the cost of the P-frame found above */
377 cost += x264_slicetype_frame_cost( h, a, frames, cur_p, next_p, next_p, 0 );
378 /* Early terminate if the cost we have found is larger than the best path cost so far */
379 if( cost > threshold )
382 for( next_b = loc; next_b < next_p && cost < threshold; next_b++ )
383 cost += x264_slicetype_frame_cost( h, a, frames, cur_p, next_p, next_b, 0 );
391 /* Viterbi/trellis slicetype decision algorithm. */
392 /* Uses strings due to the fact that the speed of the control functions is
393 negligable compared to the cost of running slicetype_frame_cost, and because
394 it makes debugging easier. */
395 static void x264_slicetype_path( x264_t *h, x264_mb_analysis_t *a, x264_frame_t **frames, int length, int max_bframes, int buffer_size, char (*best_paths)[MAX_LENGTH] )
397 char paths[X264_BFRAME_MAX+2][MAX_LENGTH] = {{0}};
398 int num_paths = X264_MIN(max_bframes+1, length);
399 int suffix_size, loc, path;
400 int best_cost = COST_MAX;
401 int best_path_index = 0;
402 length = X264_MIN(length,MAX_LENGTH);
404 /* Iterate over all currently possible paths and add suffixes to each one */
405 for( suffix_size = 0; suffix_size < num_paths; suffix_size++ )
407 memcpy( paths[suffix_size], best_paths[length - (suffix_size + 1)], length - (suffix_size + 1) );
408 for( loc = 0; loc < suffix_size; loc++ )
409 strcat( paths[suffix_size], "B" );
410 strcat( paths[suffix_size], "P" );
413 /* Calculate the actual cost of each of the current paths */
414 for( path = 0; path < num_paths; path++ )
416 int cost = x264_slicetype_path_cost( h, a, frames, paths[path], best_cost );
417 if( cost < best_cost )
420 best_path_index = path;
424 /* Store the best path. */
425 memcpy( best_paths[length], paths[best_path_index], length );
428 static int x264_slicetype_path_search( x264_t *h, x264_mb_analysis_t *a, x264_frame_t **frames, int length, int bframes, int buffer )
430 char best_paths[MAX_LENGTH][MAX_LENGTH] = {"","P"};
432 for( n = 2; n < length-1; n++ )
433 x264_slicetype_path( h, a, frames, n, bframes, buffer, best_paths );
434 return strspn( best_paths[length-2], "B" );
437 static int scenecut( x264_t *h, x264_frame_t *frame, int pdist )
439 int icost = frame->i_cost_est[0][0];
440 int pcost = frame->i_cost_est[pdist][0];
442 int i_gop_size = frame->i_frame - h->frames.i_last_idr;
443 float f_thresh_max = h->param.i_scenecut_threshold / 100.0;
444 /* magic numbers pulled out of thin air */
445 float f_thresh_min = f_thresh_max * h->param.i_keyint_min
446 / ( h->param.i_keyint_max * 4 );
449 if( h->param.i_keyint_min == h->param.i_keyint_max )
450 f_thresh_min= f_thresh_max;
451 if( i_gop_size < h->param.i_keyint_min / 4 )
452 f_bias = f_thresh_min / 4;
453 else if( i_gop_size <= h->param.i_keyint_min )
454 f_bias = f_thresh_min * i_gop_size / h->param.i_keyint_min;
457 f_bias = f_thresh_min
458 + ( f_thresh_max - f_thresh_min )
459 * ( i_gop_size - h->param.i_keyint_min )
460 / ( h->param.i_keyint_max - h->param.i_keyint_min ) ;
463 res = pcost >= (1.0 - f_bias) * icost;
466 int imb = frame->i_intra_mbs[pdist];
467 int pmb = NUM_MBS - imb;
468 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",
470 icost, pcost, 1. - (double)pcost / icost,
471 f_bias, i_gop_size, imb, pmb );
476 static void x264_slicetype_analyse( x264_t *h )
478 x264_mb_analysis_t a;
479 x264_frame_t *frames[X264_BFRAME_MAX*4+3] = { NULL, };
483 int i_mb_count = NUM_MBS;
484 int cost1p0, cost2p0, cost1b1, cost2p1;
487 assert( h->frames.b_have_lowres );
489 if( !h->frames.last_nonb )
491 frames[0] = h->frames.last_nonb;
492 for( j = 0; h->frames.next[j]; j++ )
493 frames[j+1] = h->frames.next[j];
494 keyint_limit = h->param.i_keyint_max - frames[0]->i_frame + h->frames.i_last_idr - 1;
495 num_frames = X264_MIN( j, keyint_limit );
496 if( num_frames == 0 )
499 x264_lowres_context_init( h, &a );
500 idr_frame_type = frames[1]->i_frame - h->frames.i_last_idr >= h->param.i_keyint_min ? X264_TYPE_IDR : X264_TYPE_I;
502 if( num_frames == 1 )
505 frames[1]->i_type = X264_TYPE_P;
506 if( h->param.b_pre_scenecut )
508 x264_slicetype_frame_cost( h, &a, frames, 0, 1, 1, 0 );
509 if( scenecut( h, frames[1], 1 ) )
510 frames[1]->i_type = idr_frame_type;
515 if( h->param.i_bframe_adaptive == X264_B_ADAPT_TRELLIS )
518 int max_bframes = X264_MIN(num_frames-1, h->param.i_bframe);
519 if( h->param.b_pre_scenecut )
521 x264_slicetype_frame_cost( h, &a, frames, 0, 1, 1, 0 );
522 if( scenecut( h, frames[1], 1 ) )
524 frames[1]->i_type = idr_frame_type;
528 num_bframes = x264_slicetype_path_search( h, &a, frames, num_frames, max_bframes, num_frames-max_bframes );
529 assert(num_bframes < num_frames);
531 for( j = 1; j < num_bframes+1; j++ )
533 if( h->param.b_pre_scenecut && scenecut( h, frames[j+1], j+1 ) )
535 frames[j]->i_type = X264_TYPE_P;
536 frames[j+1]->i_type = idr_frame_type;
539 frames[j]->i_type = X264_TYPE_B;
541 frames[num_bframes+1]->i_type = X264_TYPE_P;
545 cost2p1 = x264_slicetype_frame_cost( h, &a, frames, 0, 2, 2, 1 );
546 if( frames[2]->i_intra_mbs[2] > i_mb_count / 2 )
549 cost1b1 = x264_slicetype_frame_cost( h, &a, frames, 0, 2, 1, 0 );
550 cost1p0 = x264_slicetype_frame_cost( h, &a, frames, 0, 1, 1, 0 );
551 cost2p0 = x264_slicetype_frame_cost( h, &a, frames, 1, 2, 2, 0 );
553 if( cost1p0 + cost2p0 < cost1b1 + cost2p1 )
556 // arbitrary and untuned
557 #define INTER_THRESH 300
558 #define P_SENS_BIAS (50 - h->param.i_bframe_bias)
559 frames[1]->i_type = X264_TYPE_B;
561 for( j = 2; j <= X264_MIN( h->param.i_bframe, num_frames-1 ); j++ )
563 int pthresh = X264_MAX(INTER_THRESH - P_SENS_BIAS * (j-1), INTER_THRESH/10);
564 int pcost = x264_slicetype_frame_cost( h, &a, frames, 0, j+1, j+1, 1 );
566 if( pcost > pthresh*i_mb_count || frames[j+1]->i_intra_mbs[j+1] > i_mb_count/3 )
568 frames[j]->i_type = X264_TYPE_P;
572 frames[j]->i_type = X264_TYPE_B;
577 void x264_slicetype_decide( x264_t *h )
583 if( h->frames.next[0] == NULL )
586 if( h->param.rc.b_stat_read )
588 /* Use the frame types from the first pass */
589 for( i = 0; h->frames.next[i] != NULL; i++ )
590 h->frames.next[i]->i_type =
591 x264_ratecontrol_slice_type( h, h->frames.next[i]->i_frame );
593 else if( (h->param.i_bframe && h->param.i_bframe_adaptive)
594 || h->param.b_pre_scenecut )
595 x264_slicetype_analyse( h );
597 for( bframes = 0;; bframes++ )
599 frm = h->frames.next[bframes];
602 if( frm->i_frame - h->frames.i_last_idr >= h->param.i_keyint_max )
604 if( frm->i_type == X264_TYPE_AUTO )
605 frm->i_type = X264_TYPE_IDR;
606 if( frm->i_type != X264_TYPE_IDR )
607 x264_log( h, X264_LOG_WARNING, "specified frame type (%d) is not compatible with keyframe interval\n", frm->i_type );
609 if( frm->i_type == X264_TYPE_IDR )
615 h->frames.next[bframes]->i_type = X264_TYPE_P;
623 if( bframes == h->param.i_bframe
624 || h->frames.next[bframes+1] == NULL )
626 if( IS_X264_TYPE_B( frm->i_type ) )
627 x264_log( h, X264_LOG_WARNING, "specified frame type is not compatible with max B-frames\n" );
628 if( frm->i_type == X264_TYPE_AUTO
629 || IS_X264_TYPE_B( frm->i_type ) )
630 frm->i_type = X264_TYPE_P;
633 if( frm->i_type != X264_TYPE_AUTO && frm->i_type != X264_TYPE_B && frm->i_type != X264_TYPE_BREF )
636 frm->i_type = X264_TYPE_B;
640 int x264_rc_analyse_slice( x264_t *h )
642 x264_mb_analysis_t a;
643 x264_frame_t *frames[X264_BFRAME_MAX*4+2] = { NULL, };
647 x264_lowres_context_init( h, &a );
649 if( IS_X264_TYPE_I(h->fenc->i_type) )
653 else if( X264_TYPE_P == h->fenc->i_type )
656 while( h->frames.current[p1] && IS_X264_TYPE_B( h->frames.current[p1]->i_type ) )
663 p1 = (h->fref1[0]->i_poc - h->fref0[0]->i_poc)/2;
664 b = (h->fref1[0]->i_poc - h->fenc->i_poc)/2;
665 frames[p1] = h->fref1[0];
667 frames[p0] = h->fref0[0];
670 cost = x264_slicetype_frame_cost( h, &a, frames, p0, p1, b, 0 );
672 /* In AQ, use the weighted score instead. */
673 if( h->param.rc.i_aq_mode )
674 cost = frames[b]->i_cost_est[b-p0][p1-b];
676 h->fenc->i_row_satd = h->fenc->i_row_satds[b-p0][p1-b];
677 h->fdec->i_row_satd = h->fdec->i_row_satds[b-p0][p1-b];
678 h->fdec->i_satd = cost;
679 memcpy( h->fdec->i_row_satd, h->fenc->i_row_satd, h->sps->i_mb_height * sizeof(int) );