| /external/v8/test/mjsunit/ |
| D | apply.js | 144 var primes = new Array(0); variable
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");
189 primes[0] = "";
[all …]
|
| /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/apache-harmony/crypto/src/test/api/java/org/apache/harmony/crypto/tests/javax/crypto/spec/ |
| D | DHGenParameterSpecTest.java | 43 int[] primes = { Integer.MIN_VALUE, -1, 0, 1, Integer.MAX_VALUE }; in testDHGenParameterSpec() local
45 for (int i = 0; i < primes.length; i++) { in testDHGenParameterSpec()
46 DHGenParameterSpec ps = new DHGenParameterSpec(primes[i], in testDHGenParameterSpec()
50 ps.getPrimeSize(), primes[i]); in testDHGenParameterSpec()
|
| /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];
|
| D | part4.txt | 20350 615 // product of two primes found…
28845 and one of the primes.
28937 78 // not compatible with the primes. In an implementation that
28970 and one of the primes or two primes.
28971 …If both primes are provided, the public modulus is computed. If only one prime is provided, the se…
28986 107 // provided. an output if both primes are
29039 155 // Two primes provided so use them to compute n
29043 159 // Make sure that the sizes of the primes are compatible
29049 165 // Multiply the primes to get the public modulus
29094 205 // Specifically, an exponent that is not compatible with the primes.
[all …]
|
| /external/ltrace/ |
| D | dict.c | 320 static const size_t primes[] = { variable
329 return primes[0]; in larger_size()
331 if (current < primes[sizeof(primes)/sizeof(*primes) - 2]) { in larger_size()
333 for (i = 0; primes[i] != 0; ++i) in larger_size()
334 if (primes[i] > current) in larger_size()
335 return primes[i]; in larger_size()
348 if (current <= primes[0]) in smaller_size()
349 return primes[0]; in smaller_size()
351 if (current <= primes[sizeof(primes)/sizeof(*primes) - 2]) { in smaller_size()
354 for (i = 0; primes[i] != 0; ++i) { in smaller_size()
[all …]
|
| /external/icu/android_icu4j/src/main/java/android/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/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| D | CalendarCache.java | 75 if (pIndex < primes.length - 1) { in rehash()
76 arraySize = primes[++pIndex]; in rehash()
109 static private final int primes[] = { // 5, 17, 31, 47, // for testing field in CalendarCache
116 private int arraySize = primes[pIndex];
|
| /external/boringssl/src/crypto/bn/ |
| D | prime.c | 142 static const uint16_t primes[NUMPRIMES] = { variable
499 if (BN_mod_word(a, primes[i]) == 0) { in BN_is_prime_fasttest_ex()
646 BN_ULONG maxdelta = BN_MASK2 - primes[NUMPRIMES - 1]; in probable_prime()
656 mods[i] = (uint16_t)BN_mod_word(rnd, (BN_ULONG)primes[i]); in probable_prime()
687 for (i = 1; i < NUMPRIMES && primes[i] < rnd_word; i++) { in probable_prime()
688 if ((mods[i] + delta) % primes[i] == 0) { in probable_prime()
700 if (((mods[i] + delta) % primes[i]) <= 1) { in probable_prime()
756 if (BN_mod_word(rnd, (BN_ULONG)primes[i]) <= 1) { in probable_prime_dh()
828 if ((BN_mod_word(p, (BN_ULONG)primes[i]) == 0) || in probable_prime_dh_safe()
829 (BN_mod_word(q, (BN_ULONG)primes[i]) == 0)) { in probable_prime_dh_safe()
|
| /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 | 351 echo "moving $(DESTDIR)$(sysconfdir)/primes to $(DESTDIR)$(sysconfdir)/moduli"; \
352 mv "$(DESTDIR)$(sysconfdir)/primes" "$(DESTDIR)$(sysconfdir)/moduli"; \
|
| D | ssh-keygen.0 | 148 Generate candidate primes for DH-GEX. These primes must be
318 Test DH group exchange candidate primes (generated using the -G
372 process: first, candidate primes are generated using a fast, but memory
373 intensive process. These candidate primes are then tested for
376 Generation of primes is performed using the -G option. The desired
377 length of the primes may be specified by the -b option. For example:
381 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
|
| /external/chromium-trace/catapult/third_party/gsutil/third_party/rsa/doc/ |
| D | intro.rst | 12 It started out as just a module for calculating large primes, and RSA
|
| /external/valgrind/auxprogs/ |
| D | Makefile.am | 22 primes.c
|
| /external/libvorbis/doc/ |
| D | vorbis-clip.txt | 104 a) The first packet only primes the overlap/add buffer. No data is
|
| /external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/pkb/fr-FR/ |
| D | fr-FR_klex.pkb | 588 primauté3primezprimes.primo%C2<@!Bprinces4
|
| /external/openssh/contrib/redhat/ |
| D | openssh.spec | 487 - replace primes with moduli
|
| /external/chromium-trace/catapult/third_party/vinn/third_party/parse5/test/data/tokenization/ |
| D | namedEntities.test | 34079 "input": "&primes",
34080 "description": "Bad named entity: primes without a semi-colon",
34085 "&primes"
34090 "input": "ℙ",
34091 "description": "Named entity: primes; with a semi-colon",
|
| /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");
|