/external/libhevc/encoder/ |
D | ihevce_had_satd.c | 982 WORD32 best_cost = 0; in ihevce_had_8x8_using_4_4x4_r() local 1015 best_cost = cost_child; in ihevce_had_8x8_using_4_4x4_r() 1016 best_cost <<= 1; in ihevce_had_8x8_using_4_4x4_r() 1017 best_cost++; in ihevce_had_8x8_using_4_4x4_r() 1024 best_cost = cost_parent; in ihevce_had_8x8_using_4_4x4_r() 1025 best_cost <<= 1; in ihevce_had_8x8_using_4_4x4_r() 1033 best_cost = cost_parent; in ihevce_had_8x8_using_4_4x4_r() 1034 best_cost <<= 1; in ihevce_had_8x8_using_4_4x4_r() 1042 return ((best_cost << 1) + early_cbf); in ihevce_had_8x8_using_4_4x4_r() 1241 WORD32 best_cost = 0, best_cost_tu_split; in ihevce_had_16x16_r() local [all …]
|
D | ihevce_sao.c | 443 UWORD32 ctb_bits = 0, distortion = 0, curr_cost = 0, best_cost = 0; in ihevce_sao_analyse() local 700 best_cost = 0xFFFFFFFF; in ihevce_sao_analyse() 793 if(curr_cost < best_cost) in ihevce_sao_analyse() 795 best_cost = curr_cost; in ihevce_sao_analyse() 1035 best_cost = 0xFFFFFFFF; in ihevce_sao_analyse() 1176 if(curr_cost < best_cost) in ihevce_sao_analyse() 1179 best_cost = curr_cost; in ihevce_sao_analyse()
|
D | ihevce_recur_bracketing.c | 494 ps_cu_node->best_cost = best_costs_4x4[0]; in ihevce_pu_calc_4x4_blk() 906 ps_cu_node->ps_parent->best_cost = MAX_INTRA_COST_IPE; in ihevce_bracketing_analysis() 928 ps_cu_node->ps_parent->best_cost = MAX_INTRA_COST_IPE; in ihevce_bracketing_analysis() 2151 ps_cu_node->ps_sub_cu[ctr_sub_cu]->best_cost = in ihevce_bracketing_analysis() 2248 child_cost_least += ps_cu_node->ps_sub_cu[j]->best_cost; in ihevce_bracketing_analysis() 2589 parent_cost = ps_cu_node->ps_parent->best_cost; in ihevce_bracketing_analysis() 3374 ps_cu_node->best_cost = cost_amode_step2[0]; in ihevce_mode_eval_filtering() 3377 ps_cu_node->best_cost - ps_ctxt->au2_mode_bits_satd_cost[ps_cu_node->best_mode]; in ihevce_mode_eval_filtering()
|
D | ihevce_ipe_structs.h | 212 WORD32 best_cost; member
|
D | hme_utils.c | 2341 S32 best_cost = MAX_32BIT_VAL; in hme_tu_recur_cand_harvester() local 2368 if(i4_total_cost < best_cost) in hme_tu_recur_cand_harvester() 2371 best_cost = i4_total_cost; in hme_tu_recur_cand_harvester() 2391 S32 best_cost = MAX_32BIT_VAL; in hme_tu_recur_cand_harvester() local 2418 if(i4_total_cost < best_cost) in hme_tu_recur_cand_harvester() 2421 best_cost = i4_total_cost; in hme_tu_recur_cand_harvester() 2560 WORD32 best_cost[NUM_BEST_ME_OUTPUTS]; in hme_decide_part_types() local 2571 best_cost[i] = MAX_32BIT_VAL; in hme_decide_part_types() 2963 if(part_type_cost < best_cost[num_best_cand - 1]) in hme_decide_part_types() 2968 if(part_type_cost <= best_cost[cand_idx]) in hme_decide_part_types() [all …]
|
D | hme_subpel.c | 575 S32 uni_cost, bi_cost, best_cost, tot_cost; in hme_compute_pred_and_evaluate_bi() local 721 best_cost = MIN(uni_cost, cur_iter_best_cost); in hme_compute_pred_and_evaluate_bi() 722 tot_cost += best_cost; in hme_compute_pred_and_evaluate_bi() 856 best_cost = MIN(uni_cost, bi_cost); in hme_compute_pred_and_evaluate_bi() 857 tot_cost += best_cost; in hme_compute_pred_and_evaluate_bi() 1189 best_cost = MIN(uni_cost, bi_cost); in hme_compute_pred_and_evaluate_bi() 1190 tot_cost += best_cost; in hme_compute_pred_and_evaluate_bi()
|
D | hme_refine.c | 5031 S32 best_cost = (best_inter_cost > best_intra_cost) ? best_intra_cost : best_inter_cost; in hme_populate_cu_tree() local 5032 S32 cost_differential = (best_inter_cost - best_cost); in hme_populate_cu_tree() 5075 ((ALL_INTER_COST_DIFF_THR * best_cost) >= (100 * cost_differential)) && in hme_populate_cu_tree() 5736 S32 best_cost = (best_inter_cost > best_intra_cost) ? best_intra_cost : best_inter_cost; in hme_analyse_mv_clustering() local 5737 S32 cost_differential = (best_inter_cost - best_cost); in hme_analyse_mv_clustering() 5740 ((ALL_INTER_COST_DIFF_THR * best_cost) >= (100 * cost_differential)); in hme_analyse_mv_clustering()
|
/external/fonttools/Lib/fontTools/varLib/ |
D | iup.py | 182 best_cost = costs[i-1] + 1 184 costs[i] = best_cost 194 if cost < best_cost and can_iup_in_between(delta, coords, j, i, tolerance): 195 costs[i] = best_cost = cost 269 best_sol, best_cost = None, n+1 280 if cost <= best_cost: 281 best_sol, best_cost = solution, cost
|
D | interpolatable.py | 100 best_cost = _matching_cost(G, best) 103 if cost < best_cost: 104 best, best_cost = list(p), cost 105 return best, best_cost
|
/external/brotli/research/ |
D | deorummolae.cc | 221 TextIdx best_cost; in DM_generate() local 240 best_cost = 0; in DM_generate() 261 if (cost > best_cost && count >= min_count && in DM_generate() 263 best_cost = cost; in DM_generate() 280 if (best_cost == 0 || best_isle.lcp < MIN_MATCH) { in DM_generate() 291 total_cost, best_cost, total, best_isle.lcp); in DM_generate() 295 total_cost += best_cost; in DM_generate()
|
/external/libhevc/encoder/arm/ |
D | ihevce_had_compute_neon.c | 819 WORD32 best_cost; in ihevce_had_8x8_using_4_4x4_r_neon() local 869 best_cost = cost_child; in ihevce_had_8x8_using_4_4x4_r_neon() 870 best_cost <<= 1; in ihevce_had_8x8_using_4_4x4_r_neon() 871 best_cost++; in ihevce_had_8x8_using_4_4x4_r_neon() 877 best_cost = cost_parent; in ihevce_had_8x8_using_4_4x4_r_neon() 878 best_cost <<= 1; in ihevce_had_8x8_using_4_4x4_r_neon() 885 best_cost = cost_parent; in ihevce_had_8x8_using_4_4x4_r_neon() 886 best_cost <<= 1; in ihevce_had_8x8_using_4_4x4_r_neon() 894 return ((best_cost << 1) + early_cbf); in ihevce_had_8x8_using_4_4x4_r_neon() 1003 WORD32 best_cost, best_cost_tu_split; in ihevce_had_16x16_r_neon() local [all …]
|
/external/minijail/tools/ |
D | compiler.py | 222 best_cost = _compile_ranges_linear(ranges[slice(*indices)], 246 best_cost = min( 247 best_cost, 255 memoized_costs[bounds] = best_cost
|
/external/libgav1/libgav1/src/dsp/ |
D | cdef.cc | 91 int32_t best_cost = 0; in CdefDirection_C() local 94 if (cost[i] > best_cost) { in CdefDirection_C() 95 best_cost = cost[i]; in CdefDirection_C() 99 *variance = (best_cost - cost[(*direction + 4) & 7]) >> 10; in CdefDirection_C()
|
/external/libaom/libaom/av1/common/ |
D | cdef_block.c | 44 int32_t best_cost = 0; in cdef_find_dir_c() local 96 if (cost[i] > best_cost) { in cdef_find_dir_c() 97 best_cost = cost[i]; in cdef_find_dir_c() 103 *var = best_cost - cost[(best_dir + 4) & 7]; in cdef_find_dir_c()
|
D | cdef_block_simd.h | 165 int32_t best_cost = 0; in SIMD_FUNC() local 185 best_cost = v128_low_u32(max); in SIMD_FUNC() 193 *var = best_cost - cost[(best_dir + 4) & 7]; in SIMD_FUNC()
|
/external/libgav1/libgav1/src/dsp/x86/ |
D | cdef_avx2.cc | 488 uint32_t best_cost = 0; in CdefDirection_AVX2() local 491 if (cost[i] > best_cost) { in CdefDirection_AVX2() 492 best_cost = cost[i]; in CdefDirection_AVX2() 496 *variance = (best_cost - cost[(*direction + 4) & 7]) >> 10; in CdefDirection_AVX2()
|
D | cdef_sse4.cc | 426 uint32_t best_cost = 0; in CdefDirection_SSE4_1() local 429 if (cost[i] > best_cost) { in CdefDirection_SSE4_1() 430 best_cost = cost[i]; in CdefDirection_SSE4_1() 434 *variance = (best_cost - cost[(*direction + 4) & 7]) >> 10; in CdefDirection_SSE4_1()
|
/external/libgav1/libgav1/src/dsp/arm/ |
D | cdef_neon.cc | 395 uint32_t best_cost = 0; in CdefDirection_NEON() local 398 if (cost[i] > best_cost) { in CdefDirection_NEON() 399 best_cost = cost[i]; in CdefDirection_NEON() 403 *variance = (best_cost - cost[(*direction + 4) & 7]) >> 10; in CdefDirection_NEON()
|
/external/speex/libspeexdsp/ |
D | jitter.c | 177 spx_int32_t best_cost=0x7fffffff; in compute_opt_delay() local 236 if (cost < best_cost) in compute_opt_delay() 238 best_cost = cost; in compute_opt_delay()
|
/external/rust/crates/rayon/ |
D | FAQ.md | 217 fn search(path: &Path, cost_so_far: usize, best_cost: &Arc<AtomicUsize>) { 218 if cost_so_far >= best_cost.load(Ordering::SeqCst) { 222 best_cost.store(...);
|
/external/tensorflow/tensorflow/compiler/xla/service/ |
D | hlo_rematerialization.cc | 1377 int64 best_cost = 0; in PickRematerializationCandidates() local 1423 if (best_items.empty() || cost < best_cost) { in PickRematerializationCandidates() 1433 best_cost = cost; in PickRematerializationCandidates() 1478 if (best_items.empty() || cost < best_cost) { in PickRematerializationCandidates() 1484 best_cost = cost; in PickRematerializationCandidates()
|
/external/libaom/libaom/av1/encoder/ |
D | pickrst.c | 1625 double best_cost = 0; in search_switchable() local 1657 if (r == 0 || cost < best_cost) { in search_switchable() 1658 best_cost = cost; in search_switchable() 1733 double best_cost = 0; in av1_pick_filter_restoration() local 1749 if (r == 0 || cost < best_cost) { in av1_pick_filter_restoration() 1750 best_cost = cost; in av1_pick_filter_restoration()
|
D | nonrd_pickmode.c | 1307 int64_t best_cost = INT64_MAX; local 1327 if (cost < best_cost) { 1329 best_cost = cost;
|
/external/webp/src/enc/ |
D | histogram_enc.c | 948 double best_cost = in HistogramCombineStochastic() local 969 HistoQueuePush(&histo_queue, histograms, idx1, idx2, best_cost); in HistogramCombineStochastic() 971 best_cost = curr_cost; in HistogramCombineStochastic()
|
/external/libvpx/libvpx/vp9/encoder/ |
D | vp9_pickmode.c | 1497 int64_t best_cost = INT64_MAX; in search_filter_ref() local 1522 if (cost < best_cost) { in search_filter_ref() 1524 best_cost = cost; in search_filter_ref()
|