/external/srec/srec/include/ |
H A D | srec.h | 49 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/webp/src/enc/ |
H A D | histogram.c | 152 // Returns the cost encode the rle-encoded entropy code. 197 double cost = 0.; local 198 for (i = 2; i < length - 2; ++i) cost += (i >> 1) * population[i + 2]; 199 return cost; 202 // Estimates the Entropy + Huffman + other block overhead size cost. 224 // Various histogram combine/cost-eval functions 243 // Performs out = a + b, computing the cost C(a+b) - C(a) - C(b) while comparing 247 // the partial cost against 'cost_threshold + C(a) + C(b)' to possibly bail-out 253 double cost = 0; local 259 // palette_code_bits_ is part of the cost evaluatio 301 double cost = -a->bit_cost_; local [all...] |
H A D | backward_references.c | 482 float* const cost = local 483 (float*)WebPSafeMalloc((uint64_t)pix_count, sizeof(*cost)); 494 if (cost == NULL || cost_model == NULL || hash_chain == NULL) goto Error; 508 for (i = 0; i < pix_count; ++i) cost[i] = 1e38f; 519 prev_cost = cost[i - 1]; 540 if (cost[i + k] > cost_val) { 541 cost[i + k] = (float)cost_val; 582 if (cost[i] > cost_val) { 583 cost[i] = (float)cost_val; 597 free(cost); [all...] |
H A D | frame.c | 20 #include "./cost.h" 39 CostArray* cost; member in struct:__anon28019 57 // Reset the statistics about: number of skips, token proba, level cost,... 74 // Returns the bit-cost for coding the skip probability. 86 size += 8 * 256; // cost of signaling the skip_proba_ itself. 169 // Return the total bit-cost for coding the probability updates. 265 res->cost = enc->proba_.level_cost_[coeff_type]; 289 const uint16_t* t = res->cost[n][ctx0]; 290 int cost; local 295 cost [all...] |
H A D | quant.c | 18 #include "./cost.h" 464 score_t cost; // bit cost member in struct:__anon28023 503 score_t cost; local 521 cost = VP8BitCost(0, last_proba); 522 best_score = RDScoreTrellis(lambda, cost, max_error); 527 NODE(n, m).cost = 0; 559 cur->cost = MAX_COST; 576 score_t cost, base_cost, score; local 578 if (prev->cost > [all...] |
/external/ceres-solver/internal/ceres/ |
H A D | solver_impl.cc | 89 summary->final_cost = min(iteration_summary.cost, summary->final_cost); 108 summary.cost, 144 summary.cost, 185 summary.cost, 1016 // The residual is constant and will be removed, so its cost is 1018 double cost = 0.0; local 1020 &cost, 1028 *fixed_cost += cost;
|
/external/chromium_org/third_party/libwebp/enc/ |
H A D | backward_references.c | 482 float* const cost = local 483 (float*)WebPSafeMalloc((uint64_t)pix_count, sizeof(*cost)); 494 if (cost == NULL || cost_model == NULL || hash_chain == NULL) goto Error; 508 for (i = 0; i < pix_count; ++i) cost[i] = 1e38f; 519 prev_cost = cost[i - 1]; 540 if (cost[i + k] > cost_val) { 541 cost[i + k] = (float)cost_val; 582 if (cost[i] > cost_val) { 583 cost[i] = (float)cost_val; 597 free(cost); [all...] |
H A D | frame.c | 20 #include "./cost.h" 39 CostArray* cost; member in struct:__anon11603 57 // Reset the statistics about: number of skips, token proba, level cost,... 74 // Returns the bit-cost for coding the skip probability. 86 size += 8 * 256; // cost of signaling the skip_proba_ itself. 169 // Return the total bit-cost for coding the probability updates. 265 res->cost = enc->proba_.level_cost_[coeff_type]; 289 const uint16_t* t = res->cost[n][ctx0]; 290 int cost; local 295 cost [all...] |
H A D | quant.c | 18 #include "./cost.h" 464 score_t cost; // bit cost member in struct:__anon11607 503 score_t cost; local 521 cost = VP8BitCost(0, last_proba); 522 best_score = RDScoreTrellis(lambda, cost, max_error); 527 NODE(n, m).cost = 0; 559 cur->cost = MAX_COST; 576 score_t cost, base_cost, score; local 578 if (prev->cost > [all...] |
/external/chromium_org/third_party/sqlite/src/src/ |
H A D | test8.c | 783 double cost; local 794 ** variable nRow. The 'estimated-cost' of the scan will be the number of 799 cost = atof(Tcl_GetVar(interp, "echo_module_cost", TCL_GLOBAL_ONLY)); 895 pIdxInfo->estimatedCost = cost;
|
H A D | where.c | 196 ** cost of pursuing that strategy. 200 double rCost; /* Overall cost of pursuing this search strategy */ 1549 ** the total cost of performing operations with O(logN) or O(NlogN) 1628 WhereCost *pCost /* Lowest cost query plan */ 1681 /* If there is an ORDER BY clause, increase the scan cost to account 1682 ** for the cost of the sort. */ 1684 WHERETRACE(("... sorting increases OR cost %.9g to %.9g\n", 1689 /* If the cost of scanning using this OR term for optimization is 1690 ** less than the current cost stored in pCost, replace the contents 1692 WHERETRACE(("... multi-index OR cost 2756 double cost; /* Cost of using pProbe */ local [all...] |
/external/libvpx/libvpx/vp8/encoder/ |
H A D | pickinter.c | 189 int cost = mb->mbmode_cost [xd->frame_type] [B_PRED]; local 217 cost += r; 228 *Rate = cost; 233 error = RDCOST(mb->rdmult, mb->rddiv, cost, distortion); 783 /* Work out the cost assosciated with selecting the reference frame */ 1036 /* mv cost; */
|
H A D | rdopt.c | 317 /* build token cost array for the type of frame we have now */ 526 int cost = 0; local 537 cost += mb->token_costs [type] [vp8_coef_bands[c]] [pt] [t]; 538 cost += vp8_dct_value_cost_ptr[v]; 545 cost += mb->token_costs [type] [vp8_coef_bands[c]] [pt] [DCT_EOB_TOKEN]; 550 return cost; 555 int cost = 0; local 569 cost += cost_coeffs(mb, x->block + b, PLANE_TYPE_Y_NO_DC, 572 cost += cost_coeffs(mb, x->block + 24, PLANE_TYPE_Y2, 575 return cost; 713 int cost = mb->mbmode_cost [xd->frame_type] [B_PRED]; local 821 int cost = 0; local 959 int cost = 0; local 1035 int cost = 0; local [all...] |
/external/opencv/cv/src/ |
H A D | cvemd.cpp | 87 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/srec/srec/Semproc/src/ |
H A D | SemanticGraphImpl.c | 282 costdata cost = 0; local 425 /* the cost is 0 by default */ 426 cost = 0; 466 cost = 0; 480 /* atoken->cost = cost; not used for now */
|
/external/valgrind/unittest/ |
H A D | bigtest.cc | 162 void SetParameterStat(StatType stat_type, double * param, double cost) { argument 170 cost_m->At(type_id, param_id) = cost;
|
/external/srec/srec/crec/ |
H A D | 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 > 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 D | srec_context.c | 110 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...] |
/external/valgrind/main/callgrind/ |
H A D | dump.c | 491 /* copy file position and init cost */ 508 /* copy file position and init cost */ 513 c->cost = CLG_(get_eventset_cost)( CLG_(sets).full ); 514 CLG_(init_cost)( CLG_(sets).full, c->cost ); 618 void fprint_cost(int fd, EventMapping* es, ULong* cost) argument 620 int p = CLG_(sprint_mappingcost)(outbuf, es, cost); 628 /* Write the cost of a source line; only that parts of the source 631 * Something is written only if cost != 0; returns True in this case. 638 CLG_(print_cost)(-5, CLG_(sets).full, c->cost); 644 fprint_cost(fd, CLG_(dumpmap), c->cost); 1254 fprint_cost_ln(int fd, Char* prefix, EventMapping* em, ULong* cost) argument [all...] |
H A D | sim.c | 51 * - line_loaded : pointer to cost center of instruction 110 * - ULong* CLG_(cost_base) (start of cost array for BB) 1070 CLG_(current_state).cost + fullOffset(EG_IR) ); 1091 global_cost_Ir = CLG_(current_state).cost + fullOffset(EG_IR); 1127 global_cost_Ir = CLG_(current_state).cost + fullOffset(EG_IR); 1173 CLG_(current_state).cost + fullOffset(EG_IR) ); 1175 CLG_(current_state).cost + fullOffset(EG_DR) ); 1200 CLG_(current_state).cost + fullOffset(EG_DR) ); 1233 CLG_(current_state).cost + fullOffset(EG_IR) ); 1235 CLG_(current_state).cost 1741 cachesim_add_icost(SimCost cost, BBCC* bbcc, InstrInfo* ii, ULong exe_count) argument [all...] |
H A D | global.h | 244 /* JmpCall cost center 273 FullCost cost; /* simulator + user counters */ member in struct:_jCC 304 * BB is to be retranslated but cost info is already available. 312 * As cost of a BB has to be distinguished depending on the context, 313 * multiple cost centers for one BB (struct BBCC) exist and the according 390 * The cost centres for the instructions of a basic block are 395 BB* bb; /* BB for this cost center */ 410 FullCost skipped; /* cost for skipped functions called from 414 ULong* cost; /* start of 64bit costs for this BBCC */ member in struct:_BBCC 492 FullCost enter_cost; /* cost even 523 FullCost cost; member in struct:_exec_state 639 SimCost cost; member in struct:_AddrCost [all...] |
/external/elfutils/src/ |
H A D | ldgeneric.c | 3543 uint64_t cost; local 3592 /* Combine the lookup cost factor. The 1/16th addend adds 3594 cost = (2 + maxcnt + size) * (factor + 1.0 / 16.0); 3597 printf ("maxcnt = %d, size = %d, cost = %Ld, success = %g, fail = %g, factor = %g\n", 3598 maxcnt, size, cost, (double) success / (double) maxcnt, (double) maxcnt / (double) size, factor); 3602 if (cost < bestcost) 3604 bestcost = cost;
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | LoopStrengthReduce.cpp | 676 /// Check if expanding this expression is likely to incur significant cost. This 744 // Fow now, consider any other type of expression (div/mul/min/max) high cost. 782 // Get the cost of the scaling factor used in F for LU. 820 assert(isValid() && "invalid cost"); 967 assert(isValid() && "invalid cost"); 970 /// Loose - Set this cost to a losing value. 981 /// operator< - Choose the lower cost. 1003 OS << ", with addrec cost " << AddRecCost; 1010 OS << ", plus " << ScaleCost << " scale cost"; 1012 OS << ", plus " << ImmCost << " imm cost"; 2498 int cost = 1; local [all...] |
/external/libvpx/libvpx/vp9/encoder/ |
H A D | vp9_rdopt.c | 471 * decide whether to include cost of a trailing EOB node or not (i.e. we 500 int c, cost; local 508 cost = token_costs[0][0][pt][DCT_EOB_TOKEN]; 516 cost = (*token_costs)[0][pt][prev_t] + vp9_dct_value_cost_ptr[v]; 528 cost += (*token_costs)[!prev_t][pt][t] + vp9_dct_value_cost_ptr[v]; 540 cost += (*token_costs)[0][pt][DCT_EOB_TOKEN]; 547 return cost; 1148 int cost = 0; local 1183 cost += r; 1198 *rate = cost; 1445 int cost = 0, thismvcost = 0; local [all...] |
/external/valgrind/main/VEX/switchback/ |
H A D | test_bzip2.c | 3659 UInt16 cost[BZ_N_GROUPS]; local 3756 Calculate the cost of this group as coded 3759 for (t = 0; t < nGroups; t++) cost[t] = 0; 3786 cost[0] = cost01 & 0xffff; cost[1] = cost01 >> 16; 3787 cost[2] = cost23 & 0xffff; cost[3] = cost23 >> 16; 3788 cost[4] = cost45 & 0xffff; cost[5] = cost45 >> 16; 3794 for (t = 0; t < nGroups; t++) cost[ [all...] |