| /prebuilts/go/darwin-x86/doc/articles/ |
| race_detector.html | 129 cost of increased memory usage.
387 The cost of race detection varies by program, but for a typical program, memory
|
| /prebuilts/go/linux-x86/doc/articles/ |
| race_detector.html | 129 cost of increased memory usage.
387 The cost of race detection varies by program, but for a typical program, memory
|
| /external/valgrind/callgrind/ |
| main.c | 121 CLG_(current_state).cost[ fullOffset(EG_BUS) ]++;
158 CLG_(current_state).cost[ fullOffset_Bc ]++;
161 CLG_(current_state).cost[ fullOffset_Bc+1 ]++;
188 CLG_(current_state).cost[ fullOffset_Bi ]++;
191 CLG_(current_state).cost[ fullOffset_Bi+1 ]++;
774 resulting cost offset depend on events (Ir/Dr/Dw/Dm) in guest
776 queue (when Dm events were determined), cost offsets are determined at
804 // return total number of cost values needed for this BB
[all...] |
| /external/webp/src/enc/ |
| quant.c | 19 #include "./cost.h"
549 const uint16_t* costs; // shortcut to cost tables
588 score_t cost; local
607 cost = VP8BitCost(0, last_proba);
608 best_score = RDScoreTrellis(lambda, cost, 0);
653 // Compute extra rate cost if last coeff's position is < 15
674 const score_t cost = VP8LevelCost(ss_prev[p].costs, level); local
677 base_score + ss_prev[p].score + RDScoreTrellis(lambda, cost, 0);
853 // RD-opt decision. Reconstruct each modes, evalue distortion and bit-cost.
854 // Pick the mode is lower RD-cost = Rate + lambda * Distortion
[all...] |
| /art/runtime/gc/accounting/ |
| mod_union_table.h | 59 // mod-union table, as updating the mod-union table may have an associated cost, such as
|
| /bionic/libc/arch-arm64/generic/bionic/ |
| strlen.S | 67 slightly higher start-up cost, but we should win quite quickly,
|
| strnlen.S | 85 slightly higher start-up cost, but we should win quite quickly,
|
| /development/perftests/panorama/feature_stab/src/dbreg/ |
| dbreg.h | 147 * \param chunk_size size of cost chunks
373 // cost arrays:
378 // cost histogram:
396 // Number of cost histogram bins:
|
| /device/google/contexthub/ |
| CodingStandard.txt | 23 names - makes it easy to appreciate the cost (struct GpioHandle, union PwmDeviceData)
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/nonstiff/ |
| DormandPrince54Integrator.java | 34 * the cost is really 6 functions evaluations per step.</p>
|
| /external/bison/ |
| GNUmakefile | 65 # string alters config.h, the cost of having 'make all' always have an
|
| /external/ceres-solver/docs/source/ |
| features.rst | 48 computational cost in all of these methods is the solution of a
|
| /external/ceres-solver/examples/ |
| nist.cc | 210 // Certfied cost
462 printf("start: %d status: %s lre: %4.1f initial cost: %e final cost:%e "
463 "certified cost: %e total iterations: %d\n",
|
| /external/ceres-solver/google3/ |
| jet_traits.h | 4 // quaternions inside Ceres cost functions which are automatically
|
| /external/ceres-solver/internal/ceres/ |
| block_jacobian_writer.h | 35 // jacobian. When the cost function is evaluated, the jacobian blocks get placed
|
| c_api.cc | 64 // This cost function wraps a C-level function pointer from the user, to bridge
|
| minimizer.h | 167 // Object responsible for evaluating the cost, residuals and
|
| solver_impl.h | 88 // are evaluated and the sum of their cost is returned in fixed_cost.
|
| /external/compiler-rt/lib/ubsan/ |
| ubsan_value.cc | 70 /// them to be passed in floating-point registers, so this has little cost).
|
| /external/curl/docs/ |
| HTTP2.md | 75 multiplex on. It favours keeping the number of connections low to the cost of
|
| /external/deqp/doc/testspecs/GLES2/ |
| performance.txt | 95 cost of that is one read from the framebuffer and per-channel saturating
|
| /external/deqp/doc/testspecs/GLES3/ |
| performance.txt | 95 cost of that is one read from the framebuffer and per-channel saturating
|
| /external/dng_sdk/source/ |
| dng_pthread.h | 156 // and there is a slight performance cost. Do not call this routine while holding a mutex, etc.
|
| /external/eigen/Eigen/src/Core/ |
| CwiseUnaryView.h | 41 CoeffReadCost = traits<_MatrixTypeNested>::CoeffReadCost + functor_traits<ViewOp>::Cost,
|
| DenseCoeffsBase.h | 85 * Use this for limiting the performance cost of debugging code when doing
123 * Use this for limiting the performance cost of debugging code when doing
305 * Use this for limiting the performance cost of debugging code when doing
347 * Use this for limiting the performance cost of debugging code when doing
|
