HomeSort by relevance Sort by last modified time
    Searched refs:best_cost (Results 1 - 21 of 21) sorted by null

  /external/libhevc/encoder/
ihevce_had_satd.c 982 WORD32 best_cost = 0; local
1015 best_cost = cost_child;
1016 best_cost <<= 1;
1017 best_cost++;
1024 best_cost = cost_parent;
1025 best_cost <<= 1;
1033 best_cost = cost_parent;
1034 best_cost <<= 1;
1042 return ((best_cost << 1) + early_cbf);
1241 WORD32 best_cost = 0, best_cost_tu_split; local
1554 WORD32 best_cost = 0; local
    [all...]
ihevce_sao.c 443 UWORD32 ctb_bits = 0, distortion = 0, curr_cost = 0, best_cost = 0; local
700 best_cost = 0xFFFFFFFF;
    [all...]
ihevce_ipe_structs.h 212 WORD32 best_cost; member in struct:ihevce_ipe_cu_tree_t
hme_utils.c 2341 S32 best_cost = MAX_32BIT_VAL; local
2391 S32 best_cost = MAX_32BIT_VAL; local
2560 WORD32 best_cost[NUM_BEST_ME_OUTPUTS]; local
    [all...]
ihevce_recur_bracketing.c 494 ps_cu_node->best_cost = best_costs_4x4[0];
    [all...]
hme_subpel.c 575 S32 uni_cost, bi_cost, best_cost, tot_cost; local
721 best_cost = MIN(uni_cost, cur_iter_best_cost);
722 tot_cost += best_cost;
856 best_cost = MIN(uni_cost, bi_cost);
857 tot_cost += best_cost;
    [all...]
hme_refine.c 5031 S32 best_cost = (best_inter_cost > best_intra_cost) ? best_intra_cost : best_inter_cost; local
5736 S32 best_cost = (best_inter_cost > best_intra_cost) ? best_intra_cost : best_inter_cost; local
    [all...]
  /external/fonttools/Lib/fontTools/varLib/
interpolatable.py 88 best_cost = _matching_cost(G, best)
91 if cost < best_cost:
92 best, best_cost = list(p), cost
93 return best, best_cost
iup.py 187 best_cost = costs[i-1] + 1
189 costs[i] = best_cost
199 if cost < best_cost and can_iup_in_between(delta, coords, j, i, tolerance):
200 costs[i] = best_cost = cost
274 best_sol, best_cost = None, n+1
285 if cost <= best_cost:
286 best_sol, best_cost = solution, cost
  /external/brotli/research/
deorummolae.cc 221 TextIdx best_cost; local
240 best_cost = 0;
261 if (cost > best_cost && count >= min_count &&
263 best_cost = cost;
280 if (best_cost == 0 || best_isle.lcp < MIN_MATCH) {
291 total_cost, best_cost, total, best_isle.lcp);
295 total_cost += best_cost;
  /external/libhevc/encoder/arm/
ihevce_had_compute_neon.c 819 WORD32 best_cost; local
869 best_cost = cost_child;
870 best_cost <<= 1;
871 best_cost++;
877 best_cost = cost_parent;
878 best_cost <<= 1;
885 best_cost = cost_parent;
886 best_cost <<= 1;
894 return ((best_cost << 1) + early_cbf);
1003 WORD32 best_cost, best_cost_tu_split local
    [all...]
  /external/minijail/tools/
compiler.py 218 best_cost = _compile_ranges_linear(ranges[slice(*indices)],
242 best_cost = min(
243 best_cost,
251 memoized_costs[bounds] = best_cost
  /external/webrtc/webrtc/modules/rtp_rtcp/source/
vp8_partition_aggregator.cc 245 size_t best_cost = std::numeric_limits<size_t>::max(); local
257 if (fragment_size <= max_payload_size && cost < best_cost) {
259 best_cost = cost;
  /external/libaom/libaom/av1/common/
cdef_block.c 44 int32_t best_cost = 0; local
96 if (cost[i] > best_cost) {
97 best_cost = cost[i];
103 *var = best_cost - cost[(best_dir + 4) & 7];
cdef_block_simd.h 165 int32_t best_cost = 0; local
185 best_cost = v128_low_u32(max);
193 *var = best_cost - cost[(best_dir + 4) & 7];
    [all...]
  /external/speex/libspeexdsp/
jitter.c 177 spx_int32_t best_cost=0x7fffffff; local
236 if (cost < best_cost)
238 best_cost = cost;
  /external/tensorflow/tensorflow/compiler/xla/service/
hlo_rematerialization.cc 867 int64 best_cost = 0; local
    [all...]
  /external/libaom/libaom/av1/encoder/
pickrst.c 1305 double best_cost = 0; local
1412 double best_cost = 0; local
    [all...]
  /external/webp/src/enc/
histogram_enc.c 947 double best_cost = local
    [all...]
  /external/libvpx/libvpx/vp9/encoder/
vp9_mcomp.c 1740 double best_cost = 0; local
    [all...]
vp9_pickmode.c 1457 int64_t best_cost = INT64_MAX; local
    [all...]

Completed in 640 milliseconds