x264运动估计菱形搜索源代码解析

case X264_ME_DIA:
        /* diamond search, radius 1 */             //菱形搜索半径为1，一次只比较5个点
        i = 0;
        bcost <<= 4;                                         
        do
        {
            COST_MV_X4_DIR( 0,-1, 0,1, -1,0, 1,0, costs );              //计算上下左右四个点的cost存于costs数组
            COPY1_IF_LT( bcost, (costs[0]<<4)+1 );                       //接下来四步用于比较5个点的cost，最小值存于bcost，并把最
            COPY1_IF_LT( bcost, (costs[1]<<4)+3 );                    //有点的位置存于bcost的低四位，这也是之前bcost左移4位的用处
            COPY1_IF_LT( bcost, (costs[2]<<4)+4 );
            COPY1_IF_LT( bcost, (costs[3]<<4)+12 );
            if( !(bcost&15) )                       //如果低四位为0，说明原点就是最优点，退出搜索
                break;
            bmx -= (bcost<<28)>>30;      //否则把最优点的横坐标记录在bmx，纵坐标记录在bmy
            bmy -=