Home
last modified time | relevance | path

Searched refs:carry (Results 1 - 25 of 221) sorted by relevance

123456789

/third_party/python/Modules/_decimal/libmpdec/
H A Dbasearith.c48 * The calling function has to handle a possible final carry.
55 mpd_uint_t carry = 0; in _mpd_baseadd() local
62 s = u[i] + (v[i] + carry); in _mpd_baseadd()
63 carry = (s < u[i]) | (s >= MPD_RADIX); in _mpd_baseadd()
64 w[i] = carry ? s-MPD_RADIX : s; in _mpd_baseadd()
66 /* if there is a carry, propagate it */ in _mpd_baseadd()
67 for (; carry && i < m; i++) { in _mpd_baseadd()
68 s = u[i] + carry; in _mpd_baseadd()
69 carry = (s == MPD_RADIX); in _mpd_baseadd()
70 w[i] = carry in _mpd_baseadd()
88 mpd_uint_t carry = 0; _mpd_baseaddto() local
115 mpd_uint_t carry; _mpd_shortadd() local
140 mpd_uint_t carry = 1; _mpd_baseincr() local
220 mpd_uint_t carry = 0; _mpd_shortmul() local
246 mpd_uint_t carry; _mpd_basemul() local
313 mpd_uint_t carry; _mpd_basedivmod() local
566 mpd_uint_t carry; _mpd_shortadd_b() local
591 mpd_uint_t carry = 0; _mpd_shortmul_c() local
614 mpd_uint_t carry = 0; _mpd_shortmul_b() local
[all...]
H A Dcrt.c64 mpd_uint_t carry; in _crt_add3() local
67 carry = (w[0] < v[0]); in _crt_add3()
72 w[1] = w[1] + carry; in _crt_add3()
73 if (w[1] < carry) w[2]++; in _crt_add3()
108 * CRT with carry: x1, x2, x3 contain numbers modulo p1, p2, p3. For each
113 * and carry = z / MPD_RADIX. Let N be the size of carry[] and cmax the
114 * maximum carry.
146 mpd_uint_t carry[3] = {0,0,0}; in crt3() local
174 _crt_add3(carry, in crt3()
[all...]
/third_party/FreeBSD/contrib/gdtoa/
H A Dsum.c42 ULong carry, *xc, *xa, *xb, *xe, y; local
52 carry = 0;
59 y = (*xa & 0xffff) + (*xb & 0xffff) + carry;
60 carry = (y & 0x10000) >> 16;
61 z = (*xa++ >> 16) + (*xb++ >> 16) + carry;
62 carry = (z & 0x10000) >> 16;
68 y = (*xa & 0xffff) + carry;
69 carry = (y & 0x10000) >> 16;
70 z = (*xa++ >> 16) + carry;
71 carry
[all...]
H A Dmisc.c168 ULLong carry, y; local
170 ULong carry, *x, y; local
180 carry = a;
183 y = *x * (ULLong)m + carry;
184 carry = y >> 32;
189 y = (xi & 0xffff) * m + carry;
191 carry = z >> 16;
194 y = *x * m + carry;
195 carry = y >> 16;
201 if (carry) {
277 ULLong carry, z; global() local
279 ULong carry, z; global() local
[all...]
/third_party/node/deps/v8/src/bigint/
H A Dvector-arithmetic.cc16 digit_t carry = 0; in AddAndReturnOverflow()
19 Z[i] = digit_add3(Z[i], X[i], carry, &carry); in AddAndReturnOverflow()
21 for (; i < Z.len() && carry != 0; i++) { in AddAndReturnOverflow()
22 Z[i] = digit_add2(Z[i], carry, &carry); in AddAndReturnOverflow()
24 return carry; in AddAndReturnOverflow()
46 digit_t carry = 0; in Add() local
48 Z[i] = digit_add3(X[i], Y[i], carry, &carry); in Add()
77 digit_t carry = 0; AddAndReturnCarry() local
122 digit_t carry = 1; AddOne() local
[all...]
H A Dmul-schoolbook.cc15 digit_t carry = 0; in MultiplySingle() local
20 Z[i] = digit_add3(low, high, carry, &carry); in MultiplySingle()
24 Z[X.len()] = carry + high; in MultiplySingle()
34 carry += carrybit; \
55 digit_t next, next_carry = 0, carry = 0; in MultiplySchoolbook()
68 digit_t zi = digit_add2(next, carry, &carry); in MultiplySchoolbook()
69 next = next_carry + carry; in MultiplySchoolbook()
70 carry in MultiplySchoolbook()
[all...]
H A Ddiv-helpers.cc30 digit_t carry = 0; in LeftShift()
34 Z[i] = (d << shift) | carry; in LeftShift()
35 carry = d >> (kDigitBits - shift); in LeftShift()
38 Z[i++] = carry; in LeftShift()
40 DCHECK(carry == 0); in LeftShift()
55 digit_t carry = X[0] >> shift; in RightShift() local
59 Z[i] = (d << (kDigitBits - shift)) | carry; in RightShift()
60 carry = d >> shift; in RightShift()
62 Z[i++] = carry; in RightShift()
H A Dmul-fft.cc36 digit_t carry = -high; in ModFn_Helper() local
39 x[i] = digit_add2(x[i], carry, &carry); in ModFn_Helper()
40 if (carry == 0) break; in ModFn_Helper()
80 digit_t carry = 0; in SumDiff() local
86 sum[i] = digit_add3(ai, bi, carry, &carry); in SumDiff()
114 digit_t carry = 1; in ShiftModFn_Large() local
116 result[i] = digit_add2(input[i + K - digit_shift], carry, &carry); in ShiftModFn_Large()
230 digit_t carry = 0; ShiftModFn() local
277 digit_t carry = 1; ShiftModFn() local
622 digit_t carry = 0; NormalizeAndRecombine() local
687 digit_t carry = 0; CounterWeightAndRecombine() local
[all...]
/third_party/node/deps/openssl/openssl/crypto/bn/asm/
H A Dppc64-mont.pl120 $carry="r0";
279 li $carry,0
578 add $t0,$t0,$carry ; can not overflow
583 srdi $carry,$t0,16
584 add $t1,$t1,$carry
585 srdi $carry,$t1,16
592 add $t2,$t2,$carry
595 srdi $carry,$t2,16
599 add $t3,$t3,$carry
600 srdi $carry,
[all...]
H A Dppc-mont.pl366 my ($carry,$zero) = ($rp,"r0");
382 # | topmost carry |
449 li $carry,0
450 addic $tp,$sp,$SIZE_T*7 # &t[-1], clear carry bit
458 addze $carry,$carry # modulo-scheduled
489 # question is when does it carry? Is there alternative
491 # observe that condition for carry is quite simple:
492 # $acc0 being non-zero. So that carry can be calculated
502 adde $acc3,$acc4,$carry
[all...]
/third_party/openssl/crypto/bn/asm/
H A Dppc64-mont.pl120 $carry="r0";
279 li $carry,0
578 add $t0,$t0,$carry ; can not overflow
583 srdi $carry,$t0,16
584 add $t1,$t1,$carry
585 srdi $carry,$t1,16
592 add $t2,$t2,$carry
595 srdi $carry,$t2,16
599 add $t3,$t3,$carry
600 srdi $carry,
[all...]
/third_party/node/deps/openssl/openssl/crypto/bn/
H A Dbn_nist.c19 /* pre-computed tables are "carry-less" values of modulus*(i+1) */
37 * "carry-full" */
355 int carry; in BN_nist_mod_192() local
436 carry = (int)(acc >> 32); in BN_nist_mod_192()
443 carry = (int)bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP); in BN_nist_mod_192()
445 carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP); in BN_nist_mod_192()
447 carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP); in BN_nist_mod_192()
450 if (carry > 0) in BN_nist_mod_192()
451 carry = in BN_nist_mod_192()
452 (int)bn_sub_words(r_d, r_d, _nist_p_192[carry in BN_nist_mod_192()
491 int carry; BN_nist_mod_224() local
663 int carry = 0; BN_nist_mod_256() local
900 int carry = 0; BN_nist_mod_384() local
[all...]
H A Dbn_mod.c58 BN_ULONG carry, temp, mask, *rp, *tp = storage; in bn_mod_add_fixed_top() local
75 for (i = 0, ai = 0, bi = 0, carry = 0; i < mtop;) { in bn_mod_add_fixed_top()
77 temp = ((ap[ai] & mask) + carry) & BN_MASK2; in bn_mod_add_fixed_top()
78 carry = (temp < carry); in bn_mod_add_fixed_top()
82 carry += (tp[i] < temp); in bn_mod_add_fixed_top()
89 carry -= bn_sub_words(rp, tp, m->d, mtop); in bn_mod_add_fixed_top()
91 rp[i] = (carry & tp[i]) | (~carry & rp[i]); in bn_mod_add_fixed_top()
141 BN_ULONG borrow, carry, t in bn_mod_sub_fixed_top() local
[all...]
/third_party/openssl/crypto/bn/
H A Dbn_nist.c19 /* pre-computed tables are "carry-less" values of modulus*(i+1) */
37 * "carry-full" */
333 int carry; in BN_nist_mod_192() local
414 carry = (int)(acc >> 32); in BN_nist_mod_192()
421 carry = (int)bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP); in BN_nist_mod_192()
423 carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP); in BN_nist_mod_192()
425 carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP); in BN_nist_mod_192()
428 if (carry > 0) in BN_nist_mod_192()
429 carry = in BN_nist_mod_192()
430 (int)bn_sub_words(r_d, r_d, _nist_p_192[carry in BN_nist_mod_192()
469 int carry; BN_nist_mod_224() local
641 int carry = 0; BN_nist_mod_256() local
878 int carry = 0; BN_nist_mod_384() local
[all...]
H A Dbn_mod.c53 BN_ULONG carry, temp, mask, *rp, *tp = storage; in bn_mod_add_fixed_top() local
70 for (i = 0, ai = 0, bi = 0, carry = 0; i < mtop;) { in bn_mod_add_fixed_top()
72 temp = ((ap[ai] & mask) + carry) & BN_MASK2; in bn_mod_add_fixed_top()
73 carry = (temp < carry); in bn_mod_add_fixed_top()
77 carry += (tp[i] < temp); in bn_mod_add_fixed_top()
84 carry -= bn_sub_words(rp, tp, m->d, mtop); in bn_mod_add_fixed_top()
86 rp[i] = (carry & tp[i]) | (~carry & rp[i]); in bn_mod_add_fixed_top()
136 BN_ULONG borrow, carry, t in bn_mod_sub_fixed_top() local
[all...]
/third_party/mesa3d/src/amd/vulkan/radix_sort/shaders/
H A Dbufref.h60 uint32_t carry; \
62 devaddr.x = uaddCarry(_devaddr_u32vec2.x, _offset, carry); \
63 devaddr.y = _devaddr_u32vec2.y + carry; \
80 uint32_t carry; \
82 devaddr.x = uaddCarry(_devaddr_u32vec2.x, _offset_u32vec2.x, carry); \
83 devaddr.y = _devaddr_u32vec2.y + _offset_u32vec2.y + carry; \
99 uint32_t carry; \
101 devaddr.x = uaddCarry(devaddr.x, _inc, carry); \
102 devaddr.y = devaddr.y + carry; \
117 uint32_t carry; \
[all...]
/third_party/mesa3d/src/util/
H A Dbigmath.h38 uint32_t carry = 0; in _ubm_add_u32arr() local
40 uint64_t sum = carry; in _ubm_add_u32arr()
46 carry = sum >> 32; in _ubm_add_u32arr()
61 return carry; in _ubm_add_u32arr()
76 uint32_t carry = 0; in _ubm_mul_u32arr() local
90 tmp += carry; in _ubm_mul_u32arr()
94 carry = tmp >> 32; in _ubm_mul_u32arr()
102 dst[i + b_len] = carry; in _ubm_mul_u32arr()
104 overflow = overflow || carry > 0; in _ubm_mul_u32arr()
/third_party/libwebsockets/plugins/ssh-base/crypto/
H A Dsc25519.c59 uint32_t carry; in barrett_reduce() local
69 carry = q2[31] >> 8; in barrett_reduce()
70 q2[32] += carry; in barrett_reduce()
71 carry = q2[32] >> 8; in barrett_reduce()
72 q2[33] += carry; in barrett_reduce()
81 carry = r2[i] >> 8; in barrett_reduce()
82 r2[i+1] += carry; in barrett_reduce()
169 int i, carry; in sc25519_add() local
173 carry = (int)r->v[i] >> 8; in sc25519_add()
174 r->v[i+1] += (uint32_t)carry; in sc25519_add()
194 int i,j,carry; sc25519_mul() local
222 char carry; sc25519_window3() local
259 char carry; sc25519_window5() local
[all...]
/third_party/ffmpeg/libavutil/
H A Dinteger.c37 int i, carry=0; in av_add_i() local
40 carry= (carry>>16) + a.v[i] + b.v[i]; in av_add_i()
41 a.v[i]= carry; in av_add_i()
47 int i, carry=0; in av_sub_i() local
50 carry= (carry>>16) + a.v[i] - b.v[i]; in av_sub_i()
51 a.v[i]= carry; in av_sub_i()
75 unsigned int carry=0; in av_mul_i() local
79 carry in av_mul_i()
[all...]
/third_party/rust/crates/minimal-lexical/src/
H A Dbigint.rs413 /// Multiply two small integers (with carry) (and return the overflow contribution).
417 pub fn scalar_mul(x: Limb, y: Limb, carry: Limb) -> (Limb, Limb) { in scalar_mul()
421 let z: Wide = (x as Wide) * (y as Wide) + (carry as Wide); in scalar_mul()
432 let mut carry = y; in small_add_from() variables
433 while carry != 0 && index < x.len() { in small_add_from()
434 let result = scalar_add(x[index], carry); in small_add_from()
436 carry = result.1 as Limb; in small_add_from()
440 if carry != 0 { in small_add_from()
441 x.try_push(carry)?; in small_add_from()
455 let mut carry in small_mul() variables
483 let mut carry = false; large_add_from() variables
[all...]
/third_party/icu/vendor/double-conversion/upstream/double-conversion/
H A Dbignum.cc184 // In both cases we might need a carry bigit. in AddBignum()
187 Chunk carry = 0; in AddBignum() local
195 const Chunk sum = my + other.RawBigit(i) + carry; in AddBignum()
197 carry = sum >> kBigitSize; in AddBignum()
200 while (carry != 0) { in AddBignum()
202 const Chunk sum = my + carry; in AddBignum()
204 carry = sum >> kBigitSize; in AddBignum()
262 // Assert that this number + 1 (for the carry) fits into double chunk. in MultiplyByUInt32()
264 DoubleChunk carry = 0; in MultiplyByUInt32() local
266 const DoubleChunk product = static_cast<DoubleChunk>(factor) * RawBigit(i) + carry; in MultiplyByUInt32()
[all...]
/third_party/icu/icu4c/source/i18n/
H A Ddouble-conversion-bignum.cpp198 // In both cases we might need a carry bigit. in AddBignum()
201 Chunk carry = 0; in AddBignum() local
209 const Chunk sum = my + other.RawBigit(i) + carry; in AddBignum()
211 carry = sum >> kBigitSize; in AddBignum()
214 while (carry != 0) { in AddBignum()
216 const Chunk sum = my + carry; in AddBignum()
218 carry = sum >> kBigitSize; in AddBignum()
276 // Assert that this number + 1 (for the carry) fits into double chunk. in MultiplyByUInt32()
278 DoubleChunk carry = 0; in MultiplyByUInt32() local
280 const DoubleChunk product = static_cast<DoubleChunk>(factor) * RawBigit(i) + carry; in MultiplyByUInt32()
[all...]
/third_party/node/deps/icu-small/source/i18n/
H A Ddouble-conversion-bignum.cpp198 // In both cases we might need a carry bigit. in AddBignum()
201 Chunk carry = 0; in AddBignum() local
209 const Chunk sum = my + other.RawBigit(i) + carry; in AddBignum()
211 carry = sum >> kBigitSize; in AddBignum()
214 while (carry != 0) { in AddBignum()
216 const Chunk sum = my + carry; in AddBignum()
218 carry = sum >> kBigitSize; in AddBignum()
276 // Assert that this number + 1 (for the carry) fits into double chunk. in MultiplyByUInt32()
278 DoubleChunk carry = 0; in MultiplyByUInt32() local
280 const DoubleChunk product = static_cast<DoubleChunk>(factor) * RawBigit(i) + carry; in MultiplyByUInt32()
[all...]
/third_party/node/deps/v8/src/base/numbers/
H A Dbignum.cc157 // In both cases we might need a carry bigit. in AddBignum()
160 Chunk carry = 0; in AddBignum() local
164 Chunk sum = bigits_[bigit_pos] + other.bigits_[i] + carry; in AddBignum()
166 carry = sum >> kBigitSize; in AddBignum()
170 while (carry != 0) { in AddBignum()
171 Chunk sum = bigits_[bigit_pos] + carry; in AddBignum()
173 carry = sum >> kBigitSize; in AddBignum()
223 // Assert that this number + 1 (for the carry) fits into double chunk. in MultiplyByUInt32()
225 DoubleChunk carry = 0; in MultiplyByUInt32() local
227 DoubleChunk product = static_cast<DoubleChunk>(factor) * bigits_[i] + carry; in MultiplyByUInt32()
246 uint64_t carry = 0; MultiplyByUInt64() local
668 Chunk carry = 0; BigitsShiftLeft() local
[all...]
/third_party/skia/third_party/externals/icu/source/i18n/
H A Ddouble-conversion-bignum.cpp197 // In both cases we might need a carry bigit. in AddBignum()
200 Chunk carry = 0; in AddBignum() local
208 const Chunk sum = my + other.RawBigit(i) + carry; in AddBignum()
210 carry = sum >> kBigitSize; in AddBignum()
213 while (carry != 0) { in AddBignum()
215 const Chunk sum = my + carry; in AddBignum()
217 carry = sum >> kBigitSize; in AddBignum()
275 // Assert that this number + 1 (for the carry) fits into double chunk. in MultiplyByUInt32()
277 DoubleChunk carry = 0; in MultiplyByUInt32() local
279 const DoubleChunk product = static_cast<DoubleChunk>(factor) * RawBigit(i) + carry; in MultiplyByUInt32()
[all...]

Completed in 14 milliseconds

123456789