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

1 2 3 4 5 6

  /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/
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/openssl/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/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/kernel-headers/original/asm-mips/
checksum.h 106 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\n
    [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/jmonkeyengine/engine/src/networking/com/jme3/network/base/
MessageProtocol.java 60 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/chromium_org/third_party/openssl/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" */
360 int carry; local
427 carry = (int)(acc>>32);
434 carry = (int)bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP);
436 carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP);
438 carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP);
441 if (carry > 0)
442 carry = (int)bn_sub_words(r_d,r_d,_nist_p_192[carry-1],BN_NIST_192_TOP)
480 int carry; local
634 int carry = 0; local
837 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/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" */
360 int carry; local
427 carry = (int)(acc>>32);
434 carry = (int)bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP);
436 carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP);
438 carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP);
441 if (carry > 0)
442 carry = (int)bn_sub_words(r_d,r_d,_nist_p_192[carry-1],BN_NIST_192_TOP)
480 int carry; local
634 int carry = 0; local
837 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/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 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/v8/src/
bignum.cc 189 // In both cases we might need a carry bigit.
192 Chunk carry = 0; local
196 Chunk sum = bigits_[bigit_pos] + other.bigits_[i] + carry;
198 carry = sum >> kBigitSize;
202 while (carry != 0) {
203 Chunk sum = bigits_[bigit_pos] + carry;
205 carry = sum >> kBigitSize;
258 // Assert that this number + 1 (for the carry) fits into double chunk.
260 DoubleChunk carry = 0; local
262 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
  /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;
  /external/chromium_org/third_party/WebKit/Source/wtf/
dtoa.cpp 171 unsigned long long carry; local
173 uint32_t carry;
179 carry = a;
182 unsigned long long y = *x * (unsigned long long)m + carry;
183 carry = y >> 32;
187 uint32_t y = (xi & 0xffff) * m + carry;
189 carry = z >> 16;
194 if (carry)
195 b.append((uint32_t)carry);
290 unsigned long long carry, z local
292 uint32_t carry, z; local
621 unsigned long long borrow, carry, y, ys; local
623 uint32_t borrow, carry, y, ys; local
    [all...]
  /external/chromium_org/third_party/openssl/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/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;

Completed in 2848 milliseconds

1 2 3 4 5 6