| /prebuilts/tools/common/m2/repository/com/googlecode/java-diff-utils/diffutils/1.3.0/ |
| diffutils-1.3.0.jar | |
| /prebuilts/tools/common/m2/repository/com/amazonaws/aws-java-sdk-dynamodb/1.11.18/ |
| aws-java-sdk-dynamodb-1.11.18.jar | |
| /external/boringssl/src/crypto/ec_extra/ |
| ec_asn1.c | 381 CBS prime, a, b, base_x, base_y, order; local
382 if (!parse_explicit_prime_curve(cbs, &prime, &a, &b, &base_x, &base_y,
387 /* Look for a matching prime curve. */
397 if (integers_equal(&prime, curve->params, param_len) &&
|
| /external/mesa3d/src/glx/ |
| dri2.c | 290 char *prime = getenv("DRI_PRIME"); local
291 if (prime) {
294 primeid = strtoul(prime, NULL, 0);
|
| /external/tpm2/ |
| RSAKeySieve.c | 180 // Include the outer counter (the one that changes on each prime
181 // prime candidate generation
203 // security strength of the prime. These values are from FIPS 186-3.
207 UINT32 bits // IN: Number of bits in the RSA prime
219 // likelihood, if the number is not prime, the first test fails.
225 // TRUE probably prime
317 // 5. Return PROBABLY PRIME
327 // This function is used to access the next prime number in the sequence of primes. It requires a pre-
362 // This function is used to initialize the prime sequence generator iterator. The iterator is initialized and
363 // returns the first prime that is equal to the requested starting value. If the starting value is no a prime, the
437 UINT16 prime; member in struct:__anon35463
[all...] |
| /external/wpa_supplicant_8/src/eap_common/ |
| eap_eke_common.c | 175 if (os_memcmp(ret_priv, dh->prime, dh->prime_len) > 0) {
176 /* Make sure private value is smaller than prime */
191 dh->prime, dh->prime_len, ret_pub, &pub_len) < 0)
425 dh->prime, dh->prime_len, modexp, &len) < 0)
|
| /libcore/luni/src/main/java/java/math/ |
| BigInteger.java | 31 * cryptography, such as the generation of large prime numbers and computation
149 * pow(2, bitLength)-1]} which is probably prime. The probability that the
150 * returned {@code BigInteger} is prime is greater than
174 candidate |= 1; // Any prime longer than 2 bits must have the bottom bit set.
177 BigInt prime = new BigInt(); local
178 prime.putULongInt(candidate, false);
179 setBigInt(prime);
[all...] |
| /packages/apps/Calendar/src/com/android/calendar/widget/ |
| CalendarAppWidgetService.java | 351 long prime = 31;
353 result = prime * result + (int) (eventInfo.id ^ (eventInfo.id >>> 32));
354 result = prime * result + (int) (eventInfo.start ^ (eventInfo.start >>> 32));
|
| /prebuilts/go/darwin-x86/misc/cgo/gmp/ |
| gmp.go | 374 // ProbablyPrime performs n Miller-Rabin tests to check whether z is prime.
375 // If it returns true, z is prime with probability 1 - 1/4^n.
376 // If it returns false, z is not prime.
|
| /prebuilts/go/linux-x86/misc/cgo/gmp/ |
| gmp.go | 374 // ProbablyPrime performs n Miller-Rabin tests to check whether z is prime.
375 // If it returns true, z is prime with probability 1 - 1/4^n.
376 // If it returns false, z is not prime.
|
| /external/conscrypt/testing/src/main/java/libcore/tlswire/handshake/ |
| CipherSuite.java | 433 final int prime = 31; local
435 result = prime * result + code;
|
| /external/ipsec-tools/src/racoon/ |
| oakley.c | 115 a.prime = vdup(&buf); \
175 if (dhgrp->prime)
176 vfree(dhgrp->prime);
189 * length of the prime modulus over which the exponentiation was
193 oakley_check_dh_pub(prime, pub0)
194 vchar_t *prime, **pub0;
199 if (prime->l == pub->l)
202 if (prime->l < pub->l) {
209 /* prime->l > pub->l */
210 tmp = vmalloc(prime->l)
[all...] |
| /frameworks/av/media/libstagefright/ |
| VideoFrameScheduler.cpp | 178 void VideoFrameScheduler::PLL::prime(size_t numSamplesToUse) { function in class:android::VideoFrameScheduler::PLL
277 prime(kMinSamplesToStopPrime);
|
| /libcore/support/src/test/java/libcore/tlswire/handshake/ |
| CipherSuite.java | 448 final int prime = 31; local
450 result = prime * result + code;
|
| /prebuilts/go/darwin-x86/src/crypto/x509/ |
| pkcs1.go | 31 Prime *big.Int
68 if a.Prime.Sign() <= 0 {
69 return nil, errors.New("x509: private key contains zero or negative prime")
71 key.Primes[i+2] = a.Prime
108 priv.AdditionalPrimes[i].Prime = key.Primes[2+i]
|
| /prebuilts/go/linux-x86/src/crypto/x509/ |
| pkcs1.go | 31 Prime *big.Int
68 if a.Prime.Sign() <= 0 {
69 return nil, errors.New("x509: private key contains zero or negative prime")
71 key.Primes[i+2] = a.Prime
108 priv.AdditionalPrimes[i].Prime = key.Primes[2+i]
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| OpenMapRealVector.java | 761 final int prime = 31;
765 result = prime * result + (int) (temp ^ (temp >>> 32));
766 result = prime * result + virtualSize;
771 result = prime * result + (int) (temp ^ (temp >>32));
|
| /frameworks/av/media/libaaudio/examples/utils/ |
| AAudioSimplePlayer.h | 188 aaudio_result_t prime() { function in class:AAudioSimplePlayer
|
| AAudioSimpleRecorder.h | 189 aaudio_result_t prime() { function in class:AAudioSimpleRecorder
|
| /packages/apps/Dialer/java/com/android/contacts/common/ |
| ContactPhotoManagerImpl.java | 853 final int prime = 31; local
855 result = prime * result + (int) (mId ^ (mId >>> 32));
856 result = prime * result + mRequestedExtent;
857 result = prime * result + ((mUri == null) ? 0 : mUri.hashCode());
[all...] |
| /prebuilts/gradle-plugin/com/android/tools/layoutlib/layoutlib-api/22.9.2/ |
| layoutlib-api-22.9.2.jar | |
| /prebuilts/gradle-plugin/com/android/tools/layoutlib/layoutlib-api/23.0.1/ |
| layoutlib-api-23.0.1.jar | |
| /prebuilts/gradle-plugin/com/android/tools/layoutlib/layoutlib-api/23.0.2/ |
| layoutlib-api-23.0.2.jar | |
| /prebuilts/gradle-plugin/com/android/tools/layoutlib/layoutlib-api/23.1.0/ |
| layoutlib-api-23.1.0.jar | |
| /prebuilts/gradle-plugin/com/android/tools/layoutlib/layoutlib-api/23.1.3/ |
| layoutlib-api-23.1.3.jar | |
