/external/compiler-rt/test/esan/TestCases/ |
workingset-samples.cpp | 10 const int iters = 6; variable 20 for (int j = 0; j < iters; ++j) {
|
workingset-midreport.cpp | 15 const int iters = 6; variable 25 for (int j = 0; j < iters; ++j) {
|
/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/cpp_api/latency/ |
latency.cpp | 8 int iters = 100; local 14 iters = atoi(argv[1]); 15 if (iters <= 0) { 16 printf("iters must be positive\n"); 21 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...] |
/system/core/liblog/tests/ |
liblog_benchmark.cpp | 54 static void BM_log_maximum_retry(int iters) { 57 for (int i = 0; i < iters; ++i) { 71 static void BM_log_maximum(int iters) { 74 for (int i = 0; i < iters; ++i) { 90 static void BM_log_maximum_null(int iters) { 92 BM_log_maximum(iters); 106 static void BM_clock_overhead(int iters) { 107 for (int i = 0; i < iters; ++i) { 117 static void BM_pmsg_short(int iters) { 179 for (int i = 0; i < iters; ++i) [all...] |
/external/autotest/client/profilers/cpistat/ |
cpistat | 47 iters = -1 variable 51 iters = int(args[1]) variable 65 while infinite or iters: 84 iters = iters - 1 variable
|
/external/eigen/bench/tensors/ |
contraction_benchmarks_cpu.cc | 15 static void BM_##Contraction##_##D1##x##D2##x##D3(int iters, int Threads) { \ 19 suite.contraction(iters); \
|
tensor_benchmarks_sycl.cc | 27 static void BM_##FUNC(int iters, int N) { \ 32 suite.FUNC(iters); \
|
tensor_benchmarks_cpu.cc | 13 static void BM_##FUNC##_##THREADS##T(int iters, int N) { \ 17 suite.FUNC(iters); \ 84 static void BM_##FUNC##_##D1##x##D2##x##D3##_##THREADS##T(int iters, int N) { \ 89 suite.FUNC(iters); \ 93 suite.FUNC(iters); \ 138 static void BM_##FUNC##_##DIM1##x##DIM2##_##THREADS##T(int iters, int N) { \ 142 suite.FUNC(iters, DIM1, DIM2); \
|
/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/autotest/client/common_lib/ |
decorators_unittest.py | 30 iters = 100 38 args=(self.inc_count, iters)) 44 self.assertEquals(iters * num_threads, self.count)
|
/prebuilts/go/darwin-x86/src/testing/ |
benchmark_test.go | 69 iters := uint64(0) 74 atomic.AddUint64(&iters, 1) 80 if iters != uint64(b.N) { 81 t.Errorf("got %v iters, want %v", iters, b.N)
|
/prebuilts/go/linux-x86/src/testing/ |
benchmark_test.go | 69 iters := uint64(0) 74 atomic.AddUint64(&iters, 1) 80 if iters != uint64(b.N) { 81 t.Errorf("got %v iters, want %v", iters, b.N)
|
/art/test/950-redefine-intrinsic/src/ |
Main.java | 432 public static void doTest(int iters) { 455 int failures = (int)r.ints(iters) 460 double percent = 100.0d*((double)failures/(double)iters); 461 System.out.println("for intrinsic " + f.name + " " + failures + "/" + iters
|
/external/autotest/client/site_tests/hardware_Badblocks/ |
hardware_Badblocks.py | 141 def run_once(self, iters=1, tmout=60 * 60): 145 @param iters: Number of times to run badblocks. 153 logging.info('Iterations: %d', iters) 172 for i in range(iters): 180 stats['ea_badblocks_runs'] = iters 189 if self._pass_count != iters:
|
/external/eigen/Eigen/src/IterativeLinearSolvers/ |
LeastSquareConjugateGradient.h | 23 * \param iters On input the max number of iteration, on output the number of performed iterations. 29 const Preconditioner& precond, Index& iters, 39 Index maxIters = iters; 50 iters = 0; 58 iters = 0; 91 iters = i;
|
/external/skia/src/core/ |
SkCubicClipper.cpp | 39 int iters = 0; local 53 ++iters; 54 } while (!converged && (iters < maxiters)); 83 int iters = 0; 98 ++iters;
|
/external/trappy/trappy/ |
utils.py | 111 iters = df.itertuples() 112 event_tuple = iters.next() 129 event_tuple = next(iters, None)
|
/frameworks/rs/tests/java_api/ImageProcessing/src/com/android/rs/image/ |
Mandelbrot.java | 46 int iters = progress * 3 + 50; local 47 mScript.set_gMaxIteration(iters);
|
/frameworks/rs/tests/java_api/ImageProcessing2/src/com/android/rs/image/ |
Mandelbrot.java | 40 int iters = progress * 3 + 50; local 41 mScript.set_gMaxIteration(iters);
|
/frameworks/rs/tests/java_api/ImageProcessing_jb/src/com/android/rs/image/ |
Mandelbrot.java | 40 int iters = progress * 3 + 50; local 41 mScript.set_gMaxIteration(iters);
|
/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, Index& iters, 45 iters = 0; 51 const Index maxIters(iters); // initialize maxIters to iters 79 iters = 0; // reset iters 80 while ( iters < maxIters ) 135 iters++; // increment iteration number (for output purposes)
|
/external/skia/tests/ |
PathOpsCubicLineIntersectionIdeas.cpp | 55 int* iters) { 58 *iters += 1; 143 int iters = 0; local 221 double newT = binary_search(cubic, step, pt, t, &iters); 241 SkDebugf("errors=%d avgIter=%1.9g", errors, (double) iters / errors); 268 int iters = 0; 269 double newT = binary_search(cubic, 0.1, pt, t, &iters);
|
/external/google-benchmark/src/ |
benchmark.cc | 225 const internal::ThreadManager::Result& results, size_t iters, 235 report.iterations = static_cast<int64_t>(iters) * b.threads; 268 size_t iters, int thread_id, 271 State st(iters, b->arg, thread_id, b->threads, &timer, manager); 295 size_t iters = has_explicit_iteration_count ? b.iterations : 1; local 308 VLOG(2) << "Running " << b.name << " for " << iters << "\n"; 312 pool[ti] = std::thread(&RunInThread, &b, iters, 315 RunInThread(&b, iters, 0, manager.get()); 347 || iters >= kMaxIterations 356 CreateRunReport(b, results, iters, seconds) [all...] |
/external/libcxx/utils/google-benchmark/src/ |
benchmark.cc | 218 const internal::ThreadManager::Result& results, size_t iters, 228 report.iterations = static_cast<int64_t>(iters) * b.threads; 259 size_t iters, int thread_id, 262 State st(iters, b->arg, thread_id, b->threads, &timer, manager); 284 size_t iters = 1; local 297 VLOG(2) << "Running " << b.name << " for " << iters << "\n"; 301 pool[ti] = std::thread(&RunInThread, &b, iters, 304 RunInThread(&b, iters, 0, manager.get()); 332 if ((i > 0) || results.has_error_ || (iters >= kMaxIterations) || 335 CreateRunReport(b, results, iters, seconds) [all...] |