HomeSort by relevance Sort by last modified time
    Searched defs:carry (Results 1 - 25 of 38) sorted by null

1 2

  /frameworks/base/media/libstagefright/codecs/mp3dec/src/
pvmp3_crc.cpp 145 uint32 carry; local
150 carry = *crc & 0x8000;
152 if (!carry ^ !(data & masking))
  /frameworks/compile/libbcc/runtime/lib/
udivsi3.c 44 su_int carry = 0; local
47 /* r:q = ((r:q) << 1) | carry */
49 q = (q << 1) | carry;
50 /* carry = 0;
54 * carry = 1;
58 carry = s & 1;
61 q = (q << 1) | carry;
udivmoddi4.c 228 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;
udivmodti4.c 231 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/wpa_supplicant_8/src/crypto/
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;
aes-omac1.c 24 int i, carry; local
26 carry = pad[0] & 0x80;
30 if (carry)
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;
  /external/openssl/crypto/bn/
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...]
bn_asm.c 177 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);
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 = 1
436 int carry; local
549 int carry = 0; local
673 int carry = 0; local
    [all...]
  /bionic/libm/src/
k_rem_pio2.c 158 int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih; local
203 n += 1; carry = 0;
206 if(carry==0) {
208 carry = 1; iq[i] = 0x1000000- j;
222 if(carry!=0) z -= scalbn(one,q0);
k_rem_pio2f.c 50 int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih; local
95 n += 1; carry = 0;
98 if(carry==0) {
100 carry = 1; iq[i] = 0x100- j;
114 if(carry!=0) z -= scalbnf(one,q0);
  /external/bouncycastle/src/main/java/org/bouncycastle/crypto/modes/
SICBlockCipher.java 92 int carry = 1; local
96 int x = (counter[i] & 0xff) + carry;
100 carry = 1;
104 carry = 0;
  /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/v8/src/
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/wpa_supplicant/
aes_wrap.c 160 int i, carry; local
162 carry = pad[0] & 0x80;
166 if (carry)
crypto.c 109 u32 carry; local
141 carry = 1;
143 carry += xkey[k] + xpos[k];
144 xkey[k] = carry & 0xff;
145 carry >>= 8;
sha1.c 417 u32 carry; local
449 carry = 1;
451 carry += xkey[k] + xpos[k];
452 xkey[k] = carry & 0xff;
453 carry >>= 8;
  /external/wpa_supplicant_6/wpa_supplicant/src/crypto/
aes_wrap.c 159 int i, carry; local
161 carry = pad[0] & 0x80;
165 if (carry)
crypto_openssl.c 111 u32 carry; local
143 carry = 1;
145 carry += xkey[k] + xpos[k];
146 xkey[k] = carry & 0xff;
147 carry >>= 8;
sha1.c 423 u32 carry; local
455 carry = 1;
457 carry += xkey[k] + xpos[k];
458 xkey[k] = carry & 0xff;
459 carry >>= 8;
  /frameworks/base/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...]
  /libcore/luni/src/main/java/java/math/
BitLevel.java 76 // this digit absorbs the carry
115 int carry = 0; local
118 result[i] = (val << 1) | carry;
119 carry = val >>> 31;
121 if(carry != 0) {
122 result[srcLen] = carry;
  /external/llvm/lib/Support/
APInt.cpp 179 /// 1 is returned if there is a carry out, otherwise 0 is returned.
180 /// @returns the carry of the addition.
185 y = 1; // Carry one to next digit.
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;
293 uint64_t carry = 0; local
329 uint64_t carry = 0, lx = 0, hx = 0; local
    [all...]
  /external/webkit/Source/WebCore/html/
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 * 24
    [all...]

Completed in 1633 milliseconds

1 2