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

1 2 3 4 5 6 7 8 91011>>

  /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...]
  /external/valgrind/main/none/tests/x86/
shift_ndep.c 6 /* Check whether the carry flag is properly preserved by a variable
12 /* First we set the carry flag. Then we increment %x, which sets
13 CC_OP to X86G_CC_OP_INCL and stores the carry (1) in
16 unchanged. Then we add-with-carry 0 to %x, which (assuming the
17 carry is still set as it should be) increments %x again. Thus the
22 clearing the carry bit, so the adc will be a no-op and the final
  /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/dropbear/libtommath/
bn_s_mp_sub.c 46 /* set carry to zero */
52 /* U = carry bit of T[i]
54 * if a carry does occur it will propagate all the way to the
55 * MSB. As a result a single shift is enough to get the carry
59 /* Clear carry from T[i] */
68 /* U = carry bit of T[i] */
71 /* Clear carry from T[i] */
bn_s_mp_add.c 64 /* zero the carry */
70 /* U = carry bit of T[i] */
73 /* take away carry bit from T[i] */
85 /* U = carry bit of T[i] */
88 /* take away carry bit from T[i] */
93 /* add carry */
bn_mp_div_2.c 41 /* carry */
44 /* get the carry for the next iteration */
47 /* shift the current digit, add in carry and store */
50 /* forward carry to next iteration */
bn_mp_mul_d.c 45 /* zero carry */
50 /* compute product and carry sum for this term */
56 /* send carry into next iteration */
60 /* store final carry [if any] and increment ix offset */
bn_mp_mul_2d.c 59 /* carry */
65 /* shift the current word and OR in the carry */
69 /* set the carry to the carry bits of the current word */
73 /* set final carry */
bn_mp_div_2d.c 72 /* carry */
78 /* shift the current word and mix in the carry bits from the previous word */
82 /* set the carry to the carry bits of the current word found above */
bn_mp_mul_2.c 42 /* carry */
46 /* get what will be the *next* carry bit from the
51 /* now shift up this digit, add in the carry [from the previous] */
54 /* copy the carry that would be from the source
bn_s_mp_mul_digs.c 45 /* set the carry to zero */
61 /* compute the columns of the output and propagate the carry */
71 /* get the carry word from the result */
74 /* set carry if it is placed below digs */
  /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;
  /external/webrtc/src/modules/audio_coding/codecs/isac/fix/source/
arith_routines.c 46 /* if result is less than the added value we must take care of the carry */
49 /* propagate carry */
56 /* if value is too big, propagate carry to next byte, and so on */
64 /* propagate carry by adding one to the previous byte in the
65 * stream if that byte is 0xFFFF we need to propagate the carry
87 /* if result is less than the added value we must take care of the carry */
90 /* propagate carry */
97 /* if value to big, propagate carry to next byte, and so on */
105 /* Add carry to previous byte */
  /external/valgrind/main/none/tests/s390x/
add.h 6 #define ADD_REG_MEM(insn, s1, s2, CARRY) \
10 asm volatile( "lghi 0," #CARRY "\n" \
18 printf(#insn " " #CARRY " + %16.16lX + %16.16lX = %16.16lX (cc=%d)\n", s1, s2, tmp, cc); \
21 #define ADD_REG_REG(insn, s1, s2, CARRY) \
25 asm volatile( "lghi 0," #CARRY "\n" \
33 printf(#insn " " #CARRY " + %16.16lX + %16.16lX = %16.16lX (cc=%d)\n", s1, s2, tmp, cc); \
36 #define ADD_REG_IMM(insn, s1, s2, CARRY) \
40 asm volatile( "lghi 0," #CARRY "\n" \
48 printf(#insn " " #CARRY " + %16.16lX + %16.16lX = %16.16lX (cc=%d)\n", s1, (unsigned long) s2, tmp, cc); \
51 #define ADD_MEM_IMM(insn, s1, s2, CARRY) \
    [all...]
  /external/webrtc/src/modules/audio_coding/codecs/isac/main/source/
arith_routines.c 31 /* add carry to buffer */
34 /* propagate carry */
45 /* add carry to buffer */
48 /* propagate 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/chromium_org/third_party/openssl/openssl/crypto/bn/asm/x86/
mul_add.pl 18 &xor($c,$c); # clear carry
43 &adc("edx",0); # H(t)+=carry
45 &adc("edx",0); # H(t)+=carry
71 &adc("edx",0); # H(t)+=carry
73 &adc("edx",0); # H(t)+=carry
  /external/openssl/crypto/bn/asm/x86/
mul_add.pl 18 &xor($c,$c); # clear carry
43 &adc("edx",0); # H(t)+=carry
45 &adc("edx",0); # H(t)+=carry
71 &adc("edx",0); # H(t)+=carry
73 &adc("edx",0); # H(t)+=carry
  /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...]
  /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...]
  /external/llvm/test/CodeGen/Thumb2/
thumb2-sbc.ll 60 define i64 @livecarry(i64 %carry, i32 %digit) nounwind {
61 %ch = lshr i64 %carry, 32
62 %cl = and i64 %carry, 4294967295
  /development/samples/BluetoothChat/
_index.html 1 <p>This application allows two Android devices to carry out
  /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...]

Completed in 5251 milliseconds

1 2 3 4 5 6 7 8 91011>>