HomeSort by: relevance | last modified time | path
    Searched refs:lcm (Results 1 - 25 of 113) sorted by relevancy

1 2 3 4 5

  /src/external/gpl2/diffutils/dist/lib/
cmpbuf.c 133 size_t lcm, m, n, q, r; local
147 lcm = q * b;
148 return lcm <= lcm_max && lcm / b == q ? lcm : a;
  /src/external/lgpl3/gmp/dist/tests/cxx/
t-ops2z.cc 77 ASSERT_ALWAYS(lcm(mpz_class(6),mpz_class(8))==24);
78 ASSERT_ALWAYS(lcm(-mpz_class(6),mpz_class(8))==24);
79 ASSERT_ALWAYS(lcm(-mpz_class(6),-mpz_class(8))==24);
80 ASSERT_ALWAYS(lcm(mpz_class(6),static_cast<short>(8))==24);
81 ASSERT_ALWAYS(lcm(-mpz_class(6),static_cast<unsigned char>(8))==24);
82 ASSERT_ALWAYS(lcm(-6.,mpz_class(5)+3)==24);
  /src/external/mit/isl/dist/
isl_vec_private.h 24 void isl_vec_lcm(__isl_keep isl_vec *vec, isl_int *lcm);
isl_seq.c 269 void isl_seq_lcm(isl_int *p, unsigned len, isl_int *lcm)
274 isl_int_set_si(*lcm, 1);
277 isl_int_set(*lcm, p[0]);
279 isl_int_lcm(*lcm, *lcm, p[i]);
isl_seq.h 42 void isl_seq_lcm(isl_int *p, unsigned len, isl_int *lcm);
isl_farkas.c 599 * First compute the shared denominator (lcm) and
607 isl_int lcm, f; local
613 isl_int_init(lcm);
615 isl_int_set_si(lcm, 1);
620 isl_int_lcm(lcm, lcm, coeff->ineq[pos][1]);
623 isl_int_set(bset->ineq[k][1], lcm);
629 isl_int_divexact(f, lcm, coeff->ineq[pos][1]);
634 isl_int_clear(lcm);
isl_vec.c 435 void isl_vec_lcm(__isl_keep isl_vec *vec, isl_int *lcm)
437 isl_seq_lcm(vec->block.data, vec->size, lcm);
  /src/crypto/external/apache2/openssl/dist/crypto/rsa/
rsa_sp800_56b_check.c 172 * (Step 6a) 2^(nBit/2) < d < LCM(p–1, q–1).
173 * (Step 6b) 1 = (d*e) mod LCM(p–1, q–1)
178 BIGNUM *r, *p1, *q1, *lcm, *p1q1, *gcd; local
188 lcm = BN_CTX_get(ctx);
195 BN_set_flags(lcm, BN_FLG_CONSTTIME);
203 /* LCM(p - 1, q - 1) */
204 && (ossl_rsa_get_lcm(ctx, rsa->p, rsa->q, lcm, gcd, p1, q1,
207 /* (Step 6a) d < LCM(p - 1, q - 1) */
208 && (BN_cmp(rsa->d, lcm) < 0)
209 /* (Step 6b) 1 = (e . d) mod LCM(p - 1, q - 1) *
    [all...]
rsa_sp800_56b_gen.c 241 BIGNUM *p1, *q1, *lcm, *p1q1, *gcd; local
245 lcm = BN_CTX_get(ctx);
253 BN_set_flags(lcm, BN_FLG_CONSTTIME);
257 /* LCM((p-1, q-1)) */
258 if (ossl_rsa_get_lcm(ctx, rsa->p, rsa->q, lcm, gcd, p1, q1, p1q1) != 1)
272 /* (Step 3) d = (e^-1) mod (LCM(p-1, q-1)) */
277 if (BN_mod_inverse(rsa->d, e, lcm, ctx) == NULL)
339 BN_clear(lcm);
rsa_local.h 173 BIGNUM *lcm, BIGNUM *gcd, BIGNUM *p1, BIGNUM *q1,
  /src/crypto/external/bsd/openssl/dist/crypto/rsa/
rsa_sp800_56b_check.c 172 * (Step 6a) 2^(nBit/2) < d < LCM(p–1, q–1).
173 * (Step 6b) 1 = (d*e) mod LCM(p–1, q–1)
178 BIGNUM *r, *p1, *q1, *lcm, *p1q1, *gcd; local
188 lcm = BN_CTX_get(ctx);
195 BN_set_flags(lcm, BN_FLG_CONSTTIME);
203 /* LCM(p - 1, q - 1) */
204 && (ossl_rsa_get_lcm(ctx, rsa->p, rsa->q, lcm, gcd, p1, q1,
206 /* (Step 6a) d < LCM(p - 1, q - 1) */
207 && (BN_cmp(rsa->d, lcm) < 0)
208 /* (Step 6b) 1 = (e . d) mod LCM(p - 1, q - 1) *
    [all...]
rsa_sp800_56b_gen.c 236 BIGNUM *p1, *q1, *lcm, *p1q1, *gcd; local
241 lcm = BN_CTX_get(ctx);
249 BN_set_flags(lcm, BN_FLG_CONSTTIME);
253 /* LCM((p-1, q-1)) */
254 if (ossl_rsa_get_lcm(ctx, rsa->p, rsa->q, lcm, gcd, p1, q1, p1q1) != 1)
264 /* (Step 3) d = (e^-1) mod (LCM(p-1, q-1)) */
269 if (BN_mod_inverse(rsa->d, e, lcm, ctx) == NULL)
330 BN_clear(lcm);
rsa_local.h 169 BIGNUM *lcm, BIGNUM *gcd, BIGNUM *p1, BIGNUM *q1,
  /src/external/lgpl3/gmp/dist/demos/perl/GMP/
Mpz.pm 44 lcm lucnum lucnum2 mod mpz mpz_export
  /src/external/lgpl3/gmp/dist/tests/mpz/
Makefile.am 26 t-fdiv_ui t-cdiv_ui t-gcd t-gcd_ui t-lcm t-invert dive dive_ui t-sqrtrem \
  /src/sys/external/bsd/compiler_rt/dist/lib/xray/
xray_utils.h 62 constexpr size_t lcm(size_t a, size_t b) { return a * b / gcd(a, b); } function in namespace:__xray
  /src/external/lgpl3/gmp/dist/mini-gmp/tests/
Makefile 31 t-double t-cmp_d t-gcd t-lcm t-import t-comb t-signed \
  /src/crypto/external/bsd/openssl/dist/providers/implementations/kdfs/
krb5kdf.c 249 * L = lcm(N,K)
268 unsigned int tmp, gcd, remainder, lcm, carry; local
276 /* Least Common Multiple of lengths: LCM(a,b)*/
285 /* resulting a is the GCD, LCM(a,b) = |a*b|/GCD(a,b) */
286 lcm = blocksize * constant_len / gcd;
293 for (l = lcm - 1; l >= 0; l--) {
  /src/external/lgpl3/gmp/dist/demos/perl/
test.pl 798 # GMP::Mpz::lcm
800 ok (lcm (2) == 2);
801 ok (lcm (0) == 0);
802 ok (lcm (0,0) == 0);
803 ok (lcm (0,0,0) == 0);
804 ok (lcm (0,0,0,0) == 0);
805 ok (lcm (2,0) == 0);
806 ok (lcm (-2,0) == 0);
807 ok (lcm (2,3) == 6);
808 ok (lcm (2,3,4) == 12)
    [all...]
GMP.pm 155 use GMP::Mpz qw(gcd, lcm); # just these functions
193 fib2, gcd, gcdext, hamdist, invert, jacobi, kronecker, lcm, lucnum, lucnum2,
202 C<lucnum2>. C<gcd> and C<lcm> accept a variable number of arguments (one or
  /src/crypto/external/apache2/openssl/dist/providers/implementations/kdfs/
krb5kdf.c 269 * L = lcm(N,K)
288 unsigned int tmp, gcd, remainder, lcm, carry; local
296 /* Least Common Multiple of lengths: LCM(a,b)*/
305 /* resulting a is the GCD, LCM(a,b) = |a*b|/GCD(a,b) */
306 lcm = blocksize * constant_len / gcd;
313 for (l = lcm - 1; l >= 0; l--) {
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
TargetSchedule.cpp 57 static unsigned lcm(unsigned A, unsigned B) { function
58 unsigned LCM = (uint64_t(A) * B) / gcd(A, B);
59 assert((LCM >= A && LCM >= B) && "LCM overflow");
60 return LCM;
75 ResourceLCM = lcm(ResourceLCM, NumUnits);
  /src/external/lgpl3/gmp/dist/mpz/
Makefile.am 56 lcm.c lcm_ui.c limbs_read.c limbs_write.c limbs_modify.c limbs_finish.c \
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/
numeric.d 3222 typeof(Unqual!(T).init % Unqual!(U).init) lcm(T, U)(T a, U b)
3251 assert(lcm(1, 2) == 2);
3252 assert(lcm(3, 4) == 12);
3253 assert(lcm(5, 6) == 30);
3267 assert(lcm(T(21), U(6)) == 42);
3268 assert(lcm(T(41), U(0)) == 0);
3269 assert(lcm(T(0), U(7)) == 0);
3270 assert(lcm(T(0), U(0)) == 0);
3271 assert(lcm(T(1U), U(2)) == 2);
3272 assert(lcm(T(3), U(4U)) == 12)
    [all...]
  /src/external/mit/isl/dist/imath/
gmp_compat.h 196 /* gmp: The resutl of lcm(a,b) is always positive. */
197 void GMPZAPI(lcm)(mp_int rop, mp_int op1, mp_int op2);

Completed in 32 milliseconds

1 2 3 4 5