Searched refs:cost_list (Results 1 – 8 of 8) sorted by relevance
/external/libvpx/libvpx/vp9/encoder/ |
D | vp9_mcomp.c | 362 static INLINE int is_cost_list_wellbehaved(int *cost_list) { in is_cost_list_wellbehaved() argument 363 return cost_list[0] < cost_list[1] && in is_cost_list_wellbehaved() 364 cost_list[0] < cost_list[2] && in is_cost_list_wellbehaved() 365 cost_list[0] < cost_list[3] && in is_cost_list_wellbehaved() 366 cost_list[0] < cost_list[4]; in is_cost_list_wellbehaved() 377 static void get_cost_surf_min(int *cost_list, int *ir, int *ic, in get_cost_surf_min() argument 379 *ic = divide_and_round((cost_list[1] - cost_list[3]) * (1 << (bits - 1)), in get_cost_surf_min() 380 (cost_list[1] - 2 * cost_list[0] + cost_list[3])); in get_cost_surf_min() 381 *ir = divide_and_round((cost_list[4] - cost_list[2]) * (1 << (bits - 1)), in get_cost_surf_min() 382 (cost_list[4] - 2 * cost_list[0] + cost_list[2])); in get_cost_surf_min() [all …]
|
D | vp9_mcomp.h | 79 int *cost_list, 95 int *cost_list, 115 int *cost_list, 157 int *cost_list,
|
D | vp9_mbgraph.c | 40 int cost_list[5]; in do_16x16_motion_iteration() local 53 cond_cost_list(cpi, cost_list), in do_16x16_motion_iteration() 64 cond_cost_list(cpi, cost_list), in do_16x16_motion_iteration()
|
D | vp9_encoder.h | 650 static INLINE int *cond_cost_list(const struct VP9_COMP *cpi, int *cost_list) { in cond_cost_list() argument 651 return cpi->sf.mv.subpel_search_method != SUBPEL_TREE ? cost_list : NULL; in cond_cost_list()
|
D | vp9_temporal_filter.c | 225 int cost_list[5]; in temporal_filter_find_matching_mb_c() local 249 cond_cost_list(cpi, cost_list), in temporal_filter_find_matching_mb_c() 259 cond_cost_list(cpi, cost_list), in temporal_filter_find_matching_mb_c()
|
D | vp9_pickmode.c | 143 int cost_list[5]; in combined_motion_search() local 167 cond_cost_list(cpi, cost_list), in combined_motion_search() 194 cond_cost_list(cpi, cost_list), in combined_motion_search() 1258 int dis, cost_list[5]; in vp9_pick_inter_mode() local 1284 cond_cost_list(cpi, cost_list), in vp9_pick_inter_mode() 1776 int cost_list[5]; in vp9_pick_inter_mode_sub8x8() local 1795 cond_cost_list(cpi, cost_list), in vp9_pick_inter_mode_sub8x8() 1825 cond_cost_list(cpi, cost_list), in vp9_pick_inter_mode_sub8x8()
|
D | vp9_rdopt.c | 1793 int cost_list[5]; in rd_pick_best_sub8x8_mode() local 1839 cpi->sf.mv.subpel_search_method != SUBPEL_TREE ? cost_list : NULL, in rd_pick_best_sub8x8_mode() 1853 cost_list[1] = cost_list[2] = cost_list[3] = cost_list[4] = INT_MAX; in rd_pick_best_sub8x8_mode() 1874 cond_cost_list(cpi, cost_list), in rd_pick_best_sub8x8_mode() 2210 int cost_list[5]; in single_motion_search() local 2285 cond_cost_list(cpi, cost_list), in single_motion_search() 2301 cond_cost_list(cpi, cost_list), in single_motion_search()
|
/external/openssh/ |
D | krl.c | 455 u_int64_t cost, cost_list, cost_range, cost_bitmap, cost_bitmap_restart; in choose_next_state() local 470 cost_list = cost_bitmap = cost_bitmap_restart = 0; in choose_next_state() 477 cost_list = 8; in choose_next_state() 483 cost_list = 8; in choose_next_state() 487 cost_list += 64 * contig + (final ? 0 : 8+64); in choose_next_state() 493 cost_list = (cost_list + 7) / 8; in choose_next_state() 506 if (cost_list < cost) { in choose_next_state() 508 cost = cost_list; in choose_next_state() 519 (long long unsigned)cost_list, (long long unsigned)cost_range, in choose_next_state()
|