| /external/llvm/lib/CodeGen/ |
| RegAllocGreedy.cpp | 99 CSRFirstTimeCost("regalloc-csr-first-time-cost",
100 cl::desc("Cost for first time use of callee-saved register."),
229 /// Cost of evicting interference.
305 /// Callee-save register cost, calculated once per machine function.
370 /// Calculate cost of region splitting.
643 unsigned Cost = TRI->getCostPerUse(PhysReg);
645 // Most registers have 0 additional cost.
646 if (!Cost)
649 DEBUG(dbgs() << PrintReg(PhysReg, TRI) << " is available at cost " << Cost
[all...] |
| MachineBlockPlacement.cpp | 91 PreciseRotationCost("precise-rotation-cost",
92 cl::desc("Model the cost of loop rotation more "
97 "misfetch-cost",
98 cl::desc("Cost that models the probablistic risk of an instruction "
99 "misfetch due to a jump comparing to falling through, whose cost "
103 static cl::opt<unsigned> JumpInstCost("jump-inst-cost",
104 cl::desc("Cost of jump instructions."),
519 // FIXME: If this shows up on profiles, it could be folded (at the cost of
[all...] |
| /external/ceres-solver/include/ceres/ |
| dynamic_autodiff_cost_function.h | 33 // autodiff_cost_function.h by supporting autodiff on cost functions
39 // autodiff; the expected interface for the cost functors is:
49 // also specify the sizes after creating the dynamic autodiff cost
58 // Under the hood, the implementation evaluates the cost function
107 // is a large body of code that assumes inside a cost functor it is
|
| iteration_callback.h | 51 cost(0.0),
96 double cost; member in struct:ceres::IterationSummary
113 // cost and the change in the cost of the linearized approximation.
195 // summary.cost,
|
| /external/toybox/toys/pending/ |
| brctl.c | 28 setpathcost BRIDGE PORT COST Set path cost
280 int cost; local
282 cost = atolx_range(argv[2], 0, INT_MAX);
283 set_cost_prio(argv[0], argv[1], BRCTL_SET_PATH_COST, cost);
|
| /external/ceres-solver/internal/ceres/ |
| 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, NULL, y, z)
1094 double cost; local
[all...] |
| compressed_row_jacobian_writer.h | 69 // type). Just because a cost function uses parameter blocks 1
88 // assumed by the cost functions, use scratch space to store the
|
| conditioned_cost_function.cc | 31 // This file contains the implementation of the conditioned cost function.
44 // This cost function has the same dimensions (parameters, residuals) as
|
| /external/webp/src/dsp/ |
| lossless_enc_mips32.c | 96 // int64_t cost = 0;
101 // cost += i * *pop;
102 // cost += i * *(pop + 1);
105 // return (double)cost;
137 // int64_t cost = 0;
145 // cost += i * xy0;
146 // cost += i * xy1;
150 // return (double)cost;
235 // Gather info for the Huffman cost.
|
| /external/valgrind/callgrind/ |
| global.h | 211 /* JmpCall cost center
222 * Cost <sum> holds event counts for already returned executions.
240 FullCost cost; /* simulator + user counters */ member in struct:_jCC
271 * BB is to be retranslated but cost info is already available.
279 * As cost of a BB has to be distinguished depending on the context,
280 * multiple cost centers for one BB (struct BBCC) exist and the according
337 * Cost info for a side exits from a BB
347 * Basic Block Cost Center
357 * The cost centres for the instructions of a basic block are
362 BB* bb; /* BB for this cost center *
381 ULong* cost; \/* start of 64bit costs for this BBCC *\/ member in struct:_BBCC
489 FullCost cost; member in struct:_exec_state
606 SimCost cost; member in struct:_AddrCost
[all...] |
| /external/webp/src/enc/ |
| backward_references.c | 564 int is_last, int use_color_cache, double prev_cost, float* const cost,
580 if (cost[idx] > cost_val) {
581 cost[idx] = (float)cost_val;
595 float* const cost = local
596 (float*)WebPSafeMalloc(pix_count, sizeof(*cost));
609 if (cost == NULL || cost_model == NULL) goto Error;
621 for (i = 0; i < pix_count; ++i) cost[i] = 1e38f;
629 0, use_color_cache, 0.0, cost, dist_array);
633 double prev_cost = cost[i - 1];
644 if (cost[i + k] > cost_val)
[all...] |
| /external/ceres-solver/docs/source/ |
| modeling.rst | 121 this is the case when computing cost only. If ``jacobians[i]`` is
189 To get an auto differentiated cost function, you must define a
191 cost function in terms of the template parameter ``T``. The
206 measurements, where there is an instance of the cost function for
209 The actual cost added to the total problem is :math:`e^2`, or
213 To write an auto-differentiable cost function for the above model,
239 Then given this class definition, the auto differentiated cost
261 :class:`AutoDiffCostFunction` also supports cost functions with a
277 The framework can currently accommodate cost functions of up to 10
316 slightly. The expected interface for the cost functors is
[all...] |
| /external/opencv3/3rdparty/libwebp/enc/ |
| quant.c | 18 #include "./cost.h"
464 score_t cost; // bit cost member in struct:__anon21058
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 >= MAX_COST) { // dead node
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/ |
| DifferentiableMultivariateVectorialOptimizer.java | 96 * The cost function to be minimized is
101 * @param weights weight for the least squares cost computation
|
| /external/ceres-solver/examples/ |
| helloworld.cc | 45 // A templated cost functor that implements the residual r = 10 -
67 // Set up the only cost function (also known as residual). This uses
|
| helloworld_numeric_diff.cc | 44 // A cost functor that implements the residual r = 10 - x.
63 // Set up the only cost function (also known as residual). This uses
|
| /external/chromium-trace/catapult/third_party/gsutil/gslib/addlhelp/ |
| apis.py | 40 <B>PERFORMANCE AND COST DIFFERENCES BETWEEN APIS</B>
50 API when possible uses fewer operations (and thus has a lower cost).
|
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_rd.h | 119 // Reset the rate distortion cost values to maximum (invalid) value.
121 // Initialize the rate distortion cost values to zero.
|
| /external/llvm/docs/HistoricalNotes/ |
| 2001-06-01-GCCOptimizations2.txt | 36 > feasible and should be fun. (Again, link time cost is the issue.)
38 Assuming linktime cost wasn't an issue, the question is:
|
| /external/llvm/include/llvm/Transforms/IPO/ |
| InlinerPass.h | 63 /// determine the cost of inlining the specified call site. If the cost
|
| /external/llvm/test/Transforms/LoopUnroll/ |
| full-unroll-heuristics-2.ll | 1 ; RUN: opt < %s -S -loop-unroll -unroll-max-iteration-count-to-analyze=1000 -unroll-threshold=10 -unroll-percent-dynamic-cost-saved-threshold=50 -unroll-dynamic-cost-savings-discount=90 | FileCheck %s
|
| /external/llvm/test/Transforms/LoopVectorize/ |
| unroll_novec.ll | 1 ; RUN: opt < %s -loop-vectorize -force-vector-width=1 -force-target-num-scalar-regs=16 -force-target-max-scalar-interleave=8 -force-target-instruction-cost=1 -small-loop-cost=40 -dce -instcombine -S | FileCheck %s
|
| /external/opencv3/modules/imgproc/test/ |
| test_emd.cpp | 68 static float cost[] = local
79 Mat _cost(_w1.rows, _w2.rows, CV_32F, cost);
|
| /external/slf4j/jul-to-slf4j/src/test/java/org/slf4j/bridge/ |
| SLF4JBridgeHandlerPerfTest.java | 105 System.out.println("Average cost per call (JUL->SLF4J->log4j): " + julAvg + " nanos");
109 System.out.println("Average cost per call (SLF4J->log4j): " + slf4jAvg + " nanos");
|
| /external/valgrind/callgrind/docs/ |
| cl-manual.xml | 62 occurred in. This cost attribution mechanism is
71 costs, that is, where the cost of each function includes the costs of
74 <para>As an example, the inclusive cost of
76 of the total program cost. Because of costs arising before
79 objects, the inclusive cost of <function>main</function>
80 is not exactly 100 percent of the total program cost.</para>
85 program's costs occur. Caller/callee cost attribution is also useful
134 of functions is ordered by exclusive cost of functions, which also
142 exclusive cost of functions as sorting order, use and show
143 inclusive cost.</para
[all...] |
