| /external/libvpx/libvpx/vp9/encoder/ |
| D | vp9_mcomp.c | 342 static INLINE int is_cost_list_wellbehaved(int *cost_list) { in is_cost_list_wellbehaved() argument
343 return cost_list[0] < cost_list[1] && cost_list[0] < cost_list[2] && in is_cost_list_wellbehaved()
344 cost_list[0] < cost_list[3] && cost_list[0] < cost_list[4]; in is_cost_list_wellbehaved()
355 static void get_cost_surf_min(int *cost_list, int *ir, int *ic, int bits) { in get_cost_surf_min() argument
356 const int64_t x0 = (int64_t)cost_list[1] - cost_list[3]; in get_cost_surf_min()
357 const int64_t y0 = cost_list[1] - 2 * (int64_t)cost_list[0] + cost_list[3]; in get_cost_surf_min()
358 const int64_t x1 = (int64_t)cost_list[4] - cost_list[2]; in get_cost_surf_min()
359 const int64_t y1 = cost_list[4] - 2 * (int64_t)cost_list[0] + cost_list[2]; in get_cost_surf_min()
368 int iters_per_step, int *cost_list, int *mvjcost, int *mvcost[2], in vp9_skip_sub_pixel_tree() argument
392 (void)cost_list; in vp9_skip_sub_pixel_tree()
[all …]
|
| D | vp9_mcomp.h | 84 int iters_per_step, int *cost_list, int *mvjcost, int *mvcost[2],
124 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 | 566 int cost_list[5]; in temporal_filter_find_matching_mb_c() local
592 search_method, sadpb, cond_cost_list(cpi, cost_list), in temporal_filter_find_matching_mb_c()
604 cond_cost_list(cpi, cost_list), NULL, NULL, &distortion, &sse, NULL, BW, in temporal_filter_find_matching_mb_c()
624 cond_cost_list(cpi, cost_list), &best_ref_mv1, in temporal_filter_find_matching_mb_c()
632 mv_sf->subpel_search_level, cond_cost_list(cpi, cost_list), NULL, in temporal_filter_find_matching_mb_c()
|
| D | vp9_encoder.h | 1054 static INLINE int *cond_cost_list(const struct VP9_COMP *cpi, int *cost_list) { in cond_cost_list() argument
1055 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()
1581 int cost_list[5] = { INT_MAX, INT_MAX, INT_MAX, INT_MAX, INT_MAX }; in search_new_mv() local
1604 cpi->sf.mv.subpel_search_level, cond_cost_list(cpi, cost_list), in search_new_mv()
2862 int cost_list[5]; in vp9_pick_inter_mode_sub8x8() local
2879 x->sadperbit4, cond_cost_list(cpi, cost_list), in vp9_pick_inter_mode_sub8x8()
2900 cpi->sf.mv.subpel_search_level, cond_cost_list(cpi, cost_list), in vp9_pick_inter_mode_sub8x8()
|
| D | vp9_rdopt.c | 2097 int cost_list[5]; in rd_pick_best_sub8x8_mode() local
2147 sf->mv.subpel_search_method != SUBPEL_TREE ? cost_list : NULL, in rd_pick_best_sub8x8_mode()
2157 sf->mv.subpel_search_level, cond_cost_list(cpi, cost_list), in rd_pick_best_sub8x8_mode()
2489 int cost_list[5]; in single_motion_search() local
2589 cond_cost_list(cpi, cost_list), &ref_mv, &tmp_mv->as_mv, INT_MAX, 1); in single_motion_search()
2628 cpi->sf.mv.search_method, sadpb, cond_cost_list(cpi, cost_list), in single_motion_search()
2645 cpi->sf.mv.subpel_search_level, cond_cost_list(cpi, cost_list), in single_motion_search()
|
| D | vp9_encoder.c | 5971 int cost_list[5]; local
5986 cond_cost_list(cpi, cost_list), NULL, NULL, &distortion, &sse, NULL, 0, 0,
6007 int cost_list[5]; local
6028 search_method, sadpb, cond_cost_list(cpi, cost_list),
6039 cond_cost_list(cpi, cost_list), NULL, NULL, &distortion, &sse, NULL, 0, 0,
|
| D | vp9_encodeframe.c | 3496 int cost_list[5]; in simple_motion_search() local
3507 sadpb, cond_cost_list(cpi, cost_list), &ref_mv, in simple_motion_search()
|
| /external/libaom/libaom/av1/encoder/ |
| D | mcomp.c | 90 const MV *ref_mv, const int *cost_list) { in av1_make_default_subpel_ms_params() argument
96 ms_params->cost_list = cond_cost_list_const(cpi, cost_list); in av1_make_default_subpel_ms_params()
497 int *cost_list) { in calc_int_cost_list() argument
504 cost_list[0] = get_mvpred_var_cost(ms_params, &best_mv); in calc_int_cost_list()
510 cost_list[i + 1] = get_mvpred_var_cost(ms_params, &neighbor_mv); in calc_int_cost_list()
517 cost_list[i + 1] = INT_MAX; in calc_int_cost_list()
519 cost_list[i + 1] = get_mvpred_var_cost(ms_params, &neighbor_mv); in calc_int_cost_list()
529 int *cost_list, int costlist_has_sad) { in calc_int_sad_list() argument
543 cost_list[0] = get_mvpred_sad( in calc_int_sad_list()
550 cost_list[i + 1] = get_mvpred_sad( in calc_int_sad_list()
[all …]
|
| D | mcomp.h | 218 const int step_param, int *cost_list,
258 const int *cost_list; member
273 const MV *ref_mv, const int *cost_list);
|
| D | motion_search_facade.c | 205 int cost_list[5]; in av1_single_motion_search() local
224 smv, &full_ms_params, step_param, cond_cost_list(cpi, cost_list), in av1_single_motion_search()
304 cost_list); in av1_single_motion_search()
779 int cost_list[5]; in av1_simple_motion_search() local
798 cond_cost_list(cpi, cost_list), in av1_simple_motion_search()
812 cost_list); in av1_simple_motion_search()
|
| D | temporal_filter.c | 113 int cost_list[5]; in tf_motion_search() local
127 cond_cost_list(cpi, cost_list), &best_mv.as_fullmv, in tf_motion_search()
146 &baseline_mv, cost_list); in tf_motion_search()
176 cond_cost_list(cpi, cost_list), in tf_motion_search()
183 &baseline_mv, cost_list); in tf_motion_search()
|
| D | encoder.h | 1660 const int *cost_list) { in cond_cost_list_const() argument
1663 return use_cost_list ? cost_list : NULL; in cond_cost_list_const()
1666 static INLINE int *cond_cost_list(const struct AV1_COMP *cpi, int *cost_list) { in cond_cost_list() argument
1669 return use_cost_list ? cost_list : NULL; in cond_cost_list()
|
| D | nonrd_pickmode.c | 134 int cost_list[5]; in combined_motion_search() local
163 cond_cost_list(cpi, cost_list), &tmp_mv->as_fullmv, in combined_motion_search()
178 cost_list); in combined_motion_search()
207 int cost_list[5] = { INT_MAX, INT_MAX, INT_MAX, INT_MAX, INT_MAX }; in search_new_mv() local
232 cost_list); in search_new_mv()
|
| D | tpl_model.c | 133 int cost_list[5]; in motion_estimation() local
156 cond_cost_list(cpi, cost_list), &best_mv->as_fullmv, in motion_estimation()
161 cost_list); in motion_estimation()
|
| /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()
|