zoukankan      html  css  js  c++  java
  • H264源码分析(四)

    sub_mb_pred( mb_type ) {  
        for( mbPartIdx = 0; mbPartIdx < 4; mbPartIdx++ )         
            // sub_mb_type[ mbPartIdx ]    指明子宏块的预测类型,在不同的宏块类型中这个句法元素的语义不一样。     
            sub_mb_type[ mbPartIdx ]  
        for( mbPartIdx = 0; mbPartIdx < 4; mbPartIdx++ )             
            if( ( num_ref_idx_l0_active_minus1    >    0    | |  
    mb_field_decoding_flag ) &&
                mb_type    !=    P_8x8ref0    &&
                sub_mb_type[ mbPartIdx ]    !=    B_Direct_8x8    &&
                SubMbPredMode( sub_mb_type[ mbPartIdx ] )    !=    Pred_L1 )
                ref_idx_l0[ mbPartIdx ]   
        for( mbPartIdx = 0; mbPartIdx < 4; mbPartIdx++ )             
            if( (num_ref_idx_l1_active_minus1    >    0    | |    mb_field_decoding_flag )
    &&
                    sub_mb_type[ mbPartIdx ]    !=    B_Direct_8x8    &&
                    SubMbPredMode( sub_mb_type[ mbPartIdx ] )    !=    Pred_L0 )
                ref_idx_l1[ mbPartIdx ]  
        for( mbPartIdx = 0; mbPartIdx < 4; mbPartIdx++ )             
            if( sub_mb_type[ mbPartIdx ]    !=    B_Direct_8x8    &&
                SubMbPredMode( sub_mb_type[ mbPartIdx ] )    !=    Pred_L1 )
                for( subMbPartIdx = 0;  
                          subMbPartIdx < NumSubMbPart( sub_mb_type[ mbPartIdx ] );
                          subMbPartIdx++)
                    for( compIdx = 0; compIdx < 2; compIdx++ )         
                        mvd_l0[ mbPartIdx ][ subMbPartIdx ][ compIdx ]  
        for( mbPartIdx = 0; mbPartIdx < 4; mbPartIdx++ )         
            if( sub_mb_type[ mbPartIdx ]    !=    B_Direct_8x8    &&
                SubMbPredMode( sub_mb_type[ mbPartIdx ] )    !=    Pred_L0 )
                for( subMbPartIdx = 0;  
                          subMbPartIdx < NumSubMbPart( sub_mb_type[ mbPartIdx ] );
                          subMbPartIdx++)
                    for( compIdx = 0; compIdx < 2; compIdx++ )         
                        mvd_l1[ mbPartIdx ][ subMbPartIdx ][ compIdx ]  
    }

  • 相关阅读:
    week8-A-区间选点
    C-TT的美梦
    B-dijkstra-TT的旅行日记
    week7-A-Floyd-TT的魔法猫
    Codeforces 437B The Child and Set (贡献+贪心)
    Codeforces 1236B Alice and the List of Presents(贡献)
    2019 牛客多校 第八场 B Beauty Values (贡献)
    Codeforces 1244G Running in Pairs 序列交换(贪心)
    Codeforces 1244F Chips(环修改,思维题)
    BZOJ 3784 树上的路径(点分治+ST+堆+贪心)待处理
  • 原文地址:https://www.cnblogs.com/javawebsoa/p/3214914.html
Copyright © 2011-2022 走看看