*****************************************************************************/
#include <math.h>
-#include <limits.h>
#include "common/common.h"
#include "common/cpu.h"
#include "me.h"
-static int x264_lowres_context_init( x264_t *h, x264_mb_analysis_t *a )
+static void x264_lowres_context_init( x264_t *h, x264_mb_analysis_t *a )
{
- a->i_qp = 12; // arbitrary, but low because SATD scores are 1/4 normal
+ a->i_qp = X264_LOOKAHEAD_QP;
a->i_lambda = x264_lambda_tab[ a->i_qp ];
- if( x264_mb_analyse_load_costs( h, a ) )
- return -1;
+ x264_mb_analyse_load_costs( h, a );
h->mb.i_me_method = X264_MIN( X264_ME_HEX, h->param.analyse.i_me_method ); // maybe dia?
h->mb.i_subpel_refine = 4; // 3 should be enough, but not tweaking for speed now
h->mb.b_chroma_me = 0;
- return 0;
-}
-
-int x264_lowres_context_alloc( x264_t *h )
-{
- x264_mb_analysis_t a;
- return x264_lowres_context_init( h, &a );
}
static int x264_slicetype_mb_cost( x264_t *h, x264_mb_analysis_t *a,
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] };
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] };
- DECLARE_ALIGNED_8( uint8_t pix1[9*FDEC_STRIDE] );
+ ALIGNED_8( uint8_t pix1[9*FDEC_STRIDE] );
uint8_t *pix2 = pix1+8;
x264_me_t m[2];
int i_bcost = COST_MAX;
h->mb.pic.p_fenc[0] = h->mb.pic.fenc_buf;
h->mc.copy[PIXEL_8x8]( h->mb.pic.p_fenc[0], FENC_STRIDE, &fenc->lowres[0][i_pel_offset], i_stride, 8 );
- if( !p0 && !p1 && !b )
+ if( p0 == p1 )
goto lowres_intra_mb;
// no need for h->mb.mv_min[]
{
int i_mvc = 0;
int16_t (*fenc_mv)[2] = fenc_mvs[l];
- DECLARE_ALIGNED_4( int16_t mvc[4][2] );
+ ALIGNED_4( int16_t mvc[4][2] );
/* Reverse-order MV prediction. */
*(uint32_t*)mvc[0] = 0;
if( b_bidir && ( *(uint32_t*)m[0].mv || *(uint32_t*)m[1].mv ) )
TRY_BIDIR( m[0].mv, m[1].mv, 5 );
- frames[b]->lowres_inter_types[b-p0][p1-b][i_mb_xy] = list_used;
+ /* Store to width-2 bitfield. */
+ frames[b]->lowres_inter_types[b-p0][p1-b][i_mb_xy>>2] &= ~(3<<((i_mb_xy&3)*2));
+ frames[b]->lowres_inter_types[b-p0][p1-b][i_mb_xy>>2] |= list_used<<((i_mb_xy&3)*2);
lowres_intra_mb:
/* forbid intra-mbs in B-frames, because it's rare and not worth checking */
int i_icost, b_intra;
if( !fenc->b_intra_calculated )
{
- DECLARE_ALIGNED_16( uint8_t edge[33] );
+ ALIGNED_ARRAY_16( uint8_t, edge,[33] );
uint8_t *pix = &pix1[8+FDEC_STRIDE - 1];
uint8_t *src = &fenc->lowres[0][i_pel_offset - 1];
const int intra_penalty = 5;
{
fenc->i_intra_mbs[b-p0] += b_intra;
fenc->i_cost_est[0][0] += i_icost;
+ if( h->param.rc.i_aq_mode )
+ fenc->i_cost_est_aq[0][0] += (i_icost * fenc->i_inv_qscale_factor[i_mb_xy] + 128) >> 8;
}
}
}
{
frames[b]->i_intra_mbs[b-p0] = 0;
frames[b]->i_cost_est[0][0] = 0;
+ frames[b]->i_cost_est_aq[0][0] = 0;
}
if( p1 != p0 )
dist_scale_factor = ( ((b-p0) << 8) + ((p1-p0) >> 1) ) / (p1-p0);
}
if( b != p1 )
- i_score = i_score * 100 / (120 + h->param.i_bframe_bias);
+ i_score = (uint64_t)i_score * 100 / (120 + h->param.i_bframe_bias);
else
frames[b]->b_intra_calculated = 1;
/* If MB-tree changes the quantizers, we need to recalculate the frame cost without
* re-running lookahead. */
-static int x264_slicetype_frame_cost_recalculate( x264_t *h, x264_mb_analysis_t *a, x264_frame_t **frames,
- int p0, int p1, int b )
+static int x264_slicetype_frame_cost_recalculate( x264_t *h, x264_frame_t **frames, int p0, int p1, int b )
{
int i_score = 0;
int *row_satd = frames[b]->i_row_satds[b-p0][p1-b];
int i_mb_xy = h->mb.i_mb_x + h->mb.i_mb_y*h->mb.i_mb_stride;
int i_mb_cost = frames[b]->lowres_costs[b-p0][p1-b][i_mb_xy];
float qp_adj = frames[b]->f_qp_offset[i_mb_xy];
- i_mb_cost = (i_mb_cost * x264_exp2fix8(qp_adj*(-1.f/6.f)) + 128) >> 8;
+ i_mb_cost = (i_mb_cost * x264_exp2fix8(qp_adj) + 128) >> 8;
row_satd[ h->mb.i_mb_y ] += i_mb_cost;
if( (h->mb.i_mb_y > 0 && h->mb.i_mb_y < h->sps->i_mb_height - 1 &&
h->mb.i_mb_x > 0 && h->mb.i_mb_x < h->sps->i_mb_width - 1) ||
return i_score;
}
+static void x264_macroblock_tree_finish( x264_t *h, x264_frame_t *frame, int b_bidir )
+{
+ int mb_index;
+ x264_emms();
+ if( b_bidir )
+ memcpy( frame->f_qp_offset, frame->f_qp_offset_aq, sizeof( frame->f_qp_offset ) );
+ else
+ {
+ /* Allow the strength to be adjusted via qcompress, since the two
+ * concepts are very similar. */
+ float strength = 5.0f * (1.0f - h->param.rc.f_qcompress);
+ for( mb_index = 0; mb_index < h->mb.i_mb_count; mb_index++ )
+ {
+ int intra_cost = (frame->i_intra_cost[mb_index] * frame->i_inv_qscale_factor[mb_index]+128)>>8;
+ if( intra_cost )
+ {
+ int propagate_cost = frame->i_propagate_cost[mb_index];
+ float log2_ratio = x264_log2(intra_cost + propagate_cost) - x264_log2(intra_cost);
+ frame->f_qp_offset[mb_index] = frame->f_qp_offset_aq[mb_index] - strength * log2_ratio;
+ }
+ }
+ }
+}
+
static void x264_macroblock_tree_propagate( x264_t *h, x264_frame_t **frames, int p0, int p1, int b )
{
- x264_frame_t *refs[2] = {frames[p0],frames[p1]};
+ uint16_t *ref_costs[2] = {frames[p0]->i_propagate_cost,frames[p1]->i_propagate_cost};
int dist_scale_factor = ( ((b-p0) << 8) + ((p1-p0) >> 1) ) / (p1-p0);
int i_bipred_weight = h->param.analyse.b_weighted_bipred ? 64 - (dist_scale_factor>>2) : 32;
int16_t (*mvs[2])[2] = { frames[b]->lowres_mvs[0][b-p0-1], frames[b]->lowres_mvs[1][p1-b-1] };
+ int bipred_weights[2] = {i_bipred_weight, 64 - i_bipred_weight};
int *buf = h->scratch_buffer;
for( h->mb.i_mb_y = 0; h->mb.i_mb_y < h->sps->i_mb_height; h->mb.i_mb_y++ )
/* Don't propagate for an intra block. */
if( propagate_amount > 0 )
{
- int lists_used = frames[b]->lowres_inter_types[b-p0][p1-b][mb_index];
+ /* Access width-2 bitfield. */
+ int lists_used = (frames[b]->lowres_inter_types[b-p0][p1-b][mb_index>>2] >> ((mb_index&3)*2))&3;
int list;
/* Follow the MVs to the previous frame(s). */
for( list = 0; list < 2; list++ )
int y = mvs[list][mb_index][1];
int listamount = propagate_amount;
int mbx = (x>>5)+h->mb.i_mb_x;
- int mby = ((y>>5)+h->mb.i_mb_y);
+ int mby = (y>>5)+h->mb.i_mb_y;
int idx0 = mbx + mby*h->mb.i_mb_stride;
int idx1 = idx0 + 1;
int idx2 = idx0 + h->mb.i_mb_stride;
/* Apply bipred weighting. */
if( lists_used == 3 )
- listamount = (listamount * (list?(64-i_bipred_weight):i_bipred_weight) + 32) >> 6;
+ listamount = (listamount * bipred_weights[list] + 32) >> 6;
#define CLIP_ADD(s,x) (s) = X264_MIN((s)+(x),(1<<16)-1)
* be counted. */
if( mbx < h->sps->i_mb_width-1 && mby < h->sps->i_mb_height-1 && mbx >= 0 && mby >= 0 )
{
- CLIP_ADD( refs[list]->i_propagate_cost[idx0], (listamount*idx0weight+512)>>10 );
- CLIP_ADD( refs[list]->i_propagate_cost[idx1], (listamount*idx1weight+512)>>10 );
- CLIP_ADD( refs[list]->i_propagate_cost[idx2], (listamount*idx2weight+512)>>10 );
- CLIP_ADD( refs[list]->i_propagate_cost[idx3], (listamount*idx3weight+512)>>10 );
+ CLIP_ADD( ref_costs[list][idx0], (listamount*idx0weight+512)>>10 );
+ CLIP_ADD( ref_costs[list][idx1], (listamount*idx1weight+512)>>10 );
+ CLIP_ADD( ref_costs[list][idx2], (listamount*idx2weight+512)>>10 );
+ CLIP_ADD( ref_costs[list][idx3], (listamount*idx3weight+512)>>10 );
}
else /* Check offsets individually */
{
if( mbx < h->sps->i_mb_width && mby < h->sps->i_mb_height && mbx >= 0 && mby >= 0 )
- CLIP_ADD( refs[list]->i_propagate_cost[idx0], (listamount*idx0weight+512)>>10 );
+ CLIP_ADD( ref_costs[list][idx0], (listamount*idx0weight+512)>>10 );
if( mbx+1 < h->sps->i_mb_width && mby < h->sps->i_mb_height && mbx+1 >= 0 && mby >= 0 )
- CLIP_ADD( refs[list]->i_propagate_cost[idx1], (listamount*idx1weight+512)>>10 );
+ CLIP_ADD( ref_costs[list][idx1], (listamount*idx1weight+512)>>10 );
if( mbx < h->sps->i_mb_width && mby+1 < h->sps->i_mb_height && mbx >= 0 && mby+1 >= 0 )
- CLIP_ADD( refs[list]->i_propagate_cost[idx2], (listamount*idx2weight+512)>>10 );
+ CLIP_ADD( ref_costs[list][idx2], (listamount*idx2weight+512)>>10 );
if( mbx+1 < h->sps->i_mb_width && mby+1 < h->sps->i_mb_height && mbx+1 >= 0 && mby+1 >= 0 )
- CLIP_ADD( refs[list]->i_propagate_cost[idx3], (listamount*idx3weight+512)>>10 );
+ CLIP_ADD( ref_costs[list][idx3], (listamount*idx3weight+512)>>10 );
}
}
}
}
}
+
+ if( h->param.rc.i_vbv_buffer_size )
+ x264_macroblock_tree_finish( h, frames[b], b != p1 );
}
static void x264_macroblock_tree( x264_t *h, x264_mb_analysis_t *a, x264_frame_t **frames, int num_frames, int b_intra )
int i, idx = !b_intra;
int last_nonb, cur_nonb = 1;
if( b_intra )
- x264_slicetype_frame_cost( h, a, frames, 0, 0, 0, 0 );
+ x264_slicetype_frame_cost( h, a, frames, 0, 0, 0, 0 );
i = num_frames-1;
while( i > 0 && frames[i]->i_type == X264_TYPE_B )
}
last_nonb = cur_nonb;
}
- x264_emms();
- for( h->mb.i_mb_y = 0; h->mb.i_mb_y < h->sps->i_mb_height; h->mb.i_mb_y++ )
+ x264_macroblock_tree_finish( h, frames[last_nonb], 0 );
+}
+
+static int x264_vbv_frame_cost( x264_t *h, x264_mb_analysis_t *a, x264_frame_t **frames, int p0, int p1, int b )
+{
+ int cost = x264_slicetype_frame_cost( h, a, frames, p0, p1, b, 0 );
+ if( h->param.rc.i_aq_mode )
{
- for( h->mb.i_mb_x = 0; h->mb.i_mb_x < h->sps->i_mb_width; h->mb.i_mb_x++ )
- {
- int mb_index = h->mb.i_mb_x + h->mb.i_mb_y*h->mb.i_mb_stride;
- int intra_cost = (frames[last_nonb]->i_intra_cost[mb_index] * frames[last_nonb]->i_inv_qscale_factor[mb_index]+128)>>8;
+ if( h->param.rc.b_mb_tree )
+ return x264_slicetype_frame_cost_recalculate( h, frames, p0, p1, b );
+ else
+ return frames[b]->i_cost_est_aq[b-p0][p1-b];
+ }
+ return cost;
+}
- if( intra_cost )
- {
- int propagate_cost = frames[last_nonb]->i_propagate_cost[mb_index];
- float log2_ratio = x264_log2(intra_cost + propagate_cost) - x264_log2(intra_cost);
- /* Allow the constant to be adjusted via qcompress, since the two
- * concepts are very similar. */
- frames[last_nonb]->f_qp_offset[mb_index] -= 5.0 * (1.0 - h->param.rc.f_qcompress) * log2_ratio;
- }
+static void x264_vbv_lookahead( x264_t *h, x264_mb_analysis_t *a, x264_frame_t **frames, int num_frames, int keyframe )
+{
+ int last_nonb = 0, cur_nonb = 1, next_nonb, i, idx = 0;
+ while( cur_nonb < num_frames && frames[cur_nonb]->i_type == X264_TYPE_B )
+ cur_nonb++;
+ next_nonb = keyframe ? last_nonb : cur_nonb;
+
+ while( cur_nonb <= num_frames )
+ {
+ /* P/I cost: This shouldn't include the cost of next_nonb */
+ if( next_nonb != cur_nonb )
+ {
+ int p0 = IS_X264_TYPE_I( frames[cur_nonb]->i_type ) ? cur_nonb : last_nonb;
+ frames[next_nonb]->i_planned_satd[idx] = x264_vbv_frame_cost( h, a, frames, p0, cur_nonb, cur_nonb );
+ frames[next_nonb]->i_planned_type[idx] = frames[cur_nonb]->i_type;
+ idx++;
}
+ /* Handle the B-frames: coded order */
+ for( i = last_nonb+1; i < cur_nonb; i++, idx++ )
+ {
+ frames[next_nonb]->i_planned_satd[idx] = x264_vbv_frame_cost( h, a, frames, last_nonb, cur_nonb, i );
+ frames[next_nonb]->i_planned_type[idx] = X264_TYPE_B;
+ }
+ last_nonb = cur_nonb;
+ cur_nonb++;
+ while( cur_nonb <= num_frames && frames[cur_nonb]->i_type == X264_TYPE_B )
+ cur_nonb++;
}
+ frames[next_nonb]->i_planned_type[idx] = X264_TYPE_AUTO;
}
static int x264_slicetype_path_cost( x264_t *h, x264_mb_analysis_t *a, x264_frame_t **frames, char *path, int threshold )
/* Uses strings due to the fact that the speed of the control functions is
negligable compared to the cost of running slicetype_frame_cost, and because
it makes debugging easier. */
-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)[X264_LOOKAHEAD_MAX] )
+static void x264_slicetype_path( x264_t *h, x264_mb_analysis_t *a, x264_frame_t **frames, int length, int max_bframes, char (*best_paths)[X264_LOOKAHEAD_MAX] )
{
char paths[X264_BFRAME_MAX+2][X264_LOOKAHEAD_MAX] = {{0}};
int num_paths = X264_MIN(max_bframes+1, length);
- int suffix_size, loc, path;
+ int path;
int best_cost = COST_MAX;
int best_path_index = 0;
- length = X264_MIN(length,X264_LOOKAHEAD_MAX);
+ length = X264_MIN( length, X264_LOOKAHEAD_MAX );
- /* Iterate over all currently possible paths and add suffixes to each one */
- for( suffix_size = 0; suffix_size < num_paths; suffix_size++ )
- {
- memcpy( paths[suffix_size], best_paths[length - (suffix_size + 1)], length - (suffix_size + 1) );
- for( loc = 0; loc < suffix_size; loc++ )
- strcat( paths[suffix_size], "B" );
- strcat( paths[suffix_size], "P" );
- }
-
- /* Calculate the actual cost of each of the current paths */
+ /* Iterate over all currently possible paths */
for( path = 0; path < num_paths; path++ )
{
+ /* Add suffixes to the current path */
+ int len = length - (path + 1);
+ memcpy( paths[path], best_paths[len], len );
+ memset( paths[path]+len, 'B', path );
+ strcat( paths[path], "P" );
+
+ /* Calculate the actual cost of the current path */
int cost = x264_slicetype_path_cost( h, a, frames, paths[path], best_cost );
if( cost < best_cost )
{
memcpy( best_paths[length], paths[best_path_index], length );
}
-static int scenecut( x264_t *h, x264_mb_analysis_t *a, x264_frame_t **frames, int p0, int p1 )
+static int scenecut_internal( x264_t *h, x264_mb_analysis_t *a, x264_frame_t **frames, int p0, int p1, int print )
{
x264_frame_t *frame = frames[p1];
x264_slicetype_frame_cost( h, a, frames, p0, p1, p1, 0 );
int icost = frame->i_cost_est[0][0];
int pcost = frame->i_cost_est[p1-p0][0];
float f_bias;
- int i_gop_size = frame->i_frame - h->frames.i_last_idr;
+ int i_gop_size = frame->i_frame - h->lookahead->i_last_idr;
float f_thresh_max = h->param.i_scenecut_threshold / 100.0;
/* magic numbers pulled out of thin air */
float f_thresh_min = f_thresh_max * h->param.i_keyint_min
}
res = pcost >= (1.0 - f_bias) * icost;
- if( res )
+ if( res && print )
{
int imb = frame->i_intra_mbs[p1-p0];
int pmb = NUM_MBS - imb;
return res;
}
-static void x264_slicetype_analyse( x264_t *h, int keyframe )
+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 )
+{
+ int curp0, curp1, i, maxp1 = p0 + 1;
+
+ /* Only do analysis during a normal scenecut check. */
+ if( real_scenecut && h->param.i_bframe )
+ {
+ /* Look ahead to avoid coding short flashes as scenecuts. */
+ if( h->param.i_bframe_adaptive == X264_B_ADAPT_TRELLIS )
+ /* Don't analyse any more frames than the trellis would have covered. */
+ maxp1 += h->param.i_bframe;
+ else
+ maxp1++;
+ maxp1 = X264_MIN( maxp1, num_frames );
+
+ /* Where A and B are scenes: AAAAAABBBAAAAAA
+ * If BBB is shorter than (maxp1-p0), it is detected as a flash
+ * and not considered a scenecut. */
+ for( curp1 = p1; curp1 <= maxp1; curp1++ )
+ if( !scenecut_internal( h, a, frames, p0, curp1, 0 ) )
+ /* Any frame in between p0 and cur_p1 cannot be a real scenecut. */
+ for( i = curp1; i > p0; i-- )
+ frames[i]->b_scenecut = 0;
+
+ /* Where A-F are scenes: AAAAABBCCDDEEFFFFFF
+ * If each of BB ... EE are shorter than (maxp1-p0), they are
+ * detected as flashes and not considered scenecuts.
+ * Instead, the first F frame becomes a scenecut. */
+ for( curp0 = p0; curp0 < maxp1; curp0++ )
+ if( scenecut_internal( h, a, frames, curp0, maxp1, 0 ) )
+ /* If cur_p0 is the p0 of a scenecut, it cannot be the p1 of a scenecut. */
+ frames[curp0]->b_scenecut = 0;
+ }
+
+ /* Ignore frames that are part of a flash, i.e. cannot be real scenecuts. */
+ if( !frames[p1]->b_scenecut )
+ return 0;
+ return scenecut_internal( h, a, frames, p0, p1, real_scenecut );
+}
+
+void x264_slicetype_analyse( x264_t *h, int keyframe )
{
x264_mb_analysis_t a;
x264_frame_t *frames[X264_LOOKAHEAD_MAX+3] = { NULL, };
- int num_frames;
- int keyint_limit;
- int i,j;
+ int num_frames, orig_num_frames, keyint_limit, idr_frame_type, i, j;
int i_mb_count = NUM_MBS;
int cost1p0, cost2p0, cost1b1, cost2p1;
- int idr_frame_type;
+ int i_max_search = X264_MIN( h->lookahead->next.i_size, X264_LOOKAHEAD_MAX );
+ if( h->param.b_deterministic )
+ i_max_search = X264_MIN( i_max_search, h->lookahead->i_slicetype_length + !keyframe );
assert( h->frames.b_have_lowres );
- if( !h->frames.last_nonb )
+ if( !h->lookahead->last_nonb )
return;
- frames[0] = h->frames.last_nonb;
- for( j = 0; h->frames.next[j] && h->frames.next[j]->i_type == X264_TYPE_AUTO; j++ )
- frames[j+1] = h->frames.next[j];
- keyint_limit = h->param.i_keyint_max - frames[0]->i_frame + h->frames.i_last_idr - 1;
- num_frames = X264_MIN( j, keyint_limit );
+ frames[0] = h->lookahead->last_nonb;
+ for( j = 0; j < i_max_search && h->lookahead->next.list[j]->i_type == X264_TYPE_AUTO; j++ )
+ frames[j+1] = h->lookahead->next.list[j];
- if( num_frames == 0 && (!j || !h->param.rc.b_mb_tree) )
+ if( !j )
return;
- x264_lowres_context_init( h, &a );
- idr_frame_type = frames[1]->i_frame - h->frames.i_last_idr >= h->param.i_keyint_min ? X264_TYPE_IDR : X264_TYPE_I;
+ keyint_limit = h->param.i_keyint_max - frames[0]->i_frame + h->lookahead->i_last_idr - 1;
+ orig_num_frames = num_frames = X264_MIN( j, keyint_limit );
- if( num_frames == 1 && !h->param.rc.b_mb_tree )
- {
- frames[1]->i_type = X264_TYPE_P;
- if( h->param.i_scenecut_threshold && scenecut( h, &a, frames, 0, 1 ) )
- frames[1]->i_type = idr_frame_type;
- return;
- }
+ x264_lowres_context_init( h, &a );
+ idr_frame_type = frames[1]->i_frame - h->lookahead->i_last_idr >= h->param.i_keyint_min ? X264_TYPE_IDR : X264_TYPE_I;
/* This is important psy-wise: if we have a non-scenecut keyframe,
* there will be significant visual artifacts if the frames just before
* go down in quality due to being referenced less, despite it being
* more RD-optimal. */
- if( h->param.analyse.b_psy && h->param.rc.b_mb_tree )
+ if( (h->param.analyse.b_psy && h->param.rc.b_mb_tree) || h->param.rc.i_vbv_buffer_size )
num_frames = j;
+ else if( num_frames == 1 )
+ {
+ frames[1]->i_type = X264_TYPE_P;
+ if( h->param.i_scenecut_threshold && scenecut( h, &a, frames, 0, 1, 1, orig_num_frames ) )
+ frames[1]->i_type = idr_frame_type;
+ return;
+ }
+ else if( num_frames == 0 )
+ {
+ frames[1]->i_type = idr_frame_type;
+ return;
+ }
char best_paths[X264_LOOKAHEAD_MAX][X264_LOOKAHEAD_MAX] = {"","P"};
int n;
int max_bframes = X264_MIN(num_frames-1, h->param.i_bframe);
int num_analysed_frames = num_frames;
int reset_start;
- if( h->param.i_scenecut_threshold && scenecut( h, &a, frames, 0, 1 ) )
+ if( h->param.i_scenecut_threshold && scenecut( h, &a, frames, 0, 1, 1, orig_num_frames ) )
{
frames[1]->i_type = idr_frame_type;
return;
{
/* Perform the frametype analysis. */
for( n = 2; n < num_frames-1; n++ )
- x264_slicetype_path( h, &a, frames, n, max_bframes, num_frames-max_bframes, best_paths );
- num_bframes = strspn( best_paths[num_frames-2], "B" );
- /* Load the results of the analysis into the frame types. */
- for( j = 1; j < num_frames; j++ )
- frames[j]->i_type = best_paths[num_frames-2][j-1] == 'B' ? X264_TYPE_B : X264_TYPE_P;
+ x264_slicetype_path( h, &a, frames, n, max_bframes, best_paths );
+ if( num_frames > 1 )
+ {
+ num_bframes = strspn( best_paths[num_frames-2], "B" );
+ /* Load the results of the analysis into the frame types. */
+ for( j = 1; j < num_frames; j++ )
+ frames[j]->i_type = best_paths[num_frames-2][j-1] == 'B' ? X264_TYPE_B : X264_TYPE_P;
+ }
frames[num_frames]->i_type = X264_TYPE_P;
}
else if( h->param.i_bframe_adaptive == X264_B_ADAPT_FAST )
frames[i+1]->i_type = X264_TYPE_B;
frames[i+2]->i_type = X264_TYPE_P;
- for( j = i+2; j <= X264_MIN( h->param.i_bframe, num_frames-2 ); j++ )
+ for( j = i+2; j <= X264_MIN( h->param.i_bframe, num_frames-1 ); j++ )
{
int pthresh = X264_MAX(INTER_THRESH - P_SENS_BIAS * (j-i-1), INTER_THRESH/10);
int pcost = x264_slicetype_frame_cost( h, &a, frames, i+0, j+1, j+1, 1 );
/* Check scenecut on the first minigop. */
for( j = 1; j < num_bframes+1; j++ )
- if( h->param.i_scenecut_threshold && scenecut( h, &a, frames, j, j+1 ) )
+ if( h->param.i_scenecut_threshold && scenecut( h, &a, frames, j, j+1, 0, orig_num_frames ) )
{
frames[j]->i_type = X264_TYPE_P;
num_analysed_frames = j;
num_bframes = 0;
}
+ for( j = 1; j <= num_frames; j++ )
+ if( frames[j]->i_type == X264_TYPE_AUTO )
+ frames[j]->i_type = X264_TYPE_P;
+
/* Perform the actual macroblock tree analysis.
- * Don't go farther than the lookahead parameter; this helps in short GOPs. */
+ * Don't go farther than the maximum keyframe interval; this helps in short GOPs. */
if( h->param.rc.b_mb_tree )
- x264_macroblock_tree( h, &a, frames, X264_MIN(num_analysed_frames, h->param.rc.i_lookahead), keyframe );
+ x264_macroblock_tree( h, &a, frames, X264_MIN(num_frames, h->param.i_keyint_max), keyframe );
/* Enforce keyframe limit. */
- for( j = 0; j <= num_bframes; j++ )
- if( j+1 > keyint_limit )
+ for( j = 0; j < num_frames; j++ )
+ {
+ if( ((j-keyint_limit) % h->param.i_keyint_max) == 0 )
{
- if( j )
+ if( j && h->param.i_keyint_max > 1 )
frames[j]->i_type = X264_TYPE_P;
- frames[j+1]->i_type = idr_frame_type;
- reset_start = j+2;
- break;
+ frames[j+1]->i_type = X264_TYPE_IDR;
+ reset_start = X264_MIN( reset_start, j+2 );
}
+ }
+
+ if( h->param.rc.i_vbv_buffer_size )
+ x264_vbv_lookahead( h, &a, frames, num_frames, keyframe );
/* Restore frametypes for all frames that haven't actually been decided yet. */
for( j = reset_start; j <= num_frames; j++ )
int bframes;
int i;
- if( h->frames.next[0] == NULL )
+ if( !h->lookahead->next.i_size )
return;
if( h->param.rc.b_stat_read )
{
/* Use the frame types from the first pass */
- for( i = 0; h->frames.next[i] != NULL; i++ )
- h->frames.next[i]->i_type =
- x264_ratecontrol_slice_type( h, h->frames.next[i]->i_frame );
+ for( i = 0; i < h->lookahead->next.i_size; i++ )
+ h->lookahead->next.list[i]->i_type =
+ x264_ratecontrol_slice_type( h, h->lookahead->next.list[i]->i_frame );
}
else if( (h->param.i_bframe && h->param.i_bframe_adaptive)
|| h->param.i_scenecut_threshold
- || h->param.rc.b_mb_tree )
+ || h->param.rc.b_mb_tree
+ || (h->param.rc.i_vbv_buffer_size && h->param.rc.i_lookahead) )
x264_slicetype_analyse( h, 0 );
for( bframes = 0;; bframes++ )
{
- frm = h->frames.next[bframes];
+ frm = h->lookahead->next.list[bframes];
/* Limit GOP size */
- if( frm->i_frame - h->frames.i_last_idr >= h->param.i_keyint_max )
+ if( frm->i_frame - h->lookahead->i_last_idr >= h->param.i_keyint_max )
{
if( frm->i_type == X264_TYPE_AUTO )
frm->i_type = X264_TYPE_IDR;
if( frm->i_type == X264_TYPE_IDR )
{
/* Close GOP */
+ h->lookahead->i_last_idr = frm->i_frame;
if( bframes > 0 )
{
bframes--;
- h->frames.next[bframes]->i_type = X264_TYPE_P;
- }
- else
- {
- h->i_frame_num = 0;
+ h->lookahead->next.list[bframes]->i_type = X264_TYPE_P;
}
}
- if( bframes == h->param.i_bframe
- || h->frames.next[bframes+1] == NULL )
+ if( bframes == h->param.i_bframe ||
+ !h->lookahead->next.list[bframes+1] )
{
if( IS_X264_TYPE_B( frm->i_type ) )
x264_log( h, X264_LOG_WARNING, "specified frame type is not compatible with max B-frames\n" );
else if( !IS_X264_TYPE_B( frm->i_type ) ) break;
}
+
+ if( bframes )
+ h->lookahead->next.list[bframes-1]->b_last_minigop_bframe = 1;
+ h->lookahead->next.list[bframes]->i_bframes = bframes;
+
+ /* calculate the frame costs ahead of time for x264_rc_analyse_slice while we still have lowres */
+ if( h->param.rc.i_rc_method != X264_RC_CQP )
+ {
+ x264_mb_analysis_t a;
+ x264_frame_t *frames[X264_BFRAME_MAX+2] = { NULL, };
+ int p0=0, p1, b;
+
+ x264_lowres_context_init( h, &a );
+
+ if( IS_X264_TYPE_I( h->lookahead->next.list[bframes]->i_type ) )
+ p1 = b = 0;
+ else // P
+ p1 = b = bframes + 1;
+ frames[p0] = h->lookahead->last_nonb;
+ frames[b] = h->lookahead->next.list[bframes];
+
+ x264_slicetype_frame_cost( h, &a, frames, p0, p1, b, 0 );
+
+ if( b && h->param.rc.i_vbv_buffer_size )
+ {
+ /* We need the intra costs for row SATDs. */
+ x264_slicetype_frame_cost( h, &a, frames, b, b, b, 0 );
+
+ /* We need B-frame costs for row SATDs. */
+ for( i = 0; i < bframes; i++ )
+ {
+ b = bframes - i;
+ frames[b] = h->lookahead->next.list[i];
+ x264_slicetype_frame_cost( h, &a, frames, p0, p1, b, 0 );
+ }
+ }
+ }
}
int x264_rc_analyse_slice( x264_t *h )
{
- x264_mb_analysis_t a;
- x264_frame_t *frames[X264_LOOKAHEAD_MAX+2] = { NULL, };
+ x264_frame_t *frames[X264_BFRAME_MAX+2] = { NULL, };
int p0=0, p1, b;
int cost;
- x264_lowres_context_init( h, &a );
-
if( IS_X264_TYPE_I(h->fenc->i_type) )
- {
p1 = b = 0;
- /* For MB-tree, we have to perform propagation analysis on I-frames too. */
- if( h->param.rc.b_mb_tree )
- {
- h->frames.last_nonb = h->fenc;
- x264_slicetype_analyse( h, 1 );
- }
- }
- else if( X264_TYPE_P == h->fenc->i_type )
- {
- p1 = 0;
- while( h->frames.current[p1] && IS_X264_TYPE_B( h->frames.current[p1]->i_type ) )
- p1++;
- p1++;
- b = p1;
- }
+ else if( h->fenc->i_type == X264_TYPE_P )
+ p1 = b = h->fenc->i_bframes + 1;
else //B
{
p1 = (h->fref1[0]->i_poc - h->fref0[0]->i_poc)/2;
frames[p0] = h->fref0[0];
frames[b] = h->fenc;
- if( h->param.rc.b_mb_tree )
- cost = x264_slicetype_frame_cost_recalculate( h, &a, frames, p0, p1, b );
- else
- {
- cost = x264_slicetype_frame_cost( h, &a, frames, p0, p1, b, 0 );
+ /* cost should have been already calculated by x264_slicetype_decide */
+ cost = frames[b]->i_cost_est[b-p0][p1-b];
+ assert( cost >= 0 );
- /* In AQ, use the weighted score instead. */
- if( h->param.rc.i_aq_mode )
- cost = frames[b]->i_cost_est[b-p0][p1-b];
+ if( h->param.rc.b_mb_tree && !h->param.rc.b_stat_read )
+ {
+ cost = x264_slicetype_frame_cost_recalculate( h, frames, p0, p1, b );
+ if( b && h->param.rc.i_vbv_buffer_size )
+ x264_slicetype_frame_cost_recalculate( h, frames, b, b, b );
}
+ /* In AQ, use the weighted score instead. */
+ else if( h->param.rc.i_aq_mode )
+ cost = frames[b]->i_cost_est_aq[b-p0][p1-b];
h->fenc->i_row_satd = h->fenc->i_row_satds[b-p0][p1-b];
h->fdec->i_row_satd = h->fdec->i_row_satds[b-p0][p1-b];
h->fdec->i_satd = cost;
memcpy( h->fdec->i_row_satd, h->fenc->i_row_satd, h->sps->i_mb_height * sizeof(int) );
+ if( !IS_X264_TYPE_I(h->fenc->i_type) )
+ memcpy( h->fdec->i_row_satds[0][0], h->fenc->i_row_satds[0][0], h->sps->i_mb_height * sizeof(int) );
return cost;
}
projects / x264 / blobdiff