| /system/libhwbinder/vts/performance/ |
| Latency.cpp | 65 static int iterations = 100; variable
176 static void clientFx(int num, int server_count, int iterations, Pipe p) {
201 // each iterations contains exactly 2 transactions
202 for (int i = 0; i < iterations; i++) {
239 static Pipe makeClientProcess(int num, int iterations, int no_pair) {
248 clientFx(num, no_pair, iterations, move(get<1>(pipe_pair)));
269 cout << "-i 1 # number of iterations" << endl;
302 iterations = atoi(argv[i + 1]);
354 cout << "\"cfg\":{\"pair\":" << (no_pair) << ",\"iterations\":" << iterations
[all...] |
| /tools/test/connectivity/acts/tests/google/power/coex/ |
| PowerCoexscanTest.py | 26 iterations = math.floor((self.mon_duration + self.mon_offset + 10) /
30 'am instrument -w -r -e scan-interval \"%d\" -e scan-iterations'
34 (self.wifi_scan_interval, iterations))
|
| /external/androidplot/AndroidPlot-Core/src/test/java/com/androidplot/ui/ |
| DynamicTableModelTest.java | 69 // should stop at 4 iterations since the table can only hold that many:
71 int iterations = 0;
local
74 iterations++;
76 assertEquals(4, iterations);
78 // now set a dynamic number of columns. iterations should equal however
82 iterations = 0;
85 iterations++;
87 assertEquals(10, iterations);
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/direct/ |
| DirectSearchOptimizer.java | 100 /** Maximal number of iterations allowed. */
103 /** Number of iterations already performed. */
104 private int iterations; field in class:DirectSearchOptimizer
238 return iterations;
284 iterations = 0;
292 if (iterations > 0) {
295 converged &= checker.converged(iterations, previous[i], simplex[i]);
311 /** Increment the iterations counter by 1.
313 * of iterations is exceeded
317 if (++iterations > maxIterations)
[all...] |
| /external/libdrm/tests/exynos/ |
| exynos_fimg2d_perf.c | 32 unsigned buf_width, unsigned buf_height, unsigned iterations)
51 printf("buffer width = %u, buffer height = %u, iterations = %u\n",
52 buf_width, buf_height, iterations);
57 for (i = 0; i < iterations; ++i) {
110 unsigned buf_width, unsigned buf_height, unsigned iterations, unsigned batch)
137 printf("buffer width = %u, buffer height = %u, iterations = %u\n",
138 buf_width, buf_height, iterations);
143 for (i = 0; i < iterations; ++i) {
208 fprintf(stderr, "\t-i <number of iterations>\n");
|
| /external/linux-kselftest/tools/testing/selftests/timers/ |
| leap-a-day.c | 21 * -i: Number of iterations to run (default: infinite)
185 int iterations = 10; local
196 iterations = atoi(optarg);
202 printf("Usage: %s [-w] [-i <iterations>]\n", argv[0]);
205 printf(" -i: Number of iterations (-1 = infinite, default is 10)\n");
230 if (iterations < 0)
233 printf("Running for %i iterations. Press ctrl-c to stop\n", iterations);
372 if ((iterations != -1) && !(--iterations))
[all...] |
| /external/ltp/testcases/realtime/func/pi-tests/ |
| testpi-7.c | 49 #define ITERATIONS 100
75 long iterations = ITERATIONS; variable
81 printf(" -i# #: number of iterations\n");
97 iterations = atoi(v);
228 long iterations = (long)t->arg; local
231 for (i = 0; i < iterations; i++) {
282 printf(" iterations: %ld\n", iterations);
295 create_fifo_thread(high_prio_rt_thread, (void *)iterations, HIGH_PRIO)
[all...] |
| /frameworks/base/tests/net/java/android/net/ |
| MacAddressTest.java | 155 final int iterations = 10000; local
156 for (int i = 0; i < iterations; i++) {
172 final int iterations = 1000; local
174 for (int i = 0; i < iterations; i++) {
188 for (int i = 0; i < iterations; i++) {
199 for (int i = 0; i < iterations; i++) {
|
| /frameworks/rs/tests/java_api/RsBLAS_Benchmark/src/com/example/android/rs/blasbenchmark/ |
| BlasBenchmark.java | 94 int iterations; field in class:BlasBenchmark.Processor.Result
102 return r.totalTime / r.iterations * 1000.f;
115 r.iterations ++;
148 Log.v("rs", "Test: time=" + r.totalTime +"s, iterations=" + r.iterations +
149 ", avg=" + r.totalTime / r.iterations * 1000.f + " " + r.testInfo);
195 mTestResults[ct] = r.totalTime / r.iterations * 1000.f;
|
| /prebuilts/go/darwin-x86/test/bench/go1/ |
| binarytree_test.go | 46 iterations := 1 << uint(maxDepth-depth+minDepth)
49 for i := 1; i <= iterations; i++ {
53 //fmt.Printf("%d\t trees of depth %d\t check: %d\n", iterations*2, depth, check)
|
| /prebuilts/go/linux-x86/test/bench/go1/ |
| binarytree_test.go | 46 iterations := 1 << uint(maxDepth-depth+minDepth)
49 for i := 1; i <= iterations; i++ {
53 //fmt.Printf("%d\t trees of depth %d\t check: %d\n", iterations*2, depth, check)
|
| /external/tensorflow/tensorflow/python/keras/_impl/keras/ |
| optimizers.py | 172 self.iterations = K.variable(0, dtype='int64', name='iterations')
181 self.updates = [K.update_add(self.iterations, 1)]
186 (1. + self.decay * K.cast(self.iterations,
191 self.weights = [self.iterations] + moments
244 self.iterations = K.variable(0, dtype='int64', name='iterations')
254 self.updates = [K.update_add(self.iterations, 1)]
259 (1. + self.decay * K.cast(self.iterations,
305 self.iterations = K.variable(0, dtype='int64', name='iterations'
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ |
| Primes.java | 137 * Run several iterations of the Miller-Rabin algorithm with randomly-chosen bases. This is an
146 * @param iterations
150 public static MROutput enhancedMRProbablePrimeTest(BigInteger candidate, SecureRandom random, int iterations)
158 if (iterations < 1)
160 throw new IllegalArgumentException("'iterations' must be > 0");
179 for (int i = 0; i < iterations; ++i)
263 * Run several iterations of the Miller-Rabin algorithm with randomly-chosen bases.
269 * @param iterations
273 * (indicating primality with some probability dependent on the number of iterations
276 public static boolean isMRProbablePrime(BigInteger candidate, SecureRandom random, int iterations)
520 int iterations = (length - 1) \/ outlen; local
[all...] |
| /tools/tradefederation/core/prod-tests/src/com/android/performance/tests/ |
| EmmcPerformanceTest.java | 92 @Option(name = "iterations", description = "The number of iterations to run")
143 private void runSequentialRead(int iterations, ITestInvocationListener listener,
147 runTest(SEQUENTIAL_READ_KEY, command, TestType.DD, true, iterations, listener, metrics);
153 private void runSequentialWrite(int iterations, ITestInvocationListener listener,
157 runTest(SEQUENTIAL_WRITE_KEY, command, TestType.DD, false, iterations, listener, metrics);
164 private void runRandomRead(int iterations, ITestInvocationListener listener,
168 runTest(RANDOM_READ_KEY, command, TestType.RANDOM, true, iterations, listener, metrics);
174 private void runRandomWrite(int iterations, ITestInvocationListener listener,
178 runTest(RANDOM_WRITE_KEY, command, TestType.RANDOM, false, iterations, listener, metrics)
[all...] |
| /external/opencv/cv/src/ |
| cvmorph.cpp | [all...] |
| /external/toolchain-utils/crb/ |
| crb_driver.py | 32 self.iterations = None
41 self.iterations = int(fields[0])
48 return '\n'.join([self.name, self.iterations, self.args])
55 if default_iterations and not autotest.iterations:
56 autotest.iterations = default_iterations
94 for iteration in range(autotest.iterations):
270 'Optionally specify per-test iterations by:'
277 '--iterations',
278 dest='iterations',
279 help='Iterations to run per benchmark.'
[all...] |
| /frameworks/native/libs/binder/tests/ |
| schd-dbg.cpp | 49 int iterations = 100; variable
320 void worker_fx(int num, int no_process, int iterations, int payload_size,
346 // each iterations contains exatcly 2 transactions
347 for (int i = 0; is_client(num) && i < iterations; i++) {
376 int no_trans = iterations * 2;
395 Pipe make_process(int num, int iterations, int no_process, int payload_size) {
404 worker_fx(num, no_process, iterations, payload_size,
427 iterations = atoi(argv[i + 1]);
471 << ",\"iterations\":" << iterations << ",\"deadline_us\":" << deadline_u
[all...] |
| /system/extras/simpleperf/ |
| cpu_hotplug_test.cpp | 247 size_t iterations = 0; local
265 iterations++;
267 GTEST_LOG_(INFO) << "Test offline while recording for " << iterations << " times.";
303 size_t iterations = 0; local
324 iterations++;
326 GTEST_LOG_(INFO) << "Test offline while ioctl(PERF_EVENT_IOC_ENABLE) for " << iterations << " times.";
387 size_t iterations = 0; local
409 iterations++;
411 GTEST_LOG_(INFO) << "Test offline while user process profiling for " << iterations << " times.";
|
| /external/ltp/testcases/realtime/perf/latency/ |
| pthread_cond_many.c | 54 int iterations = 0; variable
251 printf(" -iITERATIONS iterations (required)\n");
254 printf(" pthread_cond_many [options] iterations nthreads\n");
268 iterations = atoi(v);
297 iterations = strtol(argv[optind++], NULL, 0);
302 if (iterations == 0 || nthreads == 0) {
313 test_signal(iterations, nthreads);
|
| /packages/apps/Gallery2/jni/filters/ |
| kmeans.h | 180 int iterations, T initialPicks[]){
193 for (x = 0; x < iterations; x++) {
199 x = iterations;
210 int iterations, unsigned int seed){
216 iterations, initialPicks);
|
| /cts/tests/tests/speech/src/android/speech/tts/cts/ |
| TextToSpeechServiceTest.java | 103 final int iterations = 20; local
104 for (int i = 0; i < iterations; i++) {
114 for (int i = 0; i < iterations; i++) {
|
| /external/ltp/testcases/open_posix_testsuite/stress/threads/pthread_exit/ |
| stress.c | 104 long long iterations = 0; variable
263 iterations++;
270 output("pthread_exit stress test PASSED -- %llu iterations\n",
271 iterations);
|
| /external/ltp/testcases/open_posix_testsuite/stress/threads/pthread_getschedparam/ |
| stress.c | 83 long long iterations = 0; variable
130 iterations++;
301 output("pthread_getschedparam stress test PASSED -- %llu iterations\n",
302 iterations);
|
| /external/ltp/testcases/open_posix_testsuite/stress/threads/pthread_self/ |
| stress.c | 97 long long iterations = 0; variable
334 iterations++;
341 output("pthread_exit stress test PASSED -- %llu iterations\n",
342 iterations);
|
| /external/perfetto/test/ |
| end_to_end_benchmark.cc | 76 uint32_t iterations = 0; local
78 auto cname = "produced.and.committed." + std::to_string(iterations++);
94 state.SetBytesProcessed(iterations * message_bytes * message_count);
|
