Home | History | Annotate | Download | only in generic

Lines Matching refs:cy

49   mp_limb_t cy;
54   cy = mpn_add_n (rp, tp, tp + rn, rn);
55   /* If cy == 1, then the value of rp is at most B^rn - 2, so there can
57   MPN_INCR_U (rp, rn, cy);
68   mp_limb_t cy;
75   cy = tp[2*rn] + mpn_sub_n (rp, tp, tp+rn, rn);
77   MPN_INCR_U (rp, rn+1, cy);
111 	      mp_limb_t cy;
113 	      cy = mpn_add (rp, tp, rn, tp + rn, 2*an - rn);
114 	      MPN_INCR_U (rp, rn, cy);
123       mp_limb_t cy;
153 	    cy = mpn_add (xp, a0, n, a1, an - n);
154 	    MPN_INCR_U (xp, n, cy);
174 	  cy = mpn_sub (sp1, a0, n, a1, an - n);
176 	  MPN_INCR_U (sp1, n + 1, cy);
200 	    cy = mpn_sub (xp, xp, n, xp + n, anp);
202 	    MPN_INCR_U (xp, n+1, cy);
221       cy = mpn_rsh1add_nc(rp, rp, xp, n, xp[n]); /* B^n = 1 */
222       hi = cy << (GMP_NUMB_BITS - 1);
223       cy = 0;
224       /* next update of rp[n-1] will set cy = 1 only if rp[n-1]+=hi
227       cy = xp[n] + mpn_rsh1add_n(rp, rp, xp, n); /* B^n = 1 */
228       hi = (cy<<(GMP_NUMB_BITS-1))&GMP_NUMB_MASK; /* (cy&1) << ... */
229       cy >>= 1;
230       /* cy = 1 only if xp[n] = 1 i.e. {xp,n} = ZERO, this implies that
231 	 the rsh1add was a simple rshift: the top bit is 0. cy=1 => hi=0. */
234       add_ssaaaa(cy, rp[n-1], cy, rp[n-1], CNST_LIMB(0), hi);
236       cy += (hi & rp[n-1]) >> (GMP_NUMB_BITS-1);
241       cy = mpn_add_nc(rp, rp, xp, n, xp[n]);
243       cy = xp[n] + mpn_add_n(rp, rp, xp, n); /* xp[n] == 1 implies {xp,n} == ZERO */
245       cy += (rp[0]&1);
247       ASSERT (cy <= 2);
248       hi = (cy<<(GMP_NUMB_BITS-1))&GMP_NUMB_MASK; /* (cy&1) << ... */
249       cy >>= 1;
250       /* We can have cy != 0 only if hi = 0... */
253       /* ... rp[n-1] + cy can not overflow, the following INCR is correct. */
255       ASSERT (cy <= 1);
256       /* Next increment can not overflow, read the previous comments about cy. */
257       ASSERT ((cy == 0) || ((rp[n-1] & GMP_NUMB_HIGHBIT) == 0));
258       MPN_INCR_U(rp, n, cy);
269 	  cy = mpn_sub_n (rp + n, rp, xp, 2*an - n);
274 	  cy = xp[n] + mpn_sub_nc (xp + 2*an - n, rp + 2*an - n,
275 				   xp + 2*an - n, rn - 2*an, cy);
277 	  cy = mpn_sub_1 (rp, rp, 2*an, cy);
278 	  ASSERT (cy == (xp + 2*an - n)[0]);
282 	  cy = xp[n] + mpn_sub_n (rp + n, rp, xp, n);
283 	  /* cy = 1 only if {xp,n+1} is not ZERO, i.e. {rp,n} is not ZERO.
285 	  MPN_DECR_U (rp, 2*n, cy);