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

1234

/external/clang/test/CodeGenCXX/
H A Darray-operator-delete-call.cpp25 S *cost; member in struct:COST
36 cost = new S[3];
43 if (cost) {
44 delete [] cost;
/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...]
/external/iptables/include/linux/netfilter/
H A Dxt_limit.h20 __u32 credit_cap, cost; member in struct:xt_rateinfo
/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...]
/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
/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/opencv/cv/src/
H A Dcvemd.cpp87 float **cost; member in struct:CvEMDState
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; local
207 cost->data.fl = 0;
208 cost->step = 0;
216 "Only one of cost matrix or distance function should be non-NULL in case of user-defined distance" );
220 "The lower boundary can not be calculated if the cost matrix is used" );
222 CV_CALL( cost
334 icvInitEMD( const float* signature1, int size1, const float* signature2, int size2, int dims, CvDistanceFunction dist_func, void* user_param, const float* cost, int cost_step, CvEMDState* state, float* lower_bound, char* local_buffer, int local_buffer_size ) argument
586 icvFindBasicVariables( float **cost, char **is_x, CvNode1D * u, CvNode1D * v, int ssize, int dsize ) argument
711 icvIsOptimal( float **cost, char **is_x, CvNode1D * u, CvNode1D * v, int ssize, int dsize, CvNode2D * enter_x ) argument
918 float **cost = state->cost; local
[all...]
/external/valgrind/main/callgrind/
H A Dthreads.c213 CLG_(zero_cost)( CLG_(sets).full, es->cost );
214 CLG_(current_state).cost = es->cost;
281 CLG_ASSERT(CLG_(current_state).cost == es->cost);
284 CLG_(current_state).cost );
330 /* allocate real cost space: needed as incremented by
332 es->cost = CLG_(get_eventset_cost)(CLG_(sets).full);
333 CLG_(zero_cost)( CLG_(sets).full, es->cost );
420 CLG_ASSERT(es->cost
[all...]
H A Devents.c217 /* Get cost array for an event set */
224 void CLG_(init_cost)(EventSet* es, ULong* cost) argument
228 if (!cost) return;
231 cost[i] = 0;
235 void CLG_(init_cost_lz)(EventSet* es, ULong** cost) argument
239 CLG_ASSERT(cost != 0);
240 if (!(*cost))
241 *cost = CLG_(get_eventset_cost)(es);
244 (*cost)[i] = 0;
247 void CLG_(zero_cost)(EventSet* es, ULong* cost) argument
257 is_zero_cost(EventSet* es, ULong* cost) argument
[all...]
H A Ddebug.c233 jcc->cost ? jcc->cost[fullOffset(EG_IR)]:0,
234 jcc->cost ? jcc->cost[fullOffset(EG_DR)]:0,
235 jcc->cost ? jcc->cost[fullOffset(EG_DW)]:0);
259 CLG_(print_cost)(s+9, CLG_(sets).full, jcc->cost);
361 CLG_(print_cost)(s+5, ii->eventset, bbcc->cost + ii->cost_offset);
451 void CLG_(print_cost)(int s, EventSet* es, ULong* cost) {} argument
/external/eigen/bench/
H A DbenchCholesky.cpp34 int cost = 0; local
38 cost += 2*(r*j+r+j);
82 << "(" << 1e-6 * cost*repeats/timerNoSqrt.value() << " MFLOPS)\t"
84 << "(" << 1e-6 * cost*repeats/timerSqrt.value() << " MFLOPS)\n";
/external/webkit/Source/JavaScriptCore/heap/
H A DHeap.h79 void reportExtraMemoryCost(size_t cost);
165 inline void Heap::reportExtraMemoryCost(size_t cost) argument
167 if (cost > minExtraCost)
168 reportExtraMemoryCostSlowCase(cost);
/external/opencv/cvaux/src/
H A Dcvcorrespond.cpp73 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/webp/src/enc/
H A Dcost.c12 #include "./cost.h"
19 // Boolean-cost cost table
51 // Level cost tables
340 int cost = 0; local
344 cost += VP8BitCost(bits & 1, probas[i]);
349 return cost;
371 // Starting at level 67 and up, the variable part of the cost is
380 // Mode cost tables.
382 // These are the fixed probabilities (in the coding trees) turned into bit-cost
[all...]
/external/webkit/Source/JavaScriptCore/qt/api/
H A Dqscriptengine.cpp184 Reports an additional memory cost of the given \a size, measured in
189 Reporting the additional cost makes it more likely that the garbage
193 the scripting environment, the cost should not be reported, since
202 void QScriptEngine::reportAdditionalMemoryCost(int cost) argument
204 d_ptr->reportAdditionalMemoryCost(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...]

Completed in 2433 milliseconds

1234