Home
last modified time | relevance | path

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

/external/libhevc/encoder/
Dihevce_tu_tree_selector.c107 WORD32 ihevce_tu_tree_coverage_in_cu(tu_tree_node_t *ps_node) in ihevce_tu_tree_coverage_in_cu() argument
111 if(ps_node->u1_is_valid_node) in ihevce_tu_tree_coverage_in_cu()
113 i4_tu_tree_area += ps_node->s_luma_data.u1_size * ps_node->s_luma_data.u1_size; in ihevce_tu_tree_coverage_in_cu()
117 if(NULL != ps_node->ps_child_node_tl) in ihevce_tu_tree_coverage_in_cu()
119 i4_tu_tree_area += ihevce_tu_tree_coverage_in_cu(ps_node->ps_child_node_tl); in ihevce_tu_tree_coverage_in_cu()
122 if(NULL != ps_node->ps_child_node_tr) in ihevce_tu_tree_coverage_in_cu()
124 i4_tu_tree_area += ihevce_tu_tree_coverage_in_cu(ps_node->ps_child_node_tr); in ihevce_tu_tree_coverage_in_cu()
127 if(NULL != ps_node->ps_child_node_bl) in ihevce_tu_tree_coverage_in_cu()
129 i4_tu_tree_area += ihevce_tu_tree_coverage_in_cu(ps_node->ps_child_node_bl); in ihevce_tu_tree_coverage_in_cu()
132 if(NULL != ps_node->ps_child_node_br) in ihevce_tu_tree_coverage_in_cu()
[all …]
Dihevce_common_utils.h120 #define CU_TREE_NODE_FILL(ps_node, valid_flag, posx, posy, size, inter_eval_enable) \ argument
122 ps_node->is_node_valid = valid_flag; \
123 ps_node->u1_cu_size = size; \
124 ps_node->u1_intra_eval_enable = 0; \
125 ps_node->b3_cu_pos_x = posx; \
126 ps_node->b3_cu_pos_y = posy; \
127 ps_node->u1_inter_eval_enable = inter_eval_enable; \
Dhme_err_compute.h174 search_node_t *ps_node, pred_ctxt_t *ps_pred_ctxt, PART_ID_T e_part_id, S32 inp_mv_pel);
195 search_node_t *ps_node, pred_ctxt_t *ps_pred_ctxt, PART_ID_T e_part_id, S32 inp_mv_pel);
216 search_node_t *ps_node, pred_ctxt_t *ps_pred_ctxt, PART_ID_T e_part_id, S32 inp_mv_pel);
237 search_node_t *ps_node, pred_ctxt_t *ps_pred_ctxt, PART_ID_T e_part_id, S32 inp_mv_pel);
240 search_node_t *ps_node, pred_ctxt_t *ps_pred_ctxt, PART_ID_T e_part_id, S32 inp_mv_pel);
243 search_node_t *ps_node, pred_ctxt_t *ps_pred_ctxt, PART_ID_T e_part_id, S32 inp_mv_pel);
246 search_node_t *ps_node, pred_ctxt_t *ps_pred_ctxt, PART_ID_T e_part_id, S32 inp_mv_pel);
Dihevce_tu_tree_selector.h83 extern WORD32 ihevce_tu_tree_coverage_in_cu(tu_tree_node_t *ps_node);
95 tu_tree_node_t *ps_node,
110 tu_tree_node_t *ps_node,
125 tu_tree_node_t *ps_node,
Dhme_err_compute.c956 search_node_t *ps_node, pred_ctxt_t *ps_pred_ctxt, PART_ID_T e_part_id, S32 inp_mv_pel) in compute_mv_cost_explicit() argument
977 ref_bits = ps_pred_ctxt->ppu1_ref_bits_tlu[ps_pred_ctxt->pred_lx][ps_node->i1_ref_idx]; in compute_mv_cost_explicit()
1013 COMPUTE_DIFF_MV(mvdx1, mvdy1, ps_node, mv_p_x, mv_p_y, inp_shift, pred_shift); in compute_mv_cost_explicit()
1019 COMPUTE_DIFF_MV(mvdx2, mvdy2, ps_node, mv_p_x, mv_p_y, inp_shift, pred_shift); in compute_mv_cost_explicit()
1057 search_node_t *ps_node, pred_ctxt_t *ps_pred_ctxt, PART_ID_T e_part_id, S32 inp_mv_pel) in compute_mv_cost_coarse() argument
1061 return (compute_mv_cost_explicit(ps_node, ps_pred_ctxt, PART_ID_2Nx2N, inp_mv_pel)); in compute_mv_cost_coarse()
1083 search_node_t *ps_node, pred_ctxt_t *ps_pred_ctxt, PART_ID_T e_part_id, S32 inp_mv_pel) in compute_mv_cost_coarse_high_speed() argument
1088 mvx = ps_node->s_mv.i2_mvx; in compute_mv_cost_coarse_high_speed()
1089 mvy = ps_node->s_mv.i2_mvy; in compute_mv_cost_coarse_high_speed()
1090 i4_search_idx = ps_node->i1_ref_idx; in compute_mv_cost_coarse_high_speed()
[all …]
Dhme_subpel.c4208 search_node_t *ps_node = in hme_subpel_refine_cu_hs() local
4211 U08 u1_is_subpel_done = ps_node->u1_subpel_done; in hme_subpel_refine_cu_hs()
4218 i2_best_sad = ps_node->i4_sad; in hme_subpel_refine_cu_hs()
4220 if(ps_node->i1_ref_idx == i1_ref_idx) in hme_subpel_refine_cu_hs()
4222 i4_best_mvx = ps_node->s_mv.i2_mvx; in hme_subpel_refine_cu_hs()
4223 i4_best_mvy = ps_node->s_mv.i2_mvy; in hme_subpel_refine_cu_hs()