| /external/srec/srec/cfront/ |
| sh_down.h | 35 static PINLINE int fixed_point_convert(float xx, int shift);
36 static PINLINE int shift_up_inline(int value, unsigned int shift);
37 static PINLINE int shift_down_inline(int value, unsigned int shift);
42 static PINLINE int shift_up_inline(int value, unsigned int shift)
44 /* Shift up using bit operations with max limit */
47 ASSERT(shift > 0);
53 retval = temp << shift;
64 static PINLINE int shift_down_inline(int value, unsigned int shift)
65 /* Shift down using bit operations with rounding */
67 if (shift-- == 0
[all...] |
| log_tabl.c | 61 logtab->shift = (int)(val + 0.5);
84 int log_lookup(log_table_info *logtab, int operand, int shift)
94 shift++;
98 shift++;
102 log_report("tab: %d %d -> %d\n", operand, shift,
103 (int)((shift) *(logtab->shift) + logtab->table[operand]));
105 return ((int)((shift) *(logtab->shift) + logtab->table[operand]));
122 int ii, aa, bb, cc, value, shift; local
[all...] |
| /external/kernel-headers/original/linux/ |
| bitops.h | 38 * @shift: bits to roll
40 static inline __u32 rol32(__u32 word, unsigned int shift)
42 return (word << shift) | (word >> (32 - shift));
49 * @shift: bits to roll
51 static inline __u32 ror32(__u32 word, unsigned int shift)
53 return (word >> shift) | (word << (32 - shift));
|
| /external/webkit/JavaScriptCore/tests/mozilla/js1_2/Array/ |
| general1.js | 33 var TITLE = 'String:push,unshift,shift';
50 testcases[count++] = new TestCase( SECTION, "array1.shift()", array1.shift(),123);
55 array1.shift(); //array1 = [dog,-99,mouse]
56 array1.shift(); //array1 = [-99,mouse]
57 array1.shift(); //array1 = [mouse]
58 testcases[count++] = new TestCase( SECTION, "array1.shift()", array1.shift(),"mouse");
59 testcases[count++] = new TestCase( SECTION, "array1.shift()", "undefined", String(array1.shift()));
[all...] |
| /dalvik/vm/alloc/ |
| Float12.h | 37 int shift = 0; local
39 /* Shift off the precision we don't care about.
48 shift++;
50 if (shift > 0 && (pval & 1)) {
56 shift++;
60 /* Shift off enough bits to create a valid exponent.
64 while (shift % 4 != 0) {
66 shift++;
74 if (shift > 0) {
75 val = ((oval >> (shift - 1)) + 1) >> 1
[all...] |
| /external/skia/src/core/ |
| SkEdge.cpp | 23 the points into FDot6. This is modulated by the shift parameter, which
27 or pt * 256 for antialiasing. This is implemented as 1 << (shift + 6).
30 or pt >> 8 for antialiasing. This is implemented as pt >> (10 - shift).
36 int shift) {
41 float scale = float(1 << (shift + 6));
47 shift = 10 - shift;
48 x0 = p0.fX >> shift;
49 y0 = p0.fY >> shift;
50 x1 = p1.fX >> shift;
264 int shift = fCurveShift; local
[all...] |
| SkBitmap_scroll.cpp | 15 int shift; local
20 shift = 0;
24 shift = 1;
27 shift = 2;
72 // if we get this far, then we need to shift the pixels
92 src -= dx << shift;
95 dst += dx << shift;
99 width <<= shift; // now width is the number of bytes to move per line local
|
| /external/srec/srec/include/ |
| log_tabl.h | 32 int shift; member in struct:__anon5876
40 int log_lookup(log_table_info *logtab, int operand, int shift);
|
| /packages/apps/Email/src/com/beetstra/jutf7/ |
| ModifiedUTF7Charset.java | 45 if (ch == shift())
50 byte shift() {
method in class:ModifiedUTF7Charset
|
| /external/speex/libspeex/ |
| lpc_bfin.h | 49 int shift, ac_shift; local
58 shift = 8;
59 while (shift && ac0<0x40000000)
61 shift--;
72 nshift = -shift;
115 d = ADD32(d,SHR32(MULT16_16(x[j],x[j]), shift));
124 d = ADD32(d,SHR32(MULT16_16(x[j],x[j-i]), shift));
|
| fixed_generic.h | 45 #define SHR16(a,shift) ((a) >> (shift))
46 #define SHL16(a,shift) ((a) << (shift))
47 #define SHR32(a,shift) ((a) >> (shift))
48 #define SHL32(a,shift) ((a) << (shift))
49 #define PSHR16(a,shift) (SHR16((a)+((1<<((shift))>>1)),shift)
[all...] |
| /external/opencore/codecs_v2/audio/aac/dec/src/ |
| trans4m_time_2_freq_fxp.cpp | 51 Added shift down operation for case when the window was equal to one.
388 Int shift = *pQ_format - 1; local
423 *pAux_temp_1 = fxp_mul32_by_16((*pAux_temp_1), *pLong_Window_1++) >> shift;
425 *pAux_temp_2 = fxp_mul32_by_16((*pAux_temp_2), *pLong_Window_2++) >> shift;
433 if (shift)
437 *(pAux_temp_1++) >>= shift;
438 *(pAux_temp_1++) >>= shift;
454 *pAux_temp_1 = fxp_mul32_by_16((*pAux_temp_1), *pShort_Window_1--) >> shift;
456 *pAux_temp_2 = fxp_mul32_by_16((*pAux_temp_2), *pShort_Window_2--) >> shift;
487 *pAux_temp_1 = fxp_mul32_by_16((*pAux_temp_1), *pShort_Window_1++) >> shift;
[all...] |
| esc_iquant_scaling.cpp | 163 shift = QTABLE - *pQFormat;
171 tmp_coef = x * (inverseQuantTable[absX] >> shift);
190 tmp_coef = x * (inverseQuantTable[absX] >> shift);
195 approxOneThird = (w1 * FACTOR) >> shift;
203 deltaOneThird >>= (shift + ORDER - 1);
349 * a) If yes, just multiply by table value by itself, then shift as
367 * then FACTOR is a simple power of 2, so a shift can do the job.
447 Int shift; local
492 shift = QTABLE - QFormat;
506 mult_high = (x * (inverseQuantTable[absX] >> shift));
[all...] |
| fft_rx4_short.cpp | 38 (2) Increased down shift from 1 to 2, to ensure that 32-bit
66 exponent returns a shift to compensate the scaling introduced by
228 Int shift; local
247 /* shift down to avoid possible overflow in first pass of the loop */
248 shift = 2;
268 temp1 >>= shift; local
269 temp2 >>= shift; local
276 temp3 >>= shift; local
277 temp4 >>= shift; local
287 temp1 >>= shift; local
288 temp2 >>= shift; local
295 temp3 >>= shift; local
296 temp4 >>= shift; local
329 temp1 >>= shift; local
330 temp2 >>= shift; local
336 temp3 >>= shift; local
337 temp4 >>= shift; local
347 temp1 >>= shift; local
348 temp2 >>= shift; local
358 temp3 >>= shift; local
359 temp4 >>= shift; local
[all...] |
| imdct_fxp.cpp | 51 shift = shift factor to reflect scaling introduced by IFFT and imdct_fxp,
149 RETURNING( shift )
179 RETURN (exp - shift)
277 Int shift = 0; local
305 shift = 21; /* log2(n)-1 + 14 acomodates 2/N factor */
310 shift = 24; /* log2(n)-1 +14 acomodates 2/N factor */
446 shift -= mix_radix_fft(data_quant,
449 shift -= inv_long_complex_rot(data_quant,
456 shift -= fft_rx4_short(data_quant, &max)
[all...] |
| /frameworks/base/media/libstagefright/codecs/aacdec/ |
| trans4m_time_2_freq_fxp.cpp | 51 Added shift down operation for case when the window was equal to one.
388 Int shift = *pQ_format - 1; local
423 *pAux_temp_1 = fxp_mul32_by_16((*pAux_temp_1), *pLong_Window_1++) >> shift;
425 *pAux_temp_2 = fxp_mul32_by_16((*pAux_temp_2), *pLong_Window_2++) >> shift;
433 if (shift)
437 *(pAux_temp_1++) >>= shift;
438 *(pAux_temp_1++) >>= shift;
454 *pAux_temp_1 = fxp_mul32_by_16((*pAux_temp_1), *pShort_Window_1--) >> shift;
456 *pAux_temp_2 = fxp_mul32_by_16((*pAux_temp_2), *pShort_Window_2--) >> shift;
487 *pAux_temp_1 = fxp_mul32_by_16((*pAux_temp_1), *pShort_Window_1++) >> shift;
[all...] |
| esc_iquant_scaling.cpp | 163 shift = QTABLE - *pQFormat;
171 tmp_coef = x * (inverseQuantTable[absX] >> shift);
190 tmp_coef = x * (inverseQuantTable[absX] >> shift);
195 approxOneThird = (w1 * FACTOR) >> shift;
203 deltaOneThird >>= (shift + ORDER - 1);
349 * a) If yes, just multiply by table value by itself, then shift as
367 * then FACTOR is a simple power of 2, so a shift can do the job.
447 Int shift; local
492 shift = QTABLE - QFormat;
506 mult_high = (x * (inverseQuantTable[absX] >> shift));
[all...] |
| fft_rx4_short.cpp | 38 (2) Increased down shift from 1 to 2, to ensure that 32-bit
66 exponent returns a shift to compensate the scaling introduced by
228 Int shift; local
247 /* shift down to avoid possible overflow in first pass of the loop */
248 shift = 2;
268 temp1 >>= shift; local
269 temp2 >>= shift; local
276 temp3 >>= shift; local
277 temp4 >>= shift; local
287 temp1 >>= shift; local
288 temp2 >>= shift; local
295 temp3 >>= shift; local
296 temp4 >>= shift; local
329 temp1 >>= shift; local
330 temp2 >>= shift; local
336 temp3 >>= shift; local
337 temp4 >>= shift; local
347 temp1 >>= shift; local
348 temp2 >>= shift; local
358 temp3 >>= shift; local
359 temp4 >>= shift; local
[all...] |
| imdct_fxp.cpp | 51 shift = shift factor to reflect scaling introduced by IFFT and imdct_fxp,
149 RETURNING( shift )
179 RETURN (exp - shift)
277 Int shift = 0; local
305 shift = 21; /* log2(n)-1 + 14 acomodates 2/N factor */
310 shift = 24; /* log2(n)-1 +14 acomodates 2/N factor */
446 shift -= mix_radix_fft(data_quant,
449 shift -= inv_long_complex_rot(data_quant,
456 shift -= fft_rx4_short(data_quant, &max)
[all...] |
| /external/freetype/src/base/ |
| fttrigon.c | 103 FT_Int shift; local
110 shift = 0;
113 /* determine msb bit index in `shift' */
117 shift += 16;
122 shift += 8;
127 shift += 4;
132 shift += 2;
137 shift += 1;
140 if ( shift <= 27 )
142 shift = 27 - shift
420 FT_Int shift; local
457 FT_Int shift; local
493 FT_Int shift; local
[all...] |
| /external/qemu/target-arm/ |
| op_helper.c | 52 int shift; local
56 for (shift = 0; shift < 32; shift += 8) {
57 index = (ireg >> shift) & 0xff;
60 val |= tmp << shift;
62 val |= def & (0xff << shift);
75 #define SHIFT 0
78 #define SHIFT 1
81 #define SHIFT
391 int shift = i & 0xff; local
399 int shift = i & 0xff; local
407 int shift = i & 0xff; local
415 int shift = i & 0xff; local
423 int shift = i & 0xff; local
439 int shift = i & 0xff; local
455 int shift = i & 0xff; local
468 int shift1, shift; local
[all...] |
| /bootable/bootloader/legacy/libboot/ |
| gpio_keypad.c | 52 unsigned int shift; local
56 shift = keypad->noutputs * keypad->ninputs;
67 shift--;
69 if(((unsigned)(keypad->state >> shift) ^ (unsigned)keys) & 1) {
72 mapped_key = keypad->key_map[shift];
75 // shift, mapped_key, keys & 1);
|
| /dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/engines/ |
| AESEngine.java | 222 private int shift( method in class:AESEngine
224 int shift)
226 return (r >>> shift) | (r << -shift);
257 return f2 ^ f4 ^ f8 ^ shift(f2 ^ f9, 8) ^ shift(f4 ^ f9, 16) ^ shift(f9, 24);
309 temp = subWord(shift(temp, 8)) ^ rcon[(i / KC)-1];
488 r0 = T0[C0&255] ^ shift(T0[(C1>>8)&255], 24) ^ shift(T0[(C2>>16)&255],16) ^ shift(T0[(C3>>24)&255],8) ^ KW[r][0]
[all...] |
| /system/core/include/private/pixelflinger/ |
| ggl_fixed.h | 110 inline GGLfixed gglMulx(GGLfixed x, GGLfixed y, int shift) CONST;
111 inline GGLfixed gglMulx(GGLfixed x, GGLfixed y, int shift) {
113 if (__builtin_constant_p(shift)) {
118 : "%[x]"(x), [y]"r"(y), [lshift] "I"(32-shift), [rshift] "I"(shift)
126 : "%[x]"(x), [y]"r"(y), [lshift] "r"(32-shift), [rshift] "r"(shift)
133 inline GGLfixed gglMulAddx(GGLfixed x, GGLfixed y, GGLfixed a, int shift) CONST;
134 inline GGLfixed gglMulAddx(GGLfixed x, GGLfixed y, GGLfixed a, int shift) {
136 if (__builtin_constant_p(shift)) {
[all...] |
| /frameworks/base/libs/surfaceflinger/ |
| BlurFilter.cpp | 80 inline uint16_t to(int shift, int last, int dither) const {
91 R += (dither << shift) >> BLUR_DITHER_BITS;
92 G += (dither << shift) >> BLUR_DITHER_BITS;
93 B += (dither << shift) >> BLUR_DITHER_BITS;
95 R >>= shift; local
96 G >>= shift; local
97 B >>= shift; local
127 inline uint32_t to(int shift, int last, int dither) const {
139 R >>= shift; local
140 G >>= shift; local
141 B >>= shift; local
175 L >>= shift; local
210 A >>= shift; local
235 const int shift = 31 - clz(kernelSizeUser); local
[all...] |
