| /freebsd-11.0-release/sys/kgssapi/krb5/ |
| H A D | kcrypto.c | 90 gcd(size_t a, size_t b) function
95 return gcd(b, a % b);
101 return ((a * b) / gcd(a, b));
|
| /freebsd-11.0-release/contrib/llvm/tools/lldb/source/Host/common/ |
| H A D | GetOptInc.cpp | 35 static int gcd(int, int);
48 gcd(int a, int b) function
82 ncycle = gcd(nnonopts, nopts);
|
| /freebsd-11.0-release/contrib/tcpdump/missing/ |
| H A D | getopt_long.c | 89 static int gcd(int, int);
119 gcd(int a, int b) function
150 ncycle = gcd(nnonopts, nopts);
|
| /freebsd-11.0-release/crypto/openssh/openbsd-compat/ |
| H A D | getopt_long.c | 98 static int gcd(int, int);
119 gcd(int a, int b) function
150 ncycle = gcd(nnonopts, nopts);
|
| /freebsd-11.0-release/contrib/file/src/ |
| H A D | getopt_long.c | 93 static int gcd(int, int);
115 gcd(a, b) function
153 ncycle = gcd(nnonopts, nopts);
|
| /freebsd-11.0-release/lib/libc/stdlib/ |
| H A D | getopt_long.c | 104 static int gcd(int, int);
135 gcd(int a, int b) function
166 ncycle = gcd(nnonopts, nopts);
|
| /freebsd-11.0-release/contrib/llvm/lib/CodeGen/ |
| H A D | TargetSchedule.cpp | 38 static unsigned gcd(unsigned Dividend, unsigned Divisor) { function
48 unsigned LCM = (uint64_t(A) * B) / gcd(A, B);
|
| /freebsd-11.0-release/contrib/gcc/ |
| H A D | lambda.h | 385 gcd (int a, int b) function
414 gcd1 = gcd (gcd1, vector[i]);
|
| H A D | lambda-code.c | 448 return (abs (a) * abs (b) / gcd (a, b));
810 /* Computes the gcd of the coefficients of the linear part. */
814 gcd1 = gcd (gcd1, determinant);
816 /* Now divide through by the gcd. */
872 /* Find the gcd and divide by it here, rather than doing it
877 gcd1 = gcd (gcd1, gcd2);
878 gcd1 = gcd (gcd1, LLE_CONSTANT (target_expr));
879 gcd1 = gcd (gcd1, LLE_DENOMINATOR (target_expr));
928 /* Find the gcd and divide by it here, instead of at the
933 gcd1 = gcd (gcd
[all...] |
| H A D | tree-data-ref.c | 572 /* Determines whether (A == gcd (A, B)). */
2653 gcd_steps_a_b = gcd (step_a, step_b);
2949 /* The classic "gcd-test". */
2952 /* The "gcd-test" has determined that there is no integer
|
| /freebsd-11.0-release/sbin/geom/misc/ |
| H A D | subr.c | 68 gcd(unsigned int a, unsigned int b) function
87 return ((a * b) / gcd(a, b));
|
| /freebsd-11.0-release/sys/geom/concat/ |
| H A D | g_concat.c | 75 gcd(u_int a, u_int b) function
94 return ((a * b) / gcd(a, b));
|
| /freebsd-11.0-release/sys/geom/shsec/ |
| H A D | g_shsec.c | 87 gcd(u_int a, u_int b) function
106 return ((a * b) / gcd(a, b));
|
| /freebsd-11.0-release/sys/geom/stripe/ |
| H A D | g_stripe.c | 101 gcd(u_int a, u_int b) function
120 return ((a * b) / gcd(a, b));
|
| /freebsd-11.0-release/sys/dev/sound/pci/hda/ |
| H A D | hdaa.c | 2028 gcd(unsigned a, unsigned b) function
2047 return ((a * b) / gcd(a, b));
|
| /freebsd-11.0-release/contrib/llvm/lib/Analysis/ |
| H A D | ScalarEvolution.cpp | 2753 static const APInt gcd(const SCEVConstant *C1, const SCEVConstant *C2) {
2794 APInt Factor = gcd(LHSCst, RHSCst);
6452 // 1. D = gcd(A, N)
6454 // The gcd of A and N may have only one prime factor: 2. The number of
|