Searched refs:nn (Results 1 - 25 of 78) sorted by relevance

1234

/haiku-buildtools/isl/test_inputs/codegen/
H A Dunroll6.c2 if (((-t1 + 128) % 128) + nn >= 128 * g + 130 && 128 * g + 127 >= (-t1 + 128) % 128 && nn >= 128 * g + 6)
3 for (int c1 = 393214; c1 < nn - 1; c1 += 393216)
5 if (nn >= t1 + 128 * g + 130 && t1 + 128 * g >= -127 && t1 <= 2 && t1 >= 1)
6 for (int c1 = 393214; c1 < nn - 1; c1 += 393216)
/haiku-buildtools/gcc/gmp/mpn/generic/
H A Dbdiv_q.c34 mp_srcptr np, mp_size_t nn,
42 MPN_COPY (tp, np, nn);
44 mpn_sbpi1_bdiv_q (qp, tp, nn, dp, dn, di);
48 MPN_COPY (tp, np, nn);
50 mpn_dcpi1_bdiv_q (qp, tp, nn, dp, dn, di);
54 mpn_mu_bdiv_q (qp, np, nn, dp, dn, tp);
60 mpn_bdiv_q_itch (mp_size_t nn, mp_size_t dn) argument
63 return nn;
65 return mpn_mu_bdiv_q_itch (nn, dn);
33 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 Dbdiv_qr.c36 mp_srcptr np, mp_size_t nn,
44 BELOW_THRESHOLD (nn - dn, DC_BDIV_QR_THRESHOLD))
46 MPN_COPY (tp, np, nn);
48 rh = mpn_sbpi1_bdiv_qr (qp, tp, nn, dp, dn, di);
49 MPN_COPY (rp, tp + nn - dn, dn);
53 MPN_COPY (tp, np, nn);
55 rh = mpn_dcpi1_bdiv_qr (qp, tp, nn, dp, dn, di);
56 MPN_COPY (rp, tp + nn - dn, dn);
60 rh = mpn_mu_bdiv_qr (qp, rp, np, nn, dp, dn, tp);
67 mpn_bdiv_qr_itch (mp_size_t nn, mp_size_ argument
35 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
[all...]
H A Ddivrem.c29 mp_ptr np, mp_size_t nn,
33 ASSERT (nn >= dn);
36 ASSERT (! MPN_OVERLAP_P (np, nn, dp, dn));
37 ASSERT (! MPN_OVERLAP_P (qp, nn-dn+qxn, np, nn) || qp==np+dn+qxn);
38 ASSERT (! MPN_OVERLAP_P (qp, nn-dn+qxn, dp, dn));
39 ASSERT_MPN (np, nn);
50 q2p = TMP_ALLOC_LIMBS (nn + qxn);
52 np[0] = mpn_divrem_1 (q2p, qxn, np, nn, dp[0]);
53 qn = nn
28 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 Dsbpi1_bdiv_q.c31 /* Computes Q = N / D mod B^nn, destroys N.
51 mp_ptr np, mp_size_t nn,
59 ASSERT (nn >= dn);
62 for (i = nn - dn; i > 0; i--)
86 mpn_add_1 (qp - nn + 1, qp - nn + 1, nn, 1);
50 mpn_sbpi1_bdiv_q(mp_ptr qp, mp_ptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, mp_limb_t dinv) argument
H A Dtdiv_qr.c1 /* 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 ???)
38 mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn)
42 ASSERT (nn >= 0);
45 ASSERT (! MPN_OVERLAP_P (qp, nn - dn + 1 + qxn, np, nn));
46 ASSERT (! MPN_OVERLAP_P (qp, nn - dn + 1 + qxn, dp, dn));
55 rp[0] = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, dp[0]);
74 n2p = TMP_ALLOC_LIMBS (nn
37 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 Ddcpi1_div_q.c32 mpn_dcpi1_div_q (mp_ptr qp, mp_ptr np, mp_size_t nn, argument
43 ASSERT (nn - dn >= 3);
46 tp = TMP_SALLOC_LIMBS (nn + 1);
47 MPN_COPY (tp + 1, np, nn);
50 qn = nn - dn;
53 qh = mpn_dcpi1_divappr_q (wp, tp, nn + 1, dp, dn, dinv);
66 if (cy || mpn_cmp (tp, np, nn) > 0) /* At most is wrong by one, no cycle. */
/haiku-buildtools/gcc/gmp/tests/mpn/
H A Dt-bdiv.c58 mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, char *fname)
66 qn = nn - dn;
73 tp = TMP_ALLOC_LIMBS (nn + 1);
83 cmp = cy != rh || mpn_cmp (tp, np, nn) != 0;
86 cmp = mpn_cmp (tp, np, nn - dn) != 0;
92 printf ("N= "); dumpy (np, nn);
100 printf ("T= "); dumpy (tp, nn);
101 printf ("nn = %ld, dn = %ld, qn = %ld", nn, dn, qn);
138 mp_size_t maxnn, maxdn, nn, d local
57 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, char *fname) argument
[all...]
H A Dt-div.c58 mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn,
61 mp_size_t qn = nn - dn + 1;
69 tp = TMP_ALLOC_LIMBS (nn + 1);
75 for (i = 0; i < q_allowed_err && (tp[nn] > 0 || mpn_cmp (tp, np, nn) > 0); i++)
76 ASSERT_NOCARRY (refmpn_sub (tp, tp, nn+1, dp, dn));
78 if (tp[nn] > 0 || mpn_cmp (tp, np, nn) > 0)
85 printf ("N= "); dumpy (np, nn);
90 printf ("%5s=", tvalue); dumpy (tp, nn
57 check_one(mp_ptr qp, mp_srcptr rp, mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, char *fname, mp_limb_t q_allowed_err) argument
143 mp_size_t maxnn, maxdn, nn, dn, clearn, i; local
[all...]
/haiku-buildtools/gcc/gmp/mpz/
H A Dtdiv_ui.c28 mp_size_t ns, nn; local
41 nn = ABS(ns);
52 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */
61 qp = TMP_ALLOC_LIMBS (nn - 2 + 1);
62 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2);
70 rl = mpn_mod_1 (np, nn, (mp_limb_t) divisor);
H A Dcdiv_q_ui.c29 mp_size_t ns, nn, qn; local
43 nn = ABS(ns);
44 MPZ_REALLOC (quot, nn);
53 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */
63 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2);
65 qn = nn - 2 + 1;
79 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor);
87 qn = nn - (qp[nn - 1] == 0);
H A Dfdiv_q_ui.c28 mp_size_t ns, nn, qn; local
42 nn = ABS(ns);
43 MPZ_REALLOC (quot, nn);
52 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */
62 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2);
64 qn = nn - 2 + 1;
78 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor);
86 qn = nn - (qp[nn - 1] == 0);
H A Dtdiv_q_ui.c28 mp_size_t ns, nn, qn; local
42 nn = ABS(ns);
43 MPZ_REALLOC (quot, nn);
52 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */
61 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2);
63 qn = nn - 2 + 1; qn -= qp[qn - 1] == 0; qn -= qn != 0 && qp[qn - 1] == 0;
68 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor);
69 qn = nn - (qp[nn - 1] == 0);
H A Dcdiv_qr_ui.c30 mp_size_t ns, nn, qn; local
45 nn = ABS(ns);
46 MPZ_REALLOC (quot, nn);
60 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;
91 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor);
105 qn = nn - (qp[nn - 1] == 0);
H A Dfdiv_qr_ui.c28 mp_size_t ns, nn, qn; local
43 nn = ABS(ns);
44 MPZ_REALLOC (quot, nn);
58 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */
69 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2);
71 qn = nn - 2 + 1;
89 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor);
103 qn = nn - (qp[nn - 1] == 0);
H A Dtdiv_qr_ui.c29 mp_size_t ns, nn, qn; local
44 nn = ABS(ns);
45 MPZ_REALLOC (quot, nn);
56 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;
79 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor);
89 qn = nn - (qp[nn - 1] == 0);
H A Dcdiv_r_ui.c30 mp_size_t ns, nn; local
44 nn = ABS(ns);
57 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */
67 qp = TMP_ALLOC_LIMBS (nn - 2 + 1);
68 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2);
86 rl = mpn_mod_1 (np, nn, (mp_limb_t) divisor);
H A Dcdiv_ui.c30 mp_size_t ns, nn; local
43 nn = ABS(ns);
53 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */
63 qp = TMP_ALLOC_LIMBS (nn - 2 + 1);
64 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2);
81 rl = mpn_mod_1 (np, nn, (mp_limb_t) divisor);
H A Dfdiv_r_ui.c28 mp_size_t ns, nn; local
42 nn = ABS(ns);
55 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */
65 qp = TMP_ALLOC_LIMBS (nn - 2 + 1);
66 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2);
84 rl = mpn_mod_1 (np, nn, (mp_limb_t) divisor);
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/list/operations/
H A D42352.cc34 static int nn = 0; local
35 VERIFY( *it == nn++ );
56 static int nn = 9; local
57 VERIFY( *it == nn-- );
/haiku-buildtools/gcc/gmp/mpq/
H A Dset_d.c41 mp_size_t nn, dn; local
78 np[0] = tp[3], nn = 1;
80 np[1] = tp[3], np[0] = tp[2], nn = 2;
82 np[2] = tp[3], np[1] = tp[2], np[0] = tp[1], nn = 3;
84 np[3] = tp[3], np[2] = tp[2], np[1] = tp[1], np[0] = tp[0], nn = 4;
88 np[0] = tp[2], nn = 1;
90 np[1] = tp[2], np[0] = tp[1], nn = 2;
92 np[2] = tp[2], np[1] = tp[1], np[0] = tp[0], nn = 3;
96 np[0] = tp[1], nn = 1;
98 np[1] = tp[1], np[0] = tp[0], nn
[all...]
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/
H A Dcalloc-2.c4 int n, nn; variable
9 __builtin_memset (p, 0, nn);
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/i386/
H A Dpr64291-1.c20 long nn, dn; local
36 nn = nnn;
39 qp[nn - dn + 1] = 14883681;
43 itch = nn + 1;
49 f (np, nn);
H A Dpr63661.c29 int ni, nn, i, e; local
32 nn = 0;
45 nn = order;
48 ni = -nn;
60 s += 2 * nn * c[nn];
64 c[0] = nn;
/haiku-buildtools/gcc/gmp/tests/devel/
H A Ddivmod_1.c79 mp_size_t nn, fn; local
99 nn = random () % (SIZE + 1);
102 nn = SIZE;
107 dx[nn + fn + 1] = 0x12345678;
109 dy[nn + fn + 1] = 0x12345678;
110 mpn_random2 (np, nn);
130 mpn_print (np, nn);
133 printf ("nn=%ld\n", (long) nn);
139 mpn_divrem_1 (dx + 1, 0L, np, nn, dlim
[all...]

Completed in 184 milliseconds

1234