Searched refs:qn (Results 1 - 25 of 54) sorted by relevance

123

/netbsd-current/external/lgpl3/gmp/dist/mpn/generic/
H A Ddcpi1_bdiv_q.c97 mp_size_t qn; local
110 qn = nn;
112 if (qn > dn)
114 /* Reduce qn mod dn in a super-efficient manner. */
116 qn -= dn;
117 while (qn > dn);
120 if (BELOW_THRESHOLD (qn, DC_BDIV_QR_THRESHOLD))
121 cy = mpn_sbpi1_bdiv_qr (qp, np, 2 * qn, dp, qn, dinv);
123 cy = mpn_dcpi1_bdiv_qr_n (qp, np, dp, qn, din
[all...]
H A Ddcpi1_bdiv_qr.c45 q = -n * d^{-1} mod 2^{qn * GMP_NUMB_BITS},
47 r = (n + q * d) * 2^{-qn * GMP_NUMB_BITS}
98 mp_size_t qn; local
111 qn = nn - dn;
113 if (qn > dn)
115 /* Reduce qn mod dn without division, optimizing small operations. */
117 qn -= dn;
118 while (qn > dn);
121 if (BELOW_THRESHOLD (qn, DC_BDIV_QR_THRESHOLD))
122 cy = mpn_sbpi1_bdiv_qr (qp, np, 2 * qn, d
[all...]
H A Dmu_div_q.c72 mp_size_t qn; local
78 qn = nn - dn;
80 tp = TMP_BALLOC_LIMBS (qn + 1);
82 if (qn >= dn) /* nn >= 2*dn + 1 */
100 canonically reduced, replace the returned value of B^(qn-dn)+eps
103 for (i = 0; i < qn + 1; i++)
111 MPN_COPY (qp, tp + 1, qn);
119 mpn_mul (pp, tp + 1, qn, dp, dn);
121 cy = (qh != 0) ? mpn_add_n (pp + qn, pp + qn, d
173 mp_size_t qn; local
[all...]
H A Ddcpi1_divappr_q.c88 mp_size_t qn; local
99 qn = nn - dn;
100 qp += qn;
104 if (qn >= dn)
106 qn++; /* pretend we'll need an extra limb */
107 /* Reduce qn mod dn without division, optimizing small operations. */
109 qn -= dn;
110 while (qn > dn);
112 qp -= qn; /* point at low limb of next quotient block */
113 np -= qn; /* poin
[all...]
H A Dremove.c90 mp_size_t pn, nn, qn, i; local
108 qn = un;
111 while (qn >= pn)
113 qp[qn] = 0;
114 mpn_bdiv_qr_wrap (qp2, tp, qp, qn + 1, pp, pn);
122 qn = qn - pn;
123 mpn_neg (qp, qp, qn+1);
125 qn += qp[qn] !
[all...]
H A Ddcpi1_div_q.c47 mp_size_t qn; local
60 qn = nn - dn;
61 wp = TMP_ALLOC_LIMBS (qn + 1);
69 if (qn > dn)
70 mpn_mul (tp, wp + 1, qn, dp, dn);
72 mpn_mul (tp, dp, dn, wp + 1, qn);
74 cy = (qh != 0) ? mpn_add_n (tp + qn, tp + qn, dp, dn) : 0;
77 qh -= mpn_sub_1 (qp, wp + 1, qn, 1);
79 MPN_COPY (qp, wp + 1, qn);
[all...]
H A Ddcpi1_div_qr.c95 mp_size_t qn; local
108 qn = nn - dn;
109 qp += qn;
113 if (qn > dn)
115 /* Reduce qn mod dn without division, optimizing small operations. */
117 qn -= dn;
118 while (qn > dn);
120 qp -= qn; /* point at low limb of next quotient block */
121 np -= qn; /* point in the middle of partial remainder */
124 if (qn
[all...]
H A Dmu_bdiv_qr.c1 /* mpn_mu_bdiv_qr(qp,rp,np,nn,dp,dn,tp) -- Compute {np,nn} / {dp,dn} mod B^qn,
2 where qn = nn-dn, storing the result in {qp,qn}. Overlap allowed between Q
64 FIXME: Trim allocation for (qn > dn) case, 3*dn might be possible. In
74 mp_size_t qn; local
79 qn = nn - dn;
82 ASSERT (qn >= 2);
84 if (qn > dn)
96 b = (qn - 1) / dn + 1; /* ceil(qn/d
281 mp_size_t qn, in, tn, itch_binvert, itch_out, itches; local
[all...]
H A Ddiv_q.c56 intended to support average-O(qn) division, and for that to be effective, it
76 It might make sense to split the if-else parts of the (qn + FUDGE
106 mp_size_t new_nn, qn; local
128 qn = nn - dn + 1; /* Quotient size, high limb might be zero */
130 if (qn + FUDGE >= dn)
172 qp[qn - 1] = qh;
212 tp = TMP_ALLOC_LIMBS (qn + 1);
215 new_nn = 2 * qn + 1;
231 new_dp = TMP_ALLOC_LIMBS (qn + 1);
232 mpn_lshift (new_dp, dp + dn - (qn
[all...]
H A Dtdiv_qr.c11 The time complexity of this is O(qn*qn+M(dn,qn)), where M(m,n) is the time
172 limbs forming a quotient of qn=nn-dn+1 limbs. When qn is small
175 dependent only on qn.
179 1) Divide the 2 x qn most significant limbs from the numerator
180 by the qn most significant limbs from the denominator. Call
201 mp_size_t qn; local
209 qn
[all...]
H A Dmu_div_qr.c80 really make sense? It seem like the quotient between dn and qn might be
105 mp_size_t qn; local
108 qn = nn - dn;
109 if (qn + MU_DIV_QR_SKEW_THRESHOLD < dn)
114 |______| quotient (prel) qn
121 qh = mpn_mu_div_qr2 (qp, rp + nn - (2 * qn + 1),
122 np + nn - (2 * qn + 1), 2 * qn + 1,
123 dp + dn - (qn + 1), qn
166 mp_size_t qn, in; local
244 mp_size_t qn; local
367 mpn_mu_div_qr_choose_in(mp_size_t qn, mp_size_t dn, int k) argument
[all...]
H A Dmu_bdiv_q.c64 FIXME: Trim allocation for (qn > dn) case, 3*dn might be possible. In
66 FIXME: Trim final quotient calculation to qn limbs of precision.
74 mp_size_t qn; local
79 qn = nn;
82 ASSERT (qn >= 2);
84 if (qn > dn)
97 b = (qn - 1) / dn + 1; /* ceil(qn/dn), number of blocks */
98 in = (qn - 1) / b + 1; /* ceil(qn/
240 mp_size_t qn, in, tn, itch_binvert, itch_out, itches; local
[all...]
H A Dmu_divappr_q.c85 mp_size_t qn, in; local
91 qn = nn - dn;
94 if (qn + 1 < dn)
96 np += dn - (qn + 1);
97 nn -= dn - (qn + 1);
98 dp += dn - (qn + 1);
99 dn = qn + 1;
103 in = mpn_mu_divappr_q_choose_in (qn, dn, 0);
171 mp_size_t qn; local
180 qn
318 mpn_mu_divappr_q_choose_in(mp_size_t qn, mp_size_t dn, int k) argument
353 mp_size_t qn, in, itch_local, itch_out, itch_invapp; local
[all...]
H A Ddivrem.c54 mp_size_t qn; local
61 qn = nn + qxn - 1;
62 MPN_COPY (qp, q2p, qn);
63 ret = q2p[qn];
76 mp_size_t qn; local
88 qn = nn - dn + qxn;
89 MPN_COPY (qp, q2p, qn);
90 qhl = q2p[qn];
96 qn = nn - dn;
97 MPN_COPY (qp, q2p, qn);
[all...]
H A Dsbpi1_div_q.c49 mp_size_t qn, i; local
66 qn = nn - dn;
67 if (qn + 1 < dn)
69 dp += dn - (qn + 1);
70 dn = qn + 1;
77 qp += qn;
88 for (i = qn - (dn + 2); i >= 0; i--)
230 if (qn + 1 < dn)
232 dp += dn - (qn + 1);
233 dn = qn
[all...]
H A Ddivexact.c50 mp_size_t qn; local
75 qn = nn + 1 - dn;
82 ss = (dn > qn) ? qn + 1 : dn;
88 /* Since we have excluded dn == 1, we have nn > qn, and we need
89 to shift one limb beyond qn. */
90 wp = TMP_ALLOC_LIMBS (qn + 1);
91 mpn_rshift (wp, np, qn + 1, shift);
95 if (dn > qn)
96 dn = qn;
139 mp_size_t qn; local
[all...]
/netbsd-current/external/lgpl3/gmp/dist/mpz/
H A Dcdiv_q_ui.c40 mp_size_t ns, nn, qn; local
67 qn = 1; /* a white lie, fixed below */
75 qn = nn - 2 + 1;
84 qn -= qp[qn - 1] == 0; qn -= qn != 0 && qp[qn - 1] == 0;
97 qn = nn - (qp[nn - 1] == 0);
100 SIZ(quot) = ns >= 0 ? qn
[all...]
H A Dfdiv_q_ui.c38 mp_size_t ns, nn, qn; local
65 qn = 1; /* a white lie, fixed below */
73 qn = nn - 2 + 1;
82 qn -= qp[qn - 1] == 0; qn -= qn != 0 && qp[qn - 1] == 0;
95 qn = nn - (qp[nn - 1] == 0);
98 SIZ(quot) = ns >= 0 ? qn
[all...]
H A Dtdiv_qr_ui.c39 mp_size_t ns, nn, qn; local
80 qn = nn - 2 + 1; qn -= qp[qn - 1] == 0; qn -= qn != 0 && qp[qn - 1] == 0;
95 qn = nn - (qp[nn - 1] == 0);
98 SIZ(quot) = ns >= 0 ? qn : -qn;
[all...]
H A Dtdiv_q_ui.c38 mp_size_t ns, nn, qn; local
72 qn = nn - 2 + 1; qn -= qp[qn - 1] == 0; qn -= qn != 0 && qp[qn - 1] == 0;
78 qn = nn - (qp[nn - 1] == 0);
81 SIZ(quot) = ns >= 0 ? qn : -qn;
[all...]
H A Ddivexact.c41 mp_size_t qn; local
68 qn = nn - dn + 1;
73 qp = TMP_ALLOC_LIMBS (qn);
75 qp = MPZ_NEWALLOC (quot, qn);
81 MPN_NORMALIZE (qp, qn);
84 MPN_COPY (MPZ_NEWALLOC (quot, qn), qp, qn); local
86 SIZ(quot) = (SIZ(num) ^ SIZ(den)) >= 0 ? qn : -qn;
H A Dcdiv_qr_ui.c40 mp_size_t ns, nn, qn; local
71 qn = 1; /* a white lie, fixed below */
81 qn = nn - 2 + 1;
92 qn -= qp[qn - 1] == 0; qn -= qn != 0 && qp[qn - 1] == 0;
113 qn = nn - (qp[nn - 1] == 0);
116 SIZ(quot) = ns >= 0 ? qn
[all...]
H A Dfdiv_qr_ui.c38 mp_size_t ns, nn, qn; local
69 qn = 1; /* a white lie, fixed below */
79 qn = nn - 2 + 1;
90 qn -= qp[qn - 1] == 0; qn -= qn != 0 && qp[qn - 1] == 0;
111 qn = nn - (qp[nn - 1] == 0);
114 SIZ(quot) = ns >= 0 ? qn
[all...]
/netbsd-current/external/cddl/dtracetoolkit/dist/Bin/
H A Ddexplorer149 if [[ `$dtrace -b1k -qn 'BEGIN { trace(pid); exit(0); }'` == "" ]]; then
244 $dtrace -qn "$header"'
254 $dtrace -qn "$header"'
275 $dtrace -qn "$header"'
285 $dtrace -qn "$header"'
299 $dtrace -qn "$header"'
309 $dtrace -qn "$header"'
324 $dtrace -qn "$header"'
333 $dtrace -qn "$header"'
344 $dtrace -qn "
[all...]
/netbsd-current/external/cddl/dtracetoolkit/dist/
H A Ddexplorer149 if [[ `$dtrace -b1k -qn 'BEGIN { trace(pid); exit(0); }'` == "" ]]; then
244 $dtrace -qn "$header"'
254 $dtrace -qn "$header"'
275 $dtrace -qn "$header"'
285 $dtrace -qn "$header"'
299 $dtrace -qn "$header"'
309 $dtrace -qn "$header"'
324 $dtrace -qn "$header"'
333 $dtrace -qn "$header"'
344 $dtrace -qn "
[all...]

Completed in 130 milliseconds

123