Searched defs:carry (Results 1 - 25 of 55) sorted by relevance

123

/external/compiler-rt/lib/
H A Dudivsi3.c47 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;
H A Dudivmoddi4.c228 su_int carry = 0; local
231 /* r:q = ((r:q) << 1) | carry */
235 q.s.low = (q.s.low << 1) | carry;
236 /* carry = 0;
240 * carry = 1;
244 carry = s & 1;
247 q.all = (q.all << 1) | carry;
H A Dudivmodti4.c231 su_int carry = 0; local
234 /* r:q = ((r:q) << 1) | carry */
238 q.s.low = (q.s.low << 1) | carry;
239 /* carry = 0;
243 * carry = 1;
247 carry = s & 1;
250 q.all = (q.all << 1) | carry;
/external/llvm/unittests/ADT/
H A DAPIntTest.cpp541 integerPart carry = APInt::tcDecrement(&singleWord, 1); local
542 EXPECT_EQ(carry, integerPart(0));
549 integerPart carry = APInt::tcDecrement(&singleWord, 1); local
550 EXPECT_EQ(carry, integerPart(1));
568 integerPart carry = APInt::tcDecrement(test, 4); local
569 EXPECT_EQ(carry, integerPart(0));
577 integerPart carry = APInt::tcDecrement(test, 4); local
578 EXPECT_EQ(carry, integerPart(0));
586 integerPart carry = APInt::tcDecrement(test, 4); local
587 EXPECT_EQ(carry, integerPar
595 integerPart carry = APInt::tcDecrement(test, 4); local
[all...]
/external/jmonkeyengine/engine/src/networking/com/jme3/network/base/
H A DMessageProtocol.java60 private Byte carry; field in class:MessageProtocol
114 // If we have a left over carry then we need to
116 if( carry != null ) {
117 byte high = carry;
121 carry = null;
130 carry = buffer.get();
/external/wpa_supplicant_8/hostapd/src/crypto/
H A Dfips_prf_internal.c23 u32 carry; local
56 carry = 1;
58 carry += xkey[k] + xpos[k];
59 xkey[k] = carry & 0xff;
60 carry >>= 8;
H A Daes-omac1.c18 int i, carry; local
20 carry = pad[0] & 0x80;
24 if (carry)
H A Dfips_prf_openssl.c32 u32 carry; local
65 carry = 1;
67 carry += xkey[k] + xpos[k];
68 xkey[k] = carry & 0xff;
69 carry >>= 8;
/external/wpa_supplicant_8/src/crypto/
H A Dfips_prf_internal.c23 u32 carry; local
56 carry = 1;
58 carry += xkey[k] + xpos[k];
59 xkey[k] = carry & 0xff;
60 carry >>= 8;
H A Daes-omac1.c18 int i, carry; local
20 carry = pad[0] & 0x80;
24 if (carry)
H A Dfips_prf_openssl.c32 u32 carry; local
65 carry = 1;
67 carry += xkey[k] + xpos[k];
68 xkey[k] = carry & 0xff;
69 carry >>= 8;
/external/wpa_supplicant_8/wpa_supplicant/src/crypto/
H A Dfips_prf_internal.c23 u32 carry; local
56 carry = 1;
58 carry += xkey[k] + xpos[k];
59 xkey[k] = carry & 0xff;
60 carry >>= 8;
H A Daes-omac1.c18 int i, carry; local
20 carry = pad[0] & 0x80;
24 if (carry)
H A Dfips_prf_openssl.c32 u32 carry; local
65 carry = 1;
67 carry += xkey[k] + xpos[k];
68 xkey[k] = carry & 0xff;
69 carry >>= 8;
/external/chromium_org/third_party/openssl/openssl/crypto/modes/
H A Dxts128.c102 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/openssl/crypto/modes/
H A Dxts128.c102 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/openssl/openssl/crypto/bn/
H A Dbn_add.c108 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...]
H A Dbn_asm.c177 BN_ULONG carry=0; local
189 mul(rp[0],ap[0],bl,bh,carry);
190 mul(rp[1],ap[1],bl,bh,carry);
191 mul(rp[2],ap[2],bl,bh,carry);
192 mul(rp[3],ap[3],bl,bh,carry);
198 mul(rp[0],ap[0],bl,bh,carry);
201 return(carry);
H A Dbn_mont.c180 BN_ULONG *ap,*np,*rp,n0,v,carry; local
187 max=(2*nl); /* carry is stored separately */
208 for (carry=0, i=0; i<nl; i++, rp++)
226 v = (v+carry+rp[nl])&BN_MASK2;
227 carry |= (v != rp[nl]);
228 carry &= (v <= rp[nl]);
245 v=bn_sub_words(rp,ap,np,nl)-carry;
269 if (bn_sub_words (rp,ap,np,nl)-carry)
/external/kernel-headers/original/asm-mips/
H A Dchecksum.h106 int carry; local
110 carry = (csum < word[1]);
111 csum += carry;
114 carry = (csum < word[2]);
115 csum += carry;
118 carry = (csum < word[3]);
119 csum += carry;
124 carry = (csum < *word);
125 csum += carry;
251 " addu %0, $1 # Add final carry\
[all...]
/external/openssl/crypto/bn/
H A Dbn_add.c108 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/chromium_org/third_party/smhasher/src/
H A DPMurHash.c39 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 coun
263 PMurHash32_Result(uint32_t h, uint32_t carry, uint32_t total_length) argument
288 uint32_t h1=seed, carry=0; local
298 uint32_t h1=seed, carry=0; local
[all...]
/external/fdlibm/
H A Dk_rem_pio2.c170 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/stressapptest/src/
H A Dpattern.h118 uint32 carry = (addition & crc) >> 31; local
120 return crc + addition + carry;
/external/chromium_org/third_party/WebKit/Source/wtf/dtoa/
H A Dbignum.cc191 // 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...]

Completed in 470 milliseconds

123