| /freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/xray/ |
| H A D | xray_utils.h | 57 constexpr size_t gcd(size_t a, size_t b) { function in namespace:__xray
58 return (b == 0) ? a : gcd(b, a % b);
61 constexpr size_t lcm(size_t a, size_t b) { return a * b / gcd(a, b); }
|
| /freebsd-11-stable/sys/kgssapi/krb5/ |
| H A D | kcrypto.c | 96 gcd(size_t a, size_t b) function
101 return gcd(b, a % b);
107 return ((a * b) / gcd(a, b));
|
| /freebsd-11-stable/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-stable/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-stable/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-stable/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-stable/contrib/llvm-project/lldb/source/Host/common/ |
| H A D | GetOptInc.cpp | 44 static int gcd(int, int);
56 static int gcd(int a, int b) { function
87 ncycle = gcd(nnonopts, nopts);
|
| /freebsd-11-stable/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-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | TargetSchedule.cpp | 47 static unsigned gcd(unsigned Dividend, unsigned Divisor) { function
58 unsigned LCM = (uint64_t(A) * B) / gcd(A, B);
|
| /freebsd-11-stable/sbin/geom/misc/ |
| H A D | subr.c | 70 gcd(unsigned int a, unsigned int b) function
89 return ((a * b) / gcd(a, b));
|
| /freebsd-11-stable/sys/compat/linuxkpi/common/src/ |
| H A D | linux_compat.c | 1965 uint64_t gcd; local
1983 gcd = lkpi_gcd_64(lkpi_nsec2hz_rem, lkpi_nsec2hz_div);
1984 lkpi_nsec2hz_rem /= gcd;
1985 lkpi_nsec2hz_div /= gcd;
1988 gcd = lkpi_gcd_64(lkpi_usec2hz_rem, lkpi_usec2hz_div);
1989 lkpi_usec2hz_rem /= gcd;
1990 lkpi_usec2hz_div /= gcd;
1993 gcd = lkpi_gcd_64(lkpi_msec2hz_rem, lkpi_msec2hz_div);
1994 lkpi_msec2hz_rem /= gcd;
1995 lkpi_msec2hz_div /= gcd;
[all...] |
| /freebsd-11-stable/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-stable/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-stable/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-stable/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-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | Attributor.cpp | 3438 // gcd(Offset, Alignment) is an alignment.
3440 uint32_t gcd = local
3442 Alignment = llvm::PowerOf2Floor(gcd);
|
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | ScalarEvolution.cpp | 3326 static const APInt gcd(const SCEVConstant *C1, const SCEVConstant *C2) {
3367 APInt Factor = gcd(LHSCst, RHSCst);
8461 // 1. D = gcd(A, N)
8463 // The gcd of A and N may have only one prime factor: 2. The number of
|