| /external/srec/srec/crec/ |
| D | srec_eosd.c | 176 eos_cost_margin = xftoken->cost + wrapup_cost - eftoken->cost; in srec_check_end_of_speech()
180 eos_cost_margin = oeftoken->cost + wrapup_cost - eftoken->cost; in srec_check_end_of_speech()
182 else if (oeftoken->cost > eftoken->cost) in srec_check_end_of_speech()
184 eos_cost_margin = xftoken->cost + wrapup_cost - eftoken->cost; in srec_check_end_of_speech()
188 eos_cost_margin = oeftoken->cost + wrapup_cost - eftoken->cost; in srec_check_end_of_speech()
206 opteos_cost_margin = xftoken->cost + wrapup_cost - eftoken->cost; in srec_check_end_of_speech()
|
| D | word_lattice.c | 47 #define TRUE_KILL_WTOKEN(WT) { WT.cost = MAXcostdata; \
94 if (best_cost > wtoken->cost) in lattice_best_cost_to_frame()
95 best_cost = wtoken->cost; in lattice_best_cost_to_frame()
115 bigcostdata cost; in print_word_token_backtrace() local
129 cost = wtoken->cost + rec->accumulated_cost_offset[ wtoken->end_time]; in print_word_token_backtrace()
134 … cost_for_word = cost - next_wtoken->cost - rec->accumulated_cost_offset[ next_wtoken->end_time]; in print_word_token_backtrace()
138 cost_for_word = cost; in print_word_token_backtrace()
141 …t=%d/%d/%d time=%d%s node=%d)", wtoken_index, wtoken->word, p, wtoken->cost, cost, cost_for_word, … in print_word_token_backtrace()
310 bigcostdata cost, cost_for_word; in print_word_token() local
318 cost = wtoken->cost + rec->accumulated_cost_offset[wtoken->end_time]; in print_word_token()
[all …]
|
| D | srec.c | 165 if (awtoken->costbasis > stoken->cost[j]) in reprune_altword_tokens()
166 awtoken->costbasis = stoken->cost[j]; in reprune_altword_tokens()
173 if (awtoken->costbasis > ftoken->cost) in reprune_altword_tokens()
174 awtoken->costbasis = ftoken->cost; in reprune_altword_tokens()
391 if ((current_token->cost[i] != MAXcostdata) || in find_which_models_to_compute()
392 ((i > 0) && current_token->cost[i-1] != MAXcostdata)) in find_which_models_to_compute()
465 if (token->cost[i] < current_prune_thresh) in prune_new_tokens()
567 if( token_index!=not_this_one && token->cost >= current_prune_thresh) in prune_fsmnode_tokens()
645 if (stoken->cost[i] < MAXcostdata) in reset_best_cost_to_zero()
647 ASSERT(stoken->cost[i] >= current_best_cost); in reset_best_cost_to_zero()
[all …]
|
| D | priority_q.c | 98 if ((pq->max_cost_in_q == MAXcostdata) || (token->cost > pq->max_cost_in_q)) in remove_non_end_word_from_q()
100 pq->max_cost_in_q = token->cost; in remove_non_end_word_from_q()
177 ASSERT(pq->max_cost_in_q == token->cost); in sanity_check_priority_q()
200 cost_to_add = token_to_add->cost; in add_word_token_to_priority_q()
208 printf("WORDADD PQ token %d word %d cost %d\n", token_index, token->word, token->cost); in add_word_token_to_priority_q()
238 if (token->cost < cost_to_add) in add_word_token_to_priority_q()
258 if (token->cost < cost_to_add && pplace_to_add == NULL) in add_word_token_to_priority_q()
309 pq->max_cost_in_q = token->cost; in add_word_token_to_priority_q()
|
| D | srec_results.c | 231 …st_get_resultWordIDs(void* rec_void, size_t index, wordID* wordIDs, size_t* len, asr_int32_t* cost) in srec_nbest_get_resultWordIDs() argument
243 *cost = MAXbcostdata; in srec_nbest_get_resultWordIDs()
248 *cost = stack->complete_paths[index]->costsofar; in srec_nbest_get_resultWordIDs()
283 int srec_nbest_get_result(void* rec_void, int n, char* label, int label_len, asr_int32_t* cost, int… in srec_nbest_get_result() argument
294 *cost = MAXbcostdata; in srec_nbest_get_result()
300 *cost = stack->complete_paths[n]->costsofar; in srec_nbest_get_result()
380 start_cost = wtoken->cost + rec->accumulated_cost_offset[ start_frame]; in srec_nbest_get_choice_info()
388 end_cost = wtoken->cost + rec->accumulated_cost_offset[ end_frame]; in srec_nbest_get_choice_info()
|
| D | srec_context.c | 110 wordID olabel, costdata cost,
244 context->FSMarc_list[i].cost = wbcost; in fst_set_wb_costs()
916 costdata cost = FREEcostdata; in FST_LoadGraph() local
1018 cost = FREEcostdata; in FST_LoadGraph()
1028 cost = FREEcostdata; in FST_LoadGraph()
1069 atoken->cost = cost; in FST_LoadGraph()
1165 if (atoken->cost != FREEcostdata) in FST_DumpGraph()
1169 from_node, into_node, ilabel, olabel, atoken->cost); in FST_DumpGraph()
1189 const int cost) in FST_AddWordToGrammar() argument
1415 …rc = fst_add_arcs(fst, start_node, end_node, olabel, (costdata)cost, model_sequence, model_sequenc… in FST_AddWordToGrammar()
[all …]
|
| /external/opencv/cv/src/ |
| D | cvemd.cpp | 87 float **cost; member
120 const float* cost, int cost_step,
124 static CvStatus icvFindBasicVariables( float **cost, char **is_x,
127 static float icvIsOptimal( float **cost, char **is_x,
175 CvMat cost_stub, *cost = &cost_stub; in cvCalcEMD2() local
207 cost->data.fl = 0; in cvCalcEMD2()
208 cost->step = 0; in cvCalcEMD2()
222 CV_CALL( cost = cvGetMat( cost_matrix, &cost_stub )); in cvCalcEMD2()
223 if( cost->rows != size1 || cost->cols != size2 ) in cvCalcEMD2()
227 if( CV_MAT_TYPE( cost->type ) != CV_32FC1 ) in cvCalcEMD2()
[all …]
|
| /external/valgrind/main/callgrind/ |
| D | threads.c | 213 CLG_(zero_cost)( CLG_(sets).full, es->cost ); in CLG_()
214 CLG_(current_state).cost = es->cost; in CLG_()
281 CLG_ASSERT(CLG_(current_state).cost == es->cost); in CLG_()
284 CLG_(current_state).cost ); in CLG_()
332 es->cost = CLG_(get_eventset_cost)(CLG_(sets).full); in new_exec_state()
333 CLG_(zero_cost)( CLG_(sets).full, es->cost ); in new_exec_state()
420 CLG_ASSERT(es->cost == CLG_(current_state).cost); in exec_state_save()
426 CLG_(print_cost)(-9, CLG_(sets).full, es->cost); in exec_state_save()
445 CLG_(current_state).cost = es->cost; in exec_state_restore()
453 CLG_(print_cost)(-9, CLG_(sets).full, es->cost); in exec_state_restore()
|
| D | events.c | 224 void CLG_(init_cost)(EventSet* es, ULong* cost) in CLG_()
228 if (!cost) return; in CLG_()
231 cost[i] = 0; in CLG_()
235 void CLG_(init_cost_lz)(EventSet* es, ULong** cost) in CLG_()
239 CLG_ASSERT(cost != 0); in CLG_()
240 if (!(*cost)) in CLG_()
241 *cost = CLG_(get_eventset_cost)(es); in CLG_()
244 (*cost)[i] = 0; in CLG_()
247 void CLG_(zero_cost)(EventSet* es, ULong* cost) in CLG_()
251 if (!cost) return; in CLG_()
[all …]
|
| D | debug.c | 233 jcc->cost ? jcc->cost[fullOffset(EG_IR)]:0, in CLG_()
234 jcc->cost ? jcc->cost[fullOffset(EG_DR)]:0, in CLG_()
235 jcc->cost ? jcc->cost[fullOffset(EG_DW)]:0); in CLG_()
259 CLG_(print_cost)(s+9, CLG_(sets).full, jcc->cost); in CLG_()
361 CLG_(print_cost)(s+5, ii->eventset, bbcc->cost + ii->cost_offset); in CLG_()
451 void CLG_(print_cost)(int s, EventSet* es, ULong* cost) {} in CLG_()
|
| D | dump.c | 511 c->cost = CLG_(get_eventset_cost)( CLG_(sets).full ); in init_fcost()
512 CLG_(init_cost)( CLG_(sets).full, c->cost ); in init_fcost()
616 void fprint_cost(int fd, EventMapping* es, ULong* cost) in fprint_cost() argument
618 int p = CLG_(sprint_mappingcost)(outbuf, es, cost); in fprint_cost()
636 CLG_(print_cost)(-5, CLG_(sets).full, c->cost); in fprint_fcost()
642 fprint_cost(fd, CLG_(dumpmap), c->cost); in fprint_fcost()
645 CLG_(add_and_zero_cost)( CLG_(sets).full, dump_total_cost, c->cost ); in fprint_fcost()
671 CLG_ASSERT(CLG_(is_zero_cost)( CLG_(sets).full, jcc->cost)); in fprint_jcc()
747 if (!CLG_(is_zero_cost)( CLG_(sets).full, jcc->cost)) { in fprint_jcc()
755 fprint_cost(fd, CLG_(dumpmap), jcc->cost); in fprint_jcc()
[all …]
|
| /external/clang/test/CodeGenCXX/ |
| D | array-operator-delete-call.cpp | 25 S *cost; member
36 cost = new S[3]; in COST()
43 if (cost) { in ~COST()
44 delete [] cost; in ~COST()
|
| /external/libvpx/vp8/encoder/ |
| D | encodemv.c | 104 unsigned int cost; in cost_mvcomponent() local
108 cost = vp8_cost_zero(p [mvpis_short]) in cost_mvcomponent()
112 return cost; in cost_mvcomponent()
117 cost = vp8_cost_one(p [mvpis_short]); in cost_mvcomponent()
120 cost += vp8_cost_bit(p [MVPbits + i], (x >> i) & 1); in cost_mvcomponent()
127 cost += vp8_cost_bit(p [MVPbits + i], (x >> i) & 1); in cost_mvcomponent()
132 cost += vp8_cost_bit(p [MVPbits + 3], (x >> 3) & 1); in cost_mvcomponent()
135 return cost; // + vp8_cost_bit( p [MVPsign], v < 0); in cost_mvcomponent()
238 …const int cost = 7 + MV_PROB_UPDATE_CORRECTION + ((vp8_cost_one(update_p) - vp8_cost_zero(update_p… in update() local
240 if (cur_b - new_b > cost) in update()
|
| D | treewriter.c | 14 static void cost( in cost() function
32 cost(C, T, P, j, d); in cost()
38 cost(c, t, p, 0, 0); in vp8_cost_tokens()
|
| /external/proguard/src/proguard/shrink/ |
| D | ShortestUsageMark.java | 65 int cost, in ShortestUsageMark() argument
68 this(previousUsageMark, reason, cost, clazz, null); in ShortestUsageMark()
82 int cost, in ShortestUsageMark() argument
88 this.depth = previousUsageMark.depth + cost; in ShortestUsageMark()
|
| /external/webp/src/enc/ |
| D | cost.c | 342 int cost = 0; in VariableLevelCost() local
346 cost += VP8BitCost(bits & 1, probas[i]); in VariableLevelCost()
351 return cost; in VariableLevelCost()
|
| D | frame.c | 37 CostArray* cost; member
202 res->cost = enc->proba_.level_cost_[coeff_type]; in InitResidual()
225 const uint16_t *t = res->cost[VP8EncBands[n]][ctx]; in GetResidualCost()
226 int cost; in GetResidualCost() local
228 cost = VP8BitCost(res->last >= 0, p[0]); in GetResidualCost()
230 return cost; in GetResidualCost()
235 cost += VP8LevelCost(t, 0); in GetResidualCost()
237 t = res->cost[VP8EncBands[n]][0]; in GetResidualCost()
240 cost += VP8LevelCost(t, 1); in GetResidualCost()
242 t = res->cost[VP8EncBands[n]][1]; in GetResidualCost()
[all …]
|
| D | quant.c | 396 score_t cost; // bit cost member
435 score_t cost; in TrellisQuantizeBlock() local
453 cost = VP8BitCost(0, last_proba); in TrellisQuantizeBlock()
454 best_score = RDScoreTrellis(lambda, cost, max_error); in TrellisQuantizeBlock()
459 NODE(n, m).cost = 0; in TrellisQuantizeBlock()
491 cur->cost = MAX_COST; in TrellisQuantizeBlock()
508 score_t cost, base_cost, score; in TrellisQuantizeBlock() local
510 if (prev->cost >= MAX_COST) { // dead node? in TrellisQuantizeBlock()
515 base_cost = prev->cost + VP8LevelCost(tcost, level); in TrellisQuantizeBlock()
518 cost = base_cost; in TrellisQuantizeBlock()
[all …]
|
| /external/srec/srec/ca/ |
| D | rec_resu.c | 45 bigcostdata cost; in CA_FullResultScore() local
47 srec_get_top_choice_score(hRecog->recm, &cost, do_incsil); in CA_FullResultScore()
49 *score = cost; in CA_FullResultScore()
|
| D | rec_nbes.c | 99 …etResultWordIDs(CA_NBestList* nbest, size_t index, wordID* wordIDs, size_t* len, asr_int32_t* cost) in CA_NBestListGetResultWordIDs() argument
106 return srec_nbest_get_resultWordIDs(nbest, index, wordIDs, len, cost); in CA_NBestListGetResultWordIDs()
|
| /external/webkit/Source/JavaScriptCore/heap/ |
| D | Heap.h | 79 void reportExtraMemoryCost(size_t cost);
165 inline void Heap::reportExtraMemoryCost(size_t cost) in reportExtraMemoryCost() argument
167 if (cost > minExtraCost) in reportExtraMemoryCost()
168 reportExtraMemoryCostSlowCase(cost); in reportExtraMemoryCost()
|
| /external/opencv/cvaux/src/ |
| D | cvcorrespond.cpp | 73 float cost, cost1; in icvDynamicCorrespond() local
177 cost = 0; in icvDynamicCorrespond()
184 cost = (float) (r_len * r_len - l_len * l_len) * (1 / (r_len * l_len)); in icvDynamicCorrespond()
188 cost = (float) (l_len * l_len - r_len * r_len) * (1 / (r_len * l_len)); in icvDynamicCorrespond()
200 min1 = costTable[i_1 + j_1 * row_size] + cost + (float) cost1; in icvDynamicCorrespond()
|
| /external/bzip2/ |
| D | compress.c | 256 UInt16 cost[BZ_N_GROUPS]; in sendMTFValues() local
356 for (t = 0; t < nGroups; t++) cost[t] = 0; in sendMTFValues()
383 cost[0] = cost01 & 0xffff; cost[1] = cost01 >> 16; in sendMTFValues()
384 cost[2] = cost23 & 0xffff; cost[3] = cost23 >> 16; in sendMTFValues()
385 cost[4] = cost45 & 0xffff; cost[5] = cost45 >> 16; in sendMTFValues()
391 for (t = 0; t < nGroups; t++) cost[t] += s->len[t][icv]; in sendMTFValues()
401 if (cost[t] < bc) { bc = cost[t]; bt = t; }; in sendMTFValues()
|
| /external/srec/srec/include/ |
| D | srec_results.h | 42 …int srec_nbest_get_result(void* nbest, int n, char* label, int label_len, asr_int32_t* cost, int w…
44 …nbest_get_resultWordIDs(void* nbest, size_t inde, wordID* wordIDs, size_t* len, asr_int32_t* cost);
|
| /external/webkit/Source/JavaScriptCore/qt/api/ |
| D | qscriptengine_p.h | 65 inline void reportAdditionalMemoryCost(int cost);
180 void QScriptEnginePrivate::reportAdditionalMemoryCost(int cost) in reportAdditionalMemoryCost() argument
182 if (cost > 0) in reportAdditionalMemoryCost()
183 JSReportExtraMemoryCost(m_context, cost); in reportAdditionalMemoryCost()
|