| /external/libvpx/vp8/encoder/ |
| treewriter.c | 14 static void cost( function
32 cost(C, T, P, j, d);
38 cost(c, t, p, 0, 0);
|
| encodemv.c | 104 unsigned int cost; local
108 cost = vp8_cost_zero(p [mvpis_short])
112 return cost;
117 cost = vp8_cost_one(p [mvpis_short]);
120 cost += vp8_cost_bit(p [MVPbits + i], (x >> i) & 1);
127 cost += vp8_cost_bit(p [MVPbits + i], (x >> i) & 1);
132 cost += vp8_cost_bit(p [MVPbits + 3], (x >> 3) & 1);
135 return cost; // + vp8_cost_bit( p [MVPsign], v < 0);
238 const int cost = 7 + MV_PROB_UPDATE_CORRECTION + ((vp8_cost_one(update_p) - vp8_cost_zero(update_p) + 128) >> 8); local
240 if (cur_b - new_b > cost)
[all...] |
| tokenize.c | 70 // initialize the cost for extra bits for all possible coefficient value.
72 int cost = 0; local
81 cost += vp8_treed_cost(p->tree, p->prob, extra >> 1, Length);
83 cost += vp8_cost_bit(vp8_prob_half, extra & 1); /* sign */
84 vp8_dct_value_cost[i + DCT_MAX_VALUE] = cost;
|
| pickinter.c | 223 int cost = mb->mbmode_cost [xd->frame_type] [B_PRED]; local
224 int error = RD_ESTIMATE(mb->rdmult, mb->rddiv, cost, 0); // Rd estimate for the cost of the block prediction mode
252 cost += r;
265 *Rate = cost;
596 // Work out the cost assosciated with selecting the reference frame
773 // mv cost;
|
| /bionic/libc/kernel/common/linux/netfilter/ |
| xt_limit.h | 23 u_int32_t credit_cap, cost; member in struct:xt_rateinfo
|
| /development/ndk/platforms/android-3/include/linux/netfilter/ |
| xt_limit.h | 23 u_int32_t credit_cap, cost; member in struct:xt_rateinfo
|
| /external/kernel-headers/original/linux/netfilter/ |
| xt_limit.h | 16 u_int32_t credit_cap, cost; member in struct:xt_rateinfo
|
| /prebuilt/ndk/android-ndk-r4/platforms/android-3/arch-arm/usr/include/linux/netfilter/ |
| xt_limit.h | 23 u_int32_t credit_cap, cost; member in struct:xt_rateinfo
|
| /prebuilt/ndk/android-ndk-r4/platforms/android-4/arch-arm/usr/include/linux/netfilter/ |
| xt_limit.h | 23 u_int32_t credit_cap, cost; member in struct:xt_rateinfo
|
| /prebuilt/ndk/android-ndk-r4/platforms/android-5/arch-arm/usr/include/linux/netfilter/ |
| xt_limit.h | 23 u_int32_t credit_cap, cost; member in struct:xt_rateinfo
|
| /prebuilt/ndk/android-ndk-r4/platforms/android-5/arch-x86/usr/include/linux/netfilter/ |
| xt_limit.h | 23 u_int32_t credit_cap, cost; member in struct:xt_rateinfo
|
| /prebuilt/ndk/android-ndk-r4/platforms/android-8/arch-arm/usr/include/linux/netfilter/ |
| xt_limit.h | 23 u_int32_t credit_cap, cost; member in struct:xt_rateinfo
|
| /prebuilt/ndk/android-ndk-r4/platforms/android-8/arch-x86/usr/include/linux/netfilter/ |
| xt_limit.h | 23 u_int32_t credit_cap, cost; member in struct:xt_rateinfo
|
| /external/iptables/include/linux/netfilter_ipv4/ |
| ipt_limit.h | 24 u_int32_t credit_cap, cost; member in struct:ipt_rateinfo
|
| /external/iptables/include/linux/netfilter_ipv6/ |
| ip6t_limit.h | 23 u_int32_t credit_cap, cost; member in struct:ip6t_rateinfo
|
| /external/srec/srec/ca/ |
| rec_resu.c | 45 bigcostdata cost; local
47 srec_get_top_choice_score(hRecog->recm, &cost, do_incsil);
49 *score = cost;
|
| /external/bzip2/ |
| compress.c | 256 UInt16 cost[BZ_N_GROUPS]; local
353 Calculate the cost of this group as coded
356 for (t = 0; t < nGroups; t++) cost[t] = 0;
383 cost[0] = cost01 & 0xffff; cost[1] = cost01 >> 16;
384 cost[2] = cost23 & 0xffff; cost[3] = cost23 >> 16;
385 cost[4] = cost45 & 0xffff; cost[5] = cost45 >> 16;
391 for (t = 0; t < nGroups; t++) cost[t] += s->len[t][icv]
[all...] |
| /external/srec/srec/include/ |
| search_network.h | 133 costdata cost; member in struct:FSMarc_t
|
| /external/webkit/JavaScriptCore/runtime/ |
| UString.h | 171 size_t cost() const { return m_rep->cost(); } function in class:JSC::UString
|
| UStringImpl.h | 146 size_t cost() function in class:JSC::UStringImpl
148 // For substrings, return the cost of the base string.
150 return m_dataBuffer.asPtr<UStringImpl*>()->cost();
|
| /frameworks/base/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;
|
| /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;
|
| /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/jdiff/src/jdiff/ |
| DiffMyers.java | 83 private int cost; field in class:DiffMyers
96 The edit cost is stored into COST; this is the total number of
160 cost = 2 * c - 1;
192 cost = 2 * c;
238 cost = 2 * c - 1;
270 cost = 2 * c - 1;
310 int c = cost;
|
| /external/speex/libspeex/ |
| jitter.c | 171 cost = delay + late_factor*[number of frames that would be late if we used that delay]
173 @param late_factor Equivalent cost of a late frame (in timestamp units)
199 /* Compute cost for one lost packet */
227 spx_int32_t cost; local
235 /* Actual cost function that tells us how bad using this delay would be */
236 cost = -latest + late_factor*late;
237 /*fprintf(stderr, "cost %d = %d + %f * %d\n", cost, -latest, late_factor, late);*/
238 if (cost < best_cost)
240 best_cost = cost;
[all...] |
