/dports/math/gmp/gmp-6.2.1/mpn/generic/ |
H A D | divrem.c | 36 mpn_divrem (mp_ptr qp, mp_size_t qxn, in mpn_divrem() argument 40 ASSERT (qxn >= 0); in mpn_divrem() 45 ASSERT (! MPN_OVERLAP_P (qp, nn-dn+qxn, np, nn) || qp==np+dn+qxn); in mpn_divrem() 58 q2p = TMP_ALLOC_LIMBS (nn + qxn); in mpn_divrem() 61 qn = nn + qxn - 1; in mpn_divrem() 80 if (UNLIKELY (qxn != 0)) in mpn_divrem() 83 TMP_ALLOC_LIMBS_2 (n2p, nn + qxn, in mpn_divrem() 84 q2p, nn - dn + qxn + 1); in mpn_divrem() 85 MPN_ZERO (n2p, qxn); in mpn_divrem() 86 MPN_COPY (n2p + qxn, np, nn); in mpn_divrem() [all …]
|
H A D | divrem_2.c | 55 mpn_divrem_2 (mp_ptr qp, mp_size_t qxn, in mpn_divrem_2() argument 65 ASSERT (qxn >= 0); in mpn_divrem_2() 67 ASSERT (! MPN_OVERLAP_P (qp, nn-2+qxn, np, nn) || qp >= np+2); in mpn_divrem_2() 92 qp += qxn; in mpn_divrem_2() 103 if (UNLIKELY (qxn != 0)) in mpn_divrem_2() 105 qp -= qxn; in mpn_divrem_2() 106 for (i = qxn - 1; i >= 0; i--) in mpn_divrem_2()
|
H A D | divrem_1.c | 89 mpn_divrem_1 (mp_ptr qp, mp_size_t qxn, in mpn_divrem_1() argument 97 ASSERT (qxn >= 0); in mpn_divrem_1() 101 ASSERT (MPN_SAME_OR_SEPARATE_P (qp+qxn, up, un)); in mpn_divrem_1() 103 n = un + qxn; in mpn_divrem_1() 136 for (i = qxn - 1; i >= 0; i--) in mpn_divrem_1() 157 for (i = qxn - 1; i >= 0; i--) in mpn_divrem_1() 216 for (i = qxn - 1; i >= 0; i--) in mpn_divrem_1() 245 for (i = qxn - 1; i >= 0; i--) in mpn_divrem_1()
|
H A D | tdiv_qr.c | 47 mpn_tdiv_qr (mp_ptr qp, mp_ptr rp, mp_size_t qxn, in mpn_tdiv_qr() argument 50 ASSERT_ALWAYS (qxn == 0); in mpn_tdiv_qr() 55 ASSERT (! MPN_OVERLAP_P (qp, nn - dn + 1 + qxn, np, nn)); in mpn_tdiv_qr() 56 ASSERT (! MPN_OVERLAP_P (qp, nn - dn + 1 + qxn, dp, dn)); in mpn_tdiv_qr()
|
/dports/math/kalker/gmp-mpfr-sys-21966f4bfb56c87d407eb14c72e92ef4e55856aa/gmp-6.2.1-c/mpn/generic/ |
H A D | divrem.c | 36 mpn_divrem (mp_ptr qp, mp_size_t qxn, in mpn_divrem() argument 40 ASSERT (qxn >= 0); in mpn_divrem() 45 ASSERT (! MPN_OVERLAP_P (qp, nn-dn+qxn, np, nn) || qp==np+dn+qxn); in mpn_divrem() 58 q2p = TMP_ALLOC_LIMBS (nn + qxn); in mpn_divrem() 61 qn = nn + qxn - 1; in mpn_divrem() 80 if (UNLIKELY (qxn != 0)) in mpn_divrem() 83 TMP_ALLOC_LIMBS_2 (n2p, nn + qxn, in mpn_divrem() 84 q2p, nn - dn + qxn + 1); in mpn_divrem() 85 MPN_ZERO (n2p, qxn); in mpn_divrem() 86 MPN_COPY (n2p + qxn, np, nn); in mpn_divrem() [all …]
|
H A D | divrem_2.c | 55 mpn_divrem_2 (mp_ptr qp, mp_size_t qxn, in mpn_divrem_2() argument 65 ASSERT (qxn >= 0); in mpn_divrem_2() 67 ASSERT (! MPN_OVERLAP_P (qp, nn-2+qxn, np, nn) || qp >= np+2); in mpn_divrem_2() 92 qp += qxn; in mpn_divrem_2() 103 if (UNLIKELY (qxn != 0)) in mpn_divrem_2() 105 qp -= qxn; in mpn_divrem_2() 106 for (i = qxn - 1; i >= 0; i--) in mpn_divrem_2()
|
H A D | divrem_1.c | 89 mpn_divrem_1 (mp_ptr qp, mp_size_t qxn, in mpn_divrem_1() argument 97 ASSERT (qxn >= 0); in mpn_divrem_1() 101 ASSERT (MPN_SAME_OR_SEPARATE_P (qp+qxn, up, un)); in mpn_divrem_1() 103 n = un + qxn; in mpn_divrem_1() 136 for (i = qxn - 1; i >= 0; i--) in mpn_divrem_1() 157 for (i = qxn - 1; i >= 0; i--) in mpn_divrem_1() 216 for (i = qxn - 1; i >= 0; i--) in mpn_divrem_1() 245 for (i = qxn - 1; i >= 0; i--) in mpn_divrem_1()
|
/dports/math/gap/gap-4.11.0/extern/gmp/mpn/generic/ |
H A D | divrem.c | 37 mpn_divrem (mp_ptr qp, mp_size_t qxn, in mpn_divrem() argument 41 ASSERT (qxn >= 0); in mpn_divrem() 46 ASSERT (! MPN_OVERLAP_P (qp, nn-dn+qxn, np, nn) || qp==np+dn+qxn); in mpn_divrem() 59 q2p = TMP_ALLOC_LIMBS (nn + qxn); in mpn_divrem() 62 qn = nn + qxn - 1; in mpn_divrem() 81 if (UNLIKELY (qxn != 0)) in mpn_divrem() 84 n2p = TMP_ALLOC_LIMBS (nn + qxn); in mpn_divrem() 85 MPN_ZERO (n2p, qxn); in mpn_divrem() 86 MPN_COPY (n2p + qxn, np, nn); in mpn_divrem() 87 q2p = TMP_ALLOC_LIMBS (nn - dn + qxn + 1); in mpn_divrem() [all …]
|
H A D | divrem_2.c | 56 mpn_divrem_2 (mp_ptr qp, mp_size_t qxn, in mpn_divrem_2() argument 66 ASSERT (qxn >= 0); in mpn_divrem_2() 68 ASSERT (! MPN_OVERLAP_P (qp, nn-2+qxn, np, nn) || qp >= np+2); in mpn_divrem_2() 93 qp += qxn; in mpn_divrem_2() 104 if (UNLIKELY (qxn != 0)) in mpn_divrem_2() 106 qp -= qxn; in mpn_divrem_2() 107 for (i = qxn - 1; i >= 0; i--) in mpn_divrem_2()
|
H A D | divrem_1.c | 90 mpn_divrem_1 (mp_ptr qp, mp_size_t qxn, in mpn_divrem_1() argument 98 ASSERT (qxn >= 0); in mpn_divrem_1() 102 ASSERT (MPN_SAME_OR_SEPARATE_P (qp+qxn, up, un)); in mpn_divrem_1() 104 n = un + qxn; in mpn_divrem_1() 137 for (i = qxn - 1; i >= 0; i--) in mpn_divrem_1() 158 for (i = qxn - 1; i >= 0; i--) in mpn_divrem_1() 217 for (i = qxn - 1; i >= 0; i--) in mpn_divrem_1() 246 for (i = qxn - 1; i >= 0; i--) in mpn_divrem_1()
|
/dports/math/mpir/mpir-3.0.0/mpn/generic/ |
H A D | divrem.c | 30 mpn_divrem (mp_ptr qp, mp_size_t qxn, in mpn_divrem() argument 34 ASSERT (qxn >= 0); in mpn_divrem() 39 ASSERT (! MPN_OVERLAP_P (qp, nn-dn+qxn, np, nn) || qp==np+dn+qxn); in mpn_divrem() 40 ASSERT (! MPN_OVERLAP_P (qp, nn-dn+qxn, dp, dn)); in mpn_divrem() 55 qn = nn + qxn - 1; in mpn_divrem() 64 return mpn_divrem_2 (qp, qxn, np, nn, dp); in mpn_divrem() 74 if (UNLIKELY (qxn != 0)) in mpn_divrem() 78 MPN_ZERO (n2p, qxn); in mpn_divrem() 79 MPN_COPY (n2p + qxn, np, nn); in mpn_divrem() 82 mpn_tdiv_qr (q2p, rp, 0L, n2p, nn + qxn, dp, dn); in mpn_divrem() [all …]
|
H A D | sqrtrem.c | 38 ASSERT (qxn >= 0); in mpn_intdivrem() 43 ASSERT (! MPN_OVERLAP_P (qp, nn-dn+qxn, np, nn) || qp==np+dn+qxn); in mpn_intdivrem() 44 ASSERT (! MPN_OVERLAP_P (qp, nn-dn+qxn, dp, dn)); in mpn_intdivrem() 58 np[0] = mpn_divrem_1 (q2p, qxn, np, nn, dp[0]); in mpn_intdivrem() 59 qn = nn + qxn - 1; in mpn_intdivrem() 68 return mpn_divrem_2 (qp, qxn, np, nn, dp); in mpn_intdivrem() 78 if (UNLIKELY (qxn != 0)) in mpn_intdivrem() 82 MPN_ZERO (n2p, qxn); in mpn_intdivrem() 83 MPN_COPY (n2p + qxn, np, nn); in mpn_intdivrem() 86 mpn_tdiv_qr (q2p, rp, 0L, n2p, nn + qxn, dp, dn); in mpn_intdivrem() [all …]
|
H A D | divrem_1.c | 81 mpn_divrem_1 (mp_ptr qp, mp_size_t qxn, in mpn_divrem_1() argument 89 ASSERT (qxn >= 0); in mpn_divrem_1() 93 ASSERT (MPN_SAME_OR_SEPARATE_P (qp+qxn, up, un)); in mpn_divrem_1() 95 n = un + qxn; in mpn_divrem_1() 101 if(qxn==0) in mpn_divrem_1() 139 for (i = qxn - 1; i >= 0; i--) in mpn_divrem_1() 160 for (i = qxn - 1; i >= 0; i--) in mpn_divrem_1() 219 for (i = qxn - 1; i >= 0; i--) in mpn_divrem_1() 249 for (i = qxn - 1; i >= 0; i--) in mpn_divrem_1()
|
H A D | divrem_2.c | 65 mpn_divrem_2 (mp_ptr qp, mp_size_t qxn, in mpn_divrem_2() argument 77 ASSERT (qxn >= 0); in mpn_divrem_2() 79 ASSERT (! MPN_OVERLAP_P (qp, nn-2+qxn, np, nn) || qp+2 >= np); in mpn_divrem_2() 84 if (qxn==0) return mpn_divrem_euclidean_qr_2(qp,np,nn,dp); in mpn_divrem_2() 105 use_preinv = ABOVE_THRESHOLD (qxn + nn - 2, DIVREM_2_THRESHOLD); in mpn_divrem_2() 109 for (i = qxn + nn - 2 - 1; i >= 0; i--) in mpn_divrem_2() 114 if (i >= qxn) in mpn_divrem_2()
|
H A D | divrem_euclidean_qr_1.c | 78 mp_limb_t mpn_divrem_euclidean_qr_1(mp_ptr qp, mp_size_t qxn, in mpn_divrem_euclidean_qr_1() argument 88 ASSERT_ALWAYS(qxn == 0); in mpn_divrem_euclidean_qr_1()
|
/dports/math/mingw32-libgmp/gmp-6.0.0/mpn/generic/ |
H A D | divrem.c | 37 mpn_divrem (mp_ptr qp, mp_size_t qxn, in mpn_divrem() argument 41 ASSERT (qxn >= 0); in mpn_divrem() 46 ASSERT (! MPN_OVERLAP_P (qp, nn-dn+qxn, np, nn) || qp==np+dn+qxn); in mpn_divrem() 59 q2p = TMP_ALLOC_LIMBS (nn + qxn); in mpn_divrem() 62 qn = nn + qxn - 1; in mpn_divrem() 81 if (UNLIKELY (qxn != 0)) in mpn_divrem() 84 n2p = TMP_ALLOC_LIMBS (nn + qxn); in mpn_divrem() 85 MPN_ZERO (n2p, qxn); in mpn_divrem() 86 MPN_COPY (n2p + qxn, np, nn); in mpn_divrem() 87 q2p = TMP_ALLOC_LIMBS (nn - dn + qxn + 1); in mpn_divrem() [all …]
|
H A D | divrem_2.c | 56 mpn_divrem_2 (mp_ptr qp, mp_size_t qxn, in mpn_divrem_2() argument 66 ASSERT (qxn >= 0); in mpn_divrem_2() 68 ASSERT (! MPN_OVERLAP_P (qp, nn-2+qxn, np, nn) || qp >= np+2); in mpn_divrem_2() 93 qp += qxn; in mpn_divrem_2() 104 if (UNLIKELY (qxn != 0)) in mpn_divrem_2() 106 qp -= qxn; in mpn_divrem_2() 107 for (i = qxn - 1; i >= 0; i--) in mpn_divrem_2()
|
H A D | divrem_1.c | 90 mpn_divrem_1 (mp_ptr qp, mp_size_t qxn, in mpn_divrem_1() argument 98 ASSERT (qxn >= 0); in mpn_divrem_1() 102 ASSERT (MPN_SAME_OR_SEPARATE_P (qp+qxn, up, un)); in mpn_divrem_1() 104 n = un + qxn; in mpn_divrem_1() 137 for (i = qxn - 1; i >= 0; i--) in mpn_divrem_1() 158 for (i = qxn - 1; i >= 0; i--) in mpn_divrem_1() 217 for (i = qxn - 1; i >= 0; i--) in mpn_divrem_1() 246 for (i = qxn - 1; i >= 0; i--) in mpn_divrem_1()
|
/dports/math/mpir/mpir-3.0.0/mpf/ |
H A D | set_str.c | 60 ASSERT (qxn >= 0); in mpn_intdivrem() 65 ASSERT (! MPN_OVERLAP_P (qp, nn-dn+qxn, np, nn) || qp==np+dn+qxn); in mpn_intdivrem() 66 ASSERT (! MPN_OVERLAP_P (qp, nn-dn+qxn, dp, dn)); in mpn_intdivrem() 80 np[0] = mpn_divrem_1 (q2p, qxn, np, nn, dp[0]); in mpn_intdivrem() 81 qn = nn + qxn - 1; in mpn_intdivrem() 90 return mpn_divrem_2 (qp, qxn, np, nn, dp); in mpn_intdivrem() 100 if (UNLIKELY (qxn != 0)) in mpn_intdivrem() 104 MPN_ZERO (n2p, qxn); in mpn_intdivrem() 105 MPN_COPY (n2p + qxn, np, nn); in mpn_intdivrem() 108 mpn_tdiv_qr (q2p, rp, 0L, n2p, nn + qxn, dp, dn); in mpn_intdivrem() [all …]
|
/dports/math/kalker/gmp-mpfr-sys-21966f4bfb56c87d407eb14c72e92ef4e55856aa/mpfr-4.1.0-p13-c/src/ |
H A D | mpfr-mini-gmp.c | 176 mpn_divrem_1 (mp_limb_t *qp, mp_size_t qxn, mp_limb_t *np, mp_size_t nn, in mpn_divrem_1() argument 187 if (qxn == 0) in mpn_divrem_1() 194 mpz_init2 (n, (nn + qxn) * GMP_NUMB_BITS); in mpn_divrem_1() 195 mpn_copyi (n->_mp_d + qxn, np, nn); in mpn_divrem_1() 196 mpn_zero (n->_mp_d, qxn); in mpn_divrem_1() 197 n->_mp_size = nn + qxn; in mpn_divrem_1() 202 if (q->_mp_size < nn + qxn) in mpn_divrem_1() 203 mpn_zero (qp + q->_mp_size, nn + qxn - q->_mp_size); in mpn_divrem_1() 207 if (qxn != 0) in mpn_divrem_1() 245 mpn_tdiv_qr (mp_limb_t *qp, mp_limb_t *rp, mp_size_t qxn, in mpn_tdiv_qr() argument [all …]
|
/dports/math/gmp/gmp-6.2.1/tests/mpn/ |
H A D | t-divrem_1.c | 34 mp_size_t qxn; in check_data() member 73 qsize = data[i].nsize + data[i].qxn; in check_data() 76 got_r = mpn_divrem_1 (got_q, data[i].qxn, data[i].n, data[i].nsize, in check_data() 86 printf (" qxn=%ld\n", (long) data[i].qxn); in check_data() 98 got_r = mpn_preinv_divrem_1 (got_q, data[i].qxn, in check_data()
|
/dports/math/mpir/mpir-3.0.0/tests/mpn/ |
H A D | t-divrem_1.c | 37 mp_size_t qxn; in check_data() member 71 qsize = data[i].nsize + data[i].qxn; in check_data() 74 got_r = mpn_divrem_1 (got_q, data[i].qxn, data[i].n, data[i].nsize, in check_data() 84 printf (" qxn=%ld\n", (long) data[i].qxn); in check_data() 96 got_r = mpn_preinv_divrem_1 (got_q, data[i].qxn, in check_data()
|
/dports/math/mingw32-libgmp/gmp-6.0.0/tests/mpn/ |
H A D | t-divrem_1.c | 35 mp_size_t qxn; in check_data() member 74 qsize = data[i].nsize + data[i].qxn; in check_data() 77 got_r = mpn_divrem_1 (got_q, data[i].qxn, data[i].n, data[i].nsize, in check_data() 87 printf (" qxn=%ld\n", (long) data[i].qxn); in check_data() 99 got_r = mpn_preinv_divrem_1 (got_q, data[i].qxn, in check_data()
|
/dports/math/kalker/gmp-mpfr-sys-21966f4bfb56c87d407eb14c72e92ef4e55856aa/gmp-6.2.1-c/tests/mpn/ |
H A D | t-divrem_1.c | 34 mp_size_t qxn; in check_data() member 73 qsize = data[i].nsize + data[i].qxn; in check_data() 76 got_r = mpn_divrem_1 (got_q, data[i].qxn, data[i].n, data[i].nsize, in check_data() 86 printf (" qxn=%ld\n", (long) data[i].qxn); in check_data() 98 got_r = mpn_preinv_divrem_1 (got_q, data[i].qxn, in check_data()
|
/dports/math/gap/gap-4.11.0/extern/gmp/tests/mpn/ |
H A D | t-divrem_1.c | 35 mp_size_t qxn; in check_data() member 74 qsize = data[i].nsize + data[i].qxn; in check_data() 77 got_r = mpn_divrem_1 (got_q, data[i].qxn, data[i].n, data[i].nsize, in check_data() 87 printf (" qxn=%ld\n", (long) data[i].qxn); in check_data() 99 got_r = mpn_preinv_divrem_1 (got_q, data[i].qxn, in check_data()
|