Lines Matching refs:carry
444 long carry = 0;
446 product = ylong * (x[i] & LONG_MASK) + carry;
448 carry = product >>> 32;
454 carry = sum >>> 32;
456 sum = (x[i] & LONG_MASK) + carry;
458 carry = sum >>> 32;
1085 // Copy remainder of longer number while carry propagation is required
1086 boolean carry = (sum >>> 32 != 0);
1087 while (xIndex > 0 && carry)
1088 carry = ((result[--xIndex] = x[xIndex] + 1) == 0);
1095 if (carry) {
1193 long carry = 0;
1196 long product = (value[i] & LONG_MASK) * dl + carry;
1198 carry = product >>> 32;
1200 rmag[rstart] = (int)carry;
1202 carry = 0;
1206 (rmag[rstart] & LONG_MASK) + carry;
1208 carry = product >>> 32;
1210 rmag[0] = (int)carry;
1212 if (carry == 0L)
1228 long carry = 0;
1231 (x[xstart] & LONG_MASK) + carry;
1233 carry = product >>> 32;
1235 z[xstart] = (int)carry;
1238 carry = 0;
1242 (z[k] & LONG_MASK) + carry;
1244 carry = product >>> 32;
1246 z[i] = (int)carry;
1880 int carry = mulAdd(n, mod, offset, mlen, inv * nEnd);
1881 c += addOne(n, offset, mlen, carry);
1927 * Multiply an array by one word k and add to result, return the carry
1931 long carry = 0;
1936 (out[offset] & LONG_MASK) + carry;
1938 carry = product >>> 32;
1940 return (int)carry;
1945 * carry.
1947 static int addOne(int[] a, int offset, int mlen, int carry) {
1949 long t = (a[offset] & LONG_MASK) + (carry & LONG_MASK);