/external/autotest/client/deps/glbench/src/ |
H A D | swaptest.cc | 18 virtual bool TestFunc(uint64_t iterations); 25 bool SwapTest::TestFunc(uint64_t iterations) { argument 26 for (uint64_t i = 0 ; i < iterations; ++i) {
|
H A D | texturereusetest.cc | 6 // It uploads a series of textures initially. On subsequent iterations, it uses 20 virtual bool TestFunc(uint64_t iterations); 25 bool TextureReuseTest::TestFunc(uint64_t iterations) { argument 31 for (uint64_t i = 0; i < iterations; ++i) {
|
H A D | textureupdatetest.cc | 19 virtual bool TestFunc(uint64_t iterations); 24 bool TextureUpdateTest::TestFunc(uint64_t iterations) { argument 30 for (uint64_t i = 0; i < iterations; ++i) {
|
H A D | textureuploadtest.cc | 18 virtual bool TestFunc(uint64_t iterations); 23 bool TextureUploadTest::TestFunc(uint64_t iterations) { argument 26 for (uint64_t i = 0; i < iterations; ++i) {
|
H A D | cleartest.cc | 16 virtual bool TestFunc(uint64_t iterations); 28 bool ClearTest::TestFunc(uint64_t iterations) { argument 32 for (uint64_t i = 0; i < iterations - 1; ++i) {
|
H A D | contexttest.cc | 26 virtual bool TestFunc(uint64_t iterations); 33 bool ContextTest::TestFunc(uint64_t iterations) { argument 46 for (uint64_t i = 0 ; i < iterations; ++i) {
|
H A D | readpixeltest.cc | 20 virtual bool TestFunc(uint64_t iterations); 32 bool ReadPixelTest::TestFunc(uint64_t iterations) { argument 35 for (uint64_t i = 0; i < iterations - 1; i++)
|
/external/libbrillo/brillo/message_loops/ |
H A D | message_loop_utils.cc | 29 int MessageLoopRunMaxIterations(MessageLoop* loop, int iterations) { argument 31 for (result = 0; result < iterations && loop->RunOnce(false); result++) {}
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/pkcs/ |
H A D | PBEParameter.java | 17 ASN1Integer iterations; field in class:PBEParameter 22 int iterations) 29 this.iterations = new ASN1Integer(iterations); 36 iterations = (ASN1Integer)seq.getObjectAt(1); 56 return iterations.getValue(); 69 v.add(iterations); 20 PBEParameter( byte[] salt, int iterations) argument
|
H A D | PKCS12PBEParams.java | 17 ASN1Integer iterations; field in class:PKCS12PBEParams 22 int iterations) 25 this.iterations = new ASN1Integer(iterations); 32 iterations = ASN1Integer.getInstance(seq.getObjectAt(1)); 52 return iterations.getValue(); 65 v.add(iterations); 20 PKCS12PBEParams( byte[] salt, int iterations) argument
|
/external/eigen/bench/ |
H A D | basicbenchmark.h | 8 void benchBasic_loop(const MatrixType& I, MatrixType& m, int iterations) __attribute__((noinline)); 11 void benchBasic_loop(const MatrixType& I, MatrixType& m, int iterations) argument 13 for(int a = 0; a < iterations; a++) 41 double benchBasic(const MatrixType& mat, int iterations, int tries) argument 56 benchBasic_loop<Mode>(I, m, iterations);
|
/external/eigen/bench/btl/generic_bench/timers/ |
H A D | STL_timer.hh | 37 iterations.clear(); 38 iterations.reserve(reps); 53 iterations.push_back(count); 57 return (iterations.size() < reps); 62 sort(iterations.begin(), iterations.end()); 63 return 1.0/iterations[reps/2]; 67 // For storing loop iterations of a trial 68 vector<long> iterations; member in class:STL_Timer 71 // For counting loop iterations o [all...] |
/external/libchrome/crypto/ |
H A D | symmetric_key.cc | 57 size_t iterations, 82 static_cast<unsigned>(iterations), 53 DeriveKeyFromPassword( Algorithm algorithm, const std::string& password, const std::string& salt, size_t iterations, size_t key_size_in_bits) argument
|
/external/linux-kselftest/tools/testing/selftests/sync/ |
H A D | sync_stress_parallelism.c | 35 int iterations; member in struct:__anon12314 44 int iterations = test_data_two_threads.iterations; local 47 for (i = 0; i < iterations; i++) { 84 test_data_two_threads.iterations = 1 << 16; 105 test_data_two_threads.iterations * 2,
|
/external/netperf/src/ |
H A D | netcpu_none.c | 40 calibrate_idle_rate(int iterations, int interval) argument
|
/external/vixl/benchmarks/aarch32/ |
H A D | bench-branch-link-masm.cc | 45 void benchmark(int iterations, InstructionSet isa) { argument 56 for (int i = 0; i < iterations; i++) { 60 for (int i = 0; i < iterations; i++) { 64 for (int i = 0; i < iterations; i++) { 68 for (int i = 0; i < iterations; i++) { 78 printf("%s: time for %d iterations: %gs\n", 80 iterations, 86 int iterations = 0; local 90 iterations = kDefaultIterationsCount; 93 iterations [all...] |
H A D | bench-branch-masm.cc | 44 void benchmark(int iterations, InstructionSet isa) { argument 54 for (int i = 0; i < iterations; i++) { 68 printf("%s: time for %d iterations: %gs\n", 70 iterations, 76 int iterations = 0; local 80 iterations = kDefaultIterationCount; 83 iterations = atoi(argv[1]); 86 printf("Usage: %s [#iterations]\n", argv[0]); 91 benchmark(iterations, A32); 94 benchmark(iterations, T3 [all...] |
/external/vixl/benchmarks/aarch64/ |
H A D | bench-branch-link-masm.cc | 39 int iterations = 0; local 43 iterations = kDefaultIterationsCount; 46 iterations = atoi(argv[1]); 49 printf("Usage: %s [#iterations]\n", argv[0]); 53 size_t base_buf_size = iterations * 4 * kInstructionSize; 61 for (int i = 0; i < iterations; i++) { 65 for (int i = 0; i < iterations; i++) { 69 for (int i = 0; i < iterations; i++) { 73 for (int i = 0; i < iterations; i++) { 84 printf("A64: time for %d iterations [all...] |
H A D | bench-branch-masm.cc | 43 int iterations = 0; local 47 iterations = kDefaultIterationCount; 50 iterations = atoi(argv[1]); 53 printf("Usage: %s [#iterations]\n", argv[0]); 68 for (int i = 0; i < iterations;) { 70 for (int j = 0; (j < max_buffer_iterations) && (i < iterations); ++j, ++i) { 86 printf("A64: time for %d iterations: %gs\n", iterations, delta);
|
/external/autotest/client/tests/tracing_microbenchmark/src/ |
H A D | getuid_microbench.c | 23 fprintf(stderr, "usage: %s <iterations>\n", cmd); 29 long iterations, i; local 37 iterations = atol(argv[1]); 38 if (iterations < 0) { 48 for (i = iterations; i; i--) 58 (double)iterations; 59 printf("%ld calls in %ld.%09ld s (%lf ns/call)\n", iterations,
|
/external/boringssl/src/crypto/evp/ |
H A D | 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, 65 PKCS5_PBKDF2_HMAC(const char *password, size_t password_len, const uint8_t *salt, size_t salt_len, unsigned iterations, const EVP_MD *digest, size_t key_len, uint8_t *out_key) argument 140 PKCS5_PBKDF2_HMAC_SHA1(const char *password, size_t password_len, const uint8_t *salt, size_t salt_len, unsigned iterations, size_t key_len, uint8_t *out_key) argument
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/ |
H A D | RSAKeyPairGenerator.java | 23 private int iterations; field in class:RSAKeyPairGenerator 28 this.iterations = getNumberOfIterations(this.param.getStrength(), this.param.getCertainty()); 197 return !Primes.hasAnySmallFactors(x) && Primes.isMRProbablePrime(x, param.getRandom(), iterations); 204 * certainty is higher than the FIPS 186-4 tables (C.2/C.3) cater to, extra iterations
|
/external/google-benchmark/src/ |
H A D | benchmark_api_internal.h | 31 size_t iterations; member in struct:benchmark::internal::Benchmark::Instance
|
/external/lisa/tests/benchmarks/ |
H A D | 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)
|
/external/ltp/testcases/kernel/syscalls/pselect/ |
H A D | pselect01.c | 41 unsigned int iterations; member in struct:tcase 65 * that the number of iteration is small. For large enoung number of iterations 68 static int compute_threshold(long long requested_us, unsigned int iterations) argument 72 return (250 + 2 * monotonic_resolution + slack_per_scall) * iterations 73 + (iterations > 1 ? 0 : 1500); 85 tst_res(TINFO, "pselect() sleeping for %li secs %li nsec %i iterations", 86 t->tv.tv_sec, t->tv.tv_nsec, t->iterations); 88 for (i = 0; i < t->iterations; i++) { 112 requested_us = tst_timespec_to_us(t->tv) * t->iterations; 113 threshold = compute_threshold(tst_timespec_to_us(t->tv), t->iterations); [all...] |