Lines Matching defs:an
32 mp_size_t an, bn, cn;
47 an = MPFR_PREC2LIMBS (aq); /* number of limbs of a */
48 aq2 = (mpfr_prec_t) an * GMP_NUMB_BITS;
101 if (MPFR_UNLIKELY(an > bn))
104 MPN_COPY(ap + (an - bn), bp, bn);
106 MPN_ZERO(ap, an - bn);
108 else /* an <= bn */
111 MPN_COPY(ap, bp + (bn - an), an);
133 MPFR_ASSERTD(difn - cn <= an);
140 a2p = ap + (an - k);
156 cc = MPFR_UNLIKELY(an > bn)
157 ? mpn_add_n(ap + (an - bn), ap + (an - bn), bp, bn)
158 : mpn_add_n(ap, ap, bp + (bn - an), an);
181 mpn_rshift(ap, ap, an, 1);
182 ap[an-1] += MPFR_LIMB_HIGHBIT;
212 difw = (mpfr_exp_t) an - (mpfr_exp_t) (diff_exp / GMP_NUMB_BITS);
213 /* difw is the number of limbs from b (regarded as having an infinite
217 if (MPFR_UNLIKELY(bn > an))
227 bk = bn - an; /* index of lowest considered limb from b, > 0 */
301 && mpn_add_1(ap, ap, an, MPFR_LIMB_ONE << sh))
309 ap[an-1] = MPFR_LIMB_HIGHBIT;
354 if (rb == 0 && mpn_add_1(ap, ap, an, MPFR_LIMB_ONE << sh))
362 ap[an-1] = MPFR_LIMB_HIGHBIT;
420 } /* bn > an */
521 if (MPFR_UNLIKELY(mpn_add_1 (ap, ap, an, MPFR_LIMB_ONE << sh)))
529 ap[an-1] = MPFR_LIMB_HIGHBIT;