| /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...] |
| /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/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/netfilter/ |
| xt_limit.h | 16 u_int32_t credit_cap, cost; member in struct:xt_rateinfo
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/netfilter_bridge/ |
| ebt_limit.h | 20 u_int32_t credit_cap, cost; member in struct:ebt_limit_info
|
| /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/srec/srec/crec/ |
| srec_eosd.c | 165 /* eos cost margin */
176 eos_cost_margin = xftoken->cost + wrapup_cost - eftoken->cost;
180 eos_cost_margin = oeftoken->cost + wrapup_cost - eftoken->cost;
182 else if (oeftoken->cost > eftoken->cost)
184 eos_cost_margin = xftoken->cost + wrapup_cost - eftoken->cost;
187 { /* if(oeftoken->cost < eftoken->cost) *
[all...] |
| 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...] |
| priority_q.c | 98 if ((pq->max_cost_in_q == MAXcostdata) || (token->cost > pq->max_cost_in_q))
100 pq->max_cost_in_q = token->cost;
177 ASSERT(pq->max_cost_in_q == token->cost);
200 cost_to_add = token_to_add->cost;
203 printf("WORDADD PQ tokenid %d cost %d\n", token_index_to_add, cost_to_add);
208 printf("WORDADD PQ token %d word %d cost %d\n", token_index, token->word, token->cost);
216 printf("WORDADD PQ - rejecting because cost too high cost_to_add(%d) max_cost_in_q(%d) num_in_q(%d)\n",
238 if (token->cost < cost_to_add)
258 if (token->cost < cost_to_add && pplace_to_add == NULL
[all...] |
| srec.c | 165 if (awtoken->costbasis > stoken->cost[j])
166 awtoken->costbasis = stoken->cost[j];
173 if (awtoken->costbasis > ftoken->cost)
174 awtoken->costbasis = ftoken->cost;
391 if ((current_token->cost[i] != MAXcostdata) ||
392 ((i > 0) && current_token->cost[i-1] != MAXcostdata))
421 /* if(fsm_arc->cost < rec->prune_delta) */
465 if (token->cost[i] < current_prune_thresh)
533 PLogError ("reprune_new_states: can't seem to prune enough - best cost %d num_new_states %d\n",
567 if( token_index!=not_this_one && token->cost >= current_prune_thresh
830 costdata cost, cost_with_wtw; local
1531 costdata cost; local
[all...] |
| /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/proguard/src/proguard/shrink/ |
| ShortestUsageMark.java | 65 int cost,
68 this(previousUsageMark, reason, cost, clazz, null);
78 * @param cost the added cost of following this path.
82 int cost,
88 this.depth = previousUsageMark.depth + cost;
|
| /external/srec/srec/include/ |
| srec_results.h | 42 int srec_nbest_get_result(void* nbest, int n, char* label, int label_len, asr_int32_t* cost, int whether_strip_slot_markers);
44 ESR_ReturnCode srec_nbest_get_resultWordIDs(void* nbest, size_t inde, wordID* wordIDs, size_t* len, asr_int32_t* cost);
|
| /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;
|
| rec_nbes.c | 99 ESR_ReturnCode CA_NBestListGetResultWordIDs(CA_NBestList* nbest, size_t index, wordID* wordIDs, size_t* len, asr_int32_t* cost)
106 return srec_nbest_get_resultWordIDs(nbest, index, wordIDs, len, cost);
|
| /frameworks/base/media/libstagefright/codecs/avc/enc/src/ |
| intra_est.cpp | 435 int cost; local
441 cost = cost_i16(orgY, org_pitch, encvid->pred_i16[AVC_I16_Vertical], *min_cost);
442 if (cost < *min_cost)
444 *min_cost = cost;
455 cost = cost_i16(orgY, org_pitch, encvid->pred_i16[AVC_I16_Horizontal], *min_cost);
456 if (cost < *min_cost)
458 *min_cost = cost;
466 cost = cost_i16(orgY, org_pitch, encvid->pred_i16[AVC_I16_DC], *min_cost);
467 if (cost < *min_cost)
469 *min_cost = cost;
495 int cost; local
639 int cost = 0; local
731 uint16 min_cost, cost; local
1389 int cost, mincost; local
1727 int cost; local
[all...] |
| /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;
|
