HomeSort by relevance Sort by last modified time
    Searched refs:iters (Results 1 - 25 of 65) sorted by null

1 2 3

  /bionic/benchmarks/
unistd_benchmark.cpp 22 static void BM_unistd_getpid(int iters) {
25 for (int i = 0; i < iters; ++i) {
33 static void BM_unistd_getpid_syscall(int iters) {
36 for (int i = 0; i < iters; ++i) {
47 static void BM_unistd_gettid(int iters) {
50 for (int i = 0; i < iters; ++i) {
58 static void BM_unistd_gettid_syscall(int iters) {
61 for (int i = 0; i < iters; ++i) {
time_benchmark.cpp 22 static void BM_time_clock_gettime(int iters) {
26 for (int i = 0; i < iters; ++i) {
34 static void BM_time_clock_gettime_syscall(int iters) {
38 for (int i = 0; i < iters; ++i) {
46 static void BM_time_gettimeofday(int iters) {
50 for (int i = 0; i < iters; ++i) {
58 static void BM_time_gettimeofday_syscall(int iters) {
62 for (int i = 0; i < iters; ++i) {
70 static void BM_time_time(int iters) {
73 for (int i = 0; i < iters; ++i)
    [all...]
semaphore_benchmark.cpp 21 static void BM_semaphore_sem_getvalue(int iters) {
27 for (int i = 0; i < iters; ++i) {
36 static void BM_semaphore_sem_wait_sem_post(int iters) {
42 for (int i = 0; i < iters; ++i) {
pthread_benchmark.cpp 24 static void BM_pthread_self(int iters) {
27 for (int i = 0; i < iters; ++i) {
35 static void BM_pthread_getspecific(int iters) {
41 for (int i = 0; i < iters; ++i) {
53 static void BM_pthread_once(int iters) {
59 for (int i = 0; i < iters; ++i) {
67 static void BM_pthread_mutex_lock(int iters) {
72 for (int i = 0; i < iters; ++i) {
81 static void BM_pthread_mutex_lock_ERRORCHECK(int iters) {
86 for (int i = 0; i < iters; ++i)
    [all...]
math_benchmark.cpp 26 static void BM_math_sqrt(int iters) {
31 for (int i = 0; i < iters; ++i) {
39 static void BM_math_log10(int iters) {
44 for (int i = 0; i < iters; ++i) {
52 static void BM_math_logb(int iters) {
57 for (int i = 0; i < iters; ++i) {
65 static void BM_math_isinf_NORMAL(int iters) {
70 for (int i = 0; i < iters; ++i) {
78 static void BM_math_isinf_NAN(int iters) {
83 for (int i = 0; i < iters; ++i)
    [all...]
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...]
property_benchmark.cpp 141 static void BM_property_get(int iters, int nprops)
151 srandom(iters * nprops);
155 for (int i = 0; i < iters; i++) {
162 static void BM_property_find(int iters, int nprops)
171 srandom(iters * nprops);
175 for (int i = 0; i < iters; i++) {
182 static void BM_property_read(int iters, int nprops)
191 srandom(iters * nprops);
192 const prop_info** pinfo = new const prop_info*[iters];
195 for (int i = 0; i < iters; i++)
    [all...]
stdio_benchmark.cpp 28 static void BM_stdio_fread(int iters, int chunk_size) {
34 for (int i = 0; i < iters; ++i) {
39 SetBenchmarkBytesProcessed(int64_t(iters) * int64_t(chunk_size));
46 static void BM_stdio_fwrite(int iters, int chunk_size) {
52 for (int i = 0; i < iters; ++i) {
57 SetBenchmarkBytesProcessed(int64_t(iters) * int64_t(chunk_size));
  /system/core/liblog/tests/
liblog_benchmark.cpp 45 static void BM_log_maximum_retry(int iters) {
48 for (int i = 0; i < iters; ++i) {
63 static void BM_log_maximum(int iters) {
66 for (int i = 0; i < iters; ++i) {
79 static void BM_clock_overhead(int iters) {
80 for (int i = 0; i < iters; ++i) {
92 static void BM_log_overhead(int iters) {
93 for (int i = 0; i < iters; ++i) {
129 static void BM_log_latency(int iters) {
143 for (int j = 0, i = 0; i < iters && j < 10*iters; ++i, ++j)
    [all...]
  /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...]
  /external/chromium_org/content/browser/android/java/
gin_java_bound_object.cc 99 iters = methods_.equal_range(method_name); local
100 if (iters.first == iters.second) {
107 for (JavaMethodMap::const_iterator iter = iters.first; iter != iters.second;
  /external/chromium_org/third_party/skia/src/core/
SkCubicClipper.cpp 40 int iters = 0; local
54 ++iters;
55 } while (!converged && (iters < maxiters));
84 int iters = 0;
99 ++iters;
  /external/skia/src/core/
SkCubicClipper.cpp 40 int iters = 0; local
54 ++iters;
55 } while (!converged && (iters < maxiters));
84 int iters = 0;
99 ++iters;
  /frameworks/rs/java/tests/ImageProcessing/src/com/android/rs/image/
Mandelbrot.java 46 int iters = progress * 3 + 50; local
47 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 46 int iters = progress * 3 + 50; local
47 mScript.set_gMaxIteration(iters);
  /external/chromium_org/third_party/skia/tests/
PathOpsCubicLineIntersectionIdeas.cpp 55 int* iters) {
58 *iters += 1;
143 int iters = 0; local
219 double newT = binary_search(cubic, step, pt, t, &iters);
239 SkDebugf("errors=%d avgIter=%1.9g", errors, (double) iters / errors);
264 int iters = 0;
265 double newT = binary_search(cubic, 0.1, pt, t, &iters);
  /external/skia/tests/
PathOpsCubicLineIntersectionIdeas.cpp 55 int* iters) {
58 *iters += 1;
143 int iters = 0; local
219 double newT = binary_search(cubic, step, pt, t, &iters);
239 SkDebugf("errors=%d avgIter=%1.9g", errors, (double) iters / errors);
264 int iters = 0;
265 double newT = binary_search(cubic, 0.1, pt, t, &iters);
  /external/eigen/Eigen/src/IterativeLinearSolvers/
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;
49 iters = 0;
57 iters = 0;
89 iters = i;
  /external/eigen/unsupported/Eigen/src/IterativeSolvers/
MINRES.h 26 * \param iters On input the max number of iteration, on output the number of performed iterations.
32 const Preconditioner& precond, int& iters,
41 const int maxIters(iters); // initialize maxIters to iters
70 iters = 0; // reset iters
71 while ( iters < maxIters ){
122 iters++; // increment iteration number (for output purposes)
  /prebuilts/misc/common/swig/include/2.0.11/octave/
octiterators.swg 139 const self_type *iters = dynamic_cast<const self_type *>(&iter);
140 if (iters) {
141 return (current == iters->get_current());
149 const self_type *iters = dynamic_cast<const self_type *>(&iter);
150 if (iters) {
151 return std::distance(current, iters->get_current());
  /prebuilts/misc/common/swig/include/2.0.11/python/
pyiterators.swg 165 const self_type *iters = dynamic_cast<const self_type *>(&iter);
166 if (iters) {
167 return (current == iters->get_current());
175 const self_type *iters = dynamic_cast<const self_type *>(&iter);
176 if (iters) {
177 return std::distance(current, iters->get_current());

Completed in 613 milliseconds

1 2 3