Lines Matching defs:carry
191 // In both cases we might need a carry bigit.
194 Chunk carry = 0;
198 Chunk sum = bigits_[bigit_pos] + other.bigits_[i] + carry;
200 carry = sum >> kBigitSize;
204 while (carry != 0) {
205 Chunk sum = bigits_[bigit_pos] + carry;
207 carry = sum >> kBigitSize;
260 // Assert that this number + 1 (for the carry) fits into double chunk.
262 DoubleChunk carry = 0;
264 DoubleChunk product = static_cast<DoubleChunk>(factor) * bigits_[i] + carry;
266 carry = (product >> kBigitSize);
268 while (carry != 0) {
270 bigits_[used_digits_] = (uint32_t)carry & kBigitMask;
272 carry >>= kBigitSize;
284 uint64_t carry = 0;
290 uint64_t tmp = (carry & kBigitMask) + product_low;
292 carry = (carry >> kBigitSize) + (tmp >> kBigitSize) +
295 while (carry != 0) {
297 bigits_[used_digits_] = (uint32_t)carry & kBigitMask;
299 carry >>= kBigitSize;
726 Chunk carry = 0;
729 bigits_[i] = ((bigits_[i] << shift_amount) + carry) & kBigitMask;
730 carry = new_carry;
732 if (carry != 0) {
733 bigits_[used_digits_] = carry;