| /external/google-benchmark/src/ |
| reporter.cc | 71 if (iterations != 0) new_time /= static_cast<double>(iterations);
77 if (iterations != 0) new_time /= static_cast<double>(iterations);
|
| /external/libbrillo/brillo/message_loops/ |
| message_loop_utils.h | 23 // Run the MessageLoop |loop| for up to |iterations| times without blocking.
26 int iterations);
|
| /external/libcxx/utils/google-benchmark/src/ |
| reporter.cc | 71 if (iterations != 0) new_time /= static_cast<double>(iterations);
77 if (iterations != 0) new_time /= static_cast<double>(iterations);
|
| /external/ltp/lib/newlib_tests/ |
| test16.c | 36 static volatile int iterations; variable
51 if (i > LOOPS * iterations)
52 tst_res(TWARN, "Worker performed too many iterations: %lld > %lld",
53 i, LOOPS * iterations);
99 iterations++;
|
| /external/toolchain-utils/crosperf/ |
| benchmark.py | 43 iterations to run the benchmark suite and so on. Note that the benchmark name
53 iterations,
65 self.iterations = iterations if iterations > 0 else _samples(name)
|
| /external/wpa_supplicant_8/src/crypto/ |
| sha1-pbkdf2.c | 15 size_t ssid_len, int iterations, unsigned int count,
45 for (i = 1; i < iterations; i++) {
63 * @iterations: Number of iterations to run
69 * iterations is set to 4096 and buflen to 32. This function is described in
73 int iterations, u8 *buf, size_t buflen)
82 if (pbkdf2_sha1_f(passphrase, ssid, ssid_len, iterations,
|
| /packages/apps/Gallery2/jni/filters/ |
| kmeans.cc | 52 int iterations = 20; local
59 stride, iterations, s);
63 iterations = 8;
68 dimension, stride, iterations, finalCentroids);
|
| /system/bt/test/ |
| run_unit_tests.sh | 34 echo " ${binary} [-i <iterations>] [-s <specific device>] [--all] [<test name>[.<filter>] ...] [--<arg> ...]"
53 iterations=1
67 echo "error: number of iterations expected" 1>&2
71 iterations=$(( $1 ))
134 for i in $(seq 1 ${iterations})
140 failed_tests+=( "${name} ${failed_count}/${iterations}" )
|
| /system/extras/pssbench/ |
| main.cpp | 11 int iterations = 1; variable
66 iterations = atoi(optarg);
82 for (int i = 0; i < iterations; ++i)
86 printf("iterations:%d pid:%d pss:%lld\n", iterations, pid, (long long)pss);
|
| /external/ltp/testcases/kernel/syscalls/execve/ |
| execve05.c | 57 int iterations; variable
90 iterations = atoi(av[1]);
96 iterations, fname1, fname2, count, getpid());
99 if (iterations == 0) {
101 getpid(), prog, iterations, fname1, fname2);
106 sprintf(iter, "%d", iterations - 1);
126 sprintf(iter, "%d", iterations);
|
| /external/autotest/tko/ |
| machine_aggr.cgi | 88 iterations = test.iterations()
89 if iterations.has_key(key):
90 reference_value = sum(iterations[key])/len(iterations[key])
95 iterations = test.iterations()
96 if iterations.has_key(key):
103 results = [((reference_value / i - 1)*100) for i in iterations[key]]
105 results = [((i / reference_value - 1)*100) for i in iterations[key]
[all...] |
| /external/boringssl/src/crypto/evp/ |
| pbkdf.c | 66 const uint8_t *salt, size_t salt_len, unsigned iterations,
101 for (unsigned j = 1; j < iterations; j++) {
118 // RFC 8018 describes iterations (c) as being a "positive integer", so a
124 // iterations < 1 being treated as iterations == 1 is preserved, but
129 if (iterations == 0) {
142 unsigned iterations, size_t key_len,
144 return PKCS5_PBKDF2_HMAC(password, password_len, salt, salt_len, iterations,
|
| /external/ltp/testcases/realtime/func/gtod_latency/ |
| gtod_latency.c | 59 #define ITERATIONS 10000000
89 static unsigned int iterations = ITERATIONS; variable
96 " -[lt|latency-trace] -[i|iterations]}" " -[help] \n");
203 if (!strcmp(flag, "i") || !strcmp(flag, "iterations")) {
208 iterations = strtoull(argv[++i], NULL, 0);
245 if (iterations < MIN_ITERATION) {
246 iterations = MIN_ITERATION;
247 printf("user \"iterations\" value is too small (use: %d)\n",
248 iterations);
[all...] |
| /external/ltp/testcases/realtime/func/matrix_mult/ |
| matrix_mult.c | 52 #define ITERATIONS 128
66 static int iterations = ITERATIONS; variable
80 printf(" -i# #: number of iterations\n");
88 iterations = atoi(v);
199 if (stats_container_init(&sdat, iterations) ||
201 stats_container_init(&cdat, iterations) ||
223 curdat->index = iterations - 1;
226 for (i = 0; i < iterations; i++)
231 savg = delta / iterations; /* don't use the stats record, use the total time recorded *
[all...] |
| /external/mesa3d/src/compiler/glsl/ |
| loop_unroll.cpp | 43 void simple_unroll(ir_loop *ir, int iterations);
44 void complex_unroll(ir_loop *ir, int iterations,
130 * array size is exactly the number of loop iterations, this is
134 if (int(array->type->length) == ls->limiting_terminator->iterations)
183 loop_unroll_visitor::simple_unroll(ir_loop *ir, int iterations)
187 for (int i = 0; i < iterations; i++) {
236 loop_unroll_visitor::complex_unroll(ir_loop *ir, int iterations,
242 for (int i = 0; i < iterations; i++) {
308 int iterations; local
340 /* Don't try to unroll loops where the number of iterations is not know
[all...] |
| /external/ltp/testcases/realtime/func/periodic_cpu_load/ |
| periodic_cpu_load_single.c | 59 static int iterations = DEFAULT_ITERATIONS; variable
68 (" -iITERATIONS number of iterations to calculate the average over\n");
86 int periodic_thread(nsec_t period, int iterations, int loops)
100 stats_container_init(&dat, iterations);
102 stats_quantiles_init(&quantiles, (int)log10(iterations));
115 while (i < iterations) {
180 iterations = atoi(v);
204 if (iterations < 100) {
205 printf("Number of iterations cannot be less than 100\n");
219 printf("Running %d iterations\n", iterations)
[all...] |
| /external/ltp/testcases/realtime/func/pi_perf/ |
| pi_perf.c | 70 static unsigned int iterations = DEF_ITERATIONS; variable
89 printf(" -iNUMBER Number of iterations. Default = %d\n",
102 iterations = atoi(v);
138 stats_container_init(&low_dat, iterations);
142 for (i = 0; i < iterations; i++) {
161 if (i == iterations - 1)
176 stats_container_init(&cpu_delay_dat, iterations);
178 stats_quantiles_init(&cpu_delay_quantiles, (int)log10(iterations));
182 for (i = 0; i < iterations; i++) {
236 if (iterations < 100)
[all...] |
| /external/autotest/client/deps/glbench/src/ |
| testbase.cc | 28 uint64_t TimeTest(TestBase* test, uint64_t iterations) {
32 if (!test->TestFunc(iterations))
47 // the marginal cost, so we try more and more iterations until we reach the
69 // Do two iterations because initial timings can vary wildly.
75 uint64_t iterations = 1; local
80 time = TimeTest(test, iterations);
81 dbg_printf("iterations: %llu: time: %llu time/iter: %llu\n",
82 iterations, time, time / iterations);
89 (iterations + iterations_prev))
[all...] |
| /external/lisa/tests/benchmarks/ |
| android_jankbench.py | 25 def __init__(self, governor, test, iterations):
28 self.iterations = iterations
41 'iterations' : self.iterations,
98 iterations = 1 variable
124 JankbenchTest(governor, test, iterations)
|
| android_uibench.py | 24 def __init__(self, governor, test, iterations):
27 self.iterations = iterations
40 'iterations' : self.iterations,
96 iterations = 10 variable
135 UiBenchTest(governor, test, iterations)
|
| /external/wayland/tests/ |
| array-test.c | 69 const unsigned int iterations = 1321; /* this is arbitrary */ local
77 for (i = 0; i < iterations; i++) {
89 for (i = 0; i < iterations; ++i) {
104 const int iterations = 1529; /* this is arbitrary */ local
112 for (i = 0; i < iterations; i++) {
123 for (i = 0; i < iterations; i++) {
|
| /tools/test/connectivity/acts/tests/google/bt/system_tests/ |
| RfcommStressTest.py | 71 iterations = 1000
72 for n in range(iterations):
106 iterations = 1000
107 for n in range(iterations):
144 iterations = 1000
147 for n in range(iterations):
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/util/ |
| TestUtilities.java | 33 int iterations = 1000; local
44 timeAndCompare(ts1, ts2, iterations, true, .75);
47 timeAndCompare(ts1, ts2, iterations, true, .75);
48 timeAndCompare(ts2, ts1, iterations*100, false, 1.05);
51 private void timeAndCompare(TreeSet ts1, TreeSet ts2, int iterations, boolean expected, double factorOfStandard) {
52 double utilityTimeSorted = timeUtilityContainsAll(iterations, ts1, ts2, expected)/(double)iterations;
53 double standardTimeSorted = timeStandardContainsAll(iterations, ts1, ts2, expected)/(double)iterations;
62 private long timeStandardContainsAll(int iterations, Set hs1, Set hs2, boolean expected)
[all...] |
| /external/icu/icu4j/main/tests/translit/src/com/ibm/icu/dev/test/util/ |
| TestUtilities.java | 30 int iterations = 1000; local
41 timeAndCompare(ts1, ts2, iterations, true, .75);
44 timeAndCompare(ts1, ts2, iterations, true, .75);
45 timeAndCompare(ts2, ts1, iterations*100, false, 1.05);
48 private void timeAndCompare(TreeSet ts1, TreeSet ts2, int iterations, boolean expected, double factorOfStandard) {
49 double utilityTimeSorted = timeUtilityContainsAll(iterations, ts1, ts2, expected)/(double)iterations;
50 double standardTimeSorted = timeStandardContainsAll(iterations, ts1, ts2, expected)/(double)iterations;
59 private long timeStandardContainsAll(int iterations, Set hs1, Set hs2, boolean expected)
[all...] |
| /external/ltp/testcases/realtime/func/sched_latency/ |
| sched_latency.c | 57 //#define ITERATIONS 100
69 static int iterations = 0; variable
86 printf(" -iITERATIONS number of iterations (default %d)\n",
102 iterations = atoi(v);
140 for (i = 0; i < iterations; i++) {
205 if (i != iterations) {
236 printf("Failed Iterations: %d\n", failures);
259 if (iterations == 0)
260 iterations = DEFAULT_ITERATIONS;
261 if (iterations < MIN_ITERATIONS)
[all...] |
