/external/boringssl/src/crypto/des/ |
internal.h | 202 #define ITERATIONS 16
|
/frameworks/base/core/tests/coretests/src/android/util/ |
LogTest.java | 136 private static final int ITERATIONS = 1000; 148 intermediates.setInternalIterations(ITERATIONS * 10); 154 for (int i = ITERATIONS - 1; i >= 0; i--) {
|
/external/jmonkeyengine/engine/src/test/jme3test/app/ |
TestTempVars.java | 39 private static final int ITERATIONS = 10000000; 53 // for (int i = 0; i < ITERATIONS; i++) { 62 for (int i = 0; i < ITERATIONS; i++) { 71 for (int i = 0; i < ITERATIONS; i++) {
|
/external/valgrind/drd/tests/ |
annotate_sem.c | 17 #define ITERATIONS 1000 64 for (i = 0; i < ITERATIONS; i++) { 89 assert(s_counter == THREADS * ITERATIONS);
|
tsan_unittest.cpp | [all...] |
/libcore/luni/src/test/java/com/android/org/bouncycastle/crypto/digests/ |
DigestTest.java | 39 final int ITERATIONS = 100; 60 for (int j = 0; j < ITERATIONS; j++) { 86 System.out.println("Time for " + ITERATIONS + " x old hash processing: " + oldTime + " ms"); 87 System.out.println("Time for " + ITERATIONS + " x new hash processing: " + newTime + " ms");
|
/libcore/luni/src/test/java/libcore/javax/crypto/ |
SecretKeyFactoryTest.java | 38 * The number of iterations should be higher for production 42 private static final int ITERATIONS = 1024; 74 KeySpec ks = new PBEKeySpec(null, SALT, ITERATIONS); 80 KeySpec ks = new PBEKeySpec(new char[0], SALT, ITERATIONS); 86 KeySpec ks = new PBEKeySpec(PASSWORD, SALT, ITERATIONS); 93 KeySpec ks = new PBEKeySpec(null, SALT, ITERATIONS, KEY_LENGTH); 100 KeySpec ks = new PBEKeySpec(new char[0], SALT, ITERATIONS, KEY_LENGTH); 106 KeySpec ks = new PBEKeySpec(PASSWORD, SALT, ITERATIONS, KEY_LENGTH); 117 test_PBKDF2_UTF8(PASSWORD, SALT, ITERATIONS, KEY_LENGTH, expected); 118 test_PBKDF2_8BIT(PASSWORD, SALT, ITERATIONS, KEY_LENGTH, expected) 132 int iterations = 5; local 154 int iterations = 500; local 175 int iterations = 4096; local [all...] |
/cts/tests/tests/hardware/src/android/hardware/cts/ |
SensorIntegrationTests.java | 67 final int ITERATIONS = 50; 86 operation.add(new RepeatingSensorOperation(continuousOperation, ITERATIONS)); 98 operation.add(new RepeatingSensorOperation(batchingOperation, ITERATIONS));
|
/external/guava/guava-gwt/test-super/com/google/common/util/concurrent/super/com/google/common/util/concurrent/ |
AtomicLongMapTest.java | 36 private static final int ITERATIONS = 100; 57 for (int i = 0; i < ITERATIONS; i++) { 67 assertEquals(ITERATIONS, (int) map.get(key)); 90 for (int i = 0; i < ITERATIONS; i++) { 100 assertEquals(ITERATIONS, (int) map.get(key)); 123 for (int i = 0; i < ITERATIONS; i++) { 133 assertEquals(-1 * ITERATIONS, (int) map.get(key)); 156 for (int i = 0; i < ITERATIONS; i++) { 166 assertEquals(-1 * ITERATIONS, (int) map.get(key)); 190 for (int i = 0; i < ITERATIONS; i++) [all...] |
/external/icu/icu4c/source/tools/ctestfw/ |
uperf.cpp | 38 "\t-i or --iterations Number of iterations to be performed. Requires Numeric argument\n" 40 "\t Cannot be used with --iterations\n" 56 ITERATIONS, 74 UOPTION_DEF( "iterations", 'i', UOPT_REQUIRES_ARG), 89 passes(1), iterations(0), time(0), 105 passes(1), iterations(0), time(0), 161 if(options[ITERATIONS].doesOccur) { 162 iterations = atoi(options[ITERATIONS].value) [all...] |
/frameworks/base/graphics/tests/graphicstests/src/android/graphics/ |
GraphicsPerformanceTests.java | 76 /** Number of iterations to pass back to harness. Subclass should override */ 98 // Ask subclass for number of iterations 161 private static final int ITERATIONS = 1000; 175 return ITERATIONS; 186 for (int i = 0; i < ITERATIONS; i++) { 192 for (int i = 0; i < ITERATIONS; i++) {
|
/frameworks/base/media/tests/MediaFrameworkTest/src/com/android/mediaframeworktest/functional/audio/ |
MediaAudioManagerTest.java | 210 //Test case 4: test audio focus registering and use over 3000 iterations 213 final int ITERATIONS = 3000; 216 for (int i = 0 ; i < ITERATIONS ; i++) { 224 assertTrue("testAudioFocusListenerLifeCycle : tested" + ITERATIONS +" iterations", true); 230 final int ITERATIONS = 1000; 236 for (int i = 0 ; i < ITERATIONS ; i++) { 246 mAudioFocusListener.mFocusChangeCounter == ITERATIONS * 2);
|
/frameworks/native/opengl/tests/gl_basic/ |
gl_basic.cpp | 24 #define ITERATIONS 50
|
/frameworks/native/opengl/tests/tritex/ |
tritex.cpp | 2 // ITERATIONS. Should draw a checkerboard on the screen after 26 #define ITERATIONS 50
114 render(argc==2 ? atoi(argv[1]) : ITERATIONS);
|
/frameworks/rs/java/tests/RsBLAS_Benchmark/src/com/example/android/rs/blasbenchmark/ |
BlasTest.java | 39 private final String ITERATIONS = "Iterations"; 110 results.putInt(ITERATIONS, mIteration);
|
/external/guava/guava-tests/test/com/google/common/util/concurrent/ |
AtomicLongMapTest.java | 42 private static final int ITERATIONS = 100; 72 for (int i = 0; i < ITERATIONS; i++) { 82 assertEquals(ITERATIONS, (int) map.get(key)); 105 for (int i = 0; i < ITERATIONS; i++) { 115 assertEquals(ITERATIONS, (int) map.get(key)); 138 for (int i = 0; i < ITERATIONS; i++) { 148 assertEquals(-1 * ITERATIONS, (int) map.get(key)); 171 for (int i = 0; i < ITERATIONS; i++) { 181 assertEquals(-1 * ITERATIONS, (int) map.get(key)); 205 for (int i = 0; i < ITERATIONS; i++) [all...] |
/external/valgrind/memcheck/tests/ |
vcpu_fbench.c | 100 normalised as if run for 1000 iterations. 306 #ifndef ITERATIONS 307 #define ITERATIONS /*1000*/ /*500000*/ 100 309 int niter = ITERATIONS; /* Iteration counter */ 723 /* Process the number of iterations argument, if one is supplied. */ 731 printf("where <itercount> is the number of iterations\n"); 752 printf("and performance benchmark. %d iterations will be made.\n\n",
|
/external/valgrind/perf/ |
fbench.c | 96 normalised as if run for 1000 iterations. 302 #ifndef ITERATIONS 303 #define ITERATIONS /*1000*/ /*500000*/ 80000 305 int niter = ITERATIONS; /* Iteration counter */ 719 /* Process the number of iterations argument, if one is supplied. */ 727 printf("where <itercount> is the number of iterations\n"); 748 printf("and performance benchmark. %d iterations will be made.\n\n",
|
/external/icu/icu4c/source/test/perf/howExpensiveIs/ |
howExpensiveIs.cpp | 28 #ifndef ITERATIONS 29 #define ITERATIONS 5 63 fprintf(stderr, "** Standard sieve time: %.9fs +/- %.9fs (%d iterations)\n", s,m, (int)U_LOTS_OF_TIMES); 154 * @return number of iterations 172 double times[ITERATIONS]; 174 for(int i=0;i<ITERATIONS;i++) { 177 fprintf(stderr, "trial: %d/%d = %.9fs\n", i, ITERATIONS,times[i]); 181 uint32_t iterations = ITERATIONS; local 182 *subTime = uprv_getMeanTime(times,&iterations,marginOfError) [all...] |
/frameworks/opt/calendar/tests/src/com/android/calendarcommon2/ |
RecurrenceProcessorTest.java | [all...] |
/frameworks/rs/java/tests/ImageProcessing/src/com/android/rs/image/ |
ImageProcessingTest.java | 38 private final String ITERATIONS = "Iterations"; 109 results.putInt(ITERATIONS, mIteration);
|
/frameworks/rs/java/tests/ImageProcessing_jb/src/com/android/rs/image/ |
ImageProcessingTest.java | 39 private final String ITERATIONS = "Iterations"; 124 results.putInt(ITERATIONS, mIteration);
|
/external/icu/icu4j/main/tests/translit/src/com/ibm/icu/dev/test/util/ |
TestUtilities.java | 37 static final int ITERATIONS = 1000000; 56 for (int counter = 0; counter < ITERATIONS; ++counter) { 142 int iterations = 1000; local 153 timeAndCompare(ts1, ts2, iterations, true, .75); 156 timeAndCompare(ts1, ts2, iterations, true, .75); 157 timeAndCompare(ts2, ts1, iterations*100, false, 1.05); 160 private void timeAndCompare(TreeSet ts1, TreeSet ts2, int iterations, boolean expected, double factorOfStandard) { 161 double utilityTimeSorted = timeUtilityContainsAll(iterations, ts1, ts2, expected)/(double)iterations; 162 double standardTimeSorted = timeStandardContainsAll(iterations, ts1, ts2, expected)/(double)iterations [all...] |
/system/extras/tests/net_test/ |
multinetwork_test.py | 286 ITERATIONS = 5 364 for _ in xrange(self.ITERATIONS): 458 for _ in xrange(self.ITERATIONS): 500 for _ in xrange(self.ITERATIONS): [all...] |