| /external/icu4c/i18n/ |
| 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/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9/ |
| bitops-3bit-bits-in-byte.js | 13 lir4,0xE994; 9 instructions, no memory access, minimal register dependence, 6 shifts, 2 adds, 1 inline assign
|
| /external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/ |
| bitops-3bit-bits-in-byte.js | 13 lir4,0xE994; 9 instructions, no memory access, minimal register dependence, 6 shifts, 2 adds, 1 inline assign
|
| /external/bison/src/ |
| state.c | 34 | Shifts and Gotos. |
39 | Create a new array of NUM shifts/gotos. |
54 | Return the state such that SHIFTS contain a shift/goto |
59 transitions_to (transitions *shifts, symbol_number sym)
64 assert (j < shifts->num);
65 if (TRANSITION_SYMBOL (shifts, j) == sym)
66 return shifts->states[j];
|
| 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). */
163 /* Return the state such SHIFTS contain a shift/goto to it on SYM.
165 struct state *transitions_to (transitions *shifts, symbol_number sym);
|
| /external/opencv/cvaux/src/ |
| 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 = 0 local
[all...] |
| /external/openssl/crypto/bn/ |
| bn_gcd.c | 150 int shifts=0; local
188 shifts++;
194 if (shifts)
196 if (!BN_lshift(a,a,shifts)) goto err;
|
| /external/v8/test/mjsunit/ |
| shifts.js | 30 // test a few corners cases with shifts
|
| constant-folding.js | 195 // Some tests of shifts that get into the corners in terms of coverage.
|
| /external/bzip2/ |
| 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/ |
| 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/ |
| idct_dequant_dc_full_2x_neon.asm | 81 ; vqdmulh also doubles the value before it shifts by 16. we need to
|
| idct_dequant_full_2x_neon.asm | 73 ; vqdmulh also doubles the value before it shifts by 16. we need to
|
| /external/v8/test/cctest/ |
| test-macro-assembler-x64.cc | 1842 const int shifts[] = { 0, 1, 7, 24, kSmiValueSize - 1}; local
1942 const int shifts[] = { 0, 1, 7, 24, kSmiValueSize - 1}; local
2050 const int shifts[] = { 0, 1, 7, 24, kSmiValueSize - 1}; local
[all...] |
| /external/valgrind/main/exp-ptrcheck/tests/ |
| hackedbz2.c | 3038 Int32 shifts = 0; local
[all...] |
| /external/valgrind/main/memcheck/tests/ |
| origin5-bz2.c | 3029 Int32 shifts = 0; local
[all...] |
| varinfo6.c | 3066 Int32 shifts = 0; local
[all...] |
| /external/valgrind/main/perf/ |
| bz2.c | 3029 Int32 shifts = 0; local
[all...] |
| test_input_for_tinycc.c | 2669 Int32 shifts = 0; local
[all...] |
| /external/llvm/test/MC/ARM/ |
| basic-arm-instructions.s | 49 @ Constant shifts
61 @ Register shifts
[all...] |
| /external/dropbear/libtommath/ |
| bn.tex | [all...] |
| /prebuilt/common/commons-compress/ |
| commons-compress-1.0.jar | |
| /prebuilt/common/ant/ |
| ant.jar | |
