| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/util/ |
| D | Math.java | 22 public static long lcm(long a, long b) { in lcm() method in Math
26 public static int lcm(int a, int b) { in lcm() method in Math
|
| /external/boringssl/src/crypto/rsa/ |
| D | rsa.c | 534 BIGNUM n, pm1, qm1, lcm, gcd, de, dmp1, dmq1, iqmp; in RSA_check_key() local
568 BN_init(&lcm); in RSA_check_key()
579 !BN_mul(&lcm, &pm1, &qm1, ctx) || in RSA_check_key()
596 !BN_mul(&lcm, &lcm, &pm1, ctx) || in RSA_check_key()
603 if (!BN_div(&lcm, NULL, &lcm, &gcd, ctx) || in RSA_check_key()
606 !BN_mod_mul(&de, key->d, key->e, &lcm, ctx)) { in RSA_check_key()
653 BN_free(&lcm); in RSA_check_key()
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/ |
| D | RSAKeyPairGenerator.java | 60 BigInteger p, q, n, d, e, pSub1, qSub1, gcd, lcm; in generateKeyPair() local
120 lcm = pSub1.divide(gcd).multiply(qSub1); in generateKeyPair()
125 d = e.modInverse(lcm); in generateKeyPair()
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/util/ |
| D | MathUtils.java | 1161 public static int lcm(int a, int b) {
1165 int lcm = FastMath.abs(mulAndCheck(a / gcd(a, b), b));
1166 if (lcm == Integer.MIN_VALUE) {
1171 return lcm;
1196 public static long lcm(long a, long b) {
1200 long lcm = FastMath.abs(mulAndCheck(a / gcd(a, b), b));
1201 if (lcm == Long.MIN_VALUE){
1206 return lcm;
|
| /external/chromium-trace/catapult/third_party/polymer/components/web-animations-js/src/ |
| D | handler-utils.js | 74 function lcm(a, b) { function
120 var length = lcm(left.length, right.length);
|
| /external/llvm/lib/CodeGen/ |
| D | TargetSchedule.cpp | 47 static unsigned lcm(unsigned A, unsigned B) { in lcm() function
67 ResourceLCM = lcm(ResourceLCM, NumUnits); in init()
|
| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/builder/ |
| D | SyncSampleIntersectFinderImpl.java | 27 import static com.googlecode.mp4parser.util.Math.lcm;
298 timeScale = lcm(timeScale, track1.getTrackMetaData().getTimescale()); in calculateTracktimesScalingFactor()
|
| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/tracks/ |
| D | MultiplyTimeScaleTrack.java | 30 import static com.googlecode.mp4parser.util.Math.lcm;
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| D | NFRuleSet.java | 629 leastCommonMultiple = lcm(leastCommonMultiple, rules[i].getBaseValue()); in findFractionRuleSetRule()
687 private static long lcm(long x, long y) { in lcm() method in NFRuleSet
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| D | NFRuleSet.java | 630 leastCommonMultiple = lcm(leastCommonMultiple, rules[i].getBaseValue()); in findFractionRuleSetRule()
688 private static long lcm(long x, long y) { in lcm() method in NFRuleSet
|
| /external/v8/benchmarks/ |
| D | earley-boyer.js | 418 var lcm = 1;
420 var f = Math.round(arguments[i] / sc_euclid_gcd(arguments[i], lcm));
421 lcm *= Math.abs(f);
423 return lcm;
|