| /external/icu4c/i18n/ |
| H A D | csr2022.cpp | 38 int32_t shifts = 0; local
72 shifts += 1;
92 // Include shifts in this computation, so that KR does not get penalized
93 // for having only a single Escape sequence, but many shifts.
94 if (hits+shifts < 5) {
95 quality -= (5-(hits+shifts))*10;
|
| /external/bison/src/ |
| H A D | state.c | 39 | Create a new array of NUM shifts/gotos. |
59 transitions_to (transitions *shifts, symbol_number sym) argument
64 assert (j < shifts->num);
65 if (TRANSITION_SYMBOL (shifts, j) == sym)
66 return shifts->states[j];
|
| H A D | state.h | 49 The two types of actions are shifts/gotos (push the look-ahead token
153 /* Iterate over each transition over a token (shifts). */
165 struct state *transitions_to (transitions *shifts, symbol_number sym);
|
| /external/opencv/cvaux/src/ |
| H A D | cvlevmarprojbandle.cpp | 369 int *shifts = 0; local
391 CV_CALL(shifts = (int*)cvAlloc(sizeof(int)*numImages));
392 memset(shifts,0,sizeof(int)*numImages);
407 sum += cvmGet(pointDeriv[currImage],0,shifts[currImage]*4+i) *
408 cvmGet(pointDeriv[currImage],0,shifts[currImage]*4+j);
410 sum += cvmGet(pointDeriv[currImage],1,shifts[currImage]*4+i) *
411 cvmGet(pointDeriv[currImage],1,shifts[currImage]*4+j);
425 shifts[currImage]++;
431 cvFree( &shifts);
634 int *shifts local
[all...] |
| /external/openssl/crypto/bn/ |
| H A D | bn_gcd.c | 150 int shifts=0; local
188 shifts++;
194 if (shifts)
196 if (!BN_lshift(a,a,shifts)) goto err;
|
| /external/bzip2/ |
| H A D | blocksort.c | 992 Int32 shifts = 0; local
994 while ((bbSize >> shifts) > 65534) shifts++;
998 UInt16 qVal = (UInt16)(j >> shifts);
1003 AssertH ( ((bbSize-1) >> shifts) <= 65535, 1002 );
|
| /external/v8/src/ |
| H A D | bignum.cc | 423 int shifts = 0;
429 shifts++;
483 // And finally add the saved shifts.
484 ShiftLeft(shifts * power_exponent);
|
| /external/libvpx/vp8/decoder/arm/neon/ |
| H A D | idct_dequant_dc_full_2x_neon.asm | 81 ; vqdmulh also doubles the value before it shifts by 16. we need to
|
| H A D | idct_dequant_full_2x_neon.asm | 73 ; vqdmulh also doubles the value before it shifts by 16. we need to
|
| /external/v8/test/cctest/ |
| H A D | test-macro-assembler-x64.cc | 1842 const int shifts[] = { 0, 1, 7, 24, kSmiValueSize - 1}; local
1847 int shift = shifts[i];
1942 const int shifts[] = { 0, 1, 7, 24, kSmiValueSize - 1}; local
1946 int shift = shifts[i];
2050 const int shifts[] = { 0, 1, 7, 24, kSmiValueSize - 1}; local
2054 int shift = shifts[i];
|
| /external/valgrind/main/exp-ptrcheck/tests/ |
| H A D | hackedbz2.c | 3038 Int32 shifts = 0; local
3040 while ((bbSize >> shifts) > 65534) shifts++;
3044 UInt16 qVal = (UInt16)(j >> shifts);
3049 AssertH ( ((bbSize-1) >> shifts) <= 65535, 1002 );
|
| /external/valgrind/main/memcheck/tests/ |
| H A D | origin5-bz2.c | 3029 Int32 shifts = 0; local
3031 while ((bbSize >> shifts) > 65534) shifts++;
3035 UInt16 qVal = (UInt16)(j >> shifts);
3040 AssertH ( ((bbSize-1) >> shifts) <= 65535, 1002 );
|
| H A D | varinfo6.c | 3066 Int32 shifts = 0; local
3068 while ((bbSize >> shifts) > 65534) shifts++;
3072 UInt16 qVal = (UInt16)(j >> shifts);
3077 AssertH ( ((bbSize-1) >> shifts) <= 65535, 1002 );
|
| /external/valgrind/main/perf/ |
| H A D | bz2.c | 3029 Int32 shifts = 0; local
3031 while ((bbSize >> shifts) > 65534) shifts++;
3035 UInt16 qVal = (UInt16)(j >> shifts);
3040 AssertH ( ((bbSize-1) >> shifts) <= 65535, 1002 );
|
| H A D | test_input_for_tinycc.c | 2669 Int32 shifts = 0; local
2671 while ((bbSize >> shifts) > 65534) shifts++;
2675 UInt16 qVal = (UInt16)(j >> shifts);
2680 { if (!(((bbSize-1) >> shifts) <= 65535)) bz_internal_error ( 1002 ); };
|
| /external/dropbear/libtommath/ |
| H A D | bn.tex | 972 Logical operations are operations that can be performed either with simple shifts or boolean operators such as
977 Multiplications and divisions by any power of two can be performed with quick logical shifts either left or
|
| /external/llvm/test/MC/ARM/ |
| H A D | basic-arm-instructions.s | 49 @ Constant shifts
61 @ Register shifts
|