| /bionic/libc/upstream-openbsd/lib/libc/gdtoa/ |
| sum.c | 42 ULong carry, *xc, *xa, *xb, *xe, y; local
54 carry = 0;
61 y = (*xa & 0xffff) + (*xb & 0xffff) + carry;
62 carry = (y & 0x10000) >> 16;
63 z = (*xa++ >> 16) + (*xb++ >> 16) + carry;
64 carry = (z & 0x10000) >> 16;
70 y = (*xa & 0xffff) + carry;
71 carry = (y & 0x10000) >> 16;
72 z = (*xa++ >> 16) + carry;
73 carry = (z & 0x10000) >> 16
[all...] |
| dmisc.c | 119 ULLong borrow, carry, y, ys; local
121 ULong borrow, carry, y, ys; local
145 carry = 0;
148 ys = *sx++ * (ULLong)q + carry;
149 carry = ys >> 32;
156 ys = (si & 0xffff) * q + carry;
158 carry = zs >> 16;
165 ys = *sx++ * q + carry;
166 carry = ys >> 16;
184 carry = 0
[all...] |
| misc.c | 173 ULLong carry, y; local
175 ULong carry, *x, y; local
185 carry = a;
188 y = *x * (ULLong)m + carry;
189 carry = y >> 32;
194 y = (xi & 0xffff) * m + carry;
196 carry = z >> 16;
199 y = *x * m + carry;
200 carry = y >> 16;
206 if (carry) {
286 ULLong carry, z; local
288 ULong carry, z; local
[all...] |
| /external/compiler-rt/lib/builtins/ |
| udivsi3.c | 47 su_int carry = 0; local
50 /* r:q = ((r:q) << 1) | carry */
52 q = (q << 1) | carry;
53 /* carry = 0;
57 * carry = 1;
61 carry = s & 1;
64 q = (q << 1) | carry;
|
| udivmoddi4.c | 208 su_int carry = 0; local
211 /* r:q = ((r:q) << 1) | carry */
215 q.s.low = (q.s.low << 1) | carry;
216 /* carry = 0;
220 * carry = 1;
224 carry = s & 1;
227 q.all = (q.all << 1) | carry;
|
| /external/chromium_org/third_party/boringssl/src/crypto/bn/asm/ |
| x86-mont.pl | 281 $carry="ebp";
284 &lea ($carry,&DWP(1,$num));
288 &and ($carry,1); # see if num is even
291 &or ($carry,"edx");
299 &mov ($carry,"edx");
301 &add ($carry,"eax");
306 &mov (&DWP($frame-4,"esp",$j,4),$carry); # tp[j]=
309 &mov ($carry,"edx");
312 &add ("eax",$carry);
334 &mov ($carry,"edx")
[all...] |
| x86_64-mont5.pl | 1392 my ($shift,$carry)=($a0,$a1);
1398 xor $carry,$carry
1404 mov $carry,24($tptr) # t[7]
1419 neg $carry # mov $carry,cf
1428 sbb $carry,$carry # mov cf,$carry
1436 neg $carry # mov $carry,c
[all...] |
| /external/openssl/crypto/bn/asm/ |
| x86-mont.pl | 281 $carry="ebp";
284 &lea ($carry,&DWP(1,$num));
288 &and ($carry,1); # see if num is even
291 &or ($carry,"edx");
299 &mov ($carry,"edx");
301 &add ($carry,"eax");
306 &mov (&DWP($frame-4,"esp",$j,4),$carry); # tp[j]=
309 &mov ($carry,"edx");
312 &add ("eax",$carry);
334 &mov ($carry,"edx")
[all...] |
| /external/openssl/crypto/bn/ |
| bn_nist.c | 69 /* pre-computed tables are "carry-less" values of modulus*(i+1) */
84 0xFFFFFFFFFFFFFFFFULL,0x00000001FFFFFFFFULL} /* this one is "carry-full" */
359 int carry; local
426 carry = (int)(acc>>32);
433 carry = (int)bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP);
435 carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP);
437 carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP);
440 if (carry > 0)
441 carry = (int)bn_sub_words(r_d,r_d,_nist_p_192[carry-1],BN_NIST_192_TOP)
480 int carry; local
638 int carry = 0; local
842 int carry = 0; local
[all...] |
| bn_add.c | 108 BN_ULONG *ap,*bp,*rp,carry,t1,t2; local
130 carry=bn_add_words(rp,ap,bp,min);
135 if (carry)
145 carry=0;
149 if (carry)
151 /* carry != 0 => dif == 0 */
170 int i,carry; local
195 carry=0;
200 if (carry)
202 carry=(t1 <= t2)
[all...] |
| /external/fio/lib/ |
| num2str.c | 10 * Cheesy number->string conversion, complete with carry rounding error.
18 int byte_post_index = 0, post_index, carry = 0; local
45 carry = modulo >= thousand[!!pow2] / 2;
62 if (carry)
|
| /external/chromium_org/third_party/boringssl/src/crypto/bn/ |
| add.c | 104 BN_ULONG *ap, *bp, *rp, carry, t1, t2; local
126 carry = bn_add_words(rp, ap, bp, min);
131 if (carry) {
138 carry = 0;
142 if (carry) {
143 /* carry != 0 => dif == 0 */
262 int i, carry; local
282 carry = 0;
286 if (carry) {
287 carry = (t1 <= t2)
[all...] |
| montgomery.c | 342 BN_ULONG *ap, *np, *rp, n0, v, carry;
352 max = (2 * nl); /* carry is stored separately */
369 for (carry = 0, i = 0; i < nl; i++, rp++) {
371 v = (v + carry + rp[nl]) & BN_MASK2;
372 carry |= (v != rp[nl]);
373 carry &= (v <= rp[nl]);
390 v = bn_sub_words(rp, ap, np, nl) - carry;
430 BN_ULONG *ap,*np,*rp,n0,v,carry; local
437 max=(2*nl); /* carry is stored separately */
455 for (carry=0, i=0; i<nl; i++, rp++
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
| WNafUtil.java | 70 boolean carry = false;
75 if (k.testBit(pos) == carry)
84 if (carry)
89 carry = (digit & sign) != 0;
90 if (carry)
214 boolean carry = false;
219 if (k.testBit(pos) == carry)
228 if (carry)
233 carry = (digit & sign) != 0;
234 if (carry)
[all...] |
| /external/chromium_org/third_party/smhasher/src/ |
| PMurHash.c | 39 the caller a carry containing up to 3 bytes that we were unable to process.
40 This carry also needs to record the number of bytes the carry holds. I use
41 the low 2 bits as a count (0..3) and the carry bytes are shifted into the
161 /* Append unaligned bytes to carry, forcing hash churn if we have 4 bytes */
162 /* cnt=bytes to process, h1=name of h1 var, c=carry, n=bytes in c, ptr/len=payload */
176 /* Main hashing function. Initialise carry to 0 and h1 to 0 or an initial seed
186 /* Extract carry count from low 2 bits of c value */
192 /* Consume any carry bytes */
214 /* We're now aligned. Process in aligned blocks. Specialise for each possible carry count *
288 uint32_t h1=seed, carry=0; local
298 uint32_t h1=seed, carry=0; local
[all...] |
| PMurHash.h | 57 MH_UINT32 PMurHash32_Result(MH_UINT32 h1, MH_UINT32 carry, MH_UINT32 total_length);
|
| /external/chromium_org/third_party/WebKit/Source/wtf/dtoa/ |
| bignum.cc | 191 // In both cases we might need a carry bigit.
194 Chunk carry = 0; local
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; local
264 DoubleChunk product = static_cast<DoubleChunk>(factor) * bigits_[i] + carry;
[all...] |
| /external/chromium_org/v8/src/ |
| bignum.cc | 168 // In both cases we might need a carry bigit.
171 Chunk carry = 0; local
175 Chunk sum = bigits_[bigit_pos] + other.bigits_[i] + carry;
177 carry = sum >> kBigitSize;
181 while (carry != 0) {
182 Chunk sum = bigits_[bigit_pos] + carry;
184 carry = sum >> kBigitSize;
237 // Assert that this number + 1 (for the carry) fits into double chunk.
239 DoubleChunk carry = 0; local
241 DoubleChunk product = static_cast<DoubleChunk>(factor) * bigits_[i] + carry;
[all...] |
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| dtoa.cpp | 164 unsigned long long carry; local
166 uint32_t carry;
172 carry = a;
175 unsigned long long y = *x * (unsigned long long)m + carry;
176 carry = y >> 32;
180 uint32_t y = (xi & 0xffff) * m + carry;
182 carry = z >> 16;
187 if (carry)
188 b.append((uint32_t)carry);
283 unsigned long long carry, z local
285 uint32_t carry, z; local
614 unsigned long long borrow, carry, y, ys; local
616 uint32_t borrow, carry, y, ys; local
[all...] |
| /external/ltrace/sysdeps/linux-gnu/arm/ |
| regs.h | 46 int arm_get_shifted_register(struct process *proc, uint32_t inst, int carry,
|
| regs.c | 72 arm_get_shifted_register(struct process *proc, uint32_t inst, int carry,
113 res = (res >> 1) | (carry ? 0x80000000L : 0);
|
| /external/openssl/crypto/modes/ |
| xts128.c | 102 unsigned int carry,res; local
105 carry = (unsigned int)(tweak.u[0]>>63);
107 tweak.u[1] = (tweak.u[1]<<1)|carry;
138 unsigned int carry,res; local
141 carry = (unsigned int)(tweak.u[0]>>63);
143 tweak1.u[1] = (tweak.u[1]<<1)|carry;
|
| /external/chromium_org/third_party/WebKit/Source/platform/ |
| DateComponents.cpp | 236 int carry; local
240 carry = minute / 60;
243 carry = (59 - minute) / 60;
244 minute += carry * 60;
245 carry = -carry;
254 int hour = m_hour + carry;
256 carry = hour / 24;
259 carry = (23 - hour) / 24;
260 hour += carry * 24
[all...] |
| /external/fdlibm/ |
| k_rem_pio2.c | 170 int jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih; local
215 n += 1; carry = 0;
218 if(carry==0) {
220 carry = 1; iq[i] = 0x1000000- j;
234 if(carry!=0) z -= ieee_scalbn(one,q0);
|
| /external/llvm/lib/Support/ |
| APInt.cpp | 181 /// 1 is returned if there is a carry out, otherwise 0 is returned.
182 /// @returns the carry of the addition.
187 y = 1; // Carry one to next digit.
189 y = 0; // No need to carry so exit early
236 /// @returns the carry out from the addition
240 bool carry = false; local
243 dest[i] = x[i] + y[i] + carry;
244 carry = dest[i] < limit || (carry && dest[i] == limit);
246 return carry;
295 uint64_t carry = 0; local
331 uint64_t carry = 0, lx = 0, hx = 0; local
[all...] |
