Home
last modified time | relevance | path

Searched refs:MAX_NUM_MERGE_CAND (Results 1 – 6 of 6) sorted by relevance

/external/libhevc/encoder/
Dihevce_mv_pred_merge.c811 WORD32 merge_list_priority[MAX_NUM_MERGE_CAND] = { NBR_A1, NBR_B1, NBR_B0, NBR_A0, NBR_B2 }; in ihevce_mv_pred_merge()
814 for(n = 0; n < MAX_NUM_MERGE_CAND; n++) in ihevce_mv_pred_merge()
850 if(num_merge_cand < MAX_NUM_MERGE_CAND) in ihevce_mv_pred_merge()
907 if((num_merge_cand > 1) && (num_merge_cand < MAX_NUM_MERGE_CAND)) in ihevce_mv_pred_merge()
960 (num_merge_cand == MAX_NUM_MERGE_CAND)) in ihevce_mv_pred_merge()
971 if(num_merge_cand < MAX_NUM_MERGE_CAND) in ihevce_mv_pred_merge()
984 while(num_merge_cand < MAX_NUM_MERGE_CAND) in ihevce_mv_pred_merge()
Dihevce_mv_pred_merge.h43 #define MAX_NUM_MERGE_CAND MAX_MERGE_CANDIDATES macro
Dihevce_enc_loop_inter_mode_sifter.h172 UWORD8 au1_valid_merge_indices[MAX_NUM_MERGE_CAND];
Dihevce_enc_loop_inter_mode_sifter.c2009 merge_cand_list_t as_merge_cand[MAX_NUM_MERGE_CAND]; in ihevce_compute_pred_and_populate_modes()
2015 UWORD8 au1_is_top_used[MAX_NUM_MERGE_CAND]; in ihevce_compute_pred_and_populate_modes()
/external/libhevc/decoder/
Dihevcd_defs.h458 #define MAX_NUM_MERGE_CAND 5 macro
Dihevcd_mv_merge.c484 pu_t as_pu_merge_list[MAX_NUM_MERGE_CAND]; in ihevcd_mv_merge()
834 if((candidate_cnt > 1) && (candidate_cnt < MAX_NUM_MERGE_CAND)) in ihevcd_mv_merge()
885 || (candidate_cnt == MAX_NUM_MERGE_CAND)) in ihevcd_mv_merge()