Home
last modified time | relevance | path

Searched refs:cost (Results 1 - 25 of 83) sorted by relevance

1234

/third_party/ffmpeg/libavcodec/
H A Daaccoder_trellis.h54 float cost; ///< path cost member
76 path[0][cb].cost = run_bits+4; in codebook_trellis_rate()
83 float cost_stay_here = path[swb][0].cost; in codebook_trellis_rate()
90 path[swb+1][0].cost = cost_get_here; in codebook_trellis_rate()
94 path[swb+1][0].cost = cost_stay_here; in codebook_trellis_rate()
97 next_minbits = path[swb+1][0].cost; in codebook_trellis_rate()
100 path[swb+1][cb].cost = 61450; in codebook_trellis_rate()
112 path[swb+1][cb].cost = 61450; in codebook_trellis_rate()
120 path[swb+1][cb].cost in codebook_trellis_rate()
[all...]
/third_party/ltp/tools/sparse/sparse-src/
H A Dexpand.c77 /* The cost of a symbol expression is lower for on-stack symbols */ in expand_symbol_expression()
413 int cost; in expand_binop() local
415 cost = expand_expression(expr->left); in expand_binop()
416 cost += expand_expression(expr->right); in expand_binop()
421 return cost + 1; in expand_binop()
428 int cost, rcost; in expand_logical() local
431 cost = expand_expression(left); in expand_logical()
473 return cost + BRANCH_COST + rcost; in expand_logical()
478 int cost; in expand_comma() local
480 cost in expand_comma()
520 int cost; expand_compare() local
547 int cost, cond_cost; expand_conditional() local
826 int cost; expand_preop() local
857 int cost = 0; expand_arguments() local
868 int cost; expand_cast() local
885 expand_symbol_call(struct expression *expr, int cost) expand_symbol_call() argument
925 int cost; expand_call() local
943 int cost = 0; expand_expression_list() local
1138 int cost = expand_statement(stmt); expand_expression() local
1248 int cost = 0; expand_asm_statement() local
1274 int cost, statements; expand_compound() local
[all...]
H A Dbuiltin.c122 static int expand_expect(struct expression *expr, int cost) in expand_expect() argument
135 static int expand_warning(struct expression *expr, int cost) in expand_warning() argument
176 /* The arguments are constant if the cost of all of them is zero */
177 static int expand_constant_p(struct expression *expr, int cost) in expand_constant_p() argument
180 expr->value = !cost; in expand_constant_p()
185 /* The arguments are safe, if their cost is less than SIDE_EFFECTS */
186 static int expand_safe_p(struct expression *expr, int cost) in expand_safe_p() argument
189 expr->value = (cost < SIDE_EFFECTS); in expand_safe_p()
218 /* The argument is constant and valid if the cost is zero */
219 static int expand_bswap(struct expression *expr, int cost) in expand_bswap() argument
308 expand_isdigit(struct expression *expr, int cost) expand_isdigit() argument
525 expand_object_size(struct expression *expr, int cost) expand_object_size() argument
[all...]
/third_party/skia/samplecode/
H A DSampleTiming.cpp37 double cost[H][W]; variable
49 cost[y][x] = elapsed.count();
50 min = std::min(min, cost[y][x]);
51 max = std::max(max, cost[y][x]);
61 p.setAlphaf( (cost[y][x] - min) / (max - min) );
83 cost[y][x] = elapsed.count();
84 min = std::min(min, cost[y][x]);
85 max = std::max(max, cost[y][x]);
90 p.setAlphaf( (cost[y][x] - min) / (max - min) );
/third_party/musl/Benchmark/musl/
H A Dlibc_dlopen.cpp26 explicit ScopeTime(const char *name) : cost(0), soName(name) in ScopeTime()
35 cost = (timeCurrent.tv_sec - timeStart.tv_sec) * THOUSAND + in CurrentTime()
37 printf("%s current cost %f ms.\n", soName, cost); in CurrentTime()
43 cost = (timeEnd.tv_sec - timeStart.tv_sec) * THOUSAND + in ~ScopeTime()
45 printf("dlopen %s cost %f ms.\n", soName, cost); in ~ScopeTime()
49 double cost; member in ScopeTime
/third_party/skia/third_party/externals/libwebp/src/dsp/
H A Dcost_mips32.c29 int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0; in GetResidualCost_MIPS32() local
62 "addu %[cost], %[cost], %[temp1] \n\t" in GetResidualCost_MIPS32()
69 "addu %[cost], %[cost], %[temp0] \n\t" in GetResidualCost_MIPS32()
75 : [cost]"+&r"(cost), [t]"+&r"(t), [n]"+&r"(n), [v_reg]"=&r"(v_reg), in GetResidualCost_MIPS32()
88 cost += VP8LevelCost(t, v); in GetResidualCost_MIPS32()
93 cost += VP8BitCost(0, last_p0); in GetResidualCost_MIPS32()
96 return cost; in GetResidualCost_MIPS32()
[all...]
H A Dcost_mips_dsp_r2.c29 int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0; in GetResidualCost_MIPSdspR2() local
59 "addu %[cost], %[cost], %[temp1] \n\t" in GetResidualCost_MIPSdspR2()
65 "addu %[cost], %[cost], %[temp0] \n\t" in GetResidualCost_MIPSdspR2()
70 : [cost]"+&r"(cost), [t]"+&r"(t), [n]"+&r"(n), [v_reg]"=&r"(v_reg), in GetResidualCost_MIPSdspR2()
83 cost += VP8LevelCost(t, v); in GetResidualCost_MIPSdspR2()
88 cost += VP8BitCost(0, last_p0); in GetResidualCost_MIPSdspR2()
91 return cost; in GetResidualCost_MIPSdspR2()
[all...]
H A Dcost.c16 // Boolean-cost cost table
48 // Level cost tables
331 int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0; in GetResidualCost_C() local
339 cost += VP8LevelCost(t, v); in GetResidualCost_C()
346 cost += VP8LevelCost(t, v); in GetResidualCost_C()
351 cost += VP8BitCost(0, last_p0); in GetResidualCost_C()
354 return cost; in GetResidualCost_C()
H A Dcost_neon.c10 // ARM NEON version of cost functions
62 int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0; in GetResidualCost_NEON() local
89 cost += VP8LevelFixedCosts[flevel] + t[level]; // simplified VP8LevelCost() in GetResidualCost_NEON()
97 cost += VP8LevelFixedCosts[flevel] + t[level]; in GetResidualCost_NEON()
102 cost += VP8BitCost(0, last_p0); in GetResidualCost_NEON()
105 return cost; in GetResidualCost_NEON()
H A Dcost_sse2.c10 // SSE2 version of cost functions
56 int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0; in GetResidualCost_SSE2() local
86 cost += VP8LevelFixedCosts[flevel] + t[level]; // simplified VP8LevelCost() in GetResidualCost_SSE2()
94 cost += VP8LevelFixedCosts[flevel] + t[level]; in GetResidualCost_SSE2()
99 cost += VP8BitCost(0, last_p0); in GetResidualCost_SSE2()
102 return cost; in GetResidualCost_SSE2()
/third_party/mesa3d/src/gallium/drivers/r600/sb/
H A Dsb_shader.h59 unsigned cost; member
61 ra_edge(value *a, value *b, unsigned cost) : a(a), b(b), cost(cost) {} in ra_edge()
104 unsigned cost; member
107 ra_chunk() : values(), flags(), cost(), pin() {} in ra_chunk()
126 ra_constraint(constraint_kind kind) : kind(kind), cost(0) {} in ra_constraint()
130 unsigned cost; member in r600_sb::ra_constraint
145 return t1->cost > t2->cost; in operator ()()
[all...]
H A Dsb_ra_coalesce.cpp44 void coalescer::add_edge(value* a, value* b, unsigned cost) { in add_edge() argument
46 edges.insert(new ra_edge(a,b, cost)); in add_edge()
107 c1->cost += c2->cost + e->cost; in unify_chunks()
154 c1->cost += e->cost; in build_chunks()
176 sblog << " cost = " << e->cost << "\n"; in dump_edges()
202 sblog << " ra_chunk cost in dump_chunk()
255 unsigned cost = 0; build_constraint_queue() local
[all...]
/third_party/astc-encoder/Test/
H A Dastc_profile_valgrind.py56 cost = float(match.group(1).replace(",", ""))
64 totalCost += cost
69 functionTable[index][1] += cost
70 functionTable[index][2] += cost
74 functionTable.append([function, cost, cost])
76 # Sort the table by accumulated cost
/third_party/skia/third_party/externals/libwebp/src/enc/
H A Dbackward_references_cost_enc.c10 // Improves a given set of backward references by analyzing its bit cost.
124 float prev_cost, float* const cost, uint16_t* const dist_array) { in AddSingleLiteralWithCostModel()
137 if (cost[idx] > cost_val) { in AddSingleLiteralWithCostModel()
138 cost[idx] = (float)cost_val; in AddSingleLiteralWithCostModel()
150 // the cost for the MAX_LENGTH following pixels computed. Those following pixels
151 // at index index_ + k (k from 0 to MAX_LENGTH) have a cost of:
152 // cost_ = distance cost at index + GetLengthCost(cost_model, k)
156 // minimal values using intervals of constant cost.
275 // With the current cost model, we usually have below 20 intervals. in CostManagerInit()
276 // The worst case scenario with a cost mode in CostManagerInit()
121 AddSingleLiteralWithCostModel( const uint32_t* const argb, VP8LColorCache* const hashers, const CostModel* const cost_model, int idx, int use_color_cache, float prev_cost, float* const cost, uint16_t* const dist_array) AddSingleLiteralWithCostModel() argument
321 UpdateCost(CostManager* const manager, int i, int position, float cost) UpdateCost() argument
334 UpdateCostPerInterval(CostManager* const manager, int start, int end, int position, float cost) UpdateCostPerInterval() argument
419 InsertInterval(CostManager* const manager, CostInterval* const interval_in, float cost, int position, int start, int end) InsertInterval() argument
495 const float cost = (float)(distance_cost + cost_cache_intervals[i].cost_); PushInterval() local
[all...]
H A Dhistogram_enc.c278 // Finalize the Huffman cost based on streak numbers and length type (<3 or >=3)
358 // Estimates the Entropy + Huffman + other block overhead size cost.
372 // Various histogram combine/cost-eval functions
377 double* cost) { in GetCombinedHistogramEntropy()
381 *cost += GetCombinedEntropy(a->literal_, b->literal_, in GetCombinedHistogramEntropy()
384 *cost += VP8LExtraCostCombined(a->literal_ + NUM_LITERAL_CODES, in GetCombinedHistogramEntropy()
387 if (*cost > cost_threshold) return 0; in GetCombinedHistogramEntropy()
402 *cost += in GetCombinedHistogramEntropy()
405 if (*cost > cost_threshold) return 0; in GetCombinedHistogramEntropy()
407 *cost in GetCombinedHistogramEntropy()
374 GetCombinedHistogramEntropy(const VP8LHistogram* const a, const VP8LHistogram* const b, double cost_threshold, double* cost) GetCombinedHistogramEntropy() argument
446 double cost = 0; HistogramAddEval() local
465 double cost; HistogramAddThresh() local
[all...]
/third_party/node/deps/brotli/c/enc/
H A Dbackward_references_hq.c48 stub.u.cost = kInfinity; in BrotliInitZopfliNodes()
76 /* Histogram based cost model for zopflification. */
104 BROTLI_BOOL literal_histogram, float* cost) { in SetCost()
123 cost[i] = missing_symbol_cost; in SetCost()
128 cost[i] = log2sum - (float)FastLog2(histogram[i]); in SetCost()
131 if (cost[i] < 1) cost[i] = 1; in SetCost()
246 /* REQUIRES: cost < kInfinity, nodes[start_pos].cost < kInfinity */
250 size_t short_code, float cost) { in UpdateZopfliNode()
103 SetCost(const uint32_t* histogram, size_t histogram_size, BROTLI_BOOL literal_histogram, float* cost) SetCost() argument
248 UpdateZopfliNode(ZopfliNode* nodes, size_t pos, size_t start_pos, size_t len, size_t len_code, size_t dist, size_t short_code, float cost) UpdateZopfliNode() argument
263 float cost; global() member
488 const float cost = (cmdcode < 128 ? base_cost : dist_cost) + UpdateNodes() local
541 const float cost = dist_cost + (float)GetCopyExtra(copycode) + UpdateNodes() local
[all...]
H A Dblock_splitter_inc.h71 double* cost, in FindBlocks()
97 memset(cost, 0, sizeof(cost[0]) * num_histograms); in FindBlocks()
99 /* After each iteration of this loop, cost[k] will contain the difference in FindBlocks()
100 between the minimum cost of arriving at the current byte position using in FindBlocks()
101 entropy code k, and the minimum cost of arriving at the current byte in FindBlocks()
102 position. This difference is capped at the block switch cost, and if it in FindBlocks()
103 reaches block switch cost, it means that when we trace back from the last in FindBlocks()
114 cost[k] += insert_cost[insert_cost_ix + k]; in FindBlocks()
115 if (cost[ in FindBlocks()
66 FindBlocks(const DataType* data, const size_t length, const double block_switch_bitcost, const size_t num_histograms, const HistogramType* histograms, double* insert_cost, double* cost, uint8_t* switch_signal, uint8_t* block_id) FindBlocks() argument
[all...]
H A Dliteral_cost.c7 /* Literal cost model to allow backward reference replacement to be efficient.
57 const uint8_t* data, float* cost) { in EstimateBitCostsForLiteralsUTF8()
122 cost[i] = (float)lit_cost; in EstimateBitCostsForLiteralsUTF8()
128 const uint8_t* data, float* cost) { in BrotliEstimateBitCostsForLiterals()
130 EstimateBitCostsForLiteralsUTF8(pos, len, mask, data, cost); in BrotliEstimateBitCostsForLiterals()
167 cost[i] = (float)lit_cost; in BrotliEstimateBitCostsForLiterals()
56 EstimateBitCostsForLiteralsUTF8(size_t pos, size_t len, size_t mask, const uint8_t* data, float* cost) EstimateBitCostsForLiteralsUTF8() argument
127 BrotliEstimateBitCostsForLiterals(size_t pos, size_t len, size_t mask, const uint8_t* data, float* cost) BrotliEstimateBitCostsForLiterals() argument
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dbackward_references_hq.c48 stub.u.cost = kInfinity; in BrotliInitZopfliNodes()
76 /* Histogram based cost model for zopflification. */
104 BROTLI_BOOL literal_histogram, float* cost) { in SetCost()
123 cost[i] = missing_symbol_cost; in SetCost()
128 cost[i] = log2sum - (float)FastLog2(histogram[i]); in SetCost()
131 if (cost[i] < 1) cost[i] = 1; in SetCost()
246 /* REQUIRES: cost < kInfinity, nodes[start_pos].cost < kInfinity */
250 size_t short_code, float cost) { in UpdateZopfliNode()
103 SetCost(const uint32_t* histogram, size_t histogram_size, BROTLI_BOOL literal_histogram, float* cost) SetCost() argument
248 UpdateZopfliNode(ZopfliNode* nodes, size_t pos, size_t start_pos, size_t len, size_t len_code, size_t dist, size_t short_code, float cost) UpdateZopfliNode() argument
263 float cost; global() member
488 const float cost = (cmdcode < 128 ? base_cost : dist_cost) + UpdateNodes() local
541 const float cost = dist_cost + (float)GetCopyExtra(copycode) + UpdateNodes() local
[all...]
H A Dblock_splitter_inc.h71 double* cost, in FindBlocks()
97 memset(cost, 0, sizeof(cost[0]) * num_histograms); in FindBlocks()
99 /* After each iteration of this loop, cost[k] will contain the difference in FindBlocks()
100 between the minimum cost of arriving at the current byte position using in FindBlocks()
101 entropy code k, and the minimum cost of arriving at the current byte in FindBlocks()
102 position. This difference is capped at the block switch cost, and if it in FindBlocks()
103 reaches block switch cost, it means that when we trace back from the last in FindBlocks()
114 cost[k] += insert_cost[insert_cost_ix + k]; in FindBlocks()
115 if (cost[ in FindBlocks()
66 FindBlocks(const DataType* data, const size_t length, const double block_switch_bitcost, const size_t num_histograms, const HistogramType* histograms, double* insert_cost, double* cost, uint8_t* switch_signal, uint8_t* block_id) FindBlocks() argument
[all...]
H A Dliteral_cost.c7 /* Literal cost model to allow backward reference replacement to be efficient.
57 const uint8_t* data, float* cost) { in EstimateBitCostsForLiteralsUTF8()
122 cost[i] = (float)lit_cost; in EstimateBitCostsForLiteralsUTF8()
128 const uint8_t* data, float* cost) { in BrotliEstimateBitCostsForLiterals()
130 EstimateBitCostsForLiteralsUTF8(pos, len, mask, data, cost); in BrotliEstimateBitCostsForLiterals()
167 cost[i] = (float)lit_cost; in BrotliEstimateBitCostsForLiterals()
56 EstimateBitCostsForLiteralsUTF8(size_t pos, size_t len, size_t mask, const uint8_t* data, float* cost) EstimateBitCostsForLiteralsUTF8() argument
127 BrotliEstimateBitCostsForLiterals(size_t pos, size_t len, size_t mask, const uint8_t* data, float* cost) BrotliEstimateBitCostsForLiterals() argument
/third_party/ffmpeg/libavfilter/
H A Dmotion_estimation.c34 cost = me_ctx->get_cost(me_ctx, x_mb, y_mb, x, y);\
35 if (cost < cost_min) {\
36 cost_min = cost;\
85 uint64_t cost, cost_min; in ff_me_search_esa() local
104 uint64_t cost, cost_min; in ff_me_search_tss() local
135 uint64_t cost, cost_min; in ff_me_search_tdls() local
167 uint64_t cost, cost_min; in ff_me_search_ntss() local
220 uint64_t cost, cost_min; in ff_me_search_fss() local
252 uint64_t cost, cost_min; in ff_me_search_ds() local
307 uint64_t cost, cost_mi in ff_me_search_hexbs() local
340 uint64_t cost, cost_min; ff_me_search_epzs() local
381 uint64_t cost, cost_min; ff_me_search_umh() local
[all...]
/third_party/libphonenumber/java/libphonenumber/src/com/google/i18n/phonenumbers/
H A DShortNumberInfo.java224 * Gets the expected cost category of a short number when dialed from a region (however, nothing
236 * ShortNumberCost cost = shortInfo.getExpectedCostForRegion(number, regionCode);
237 * // Do something with the cost information here.
240 * @param number the short number for which we want to know the expected cost category
242 * @return the expected cost category for that region of the short number. Returns UNKNOWN_COST if
243 * the number does not match a cost category. Note that an invalid number may match any cost
265 // The cost categories are tested in order of decreasing expense, since if for some reason the in getExpectedCostForRegion()
266 // patterns overlap the most expensive matching cost category should be returned. in getExpectedCostForRegion()
284 * Gets the expected cost categor
387 getExampleShortNumberForCost(String regionCode, ShortNumberCost cost) getExampleShortNumberForCost() argument
[all...]
/third_party/libphonenumber/javascript/i18n/phonenumbers/
H A Dshortnumberinfo.js227 * Gets the expected cost category of a short number when dialed from a region
241 * ShortNumberCost cost = shortInfo.getExpectedCostForRegion(number,
243 * // Do something with the cost information here.
247 * want to know the expected cost category
249 * @return {i18n.phonenumbers.ShortNumberInfo.ShortNumberCost} the expected cost
251 * number does not match a cost category. Note that an invalid number may
252 * match any cost category.
293 * Gets the expected cost category of a short number (however, nothing is
298 * highest cost in the sequence PREMIUM_RATE, UNKNOWN_COST, STANDARD_RATE,
301 * another, its expected cost canno
[all...]
/third_party/node/test/fixtures/postject-copy/node_modules/commander/lib/
H A DsuggestSimilar.js26 let cost = 1;
28 cost = 0;
30 cost = 1;
35 d[i - 1][j - 1] + cost // substitution

Completed in 16 milliseconds

1234