| /external/libavc/encoder/ |
| ih264e_globals.h | 48 * compute the RD cost while deciding on the MB modes.
52 * for computing distortion (Bit rate estimation for cost function of H.264/
64 * compute the RD cost while deciding on the MB modes.
75 * @brief unsigned exp. goulumb codelengths to assign cost to a coefficient of
86 * @brief Look up table to assign cost to a coefficient of a residual block
|
| ime.c | 84 * @returns mv pair & corresponding distortion and cost
115 /* least cost */
177 /* compute cost */
268 * @returns mv pair & corresponding distortion and cost
303 /* cost = distortion + u4_lambda_motion * rate */
342 /* compute cost */
375 * This is used for cost computations. Further basing on the algo. chosen, it
377 * cost and returns this information.
385 * @returns mv pair & corresponding distortion and cost
439 * around the full pel motion vector. The vector with least cost is chosen a
[all...] |
| /external/valgrind/callgrind/ |
| events.h | 29 /* Abstractions for 64-bit cost lists (events.h) */
82 /* Operations on costs. A cost pointer of 0 means zero cost.
83 * Functions ending in _lz allocate cost arrays only when needed
128 /* Returns mapping cost as a character string. That string is dynamically
|
| dump.c | 404 /* copy file position and init cost */
421 /* copy file position and init cost */
426 c->cost = CLG_(get_eventset_cost)( CLG_(sets).full );
427 CLG_(init_cost)( CLG_(sets).full, c->cost );
527 void fprint_cost(VgFile *fp, const EventMapping* es, const ULong* cost)
529 HChar *mcost = CLG_(mappingcost_as_string)(es, cost);
536 /* Write the cost of a source line; only that parts of the source
539 * Something is written only if cost != 0; returns True in this case.
546 CLG_(print_cost)(-5, CLG_(sets).full, c->cost);
552 fprint_cost(fp, CLG_(dumpmap), c->cost);
[all...] |
| /frameworks/base/docs/html/distribute/analyze/ |
| improve-roi.jd | 12 convert over time — and that it's being done cost efficiently.
22 the highest value, measuring cost per download is only a partial view.
27 unbiased view of the performance of each network: from cost per download to
36 <th>Cost per Install (from Networks)</th>
74 consideration more than just the cost per install. In the example, all the
|
| /development/perftests/panorama/feature_stab/db_vlvm/ |
| db_rob_image_homography.cpp | 97 stat->cost=db_RobImageHomography_Cost(H,point_count,x_i,xp_i,one_over_scale2);
104 stat->gric=stat->cost+stat->lambda1*stat->model_dimension*((double)stat->nr_points)+stat->lambda2*((double)stat->nr_parameters);
111 /*Compute min_Jtf and upper right of JtJ. Return cost.*/
185 /*Add square-sum to cost*/
192 /*Compute min_Jtf and upper right of JtJ. Return cost*/
219 /*Add square-sum to cost*/
230 double lambda,cost,current_cost; local
244 /*std::cout << "Cost:" << current_cost << " ";*/
251 /*Compute Cost(x+dx)*/
253 cost=db_RobImageHomography_Cost(H_p_dx,point_count,x_i,xp_i,one_over_scale2)
572 double lambda,cost,current_cost; local
[all...] |
| /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
| db_rob_image_homography.cpp | 97 stat->cost=db_RobImageHomography_Cost(H,point_count,x_i,xp_i,one_over_scale2);
104 stat->gric=stat->cost+stat->lambda1*stat->model_dimension*((double)stat->nr_points)+stat->lambda2*((double)stat->nr_parameters);
111 /*Compute min_Jtf and upper right of JtJ. Return cost.*/
185 /*Add square-sum to cost*/
192 /*Compute min_Jtf and upper right of JtJ. Return cost*/
219 /*Add square-sum to cost*/
230 double lambda,cost,current_cost; local
244 /*std::cout << "Cost:" << current_cost << " ";*/
251 /*Compute Cost(x+dx)*/
253 cost=db_RobImageHomography_Cost(H_p_dx,point_count,x_i,xp_i,one_over_scale2)
572 double lambda,cost,current_cost; local
[all...] |
| /external/llvm/lib/Analysis/ |
| CostModel.cpp | 1 //===- CostModel.cpp ------ Cost Model Analysis ---------------------------===//
10 // This file defines the cost model analysis. It provides a very basic cost
12 // to approximate the cost of any IR instruction when lowered to machine
13 // instructions. The cost results are unit-less and the cost number represents
15 // branches are predicted, etc. The cost numbers can be added in order to
33 #define CM_NAME "cost-model"
50 /// Returns the expected cost of the instruction.
51 /// Returns -1 if the cost is unknown
[all...] |
| /external/llvm/lib/Target/ARM/ |
| ARMTargetTransformInfo.cpp | 66 return LT.first * Entry->Cost;
76 // to cast up/down their types automatically at no extra cost.
157 return Entry->Cost;
187 return Entry->Cost;
218 return Entry->Cost;
237 return Entry->Cost;
288 return Entry->Cost;
340 // Reverse shuffle cost one instruction if we are shuffling within a
356 return LT.first * Entry->Cost;
362 // Alt shuffle cost table for ARM. Cost is the number of instruction
[all...] |
| /frameworks/av/services/camera/libcameraservice/utils/ |
| ClientManager.h | 38 * resource, and the corresponding cost, priority, owner ID, and conflicting keys list used
47 ClientDescriptor(const KEY& key, const VALUE& value, int32_t cost,
49 ClientDescriptor(KEY&& key, VALUE&& value, int32_t cost, std::set<KEY>&& conflictingKeys,
65 * Return the cost for this descriptor.
113 ClientDescriptor<KEY, VALUE>::ClientDescriptor(const KEY& key, const VALUE& value, int32_t cost,
115 mValue{value}, mCost{cost}, mConflicting{conflictingKeys}, mPriority{priority},
119 ClientDescriptor<KEY, VALUE>::ClientDescriptor(KEY&& key, VALUE&& value, int32_t cost,
121 mKey{std::forward<KEY>(key)}, mValue{std::forward<VALUE>(value)}, mCost{cost},
206 * the max cost allowed for this ClientManager, descriptors with non-zero cost, equal or lowe
385 int32_t cost = client->getCost(); local
[all...] |
| /external/ceres-solver/include/ceres/ |
| numeric_diff_cost_function.h | 36 // To get an numerically differentiated cost function, you must define
49 // for a series of measurements, where there is an instance of the cost function
52 // The actual cost added to the total problem is e^2, or (k - x'k)^2; however,
55 // To write an numerically-differentiable cost function for the above model, first
80 // cost function with central differences used for computing the
98 // NumericDiffCostFunction also supports cost functions with a
113 // The framework can currently accommodate cost functions of up to 10
117 // The central difference method is considerably more accurate at the cost of
139 // To get a numerically differentiated cost function, define a
145 // differentiation wrapper class is templated on the concrete cost
[all...] |
| problem.h | 70 // problems have a cost function that is a sum of error terms (known
72 // of the parameters. The cost function takes the form
89 // Huber L1 loss. If loss(y) = y, then the cost function is
131 // These flags control whether the Problem object owns the cost
134 // will delete the corresponding cost or loss functions on
136 // only once, since sharing cost/loss/parameterizations is
177 // Add a residual block to the overall cost function. The cost
182 // NULL, in which case the cost of the term is just the squared norm
280 // problem (similar to cost/loss functions in residual block removal). An
[all...] |
| /external/ceres-solver/internal/ceres/ |
| callbacks.cc | 71 summary.cost,
81 output = "iter cost cost_change |gradient| |step| tr_ratio tr_radius ls_iter iter_time total_time\n";
87 summary.cost,
|
| line_search_minimizer.h | 51 : cost(0.0),
59 double cost; member in struct:ceres::internal::LineSearchMinimizer::State
|
| /external/webrtc/webrtc/ |
| common.h | 43 // virtual float cost(int x) const { return x; }
48 // config.Get<Algo1_CostFunction>().cost(value);
52 // virtual float cost(int x) const { return x*x; }
|
| /external/zopfli/src/zopfli/ |
| tree.c | 81 /* When the count of the symbol is 0, but its cost is requested anyway, it
82 means the symbol will appear at least once anyway, so give it the cost as if
89 it to zero. These floating point imprecisions do not affect the cost model
|
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_tokenize.h | 61 const int16_t *cost; member in struct:__anon17266
85 return vp9_extra_bits[token].cost[extrabits];
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopUnrollPass.cpp | 43 cl::desc("The baseline cost threshold for loop unrolling"));
46 "unroll-percent-dynamic-cost-saved-threshold", cl::init(20), cl::Hidden,
47 cl::desc("The percentage of estimated dynamic cost which must be saved by "
51 "unroll-dynamic-cost-savings-discount", cl::init(2000), cl::Hidden,
52 cl::desc("This is the amount discounted from the total unroll cost when "
53 "the unrolled form has a high dynamic cost savings (triggered by "
54 "the '-unroll-perecent-dynamic-cost-saved-threshold' flag)."));
499 /// \brief The estimated cost after unrolling.
502 /// \brief The estimated dynamic cost of executing the instructions in the
512 /// estimates this optimization. It computes cost of unrolled loo
[all...] |
| ConstantHoisting.cpp | 15 // cost. If the constant can be folded into the instruction (the cost is
16 // TCC_Free) or the cost is just a simple operation (TCC_BASIC), then we don't
20 // If the cost is more than TCC_BASIC, then the integer constant can't be folded
81 /// \brief Add the user to the use list and update the cost.
82 void addUser(Instruction *Inst, unsigned Idx, unsigned Cost) {
83 CumulativeCost += Cost;
279 unsigned Cost;
280 // Ask the target about the cost of materializing the constant for the given
283 Cost = TTI->getIntImmCost(IntrInst->getIntrinsicID(), Idx
[all...] |
| /external/llvm/test/Transforms/LoopVectorize/X86/ |
| uint64_to_fp64-cost-model.ll | 8 ; CHECK: cost of 20 for VF 2 For instruction: %conv = uitofp i64 %tmp to double
9 ; CHECK: cost of 40 for VF 4 For instruction: %conv = uitofp i64 %tmp to double
|
| /external/webrtc/webrtc/modules/audio_coding/codecs/tools/ |
| audio_codec_speed_test.h | 38 // 4. return the cost of time (in millisecond) spent on actual encoding.
46 // 3. return the cost of time (in millisecond) spent on actual decoding.
|
| /frameworks/base/tools/layoutlib/bridge/src/android/text/ |
| Primitive.java | 53 * Aesthetic cost indicating how desirable breaking at this point will be. A penalty of
65 * Possible breakpoints within a word. Think of this as a high cost {@link #PENALTY}.
|
| /external/mesa3d/src/mesa/program/ |
| 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)
[all...] |
| /bionic/libc/kernel/uapi/linux/netfilter/ |
| xt_limit.h | 31 __u32 credit_cap, cost; member in struct:xt_rateinfo
|
| /bionic/libc/kernel/uapi/linux/netfilter_bridge/ |
| ebt_limit.h | 31 __u32 credit_cap, cost; member in struct:ebt_limit_info
|
