| /external/dropbear/ |
| D | genrsa.c | 45 DEF_MP_INT(lcm); in gen_rsa_priv_key()
56 &pminus, &lcm, &qminus, NULL); in gen_rsa_priv_key()
78 if (mp_lcm(&pminus, &qminus, &lcm) != MP_OKAY) { in gen_rsa_priv_key()
85 if (mp_invmod(key->e, &lcm, key->d) != MP_OKAY) { in gen_rsa_priv_key()
90 mp_clear_multi(&pminus, &qminus, &lcm, NULL); in gen_rsa_priv_key()
|
| /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/dropbear/libtomcrypt/src/headers/ |
| D | tomcrypt_math.h | 262 int (*lcm)(void *a, void *b, void *c); member
482 #define mp_lcm(a, b, c) ltc_mp.lcm(a, b, c)
|
| /external/dropbear/libtomcrypt/src/math/ |
| D | gmp_desc.c | 299 static int lcm(void *a, void *b, void *c) in lcm() function
428 &lcm,
|
| D | ltm_desc.c | 303 static int lcm(void *a, void *b, void *c) in lcm() function
434 &lcm,
|
| D | tfm_desc.c | 313 static int lcm(void *a, void *b, void *c) in lcm() function
722 &lcm,
|
| /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/dropbear/libtommath/ |
| D | poster.tex | 30 $c = a^{1/b}$ & {\tt mp\_n\_root(\&a, b, \&c)} & $c = \mbox{lcm}(a, b)$ & {\tt mp\_lcm(\&a, \&b, \&…
|
| D | bn.tex | 18 \def\lcm{{\rm lcm}}
|
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v5/ |
| D | v8-earley-boyer.js | 412 var lcm = 1;
414 var f = Math.round(arguments[i] / sc_euclid_gcd(arguments[i], lcm));
415 lcm *= Math.abs(f);
417 return lcm;
|
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v4/ |
| D | v8-earley-boyer.js | 412 var lcm = 1;
414 var f = Math.round(arguments[i] / sc_euclid_gcd(arguments[i], lcm));
415 lcm *= Math.abs(f);
417 return lcm;
|
| /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;
|
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v6/ |
| D | v8-earley-boyer.js | 412 var lcm = 1;
414 var f = Math.round(arguments[i] / sc_euclid_gcd(arguments[i], lcm));
415 lcm *= Math.abs(f);
417 return lcm;
|
| /external/dropbear/libtomcrypt/ |
| D | crypt.tex | 20 \def\lcm{{\rm lcm}}
3231 $\mbox{lcm}(p - 1, q - 1)$. The public key consists of the composite $N$ and some integer $e$ such…
6207 /** lcm
6213 int (*lcm)(void *a, void *b, void *c);
|