/external/valgrind/main/callgrind/ |
H A D | debug.c | 233 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
|
H A D | events.c | 220 /* Get cost array for an event set */ 227 void CLG_(init_cost)(EventSet* es, ULong* cost) argument 231 if (!cost) return; 234 cost[i] = 0; 238 void CLG_(init_cost_lz)(EventSet* es, ULong** cost) argument 242 CLG_ASSERT(cost != 0); 243 if (!(*cost)) 244 *cost = CLG_(get_eventset_cost)(es); 247 (*cost)[i] = 0; 250 void CLG_(zero_cost)(EventSet* es, ULong* cost) argument 260 is_zero_cost(EventSet* es, ULong* cost) argument [all...] |
/external/webp/src/enc/ |
H A D | cost.c | 14 #include "./cost.h" 17 // Boolean-cost cost table 49 // Level cost tables 338 int cost = 0; local 342 cost += VP8BitCost(bits & 1, probas[i]); 347 return cost; 370 // Starting at level 67 and up, the variable part of the cost is 379 // Mode cost tables. 381 // These are the fixed probabilities (in the coding trees) turned into bit-cost 500 int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0; local [all...] |
/external/ceres-solver/internal/ceres/ |
H A D | program.cc | 323 // The residual is constant and will be removed, so its cost is 325 double cost = 0.0; local 327 &cost, 335 *fixed_cost += cost;
|
H A D | problem_impl.cc | 175 // cost and loss functions are tucked away for future deletion, since it is not 216 // Collect the unique cost/loss functions and delete the residuals. 229 // Delete the owned cost/loss functions and parameterizations. 253 << "that the cost function expects."; 287 << "The cost function expects parameter block " << i 600 double* cost, 604 if (cost == NULL && 755 if (cost != NULL) { 756 *cost = tmp_cost; 599 Evaluate(const Problem::EvaluateOptions& evaluate_options, double* cost, vector<double>* residuals, vector<double>* gradient, CRSMatrix* jacobian) argument
|
H A D | problem_test.cc | 56 // Trivial cost function that accepts a single argument. 75 // Trivial cost function that accepts two arguments. 96 // Trivial cost function that accepts three arguments. 177 // The cost function expects the size of the second parameter, z, to be 4 327 // Add a cost function multiple times and check to make sure that 328 // the destructor on the cost function is only called once. 334 CostFunction* cost = new DestructorCountingCostFunction(&num_destructions); local 335 problem.AddResidualBlock(cost, NULL, y, z); 336 problem.AddResidualBlock(cost, NULL, y, z); 337 problem.AddResidualBlock(cost, NUL 1094 double cost; local [all...] |
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/ |
H A D | vp9_encodemv.c | 104 int z, c, o, d, e, f, cost = 0; local 107 cost += class_cost[c]; 112 cost += class0_cost[d]; 117 cost += bits_cost[i][((d >> i) & 1)]; 120 cost += class0_fp_cost[d][f]; 122 cost += fp_cost[f]; 126 cost += class0_hp_cost[e]; 128 cost += hp_cost[e]; 131 mvcost[v] = cost + sign_cost[0]; 132 mvcost[-v] = cost [all...] |
H A D | vp9_tokenize.c | 200 // initialize the cost for extra bits for all possible coefficient value. 202 int cost = 0; local 210 cost += treed_cost(p->tree, p->prob, extra >> 1, length); 212 cost += vp9_cost_bit(vp9_prob_half, extra & 1); /* sign */ 213 value_cost[i] = cost;
|
H A D | vp9_pickmode.c | 171 // calculate the bit cost on motion vector 340 // The cost of skip bit needs to be added. 603 int64_t cost; local 608 cost = RDCOST(x->rdmult, x->rddiv, 612 if (cost < best_cost) { 614 best_cost = cost;
|
/external/chromium_org/third_party/mesa/src/src/mesa/program/ |
H A D | register_allocate.c | 68 * up front and stored in a 2-dimensional array, so that the cost of 140 * approximate cost of spilling this node. 528 * Returns a node number to be spilled according to the cost/benefit using 539 float cost = g->nodes[n].spill_cost; local 542 if (cost <= 0.0) 547 if (benefit / cost > best_benefit) { 548 best_benefit = benefit / cost; 557 * Only nodes with a spill cost set (cost != 0.0) will be considered 561 ra_set_node_spill_cost(struct ra_graph *g, unsigned int n, float cost) argument [all...] |
/external/libvpx/libvpx/vp9/encoder/ |
H A D | vp9_encodemv.c | 104 int z, c, o, d, e, f, cost = 0; local 107 cost += class_cost[c]; 112 cost += class0_cost[d]; 117 cost += bits_cost[i][((d >> i) & 1)]; 120 cost += class0_fp_cost[d][f]; 122 cost += fp_cost[f]; 126 cost += class0_hp_cost[e]; 128 cost += hp_cost[e]; 131 mvcost[v] = cost + sign_cost[0]; 132 mvcost[-v] = cost [all...] |
H A D | vp9_tokenize.c | 139 // initialize the cost for extra bits for all possible coefficient value. 141 int cost = 0; local 149 cost += treed_cost(p->tree, p->prob, extra >> 1, length); 151 cost += vp9_cost_bit(vp9_prob_half, extra & 1); /* sign */ 152 dct_value_cost[i + DCT_MAX_VALUE] = cost;
|
/external/mesa3d/src/mesa/program/ |
H A D | register_allocate.c | 68 * up front and stored in a 2-dimensional array, so that the cost of 140 * approximate cost of spilling this node. 528 * Returns a node number to be spilled according to the cost/benefit using 539 float cost = g->nodes[n].spill_cost; local 542 if (cost <= 0.0) 547 if (benefit / cost > best_benefit) { 548 best_benefit = benefit / cost; 557 * Only nodes with a spill cost set (cost != 0.0) will be considered 561 ra_set_node_spill_cost(struct ra_graph *g, unsigned int n, float cost) argument [all...] |
/external/chromium_org/chrome/browser/ssl/ |
H A D | ssl_error_classification.cc | 121 int cost = str1[i] == str2[j] ? 0 : 1; local 123 kSecondRow[j] + 1, kFirstRow[j + 1] + 1), kFirstRow[j] + cost);
|
/external/chromium_org/third_party/brotli/src/brotli/enc/ |
H A D | block_splitter.cc | 167 double *cost = new double[vecsize]; local 168 memset(cost, 0, sizeof(cost[0]) * vecsize); 171 // After each iteration of this loop, cost[k] will contain the difference 172 // between the minimum cost of arriving at the current byte position using 173 // entropy code k, and the minimum cost of arriving at the current byte 174 // position. This difference is capped at the block switch cost, and if it 175 // reaches block switch cost, it means that when we trace back from the last 183 cost[k] += insert_cost[insert_cost_ix + k]; 184 if (cost[ [all...] |
/external/chromium_org/third_party/libwebp/dsp/ |
H A D | enc_mips32.c | 21 #include "../enc/cost.h" 518 const uint16_t* t = res->cost[n][ctx0]; 519 int cost; local 536 cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0; 538 res_cost = (int)res->cost; 558 "addu %[cost], %[cost], %[cost_add] \n\t" 568 // cost += VP8LevelCost(t, v); 577 "addu %[cost], %[cost], [all...] |
/external/elfutils/0.153/libdwfl/ |
H A D | dwfl_segment_report_module.c | 596 const GElf_Off cost = (contiguous < file_trimmed_end ? total_filesz local 605 cost, worthwhile, whole, contiguous,
|
/external/iptables/extensions/ |
H A D | libxt_hashlimit.c | 153 static uint32_t cost_to_bytes(uint32_t cost) argument 157 r = cost ? UINT32_MAX / cost : UINT32_MAX;
|
/external/linux-tools-perf/perf-3.12.0/tools/perf/ |
H A D | builtin-report.c | 86 uint64_t cost; local 103 cost = sample->weight; 104 if (!cost) 105 cost = 1; 114 he = __hists__add_mem_entry(&evsel->hists, al, parent, mi, cost, cost); 153 evsel->hists.stats.total_period += cost;
|
/external/pdfium/core/src/fpdfapi/fpdf_page/ |
H A D | fpdf_page_parser_old.cpp | 44 FX_DWORD cost = m_pObjectList->CountObjects() - InitObjCount;
local 45 if (max_cost && cost >= max_cost) {
|
/external/speex/libspeex/ |
H A D | jitter.c | 171 cost = delay + late_factor*[number of frames that would be late if we used that delay] 173 @param late_factor Equivalent cost of a late frame (in timestamp units) 199 /* Compute cost for one lost packet */ 227 spx_int32_t cost; local 235 /* Actual cost function that tells us how bad using this delay would be */ 236 cost = -latest + late_factor*late; 237 /*fprintf(stderr, "cost %d = %d + %f * %d\n", cost, -latest, late_factor, late);*/ 238 if (cost < best_cost) 240 best_cost = cost; [all...] |
/external/srec/srec/crec/ |
H A D | 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 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...] |
/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/dsp/ |
H A D | enc_mips32.c | 21 #include "../enc/cost.h" 518 const uint16_t* t = res->cost[n][ctx0]; 519 int cost; local 536 cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0; 538 res_cost = (int)res->cost; 558 "addu %[cost], %[cost], %[cost_add] \n\t" 568 // cost += VP8LevelCost(t, v); 577 "addu %[cost], %[cost], [all...] |
/external/zopfli/src/zopfli/ |
H A D | squeeze.c | 111 Function that calculates a cost based on a model for the given LZ77 symbol. 129 double cost = 0; local 130 if (lsym <= 279) cost += 7; 131 else cost += 8; 132 cost += 5; /* Every dist symbol has length 5. */ 133 return cost + dbits + lbits; 155 Finds the minimum possible cost this cost model can return for valid length and 160 int bestlength = 0; /* length that has lowest cost in the cost mode 436 double cost = GetBestLengths( local 459 double cost; local [all...] |