HomeSort by: relevance | last modified time | path
    Searched defs:gcd (Results 1 - 25 of 53) sorted by relevancy

1 2 3

  /src/external/lgpl3/gmp/dist/mpq/
canonicalize.c 37 mpz_t gcd; local
51 MPZ_TMP_INIT (gcd, 1 + MAX (ABSIZ(NUM(op)),
54 mpz_gcd (gcd, NUM(op), DEN(op));
55 if (! MPZ_EQUAL_1_P (gcd))
57 mpz_divexact_gcd (NUM(op), NUM(op), gcd); local
58 mpz_divexact_gcd (DEN(op), DEN(op), gcd); local
aors.c 42 mpz_t gcd; local
51 MPZ_TMP_INIT (gcd, MIN (op1_den_size, op2_den_size));
60 mpz_gcd (gcd, DEN(op1), DEN(op2));
61 if (! MPZ_EQUAL_1_P (gcd))
66 op2_num_size + op1_den_size) + 2 - SIZ(gcd));
68 mpz_divexact_gcd (t, DEN(op2), gcd);
69 mpz_divexact_gcd (tmp2, DEN(op1), gcd);
76 mpz_gcd (gcd, t, gcd);
77 if (MPZ_EQUAL_1_P (gcd))
84 mpz_divexact_gcd (NUM(rop), t, gcd); local
    [all...]
  /src/sys/external/bsd/drm2/include/linux/
gcd.h 1 /* $NetBSD: gcd.h,v 1.1 2014/07/16 20:59:58 riastradh Exp $ */
36 gcd(unsigned long a, unsigned long b) function
  /src/external/lgpl3/gmp/dist/mpz/
invert.c 38 mpz_t gcd, tmp; local
48 MPZ_TMP_INIT (gcd, size);
50 mpz_gcdext (gcd, tmp, (mpz_ptr) 0, x, n);
53 if (!MPZ_EQUAL_1_P (gcd))
  /src/sys/external/bsd/compiler_rt/dist/lib/xray/
xray_utils.h 58 constexpr size_t gcd(size_t a, size_t b) { function in namespace:__xray
59 return (b == 0) ? a : gcd(b, a % b);
62 constexpr size_t lcm(size_t a, size_t b) { return a * b / gcd(a, b); }
  /src/external/lgpl3/mpc/dist/src/
rootofunity.c 25 gcd (unsigned long a, unsigned long b) function
29 else return gcd (b, a % b);
52 g = gcd (k, n);
56 /* Now 0 <= k < n and gcd(k,n)=1. */
69 /* since gcd(k,n)=1, necessarily k=1, thus we want exp(i*pi)=-1 */
75 /* since gcd(k,n)=1, necessarily k=1 or k=3, thus we want
  /src/external/gpl3/gcc/dist/gcc/
hwint.cc 132 gcd (HOST_WIDE_INT a, HOST_WIDE_INT b) function
189 return mul_hwi (abs_hwi (a) / gcd (a, b), abs_hwi (b));
  /src/external/gpl3/gcc.old/dist/gcc/
hwint.cc 132 gcd (HOST_WIDE_INT a, HOST_WIDE_INT b) function
189 return mul_hwi (abs_hwi (a) / gcd (a, b), abs_hwi (b));
  /src/crypto/external/apache2/openssl/dist/crypto/rsa/
rsa_sp800_56b_check.c 132 * i.e: p is prime AND GCD(p - 1, e) = 1
139 BIGNUM *p1 = NULL, *gcd = NULL; local
149 gcd = BN_CTX_get(ctx);
150 if (gcd != NULL) {
152 BN_set_flags(gcd, BN_FLG_CONSTTIME);
158 /* (Step 5d) GCD(p-1, e) = 1 */
161 && BN_gcd(gcd, p1, e, ctx)
162 && BN_is_one(gcd);
178 BIGNUM *r, *p1, *q1, *lcm, *p1q1, *gcd; local
190 gcd = BN_CTX_get(ctx)
287 BIGNUM *gcd = NULL; local
    [all...]
rsa_sp800_56b_gen.c 241 BIGNUM *p1, *q1, *lcm, *p1q1, *gcd; local
247 gcd = BN_CTX_get(ctx);
248 if (gcd == NULL)
255 BN_set_flags(gcd, BN_FLG_CONSTTIME);
258 if (ossl_rsa_get_lcm(ctx, rsa->p, rsa->q, lcm, gcd, p1, q1, p1q1) != 1)
341 BN_clear(gcd);
  /src/crypto/external/bsd/openssl/dist/crypto/rsa/
rsa_sp800_56b_check.c 132 * i.e: p is prime AND GCD(p - 1, e) = 1
139 BIGNUM *p1 = NULL, *gcd = NULL; local
149 gcd = BN_CTX_get(ctx);
150 if (gcd != NULL) {
152 BN_set_flags(gcd, BN_FLG_CONSTTIME);
158 /* (Step 5d) GCD(p-1, e) = 1 */
161 && BN_gcd(gcd, p1, e, ctx)
162 && BN_is_one(gcd);
178 BIGNUM *r, *p1, *q1, *lcm, *p1q1, *gcd; local
190 gcd = BN_CTX_get(ctx)
286 BIGNUM *gcd = NULL; local
    [all...]
rsa_sp800_56b_gen.c 236 BIGNUM *p1, *q1, *lcm, *p1q1, *gcd; local
243 gcd = BN_CTX_get(ctx);
244 if (gcd == NULL)
251 BN_set_flags(gcd, BN_FLG_CONSTTIME);
254 if (ossl_rsa_get_lcm(ctx, rsa->p, rsa->q, lcm, gcd, p1, q1, p1q1) != 1)
332 BN_clear(gcd);
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
TargetSchedule.cpp 47 static unsigned gcd(unsigned Dividend, unsigned Divisor) { function
58 unsigned LCM = (uint64_t(A) * B) / gcd(A, B);
  /src/common/dist/zlib/examples/
gzappend.c 102 local unsigned gcd(unsigned a, unsigned b) function
154 cycles = gcd(len, rot); /* number of cycles */
  /src/lib/libc/stdlib/
getopt_long.c 90 static int gcd(int, int);
112 gcd(int a, int b) function
144 ncycle = gcd(nnonopts, nopts);
  /src/crypto/external/apache2/openssl/dist/providers/implementations/kdfs/
krb5kdf.c 288 unsigned int tmp, gcd, remainder, lcm, carry; local
297 gcd = blocksize;
299 /* Calculate Great Common Divisor first GCD(a,b) */
301 tmp = gcd % remainder;
302 gcd = remainder;
305 /* resulting a is the GCD, LCM(a,b) = |a*b|/GCD(a,b) */
306 lcm = blocksize * constant_len / gcd;
  /src/crypto/external/apache2/openssl/dist/test/testutil/
driver.c 82 static int gcd(int a, int b) function
363 while (jstep == 0 || gcd(all_tests[i].num, jstep) != 1);
  /src/crypto/external/bsd/openssl/dist/providers/implementations/kdfs/
krb5kdf.c 268 unsigned int tmp, gcd, remainder, lcm, carry; local
277 gcd = blocksize;
279 /* Calculate Great Common Divisor first GCD(a,b) */
281 tmp = gcd % remainder;
282 gcd = remainder;
285 /* resulting a is the GCD, LCM(a,b) = |a*b|/GCD(a,b) */
286 lcm = blocksize * constant_len / gcd;
  /src/crypto/external/bsd/openssl/dist/test/testutil/
driver.c 84 static int gcd(int a, int b) function
362 while (jstep == 0 || gcd(all_tests[i].num, jstep) != 1);
  /src/crypto/external/bsd/openssl.old/dist/test/testutil/
driver.c 92 static int gcd(int a, int b) function
232 while (jstep == 0 || gcd(all_tests[i].num, jstep) != 1);
  /src/external/bsd/file/dist/src/
getopt_long.c 99 static int gcd(int, int);
121 gcd(a, b) function
159 ncycle = gcd(nnonopts, nopts);
  /src/external/bsd/libfido2/dist/openbsd-compat/
getopt_long.c 89 static int gcd(int, int);
110 gcd(int a, int b) function
141 ncycle = gcd(nnonopts, nopts);
  /src/external/bsd/tcpdump/dist/missing/
getopt_long.c 91 static int gcd(int, int);
121 gcd(int a, int b) function
152 ncycle = gcd(nnonopts, nopts);
  /src/external/gpl3/binutils/dist/zlib/examples/
gzappend.c 102 local unsigned gcd(unsigned a, unsigned b) function
154 cycles = gcd(len, rot); /* number of cycles */
  /src/external/gpl3/binutils.old/dist/zlib/examples/
gzappend.c 102 local unsigned gcd(unsigned a, unsigned b) function
154 cycles = gcd(len, rot); /* number of cycles */

Completed in 31 milliseconds

1 2 3