/external/chromium_org/cc/animation/ |
H A D | animation_unittest.cc | 14 scoped_ptr<Animation> CreateAnimation(int iterations, double duration) { argument 21 to_return->set_iterations(iterations); 25 scoped_ptr<Animation> CreateAnimation(int iterations) { argument 26 return CreateAnimation(iterations, 1);
|
/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/chromium/crypto/ |
H A D | symmetric_key_openssl.cc | 46 size_t iterations, 58 salt.length(), iterations, 43 DeriveKeyFromPassword(Algorithm algorithm, const std::string& password, const std::string& salt, size_t iterations, size_t key_size_in_bits) argument
|
H A D | symmetric_key_nss.cc | 42 size_t iterations, 45 if (salt.empty() || iterations == 0 || key_size_in_bits == 0) 66 iterations, 39 DeriveKeyFromPassword(Algorithm algorithm, const std::string& password, const std::string& salt, size_t iterations, size_t key_size_in_bits) argument
|
/external/chromium_org/crypto/ |
H A D | symmetric_key_openssl.cc | 46 size_t iterations, 61 salt.length(), iterations, 43 DeriveKeyFromPassword(Algorithm algorithm, const std::string& password, const std::string& salt, size_t iterations, size_t key_size_in_bits) argument
|
H A D | ec_private_key_openssl.cc | 50 int iterations, 48 ExportEncryptedPrivateKey( const std::string& password, int iterations, std::vector<uint8>* output) argument
|
H A D | symmetric_key_nss.cc | 42 size_t iterations, 45 if (salt.empty() || iterations == 0 || key_size_in_bits == 0) 66 iterations, 39 DeriveKeyFromPassword(Algorithm algorithm, const std::string& password, const std::string& salt, size_t iterations, size_t key_size_in_bits) argument
|
/external/chromium_org/native_client_sdk/src/libraries/third_party/pthreads-win32/ |
H A D | ptw32_callUserDestroyRoutines.c | 84 int iterations = 0; local 96 iterations++; 171 if (value != NULL && iterations <= PTHREAD_DESTRUCTOR_ITERATIONS)
|
/external/chromium_org/tools/page_cycler/database/ |
H A D | head.js | 9 var iterations; variable 68 if (cycle == iterations) { 79 var url = doc + '?n=' + iterations + '&i=' + cycle + 105 iterations = f[1];
|
/external/chromium_org/tools/page_cycler/indexed_db/ |
H A D | head.js | 9 var iterations; variable 68 if (cycle == iterations) { 79 var url = doc + '?n=' + iterations + '&i=' + cycle + 105 iterations = f[1];
|
/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/netperf/ |
H A D | netcpu_none.c | 46 calibrate_idle_rate(int iterations, int interval) argument
|
H A D | netcpu_osx.c | 97 calibrate_idle_rate(int iterations, int interval) argument
|
H A D | netcpu_sysctl.c | 94 calibrate_idle_rate(int iterations, int interval) argument
|
/external/valgrind/main/drd/tests/ |
H A D | pth_barrier.c | 30 int iterations; member in struct:threadinfo 45 /** Single thread, which touches p->iterations elements of array p->array. 55 for (i = 0; i < p->iterations; i++) 67 static void barriers_and_races(const int nthread, const int iterations) argument 76 array = malloc(iterations * sizeof(array[0])); 91 t[i].iterations = iterations; 116 int iterations; local 119 iterations = (argc > 2) ? atoi(argv[2]) : 3; 122 barriers_and_races(nthread, iterations); [all...] |
H A D | annotate_barrier.c | 46 int iterations; member in struct:threadinfo 102 * Single thread, which touches p->iterations elements of array p->array. 113 for (i = 0; i < p->iterations; i++) 125 static void barriers_and_races(const int nthread, const int iterations) argument 134 array = malloc(iterations * sizeof(array[0])); 146 t[i].iterations = iterations; 163 int iterations; local 166 iterations = (argc > 2) ? atoi(argv[2]) : 3; 169 barriers_and_races(nthread, iterations); [all...] |
/external/chromium_org/third_party/mesa/src/src/glsl/ |
H A D | loop_unroll.cpp | 90 int iterations; local 100 iterations = ls->max_iterations; 102 /* Don't try to unroll loops where the number of iterations is not known 105 if (iterations < 0) 108 /* Don't try to unroll loops that have zillions of iterations either. 110 if (iterations > (int) max_iterations) 117 if (count.fail || count.nodes * iterations > (int)max_iterations * 5) 132 iterations = 1; 195 for (int i = 0; i < iterations; i++) { 226 for (int i = 0; i < iterations; [all...] |
/external/chromium_org/webkit/renderer/compositor_bindings/ |
H A D | web_animation_impl.cc | 63 int WebAnimationImpl::iterations() const { return animation_->iterations(); } function in class:webkit::WebAnimationImpl
|
/external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/heightmap/ |
H A D | HillHeightMap.java | 49 private int iterations; // how many hills to generate
field in class:HillHeightMap 60 * @param iterations
71 * iterations is not greater that zero
73 public HillHeightMap(int size, int iterations, float minRadius,
argument 75 if (size <= 0 || iterations <= 0 || minRadius <= 0 || maxRadius <= 0
79 + "or number of iterations is not greater that zero, "
87 this.iterations = iterations;
100 * @param iterations
109 * iterations i 111 HillHeightMap(int size, int iterations, float minRadius, float maxRadius) argument 219 setIterations(int iterations) argument [all...] |
/external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/noise/filter/ |
H A D | IterativeFilter.java | 40 private int iterations;
field in class:IterativeFilter 58 return this.iterations * margin + super.getMargin(size, margin);
61 public void setIterations(int iterations) {
argument 62 this.iterations = iterations;
66 return this.iterations;
90 for (int i = 0; i < this.iterations; i++) {
|
/external/mesa3d/src/glsl/ |
H A D | loop_unroll.cpp | 90 int iterations; local 100 iterations = ls->max_iterations; 102 /* Don't try to unroll loops where the number of iterations is not known 105 if (iterations < 0) 108 /* Don't try to unroll loops that have zillions of iterations either. 110 if (iterations > (int) max_iterations) 117 if (count.fail || count.nodes * iterations > (int)max_iterations * 5) 132 iterations = 1; 195 for (int i = 0; i < iterations; i++) { 226 for (int i = 0; i < iterations; [all...] |
/external/openfst/src/test/ |
H A D | weight-tester.h | 39 void Test(int iterations, bool test_division = true) { argument 40 for (int i = 0; i < iterations; ++i) {
|
/external/smack/src/org/xbill/DNS/ |
H A D | NSEC3PARAMRecord.java | 12 * algorithm, salt, iterations) used for a valid, complete NSEC3 chain present 27 private int iterations; field in class:NSEC3PARAMRecord 44 * @param iterations The number of hash iterations. 48 int flags, int iterations, byte [] salt) 53 this.iterations = checkU16("iterations", iterations); 70 iterations = in.readU16(); 83 out.writeU16(iterations); 47 NSEC3PARAMRecord(Name name, int dclass, long ttl, int hashAlg, int flags, int iterations, byte [] salt) argument [all...] |