| /external/libchrome/crypto/ |
| ec_private_key.h | 83 // The |password| and |iterations| are used as inputs to the key derivation
85 // of 1000 iterations, on modern systems a larger value may be preferrable.
87 int iterations,
|
| symmetric_key_nss.cc | 48 size_t iterations,
51 if (salt.empty() || iterations == 0 || key_size_in_bits == 0)
80 iterations,
|
| /external/opencv3/modules/cudalegacy/include/opencv2/cudalegacy/ |
| NCVBroxOpticalFlow.hpp | 77 /// number of lagged non-linearity iterations (inner loop)
79 /// number of warping iterations (number of pyramid levels)
81 /// number of linear system solver iterations
|
| /external/opencv3/modules/stitching/perf/opencl/ |
| perf_stitch.cpp | 46 declare.iterations(20);
83 declare.iterations(20);
125 declare.iterations(20);
|
| /external/webrtc/webrtc/modules/audio_processing/agc/ |
| agc_unittest.cc | 41 MOCK_METHOD2(LevelChanged, void(int iterations, int level));
53 void RunAgc(int iterations, float gain_db) {
69 for (int i = 0; i < iterations; ++i) {
|
| /frameworks/rs/java/tests/RsBLAS_Benchmark/src/com/example/android/rs/blasbenchmark/ |
| BlasTest.java | 39 private final String ITERATIONS = "Iterations";
110 results.putInt(ITERATIONS, mIteration);
|
| BlasBenchmark.java | 99 int iterations; field in class:BlasBenchmark.Processor.Result
113 r.iterations ++;
148 Log.v("rs", "Test: time=" + r.totalTime +"s, iterations=" + r.iterations +
149 ", avg=" + r.totalTime / r.iterations * 1000.f);
195 mTestResults[ct] = r.totalTime / r.iterations * 1000.f;
|
| /packages/apps/Messaging/src/com/android/messaging/util/ |
| CubicBezierInterpolator.java | 76 final int iterations = 8; local
89 for (int i = 0; i < iterations; i++) {
108 for (int i = 0; Math.abs(value - x) > epsilon && i < iterations; i++) {
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
| time_hashlib.py | 12 iterations = 106201/scale * 20
17 for f in xrange(iterations):
21 print ('%2.2f' % (end-start)), "seconds", iterations, "x", len(longStr), "bytes", name
|
| /prebuilts/gdb/linux-x86/lib/python2.7/test/ |
| time_hashlib.py | 12 iterations = 106201/scale * 20
17 for f in xrange(iterations):
21 print ('%2.2f' % (end-start)), "seconds", iterations, "x", len(longStr), "bytes", name
|
| /prebuilts/go/darwin-x86/test/bench/garbage/ |
| tree.go | 85 iterations := 1 << uint(maxDepth-depth+minDepth)
88 for i := 1; i <= iterations; i++ {
92 fmt.Printf("%d\t trees of depth %d\t check: %d\n", iterations*2, depth, check)
|
| /prebuilts/go/darwin-x86/test/bench/shootout/ |
| binary-tree-freelist.go | 115 iterations := 1 << uint(maxDepth-depth+minDepth)
118 for i := 1; i <= iterations; i++ {
126 fmt.Printf("%d\t trees of depth %d\t check: %d\n", iterations*2, depth, check)
|
| binary-tree.go | 82 iterations := 1 << uint(maxDepth-depth+minDepth)
85 for i := 1; i <= iterations; i++ {
89 fmt.Printf("%d\t trees of depth %d\t check: %d\n", iterations*2, depth, check)
|
| /prebuilts/go/linux-x86/test/bench/garbage/ |
| tree.go | 85 iterations := 1 << uint(maxDepth-depth+minDepth)
88 for i := 1; i <= iterations; i++ {
92 fmt.Printf("%d\t trees of depth %d\t check: %d\n", iterations*2, depth, check)
|
| /prebuilts/go/linux-x86/test/bench/shootout/ |
| binary-tree-freelist.go | 115 iterations := 1 << uint(maxDepth-depth+minDepth)
118 for i := 1; i <= iterations; i++ {
126 fmt.Printf("%d\t trees of depth %d\t check: %d\n", iterations*2, depth, check)
|
| binary-tree.go | 82 iterations := 1 << uint(maxDepth-depth+minDepth)
85 for i := 1; i <= iterations; i++ {
89 fmt.Printf("%d\t trees of depth %d\t check: %d\n", iterations*2, depth, check)
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| time_hashlib.py | 12 iterations = 106201/scale * 20
17 for f in xrange(iterations):
21 print ('%2.2f' % (end-start)), "seconds", iterations, "x", len(longStr), "bytes", name
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| time_hashlib.py | 12 iterations = 106201/scale * 20
17 for f in xrange(iterations):
21 print ('%2.2f' % (end-start)), "seconds", iterations, "x", len(longStr), "bytes", name
|
| /system/extras/tests/workloads/ |
| feedly-chrome.sh | 58 while [ $cur -le $iterations ]
61 echo Iteration $cur of $iterations
108 ((feedlyAve=feedlyStartTimes/iterations))
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/estimation/ |
| GaussNewtonEstimator.java | 85 * condition that is met stops the iterations.</p>
93 * iterations, the algorithm is considered to have failed and an
141 * starting from their current values through several iterations. At
146 * <p>The iterations are stopped either when the criterion goes
150 * iterations. If the convergence it not reached before the maximum
151 * number of iterations, an {@link EstimationException} is
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| BiCGSTAB.h | 24 * \param iters On input the max number of iteration, on output the number of performed iterations.
134 * The maximal number of iterations and tolerance value can be controlled via the setMaxIterations()
135 * and setTolerance() methods. The defaults are the size of the problem for the maximal number of iterations
147 * std::cout << "#iterations: " << solver.iterations() << std::endl;
153 * By default the iterations start with x=0 as an initial guess of the solution.
|
| ConjugateGradient.h | 23 * \param iters On input the max number of iteration, on output the number of performed iterations.
120 * The maximal number of iterations and tolerance value can be controlled via the setMaxIterations()
121 * and setTolerance() methods. The defaults are the size of the problem for the maximal number of iterations
133 * std::cout << "#iterations: " << cg.iterations() << std::endl;
139 * By default the iterations start with x=0 as an initial guess of the solution.
|
| /frameworks/base/graphics/tests/graphicstests/src/android/graphics/ |
| GraphicsPerformanceTests.java | 76 /** Number of iterations to pass back to harness. Subclass should override */
98 // Ask subclass for number of iterations
161 private static final int ITERATIONS = 1000;
175 return ITERATIONS;
186 for (int i = 0; i < ITERATIONS; i++) {
192 for (int i = 0; i < ITERATIONS; i++) {
|
| /system/bt/osi/src/ |
| reactor.c | 60 static reactor_status_t run_reactor(reactor_t *reactor, int iterations);
224 // Runs the reactor loop for a maximum of |iterations|.
225 // 0 |iterations| means loop forever.
227 static reactor_status_t run_reactor(reactor_t *reactor, int iterations) {
234 for (int i = 0; iterations == 0 || i < iterations; ++i) {
|
| /cts/tests/tests/graphics/src/android/opengl/cts/ |
| GLSurfaceViewTest.java | 55 * between iterations.
86 * larger number of iterations can be done in a short amount of time.
|
