| /external/openssl/crypto/bn/ |
| bn_prime.h | 66 static const prime_t primes[NUMPRIMES]= variable
|
| bntest.c | 1762 unsigned primes[8] = { 2, 3, 5, 7, 11, 13, 17, 19 }; local
[all...] |
| /external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9/ |
| bitops-nsieve-bits.js | 12 function primes(isPrime, n) { function
28 primes(isPrime, i);
|
| /external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/ |
| bitops-nsieve-bits.js | 12 function primes(isPrime, n) { function
28 primes(isPrime, i);
|
| /external/apache-harmony/crypto/src/test/api/java/org/apache/harmony/crypto/tests/javax/crypto/spec/ |
| DHGenParameterSpecTest.java | 43 int[] primes = {Integer.MIN_VALUE, -1, 0, 1, Integer.MAX_VALUE}; local
45 for (int i=0; i<primes.length; i++) {
46 DHGenParameterSpec ps = new DHGenParameterSpec(primes[i],
50 ps.getPrimeSize(), primes[i]);
|
| /external/valgrind/main/drd/tests/ |
| 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);
|
| /libcore/luni/src/test/java/org/apache/harmony/crypto/tests/javax/crypto/spec/ |
| DHGenParameterSpecTest.java | 43 int[] primes = {Integer.MIN_VALUE, -1, 0, 1, Integer.MAX_VALUE}; local
45 for (int i=0; i<primes.length; i++) {
46 DHGenParameterSpec ps = new DHGenParameterSpec(primes[i],
50 ps.getPrimeSize(), primes[i]);
|
| /libcore/luni/src/main/java/java/math/ |
| Primality.java | 31 private static final int[] primes = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, field in class:Primality
47 private static final BigInteger BIprimes[] = new BigInteger[primes.length];
62 // * It encodes how many i-bit primes there are in the table for
71 static {// To initialize the dual table of BigInteger primes
72 for (int i = 0; i < primes.length; i++) {
73 BIprimes[i] = BigInteger.valueOf(primes[i]);
90 int[] modules = new int[primes.length];
96 if (l < primes[primes.length - 1]) {
97 for (i = 0; l >= primes[i]; i++) {
[all...] |
| /external/dropbear/libtommath/demo/ |
| timing.c | 206 char *primes[] = { local
211 /* 2K moduli mersenne primes */
242 for (n = 0; primes[n]; n++) {
244 mp_read_radix(&a, primes[n], 10);
|
| /external/dropbear/libtommath/etc/ |
| pprime.c | 1 /* Generates provable primes
11 FILE *primes; variable
41 /* write first set of primes */
152 primes = fopen("pprime.dat", "rb");
153 if (primes == NULL) {
155 primes = fopen("pprime.dat", "rb");
157 fseek(primes, 0, SEEK_END);
158 n_prime = ftell(primes) / sizeof(mp_digit);
167 fseek(primes, n * sizeof(mp_digit), SEEK_SET);
168 fread(&d, 1, sizeof(mp_digit), primes);
[all...] |
| /external/valgrind/main/coregrind/ |
| 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_PRIMES-1])
[all...] |
