Lines Matching refs:borrow
29 digit_t borrow = high;
32 x[i] = digit_sub(x[i], borrow, &borrow);
33 if (borrow == 0) break;
66 digit_t borrow = 0;
68 dest[i] = digit_sub2(src[i], src[i + K], borrow, &borrow);
70 dest[K] = digit_sub2(0, src[2 * K], borrow, &borrow);
71 // {borrow} may be non-zero here, that's OK as {ModFn} will take care of it.
81 digit_t borrow = 0;
87 diff[i] = digit_sub2(ai, bi, borrow, &borrow);
112 digit_t borrow = 0;
118 result[digit_shift] = digit_sub(input[K] + carry, input[0], &borrow);
121 result[i] = digit_sub2(0, d, borrow, &borrow);
144 result[digit_shift] = digit_sub(sum, i0_part, &borrow);
150 digit_sub2(iK_carry, subtrahend, borrow, &borrow);
157 result[i] = digit_sub2(0, subtrahend, borrow, &borrow);
161 // The virtual 1 in result[K] should be eliminated by {borrow}. If there
162 // is no borrow, then the virtual initialization was too much. Subtract
165 if (borrow != 1) {
166 borrow = 1;
168 result[i] = digit_sub(result[i], borrow, &borrow);
169 if (borrow == 0) break;
171 if (borrow != 0) {
198 digit_t borrow = 0;
218 result[i - K + digit_shift] = digit_sub2(0, d, borrow, &borrow);
223 result[i - K + digit_shift] = digit_sub(0, borrow, &borrow);
226 result[digit_shift] = digit_sub2(input[0], input[K], borrow, &borrow);
250 digit_sub2(0, (d << bits_shift) | carry, borrow, &borrow);
256 result[i - K + digit_shift] = digit_sub2(0, carry, borrow, &borrow);
262 result[i - K + digit_shift] = digit_sub(0, borrow, &borrow);
267 result[digit_shift], (d << bits_shift) | carry, borrow, &borrow);
272 for (int i = digit_shift + 1; i <= K && borrow > 0; i++) {
273 result[i] = digit_sub(result[i], borrow, &borrow);
275 if (borrow > 0) {