| /bionic/tests/ |
| math_benchmark.cpp | 25 static void BM_math_sqrt(int iters) {
30 for (int i = 0; i < iters; ++i) {
38 static void BM_math_log10(int iters) {
43 for (int i = 0; i < iters; ++i) {
51 static void BM_math_logb(int iters) {
56 for (int i = 0; i < iters; ++i) {
|
| string_benchmark.cpp | 29 static void BM_string_memcmp(int iters, int nbytes) {
37 for (int i = 0; i < iters; ++i) {
42 SetBenchmarkBytesProcessed(int64_t(iters) * int64_t(nbytes));
48 static void BM_string_memcpy(int iters, int nbytes) {
54 for (int i = 0; i < iters; ++i) {
59 SetBenchmarkBytesProcessed(int64_t(iters) * int64_t(nbytes));
65 static void BM_string_memmove(int iters, int nbytes) {
71 for (int i = 0; i < iters; ++i) {
76 SetBenchmarkBytesProcessed(int64_t(iters) * int64_t(nbytes));
81 static void BM_string_memset(int iters, int nbytes)
[all...] |
| time_benchmark.cpp | 26 static void BM_time_localtime_tz(int iters) {
31 for (int i = 0; i < iters; ++i) {
|
| property_benchmark.cpp | 109 static void BM_property_get(int iters, int nprops)
119 srandom(iters * nprops);
123 for (int i = 0; i < iters; i++) {
130 static void BM_property_find(int iters, int nprops)
139 srandom(iters * nprops);
143 for (int i = 0; i < iters; i++) {
|
| /external/chromium_org/third_party/re2/re2/testing/ |
| regexp_benchmark.cc | 105 typedef void SearchImpl(int iters, const char* regexp, const StringPiece& text,
113 typedef void ParseImpl(int iters, const char* regexp, const StringPiece& text);
149 // the text for regexp iters times.
150 void Search(int iters, int nbytes, const char* regexp, SearchImpl* search) {
156 search(iters, regexp, s, Prog::kUnanchored, false);
157 SetBenchmarkBytesProcessed(static_cast<int64>(iters)*nbytes);
239 void SearchBigFixed(int iters, int nbytes, SearchImpl* search) {
249 search(iters, regexp.c_str(), s, Prog::kUnanchored, true);
250 SetBenchmarkBytesProcessed(static_cast<int64>(iters)*nbytes);
266 void FindAndConsume(int iters, int nbytes)
[all...] |
| /external/regex-re2/re2/testing/ |
| regexp_benchmark.cc | 105 typedef void SearchImpl(int iters, const char* regexp, const StringPiece& text,
113 typedef void ParseImpl(int iters, const char* regexp, const StringPiece& text);
149 // the text for regexp iters times.
150 void Search(int iters, int nbytes, const char* regexp, SearchImpl* search) {
156 search(iters, regexp, s, Prog::kUnanchored, false);
157 SetBenchmarkBytesProcessed(static_cast<int64>(iters)*nbytes);
239 void SearchBigFixed(int iters, int nbytes, SearchImpl* search) {
249 search(iters, regexp.c_str(), s, Prog::kUnanchored, true);
250 SetBenchmarkBytesProcessed(static_cast<int64>(iters)*nbytes);
266 void FindAndConsume(int iters, int nbytes)
[all...] |
| /frameworks/rs/tests/latency/ |
| latency.cpp | 11 int iters = 100; local
17 iters = atoi(argv[1]);
18 if (iters <= 0) {
19 printf("iters must be positive\n");
24 printf("iters = %d\n", iters);
79 for (int i = 0; i < iters; i++) {
89 printf("time per iter: %f microseconds\n", (double)elapsed / iters);
93 for (int i = 0; i < iters; i++) {
104 printf("time per iter with copy: %f microseconds\n", (double)elapsed / iters);
[all...] |
| /art/test/055-enum-performance/src/ |
| Main.java | 96 static public int basis(int iters) {
97 for (int i = iters; i > 0; i--) {
120 return iters * 20;
132 static public int test1(int iters) {
134 for (int i = iters; i > 0; i--) {
157 return iters * 20;
160 static public int test2(int iters) {
162 for (int i = iters; i > 0; i--) {
185 return iters * 20;
188 static public int test3(int iters) {
[all...] |
| /dalvik/tests/055-enum-performance/src/ |
| Main.java | 76 static public int basis(int iters) {
77 for (int i = iters; i > 0; i--) {
100 return iters * 20;
112 static public int test1(int iters) {
114 for (int i = iters; i > 0; i--) {
137 return iters * 20;
140 static public int test2(int iters) {
142 for (int i = iters; i > 0; i--) {
165 return iters * 20;
168 static public int test3(int iters) {
[all...] |
| /external/chromium_org/third_party/skia/src/core/ |
| SkCubicClipper.cpp | 44 int iters = 0; local
62 ++iters;
63 } while (!converged && (iters < maxiters));
92 int iters = 0;
107 ++iters;
|
| /external/skia/src/core/ |
| SkCubicClipper.cpp | 44 int iters = 0; local
62 ++iters;
63 } while (!converged && (iters < maxiters));
92 int iters = 0;
107 ++iters;
|
| /frameworks/rs/java/tests/ImageProcessing/src/com/android/rs/image/ |
| Mandelbrot.java | 41 int iters = progress * 3 + 50; local
42 mScript.set_gMaxIteration(iters);
|
| /frameworks/rs/java/tests/ImageProcessing2/src/com/android/rs/image/ |
| Mandelbrot.java | 35 int iters = progress * 3 + 50; local
36 mScript.set_gMaxIteration(iters);
|
| /frameworks/rs/java/tests/ImageProcessing_jb/src/com/android/rs/image/ |
| Mandelbrot.java | 41 int iters = progress * 3 + 50; local
42 mScript.set_gMaxIteration(iters);
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| GMRES.h | 27 * \param iters on input: maximum number of iterations to perform
57 int &iters, const int &restart, typename Dest::RealScalar & tol_error) {
69 const int maxIters = iters;
70 iters = 0;
93 ++iters;
147 bool stop=(k==m || abs(w(k)) < tol || iters == maxIters);
|
| /external/eigen/bench/ |
| bench_norm.cpp | 219 for (int i=0; i<iters; ++i) NRM(vf); \
224 for (int i=0; i<iters; ++i) NRM(vd); \
229 for (int i=0; i<iters; ++i) NRM(vcf); \
275 int iters = 100000; local
318 int iters = 1; local
333 int iters = 100000; local
|
| quat_slerp.cpp | 166 int iters = 40; local
185 for (int i=0; i<iters; ++i)
214 avgerr /= RefScalar(rep*iters);
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| BiCGSTAB.h | 24 * \param iters On input the max number of iteration, on output the number of performed iterations.
30 const Preconditioner& precond, int& iters,
39 int maxIters = iters;
84 iters = i;
|
| ConjugateGradient.h | 23 * \param iters On input the max number of iteration, on output the number of performed iterations.
29 const Preconditioner& precond, int& iters,
39 int maxIters = iters;
75 iters = i;
|
| /external/jmonkeyengine/engine/src/core/com/jme3/post/ |
| HDRRenderer.java | 170 int iters, Texture tex){
177 if (iters != -1){
183 } while (numPixels > iters);
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_generators.py | 1049 iters = [None] * n
1056 it = iters[i] = gs[i]().next
1069 values[i] = iters[i]()
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_generators.py | 1049 iters = [None] * n
1056 it = iters[i] = gs[i]().next
1069 values[i] = iters[i]()
[all...] |
| /cts/suite/pts/deviceTests/browserbench/assets/octane/ |
| navier-stokes.js | 358 this.setIterations = function(iters) {
359 if (iters > 0 && iters <= 100)
360 iterations = iters;
|
| /external/chromium_org/v8/benchmarks/ |
| navier-stokes.js | 340 this.setIterations = function(iters) {
341 if (iters > 0 && iters <= 100)
342 iterations = iters;
|
| /external/opencv/cxcore/src/ |
| cxjacobieigens.cpp | 71 int i, j, k, ind, iters = 0; local
100 while( Amax > ax && iters++ < 100 )
222 int i, j, k, p, q, ind, iters = 0; local
251 while( Amax > ax && iters++ < 100 )
|
