/external/openssl/crypto/bn/asm/ |
H A D | 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,"ed [all...] |
H A D | ppc64-mont.pl | 82 $carry="r0"; 243 li $carry,0 445 add $t0,$t0,$carry ; can not overflow 450 srdi $carry,$t0,16 451 add $t1,$t1,$carry 452 srdi $carry,$t1,16 459 add $t2,$t2,$carry 462 srdi $carry,$t2,16 466 add $t3,$t3,$carry 467 srdi $carry, [all...] |
/external/wpa_supplicant_8/hostapd/src/crypto/ |
H A D | fips_prf_internal.c | 29 u32 carry; local 61 carry = 1; 63 carry += xkey[k] + xpos[k]; 64 xkey[k] = carry & 0xff; 65 carry >>= 8;
|
H A D | fips_prf_openssl.c | 38 u32 carry; local 70 carry = 1; 72 carry += xkey[k] + xpos[k]; 73 xkey[k] = carry & 0xff; 74 carry >>= 8;
|
H A D | aes-omac1.c | 24 int i, carry; local 26 carry = pad[0] & 0x80; 30 if (carry)
|
/external/wpa_supplicant_8/src/crypto/ |
H A D | fips_prf_internal.c | 29 u32 carry; local 61 carry = 1; 63 carry += xkey[k] + xpos[k]; 64 xkey[k] = carry & 0xff; 65 carry >>= 8;
|
H A D | fips_prf_openssl.c | 38 u32 carry; local 70 carry = 1; 72 carry += xkey[k] + xpos[k]; 73 xkey[k] = carry & 0xff; 74 carry >>= 8;
|
H A D | aes-omac1.c | 24 int i, carry; local 26 carry = pad[0] & 0x80; 30 if (carry)
|
/external/wpa_supplicant_8/wpa_supplicant/src/crypto/ |
H A D | fips_prf_internal.c | 29 u32 carry; local 61 carry = 1; 63 carry += xkey[k] + xpos[k]; 64 xkey[k] = carry & 0xff; 65 carry >>= 8;
|
H A D | fips_prf_openssl.c | 38 u32 carry; local 70 carry = 1; 72 carry += xkey[k] + xpos[k]; 73 xkey[k] = carry & 0xff; 74 carry >>= 8;
|
H A D | aes-omac1.c | 24 int i, carry; local 26 carry = pad[0] & 0x80; 30 if (carry)
|
/external/openssl/crypto/bn/ |
H A D | bn_nist.c | 69 /* pre-computed tables are "carry-less" values of modulus*(i+1) */ 84 0xFFFFFFFFFFFFFFFFULL,0x00000001FFFFFFFFULL} /* this one is "carry-full" */ 351 int carry; local 391 carry = (int)bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP); 393 carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP); 395 carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP); 397 if (carry > 0) 398 carry = (int)bn_sub_words(r_d,r_d,_nist_p_192[carry-1],BN_NIST_192_TOP); 400 carry 436 int carry; local 549 int carry = 0; local 673 int carry = 0; local [all...] |
H A D | 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 [all...] |
/external/bouncycastle/src/main/java/org/bouncycastle/crypto/modes/ |
H A D | SICBlockCipher.java | 92 int carry = 1; 96 int x = (counter[i] & 0xff) + carry; 100 carry = 1; 104 carry = 0;
|
/external/v8/src/ |
H A D | bignum.cc | 190 // In both cases we might need a carry bigit. 193 Chunk carry = 0; local 197 Chunk sum = bigits_[bigit_pos] + other.bigits_[i] + carry; 199 carry = sum >> kBigitSize; 203 while (carry != 0) { 204 Chunk sum = bigits_[bigit_pos] + carry; 206 carry = sum >> kBigitSize; 259 // Assert that this number + 1 (for the carry) fits into double chunk. 261 DoubleChunk carry = 0; local 263 DoubleChunk product = static_cast<DoubleChunk>(factor) * bigits_[i] + carry; [all...] |
/external/srec/srec/cfront/ |
H A D | 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
|
/external/webkit/Source/JavaScriptCore/wtf/ |
H A D | dtoa.cpp | 206 unsigned long long carry; local 208 uint32_t carry; 214 carry = a; 217 unsigned long long y = *x * (unsigned long long)m + carry; 218 carry = y >> 32; 222 uint32_t y = (xi & 0xffff) * m + carry; 224 carry = z >> 16; 229 if (carry) 230 b.append((uint32_t)carry); 344 unsigned long long carry, local 346 uint32_t carry, z; local 1194 unsigned long long borrow, carry, y, ys; local 1196 uint32_t borrow, carry, y, ys; local [all...] |
/external/llvm/lib/Support/ |
H A D | APInt.cpp | 179 /// 1 is returned if there is a carry out, otherwise 0 is returned. 180 /// @returns the carry of the addition. 187 y = 0; // No need to carry so exit early 234 /// @returns the carry out from the addition 238 bool carry = false; local 241 dest[i] = x[i] + y[i] + carry; 242 carry = dest[i] < limit || (carry && dest[i] == limit); 244 return carry; 288 /// @returns the carry ou 293 uint64_t carry = 0; local 329 uint64_t carry = 0, lx = 0, hx = 0; local [all...] |
/external/webkit/Source/WebCore/html/ |
H A D | DateComponents.cpp | 244 int carry; local 248 carry = minute / 60; 251 carry = (59 - m_minute) / 60; 252 minute += carry * 60; 253 carry = -carry; 262 int hour = m_hour + carry; 264 carry = hour / 24; 267 carry = (23 - hour) / 24; 268 hour += carry * 2 [all...] |
/external/fdlibm/ |
H A D | 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/wpa_supplicant/ |
H A D | crypto.c | 109 u32 carry; local 141 carry = 1; 143 carry += xkey[k] + xpos[k]; 144 xkey[k] = carry & 0xff; 145 carry >>= 8;
|
/external/wpa_supplicant_6/wpa_supplicant/src/crypto/ |
H A D | crypto_openssl.c | 111 u32 carry; local 143 carry = 1; 145 carry += xkey[k] + xpos[k]; 146 xkey[k] = carry & 0xff; 147 carry >>= 8;
|
/external/icu4c/i18n/ |
H A D | decNumber.c | 1067 /* If not violated then carry out the operation. */ 1285 /* then carry out the operation. */ 1423 /* then carry out the operation. */ 2173 else { /* carry on with integer */ 3787 /* -- a carry to digits+1 digits looks possible */ 3940 /* is all in one unit, no operand rounding is needed, and no carry, */ 4033 /* If destructive overlap, or the number is too long, or a carry or */ 4039 /* needed, +1 Unit for carry or borrow */ 4824 /* chunks, and also uses a lazy carry strategy to minimise expensive */ 4859 #define FASTLAZY 18 /* carry resolutio 4885 uInt carry; /* carry (NB not uLong) */ local 6344 eInt carry=0; /* carry integer (could be Long) */ local [all...] |
/external/chromium/base/third_party/dmg_fp/ |
H A D | dtoa.cc | 613 ULLong carry, y; variable 615 ULong carry, *x, y; variable 625 carry = a; 628 y = *x * (ULLong)m + carry; 629 carry = y >> 32; 634 y = (xi & 0xffff) * m + carry; 636 carry = z >> 16; 639 y = *x * m + carry; 640 carry = y >> 16; 646 if (carry) { 808 ULLong carry, z; variable 810 ULong carry, z; variable 2116 ULLong borrow, carry, y, ys; variable 2118 ULong borrow, carry, y, ys; variable [all...] |
/external/bouncycastle/src/main/java/org/bouncycastle/math/ec/ |
H A D | IntArray.java | 243 boolean carry = false; 249 if (carry) 254 carry = nextCarry;
|