/haiku-buildtools/gcc/gcc/testsuite/gcc.target/i386/ |
H A D | umod-3.c | 12 unsigned char cy; local 14 cy = cx / 6; if (cy != 1) abort (); 15 cy = cx % 6; if (cy != 1) abort ();
|
/haiku-buildtools/gcc/gmp/mpn/generic/ |
H A D | toom33_mul.c | 84 mp_limb_t cy, vinf0; local 119 cy = mpn_add (gp, a0, n, a2, s); 121 if (cy == 0 && mpn_cmp (gp, a1, n) < 0) 123 cy = mpn_add_n_sub_n (as1, asm1, a1, gp, n); 124 as1[n] = cy >> 1; 132 as1[n] = cy + (cy2 >> 1); 133 asm1[n] = cy - (cy2 & 1); 136 as1[n] = cy + mpn_add_n (as1, gp, a1, n); 137 if (cy == 0 && mpn_cmp (gp, a1, n) < 0) 145 cy [all...] |
H A D | toom_eval_pm2.c | 29 /* DO_addlsh2(d,a,b,n,cy) computes cy,{d,n} <- {a,n} + 4*(cy,{b,n}), it 32 #define DO_addlsh2(d, a, b, n, cy) \ 34 (cy) <<= 2; \ 35 (cy) += mpn_addlsh2_n(d, a, b, n); \ 39 #define DO_addlsh2(d, a, b, n, cy) \ 41 (cy) <<= 2; \ 42 (cy) += mpn_addlsh_n(d, a, b, n, 2); \ 47 #define DO_addlsh2(d, a, b, n, cy) \ 64 mp_limb_t cy; local [all...] |
H A D | redc_1.c | 31 mp_limb_t cy; local 38 cy = mpn_addmul_1 (up, mp, n, (up[0] * invm) & GMP_NUMB_MASK); 40 up[0] = cy; 43 cy = mpn_add_n (rp, up, up - n, n); 44 if (cy != 0)
|
H A D | redc_1_sec.c | 31 mp_limb_t cy; local 38 cy = mpn_addmul_1 (up, mp, n, (up[0] * invm) & GMP_NUMB_MASK); 40 up[0] = cy; 43 cy = mpn_add_n (rp, up, up - n, n); 44 mpn_subcnd_n (rp, rp, mp, n, cy);
|
H A D | toom3_sqr.c | 72 mp_limb_t cy, vinf0; local 93 cy = mpn_add (gp, a0, n, a2, s); 95 if (cy == 0 && mpn_cmp (gp, a1, n) < 0) 97 cy = mpn_add_n_sub_n (as1, asm1, a1, gp, n); 98 as1[n] = cy >> 1; 105 as1[n] = cy + (cy2 >> 1); 106 asm1[n] = cy - (cy2 & 1); 109 as1[n] = cy + mpn_add_n (as1, gp, a1, n); 110 if (cy == 0 && mpn_cmp (gp, a1, n) < 0) 117 cy [all...] |
H A D | sqrmod_bnm1.c | 39 mp_limb_t cy; local 44 cy = mpn_add_n (rp, tp, tp + rn, rn); 45 /* If cy == 1, then the value of rp is at most B^rn - 2, so there can 47 MPN_INCR_U (rp, rn, cy); 58 mp_limb_t cy; local 65 cy = tp[2*rn] + mpn_sub_n (rp, tp, tp+rn, rn); 67 MPN_INCR_U (rp, rn+1, cy ); 101 mp_limb_t cy; local 103 cy = mpn_add (rp, tp, rn, tp + rn, 2*an - rn); 104 MPN_INCR_U (rp, rn, cy); 113 mp_limb_t cy; local [all...] |
H A D | add_n.c | 30 mp_limb_t ul, vl, sl, rl, cy, cy1, cy2; local 36 cy = 0; 43 rl = sl + cy; 45 cy = cy1 | cy2; 50 return cy; 60 mp_limb_t ul, vl, rl, cy; local 66 cy = 0; 71 rl = ul + vl + cy; 72 cy = rl >> GMP_NUMB_BITS; 77 return cy; [all...] |
H A D | sub_n.c | 30 mp_limb_t ul, vl, sl, rl, cy, cy1, cy2; local 36 cy = 0; 43 rl = sl - cy; 45 cy = cy1 | cy2; 50 return cy; 60 mp_limb_t ul, vl, rl, cy; local 66 cy = 0; 71 rl = ul - vl - cy; 72 cy = rl >> (GMP_LIMB_BITS - 1); 77 return cy; [all...] |
H A D | subcnd_n.c | 33 mp_limb_t ul, vl, sl, rl, cy, cy1, cy2, mask; local 40 cy = 0; 47 rl = sl - cy; 49 cy = cy1 | cy2; 54 return cy; 64 mp_limb_t ul, vl, rl, cy, mask; local 71 cy = 0; 76 rl = ul - vl - cy; 77 cy = rl >> (GMP_LIMB_BITS - 1); 82 return cy; [all...] |
H A D | sqr_basecase.c | 59 mp_limb_t cy; local 79 cy = mpn_addmul_2s (tp + 2 * i, up + i + 1, n - (i + 1), up + i); 80 tp[n + i] = cy; 97 cy = mpn_addmul_2s (tp + 2 * i, up + i + 1, n - (i + 1), up + i); 98 tp[n + i] = cy; 100 cy = mpn_addmul_1 (tp + 2 * n - 4, up + n - 1, 1, up[n - 2]); 101 tp[2 * n - 3] = cy; 107 cy = mpn_addlsh1_n (rp + 1, rp + 1, tp, 2 * n - 2); 109 cy = mpn_lshift (tp, tp, 2 * n - 2, 1); 110 cy 141 mp_limb_t cy; local 273 mp_limb_t cy; local 282 mp_limb_t cy; local 289 mp_limb_t cy; local [all...] |
H A D | mulmod_bnm1.c | 40 mp_limb_t cy; local 45 cy = mpn_add_n (rp, tp, tp + rn, rn); 46 /* If cy == 1, then the value of rp is at most B^rn - 2, so there can 48 MPN_INCR_U (rp, rn, cy); 60 mp_limb_t cy; local 67 cy = tp[2*rn] + mpn_sub_n (rp, tp, tp+rn, rn); 69 MPN_INCR_U (rp, rn+1, cy ); 106 mp_limb_t cy; local 108 cy = mpn_add (rp, tp, rn, tp + rn, an + bn - rn); 109 MPN_INCR_U (rp, rn, cy); 118 mp_limb_t cy; local [all...] |
H A D | sbpi1_div_q.c | 42 mp_limb_t cy, cy1; local 91 cy = mpn_submul_1 (np - dn, dp, dn, q); 93 cy1 = n0 < cy; 94 n0 = (n0 - cy) & GMP_NUMB_MASK; 95 cy = n1 < cy1; 99 if (UNLIKELY (cy != 0)) 119 cy = mpn_submul_1 (np - dn, dp, dn + 2, q); 121 if (UNLIKELY (n1 != cy)) 123 if (n1 < (cy & flag)) 137 cy [all...] |
H A D | toom42_mul.c | 63 mp_limb_t cy, vinf0; local 102 cy = mpn_addlsh1_n (as2, a2, a3, s); 104 cy = mpn_add_1 (as2 + s, a2 + s, n - s, cy); 105 cy = 2 * cy + mpn_addlsh1_n (as2, a1, as2, n); 106 cy = 2 * cy + mpn_addlsh1_n (as2, a0, as2, n); 108 cy = mpn_lshift (as2, a3, s, 1); 109 cy [all...] |
H A D | dcpi1_bdiv_qr.c | 55 mp_limb_t cy; local 62 cy = mpn_sbpi1_bdiv_qr (qp, np, 2 * lo, dp, lo, dinv); 64 cy = mpn_dcpi1_bdiv_qr_n (qp, np, dp, lo, dinv, tp); 68 mpn_incr_u (tp + lo, cy); 72 cy = mpn_sbpi1_bdiv_qr (qp + lo, np + lo, 2 * hi, dp, hi, dinv); 74 cy = mpn_dcpi1_bdiv_qr_n (qp + lo, np + lo, dp, hi, dinv, tp); 78 mpn_incr_u (tp + hi, cy); 89 mp_limb_t rr, cy; local 112 cy = mpn_sbpi1_bdiv_qr (qp, np, 2 * qn, dp, qn, dinv); 114 cy [all...] |
H A D | toom62_mul.c | 59 mp_limb_t cy; local 109 cy = mpn_addlsh1_n (ash, a1, a0, n); 110 cy = 2*cy + mpn_addlsh1_n (ash, a2, ash, n); 111 cy = 2*cy + mpn_addlsh1_n (ash, a3, ash, n); 112 cy = 2*cy + mpn_addlsh1_n (ash, a4, ash, n); 117 ash[n] = 2*cy + mpn_lshift (ash + s, ash + s, n - s, 1); 121 ash[n] = 2*cy [all...] |
H A D | toom53_mul.c | 58 mp_limb_t cy; local 107 cy = mpn_addlsh1_n (ash, a1, a0, n); 108 cy = 2*cy + mpn_addlsh1_n (ash, a2, ash, n); 109 cy = 2*cy + mpn_addlsh1_n (ash, a3, ash, n); 114 ash[n] = 2*cy + mpn_lshift (ash + s, ash + s, n - s, 1); 118 ash[n] = 2*cy + mpn_addlsh1_n (ash, a4, ash, n); 120 cy = mpn_lshift (ash, a0, n, 1); 121 cy [all...] |
H A D | diveby3.c | 133 mpn_divexact_by3c (mp_ptr restrict rp, mp_srcptr restrict up, mp_size_t un, mp_limb_t cy) argument 139 ASSERT (cy == 0 || cy == 1 || cy == 2); 142 cl = cy == 0 ? 0 : cy == 1 ? -MODLIMB_INVERSE_3 : -2*MODLIMB_INVERSE_3; 151 qx = q + (s < cy); 156 cy = c2 + c3; 160 return cy;
|
H A D | bdiv_dbm1c.c | 33 mp_limb_t a, p0, p1, cy; local 41 cy = h < p0; 44 h = h - p1 - cy;
|
/haiku-buildtools/gcc/libquadmath/printf/ |
H A D | add_n.c | 36 register mp_limb_t x, y, cy; local 48 cy = 0; 53 y += cy; /* add previous carry to one addend */ 54 cy = (y < cy); /* get out carry from that addition */ 56 cy = (y < x) + cy; /* get out carry from that add, combine */ 61 return cy;
|
H A D | sub_n.c | 36 register mp_limb_t x, y, cy; local 48 cy = 0; 53 y += cy; /* add previous carry to subtrahend */ 54 cy = (y < cy); /* get out carry from that addition */ 56 cy = (y > x) + cy; /* get out carry from the subtract, combine */ 61 return cy;
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20020201-1.c | 15 unsigned char cy; local 21 cy = cx / 6; if (cy != 1) abort (); 22 cy = cx % 6; if (cy != 1) abort ();
|
/haiku-buildtools/gcc/gmp/mpz/ |
H A D | mul_i.h | 50 mp_limb_t cy; local 67 cy = mpn_mul_1 (pp, PTR(mult), size, sml & GMP_NUMB_MASK); 68 pp[size] = cy; 69 size += cy != 0; 82 cy = mpn_mul_1 (tp, PTR(mult), size, sml & GMP_NUMB_MASK); 83 tp[size] = cy; 84 cy = mpn_addmul_1 (tp + 1, PTR(mult), size, sml >> GMP_NUMB_BITS); 85 tp[size + 1] = cy;
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/aarch64/aapcs64/ |
H A D | test_quad_double.c | 17 CTFtype cy = 5.0 + 6.0i; variable 24 ANON (CTFtype, cy, Q3)
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ |
H A D | pr28243.c | 19 static void PSMyArc(double cx, double cy, double radx, double rady, double sa, argument 35 float cy; local 39 PSMyArc(cx, cy, radx, rady, 0, 360);
|