| /external/python/cpython2/Demo/scripts/ |
| D | primes.py | 5 def primes(min, max): function
8 primes = [2]
11 for p in primes:
15 primes.append(i)
27 primes(min, max)
|
| D | README | 18 primes.py Print prime numbers
|
| /external/valgrind/drd/tests/ |
| D | omp_prime.c | 44 int* primes; in main() local
78 primes = malloc(n * sizeof(primes[0])); in main()
96 primes[total] = i; in main()
106 printf("%d\n", primes[i]); in main()
111 free(primes); in main()
|
| /external/tpm2/ |
| D | RSAKeySieve.c | 370 UINT32 primes // IN: the table length in PrimeInit() argument
375 iter->final = AdjustNumberOfPrimes(primes); in PrimeInit()
457 UINT32 primes // IN: the number of primes to use in PrimeSieve() argument
476 primes = AdjustNumberOfPrimes(primes); in PrimeSieve()
509 PrimeInit(7, &iter, primes); in PrimeSieve()
570 UINT16 primes // IN: number of primes to use. in PrimeSelectWithSieve() argument
580 UINT32 primes; in PrimeSelectWithSieve() local
584 primes = BN_num_bits(bnP); in PrimeSelectWithSieve()
585 if(primes <= 512) in PrimeSelectWithSieve()
587 primes = AdjustNumberOfPrimes(2048); in PrimeSelectWithSieve()
[all …]
|
| D | RSAKeySieve_fp.h | 24 UINT16 primes, // IN: number of primes to test
|
| D | RSAData.c | 583 const __int16 primes[NUM_PRIMES]= variable
|
| D | RSAKeySieve.h | 83 extern const __int16 primes[NUM_PRIMES];
|
| /external/boringssl/src/crypto/fipsmodule/bn/ |
| D | prime.c | 123 static const uint16_t primes[NUMPRIMES] = { variable
503 BN_ULONG mod = BN_mod_word(a, primes[i]); in BN_is_prime_fasttest_ex()
508 return BN_is_word(a, primes[i]); in BN_is_prime_fasttest_ex()
683 BN_ULONG maxdelta = BN_MASK2 - primes[NUMPRIMES - 1]; in probable_prime()
693 BN_ULONG mod = BN_mod_word(rnd, (BN_ULONG)primes[i]); in probable_prime()
728 for (i = 1; i < NUMPRIMES && primes[i] < rnd_word; i++) { in probable_prime()
729 if ((mods[i] + delta) % primes[i] == 0) { in probable_prime()
741 if (((mods[i] + delta) % primes[i]) <= 1) { in probable_prime()
797 BN_ULONG mod = BN_mod_word(rnd, (BN_ULONG)primes[i]); in probable_prime_dh()
873 BN_ULONG pmod = BN_mod_word(p, (BN_ULONG)primes[i]); in probable_prime_dh_safe()
[all …]
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| D | CalendarCache.java | 79 if (pIndex < primes.length - 1) { in rehash()
80 arraySize = primes[++pIndex]; in rehash()
113 static private final int primes[] = { // 5, 17, 31, 47, // for testing field in CalendarCache
120 private int arraySize = primes[pIndex];
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| D | CalendarCache.java | 77 if (pIndex < primes.length - 1) { in rehash()
78 arraySize = primes[++pIndex]; in rehash()
111 static private final int primes[] = { // 5, 17, 31, 47, // for testing field in CalendarCache
118 private int arraySize = primes[pIndex];
|
| /external/valgrind/coregrind/ |
| D | m_hashtable.c | 57 static const SizeT primes[N_HASH_PRIMES] = { variable
72 SizeT n_chains = primes[0]; in VG_()
100 if (old_chains == primes[N_HASH_PRIMES-1]) in resize()
103 vg_assert(old_chains >= primes[0] in resize()
104 && old_chains < primes[N_HASH_PRIMES-1]); in resize()
107 if (primes[i] > new_chains) { in resize()
108 new_chains = primes[i]; in resize()
114 vg_assert(new_chains > primes[0] in resize()
115 && new_chains <= primes[N_HASH_PRIMES-1]); in resize()
|
| /external/testng/src/test/java/test/testng387/ |
| D | FailedDPTest.java | 20 static final List<Integer> primes = Arrays.asList(2, 3, 5, 7); field in FailedDPTest
40 if (primes.contains(i)){ in isNotPrime()
|
| D | TestNG387.java | 27 assertEqualsNoOrder(failed.toArray(), FailedDPTest.primes.toArray()); in testInvocationCounterIsCorrectForMethodWithDataProvider()
|
| /external/openssh/ |
| D | Makefile.in | 362 echo "moving $(DESTDIR)$(sysconfdir)/primes to $(DESTDIR)$(sysconfdir)/moduli"; \
363 mv "$(DESTDIR)$(sysconfdir)/primes" "$(DESTDIR)$(sysconfdir)/moduli"; \
|
| D | ssh-keygen.0 | 152 Generate candidate primes for DH-GEX. These primes must be
322 Test DH group exchange candidate primes (generated using the -G
376 process: first, candidate primes are generated using a fast, but memory
377 intensive process. These candidate primes are then tested for
380 Generation of primes is performed using the -G option. The desired
381 length of the primes may be specified by the -b option. For example:
385 By default, the search for primes begins at a random point in the desired
|
| D | moduli.0 | 31 are Sophie Germain primes (type 4). Further primality
|
| D | ChangeLog | 4619 Remove fallback from moduli to "primes" file that was
4620 deprecated in 2001 and fix log messages referring to primes file. Based on
|
| /external/wycheproof/doc/ |
| D | dh.md | 49 [Eurocrypt92 panel]. A. Lenstra pointed out that the primes chould be chosen
55 feasible [FGHT16]. Moreover some libraries use primes that are susceptible to
60 that weak primes (such as the one used in libtomcrypt) are detected.
|
| /external/valgrind/auxprogs/ |
| D | Makefile.am | 23 primes.c
|
| D | Makefile.in | 604 primes.c
|
| /external/python/cpython2/Doc/tutorial/ |
| D | stdlib.rst | 56 ['primes.py', 'random.py', 'quote.py']
|
| /external/openssh/contrib/redhat/ |
| D | openssh.spec | 484 - replace primes with moduli
|
| /external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/pkb/fr-FR/ |
| D | fr-FR_klex.pkb | 588 primauté3primezprimes.primo%C2<@!Bprinces4
|
| /external/libcxx/include/ |
| D | utility | 1006 // Some primes between 2^63 and 2^64.
|
| /external/bouncycastle/patches/ |
| D | bcprov.patch | 913 + logger.info("Generating safe primes. This may take a long time.");
936 + logger.info("Generated safe primes: " + tries + " tries took " + duration + "ms");
|