Lines Matching defs:sn
72 mp_size_t sn, sd;
101 cn = set_z (n, num, &sn);
104 /* sn is the number of limbs of the numerator, sd that of the denominator */
106 sn -= sd;
110 /* If sn >= 0, the quotient has at most sn limbs, thus is larger or equal to
111 2^((sn-1)*GMP_NUMB_BITS), thus its exponent >= (sn-1)*GMP_NUMB_BITS)+1.
112 (sn-1)*GMP_NUMB_BITS)+1 > emax yields (sn-1)*GMP_NUMB_BITS) >= emax,
113 i.e., sn-1 >= floor(emax/GMP_NUMB_BITS). */
114 if (MPFR_UNLIKELY (sn > MPFR_EMAX_MAX / GMP_NUMB_BITS))
120 /* If sn < 0, the inverse quotient is >= 2^((-sn-1)*GMP_NUMB_BITS),
121 thus the quotient is <= 2^((sn+1)*GMP_NUMB_BITS), and thus its
122 exponent is <= (sn+1)*GMP_NUMB_BITS+1.
123 (sn+1)*GMP_NUMB_BITS+1 < emin yields (sn+1)*GMP_NUMB_BITS+2 <= emin,
124 i.e., sn+1 <= floor((emin-2)/GMP_NUMB_BITS). */
125 if (MPFR_UNLIKELY (sn <= (MPFR_EMIN_MIN - 2) / GMP_NUMB_BITS - 1))
136 shift = GMP_NUMB_BITS*sn+cn-cd;
137 MPFR_ASSERTD (shift == GMP_NUMB_BITS*sn+cn-cd);