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

  /src/external/lgpl3/gmp/dist/mpn/generic/
divrem.c 36 mpn_divrem (mp_ptr qp, mp_size_t qxn,
40 ASSERT (qxn >= 0);
45 ASSERT (! MPN_OVERLAP_P (qp, nn-dn+qxn, np, nn) || qp==np+dn+qxn);
46 ASSERT (! MPN_OVERLAP_P (qp, nn-dn+qxn, dp, dn));
58 q2p = TMP_ALLOC_LIMBS (nn + qxn);
60 np[0] = mpn_divrem_1 (q2p, qxn, np, nn, dp[0]);
61 qn = nn + qxn - 1;
70 return mpn_divrem_2 (qp, qxn, np, nn, dp);
80 if (UNLIKELY (qxn != 0)
    [all...]
divrem_2.c 42 quotient limbs at qp and the 2 long remainder at np. If qxn is non-zero,
52 3. nn >= 2, even if qxn is non-zero. */
55 mpn_divrem_2 (mp_ptr qp, mp_size_t qxn,
65 ASSERT (qxn >= 0);
67 ASSERT (! MPN_OVERLAP_P (qp, nn-2+qxn, np, nn) || qp >= np+2);
92 qp += qxn;
103 if (UNLIKELY (qxn != 0))
105 qp -= qxn;
106 for (i = qxn - 1; i >= 0; i--)
divrem_1.c 89 mpn_divrem_1 (mp_ptr qp, mp_size_t qxn,
97 ASSERT (qxn >= 0);
100 /* FIXME: What's the correct overlap rule when qxn!=0? */
101 ASSERT (MPN_SAME_OR_SEPARATE_P (qp+qxn, up, un));
103 n = un + qxn;
136 for (i = qxn - 1; i >= 0; i--)
157 for (i = qxn - 1; i >= 0; i--)
216 for (i = qxn - 1; i >= 0; i--)
245 for (i = qxn - 1; i >= 0; i--)
tdiv_qr.c 3 qxn is non-zero, generate that many fraction limbs and append them after the
9 2. nn >= dn, even if qxn is non-zero. (??? relax this ???)
47 mpn_tdiv_qr (mp_ptr qp, mp_ptr rp, mp_size_t qxn,
50 ASSERT_ALWAYS (qxn == 0);
55 ASSERT (! MPN_OVERLAP_P (qp, nn - dn + 1 + qxn, np, nn));
56 ASSERT (! MPN_OVERLAP_P (qp, nn - dn + 1 + qxn, dp, dn));
  /src/external/lgpl3/gmp/dist/tests/mpn/
t-divrem_1.c 34 mp_size_t qxn; member in struct:__anon23345
73 qsize = data[i].nsize + data[i].qxn;
76 got_r = mpn_divrem_1 (got_q, data[i].qxn, data[i].n, data[i].nsize,
86 printf (" qxn=%ld\n", (long) data[i].qxn);
98 got_r = mpn_preinv_divrem_1 (got_q, data[i].qxn,
  /src/external/lgpl3/mpfr/dist/src/
mpfr-mini-gmp.c 180 mpn_divrem_1 (mp_limb_t *qp, mp_size_t qxn, mp_limb_t *np, mp_size_t nn,
191 if (qxn == 0)
198 mpz_init2 (n, (nn + qxn) * GMP_NUMB_BITS);
199 mpn_copyi (n->_mp_d + qxn, np, nn);
200 mpn_zero (n->_mp_d, qxn);
201 n->_mp_size = nn + qxn;
206 if (q->_mp_size < nn + qxn)
207 mpn_zero (qp + q->_mp_size, nn + qxn - q->_mp_size);
211 if (qxn != 0)
249 mpn_tdiv_qr (mp_limb_t *qp, mp_limb_t *rp, mp_size_t qxn,
    [all...]
  /src/external/lgpl3/gmp/dist/mpn/ia64/
divrem_1.asm 61 C qxn = r33
95 shladd r32 = r15, 3, r32 C r32 = rp + n + qxn
98 adds r32 = -8, r32 C r32 = rp + n + qxn - 1
155 shladd r14 = r15, 3, r32 C r14 = rp + n + qxn
158 adds r32 = -8, r14 C r32 = rp + n + qxn - 1
  /src/external/lgpl3/gmp/dist/tests/
refmpn.c 1654 refmpn_divrem_2 (mp_ptr qp, mp_size_t qxn,
1661 tp = refmpn_malloc_limbs (nn + qxn);
1662 refmpn_zero (tp, qxn);
1663 refmpn_copyi (tp + qxn, np, nn);
1664 qh = refmpn_sb_div_qr (qp, tp, nn + qxn, dp, 2);
2340 refmpn_tdiv_qr (mp_ptr qp, mp_ptr rp, mp_size_t qxn,
2344 ASSERT (qxn == 0);

Completed in 28 milliseconds