| /external/libvpx/libvpx/vp9/encoder/ |
| D | vp9_mcomp.c | 347 static INLINE int is_cost_list_wellbehaved(int *cost_list) { in is_cost_list_wellbehaved() argument
348 return cost_list[0] < cost_list[1] && cost_list[0] < cost_list[2] && in is_cost_list_wellbehaved()
349 cost_list[0] < cost_list[3] && cost_list[0] < cost_list[4]; in is_cost_list_wellbehaved()
360 static void get_cost_surf_min(int *cost_list, int *ir, int *ic, int bits) { in get_cost_surf_min() argument
361 const int64_t x0 = (int64_t)cost_list[1] - cost_list[3]; in get_cost_surf_min()
362 const int64_t y0 = cost_list[1] - 2 * (int64_t)cost_list[0] + cost_list[3]; in get_cost_surf_min()
363 const int64_t x1 = (int64_t)cost_list[4] - cost_list[2]; in get_cost_surf_min()
364 const int64_t y1 = cost_list[4] - 2 * (int64_t)cost_list[0] + cost_list[2]; in get_cost_surf_min()
373 int iters_per_step, int *cost_list, int *mvjcost, int *mvcost[2], in vp9_skip_sub_pixel_tree() argument
397 (void)cost_list; in vp9_skip_sub_pixel_tree()
[all …]
|
| D | vp9_mcomp.h | 76 int iters_per_step, int *cost_list, int *mvjcost, int *mvcost[2],
115 int error_per_bit, int *cost_list, const MV *ref_mv,
|
| D | vp9_mbgraph.c | 35 int cost_list[5]; in do_16x16_motion_iteration() local
49 cond_cost_list(cpi, cost_list), ref_mv, dst_mv, 0, 0); in do_16x16_motion_iteration()
64 cond_cost_list(cpi, cost_list), NULL, NULL, &distortion, &sse, NULL, 0, in do_16x16_motion_iteration()
|
| D | vp9_temporal_filter.c | 509 int cost_list[5]; in temporal_filter_find_matching_mb_c() local
535 search_method, sadpb, cond_cost_list(cpi, cost_list), in temporal_filter_find_matching_mb_c()
547 cond_cost_list(cpi, cost_list), NULL, NULL, &distortion, &sse, NULL, BW, in temporal_filter_find_matching_mb_c()
567 cond_cost_list(cpi, cost_list), &best_ref_mv1, in temporal_filter_find_matching_mb_c()
575 mv_sf->subpel_search_level, cond_cost_list(cpi, cost_list), NULL, in temporal_filter_find_matching_mb_c()
|
| D | vp9_encoder.h | 1043 static INLINE int *cond_cost_list(const struct VP9_COMP *cpi, int *cost_list) { in cond_cost_list() argument
1044 return cpi->sf.mv.subpel_search_method != SUBPEL_TREE ? cost_list : NULL; in cond_cost_list()
|
| D | vp9_pickmode.c | 171 int cost_list[5]; in combined_motion_search() local
213 cond_cost_list(cpi, cost_list), ¢er_mv, &tmp_mv->as_mv, INT_MAX, 0); in combined_motion_search()
249 cpi->sf.mv.subpel_search_level, cond_cost_list(cpi, cost_list), in combined_motion_search()
1520 int cost_list[5] = { INT_MAX, INT_MAX, INT_MAX, INT_MAX, INT_MAX }; in search_new_mv() local
1543 cpi->sf.mv.subpel_search_level, cond_cost_list(cpi, cost_list), in search_new_mv()
2732 int cost_list[5]; in vp9_pick_inter_mode_sub8x8() local
2749 x->sadperbit4, cond_cost_list(cpi, cost_list), in vp9_pick_inter_mode_sub8x8()
2770 cpi->sf.mv.subpel_search_level, cond_cost_list(cpi, cost_list), in vp9_pick_inter_mode_sub8x8()
|
| D | vp9_rdopt.c | 1954 int cost_list[5]; in rd_pick_best_sub8x8_mode() local
2004 sf->mv.subpel_search_method != SUBPEL_TREE ? cost_list : NULL, in rd_pick_best_sub8x8_mode()
2014 sf->mv.subpel_search_level, cond_cost_list(cpi, cost_list), in rd_pick_best_sub8x8_mode()
2385 int cost_list[5]; in single_motion_search() local
2483 cond_cost_list(cpi, cost_list), &ref_mv, &tmp_mv->as_mv, INT_MAX, 1); in single_motion_search()
2526 cpi->sf.mv.search_method, sadpb, cond_cost_list(cpi, cost_list), in single_motion_search()
2543 cpi->sf.mv.subpel_search_level, cond_cost_list(cpi, cost_list), in single_motion_search()
|
| D | vp9_encoder.c | 5586 int cost_list[5]; local
5625 search_method, sadpb, cond_cost_list(cpi, cost_list),
5637 cond_cost_list(cpi, cost_list), NULL, NULL, &distortion, &sse, NULL, 0, 0,
|
| D | vp9_encodeframe.c | 3507 int cost_list[5]; in ml_predict_var_rd_paritioning() local
3516 search_method, sadpb, cond_cost_list(cpi, cost_list), in ml_predict_var_rd_paritioning()
|
| /external/libaom/libaom/av1/encoder/ |
| D | mcomp.c | 374 static INLINE int is_cost_list_wellbehaved(int *cost_list) { in is_cost_list_wellbehaved() argument
375 return cost_list[0] < cost_list[1] && cost_list[0] < cost_list[2] && in is_cost_list_wellbehaved()
376 cost_list[0] < cost_list[3] && cost_list[0] < cost_list[4]; in is_cost_list_wellbehaved()
387 static void get_cost_surf_min(int *cost_list, int *ir, int *ic, int bits) { in get_cost_surf_min() argument
388 *ic = divide_and_round((cost_list[1] - cost_list[3]) * (1 << (bits - 1)), in get_cost_surf_min()
389 (cost_list[1] - 2 * cost_list[0] + cost_list[3])); in get_cost_surf_min()
390 *ir = divide_and_round((cost_list[4] - cost_list[2]) * (1 << (bits - 1)), in get_cost_surf_min()
391 (cost_list[4] - 2 * cost_list[0] + cost_list[2])); in get_cost_surf_min()
398 int *cost_list, int *mvjcost, int *mvcost[2], int *distortion, in av1_find_best_sub_pixel_tree_pruned_evenmore() argument
420 if (cost_list && cost_list[0] != INT_MAX && cost_list[1] != INT_MAX && in av1_find_best_sub_pixel_tree_pruned_evenmore()
[all …]
|
| D | mcomp.h | 95 int further_steps, int do_refine, int *cost_list,
100 int sad_per_bit, int do_init_search, int *cost_list,
109 int iters_per_step, int *cost_list, int *mvjcost, int *mvcost[2],
140 int *cost_list, const MV *ref_mv, int var_max, int rd,
|
| D | mbgraph.c | 36 int cost_list[5]; in do_16x16_motion_iteration() local
49 cond_cost_list(cpi, cost_list), &v_fn_ptr, 0, ref_mv); in do_16x16_motion_iteration()
62 mv_sf->subpel_iters_per_step, cond_cost_list(cpi, cost_list), NULL, in do_16x16_motion_iteration()
|
| D | tpl_model.c | 77 int cost_list[5]; in motion_compensated_prediction() local
98 search_method, 0, sadpb, cond_cost_list(cpi, cost_list), in motion_compensated_prediction()
110 cond_cost_list(cpi, cost_list), NULL, NULL, &distortion, &sse, NULL, NULL, in motion_compensated_prediction()
|
| D | temporal_filter.c | 671 int cost_list[5]; in temporal_filter_find_matching_mb_c() local
699 1, sadpb, cond_cost_list(cpi, cost_list), &best_ref_mv1, in temporal_filter_find_matching_mb_c()
733 cond_cost_list(cpi, cost_list), NULL, NULL, &distortion, &sse, NULL, NULL, in temporal_filter_find_matching_mb_c()
756 cond_cost_list(cpi, cost_list), &best_ref_mv1, 0, 0, in temporal_filter_find_matching_mb_c()
764 cond_cost_list(cpi, cost_list), NULL, NULL, &distortion, &sse, NULL, in temporal_filter_find_matching_mb_c()
|
| D | encoder.h | 1220 static INLINE int *cond_cost_list(const struct AV1_COMP *cpi, int *cost_list) { in cond_cost_list() argument
1221 return cpi->sf.mv.subpel_search_method != SUBPEL_TREE ? cost_list : NULL; in cond_cost_list()
|
| D | rdopt.c | 7069 int cost_list[5]; in single_motion_search() local
7154 sadpb, cond_cost_list(cpi, cost_list), &ref_mv, INT_MAX, 1, in single_motion_search()
7194 cpi->sf.mv.subpel_iters_per_step, cond_cost_list(cpi, cost_list), in single_motion_search()
7220 cond_cost_list(cpi, cost_list), x->nmv_vec_cost, in single_motion_search()
7231 cpi->sf.mv.subpel_iters_per_step, cond_cost_list(cpi, cost_list), in single_motion_search()
10726 int cost_list[5]; in rd_pick_intrabc_mode_sb() local
10729 sadpb, cond_cost_list(cpi, cost_list), &dv_ref.as_mv, INT_MAX, 1, in rd_pick_intrabc_mode_sb()
|
| /external/openssh/ |
| D | krl.c | 454 u_int64_t cost, cost_list, cost_range, cost_bitmap, cost_bitmap_restart; in choose_next_state() local
469 cost_list = cost_bitmap = cost_bitmap_restart = 0; in choose_next_state()
476 cost_list = 8; in choose_next_state()
482 cost_list = 8; in choose_next_state()
486 cost_list += 64 * contig + (final ? 0 : 8+64); in choose_next_state()
492 cost_list = (cost_list + 7) / 8; in choose_next_state()
505 if (cost_list < cost) { in choose_next_state()
507 cost = cost_list; in choose_next_state()
518 (long long unsigned)cost_list, (long long unsigned)cost_range, in choose_next_state()
|