| /external/chromium_org/third_party/tcmalloc/chromium/src/tests/ |
| addressmap_unittest.cc | 42 DEFINE_int32(iters, 20, "Number of test iterations");
|
| pagemap_unittest.cc | 66 RAW_LOG(INFO, "Running test with %d iterations...\n", limit);
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/base/ |
| spinlock_internal.cc | 95 // Mean is exponential in loop for first 32 iterations, then 8ms.
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/tests/ |
| addressmap_unittest.cc | 42 DEFINE_int32(iters, 20, "Number of test iterations");
|
| pagemap_unittest.cc | 66 RAW_LOG(INFO, "Running test with %d iterations...\n", limit);
|
| /external/chromium_org/tools/perf/page_sets/tough_canvas_cases/canvas2d_balls_common/ |
| bouncing_balls.js | 155 // The number of iterations may not be finite within a timestep
|
| /external/chromium_org/v8/test/mjsunit/compiler/ |
| math-floor-global.js | 160 // The optimized function will deopt. Run it with enough iterations to try
|
| math-floor-local.js | 160 // The optimized function will deopt. Run it with enough iterations to try
|
| /external/chromium_org/v8/test/mjsunit/ |
| for-in.js | 89 // Test outside a loop and in a loop for multiple iterations.
|
| math-round.js | 60 // The optimized function will deopt. Run it with enough iterations to try
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| RealSchur.h | 156 * iterations with implicit double shift. The cost of computing the Schur
157 * decomposition depends on the number of iterations; as a rough guide, it
176 /** \brief Maximum number of iterations.
178 * Maximum number of iterations allowed for an eigenvalue to converge.
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| Scaling.h | 182 int m_maxits; // Maximum number of iterations allowed
|
| /external/guava/guava/src/com/google/common/collect/ |
| StandardRowSortedTable.java | 33 * iterations across the columns keys for a single row key may or may not be
|
| /external/icu4c/test/intltest/ |
| numfmtst.h | 258 void checkRounding(DecimalFormat* df, double base, int iterations, double increment);
|
| /external/jmonkeyengine/engine/src/blender/com/jme3/scene/plugins/blender/constraints/ |
| ConstraintInverseKinematics.java | 83 // int maxIterations = ((Number) data.getFieldValue("iterations")).intValue();
|
| /external/libvpx/libvpx/vp9/common/arm/neon/ |
| vp9_loopfilter_neon.asm | 19 ; Currently vp9 only works on iterations 8 at a time. The vp8 loop filter
20 ; works on 16 iterations at a time.
82 ; Currently vp9 only works on iterations 8 at a time. The vp8 loop filter
83 ; works on 16 iterations at a time.
|
| /external/llvm/lib/CodeGen/ |
| PrologEpilogInserter.h | 135 // Initialize DFA sets, called before iterations.
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopInstSimplify.cpp | 105 // simplify all instructions. On later iterations ToSimplify is not
|
| /external/llvm/lib/Transforms/Utils/ |
| SimplifyInstructions.cpp | 60 // simplify all instructions. On later iterations ToSimplify is not
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| 2008-08-04-LongAddRec.ll | 2 ; RUN: -scalar-evolution-max-iterations=0 | FileCheck %s
|
| SolveQuadraticEquation.ll | 1 ; RUN: opt < %s -analyze -scalar-evolution -scalar-evolution-max-iterations=0 | FileCheck %s
|
| trip-count10.ll | 78 ; Trip counts for non-polynomial iterations. It's theoretically possible
|
| /external/mesa3d/src/gallium/state_trackers/d3d1x/docs/ |
| coding_style.txt | 67 Try to use typedefs for STL maps on which you need to declare iterations, as well as function pointers or other "weird" C types.
|
| /external/netperf/ |
| netcpu_procstat.c | 112 calibrate_idle_rate (int iterations, int interval)
|
| /external/openssl/crypto/bn/ |
| bn_err.c | 133 {ERR_REASON(BN_R_TOO_MANY_ITERATIONS) ,"too many iterations"},
|
