Searched defs:primes (Results 1 - 11 of 11) sorted by last modified time
/external/valgrind/main/coregrind/ |
H A D | m_hashtable.c | 55 static SizeT primes[N_HASH_PRIMES] = { variable 70 SizeT n_chains = primes[0]; 97 /* If we've run out of primes, do nothing. */ 98 if (old_chains == primes[N_HASH_PRIMES-1]) 101 vg_assert(old_chains >= primes[0] 102 && old_chains < primes[N_HASH_PRIMES-1]); 105 if (primes[i] > new_chains) { 106 new_chains = primes[i]; 112 vg_assert(new_chains > primes[0] 113 && new_chains <= primes[N_HASH_PRIME [all...] |
/external/valgrind/main/drd/tests/ |
H A D | omp_prime.c | 44 int* primes; local 78 primes = malloc(n * sizeof(primes[0])); 96 primes[total] = i; 106 printf("%d\n", primes[i]); 111 free(primes);
|
/external/openssl/crypto/bn/ |
H A D | bn_prime.h | 66 static const prime_t primes[NUMPRIMES]= variable
|
H A D | bntest.c | 1762 unsigned primes[8] = { 2, 3, 5, 7, 11, 13, 17, 19 }; local 1764 if (!BN_set_word(p, primes[i])) goto err;
|
/external/ltrace/ |
H A D | dict.c | 320 static const size_t primes[] = { variable 329 return primes[0]; 331 if (current < primes[sizeof(primes)/sizeof(*primes) - 2]) { 333 for (i = 0; primes[i] != 0; ++i) 334 if (primes[i] > current) 335 return primes[i]; 339 /* We ran out of primes, so invent a new one. The following 340 * gives primes unti [all...] |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | com.ibm.icu_4.2.1.v20100412.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
/external/chromium_org/third_party/boringssl/src/crypto/bn/ |
H A D | bn_test.c | 1202 unsigned primes[8] = {2, 3, 5, 7, 11, 13, 17, 19}; local 1204 if (!BN_set_word(p, primes[i]))
|
H A D | prime.c | 134 /* The quick sieve algorithm approach to weeding out primes is Philip 138 /* NUMPRIMES is the number of primes that fit into a uint16_t. */ 141 /* primes is defined at the bottom of the file and contains all the primes that 143 static const uint16_t primes[NUMPRIMES]; variable 312 if (BN_mod_word(a, primes[i]) == 0) { 460 BN_ULONG maxdelta = BN_MASK2 - primes[NUMPRIMES - 1]; 470 mods[i] = (uint16_t)BN_mod_word(rnd, (BN_ULONG)primes[i]); 488 * 1) It's greater than primes[i] because we shouldn't reject 493 * primes becaus 653 static const uint16_t primes[NUMPRIMES] = { variable [all...] |
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9/ |
H A D | bitops-nsieve-bits.js | 12 function primes(isPrime, n) { function 28 primes(isPrime, i);
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/ |
H A D | bitops-nsieve-bits.js | 12 function primes(isPrime, n) { function 28 primes(isPrime, i);
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-1.0/ |
H A D | bitops-nsieve-bits.js | 12 function primes(isPrime, n) { function 28 primes(isPrime, i);
|
Completed in 406 milliseconds