Lines Matching defs:mult
43 mpz_t *Q, mpfr_prec_t *mult)
56 log2_nb_terms = mult + (m+1);
72 mult[0] = 0; /* the multiplier P[k]/Q[k] for the remaining terms
73 satisfies P[k]/Q[k] <= 2^(-mult[k]) */
105 mult[k-1] += prec_i_have + (r << l) - prec_ptoj - 1;
106 prec_i_have = mult[k] = mult[k-1];
107 /* since mult[k] >= mult[k-1] + nbits(Q[k]),
108 we have Q[0]*...*Q[k] <= 2^mult[k] = 2^prec_i_have */
164 mpfr_prec_t *mult;
225 mult = (mpfr_prec_t*) mpfr_allocate_func (2*(k+2)*sizeof(mpfr_prec_t));
230 mpfr_exp_rational (tmp, uk, shift + twopoweri - ttt, k + 1, P, mult);
242 mpfr_exp_rational (t, uk, twopoweri - ttt, k - i + 1, P, mult);
253 mpfr_free_func (mult, 2*(k+2)*sizeof(mpfr_prec_t));