/netbsd-current/distrib/syspkg/sets/base/base-locale-nn/ |
H A D | Makefile | 3 PKGBASE=base-locale-nn
|
/netbsd-current/external/mit/isl/dist/test_inputs/codegen/ |
H A D | unroll6.c | 1 if (g >= 0 && nn >= 128 * g + 6 && nn >= ((t1 + 127) % 128) + 128 * g + 3) 2 for (int c1 = 393214; c1 < nn - 1; c1 += 393216) 4 if (t1 >= 1 && t1 <= 2 && nn >= t1 + 128 * g + 130 && t1 + 128 * g >= -127) 5 for (int c1 = 393214; c1 < nn - 1; c1 += 393216)
|
/netbsd-current/external/lgpl3/gmp/dist/mpn/generic/ |
H A D | bdiv_q.c | 44 mp_srcptr np, mp_size_t nn, 52 MPN_COPY (tp, np, nn); 54 mpn_sbpi1_bdiv_q (qp, tp, nn, dp, dn, di); 58 MPN_COPY (tp, np, nn); 60 mpn_dcpi1_bdiv_q (qp, tp, nn, dp, dn, di); 64 mpn_mu_bdiv_q (qp, np, nn, dp, dn, tp); 70 mpn_bdiv_q_itch (mp_size_t nn, mp_size_t dn) argument 73 return nn; 75 return mpn_mu_bdiv_q_itch (nn, dn); 43 mpn_bdiv_q(mp_ptr qp, mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, mp_ptr tp) argument
|
H A D | bdiv_qr.c | 46 mp_srcptr np, mp_size_t nn, 53 ASSERT (nn > dn); 55 BELOW_THRESHOLD (nn - dn, DC_BDIV_QR_THRESHOLD)) 57 MPN_COPY (tp, np, nn); 59 rh = mpn_sbpi1_bdiv_qr (qp, tp, nn, dp, dn, di); 60 MPN_COPY (rp, tp + nn - dn, dn); 64 MPN_COPY (tp, np, nn); 66 rh = mpn_dcpi1_bdiv_qr (qp, tp, nn, dp, dn, di); 67 MPN_COPY (rp, tp + nn - dn, dn); 71 rh = mpn_mu_bdiv_qr (qp, rp, np, nn, d 45 mpn_bdiv_qr(mp_ptr qp, mp_ptr rp, mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, mp_ptr tp) argument 78 mpn_bdiv_qr_itch(mp_size_t nn, mp_size_t dn) argument [all...] |
H A D | sec_div.c | 52 FNAME_itch (mp_size_t nn, mp_size_t dn) argument 55 /* Needs (nn + dn + 1) + mpn_sec_pi1_div_qr's needs of (2nn' - dn + 1) for a 56 total of 3nn + 4 limbs at tp. Note that mpn_sec_pi1_div_qr's nn is one 58 return 3 * nn + 4; 61 /* Needs (nn + dn + 1) + mpn_sec_pi1_div_r's needs of (dn + 1) for a total of 62 nn + 2dn + 2 limbs at tp. */ 63 return nn + 2 * dn + 2; 69 mp_ptr np, mp_size_t nn, variable [all...] |
H A D | divrem.c | 37 mp_ptr np, mp_size_t nn, 41 ASSERT (nn >= dn); 44 ASSERT (! MPN_OVERLAP_P (np, nn, dp, dn)); 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)); 47 ASSERT_MPN (np, nn); 58 q2p = TMP_ALLOC_LIMBS (nn + qxn); 60 np[0] = mpn_divrem_1 (q2p, qxn, np, nn, dp[0]); 61 qn = nn 36 mpn_divrem(mp_ptr qp, mp_size_t qxn, mp_ptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn) argument [all...] |
H A D | hgcd.c | 87 mp_size_t nn; local 104 nn = mpn_hgcd_reduce (M, ap, bp, n, p, tp); 105 if (nn) 107 n = nn; 116 nn = mpn_hgcd_step (n, ap, bp, s, M, tp); 117 if (!nn) 120 n = nn; 137 nn = mpn_hgcd (ap + p, bp + p, n - p, &M1, tp + scratch); 138 if (nn > 0) 153 n = mpn_hgcd_matrix_adjust (&M1, p + nn, a [all...] |
H A D | mu_div_q.c | 67 mp_srcptr np, mp_size_t nn, 78 qn = nn - dn; 82 if (qn >= dn) /* nn >= 2*dn + 1 */ 87 rp = TMP_BALLOC_LIMBS (nn + 1); 88 MPN_COPY (rp + 1, np, nn); 91 qh = mpn_cmp (rp + 1 + nn - dn, dp, dn) >= 0; 93 mpn_sub_n (rp + 1 + nn - dn, rp + 1 + nn - dn, dp, dn); 95 cy = mpn_mu_divappr_q (tp, rp, nn + 1, dp, dn, scratch); 123 if (cy || mpn_cmp (pp, np, nn) > 66 mpn_mu_div_q(mp_ptr qp, mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, mp_ptr scratch) argument 171 mpn_mu_div_q_itch(mp_size_t nn, mp_size_t dn, int mua_k) argument [all...] |
H A D | hgcd_appr.c | 91 mp_size_t nn; local 96 nn = mpn_hgcd_step (n, ap, bp, s, M, tp); 97 if (!nn) 100 n = nn; 159 mp_size_t nn; local 164 nn = mpn_hgcd_step (n, ap, bp, s, M, tp); 166 if (!nn) 169 n = nn; 191 mp_size_t nn; local 193 nn 203 mp_size_t nn; local 253 mp_size_t nn; local [all...] |
H A D | tdiv_qr.c | 1 /* mpn_tdiv_qr -- Divide the numerator (np,nn) by the denominator (dp,dn) and 2 write the nn-dn+1 quotient limbs at qp and the dn remainder limbs at rp. If 9 2. nn >= dn, even if qxn is non-zero. (??? relax this ???) 48 mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn) 52 ASSERT (nn >= 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)); 65 rp[0] = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, dp[0]); 83 n2p = TMP_ALLOC_LIMBS (nn 47 mpn_tdiv_qr(mp_ptr qp, mp_ptr rp, mp_size_t qxn, mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn) argument [all...] |
H A D | div_q.c | 42 N = {np,nn} 44 Q = {qp,nn-dn+1} 45 T = {scratch,nn+1} is scratch space 57 cannot put requirements on callers to copy a O(nn) operand. 59 If a caller does not care about the value of {np,nn+1} after calling this 66 We write nn-dn+1 limbs for the quotient, but return void. Why not return 70 generate all nn-dn+1 and return 0 or 1. I don't see how to fix that unless 101 mp_srcptr np, mp_size_t nn, 112 ASSERT (nn >= dn); 115 ASSERT (! MPN_OVERLAP_P (qp, nn 100 mpn_div_q(mp_ptr qp, mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, mp_ptr scratch) argument [all...] |
H A D | dcpi1_div_q.c | 42 mpn_dcpi1_div_q (mp_ptr qp, mp_ptr np, mp_size_t nn, argument 53 ASSERT (nn - dn >= 3); 56 tp = TMP_ALLOC_LIMBS (nn + 1); 57 MPN_COPY (tp + 1, np, nn); 60 qn = nn - dn; 63 qh = mpn_dcpi1_divappr_q (wp, tp, nn + 1, dp, dn, dinv); 76 if (cy || mpn_cmp (tp, np, nn) > 0) /* At most is wrong by one, no cycle. */
|
H A D | div_qr_2u_pi1.c | 43 d0, while {np,nn} is shifted on the fly. */ 45 mpn_div_qr_2u_pi1 (mp_ptr qp, mp_ptr rp, mp_srcptr np, mp_size_t nn, argument 52 ASSERT (nn >= 2); 56 r2 = np[nn-1] >> (GMP_LIMB_BITS - shift); 57 r1 = (np[nn-1] << shift) | (np[nn-2] >> (GMP_LIMB_BITS - shift)); 58 r0 = np[nn-2] << shift; 62 for (i = nn - 2 - 1; i >= 0; i--)
|
/netbsd-current/external/lgpl3/gmp/dist/tests/mpn/ |
H A D | t-div.c | 61 mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, 64 mp_size_t qn = nn - dn + 1; 72 tp = TMP_ALLOC_LIMBS (nn + 1); 78 for (i = 0; i < q_allowed_err && (tp[nn] > 0 || mpn_cmp (tp, np, nn) > 0); i++) 79 ASSERT_NOCARRY (refmpn_sub (tp, tp, nn+1, dp, dn)); 81 if (tp[nn] > 0 || mpn_cmp (tp, np, nn) > 0) 88 printf ("N= "); dumpy (np, nn); 93 printf ("%5s=", tvalue); dumpy (tp, nn 60 check_one(mp_ptr qp, mp_srcptr rp, mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, const char *fname, mp_limb_t q_allowed_err) argument 131 mp_size_t maxnn, maxdn, nn, dn, clearn, i; local [all...] |
H A D | t-bdiv.c | 60 mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, const char *fname) 67 qn = nn - dn; 74 tp = TMP_ALLOC_LIMBS (nn + 1); 81 cy = mpn_add_n (tp, tp, np, nn); 88 printf ("N= "); dumpy (np, nn); 96 printf ("T= "); dumpy (tp, nn); 97 printf ("nn = %ld, dn = %ld, qn = %ld", nn, dn, qn); 134 mp_size_t maxnn, maxdn, nn, dn, clearn, i; local 194 nn 59 check_one(mp_ptr qp, mp_srcptr rp, mp_limb_t rh, mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, const char *fname) argument [all...] |
/netbsd-current/external/lgpl3/gmp/dist/mpz/ |
H A D | tdiv_ui.c | 38 mp_size_t ns, nn; local 51 nn = ABS(ns); 62 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */ 71 qp = TMP_ALLOC_LIMBS (nn - 2 + 1); 72 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2); 80 rl = mpn_mod_1 (np, nn, (mp_limb_t) divisor);
|
H A D | cdiv_q_ui.c | 40 mp_size_t ns, nn, qn; local 54 nn = ABS(ns); 55 qp = MPZ_REALLOC (quot, nn); 63 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */ 73 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2); 75 qn = nn - 2 + 1; 89 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor); 97 qn = nn - (qp[nn - 1] == 0);
|
H A D | fdiv_q_ui.c | 38 mp_size_t ns, nn, qn; local 52 nn = ABS(ns); 53 qp = MPZ_REALLOC (quot, nn); 61 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */ 71 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2); 73 qn = nn - 2 + 1; 87 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor); 95 qn = nn - (qp[nn - 1] == 0);
|
H A D | tdiv_qr_ui.c | 39 mp_size_t ns, nn, qn; local 54 nn = ABS(ns); 55 qp = MPZ_REALLOC (quot, nn); 65 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */ 78 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2); 80 qn = nn - 2 + 1; qn -= qp[qn - 1] == 0; qn -= qn != 0 && qp[qn - 1] == 0; 87 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor); 95 qn = nn - (qp[nn - 1] == 0);
|
H A D | tdiv_q_ui.c | 38 mp_size_t ns, nn, qn; local 52 nn = ABS(ns); 53 qp = MPZ_REALLOC (quot, nn); 61 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */ 70 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2); 72 qn = nn - 2 + 1; qn -= qp[qn - 1] == 0; qn -= qn != 0 && qp[qn - 1] == 0; 77 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor); 78 qn = nn - (qp[nn - 1] == 0);
|
H A D | cdiv_qr_ui.c | 40 mp_size_t ns, nn, qn; local 55 nn = ABS(ns); 56 qp = MPZ_REALLOC (quot, nn); 68 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */ 79 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2); 81 qn = nn - 2 + 1; 99 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor); 113 qn = nn - (qp[nn - 1] == 0);
|
H A D | fdiv_qr_ui.c | 38 mp_size_t ns, nn, qn; local 53 nn = ABS(ns); 54 qp = MPZ_REALLOC (quot, nn); 66 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */ 77 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2); 79 qn = nn - 2 + 1; 97 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor); 111 qn = nn - (qp[nn - 1] == 0);
|
H A D | fdiv_r_ui.c | 38 mp_size_t ns, nn; local 52 nn = ABS(ns); 64 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */ 74 qp = TMP_ALLOC_LIMBS (nn - 2 + 1); 75 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2); 93 rl = mpn_mod_1 (np, nn, (mp_limb_t) divisor);
|
H A D | fdiv_ui.c | 38 mp_size_t ns, nn; local 51 nn = ABS(ns); 61 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */ 71 qp = TMP_ALLOC_LIMBS (nn - 2 + 1); 72 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2); 89 rl = mpn_mod_1 (np, nn, (mp_limb_t) divisor);
|
/netbsd-current/external/lgpl3/gmp/dist/mpq/ |
H A D | set_d.c | 52 mp_size_t nn, dn; local 87 np[0] = tp[3], nn = 1; 89 np[1] = tp[3], np[0] = tp[2], nn = 2; 91 np[2] = tp[3], np[1] = tp[2], np[0] = tp[1], nn = 3; 93 np[3] = tp[3], np[2] = tp[2], np[1] = tp[1], np[0] = tp[0], nn = 4; 98 np[0] = tp[2], nn = 1; 100 np[1] = tp[2], np[0] = tp[1], nn = 2; 102 np[2] = tp[2], np[1] = tp[1], np[0] = tp[0], nn = 3; 107 np[0] = tp[1], nn = 1; 109 np[1] = tp[1], np[0] = tp[0], nn [all...] |