| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/distutils/command/ |
| bdist_msi.py | 623 # Disk cost
624 cost = PyDialog(db, "DiskCostDlg", x, y, w, h, modal, title,
626 cost.text("Title", 15, 6, 200, 15, 0x30003,
628 cost.text("Description", 20, 20, 280, 20, 0x30003,
630 cost.text("Text", 20, 53, 330, 60, 3,
636 cost.control("VolumeList", "VolumeCostList", 20, 100, 330, 150, 393223,
638 cost.xbutton("OK", "Ok", None, 0.5).event("EndDialog", "Return")
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/distutils/command/ |
| bdist_msi.py | 623 # Disk cost
624 cost = PyDialog(db, "DiskCostDlg", x, y, w, h, modal, title,
626 cost.text("Title", 15, 6, 200, 15, 0x30003,
628 cost.text("Description", 20, 20, 280, 20, 0x30003,
630 cost.text("Text", 20, 53, 330, 60, 3,
636 cost.control("VolumeList", "VolumeCostList", 20, 100, 330, 150, 393223,
638 cost.xbutton("OK", "Ok", None, 0.5).event("EndDialog", "Return")
[all...] |
| /external/ceres-solver/internal/ceres/ |
| solver_impl.cc | 89 summary->final_cost = min(iteration_summary.cost, summary->final_cost);
108 summary.cost,
144 summary.cost,
185 summary.cost,
1018 double cost = 0.0; local
[all...] |
| /external/srec/srec/crec/ |
| astar.c | 320 best_cost_for_node = word_token_array[ best_extend_token].cost;
324 netcost = wtoken->cost - best_cost_for_node;
330 netcost, wtoken->cost, best_cost_for_node, parp->costsofar, max_cost);
505 parp->costsofar += wtoken->cost;
506 /* BKWD: rec->word_token_array[ wtoken->backtrace].cost + acc[] */
507 /* FRWD: wtoken->cost + acc[] - rec->word_token_array[ wtoken->backtrace].cost + acc[] */
766 /* figure out the cost to beat ! */
834 printf("&&Extended, cost too high (>%d):\n", max_cost);
[all...] |
| /external/chromium_org/third_party/opus/src/src/ |
| opus_encoder.c | 602 float cost[MAX_DYNAMIC_FRAMESIZE][16]; local
621 cost[0][i] = 1e10;
625 cost[0][1<<i] = (frame_cost + rate*(1<<i))*(1+factor*transient_boost(E, E_1, i, N+1));
635 cost[i][j] = cost[i-1][j-1];
646 min_cost = cost[i-1][1];
649 float tmp = cost[i-1][(1<<(k+1))-1];
657 cost[i][1<<j] = min_cost;
658 /* If part of the frame is outside the analysis window, only count part of the cost */
660 cost[i][1<<j] += curr_cost*(float)(N-i)/(1<<j)
[all...] |
| /external/valgrind/main/callgrind/ |
| sim.c | 51 * - line_loaded : pointer to cost center of instruction
110 * - ULong* CLG_(cost_base) (start of cost array for BB)
[all...] |
| jumps.c | 34 /*--- Jump Cost Center (JCC) operations, including Calls ---*/
157 jcc->cost = 0;
|
| /frameworks/av/media/libstagefright/codecs/avc/enc/src/ |
| findhalfpel.cpp | 84 // find cost for the current full-pel position
610 int cost; local
614 cost = AVCSAD_Macroblock_C(cand, cur, dmin, NULL);
616 return cost;
|
| /external/llvm/utils/PerfectShuffle/ |
| PerfectShuffle.cpp | 88 unsigned Cost; // Number of instrs used to generate this value.
92 ShuffleVal() : Cost(1000000) {}
108 unsigned Cost;
111 unsigned cost = 1)
112 : ShuffleMask(shufflemask), OpNum(opnum), Name(name), Cost(cost) {
125 unsigned getCost() const { return Cost; }
153 assert(0 && "bad zero cost operation");
164 if (ShufTab[ShufTab[ThisOp].Arg0].Cost == 0) {
178 if (ShufTab[ShufTab[ThisOp].Arg1].Cost == 0)
[all...] |
| /external/valgrind/unittest/ |
| bigtest.cc | 162 void SetParameterStat(StatType stat_type, double * param, double cost) {
170 cost_m->At(type_id, param_id) = cost;
175 printf("Cost matrix:\n%s\n", cost_m->ToString().c_str());
|
| /external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/ |
| statetracker.py | 346 cost = 1
348 cost = 0
352 substitution = distance[i][j] + cost
373 if cost:
|
| /external/chromium_org/third_party/closure_linter/closure_linter/ |
| statetracker.py | 346 cost = 1
348 cost = 0
352 substitution = distance[i][j] + cost
373 if cost:
|
| /external/elfutils/libdwfl/ |
| libdwflP.h | 333 GElf_Off cost, GElf_Off worthwhile,
|
| dwfl_segment_report_module.c | 570 const GElf_Off cost = (contiguous < file_trimmed_end ? total_filesz local
579 cost, worthwhile, whole, contiguous,
|
| /external/speex/libspeex/ |
| 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/chromium_org/third_party/libwebp/ |
| libwebp_enc.target.darwin-arm.mk | 29 third_party/libwebp/enc/cost.c \
|
| libwebp_enc.target.darwin-mips.mk | 29 third_party/libwebp/enc/cost.c \
|
| libwebp_enc.target.darwin-x86.mk | 29 third_party/libwebp/enc/cost.c \
|
| libwebp_enc.target.linux-arm.mk | 29 third_party/libwebp/enc/cost.c \
|
| libwebp_enc.target.linux-mips.mk | 29 third_party/libwebp/enc/cost.c \
|
| libwebp_enc.target.linux-x86.mk | 29 third_party/libwebp/enc/cost.c \
|
| /external/chromium_org/third_party/mesa/src/docs/ |
| MESA_multithread_makecurrent.spec | 137 minimal performance cost, so requiring that the GL do general
|
| /external/mesa3d/docs/ |
| MESA_multithread_makecurrent.spec | 137 minimal performance cost, so requiring that the GL do general
|
| /external/libvpx/libvpx/vp8/encoder/ |
| 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 */
[all...] |
| /external/chromium_org/third_party/sqlite/src/src/ |
| where.c | 196 ** cost of pursuing that strategy.
200 double rCost; /* Overall cost of pursuing this search strategy */
2756 double cost; \/* Cost of using pProbe *\/ local
[all...] |
