libavcodec/motion_est.c:1938: error: Buffer Overrun L2
  Offset: [3, 4] (⇐ [2, 3] + 1) Size: 4 by call to `interlaced_search`.

libavcodec/motion_est.c:1938:16: Call
1936.                                  s->b_forw_mv_table[xy][0], s->b_forw_mv_table[xy][1], 0);
1937.         c->current_mv_penalty= c->mv_penalty[s->b_code] + MAX_MV;
1938.         bimin= interlaced_search(s, 2,
                     ^
1939.                                  s->b_field_mv_table[1], s->b_field_select_table[1],
1940.                                  s->b_back_mv_table[xy][0], s->b_back_mv_table[xy][1], 0);

libavcodec/motion_est.c:893:1: Parameter `ref_index`
  891. }
  892. 
  893. static int interlaced_search(MpegEncContext *s, int ref_index,
       ^
  894.                              int16_t (*mv_tables[2][2])[2], uint8_t *field_select_tables[2], int mx, int my, int user_field_select)
  895. {

libavcodec/motion_est.c:953:20: Call
  951.             P_MV1[1]= my / 2;
  952. 
  953.             dmin = epzs_motion_search2(s, &mx_i, &my_i, P, block, field_select+ref_index, mv_table, (1<<16)>>1);
                          ^
  954. 
  955.             dmin= c->sub_motion_search(s, &mx_i, &my_i, dmin, block, field_select+ref_index, size, h);

libavcodec/motion_est_template.c:1191:1: Parameter `ref_index`
    1189. 
    1190. //try to merge with above FIXME (needs PSNR test)
    1191. static int epzs_motion_search2(MpegEncContext * s,
          ^
    1192.                              int *mx_ptr, int *my_ptr, int P[10][2],
    1193.                              int src_index, int ref_index, int16_t (*last_mv)[2],

libavcodec/motion_est_template.c:1241:11: Call
    1239.     }
    1240. 
    1241.     dmin= diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);
                    ^
    1242. 
    1243.     *mx_ptr= best[0];

libavcodec/motion_est_template.c:973:1: Parameter `ref_index`
      971. }
      972. 
      973. static av_always_inline int diamond_search(MpegEncContext * s, int *best, int dmin,
           ^
      974.                                        int src_index, int ref_index, int const penalty_factor,
      975.                                        int size, int h, int flags){

libavcodec/motion_est_template.c:980:18: Call
      978.         return funny_diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);
      979.     else if(c->dia_size<-1)
      980.         return   sab_diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);
                            ^
      981.     else if(c->dia_size<2)
      982.         return small_diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);

libavcodec/motion_est_template.c:809:1: Parameter `ref_index`
        807. 
        808. #define MAX_SAB_SIZE ME_MAP_SIZE
        809. static int sab_diamond_search(MpegEncContext * s, int *best, int dmin,
             ^
        810.                                        int src_index, int ref_index, int const penalty_factor,
        811.                                        int size, int h, int flags)

libavcodec/motion_est_template.c:872:9: Call
        870.            continue;
        871. 
        872.         SAB_CHECK_MV(x-1, y)
                     ^
        873.         SAB_CHECK_MV(x+1, y)
        874.         SAB_CHECK_MV(x  , y-1)

libavcodec/motion_est.c:108:1: <Length trace>
106.     against a proposed motion-compensated prediction of that block
107.  */
108. static av_always_inline int cmp(MpegEncContext *s, const int x, const int y, const int subx, const int suby,
     ^
109.                       const int size, const int h, int ref_index, int src_index,
110.                       me_cmp_func cmp_func, me_cmp_func chroma_cmp_func, const int flags){

libavcodec/motion_est.c:108:1: Parameter `ref_index`
          106.     against a proposed motion-compensated prediction of that block
          107.  */
          108. static av_always_inline int cmp(MpegEncContext *s, const int x, const int y, const int subx, const int suby,
               ^
          109.                       const int size, const int h, int ref_index, int src_index,
          110.                       me_cmp_func cmp_func, me_cmp_func chroma_cmp_func, const int flags){

libavcodec/motion_est.c:119:5: Assignment
          117.     const int hx= subx + (x<<(1+qpel));
          118.     const int hy= suby + (y<<(1+qpel));
          119.     uint8_t * const * const ref= c->ref[ref_index];
                   ^
          120.     uint8_t * const * const src= c->src[src_index];
          121.     int d;

libavcodec/motion_est.c:208:50: Array access: Offset: [3, 4] (⇐ [2, 3] + 1) Size: 4 by call to `interlaced_search` 
          206.         if(chroma){
          207.             uint8_t * const uvtemp= c->temp + 16*stride;
          208.             c->hpel_put[size+1][uvdxy](uvtemp  , ref[1] + (x>>1) + (y>>1)*uvstride, uvstride, h>>1);
                                                                ^
          209.             c->hpel_put[size+1][uvdxy](uvtemp+8, ref[2] + (x>>1) + (y>>1)*uvstride, uvstride, h>>1);
          210.             d += chroma_cmp_func(s, uvtemp  , src[1], uvstride, h>>1);

static av_always_inline int cmp(MpegEncContext *s, const int x, const int y, const int subx, const int suby,
                      const int size, const int h, int ref_index, int src_index,
                      me_cmp_func cmp_func, me_cmp_func chroma_cmp_func, const int flags){
    MotionEstContext * const c= &s->me;
    const int stride= c->stride;
    const int uvstride= c->uvstride;
    const int qpel= flags&FLAG_QPEL;
    const int chroma= flags&FLAG_CHROMA;
    const int dxy= subx + (suby<<(1+qpel));
    const int hx= subx + (x<<(1+qpel));
    const int hy= suby + (y<<(1+qpel));
    uint8_t * const * const ref= c->ref[ref_index];
    uint8_t * const * const src= c->src[src_index];
    int d;
    if(flags&FLAG_DIRECT){
        assert(x >= c->xmin && hx <= c->xmax<<(qpel+1) && y >= c->ymin && hy <= c->ymax<<(qpel+1));
        if(x >= c->xmin && hx <= c->xmax<<(qpel+1) && y >= c->ymin && hy <= c->ymax<<(qpel+1)){
            const int time_pp= s->pp_time;
            const int time_pb= s->pb_time;
            const int mask= 2*qpel+1;
            if(s->mv_type==MV_TYPE_8X8){
                int i;
                for(i=0; i<4; i++){
                    int fx = c->direct_basis_mv[i][0] + hx;
                    int fy = c->direct_basis_mv[i][1] + hy;
                    int bx = hx ? fx - c->co_located_mv[i][0] : c->co_located_mv[i][0]*(time_pb - time_pp)/time_pp + ((i &1)<<(qpel+4));
                    int by = hy ? fy - c->co_located_mv[i][1] : c->co_located_mv[i][1]*(time_pb - time_pp)/time_pp + ((i>>1)<<(qpel+4));
                    int fxy= (fx&mask) + ((fy&mask)<<(qpel+1));
                    int bxy= (bx&mask) + ((by&mask)<<(qpel+1));
                    uint8_t *dst= c->temp + 8*(i&1) + 8*stride*(i>>1);
                    if(qpel){
                        c->qpel_put[1][fxy](dst, ref[0] + (fx>>2) + (fy>>2)*stride, stride);
                        c->qpel_avg[1][bxy](dst, ref[8] + (bx>>2) + (by>>2)*stride, stride);
                    }else{
                        c->hpel_put[1][fxy](dst, ref[0] + (fx>>1) + (fy>>1)*stride, stride, 8);
                        c->hpel_avg[1][bxy](dst, ref[8] + (bx>>1) + (by>>1)*stride, stride, 8);
                    }
                }
            }else{
                int fx = c->direct_basis_mv[0][0] + hx;
                int fy = c->direct_basis_mv[0][1] + hy;
                int bx = hx ? fx - c->co_located_mv[0][0] : (c->co_located_mv[0][0]*(time_pb - time_pp)/time_pp);
                int by = hy ? fy - c->co_located_mv[0][1] : (c->co_located_mv[0][1]*(time_pb - time_pp)/time_pp);
                int fxy= (fx&mask) + ((fy&mask)<<(qpel+1));
                int bxy= (bx&mask) + ((by&mask)<<(qpel+1));
                if(qpel){
                    c->qpel_put[1][fxy](c->temp               , ref[0] + (fx>>2) + (fy>>2)*stride               , stride);
                    c->qpel_put[1][fxy](c->temp + 8           , ref[0] + (fx>>2) + (fy>>2)*stride + 8           , stride);
                    c->qpel_put[1][fxy](c->temp     + 8*stride, ref[0] + (fx>>2) + (fy>>2)*stride     + 8*stride, stride);
                    c->qpel_put[1][fxy](c->temp + 8 + 8*stride, ref[0] + (fx>>2) + (fy>>2)*stride + 8 + 8*stride, stride);
                    c->qpel_avg[1][bxy](c->temp               , ref[8] + (bx>>2) + (by>>2)*stride               , stride);
                    c->qpel_avg[1][bxy](c->temp + 8           , ref[8] + (bx>>2) + (by>>2)*stride + 8           , stride);
                    c->qpel_avg[1][bxy](c->temp     + 8*stride, ref[8] + (bx>>2) + (by>>2)*stride     + 8*stride, stride);
                    c->qpel_avg[1][bxy](c->temp + 8 + 8*stride, ref[8] + (bx>>2) + (by>>2)*stride + 8 + 8*stride, stride);
                }else{
                    assert((fx>>1) + 16*s->mb_x >= -16);
                    assert((fy>>1) + 16*s->mb_y >= -16);
                    assert((fx>>1) + 16*s->mb_x <= s->width);
                    assert((fy>>1) + 16*s->mb_y <= s->height);
                    assert((bx>>1) + 16*s->mb_x >= -16);
                    assert((by>>1) + 16*s->mb_y >= -16);
                    assert((bx>>1) + 16*s->mb_x <= s->width);
                    assert((by>>1) + 16*s->mb_y <= s->height);
                    c->hpel_put[0][fxy](c->temp, ref[0] + (fx>>1) + (fy>>1)*stride, stride, 16);
                    c->hpel_avg[0][bxy](c->temp, ref[8] + (bx>>1) + (by>>1)*stride, stride, 16);
                }
            }
            d = cmp_func(s, c->temp, src[0], stride, 16);
        }else
            d= 256*256*256*32;
    }else{
        int uvdxy;
        if(dxy){
            if(qpel){
                c->qpel_put[size][dxy](c->temp, ref[0] + x + y*stride, stride);
                if(chroma){
                    int cx= hx/2;
                    int cy= hy/2;
                    cx= (cx>>1)|(cx&1);
                    cy= (cy>>1)|(cy&1);
                    uvdxy= (cx&1) + 2*(cy&1);
                }
            }else{
                c->hpel_put[size][dxy](c->temp, ref[0] + x + y*stride, stride, h);
                if(chroma)
                    uvdxy= dxy | (x&1) | (2*(y&1));
            }
            d = cmp_func(s, c->temp, src[0], stride, h);
        }else{
            d = cmp_func(s, src[0], ref[0] + x + y*stride, stride, h);
            if(chroma)
                uvdxy= (x&1) + 2*(y&1);
        }
        if(chroma){
            uint8_t * const uvtemp= c->temp + 16*stride;
            c->hpel_put[size+1][uvdxy](uvtemp  , ref[1] + (x>>1) + (y>>1)*uvstride, uvstride, h>>1);
            c->hpel_put[size+1][uvdxy](uvtemp+8, ref[2] + (x>>1) + (y>>1)*uvstride, uvstride, h>>1);
            d += chroma_cmp_func(s, uvtemp  , src[1], uvstride, h>>1);
            d += chroma_cmp_func(s, uvtemp+8, src[2], uvstride, h>>1);
        }
    }
#if 0
    if(full_pel){
        const int index= (((y)<<ME_MAP_SHIFT) + (x))&(ME_MAP_SIZE-1);
        score_map[index]= d;
    }
    d += (c->mv_penalty[hx - c->pred_x] + c->mv_penalty[hy - c->pred_y])*c->penalty_factor;
#endif
    return d;
}
['void ff_estimate_b_frame_motion(MpegEncContext * s,\n                             int mb_x, int mb_y)\n{\n    MotionEstContext * const c= &s->me;\n    const int penalty_factor= c->mb_penalty_factor;\n    int fmin, bmin, dmin, fbmin, bimin, fimin;\n    int type=0;\n    const int xy = mb_y*s->mb_stride + mb_x;\n    init_ref(c, s->new_picture.data, s->last_picture.data, s->next_picture.data, 16*mb_x, 16*mb_y, 2);\n    get_limits(s, 16*mb_x, 16*mb_y);\n    c->skip=0;\n    if(s->codec_id == CODEC_ID_MPEG4 && s->next_picture.mbskip_table[xy]){\n        int score= direct_search(s, mb_x, mb_y);\n        score= ((unsigned)(score*score + 128*256))>>16;\n        c->mc_mb_var_sum_temp += score;\n        s->current_picture.mc_mb_var[mb_y*s->mb_stride + mb_x] = score;\n        s->mb_type[mb_y*s->mb_stride + mb_x]= CANDIDATE_MB_TYPE_DIRECT0;\n        return;\n    }\n    if(c->avctx->me_threshold){\n        int vard= check_input_motion(s, mb_x, mb_y, 0);\n        if((vard+128)>>8 < c->avctx->me_threshold){\n             s->current_picture.mc_mb_var[s->mb_stride * mb_y + mb_x] = (vard+128)>>8;\n            c->mc_mb_var_sum_temp += (vard+128)>>8;\n            return;\n        }\n        if((vard+128)>>8 < c->avctx->mb_threshold){\n            type= s->mb_type[mb_y*s->mb_stride + mb_x];\n            if(type == CANDIDATE_MB_TYPE_DIRECT){\n                direct_search(s, mb_x, mb_y);\n            }\n            if(type == CANDIDATE_MB_TYPE_FORWARD || type == CANDIDATE_MB_TYPE_BIDIR){\n                c->skip=0;\n                ff_estimate_motion_b(s, mb_x, mb_y, s->b_forw_mv_table, 0, s->f_code);\n            }\n            if(type == CANDIDATE_MB_TYPE_BACKWARD || type == CANDIDATE_MB_TYPE_BIDIR){\n                c->skip=0;\n                ff_estimate_motion_b(s, mb_x, mb_y, s->b_back_mv_table, 2, s->b_code);\n            }\n            if(type == CANDIDATE_MB_TYPE_FORWARD_I || type == CANDIDATE_MB_TYPE_BIDIR_I){\n                c->skip=0;\n                c->current_mv_penalty= c->mv_penalty[s->f_code] + MAX_MV;\n                interlaced_search(s, 0,\n                                        s->b_field_mv_table[0], s->b_field_select_table[0],\n                                        s->b_forw_mv_table[xy][0], s->b_forw_mv_table[xy][1], 1);\n            }\n            if(type == CANDIDATE_MB_TYPE_BACKWARD_I || type == CANDIDATE_MB_TYPE_BIDIR_I){\n                c->skip=0;\n                c->current_mv_penalty= c->mv_penalty[s->b_code] + MAX_MV;\n                interlaced_search(s, 2,\n                                        s->b_field_mv_table[1], s->b_field_select_table[1],\n                                        s->b_back_mv_table[xy][0], s->b_back_mv_table[xy][1], 1);\n            }\n            return;\n        }\n    }\n    if (s->codec_id == CODEC_ID_MPEG4)\n        dmin= direct_search(s, mb_x, mb_y);\n    else\n        dmin= INT_MAX;\n    c->skip=0;\n    fmin= ff_estimate_motion_b(s, mb_x, mb_y, s->b_forw_mv_table, 0, s->f_code) + 3*penalty_factor;\n    c->skip=0;\n    bmin= ff_estimate_motion_b(s, mb_x, mb_y, s->b_back_mv_table, 2, s->b_code) + 2*penalty_factor;\n    c->skip=0;\n    fbmin= bidir_refine(s, mb_x, mb_y) + penalty_factor;\n    if(s->flags & CODEC_FLAG_INTERLACED_ME){\n        c->skip=0;\n        c->current_mv_penalty= c->mv_penalty[s->f_code] + MAX_MV;\n        fimin= interlaced_search(s, 0,\n                                 s->b_field_mv_table[0], s->b_field_select_table[0],\n                                 s->b_forw_mv_table[xy][0], s->b_forw_mv_table[xy][1], 0);\n        c->current_mv_penalty= c->mv_penalty[s->b_code] + MAX_MV;\n        bimin= interlaced_search(s, 2,\n                                 s->b_field_mv_table[1], s->b_field_select_table[1],\n                                 s->b_back_mv_table[xy][0], s->b_back_mv_table[xy][1], 0);\n    }else\n        fimin= bimin= INT_MAX;\n    {\n        int score= fmin;\n        type = CANDIDATE_MB_TYPE_FORWARD;\n        if (dmin <= score){\n            score = dmin;\n            type = CANDIDATE_MB_TYPE_DIRECT;\n        }\n        if(bmin<score){\n            score=bmin;\n            type= CANDIDATE_MB_TYPE_BACKWARD;\n        }\n        if(fbmin<score){\n            score=fbmin;\n            type= CANDIDATE_MB_TYPE_BIDIR;\n        }\n        if(fimin<score){\n            score=fimin;\n            type= CANDIDATE_MB_TYPE_FORWARD_I;\n        }\n        if(bimin<score){\n            score=bimin;\n            type= CANDIDATE_MB_TYPE_BACKWARD_I;\n        }\n        score= ((unsigned)(score*score + 128*256))>>16;\n        c->mc_mb_var_sum_temp += score;\n        s->current_picture.mc_mb_var[mb_y*s->mb_stride + mb_x] = score;\n    }\n    if(c->avctx->mb_decision > FF_MB_DECISION_SIMPLE){\n        type= CANDIDATE_MB_TYPE_FORWARD | CANDIDATE_MB_TYPE_BACKWARD | CANDIDATE_MB_TYPE_BIDIR | CANDIDATE_MB_TYPE_DIRECT;\n        if(fimin < INT_MAX)\n            type |= CANDIDATE_MB_TYPE_FORWARD_I;\n        if(bimin < INT_MAX)\n            type |= CANDIDATE_MB_TYPE_BACKWARD_I;\n        if(fimin < INT_MAX && bimin < INT_MAX){\n            type |= CANDIDATE_MB_TYPE_BIDIR_I;\n        }\n        if(dmin>256*256*16) type&= ~CANDIDATE_MB_TYPE_DIRECT;\n        if(s->codec_id == CODEC_ID_MPEG4 && type&CANDIDATE_MB_TYPE_DIRECT && s->flags&CODEC_FLAG_MV0 && *(uint32_t*)s->b_direct_mv_table[xy])\n            type |= CANDIDATE_MB_TYPE_DIRECT0;\n#if 0\n        if(s->out_format == FMT_MPEG1)\n            type |= CANDIDATE_MB_TYPE_INTRA;\n#endif\n    }\n    s->mb_type[mb_y*s->mb_stride + mb_x]= type;\n}', 'static int interlaced_search(MpegEncContext *s, int ref_index,\n                             int16_t (*mv_tables[2][2])[2], uint8_t *field_select_tables[2], int mx, int my, int user_field_select)\n{\n    MotionEstContext * const c= &s->me;\n    const int size=0;\n    const int h=8;\n    int block;\n    int P[10][2];\n    uint8_t * const mv_penalty= c->current_mv_penalty;\n    int same=1;\n    const int stride= 2*s->linesize;\n    int dmin_sum= 0;\n    const int mot_stride= s->mb_stride;\n    const int xy= s->mb_x + s->mb_y*mot_stride;\n    c->ymin>>=1;\n    c->ymax>>=1;\n    c->stride<<=1;\n    c->uvstride<<=1;\n    init_interlaced_ref(s, ref_index);\n    for(block=0; block<2; block++){\n        int field_select;\n        int best_dmin= INT_MAX;\n        int best_field= -1;\n        for(field_select=0; field_select<2; field_select++){\n            int dmin, mx_i, my_i;\n            int16_t (*mv_table)[2]= mv_tables[block][field_select];\n            if(user_field_select){\n                assert(field_select==0 || field_select==1);\n                assert(field_select_tables[block][xy]==0 || field_select_tables[block][xy]==1);\n                if(field_select_tables[block][xy] != field_select)\n                    continue;\n            }\n            P_LEFT[0] = mv_table[xy - 1][0];\n            P_LEFT[1] = mv_table[xy - 1][1];\n            if(P_LEFT[0]       > (c->xmax<<1)) P_LEFT[0]       = (c->xmax<<1);\n            c->pred_x= P_LEFT[0];\n            c->pred_y= P_LEFT[1];\n            if(!s->first_slice_line){\n                P_TOP[0]      = mv_table[xy - mot_stride][0];\n                P_TOP[1]      = mv_table[xy - mot_stride][1];\n                P_TOPRIGHT[0] = mv_table[xy - mot_stride + 1][0];\n                P_TOPRIGHT[1] = mv_table[xy - mot_stride + 1][1];\n                if(P_TOP[1]      > (c->ymax<<1)) P_TOP[1]     = (c->ymax<<1);\n                if(P_TOPRIGHT[0] < (c->xmin<<1)) P_TOPRIGHT[0]= (c->xmin<<1);\n                if(P_TOPRIGHT[0] > (c->xmax<<1)) P_TOPRIGHT[0]= (c->xmax<<1);\n                if(P_TOPRIGHT[1] > (c->ymax<<1)) P_TOPRIGHT[1]= (c->ymax<<1);\n                P_MEDIAN[0]= mid_pred(P_LEFT[0], P_TOP[0], P_TOPRIGHT[0]);\n                P_MEDIAN[1]= mid_pred(P_LEFT[1], P_TOP[1], P_TOPRIGHT[1]);\n            }\n            P_MV1[0]= mx;\n            P_MV1[1]= my / 2;\n            dmin = epzs_motion_search2(s, &mx_i, &my_i, P, block, field_select+ref_index, mv_table, (1<<16)>>1);\n            dmin= c->sub_motion_search(s, &mx_i, &my_i, dmin, block, field_select+ref_index, size, h);\n            mv_table[xy][0]= mx_i;\n            mv_table[xy][1]= my_i;\n            if(s->dsp.me_sub_cmp[0] != s->dsp.mb_cmp[0]){\n                int dxy;\n                uint8_t *ref= c->ref[field_select+ref_index][0] + (mx_i>>1) + (my_i>>1)*stride;\n                dxy = ((my_i & 1) << 1) | (mx_i & 1);\n                if(s->no_rounding){\n                    s->dsp.put_no_rnd_pixels_tab[size][dxy](c->scratchpad, ref    , stride, h);\n                }else{\n                    s->dsp.put_pixels_tab       [size][dxy](c->scratchpad, ref    , stride, h);\n                }\n                dmin= s->dsp.mb_cmp[size](s, c->src[block][0], c->scratchpad, stride, h);\n                dmin+= (mv_penalty[mx_i-c->pred_x] + mv_penalty[my_i-c->pred_y] + 1)*c->mb_penalty_factor;\n            }else\n                dmin+= c->mb_penalty_factor;\n            dmin += field_select != block;\n            if(dmin < best_dmin){\n                best_dmin= dmin;\n                best_field= field_select;\n            }\n        }\n        {\n            int16_t (*mv_table)[2]= mv_tables[block][best_field];\n            if(mv_table[xy][0] != mx) same=0;\n            if(mv_table[xy][1]&1) same=0;\n            if(mv_table[xy][1]*2 != my) same=0;\n            if(best_field != block) same=0;\n        }\n        field_select_tables[block][xy]= best_field;\n        dmin_sum += best_dmin;\n    }\n    c->ymin<<=1;\n    c->ymax<<=1;\n    c->stride>>=1;\n    c->uvstride>>=1;\n    if(same)\n        return INT_MAX;\n    switch(c->avctx->mb_cmp&0xFF){\n    case FF_CMP_RD:\n        return dmin_sum;\n    default:\n        return dmin_sum+ 11*c->mb_penalty_factor;\n    }\n}', 'static int epzs_motion_search2(MpegEncContext * s,\n                             int *mx_ptr, int *my_ptr, int P[10][2],\n                             int src_index, int ref_index, int16_t (*last_mv)[2],\n                             int ref_mv_scale)\n{\n    MotionEstContext * const c= &s->me;\n    int best[2]={0, 0};\n    int d, dmin;\n    int map_generation;\n    const int penalty_factor= c->penalty_factor;\n    const int size=0;\n    const int h=8;\n    const int ref_mv_stride= s->mb_stride;\n    const int ref_mv_xy= s->mb_x + s->mb_y *ref_mv_stride;\n    me_cmp_func cmpf, chroma_cmpf;\n    LOAD_COMMON\n    int flags= c->flags;\n    LOAD_COMMON2\n    cmpf= s->dsp.me_cmp[size];\n    chroma_cmpf= s->dsp.me_cmp[size+1];\n    map_generation= update_map_generation(c);\n    dmin = 1000000;\n    if (s->first_slice_line) {\n        CHECK_MV(P_LEFT[0]>>shift, P_LEFT[1]>>shift)\n        CHECK_CLIPPED_MV((last_mv[ref_mv_xy][0]*ref_mv_scale + (1<<15))>>16,\n                        (last_mv[ref_mv_xy][1]*ref_mv_scale + (1<<15))>>16)\n        CHECK_MV(P_MV1[0]>>shift, P_MV1[1]>>shift)\n    }else{\n        CHECK_MV(P_MV1[0]>>shift, P_MV1[1]>>shift)\n        CHECK_MV(P_MEDIAN[0]>>shift, P_MEDIAN[1]>>shift)\n        CHECK_MV(P_LEFT[0]>>shift, P_LEFT[1]>>shift)\n        CHECK_MV(P_TOP[0]>>shift, P_TOP[1]>>shift)\n        CHECK_MV(P_TOPRIGHT[0]>>shift, P_TOPRIGHT[1]>>shift)\n        CHECK_CLIPPED_MV((last_mv[ref_mv_xy][0]*ref_mv_scale + (1<<15))>>16,\n                        (last_mv[ref_mv_xy][1]*ref_mv_scale + (1<<15))>>16)\n    }\n    if(dmin>64*4){\n        CHECK_CLIPPED_MV((last_mv[ref_mv_xy+1][0]*ref_mv_scale + (1<<15))>>16,\n                        (last_mv[ref_mv_xy+1][1]*ref_mv_scale + (1<<15))>>16)\n        if(s->mb_y+1<s->end_mb_y)\n            CHECK_CLIPPED_MV((last_mv[ref_mv_xy+ref_mv_stride][0]*ref_mv_scale + (1<<15))>>16,\n                            (last_mv[ref_mv_xy+ref_mv_stride][1]*ref_mv_scale + (1<<15))>>16)\n    }\n    dmin= diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);\n    *mx_ptr= best[0];\n    *my_ptr= best[1];\n    return dmin;\n}', 'static av_always_inline int diamond_search(MpegEncContext * s, int *best, int dmin,\n                                       int src_index, int ref_index, int const penalty_factor,\n                                       int size, int h, int flags){\n    MotionEstContext * const c= &s->me;\n    if(c->dia_size==-1)\n        return funny_diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);\n    else if(c->dia_size<-1)\n        return   sab_diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);\n    else if(c->dia_size<2)\n        return small_diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);\n    else if(c->dia_size>768)\n        return           umh_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);\n    else if(c->dia_size>512)\n        return           hex_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags, c->dia_size&0xFF);\n    else if(c->dia_size>256)\n        return       l2s_dia_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);\n    else\n        return   var_diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);\n}', 'static int sab_diamond_search(MpegEncContext * s, int *best, int dmin,\n                                       int src_index, int ref_index, int const penalty_factor,\n                                       int size, int h, int flags)\n{\n    MotionEstContext * const c= &s->me;\n    me_cmp_func cmpf, chroma_cmpf;\n    Minima minima[MAX_SAB_SIZE];\n    const int minima_count= FFABS(c->dia_size);\n    int i, j;\n    LOAD_COMMON\n    LOAD_COMMON2\n    int map_generation= c->map_generation;\n    cmpf= s->dsp.me_cmp[size];\n    chroma_cmpf= s->dsp.me_cmp[size+1];\n    for(j=i=0; i<ME_MAP_SIZE && j<MAX_SAB_SIZE; i++){\n        uint32_t key= map[i];\n        key += (1<<(ME_MAP_MV_BITS-1)) + (1<<(2*ME_MAP_MV_BITS-1));\n        if((key&((-1)<<(2*ME_MAP_MV_BITS))) != map_generation) continue;\n        minima[j].height= score_map[i];\n        minima[j].x= key & ((1<<ME_MAP_MV_BITS)-1); key>>=ME_MAP_MV_BITS;\n        minima[j].y= key & ((1<<ME_MAP_MV_BITS)-1);\n        minima[j].x-= (1<<(ME_MAP_MV_BITS-1));\n        minima[j].y-= (1<<(ME_MAP_MV_BITS-1));\n        if(   minima[j].x > xmax || minima[j].x < xmin\n           || minima[j].y > ymax || minima[j].y < ymin)\n            continue;\n        minima[j].checked=0;\n        if(minima[j].x || minima[j].y)\n            minima[j].height+= (mv_penalty[((minima[j].x)<<shift)-pred_x] + mv_penalty[((minima[j].y)<<shift)-pred_y])*penalty_factor;\n        j++;\n    }\n    qsort(minima, j, sizeof(Minima), minima_cmp);\n    for(; j<minima_count; j++){\n        minima[j].height=256*256*256*64;\n        minima[j].checked=0;\n        minima[j].x= minima[j].y=0;\n    }\n    for(i=0; i<minima_count; i++){\n        const int x= minima[i].x;\n        const int y= minima[i].y;\n        int d;\n        if(minima[i].checked) continue;\n        if(   x >= xmax || x <= xmin\n           || y >= ymax || y <= ymin)\n           continue;\n        SAB_CHECK_MV(x-1, y)\n        SAB_CHECK_MV(x+1, y)\n        SAB_CHECK_MV(x  , y-1)\n        SAB_CHECK_MV(x  , y+1)\n        minima[i].checked= 1;\n    }\n    best[0]= minima[0].x;\n    best[1]= minima[0].y;\n    dmin= minima[0].height;\n    if(   best[0] < xmax && best[0] > xmin\n       && best[1] < ymax && best[1] > ymin){\n        int d;\n        CHECK_MV(best[0]-1, best[1])\n        CHECK_MV(best[0]+1, best[1])\n        CHECK_MV(best[0], best[1]-1)\n        CHECK_MV(best[0], best[1]+1)\n    }\n    return dmin;\n}', 'static av_always_inline int cmp(MpegEncContext *s, const int x, const int y, const int subx, const int suby,\n                      const int size, const int h, int ref_index, int src_index,\n                      me_cmp_func cmp_func, me_cmp_func chroma_cmp_func, const int flags){\n    MotionEstContext * const c= &s->me;\n    const int stride= c->stride;\n    const int uvstride= c->uvstride;\n    const int qpel= flags&FLAG_QPEL;\n    const int chroma= flags&FLAG_CHROMA;\n    const int dxy= subx + (suby<<(1+qpel));\n    const int hx= subx + (x<<(1+qpel));\n    const int hy= suby + (y<<(1+qpel));\n    uint8_t * const * const ref= c->ref[ref_index];\n    uint8_t * const * const src= c->src[src_index];\n    int d;\n    if(flags&FLAG_DIRECT){\n        assert(x >= c->xmin && hx <= c->xmax<<(qpel+1) && y >= c->ymin && hy <= c->ymax<<(qpel+1));\n        if(x >= c->xmin && hx <= c->xmax<<(qpel+1) && y >= c->ymin && hy <= c->ymax<<(qpel+1)){\n            const int time_pp= s->pp_time;\n            const int time_pb= s->pb_time;\n            const int mask= 2*qpel+1;\n            if(s->mv_type==MV_TYPE_8X8){\n                int i;\n                for(i=0; i<4; i++){\n                    int fx = c->direct_basis_mv[i][0] + hx;\n                    int fy = c->direct_basis_mv[i][1] + hy;\n                    int bx = hx ? fx - c->co_located_mv[i][0] : c->co_located_mv[i][0]*(time_pb - time_pp)/time_pp + ((i &1)<<(qpel+4));\n                    int by = hy ? fy - c->co_located_mv[i][1] : c->co_located_mv[i][1]*(time_pb - time_pp)/time_pp + ((i>>1)<<(qpel+4));\n                    int fxy= (fx&mask) + ((fy&mask)<<(qpel+1));\n                    int bxy= (bx&mask) + ((by&mask)<<(qpel+1));\n                    uint8_t *dst= c->temp + 8*(i&1) + 8*stride*(i>>1);\n                    if(qpel){\n                        c->qpel_put[1][fxy](dst, ref[0] + (fx>>2) + (fy>>2)*stride, stride);\n                        c->qpel_avg[1][bxy](dst, ref[8] + (bx>>2) + (by>>2)*stride, stride);\n                    }else{\n                        c->hpel_put[1][fxy](dst, ref[0] + (fx>>1) + (fy>>1)*stride, stride, 8);\n                        c->hpel_avg[1][bxy](dst, ref[8] + (bx>>1) + (by>>1)*stride, stride, 8);\n                    }\n                }\n            }else{\n                int fx = c->direct_basis_mv[0][0] + hx;\n                int fy = c->direct_basis_mv[0][1] + hy;\n                int bx = hx ? fx - c->co_located_mv[0][0] : (c->co_located_mv[0][0]*(time_pb - time_pp)/time_pp);\n                int by = hy ? fy - c->co_located_mv[0][1] : (c->co_located_mv[0][1]*(time_pb - time_pp)/time_pp);\n                int fxy= (fx&mask) + ((fy&mask)<<(qpel+1));\n                int bxy= (bx&mask) + ((by&mask)<<(qpel+1));\n                if(qpel){\n                    c->qpel_put[1][fxy](c->temp               , ref[0] + (fx>>2) + (fy>>2)*stride               , stride);\n                    c->qpel_put[1][fxy](c->temp + 8           , ref[0] + (fx>>2) + (fy>>2)*stride + 8           , stride);\n                    c->qpel_put[1][fxy](c->temp     + 8*stride, ref[0] + (fx>>2) + (fy>>2)*stride     + 8*stride, stride);\n                    c->qpel_put[1][fxy](c->temp + 8 + 8*stride, ref[0] + (fx>>2) + (fy>>2)*stride + 8 + 8*stride, stride);\n                    c->qpel_avg[1][bxy](c->temp               , ref[8] + (bx>>2) + (by>>2)*stride               , stride);\n                    c->qpel_avg[1][bxy](c->temp + 8           , ref[8] + (bx>>2) + (by>>2)*stride + 8           , stride);\n                    c->qpel_avg[1][bxy](c->temp     + 8*stride, ref[8] + (bx>>2) + (by>>2)*stride     + 8*stride, stride);\n                    c->qpel_avg[1][bxy](c->temp + 8 + 8*stride, ref[8] + (bx>>2) + (by>>2)*stride + 8 + 8*stride, stride);\n                }else{\n                    assert((fx>>1) + 16*s->mb_x >= -16);\n                    assert((fy>>1) + 16*s->mb_y >= -16);\n                    assert((fx>>1) + 16*s->mb_x <= s->width);\n                    assert((fy>>1) + 16*s->mb_y <= s->height);\n                    assert((bx>>1) + 16*s->mb_x >= -16);\n                    assert((by>>1) + 16*s->mb_y >= -16);\n                    assert((bx>>1) + 16*s->mb_x <= s->width);\n                    assert((by>>1) + 16*s->mb_y <= s->height);\n                    c->hpel_put[0][fxy](c->temp, ref[0] + (fx>>1) + (fy>>1)*stride, stride, 16);\n                    c->hpel_avg[0][bxy](c->temp, ref[8] + (bx>>1) + (by>>1)*stride, stride, 16);\n                }\n            }\n            d = cmp_func(s, c->temp, src[0], stride, 16);\n        }else\n            d= 256*256*256*32;\n    }else{\n        int uvdxy;\n        if(dxy){\n            if(qpel){\n                c->qpel_put[size][dxy](c->temp, ref[0] + x + y*stride, stride);\n                if(chroma){\n                    int cx= hx/2;\n                    int cy= hy/2;\n                    cx= (cx>>1)|(cx&1);\n                    cy= (cy>>1)|(cy&1);\n                    uvdxy= (cx&1) + 2*(cy&1);\n                }\n            }else{\n                c->hpel_put[size][dxy](c->temp, ref[0] + x + y*stride, stride, h);\n                if(chroma)\n                    uvdxy= dxy | (x&1) | (2*(y&1));\n            }\n            d = cmp_func(s, c->temp, src[0], stride, h);\n        }else{\n            d = cmp_func(s, src[0], ref[0] + x + y*stride, stride, h);\n            if(chroma)\n                uvdxy= (x&1) + 2*(y&1);\n        }\n        if(chroma){\n            uint8_t * const uvtemp= c->temp + 16*stride;\n            c->hpel_put[size+1][uvdxy](uvtemp  , ref[1] + (x>>1) + (y>>1)*uvstride, uvstride, h>>1);\n            c->hpel_put[size+1][uvdxy](uvtemp+8, ref[2] + (x>>1) + (y>>1)*uvstride, uvstride, h>>1);\n            d += chroma_cmp_func(s, uvtemp  , src[1], uvstride, h>>1);\n            d += chroma_cmp_func(s, uvtemp+8, src[2], uvstride, h>>1);\n        }\n    }\n#if 0\n    if(full_pel){\n        const int index= (((y)<<ME_MAP_SHIFT) + (x))&(ME_MAP_SIZE-1);\n        score_map[index]= d;\n    }\n    d += (c->mv_penalty[hx - c->pred_x] + c->mv_penalty[hy - c->pred_y])*c->penalty_factor;\n#endif\n    return d;\n}']