/haiku-buildtools/gcc/gmp/mpq/ |
H A D | canonicalize.c | 28 mpz_t gcd; local 37 MPZ_TMP_INIT (gcd, 1 + MAX (ABS (op->_mp_num._mp_size), 40 mpz_gcd (gcd, &(op->_mp_num), &(op->_mp_den)); 41 if (! MPZ_EQUAL_1_P (gcd)) 43 mpz_divexact_gcd (&(op->_mp_num), &(op->_mp_num), gcd); 44 mpz_divexact_gcd (&(op->_mp_den), &(op->_mp_den), gcd);
|
H A D | aors.c | 32 mpz_t gcd; local 41 MPZ_TMP_INIT (gcd, MIN (op1_den_size, op2_den_size)); 50 mpz_gcd (gcd, &(op1->_mp_den), &(op2->_mp_den)); 51 if (! MPZ_EQUAL_1_P (gcd)) 55 mpz_divexact_gcd (tmp1, &(op2->_mp_den), gcd); 58 mpz_divexact_gcd (tmp2, &(op1->_mp_den), gcd); 64 mpz_divexact_gcd (tmp2, &(op1->_mp_den), gcd); 66 mpz_gcd (gcd, t, gcd); 67 if (MPZ_EQUAL_1_P (gcd)) [all...] |
/haiku-buildtools/gcc/gmp/mpz/ |
H A D | invert.c | 29 mpz_t gcd, tmp; local 46 MPZ_TMP_INIT (gcd, size); 48 mpz_gcdext (gcd, tmp, (mpz_ptr) 0, x, n); 51 if (SIZ (gcd) != 1 || PTR(gcd)[0] != 1)
|
H A D | gcd.c | 1 /* mpz/gcd.c: Calculate the greatest common divisor of two integers. 33 gcd (mpz_srcptr u, mpz_srcptr v, mpz_ptr g)
|
H A D | Makefile.am | 40 gcd.c gcd_ui.c gcdext.c get_d.c get_d_2exp.c get_si.c \
|
/haiku-buildtools/cloog/source/ |
H A D | int.c | 132 void cloog_seq_gcd(cloog_int_t *p, unsigned len, cloog_int_t *gcd) argument 137 cloog_int_set_si(*gcd, 0); 140 cloog_int_abs(*gcd, p[min]); 141 for (i = 0; cloog_int_cmp_si(*gcd, 1) > 0 && i < len; ++i) { 146 cloog_int_gcd(*gcd, *gcd, p[i]); 167 cloog_int_t gcd; local 172 cloog_int_init(gcd); 173 cloog_seq_gcd(p, len, &gcd); 174 if (!cloog_int_is_zero(gcd) [all...] |
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ipa/ |
H A D | ipa-icf-12.c | 7 int gcd(int x, int y) __attribute__ ((pure)); 10 int gcd(int x, int y) function 76 /* { dg-final { scan-ipa-dump "Semantic equality hit:nsd->gcd" "icf" } } */
|
H A D | ipa-icf-13.c | 7 int gcd(int x, int y) __attribute__ ((pure)); 10 int gcd(int x, int y) function 186 printf("Test1: %d, %d, gdc: %d\n", a, b, gcd(a, b)); 192 /* { dg-final { scan-ipa-dump "Semantic equality hit:nsd->gcd" "icf" } } */
|
/haiku-buildtools/gcc/gmp/mpbsd/ |
H A D | Makefile.am | 32 ../mpz/add.c ../mpz/cmp.c ../mpz/gcd.c ../mpz/mul.c ../mpz/powm.c \
|
/haiku-buildtools/gcc/gmp/tests/mpbsd/ |
H A D | allfuns.c | 45 gcd (a, b, c);
|
/haiku-buildtools/gcc/gcc/ |
H A D | hwint.c | 132 gcd (HOST_WIDE_INT a, HOST_WIDE_INT b) function 189 return mul_hwi (abs_hwi (a) / gcd (a, b), abs_hwi (b));
|
H A D | hwint.h | 234 extern HOST_WIDE_INT gcd (HOST_WIDE_INT, HOST_WIDE_INT);
|
/haiku-buildtools/gcc/gmp/mpn/ |
H A D | Makefile.am | 44 dump.c fib2_ui.c gcd.c \ 92 tune-gcd-p: gcd.c 93 $(COMPILE) -g -O1 -I $(top_srcdir)/tune -DTUNE_GCD_P=1 gcd.c -o tune-gcd-p -L ../.libs -L../tune/.libs -lspeed -lgmp -lm
|
/haiku-buildtools/isl/ |
H A D | isl_seq.c | 229 void isl_seq_gcd(isl_int *p, unsigned len, isl_int *gcd) argument 234 isl_int_set_si(*gcd, 0); 237 isl_int_abs(*gcd, p[min]); 238 for (i = 0; isl_int_cmp_si(*gcd, 1) > 0 && i < len; ++i) { 243 isl_int_gcd(*gcd, *gcd, p[i]);
|
H A D | isl_aff.c | 1469 isl_int gcd, f; local 1479 isl_int_init(gcd); 1481 isl_int_gcd(gcd, aff1->v->el[0], aff2->v->el[0]); 1482 isl_int_divexact(f, aff2->v->el[0], gcd); 1484 isl_int_divexact(f, aff1->v->el[0], gcd); 1486 isl_int_divexact(f, aff2->v->el[0], gcd); 1489 isl_int_clear(gcd); 1549 isl_int gcd; local 1566 isl_int_init(gcd); 1567 isl_int_gcd(gcd, af 1606 isl_int gcd; local 4093 pw_multi_aff_from_map_stride( __isl_take isl_map *map, __isl_take isl_basic_map *hull, int d, int i, isl_int gcd) argument 4184 isl_int gcd; local [all...] |
/haiku-buildtools/cloog/source/matrix/ |
H A D | constraintset.c | 324 cloog_int_t gcd, factor_level, factor_outer, temp_level, temp_outer; local 326 cloog_int_init(gcd); 339 cloog_int_gcd(gcd, equal->constraints->M.p[level-1][i+1], 343 cloog_int_divexact(factor_level, equal->constraints->M.p[i][i+1], gcd); 344 cloog_int_divexact(factor_outer, equal->constraints->M.p[level-1][i+1], gcd); 375 cloog_int_clear(gcd); 496 cloog_int_t factor_i, factor_ref, temp_i, temp_ref, gcd; local 509 cloog_int_init(gcd); 521 cloog_int_gcd(gcd, matrix->p[ref][level], matrix->p[i][level]); 522 cloog_int_divexact(factor_i, matrix->p[ref][level], gcd); 597 cloog_int_t gcd, factor_vector, factor_equal, temp_vector, temp_equal; local [all...] |
/haiku-buildtools/gcc/gmp/demos/perl/GMP/ |
H A D | Mpz.pm | 32 fib2 gcd gcdext hamdist invert jacobi kronecker
|
/haiku-buildtools/gcc/gmp/mpn/x86_64/ |
H A D | gcd_1.asm | 1 dnl AMD64 mpn_gcd_1 -- mpn by 1 gcd. 26 C K8: 6.75 cycles/bit (approx) 1x1 gcd 33 dnl div at 80 cycles compared to the gcd at about 7 cycles/bitpair
|
/haiku-buildtools/gcc/gmp/tests/mpz/ |
H A D | Makefile.am | 26 t-fdiv_ui t-cdiv_ui t-gcd t-gcd_ui t-lcm t-invert dive dive_ui t-sqrtrem \
|
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/chan/ |
H A D | powser1.go | 201 // Integer gcd; needed for rational arithmetic 203 func gcd (u, v int64) int64 { func 204 if u < 0 { return gcd(-u, v) } 206 return gcd(v%u, u) 212 g := gcd(u,v) 244 g := gcd(u.den,v.den) 249 g1 := gcd(u.num,v.den) 250 g2 := gcd(u.den,v.num)
|
H A D | powser2.go | 211 // Integer gcd; needed for rational arithmetic 213 func gcd (u, v int64) int64{ func 214 if u < 0 { return gcd(-u, v) } 216 return gcd(v%u, u) 222 g := gcd(u,v) 254 g := gcd(u.den,v.den) 259 g1 := gcd(u.num,v.den) 260 g2 := gcd(u.den,v.num)
|
/haiku-buildtools/isl/include/isl/ |
H A D | seq.h | 41 void isl_seq_gcd(isl_int *p, unsigned len, isl_int *gcd);
|
/haiku-buildtools/gcc/gmp/ |
H A D | mp-h.in | 152 __GMP_DECLSPEC void gcd __GMP_PROTO ((const MINT *, const MINT *, MINT *));
|
/haiku-buildtools/gcc/gmp/tune/ |
H A D | Makefile.am | 127 invertappr.c invert.c binvert.c divrem_2.c gcd.c gcdext.c \
|
/haiku-buildtools/gcc/gmp/mpn/x86/k7/ |
H A D | gcd_1.asm | 1 dnl AMD K7 mpn_gcd_1 -- mpn by 1 gcd. 23 C K7: 6.75 cycles/bit (approx) 1x1 gcd 30 dnl divl at 40 cycles compared to the gcd at about 7 cycles/bitpair
|