| /external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/ |
| vp9_segmentation.c | 72 // Based on set of segment counts and probabilities calculate a cost estimate
81 // Cost the top node of the tree
82 int cost = c0123 * vp9_cost_zero(probs[0]) + local
85 // Cost subsequent levels
87 cost += c01 * vp9_cost_zero(probs[1]) +
91 cost += segcounts[0] * vp9_cost_zero(probs[3]) +
94 cost += segcounts[2] * vp9_cost_zero(probs[4]) +
99 cost += c45 * vp9_cost_zero(probs[2]) +
103 cost += segcounts[4] * vp9_cost_zero(probs[5]) +
106 cost += segcounts[6] * vp9_cost_zero(probs[6])
[all...] |
| /external/chromium_org/third_party/libwebp/enc/ |
| cost.c | 10 // Cost tables for level and modes
14 #include "./cost.h"
17 // Boolean-cost cost table
49 // Level cost tables
338 int cost = 0; local
342 cost += VP8BitCost(bits & 1, probas[i]);
347 return cost;
370 // Starting at level 67 and up, the variable part of the cost is
379 // Mode cost tables
500 int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0; local
[all...] |
| /external/libphonenumber/java/src/com/android/i18n/phonenumbers/ |
| ShortNumberInfo.java | 55 /** Cost categories of short numbers. */
166 * Gets the expected cost category of a short number when dialled from a region (however, nothing
175 * ShortNumberInfo.ShortNumberCost cost = shortInfo.getExpectedCostForRegion(shortNumber,
177 * // Do something with the cost information here.
180 * @param shortNumber the short number for which we want to know the expected cost category,
183 * @return the expected cost category for that region of the short number. Returns UNKNOWN_COST if
184 * the number does not match a cost category. Note that an invalid number may match any cost
195 // The cost categories are tested in order of decreasing expense, since if for some reason the
196 // patterns overlap the most expensive matching cost category should be returned
243 ShortNumberCost cost = ShortNumberCost.TOLL_FREE; local
[all...] |
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_encodemv.c | 104 int z, c, o, d, e, f, cost = 0; local
107 cost += class_cost[c];
112 cost += class0_cost[d];
117 cost += bits_cost[i][((d >> i) & 1)];
120 cost += class0_fp_cost[d][f];
122 cost += fp_cost[f];
126 cost += class0_hp_cost[e];
128 cost += hp_cost[e];
131 mvcost[v] = cost + sign_cost[0];
132 mvcost[-v] = cost + sign_cost[1]
[all...] |
| vp9_segmentation.c | 82 // Based on set of segment counts and probabilities calculate a cost estimate
91 // Cost the top node of the tree
92 int cost = c0123 * vp9_cost_zero(probs[0]) + local
95 // Cost subsequent levels
97 cost += c01 * vp9_cost_zero(probs[1]) +
101 cost += segcounts[0] * vp9_cost_zero(probs[3]) +
104 cost += segcounts[2] * vp9_cost_zero(probs[4]) +
109 cost += c45 * vp9_cost_zero(probs[2]) +
113 cost += segcounts[4] * vp9_cost_zero(probs[5]) +
116 cost += segcounts[6] * vp9_cost_zero(probs[6])
[all...] |
| vp9_tokenize.c | 139 // initialize the cost for extra bits for all possible coefficient value.
141 int cost = 0; local
149 cost += treed_cost(p->tree, p->prob, extra >> 1, length);
151 cost += vp9_cost_bit(vp9_prob_half, extra & 1); /* sign */
152 dct_value_cost[i + DCT_MAX_VALUE] = cost;
|
| /external/opencv/cvaux/src/ |
| cvcorrespond.cpp | 73 float cost, cost1; local
113 /* Fill upper line in the cost Table */
128 /* Fill lefter line in the cost Table */
177 cost = 0;
184 cost = (float) (r_len * r_len - l_len * l_len) * (1 / (r_len * l_len));
188 cost = (float) (l_len * l_len - r_len * r_len) * (1 / (r_len * l_len));
200 min1 = costTable[i_1 + j_1 * row_size] + cost + (float) cost1;
|
| /external/srec/srec/include/ |
| search_network.h | 133 costdata cost; member in struct:FSMarc_t
|
| /external/webp/src/enc/ |
| cost.c | 10 // Cost tables for level and modes
14 #include "./cost.h"
17 // Boolean-cost cost table
49 // Level cost tables
338 int cost = 0; local
342 cost += VP8BitCost(bits & 1, probas[i]);
347 return cost;
370 // Starting at level 67 and up, the variable part of the cost is
379 // Mode cost tables
500 int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0; local
[all...] |
| /frameworks/av/media/libstagefright/codecs/avc/enc/src/ |
| findhalfpel.cpp | 84 // find cost for the current full-pel position
610 int cost; local
614 cost = AVCSAD_Macroblock_C(cand, cur, dmin, NULL);
616 return cost;
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/encoder/ |
| vp9_encodemv.c | 104 int z, c, o, d, e, f, cost = 0; local
107 cost += class_cost[c];
112 cost += class0_cost[d];
117 cost += bits_cost[i][((d >> i) & 1)];
120 cost += class0_fp_cost[d][f];
122 cost += fp_cost[f];
126 cost += class0_hp_cost[e];
128 cost += hp_cost[e];
131 mvcost[v] = cost + sign_cost[0];
132 mvcost[-v] = cost + sign_cost[1]
[all...] |
| vp9_segmentation.c | 82 // Based on set of segment counts and probabilities calculate a cost estimate
91 // Cost the top node of the tree
92 int cost = c0123 * vp9_cost_zero(probs[0]) + local
95 // Cost subsequent levels
97 cost += c01 * vp9_cost_zero(probs[1]) +
101 cost += segcounts[0] * vp9_cost_zero(probs[3]) +
104 cost += segcounts[2] * vp9_cost_zero(probs[4]) +
109 cost += c45 * vp9_cost_zero(probs[2]) +
113 cost += segcounts[4] * vp9_cost_zero(probs[5]) +
116 cost += segcounts[6] * vp9_cost_zero(probs[6])
[all...] |
| vp9_tokenize.c | 139 // initialize the cost for extra bits for all possible coefficient value.
141 int cost = 0; local
149 cost += treed_cost(p->tree, p->prob, extra >> 1, length);
151 cost += vp9_cost_bit(vp9_prob_half, extra & 1); /* sign */
152 dct_value_cost[i + DCT_MAX_VALUE] = cost;
|
| /packages/apps/QuickSearchBox/src/com/android/quicksearchbox/util/ |
| LevenshteinDistance.java | 75 int cost = sourceToken.prefixOf(targetToken) ? 0 : 1; local
87 if (d + cost < distance) {
88 distance = d + cost;
89 type = cost == 0 ? EDIT_UNCHANGED : EDIT_REPLACE;
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/typing/ |
| typing_weighting.h | 42 float cost = 0.0f; local
44 cost += ScoringParams::HAS_MULTI_WORD_TERMINAL_COST;
47 cost += ScoringParams::HAS_PROXIMITY_TERMINAL_COST;
50 cost += ScoringParams::HAS_EDIT_CORRECTION_TERMINAL_COST;
52 return cost;
61 float cost = 0.0f; local
63 cost = 0.0f;
65 cost = ScoringParams::INTENTIONAL_OMISSION_COST;
67 cost = ScoringParams::OMISSION_COST_FIRST_CHAR;
69 cost = sameCodePoint ? ScoringParams::OMISSION_COST_SAME_CHA
87 float cost = isProximity ? (isFirstChar ? ScoringParams::FIRST_CHAR_PROXIMITY_COST local
142 float cost = (singleChar ? ScoringParams::INSERTION_COST_FIRST_CHAR : 0.0f); local
172 const float cost = firstCompletion ? ScoringParams::COST_FIRST_COMPLETION local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| ndhelper.h | 17 __LONG32 cost; member in struct:tagDiagnosticsInfo
|
| /development/perftests/panorama/feature_stab/db_vlvm/ |
| db_image_homography.cpp | 181 double cost,best_cost; local
214 cost=db_SquaredReprojectionErrorHomography(y,hyp_point,x3);
216 if(!done || cost<best_cost)
219 best_cost=cost;
|
| /external/chromium_org/third_party/brotli/src/brotli/enc/ |
| block_splitter.cc | 167 double *cost = new double[vecsize]; local
168 memset(cost, 0, sizeof(cost[0]) * vecsize);
171 // After each iteration of this loop, cost[k] will contain the difference
172 // between the minimum cost of arriving at the current byte position using
173 // entropy code k, and the minimum cost of arriving at the current byte
174 // position. This difference is capped at the block switch cost, and if it
175 // reaches block switch cost, it means that when we trace back from the last
183 cost[k] += insert_cost[insert_cost_ix + k];
184 if (cost[k] < min_cost)
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/program/ |
| register_allocate.c | 68 * up front and stored in a 2-dimensional array, so that the cost of
140 * approximate cost of spilling this node.
528 * Returns a node number to be spilled according to the cost/benefit using
539 float cost = g->nodes[n].spill_cost; local
542 if (cost <= 0.0)
547 if (benefit / cost > best_benefit) {
548 best_benefit = benefit / cost;
557 * Only nodes with a spill cost set (cost != 0.0) will be considered
561 ra_set_node_spill_cost(struct ra_graph *g, unsigned int n, float cost)
[all...] |
| /external/elfutils/0.153/libdwfl/ |
| dwfl_segment_report_module.c | 596 const GElf_Off cost = (contiguous < file_trimmed_end ? total_filesz local
605 cost, worthwhile, whole, contiguous,
|
| /external/linux-tools-perf/perf-3.12.0/tools/perf/ |
| builtin-report.c | 86 uint64_t cost; local
103 cost = sample->weight;
104 if (!cost)
105 cost = 1;
114 he = __hists__add_mem_entry(&evsel->hists, al, parent, mi, cost, cost);
153 evsel->hists.stats.total_period += cost;
|
| /external/mesa3d/src/mesa/program/ |
| register_allocate.c | 68 * up front and stored in a 2-dimensional array, so that the cost of
140 * approximate cost of spilling this node.
528 * Returns a node number to be spilled according to the cost/benefit using
539 float cost = g->nodes[n].spill_cost; local
542 if (cost <= 0.0)
547 if (benefit / cost > best_benefit) {
548 best_benefit = benefit / cost;
557 * Only nodes with a spill cost set (cost != 0.0) will be considered
561 ra_set_node_spill_cost(struct ra_graph *g, unsigned int n, float cost)
[all...] |
| /external/srec/srec/crec/ |
| word_lattice.c | 47 #define TRUE_KILL_WTOKEN(WT) { WT.cost = MAXcostdata; \
94 if (best_cost > wtoken->cost)
95 best_cost = wtoken->cost;
115 bigcostdata cost; local
129 cost = wtoken->cost + rec->accumulated_cost_offset[ wtoken->end_time];
134 cost_for_word = cost - next_wtoken->cost - rec->accumulated_cost_offset[ next_wtoken->end_time];
138 cost_for_word = cost;
141 PLogMessage (" (%d W%d %s cost=%d/%d/%d time=%d%s node=%d)", wtoken_index, wtoken->word, p, wtoken->cost, cost, cost_for_word, wt (…)
310 bigcostdata cost, cost_for_word; local
521 bigcostdata cost; local
[all...] |
| /external/zopfli/src/zopfli/ |
| squeeze.c | 111 Function that calculates a cost based on a model for the given LZ77 symbol.
117 Cost model which should exactly match fixed tree.
129 double cost = 0; local
130 if (lsym <= 279) cost += 7;
131 else cost += 8;
132 cost += 5; /* Every dist symbol has length 5. */
133 return cost + dbits + lbits;
138 Cost model based on symbol statistics.
155 Finds the minimum possible cost this cost model can return for valid length an
436 double cost = GetBestLengths( local
459 double cost; local
[all...] |
| /ndk/sources/host-tools/sed-4.2.1/sed/ |
| fmt.c | 48 cost of 50 means that it is as bad as a line 5 characters too short
52 typedef long COST;
54 #define MAXCOST (~(((unsigned long) 1) << (8 * sizeof (COST) -1)))
57 #define EQUIV(n) SQR ((COST) (n))
59 /* Cost of a filled line n chars longer or shorter than best_width. */
62 /* Cost of the difference between adjacent filled lines. */
65 /* Basic cost per line. */
68 /* Cost of breaking a line after the first word of a sentence, where
72 /* Cost of breaking a line before the last word of a sentence, where
79 /* Cost of breaking a line after a period not marking end of a sentence
484 register COST cost; local
518 register COST cost; local
[all...] |
