HomeSort by: relevance | last modified time | path
    Searched refs:tprec (Results 1 - 6 of 6) sorted by relevancy

  /src/external/lgpl3/gmp/dist/mpf/
swap.c 37 mp_size_t tprec; variable
41 tprec = PREC(u);
43 PREC(v) = tprec;
  /src/external/lgpl3/mpfr/dist/src/
grandom.c 38 mpfr_prec_t tprec, tprec0; local
77 tprec = tprec0;
80 mpz_urandomb (xp, rstate, tprec);
81 mpz_urandomb (yp, rstate, tprec);
86 while (mpz_sizeinbase (s, 2) > tprec * 2);
88 /* now s = x^2 + y^2 < 2^{2tprec} */
96 /* The case s = 2^(2*tprec) is not possible:
99 thus s = 2 mod 4 (and tprec >= 1);
101 p = tprec, we would have x^2 + y^2 = 2^(2p) with x and y even
105 if (mpz_sizeinbase (s, 2) <= 2 * tprec)
    [all...]
  /src/external/lgpl3/gmp/dist/demos/expr/
expr.c 464 #define PRECEDENCE_TEST_REDUCE(tprec,cprec,ttype,ctype) \
465 ((tprec) < (cprec) \
466 || ((tprec) == (cprec) && ! ((ttype) & MPEXPR_TYPE_RIGHTASSOC)))
  /src/external/lgpl3/mpc/dist/tests/
Makefile.am 44 tpow_d tpow_fr tpow_ld tpow_si tpow_ui tpow_z tprec tproj treal \
  /src/external/gpl3/gcc/dist/gcc/
gimple-lower-bitint.cc 2761 unsigned int tprec = TYPE_PRECISION (type);
2762 unsigned int rprec = (tprec - 1) % limb_prec + 1;
2770 (bo_idx + tprec / limb_prec)
2906 unsigned int tprec = TYPE_PRECISION (type);
2907 unsigned int rprec = (tprec - 1) % limb_prec + 1;
2915 (bo_idx + tprec / limb_prec)
2958 unsigned int tprec = TYPE_PRECISION (type);
2959 unsigned int rprec = (tprec + bo_bit) % limb_prec;
2963 (bo_idx + (tprec + bo_bit) / limb_prec)
gimple-fold.cc 4905 int tprec = GET_MODE_PRECISION (limb_mode); local
4907 tree t = build_nonstandard_integer_type (tprec, 1);
4908 tree cst = wide_int_to_tree (t, wi::mask (prec, true, tprec));
4928 int tprec = GET_MODE_PRECISION (limb_mode); local
4929 int prec = (((unsigned) TYPE_PRECISION (type)) % tprec);
4931 wi::mask (prec, true, tprec));

Completed in 39 milliseconds