/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...] |
/frameworks/av/media/libstagefright/codecs/m4v_h263/enc/src/ |
dct_inline.h | 85 int32 carry, abs_sum; local 87 carry = k0 >> 31; 88 abs_sum = (k0 ^ carry); 89 carry = k1 >> 31; 90 abs_sum += (k1 ^ carry) - carry; 91 carry = k2 >> 31; 92 abs_sum += (k2 ^ carry) - carry; 93 carry = k3 >> 31 244 int32 carry, abs_sum; local 247 eor carry, k0, k0, asr #31 ; local 249 adc abs_sum, abs_sum, carry ; local 250 eors carry, k2, k2, asr #31 ; local 251 adc abs_sum, abs_sum, carry ; local 252 eors carry, k3, k3, asr #31 ; local 253 adc abs_sum, abs_sum, carry ; local 254 eors carry, k4, k4, asr #31 ; local 255 adc abs_sum, abs_sum, carry ; local 256 eors carry, k5, k5, asr #31 ; local 257 adc abs_sum, abs_sum, carry ; local 258 eors carry, k6, k6, asr #31 ; local 259 adc abs_sum, abs_sum, carry ; local 260 eors carry, k7, k7, asr #31 ; local 261 adc abs_sum, abs_sum, carry ; local 350 register int32 carry; local [all...] |
/frameworks/av/media/libstagefright/codecs/mp3dec/src/ |
pvmp3_crc.cpp | 145 uint32 carry; local 150 carry = *crc & 0x8000; 152 if (!carry ^ !(data & masking))
|
/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;
|
/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...] |
/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/wpa_supplicant_8/src/crypto/ |
fips_prf_internal.c | 23 u32 carry; local 56 carry = 1; 58 carry += xkey[k] + xpos[k]; 59 xkey[k] = carry & 0xff; 60 carry >>= 8;
|
fips_prf_openssl.c | 32 u32 carry; local 65 carry = 1; 67 carry += xkey[k] + xpos[k]; 68 xkey[k] = carry & 0xff; 69 carry >>= 8;
|
aes-omac1.c | 18 int i, carry; local 20 carry = pad[0] & 0x80; 24 if (carry)
|
/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...] |
/system/core/libmincrypt/ |
p256.c | 76 p256_ddigit carry = 0; local 79 carry += *c; 80 carry += (p256_ddigit)P256_DIGIT(a, i) * b; 81 *c++ = (p256_digit)carry; 82 carry >>= P256_BITSPERDIGIT; 84 return top + (p256_digit)carry; 132 p256_ddigit carry = 0; local 134 carry += *c; 135 carry += P256_DIGIT(MOD, i) & mask; 136 *c++ = (p256_digit)carry; 267 p256_ddigit carry = 0; local 280 p256_ddigit carry = d; local [all...] |
p256_ec.c | 191 /* felem_reduce_carry adds a multiple of p in order to cancel |carry|, 194 * On entry: carry < 2**3, inout[0,2,...] < 2**29, inout[1,3,...] < 2**28. 196 static void felem_reduce_carry(felem inout, limb carry) { 197 const u32 carry_mask = NON_ZERO_TO_ALL_ONES(carry); 199 inout[0] += carry << 1; 201 /* carry < 2**3 thus (carry << 11) < 2**14 and we added 2**28 in the 203 inout[3] -= carry << 11; 207 inout[6] -= carry << 22; 208 /* This may underflow if carry is non-zero but, if so, we'll fix it in th 219 limb carry = 0; local 257 limb carry = 0; local 298 limb tmp2[18], carry, x, xMask; local 675 limb carry = 0; local 702 limb carry = 0, next_carry; local 733 limb carry = 0, next_carry; local 762 limb carry; local [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...] |
/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...] |
/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/srec/srec/cfront/ |
himul32.h | 128 asr_uint32_t oldlo, carry; 165 // Note that folding mid into lo can cause a carry. An old trick 166 // for portable carry-detection applies: if a and b are unsigned, 173 carry = lo < oldlo; 175 hi += carry + (mid >> 16); 181 // complement and adding 1. So there's a carry out of the low
|
/ndk/sources/android/support/src/wcstox/ |
floatscan.c | 200 uint32_t carry = 0; local 203 x[k] = x[k]/p10 + carry; 204 carry = 1000000000/p10 * tmp; 210 if (carry) x[z++] = carry; 216 uint32_t carry = 0; local 219 uint64_t tmp = ((uint64_t)x[k] << 29) + carry; 221 carry = tmp / 1000000000; 224 carry = 0; 230 if (carry) { 243 uint32_t carry = 0; local [all...] |
/external/valgrind/main/VEX/switchback/ |
test_emfloat.c | 531 static void Add16Bits(u16 *carry,u16 *a,u16 b,u16 c); 533 static void ShiftMantLeft1(u16 *carry,u16 *mantissa); 534 static void ShiftMantRight1(u16 *carry,u16 *mantissa); 768 ** Add b, c, and carry. Retult in a. New carry in carry. 770 static void Add16Bits(u16 *carry, 779 ** the carry. 783 accum+=(u32)*carry; 784 *carry=(u16)((accum & 0x00010000) ? 1 : 0); /* New carry * 872 u16 carry; \/* Self-explanatory *\/ local 916 u16 carry; local 1075 u16 carry; local 1283 u16 carry; local 1445 u16 carry; local [all...] |
/external/stressapptest/src/ |
pattern.h | 118 uint32 carry = (addition & crc) >> 31; local 120 return crc + addition + carry;
|