| /opensolaris-onvv-gate/usr/src/lib/libmp/common/ |
| H A D | mapfile_1-vers | 43 gcd;
|
| H A D | libmp.h | 59 extern void gcd(MINT *, MINT *, MINT *);
|
| H A D | old_mp.c | 29 void gcd(MINT *a, MINT *b, MINT *c) { mp_gcd(a, b, c); } function
|
| /opensolaris-onvv-gate/usr/src/cmd/perl/5.8.4/distrib/lib/ |
| H A D | bigrat.pl | 64 local($gcd) = &'bgcd($num,$dom);
65 $gcd =~ s/^-/+/;
66 if ($gcd ne '+1') {
67 $num = &'bdiv($num,$gcd);
68 $dom = &'bdiv($dom,$gcd);
|
| /opensolaris-onvv-gate/usr/src/cmd/perl/5.8.4/distrib/t/op/ |
| H A D | recurse.t | 16 sub gcd { subroutine
17 return gcd($_[0] - $_[1], $_[1]) if ($_[0] > $_[1]);
18 return gcd($_[0], $_[1] - $_[0]) if ($_[0] < $_[1]);
52 is(gcd(1147, 1271), 31, "gcd(1147, 1271) == 31");
54 is(gcd(1908, 2016), 36, "gcd(1908, 2016) == 36");
|
| /opensolaris-onvv-gate/usr/src/cmd/perl/5.8.4/distrib/t/lib/Math/BigInt/ |
| H A D | BareCalc.pm | 28 fac pow gcd log_int sqrt root
|
| /opensolaris-onvv-gate/usr/src/lib/libmp/ |
| H A D | Makefile.com | 31 OBJECTS= gcd.o madd.o mdiv.o mout.o msqrt.o mult.o pow.o util.o
|
| /opensolaris-onvv-gate/usr/src/lib/libparted/common/libparted/cs/ |
| H A D | natmath.c | 41 PedSector gcd; /* "converges" to the gcd */ member in struct:__anon4013
215 * gcd, x and y, such that:
217 * gcd = greatest common divisor of a and b
218 * gcd = x*a + y*b
227 result.gcd = a;
234 result.gcd = tmp.gcd;
279 * = A * (\p a * gcd) + B * (\p b * gcd)
[all...] |
| /opensolaris-onvv-gate/usr/src/uts/common/avs/ns/rdc/ |
| H A D | rdc_io.h | 597 #define IS_CRSRV(gcd) (IS_RSRV(&(gcd)->devices->id_cache_dev))
598 #define IS_RRSRV(gcd) (IS_RSRV(&(gcd)->devices->id_raw_dev))
600 #define IS_RFAILED(gcd) \
601 (RFAILED(&(gcd)->devices->id_cache_dev) || \
602 RFAILED(&(gcd)->devices->id_raw_dev))
607 #define RDC_U_FD(gcd) (IS_CRSRV(gcd) ? (gcd)
[all...] |
| /opensolaris-onvv-gate/usr/src/lib/libc/port/gen/ |
| H A D | getopt_long.c | 112 static int gcd(int, int);
164 gcd(int a, int b) function
195 ncycle = gcd(nnonopts, nopts);
|
| /opensolaris-onvv-gate/usr/src/common/bignum/ |
| H A D | bignum.h | 155 BIG_ERR_CODE big_ext_gcd_pos(BIGNUM *gcd, BIGNUM *cm, BIGNUM *ce,
|
| /opensolaris-onvv-gate/usr/src/cmd/perl/5.8.4/distrib/lib/Math/ |
| H A D | BigRat.pm | 347 my $gcd = $x->{_n}->bgcd($x->{_d});
349 if (!$gcd->is_one())
351 $x->{_n}->bdiv($gcd);
352 $x->{_d}->bdiv($gcd);
427 # 1 1 gcd(3,4) = 1 1*3 + 1*4 7
431 # we do not compute the gcd() here, but simple do:
436 # the gcd() calculation and reducing is then done in bnorm()
507 # According to Knuth, this can be optimized by doingtwice gcd (for d and n)
|
| H A D | BigInt.pm | 1572 # (i.e. their gcd is not one) then NaN is returned.
2380 mod sqrt root fac pow modinv modpow log_int gcd
2664 my $gcd = Math::BigInt::bgcd(@values);
|
| /opensolaris-onvv-gate/usr/src/common/mpi/ |
| H A D | mpi.c | 1890 ... by computing the product, and dividing out the gcd.
1895 mp_int gcd, prod; local
1901 if((res = mp_init(&gcd, FLAG(a))) != MP_OKAY)
1908 if((res = mp_gcd(a, b, &gcd)) != MP_OKAY)
1911 res = mp_div(&prod, &gcd, c, NULL);
1916 mp_clear(&gcd);
|
| /opensolaris-onvv-gate/usr/src/uts/common/fs/nfs/ |
| H A D | nfs4_vfsops.c | 337 gss_clntdata_t *gcd = (gss_clntdata_t *)fsecdata->data; local
339 tsecdata->data = (caddr_t)copy_sec_data_gss(gcd);
|