Lines Matching defs:n*
24 along with the GNU MP Library. If not, see http://www.gnu.org/licenses/. */
41 complex qn>=dn arm would be to allocate a temporary nn+1 limb buffer, then
46 mpn_mu_divappr_q rounding problem, now we multiply and compare.
47 Unfortunately, since mpn_mu_divappr_q does not return the partial
52 then would need to be amended.
62 mp_srcptr np, mp_size_t nn,
73 qn = nn - dn;
77 if (qn >= dn) /* nn >= 2*dn + 1 */
79 /* Find max inverse size needed by the two preinv calls. FIXME: This is
80 not optimal, it underestimates the invariance. */
121 qh = mpn_preinv_mu_div_qr (tp + dn + 1, rp + dn + 1, np + dn, qn, dp, dn,
124 MPN_COPY (rp + 1, np, dn);
153 pp = TMP_BALLOC_LIMBS (nn);
158 if (cy || mpn_cmp (pp, np, nn) > 0) /* At most is wrong by one, no cycle. */
169 /* FIXME: When nn = 2dn-1, qn becomes dn-1, and the numerator size passed
170 here becomes 2dn, i.e., more than nn. This shouldn't hurt, since only
171 the most significant dn-1 limbs will actually be read, but it is not
174 qh = mpn_mu_divappr_q (tp, np + nn - (2 * qn + 2), 2 * qn + 2,
189 rp = TMP_BALLOC_LIMBS (nn);
194 if (cy || mpn_cmp (rp, np, nn) > 0) /* At most is wrong by one, no cycle. */
206 mpn_mu_div_q_itch (mp_size_t nn, mp_size_t dn, int mua_k)
210 qn = nn - dn;