| /external/chromium/chrome/common/extensions/docs/examples/extensions/benchmark/ |
| options.html | 563 obj.stderr = obj.stddev / Math.sqrt(obj.iterations);
622 obj.iterations != obj2.iterations) {
728 document.getElementById("iterations").value = extension.iterations;
756 var iterations = parseInt(document.getElementById("iterations").value);
760 if (iterations > 0) {
761 extension.iterations = iterations;
[all...] |
| background.html | 32 window.iterations = 10;
160 runCount_ = window.iterations;
178 current_.iterations = 0;
321 if (current_.iterations > 0 &&
375 current_.iterations++;
|
| /external/stlport/test/eh/ |
| main.cpp | 130 cerr<<"Usage : "<<name<<" [-n <iterations>] [-s <size>] [-l] [-e] [-q]/[-v] [-t] [test_name...]\n";
131 cerr<<"\t[-n <iterations>] : number of test iterations, default==100;"<<endl;
196 // leak_test [-iterations] [-test] ...
215 cerr <<" Doing "<<niters<<" iterations\n";
|
| /external/ceres-solver/include/ceres/ |
| solver.h | 154 // ones corresponding to the minimum cost over all iterations.
158 // Maximum number of iterations for the minimizer to run for.
390 // Minimum number of iterations for which the linear solver should
394 // Maximum number of iterations for which the linear solver should
405 // it to terminate the iterations when
432 // List of iterations at which the optimizer should dump the
585 vector<IterationSummary> iterations; member in struct:ceres::Solver::Summary
|
| /external/valgrind/main/memcheck/tests/ |
| vcpu_fbench.c | 100 normalised as if run for 1000 iterations.
306 #ifndef ITERATIONS
307 #define ITERATIONS /*1000*/ /*500000*/ 100
309 int niter = ITERATIONS; /* Iteration counter */
723 /* Process the number of iterations argument, if one is supplied. */
731 printf("where <itercount> is the number of iterations\n");
752 printf("and performance benchmark. %d iterations will be made.\n\n",
|
| /external/valgrind/main/perf/ |
| fbench.c | 96 normalised as if run for 1000 iterations.
302 #ifndef ITERATIONS
303 #define ITERATIONS /*1000*/ /*500000*/ 80000
305 int niter = ITERATIONS; /* Iteration counter */
719 /* Process the number of iterations argument, if one is supplied. */
727 printf("where <itercount> is the number of iterations\n");
748 printf("and performance benchmark. %d iterations will be made.\n\n",
|
| /external/valgrind/unittest/ |
| bigtest.cc | 177 int iterations = 0; local
178 Vector params = EstimateParameters(*cost_m, *stats, 0.0005, &iterations);
186 printf("Parameters (estimated in %d steps) :\n", iterations);
575 const int ITERATIONS = 16;
578 for (int i = 1; i <= ITERATIONS; i++) {
591 const int ITERATIONS = 16;
594 for (int i = 1; i <= ITERATIONS; i++) {
|
| /dalvik/vm/test/ |
| TestIndirectRefTable.cpp | 373 DBUG_MSG("Add/remove %d objects FIFO order, %d iterations, %0.3fms / iteration",
385 DBUG_MSG("Add/remove %d objects LIFO order, %d iterations, %0.3fms / iteration",
397 DBUG_MSG("Get %d objects, %d iterations, %0.3fms / iteration",
|
| /external/guava/guava-tests/test/com/google/common/base/ |
| SuppliersTest.java | 350 final int iterations = 1000; local
355 for (int j = 0; j < iterations; j++) {
368 assertEquals(numThreads * iterations + 1, (int) nonThreadSafe.get());
|
| /frameworks/base/core/java/android/test/ |
| InstrumentationTestCase.java | 226 Bundle iterations = new Bundle(); local
227 iterations.putInt("currentiterations", runCount);
228 getInstrumentation().sendStatus(2, iterations);
|
| /frameworks/rs/java/tests/ImageProcessing/src/com/android/rs/image/ |
| ImageProcessingTest.java | 38 private final String ITERATIONS = "Iterations";
109 results.putInt(ITERATIONS, mIteration);
|
| /packages/apps/Bluetooth/src/com/android/bluetooth/opp/ |
| BluetoothOppReceiveFileInfo.java | 220 * avoid collisions. It starts at 1. The next 9 iterations increment it
221 * by 1 at a time (up to 10). The next 9 iterations increment it by 1 to
222 * 10 (random) at a time. The next 9 iterations increment it by 1 to 100
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/ |
| PBEParametersGenerator.java | 26 * @param iterationCount the number of iterations the "mixing" function
|
| /external/chromium/crypto/ |
| symmetric_key.h | 49 size_t iterations,
|
| symmetric_key_win.cc | 241 size_t iterations,
283 for (size_t iteration = 2; iteration <= iterations; ++iteration) {
358 size_t iterations,
444 if (!ComputePBKDF2Block(prf, hLen, salt, iterations, block_index,
|
| /external/dropbear/libtomcrypt/src/misc/pkcs5/ |
| pkcs_5_2.c | 25 @param iteration_count # of iterations desired for PKCS #5 v2 [read specs for more]
|
| /external/flac/libFLAC/include/private/ |
| float.h | 85 * 'precision' roughly limits the number of iterations that are done;
|
| /external/jmonkeyengine/engine/src/core/com/jme3/animation/ |
| SkeletonControl.java | 332 int iterations = (int) FastMath.ceil(fvb.capacity() / ((float) posBuf.length)); local
334 for (int i = iterations - 1; i >= 0; i--) {
442 int iterations = (int) FastMath.ceil(fvb.capacity() / ((float) posBuf.length)); local
445 for (int i = iterations - 1; i >= 0; i--) {
|
| /external/llvm/lib/CodeGen/ |
| SpillPlacement.cpp | 156 // initial iterations.
298 // change its value ever again, so exclude it from iterations.
310 /// maximum number of iterations is reached.
321 // Run up to 10 iterations. The edge bundle numbering is closely related to
|
| /external/llvm/test/Transforms/LoopUnroll/ |
| 2011-08-09-PhiUpdate.ll | 12 ; Check that the loop exit merges values from all the iterations. This
|
| /external/openssl/patches/ |
| eng_dyn_dirs.patch | 64 + /* Previous failed loop iterations, if any, will have resulted in
|
| /external/qemu/distrib/sdl-1.2.15/test/ |
| testblitspeed.c | 363 Uint32 iterations = 0; local
388 iterations++;
403 (int) iterations,
405 (int) (((float)iterations) / (((float)elasped) / 1000.0f)));
|
| /external/v8/test/mjsunit/ |
| debug-liveedit-patch-positions-replace.js | 74 // This several iterations should cause call IC for BeingReplaced call. This IC
|
| /external/valgrind/main/drd/ |
| drd_clientobj.h | 128 // two barrier iterations.
|
| /external/webkit/Source/WebCore/platform/graphics/ |
| UnitBezier.h | 72 // First try a few iterations of Newton's method -- normally very fast.
|
