| /external/openssl/crypto/bn/ |
| bn_prime.h | 66 static const prime_t primes[NUMPRIMES]= variable
|
| bn_prime.pl | 7 push(@primes,2);
9 loop: while ($#primes < $num-1)
14 for ($i=0; defined($primes[$i]) && $primes[$i]<=$s; $i++)
16 next loop if (($p%$primes[$i]) == 0);
18 push(@primes,$p);
93 for ($i=0; $i <= $#primes; $i++)
95 if ($primes[$i] > 256)
109 print "static const prime_t primes[NUMPRIMES]=\n\t{\n\t";
111 for ($i=0; $i <= $#primes; $i++
[all...] |
| bn_prime.c | 123 /* The quick sieve algorithm approach to weeding out primes is
266 if (BN_mod_word(a, primes[i]) == 0)
387 mods[i]=(prime_t)BN_mod_word(rnd,(BN_ULONG)primes[i]);
388 maxdelta=BN_MASK2 - primes[NUMPRIMES-1];
393 * that gcd(rnd-1,primes) == 1 (except for 2) */
394 if (((mods[i]+delta)%primes[i]) <= 1)
431 if (BN_mod_word(rnd,(BN_ULONG)primes[i]) <= 1)
480 * gcd(p-1,primes) == 1 (except for 2) */
481 if ( (BN_mod_word(p,(BN_ULONG)primes[i]) == 0) ||
482 (BN_mod_word(q,(BN_ULONG)primes[i]) == 0)
[all...] |
| bntest.c | 1762 unsigned primes[8] = { 2, 3, 5, 7, 11, 13, 17, 19 }; local
[all...] |
| /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/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]);
|
| /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]);
|
| /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);
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9/ |
| 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/ |
| 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/ |
| bitops-nsieve-bits.js | 12 function primes(isPrime, n) { function
28 primes(isPrime, i);
|
| /libcore/luni/src/test/java/libcore/java/math/ |
| BigIntegerTest.java | 121 int[] primes = new int[1024]; local
124 for (int rep = 0; rep < primes.length; ++rep) { // Manual flakiness protection for random tests.
128 primes[rep] = b.intValue();
130 for (int i = 0; i < primes.length; ++i) {
131 if (primes[i] == 2) {
133 } else if (primes[i] == 3) {
|
| /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...] |
| /external/chromium_org/v8/test/mjsunit/ |
| apply.js | 144 var primes = new Array(0);
147 for (var d = 0; d < primes.length; d++) {
148 var p = primes[d];
159 primes.push(i);
163 assertEquals(1229, primes.length);
165 var same_primes = Array.prototype.constructor.apply(Array, primes);
167 for (var i = 0; i < primes.length; i++)
168 assertEquals(primes[i], same_primes[i], "prime" + primes[i]);
169 assertEquals(primes.length, same_primes.length, "prime-length")
[all...] |
| /external/ltrace/ |
| 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 until about 17M elements (and then some mor
[all...] |
| /external/chromium_org/third_party/boringssl/src/crypto/bn/ |
| 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 because there aren't many small primes wher
653 static const uint16_t primes[NUMPRIMES] = { variable
[all...] |
| bn_test.c | 1202 unsigned primes[8] = {2, 3, 5, 7, 11, 13, 17, 19}; local
1204 if (!BN_set_word(p, primes[i]))
|
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/ |
| math_semantic_attr.js | 101 this.primes =
857 {set: this.primes,
[all...] |
| /prebuilts/tools/common/m2/repository/com/ibm/icu/icu4j/2.6.1/ |
| icu4j-2.6.1.jar | |
| /external/chromium_org/chrome/third_party/chromevox/ |
| chromeVoxChromeBackgroundScript.js | [all...] |
| chromeVoxChromeOptionsScript.js | [all...] |
| chromeVoxChromePageScript.js | [all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| com.ibm.icu_4.2.1.v20100412.jar | |
| /prebuilts/misc/common/icu4j/ |
| icu4j.jar | |
