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 if( h->mb.i_mb_x <= 1 )
78 h->mb.mv_min_fpel[1] = -8*h->mb.i_mb_y - 4;
79 h->mb.mv_max_fpel[1] = 8*( h->sps->i_mb_height - h->mb.i_mb_y - 1 ) + 4;
80 h->mb.mv_min_spel[1] = 4*( h->mb.mv_min_fpel[1] - 8 );
81 h->mb.mv_max_spel[1] = 4*( h->mb.mv_max_fpel[1] + 8 );
84 #define LOAD_HPELS_LUMA(dst, src) \
86 (dst)[0] = &(src)[0][i_pel_offset]; \
87 (dst)[1] = &(src)[1][i_pel_offset]; \
88 (dst)[2] = &(src)[2][i_pel_offset]; \
89 (dst)[3] = &(src)[3][i_pel_offset]; \
91 #define CLIP_MV( mv ) \
93 mv[0] = x264_clip3( mv[0], h->mb.mv_min_spel[0], h->mb.mv_max_spel[0] ); \
94 mv[1] = x264_clip3( mv[1], h->mb.mv_min_spel[1], h->mb.mv_max_spel[1] ); \
96 #define TRY_BIDIR( mv0, mv1, penalty ) \
101 h->mc.mc_luma( pix1, 16, m[0].p_fref, m[0].i_stride[0], \
102 (mv0)[0], (mv0)[1], 8, 8 ); \
103 src2 = h->mc.get_ref( pix2, &stride2, m[1].p_fref, m[1].i_stride[0], \
104 (mv1)[0], (mv1)[1], 8, 8 ); \
105 if( i_bipred_weight != 32 ) \
106 h->mc.avg_weight[PIXEL_8x8]( pix1, 16, src2, stride2, i_bipred_weight ); \
108 h->mc.avg[PIXEL_8x8]( pix1, 16, src2, stride2 ); \
109 i_cost = penalty + h->pixf.mbcmp[PIXEL_8x8]( \
110 m[0].p_fenc[0], FENC_STRIDE, pix1, 16 ); \
111 if( i_bcost > i_cost ) \
115 m[0].i_pixel = PIXEL_8x8;
116 m[0].p_cost_mv = a->p_cost_mv;
117 m[0].i_stride[0] = i_stride;
118 m[0].p_fenc[0] = h->mb.pic.p_fenc[0];
119 LOAD_HPELS_LUMA( m[0].p_fref, fref0->lowres );
123 int16_t *mvr = fref1->lowres_mvs[0][p1-p0-1][i_mb_xy];
127 h->mc.memcpy_aligned( &m[1], &m[0], sizeof(x264_me_t) );
128 LOAD_HPELS_LUMA( m[1].p_fref, fref1->lowres );
130 dmv[0][0] = ( mvr[0] * dist_scale_factor + 128 ) >> 8;
131 dmv[0][1] = ( mvr[1] * dist_scale_factor + 128 ) >> 8;
132 dmv[1][0] = dmv[0][0] - mvr[0];
133 dmv[1][1] = dmv[0][1] - mvr[1];
137 TRY_BIDIR( dmv[0], dmv[1], 0 );
138 if( dmv[0][0] | dmv[0][1] | dmv[1][0] | dmv[1][1] )
139 TRY_BIDIR( mv0, mv0, 0 );
140 // if( i_bcost < 60 ) // arbitrary threshold
144 i_cost_bak = i_bcost;
145 for( l = 0; l < 1 + b_bidir; l++ )
147 DECLARE_ALIGNED_4(int16_t mvc[4][2]) = {{0}};
149 int16_t (*fenc_mv)[2] = fenc_mvs[l];
153 #define MVC(mv) { *(uint32_t*)mvc[i_mvc] = *(uint32_t*)mv; i_mvc++; }
158 MVC(fenc_mv[-i_mb_stride]);
159 if( i_mb_x < h->sps->i_mb_width - 1 )
160 MVC(fenc_mv[-i_mb_stride+1]);
162 MVC(fenc_mv[-i_mb_stride-1]);
165 x264_median_mv( m[l].mvp, mvc[0], mvc[1], mvc[2] );
166 x264_me_search( h, &m[l], mvc, i_mvc );
168 m[l].cost -= 2; // remove mvcost from skip mbs
169 if( *(uint32_t*)m[l].mv )
171 *(uint32_t*)fenc_mvs[l] = *(uint32_t*)m[l].mv;
172 *fenc_costs[l] = m[l].cost;
176 *(uint32_t*)m[l].mv = *(uint32_t*)fenc_mvs[l];
177 m[l].cost = *fenc_costs[l];
179 i_bcost = X264_MIN( i_bcost, m[l].cost );
182 if( b_bidir && ( *(uint32_t*)m[0].mv || *(uint32_t*)m[1].mv ) )
183 TRY_BIDIR( m[0].mv, m[1].mv, 5 );
186 /* forbid intra-mbs in B-frames, because it's rare and not worth checking */
187 /* FIXME: Should we still forbid them now that we cache intra scores? */
190 int i_icost, b_intra;
191 if( !fenc->b_intra_calculated )
193 DECLARE_ALIGNED_16( uint8_t edge[33] );
194 uint8_t *pix = &pix1[8+FDEC_STRIDE - 1];
195 uint8_t *src = &fenc->lowres[0][i_pel_offset - 1];
196 const int intra_penalty = 5;
199 memcpy( pix-FDEC_STRIDE, src-i_stride, 17 );
201 pix[i*FDEC_STRIDE] = src[i*i_stride];
204 if( h->pixf.intra_satd_x3_8x8c && h->pixf.mbcmp[0] == h->pixf.satd[0] )
206 h->pixf.intra_satd_x3_8x8c( h->mb.pic.p_fenc[0], pix, satds );
207 h->predict_8x8c[I_PRED_CHROMA_P]( pix );
208 satds[I_PRED_CHROMA_P] =
209 h->pixf.satd[PIXEL_8x8]( pix, FDEC_STRIDE, h->mb.pic.p_fenc[0], FENC_STRIDE );
215 h->predict_8x8c[i]( pix );
216 satds[i] = h->pixf.mbcmp[PIXEL_8x8]( pix, FDEC_STRIDE, h->mb.pic.p_fenc[0], FENC_STRIDE );
219 i_icost = X264_MIN4( satds[0], satds[1], satds[2], satds[3] );
221 x264_predict_8x8_filter( pix, edge, ALL_NEIGHBORS, ALL_NEIGHBORS );
225 h->predict_8x8[i]( pix, edge );
226 satd = h->pixf.mbcmp[PIXEL_8x8]( pix, FDEC_STRIDE, h->mb.pic.p_fenc[0], FENC_STRIDE );
227 i_icost = X264_MIN( i_icost, satd );
230 i_icost += intra_penalty;
231 fenc->i_intra_cost[i_mb_xy] = i_icost;
234 i_icost = fenc->i_intra_cost[i_mb_xy];
235 b_intra = i_icost < i_bcost;
238 if( i_mb_x > 0 && i_mb_x < h->sps->i_mb_width - 1
239 && i_mb_y > 0 && i_mb_y < h->sps->i_mb_height - 1 )
241 fenc->i_intra_mbs[b-p0] += b_intra;
242 fenc->i_cost_est[0][0] += i_icost;
251 (h->sps->i_mb_width > 2 && h->sps->i_mb_height > 2 ?\
252 (h->sps->i_mb_width - 2) * (h->sps->i_mb_height - 2) :\
253 h->sps->i_mb_width * h->sps->i_mb_height)
255 static int x264_slicetype_frame_cost( x264_t *h, x264_mb_analysis_t *a,
256 x264_frame_t **frames, int p0, int p1, int b,
257 int b_intra_penalty )
260 /* Don't use the AQ'd scores for slicetype decision. */
264 /* Check whether we already evaluated this frame
265 * If we have tried this frame as P, then we have also tried
266 * the preceding frames as B. (is this still true?) */
267 /* Also check that we already calculated the row SATDs for the current frame. */
268 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) )
270 i_score = frames[b]->i_cost_est[b-p0][p1-b];
274 int dist_scale_factor = 128;
275 int *row_satd = frames[b]->i_row_satds[b-p0][p1-b];
277 /* For each list, check to see whether we have lowres motion-searched this reference frame before. */
278 do_search[0] = b != p0 && frames[b]->lowres_mvs[0][b-p0-1][0][0] == 0x7FFF;
279 do_search[1] = b != p1 && frames[b]->lowres_mvs[1][p1-b-1][0][0] == 0x7FFF;
280 if( do_search[0] ) frames[b]->lowres_mvs[0][b-p0-1][0][0] = 0;
281 if( do_search[1] ) frames[b]->lowres_mvs[1][p1-b-1][0][0] = 0;
285 frames[b]->i_intra_mbs[b-p0] = 0;
286 frames[b]->i_cost_est[0][0] = 0;
289 dist_scale_factor = ( ((b-p0) << 8) + ((p1-p0) >> 1) ) / (p1-p0);
291 if( h->sps->i_mb_width <= 2 || h->sps->i_mb_height <= 2 )
293 for( h->mb.i_mb_y = 0; h->mb.i_mb_y < h->sps->i_mb_height; h->mb.i_mb_y++ )
294 for( h->mb.i_mb_x = 0; h->mb.i_mb_x < h->sps->i_mb_width; h->mb.i_mb_x++ )
295 i_score += x264_slicetype_mb_cost( h, a, frames, p0, p1, b, dist_scale_factor, do_search );
297 /* the edge mbs seem to reduce the predictive quality of the
298 * whole frame's score, but are needed for a spatial distribution. */
299 else if( h->param.rc.i_vbv_buffer_size )
301 for( h->mb.i_mb_y = 0; h->mb.i_mb_y < h->sps->i_mb_height; h->mb.i_mb_y++ )
303 row_satd[ h->mb.i_mb_y ] = 0;
304 for( h->mb.i_mb_x = 0; h->mb.i_mb_x < h->sps->i_mb_width; h->mb.i_mb_x++ )
306 int i_mb_cost = x264_slicetype_mb_cost( h, a, frames, p0, p1, b, dist_scale_factor, do_search );
307 int i_mb_cost_aq = i_mb_cost;
308 if( h->param.rc.i_aq_mode )
311 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);
313 row_satd[ h->mb.i_mb_y ] += i_mb_cost_aq;
314 if( h->mb.i_mb_y > 0 && h->mb.i_mb_y < h->sps->i_mb_height - 1 &&
315 h->mb.i_mb_x > 0 && h->mb.i_mb_x < h->sps->i_mb_width - 1 )
317 /* Don't use AQ-weighted costs for slicetype decision, only for ratecontrol. */
318 i_score += i_mb_cost;
319 i_score_aq += i_mb_cost_aq;
326 for( h->mb.i_mb_y = 1; h->mb.i_mb_y < h->sps->i_mb_height - 1; h->mb.i_mb_y++ )
327 for( h->mb.i_mb_x = 1; h->mb.i_mb_x < h->sps->i_mb_width - 1; h->mb.i_mb_x++ )
329 int i_mb_cost = x264_slicetype_mb_cost( h, a, frames, p0, p1, b, dist_scale_factor, do_search );
330 int i_mb_cost_aq = i_mb_cost;
331 if( h->param.rc.i_aq_mode )
334 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);
336 i_score += i_mb_cost;
337 i_score_aq += i_mb_cost_aq;
342 i_score = i_score * 100 / (120 + h->param.i_bframe_bias);
344 frames[b]->b_intra_calculated = 1;
346 frames[b]->i_cost_est[b-p0][p1-b] = i_score;
347 frames[b]->i_cost_est_aq[b-p0][p1-b] = i_score_aq;
351 if( b_intra_penalty )
353 // arbitrary penalty for I-blocks after B-frames
355 i_score += i_score * frames[b]->i_intra_mbs[b-p0] / (nmb * 8);
360 #define MAX_LENGTH (X264_BFRAME_MAX*4)
362 static int x264_slicetype_path_cost( x264_t *h, x264_mb_analysis_t *a, x264_frame_t **frames, char *path, int threshold )
367 path--; /* Since the 1st path element is really the second frame */
372 /* Find the location of the next P-frame. */
373 while( path[next_p] && path[next_p] != 'P' )
375 /* Return if the path doesn't end on a P-frame. */
376 if( path[next_p] != 'P' )
379 /* Add the cost of the P-frame found above */
380 cost += x264_slicetype_frame_cost( h, a, frames, cur_p, next_p, next_p, 0 );
381 /* Early terminate if the cost we have found is larger than the best path cost so far */
382 if( cost > threshold )
385 for( next_b = loc; next_b < next_p && cost < threshold; next_b++ )
386 cost += x264_slicetype_frame_cost( h, a, frames, cur_p, next_p, next_b, 0 );
394 /* Viterbi/trellis slicetype decision algorithm. */
395 /* Uses strings due to the fact that the speed of the control functions is
396 negligable compared to the cost of running slicetype_frame_cost, and because
397 it makes debugging easier. */
398 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] )
400 char paths[X264_BFRAME_MAX+2][MAX_LENGTH] = {{0}};
401 int num_paths = X264_MIN(max_bframes+1, length);
402 int suffix_size, loc, path;
403 int best_cost = COST_MAX;
404 int best_path_index = 0;
405 length = X264_MIN(length,MAX_LENGTH);
407 /* Iterate over all currently possible paths and add suffixes to each one */
408 for( suffix_size = 0; suffix_size < num_paths; suffix_size++ )
410 memcpy( paths[suffix_size], best_paths[length - (suffix_size + 1)], length - (suffix_size + 1) );
411 for( loc = 0; loc < suffix_size; loc++ )
412 strcat( paths[suffix_size], "B" );
413 strcat( paths[suffix_size], "P" );
416 /* Calculate the actual cost of each of the current paths */
417 for( path = 0; path < num_paths; path++ )
419 int cost = x264_slicetype_path_cost( h, a, frames, paths[path], best_cost );
420 if( cost < best_cost )
423 best_path_index = path;
427 /* Store the best path. */
428 memcpy( best_paths[length], paths[best_path_index], length );
431 static int x264_slicetype_path_search( x264_t *h, x264_mb_analysis_t *a, x264_frame_t **frames, int length, int bframes, int buffer )
433 char best_paths[MAX_LENGTH][MAX_LENGTH] = {"","P"};
435 for( n = 2; n < length-1; n++ )
436 x264_slicetype_path( h, a, frames, n, bframes, buffer, best_paths );
437 return strspn( best_paths[length-2], "B" );
440 static int scenecut( x264_t *h, x264_frame_t *frame, int pdist )
442 int icost = frame->i_cost_est[0][0];
443 int pcost = frame->i_cost_est[pdist][0];
445 int i_gop_size = frame->i_frame - h->frames.i_last_idr;
446 float f_thresh_max = h->param.i_scenecut_threshold / 100.0;
447 /* magic numbers pulled out of thin air */
448 float f_thresh_min = f_thresh_max * h->param.i_keyint_min
449 / ( h->param.i_keyint_max * 4 );
452 if( h->param.i_keyint_min == h->param.i_keyint_max )
453 f_thresh_min= f_thresh_max;
454 if( i_gop_size < h->param.i_keyint_min / 4 )
455 f_bias = f_thresh_min / 4;
456 else if( i_gop_size <= h->param.i_keyint_min )
457 f_bias = f_thresh_min * i_gop_size / h->param.i_keyint_min;
460 f_bias = f_thresh_min
461 + ( f_thresh_max - f_thresh_min )
462 * ( i_gop_size - h->param.i_keyint_min )
463 / ( h->param.i_keyint_max - h->param.i_keyint_min ) ;
466 res = pcost >= (1.0 - f_bias) * icost;
469 int imb = frame->i_intra_mbs[pdist];
470 int pmb = NUM_MBS - imb;
471 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",
473 icost, pcost, 1. - (double)pcost / icost,
474 f_bias, i_gop_size, imb, pmb );
479 static void x264_slicetype_analyse( x264_t *h )
481 x264_mb_analysis_t a;
482 x264_frame_t *frames[X264_BFRAME_MAX*4+3] = { NULL, };
486 int i_mb_count = NUM_MBS;
487 int cost1p0, cost2p0, cost1b1, cost2p1;
490 assert( h->frames.b_have_lowres );
492 if( !h->frames.last_nonb )
494 frames[0] = h->frames.last_nonb;
495 for( j = 0; h->frames.next[j]; j++ )
496 frames[j+1] = h->frames.next[j];
497 keyint_limit = h->param.i_keyint_max - frames[0]->i_frame + h->frames.i_last_idr - 1;
498 num_frames = X264_MIN( j, keyint_limit );
499 if( num_frames == 0 )
502 x264_lowres_context_init( h, &a );
503 idr_frame_type = frames[1]->i_frame - h->frames.i_last_idr >= h->param.i_keyint_min ? X264_TYPE_IDR : X264_TYPE_I;
505 if( num_frames == 1 )
508 frames[1]->i_type = X264_TYPE_P;
509 if( h->param.b_pre_scenecut )
511 x264_slicetype_frame_cost( h, &a, frames, 0, 1, 1, 0 );
512 if( scenecut( h, frames[1], 1 ) )
513 frames[1]->i_type = idr_frame_type;
518 if( h->param.i_bframe_adaptive == X264_B_ADAPT_TRELLIS )
521 int max_bframes = X264_MIN(num_frames-1, h->param.i_bframe);
522 if( h->param.b_pre_scenecut )
524 x264_slicetype_frame_cost( h, &a, frames, 0, 1, 1, 0 );
525 if( scenecut( h, frames[1], 1 ) )
527 frames[1]->i_type = idr_frame_type;
531 num_bframes = x264_slicetype_path_search( h, &a, frames, num_frames, max_bframes, num_frames-max_bframes );
532 assert(num_bframes < num_frames);
534 for( j = 1; j < num_bframes+1; j++ )
536 if( h->param.b_pre_scenecut && scenecut( h, frames[j+1], j+1 ) )
538 frames[j]->i_type = X264_TYPE_P;
539 frames[j+1]->i_type = idr_frame_type;
542 frames[j]->i_type = X264_TYPE_B;
544 frames[num_bframes+1]->i_type = X264_TYPE_P;
548 cost2p1 = x264_slicetype_frame_cost( h, &a, frames, 0, 2, 2, 1 );
549 if( frames[2]->i_intra_mbs[2] > i_mb_count / 2 )
552 cost1b1 = x264_slicetype_frame_cost( h, &a, frames, 0, 2, 1, 0 );
553 cost1p0 = x264_slicetype_frame_cost( h, &a, frames, 0, 1, 1, 0 );
554 cost2p0 = x264_slicetype_frame_cost( h, &a, frames, 1, 2, 2, 0 );
556 if( cost1p0 + cost2p0 < cost1b1 + cost2p1 )
559 // arbitrary and untuned
560 #define INTER_THRESH 300
561 #define P_SENS_BIAS (50 - h->param.i_bframe_bias)
562 frames[1]->i_type = X264_TYPE_B;
564 for( j = 2; j <= X264_MIN( h->param.i_bframe, num_frames-1 ); j++ )
566 int pthresh = X264_MAX(INTER_THRESH - P_SENS_BIAS * (j-1), INTER_THRESH/10);
567 int pcost = x264_slicetype_frame_cost( h, &a, frames, 0, j+1, j+1, 1 );
569 if( pcost > pthresh*i_mb_count || frames[j+1]->i_intra_mbs[j+1] > i_mb_count/3 )
571 frames[j]->i_type = X264_TYPE_P;
575 frames[j]->i_type = X264_TYPE_B;
580 void x264_slicetype_decide( x264_t *h )
586 if( h->frames.next[0] == NULL )
589 if( h->param.rc.b_stat_read )
591 /* Use the frame types from the first pass */
592 for( i = 0; h->frames.next[i] != NULL; i++ )
593 h->frames.next[i]->i_type =
594 x264_ratecontrol_slice_type( h, h->frames.next[i]->i_frame );
596 else if( (h->param.i_bframe && h->param.i_bframe_adaptive)
597 || h->param.b_pre_scenecut )
598 x264_slicetype_analyse( h );
600 for( bframes = 0;; bframes++ )
602 frm = h->frames.next[bframes];
605 if( frm->i_frame - h->frames.i_last_idr >= h->param.i_keyint_max )
607 if( frm->i_type == X264_TYPE_AUTO )
608 frm->i_type = X264_TYPE_IDR;
609 if( frm->i_type != X264_TYPE_IDR )
610 x264_log( h, X264_LOG_WARNING, "specified frame type (%d) is not compatible with keyframe interval\n", frm->i_type );
612 if( frm->i_type == X264_TYPE_IDR )
618 h->frames.next[bframes]->i_type = X264_TYPE_P;
626 if( bframes == h->param.i_bframe
627 || h->frames.next[bframes+1] == NULL )
629 if( IS_X264_TYPE_B( frm->i_type ) )
630 x264_log( h, X264_LOG_WARNING, "specified frame type is not compatible with max B-frames\n" );
631 if( frm->i_type == X264_TYPE_AUTO
632 || IS_X264_TYPE_B( frm->i_type ) )
633 frm->i_type = X264_TYPE_P;
636 if( frm->i_type != X264_TYPE_AUTO && frm->i_type != X264_TYPE_B && frm->i_type != X264_TYPE_BREF )
639 frm->i_type = X264_TYPE_B;
643 int x264_rc_analyse_slice( x264_t *h )
645 x264_mb_analysis_t a;
646 x264_frame_t *frames[X264_BFRAME_MAX*4+2] = { NULL, };
650 x264_lowres_context_init( h, &a );
652 if( IS_X264_TYPE_I(h->fenc->i_type) )
656 else if( X264_TYPE_P == h->fenc->i_type )
659 while( h->frames.current[p1] && IS_X264_TYPE_B( h->frames.current[p1]->i_type ) )
666 p1 = (h->fref1[0]->i_poc - h->fref0[0]->i_poc)/2;
667 b = (h->fref1[0]->i_poc - h->fenc->i_poc)/2;
668 frames[p1] = h->fref1[0];
670 frames[p0] = h->fref0[0];
673 cost = x264_slicetype_frame_cost( h, &a, frames, p0, p1, b, 0 );
675 /* In AQ, use the weighted score instead. */
676 if( h->param.rc.i_aq_mode )
677 cost = frames[b]->i_cost_est[b-p0][p1-b];
679 h->fenc->i_row_satd = h->fenc->i_row_satds[b-p0][p1-b];
680 h->fdec->i_row_satd = h->fdec->i_row_satds[b-p0][p1-b];
681 h->fdec->i_satd = cost;
682 memcpy( h->fdec->i_row_satd, h->fenc->i_row_satd, h->sps->i_mb_height * sizeof(int) );