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

12

/external/libvpx/vp8/encoder/
H A Dtreewriter.c14 static void cost( function
32 cost(C, T, P, j, d);
38 cost(c, t, p, 0, 0);
H A Dencodemv.c104 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...]
H A Drdopt.c586 int cost = 0; local
597 cost += mb->token_costs [type] [vp8_coef_bands[c]] [pt] [t];
598 cost += vp8_dct_value_cost_ptr[v];
605 cost += mb->token_costs [type] [vp8_coef_bands[c]] [pt] [DCT_EOB_TOKEN];
610 return cost;
615 int cost = 0; local
633 cost += cost_coeffs(mb, x->block + b, type,
637 cost += cost_coeffs(mb, x->block + 24, 1,
640 return cost;
717 int cost local
807 int cost = 0; local
933 int cost = 0; local
1003 int cost = 0; local
[all...]
H A Dtokenize.c70 // 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;
/external/kernel-headers/original/linux/netfilter/
H A Dxt_limit.h16 u_int32_t credit_cap, cost; member in struct:xt_rateinfo
/external/srec/srec/crec/
H A Dsrec_eosd.c165 /* 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 < eftoke
[all...]
H A Dword_lattice.c47 #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
310 bigcostdata cost, cost_for_word; local
486 srec_get_top_choice_score(multi_srec* recm, bigcostdata *cost, int do_incsil) argument
521 bigcostdata cost; local
[all...]
H A Dpriority_q.c98 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_ad
[all...]
H A Dsrec.c165 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 >
716 srec_process_word_boundary_nbest(srec* rec, nodeID end_node, wordID word, wtokenID word_backtrace, costdata cost, costdata* pcurrent_word_threshold, int *any_nodes_blocked) argument
830 costdata cost, cost_with_wtw; local
1531 costdata cost; local
[all...]
H A Dsrec_results.c231 ESR_ReturnCode srec_nbest_get_resultWordIDs(void* rec_void, size_t index, wordID* wordIDs, size_t* len, asr_int32_t* cost) argument
243 *cost = MAXbcostdata;
248 *cost = stack->complete_paths[index]->costsofar;
283 int srec_nbest_get_result(void* rec_void, int n, char* label, int label_len, asr_int32_t* cost, int whether_strip_slot_markers) argument
294 *cost = MAXbcostdata;
300 *cost = stack->complete_paths[n]->costsofar;
380 start_cost = wtoken->cost + rec->accumulated_cost_offset[ start_frame];
388 end_cost = wtoken->cost + rec->accumulated_cost_offset[ end_frame];
406 /* this is the best cost, unconstrained by state sequence */
416 /* this is the best cost, unconstraine
[all...]
H A Dsrec_debug.c55 printf("%sftoken %d rec %d@%d fsmnode %d cost %d word %d(%s) word_backtrace %d next_token_index %d ", msg, token_index, rec->id, rec->current_search_frame, ftoken->FSMnode_index, ftoken->cost, ftoken->word,
98 costdata* costs = &stoken->cost[0];
H A Dsrec_context.c110 wordID olabel, costdata cost,
244 context->FSMarc_list[i].cost = wbcost;
916 costdata cost = FREEcostdata; local
1018 cost = FREEcostdata;
1028 cost = FREEcostdata;
1065 atoken->cost = g_fst_options.wtw_cost_override;
1067 atoken->cost = g_fst_options.arc_cost_override;
1069 atoken->cost = cost;
1165 if (atoken->cost !
1187 FST_AddWordToGrammar(srec_context* fst, const char* _slot, const char* word, const char* pron, const int cost) argument
1773 costdata cost; local
[all...]
H A Dsrec_tokens.c101 token->cost[i] = MAXcostdata;
259 ftoken->cost = MAXcostdata;
/external/iptables/include/linux/netfilter_ipv4/
H A Dipt_limit.h24 u_int32_t credit_cap, cost; member in struct:ipt_rateinfo
/external/iptables/include/linux/netfilter_ipv6/
H A Dip6t_limit.h23 u_int32_t credit_cap, cost; member in struct:ip6t_rateinfo
/external/proguard/src/proguard/shrink/
H A DShortestUsageMark.java65 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;
63 ShortestUsageMark(ShortestUsageMark previousUsageMark, String reason, int cost, Clazz clazz) argument
80 ShortestUsageMark(ShortestUsageMark previousUsageMark, String reason, int cost, Clazz clazz, Member member) argument
/external/srec/srec/include/
H A Dsrec_results.h42 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);
H A Dsrec.h49 costdata costdelta; /* cost relative to path being propagated */
54 costdata costbasis; /* cost of best fsmarc_token host */
68 costdata cost[MAX_HMM]; /* cost so far*/ member in struct:fsmarc_token_t
88 costdata cost; member in struct:fsmnode_token_t
108 costdata cost; /* cost for path up to this point*/ member in struct:word_token_t
H A Dword_lattice.h43 int srec_get_top_choice_score(multi_srec* rec, bigcostdata *cost, int do_incsil);
H A Dsearch_network.h133 costdata cost; member in struct:FSMarc_t
/external/srec/srec/ca/
H A Drec_resu.c45 bigcostdata cost; local
47 srec_get_top_choice_score(hRecog->recm, &cost, do_incsil);
49 *score = cost;
H A Drec_nbes.c99 ESR_ReturnCode CA_NBestListGetResultWordIDs(CA_NBestList* nbest, size_t index, wordID* wordIDs, size_t* len, asr_int32_t* cost) argument
106 return srec_nbest_get_resultWordIDs(nbest, index, wordIDs, len, cost);
/external/bzip2/
H A Dcompress.c256 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[
[all...]
/external/webkit/JavaScriptCore/runtime/
H A DCollector.h84 void reportExtraMemoryCost(size_t cost);
269 inline void Heap::reportExtraMemoryCost(size_t cost) argument
271 if (cost > minExtraCost)
272 recordExtraCost(cost);
/external/jdiff/src/jdiff/
H A DDiffMyers.java83 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;

Completed in 178 milliseconds

12