Lines Matching defs:carry
885 twodigits carry = 1; /* for 2's-comp calculation */
894 thisbyte = (0xff ^ thisbyte) + carry;
895 carry = thisbyte >> 8;
935 digit carry; /* for computing 2's-comp */
973 carry = do_twos_comp ? 1 : 0;
977 thisdigit = (thisdigit ^ PyLong_MASK) + carry;
978 carry = thisdigit >> PyLong_SHIFT;
1015 assert(carry == 0); /* else do_twos_comp and *every* digit was 0 */
1530 * x[m-1], and the remaining carry (0 or 1) is returned.
1536 digit carry = 0;
1540 carry += x[i] + y[i];
1541 x[i] = carry & PyLong_MASK;
1542 carry >>= PyLong_SHIFT;
1543 assert((carry & 1) == carry);
1545 for (; carry && i < m; ++i) {
1546 carry += x[i];
1547 x[i] = carry & PyLong_MASK;
1548 carry >>= PyLong_SHIFT;
1549 assert((carry & 1) == carry);
1551 return carry;
1587 digit carry = 0;
1591 twodigits acc = (twodigits)a[i] << d | carry;
1593 carry = (digit)(acc >> PyLong_SHIFT);
1595 return carry;
1605 digit carry = 0;
1610 twodigits acc = (twodigits)carry << PyLong_SHIFT | a[i];
1611 carry = (digit)acc & mask;
1614 return carry;
2558 /* carry off the current end? */
2814 digit wm1, wm2, carry, q, r, vtop, *v0, *vk, *w0, *ak;
2844 carry = v_lshift(w->ob_digit, w1->ob_digit, size_w, d);
2845 assert(carry == 0);
2846 carry = v_lshift(v->ob_digit, v1->ob_digit, size_v, d);
2847 if (carry != 0 || v->ob_digit[size_v-1] >= w->ob_digit[size_w-1]) {
2848 v->ob_digit[size_v] = carry;
2916 carry = 0;
2918 carry += vk[i] + w0[i];
2919 vk[i] = carry & PyLong_MASK;
2920 carry >>= PyLong_SHIFT;
2931 carry = v_rshift(w0, v0, size_w, d);
2932 assert(carry==0);
3197 digit carry = 0;
3210 carry += a->ob_digit[i] + b->ob_digit[i];
3211 z->ob_digit[i] = carry & PyLong_MASK;
3212 carry >>= PyLong_SHIFT;
3215 carry += a->ob_digit[i];
3216 z->ob_digit[i] = carry & PyLong_MASK;
3217 carry >>= PyLong_SHIFT;
3219 z->ob_digit[i] = carry;
3379 twodigits carry;
3389 carry = *pz + f * f;
3390 *pz++ = (digit)(carry & PyLong_MASK);
3391 carry >>= PyLong_SHIFT;
3392 assert(carry <= PyLong_MASK);
3399 carry += *pz + *pa++ * f;
3400 *pz++ = (digit)(carry & PyLong_MASK);
3401 carry >>= PyLong_SHIFT;
3402 assert(carry <= (PyLong_MASK << 1));
3404 if (carry) {
3406 * carry position from the last outer loop iteration, so
3410 carry += *pz;
3411 *pz = (digit)(carry & PyLong_MASK);
3412 carry >>= PyLong_SHIFT;
3413 if (carry) {
3414 /* If there's still a carry, it must be into a position
3416 ^ B is 1 << PyLong_SHIFT, the last add was of a carry no
3419 * carry no more than floor((2*B - 1)/B) = 1.
3421 assert(carry == 1);
3423 pz[1] = (digit)carry;
3430 twodigits carry = 0;
3442 carry += *pz + *pb++ * f;
3443 *pz++ = (digit)(carry & PyLong_MASK);
3444 carry >>= PyLong_SHIFT;
3445 assert(carry <= PyLong_MASK);
3447 if (carry)
3448 *pz += (digit)(carry & PyLong_MASK);
3449 assert((carry >> PyLong_SHIFT) == 0);
4797 `2**shift - 1` all have value `PyLong_MASK`, so we get a carry out
4945 digit carry = 1;
4947 carry += a[i] ^ PyLong_MASK;
4948 z[i] = carry & PyLong_MASK;
4949 carry >>= PyLong_SHIFT;
4951 assert(carry == 0);