HomeSort by: relevance | last modified time | path
    Searched defs:cy (Results 1 - 25 of 163) sorted by relevancy

1 2 3 4 5 6 7

  /src/external/lgpl3/gmp/dist/mpn/generic/
mulmid_basecase.c 52 mp_limb_t cy; local
70 cy = mpn_addmul_1 (rp, up, un, vp[0]);
71 add_ssaaaa (hi, lo, hi, lo, CNST_LIMB(0), cy);
redc_1.c 41 mp_limb_t cy; local
48 cy = mpn_addmul_1 (up, mp, n, (up[0] * invm) & GMP_NUMB_MASK);
50 up[0] = cy;
54 cy = mpn_add_n (rp, up, up - n, n);
55 return cy;
toom_eval_dgr3_pm2.c 45 mp_limb_t cy; local
56 cy = mpn_addlsh2_n (tp, xp + n, xp + 3*n, x3n);
60 cy = mpn_addlsh_n (tp, xp + n, xp + 3*n, x3n, 2);
63 cy = mpn_add_1 (tp + x3n, xp + n + x3n, n - x3n, cy);
64 tp[n] = cy;
66 cy = mpn_lshift (tp, xp + 2*n, n, 2);
67 xp2[n] = cy + mpn_add_n (xp2, tp, xp, n);
toom_eval_pm2exp.c 49 mp_limb_t cy; local
72 cy = mpn_addlsh_n (tp, tp, xp+k*n, hn, k*shift);
73 MPN_INCR_U (tp + hn, n+1 - hn, cy);
77 cy = mpn_addlsh_n (xp2, xp2, xp+k*n, hn, k*shift);
78 MPN_INCR_U (xp2 + hn, n+1 - hn, cy);
sbpi1_bdiv_q.c 63 mp_limb_t cy, hi; local
64 for (i = un - dn - 1, cy = 0; i > 0; i--)
71 hi += cy;
72 cy = hi < cy;
74 cy += hi < up[dn];
79 hi = cy + mpn_addmul_1 (up, dp, dn, q);
sbpi1_bdiv_qr.c 59 mp_limb_t cy; local
67 for (i = un - dn, cy = 0; i != 0; i--)
73 hi += cy;
74 cy = hi < cy;
76 cy += hi < up[dn];
81 return cy;
sbpi1_bdiv_r.c 58 mp_limb_t cy; local
65 for (i = un - dn, cy = 0; i != 0; i--)
70 hi += cy;
71 cy = hi < cy;
73 cy += hi < up[dn];
78 return cy;
toom_eval_pm2.c 39 /* DO_addlsh2(d,a,b,n,cy) computes cy,{d,n} <- {a,n} + 4*(cy,{b,n}), it
42 #define DO_addlsh2(d, a, b, n, cy) \
44 (cy) <<= 2; \
45 (cy) += mpn_addlsh2_n(d, a, b, n); \
49 #define DO_addlsh2(d, a, b, n, cy) \
51 (cy) <<= 2; \
52 (cy) += mpn_addlsh_n(d, a, b, n, 2); \
57 #define DO_addlsh2(d, a, b, n, cy) \
74 mp_limb_t cy; local
    [all...]
bdiv_dbm1c.c 43 mp_limb_t a, p0, p1, cy; local
51 cy = h < p0;
54 h = h - p1 - cy;
dcpi1_bdiv_q.c 63 mp_limb_t cy; local
68 cy = mpn_dcpi1_bdiv_qr_n (qp, np, dp, lo, dinv, tp);
75 cy += mpn_addmul_1 (np + lo, qp, lo, dp[lo]);
76 np[n - 1] += cy;
98 mp_limb_t cy; local
121 cy = mpn_sbpi1_bdiv_qr (qp, np, 2 * qn, dp, qn, dinv);
123 cy = mpn_dcpi1_bdiv_qr_n (qp, np, dp, qn, dinv, tp);
131 mpn_incr_u (tp + qn, cy);
134 cy = 0;
143 mpn_add_1 (np + dn, np + dn, qn - dn, cy);
    [all...]
dcpi1_div_q.c 67 mp_limb_t cy; local
74 cy = (qh != 0) ? mpn_add_n (tp + qn, tp + qn, dp, dn) : 0;
76 if (cy || mpn_cmp (tp, np, nn) > 0) /* At most is wrong by one, no cycle. */
redc_2.c 87 mp_limb_t cy; local
108 cy = mpn_add_n (rp, up, up - n, n);
109 return cy;
redc_n.c 53 mp_limb_t cy; local
72 cy = mpn_sub_n (yp + rn, yp, up, 2*n - rn); /* undo wrap around */
73 MPN_DECR_U (yp + 2*n - rn, rn, cy);
75 cy = mpn_sub_n (rp, up + n, yp + n, n);
76 if (cy != 0)
add_n.c 39 mp_limb_t ul, vl, sl, rl, cy, cy1, cy2; local
45 cy = 0;
52 rl = sl + cy;
54 cy = cy1 | cy2;
59 return cy;
69 mp_limb_t ul, vl, rl, cy; local
75 cy = 0;
80 rl = ul + vl + cy;
81 cy = rl >> GMP_NUMB_BITS;
86 return cy;
    [all...]
cnd_add_n.c 40 mp_limb_t ul, vl, sl, rl, cy, cy1, cy2, mask; local
47 cy = 0;
55 rl = sl + cy;
57 cy = cy1 | cy2;
61 rl += cy;
62 cy = rl >> GMP_NUMB_BITS;
68 return cy;
cnd_sub_n.c 40 mp_limb_t ul, vl, sl, rl, cy, cy1, cy2, mask; local
47 cy = 0;
55 rl = sl - cy;
57 cy = cy1 | cy2;
61 rl -= cy;
62 cy = rl >> (GMP_LIMB_BITS - 1);
68 return cy;
  /src/external/gpl3/gcc/dist/libquadmath/printf/
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;
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;
mul.c 60 mp_limb_t cy; local
127 cy = mpn_add_n (prodp, prodp, tp, vsize);
128 mpn_add_1 (prodp + vsize, tp + vsize, vsize, cy);
143 cy = mpn_add_n (prodp, prodp, tspace, vsize);
144 mpn_add_1 (prodp + vsize, tspace + vsize, usize, cy);
mul_n.c 156 mp_limb_t cy; local
194 cy = mpn_add_n (prodp + size, prodp + size, prodp + size + hsize, hsize);
198 cy -= mpn_sub_n (prodp + hsize, prodp + hsize, tspace, size);
200 cy += mpn_add_n (prodp + hsize, prodp + hsize, tspace, size);
211 cy += mpn_add_n (prodp + hsize, prodp + hsize, tspace, size);
212 if (cy)
213 mpn_add_1 (prodp + hsize + size, prodp + hsize + size, hsize, cy);
216 cy = mpn_add_n (prodp + hsize, prodp + hsize, tspace + hsize, hsize);
217 if (cy)
  /src/external/gpl3/gcc.old/dist/libquadmath/printf/
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;
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;
mul.c 60 mp_limb_t cy; local
127 cy = mpn_add_n (prodp, prodp, tp, vsize);
128 mpn_add_1 (prodp + vsize, tp + vsize, vsize, cy);
143 cy = mpn_add_n (prodp, prodp, tspace, vsize);
144 mpn_add_1 (prodp + vsize, tspace + vsize, usize, cy);
mul_n.c 156 mp_limb_t cy; local
194 cy = mpn_add_n (prodp + size, prodp + size, prodp + size + hsize, hsize);
198 cy -= mpn_sub_n (prodp + hsize, prodp + hsize, tspace, size);
200 cy += mpn_add_n (prodp + hsize, prodp + hsize, tspace, size);
211 cy += mpn_add_n (prodp + hsize, prodp + hsize, tspace, size);
212 if (cy)
213 mpn_add_1 (prodp + hsize + size, prodp + hsize + size, hsize, cy);
216 cy = mpn_add_n (prodp + hsize, prodp + hsize, tspace + hsize, hsize);
217 if (cy)
  /src/external/lgpl3/gmp/dist/mpz/
com.c 56 mp_limb_t cy; local
62 cy = mpn_add_1 (dst_ptr, src_ptr, size, (mp_limb_t) 1);
63 dst_ptr[size] = cy;
64 size += cy;

Completed in 33 milliseconds

1 2 3 4 5 6 7