| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/profile/impl/ |
| profiler_container_size.h | 125 // Estimate the cost of resize/rehash.
199 // Call at resize to set resize/cost information.
|
| /system/core/adb/ |
| adb_io.cpp | 37 // The cost of sending two strings outweighs the cost of formatting.
|
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_rdopt.c | 347 * decide whether to include cost of a trailing EOB node or not (i.e. we
374 int c, cost; local
387 cost = token_costs[0][0][pt][EOB_TOKEN];
397 cost = (*token_costs)[0][pt][prev_t] +
411 cost += (*token_costs)[!prev_t][!prev_t][t] +
415 cost += (*token_costs)[!prev_t][pt][t] +
429 cost += (*token_costs)[0][!prev_t][EOB_TOKEN];
432 cost += (*token_costs)[0][pt][EOB_TOKEN];
440 return cost;
1012 int cost = 0; local
[all...] |
| /external/ceres-solver/docs/source/ |
| faqs.rst | 57 implementation of the cost function.
60 differentiation of the entire cost function, but it is generally
61 the case that it is possible to decompose the cost function into
172 iter cost cost_change |gradient| |step| tr_ratio tr_radius ls_iter iter_time total_time
199 Cost:
|
| /external/eigen/Eigen/src/Core/ |
| Redux.h | 53 Cost = ( Derived::SizeAtCompileTime == Dynamic
55 || (Derived::SizeAtCompileTime!=1 && functor_traits<Func>::Cost == Dynamic)
58 + (Derived::SizeAtCompileTime-1) * functor_traits<Func>::Cost,
64 Unrolling = Cost != Dynamic && Cost <= UnrollingLimit
|
| /external/iproute2/man/man8/ |
| bridge.8 | 31 .B cost
32 .IR COST " ] [ "
212 .BI cost " COST "
213 the STP path cost of the specified port.
|
| /external/libvpx/libvpx/vp8/encoder/ |
| tokenize.c | 76 // initialize the cost for extra bits for all possible coefficient value.
78 int cost = 0;
87 cost += vp8_treed_cost(p->tree, p->prob, extra >> 1, Length);
89 cost += vp8_cost_bit(vp8_prob_half, extra & 1); // sign
90 dct_value_cost[i + DCT_MAX_VALUE] = cost;
|
| /external/llvm/lib/Target/AArch64/ |
| AArch64PBQPRegAlloc.cpp | 217 // Get the maximum cost (excluding unallocatable reg) for same parity
229 // Ensure all registers with a different parity have a higher cost
289 // Enforce that cost is higher with all other Chains of the same parity
294 // Get the maximum cost (excluding unallocatable reg) for all other
306 // Ensure all registers with same parity have a higher cost
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/encoder/ |
| tokenize.c | 76 // initialize the cost for extra bits for all possible coefficient value.
78 int cost = 0;
87 cost += vp8_treed_cost(p->tree, p->prob, extra >> 1, Length);
89 cost += vp8_cost_bit(vp8_prob_half, extra & 1); // sign
90 dct_value_cost[i + DCT_MAX_VALUE] = cost;
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/general/ |
| LevenbergMarquardtOptimizer.java | 156 * <li>{@link #setCostRelativeTolerance(double) cost relative tolerance}: 1.0e-10</li>
164 * will be used instead of the {@link #setCostRelativeTolerance cost relative tolerance}
169 // set up the superclass with a default max cost evaluations setting
316 if (cost != 0) {
325 maxCosine = FastMath.max(maxCosine, FastMath.abs(sum) / (s * cost));
349 double previousCost = cost;
380 if (0.1 * cost < previousCost) {
381 double r = cost / previousCost;
412 if ((0.1 * cost >= previousCost) || (tmp < 0.1)) {
443 cost = previousCost
[all...] |
| /external/opencv3/3rdparty/libwebp/enc/ |
| 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...] |
| /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/llvm/lib/CodeGen/ |
| MachineLICM.cpp | 186 bool CanCauseHighRegPressure(const DenseMap<unsigned, int> &Cost,
736 // FIXME: Come up with a proper cost model that estimates whether sinking
788 auto Cost = calcRegisterCost(MI, /*ConsiderSeen=*/true, ConsiderUnseenAsDef);
789 for (const auto &RPIdAndCost : Cost) {
807 DenseMap<unsigned, int> Cost;
809 return Cost;
838 if (Cost.find(*PS) == Cost.end())
839 Cost[*PS] = RCCost;
841 Cost[*PS] += RCCost
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopStrengthReduce.cpp | 743 /// Check if expanding this expression is likely to incur significant cost. This
809 // Fow now, consider any other type of expression (div/mul/min/max) high cost.
852 /// accurate cost model.
855 // Get the cost of the scaling factor used in F for LU.
862 class Cost {
874 Cost()
878 bool operator<(const Cost &Other) const;
893 assert(isValid() && "invalid cost");
925 void Cost::RateRegister(const SCEV *Reg,
2555 int cost = 1; local
[all...] |
| /packages/apps/Launcher3/src/com/android/launcher3/model/ |
| GridSizeMigrationTask.java | 272 // removeWt represents the cost function for loss of items during migration, and moveWt
273 // represents the cost function for repositioning the items. moveWt is only considered if
276 // cost.
431 // If set to true, item movement are not considered in move cost, leading to a more
461 * @param moveCost total move cost upto this point
523 // 1 extra move cost
533 // 1 extra move cost
545 // 2 extra move cost
604 // 3) ignoreMove false otherwise, move cost is ignored and the weight will
[all...] |
| /external/eigen/Eigen/src/Core/util/ |
| Meta.h | 197 // Cost = NumTraits<T>::MulCost,
206 // Cost = 2*NumTraits<T>::MulCost,
215 // Cost = 2*NumTraits<T>::MulCost,
|
| /external/netperf/doc/examples/ |
| packet_byte_script | 4 # raw material necessary to arrive at estimates for the cost of
5 # sending and receiving a TCP segment, the cost of each additional byte
6 # and the cost of each incremental segment.
|
| /external/skia/src/core/ |
| SkAdvancedTypefaceMetrics.cpp | 138 // The cost of stopping and starting the range is 7 characers
140 // The cost of stopping and starting the range plus a run is 22
144 // When not currently in a range the cost of a run over a range is 16
|
| /external/valgrind/include/ |
| pub_tool_xarray.h | 40 // This gives amortised O(1) insertion cost, and, following sorting,
41 // the usual O(log N) binary search cost. Arbitrary element sizes
148 that is NULL, in which case the parent's cost-center is used.
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| target.def | 529 /* Given the current cost, COST, of an insn, INSN, calculate and
530 return a new cost based on its relationship to DEP_INSN through
535 int, (rtx insn, rtx link, rtx dep_insn, int cost), NULL)
552 can emit this cycle. Default is they all cost the same. */
769 second argument is the cost of the dependence as estimated by
776 bool, (struct _dep *_dep, int cost, int distance), NULL)
780 "Given the current cost, @var{cost}, of an insn, @var{insn}, calculate and\
781 return a new cost based on its relationship to @var{dep_insn} through the
[all...] |
| /system/keymaster/include/keymaster/ |
| keymaster_tags.h | 46 * run-time cost in and of themselves. The one way in which they can create code bloat is when
104 // error (no match for template specialization StaticAssert<false>), with no run-time cost.
120 // error (no match for template specialization StaticAssert<false>), with no run-time cost.
|
| /external/valgrind/callgrind/ |
| sim.c | 51 * - line_loaded : pointer to cost center of instruction
110 * - ULong* CLG_(cost_base) (start of cost array for BB)
[all...] |
| /bionic/libc/bionic/ |
| close.cpp | 49 // We don't restore errno because that would incur a cost (the TLS read) for every caller.
|
| /developers/build/prebuilts/gradle/MediaBrowserService/Application/src/main/java/com/example/android/mediabrowserservice/utils/ |
| LogHelper.java | 82 // handle this common case without the extra cost of creating a stringbuffer:
|
| /developers/samples/android/media/MediaBrowserService/Application/src/main/java/com/example/android/mediabrowserservice/utils/ |
| LogHelper.java | 82 // handle this common case without the extra cost of creating a stringbuffer:
|
