Home
last modified time | relevance | path

Searched refs:max_merge_cand (Results 1 – 2 of 2) sorted by relevance

/external/libhevc/encoder/
Dihevce_cabac_cu_pu.c511 WORD32 ihevce_cabac_encode_merge_idx(cab_ctxt_t *ps_cabac, WORD32 merge_idx, WORD32 max_merge_cand) in ihevce_cabac_encode_merge_idx() argument
517 ASSERT((merge_idx >= 0) && (merge_idx < max_merge_cand)); in ihevce_cabac_encode_merge_idx()
520 if(max_merge_cand > 1) in ihevce_cabac_encode_merge_idx()
526 if((max_merge_cand > 2) && (merge_idx > 0)) in ihevce_cabac_encode_merge_idx()
529 ihevce_cabac_encode_tunary_bypass(ps_cabac, (merge_idx - 1), (max_merge_cand - 2)); in ihevce_cabac_encode_merge_idx()
784 WORD32 max_merge_cand = ps_slice_hdr->i1_max_num_merge_cand; in ihevce_cabac_encode_inter_pu() local
801 ret |= ihevce_cabac_encode_merge_idx(ps_cabac, merge_idx, max_merge_cand); in ihevce_cabac_encode_inter_pu()
876 ret |= ihevce_cabac_encode_merge_idx(ps_cabac, merge_idx, max_merge_cand); in ihevce_cabac_encode_inter_pu()
Dihevce_enc_loop_structs.h174 #define COMPUTE_MERGE_IDX_COST(merge_idx_0_model, merge_idx, max_merge_cand, lambda, cost) \ argument
179 ASSERT((merge_idx >= 0) && (merge_idx < max_merge_cand)); \
182 if(max_merge_cand > 1) \
190 if((max_merge_cand > 2) && (merge_idx > 0)) \
192 cab_bits_q12 += (MIN(merge_idx, (max_merge_cand - 2))) << CABAC_FRAC_BITS_Q; \