| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| CharsetRecog_2022.java | 40 int shifts = 0; local
69 shifts++;
86 // Include shifts in this computation, so that KR does not get penalized
87 // for having only a single Escape sequence, but many shifts.
88 if (hits+shifts < 5) {
89 quality -= (5-(hits+shifts))*10;
|
| /external/u-boot/arch/x86/lib/ |
| div64.c | 85 int shifts = 0; local
88 shifts++;
91 result |= __ashldi3(1, shifts);
|
| /external/icu/icu4c/source/i18n/ |
| csr2022.cpp | 40 int32_t shifts = 0; local
74 shifts += 1;
94 // Include shifts in this computation, so that KR does not get penalized
95 // for having only a single Escape sequence, but many shifts.
96 if (hits+shifts < 5) {
97 quality -= (5-(hits+shifts))*10;
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| CharsetRecog_2022.java | 39 int shifts = 0; local
68 shifts++;
85 // Include shifts in this computation, so that KR does not get penalized
86 // for having only a single Escape sequence, but many shifts.
87 if (hits+shifts < 5) {
88 quality -= (5-(hits+shifts))*10;
|
| /external/libmpeg2/common/x86/ |
| ideint_spatial_filter_ssse3.c | 101 WORD32 shifts[2]; local
188 shifts[i] = 0;
192 shifts[i] = 1;
197 shifts[i] = -1;
214 pu4_row1th = (UWORD32 *)(pu1_src + shifts[0]);
215 pu4_row1tl = (UWORD32 *)(pu1_src + SUB_BLK_WD + shifts[1]);
218 pu4_row2th = (UWORD32 *)(pu1_src + shifts[0]);
219 pu4_row2tl = (UWORD32 *)(pu1_src + SUB_BLK_WD + shifts[1]);
221 pu4_row1bh = (UWORD32 *)(pu1_src - shifts[0]);
222 pu4_row1bl = (UWORD32 *)(pu1_src + SUB_BLK_WD - shifts[1])
[all...] |
| /external/webrtc/webrtc/modules/audio_coding/codecs/ilbc/ |
| poly_to_lsp.c | 39 int16_t shifts, sign; local
121 shifts = (int16_t)WebRtcSpl_NormW32(y)-16;
122 y <<= shifts; local
125 tmpW32 = (x * y) >> (19 - shifts);
|
| xcorr_coef.c | 47 int shifts; local
72 shifts=2;
74 shifts=0;
78 Energy=WebRtcSpl_DotProductWithScale(regressor, regressor, subl, shifts);
84 crossCorr=WebRtcSpl_DotProductWithScale(tp, rp, subl, shifts);
97 /* Calculate the total number of (dynamic) right shifts that have
134 Energy += step * ((*rp_end * *rp_end - *rp_beg * *rp_beg) >> shifts);
|
| enhancer_interface.c | 59 int shifts; local
123 shifts = WebRtcSpl_GetSizeInBits((uint32_t)(max16 * max16)) - 25;
124 shifts = WEBRTC_SPL_MAX(0, shifts);
128 shifts, -1);
150 ENH_BLOCKL_HALF, shifts);
206 shifts=2;
208 shifts=0;
211 WebRtcSpl_CrossCorrelation(corr32, target, regressor, plc_blockl, 3, shifts,
|
| /external/tensorflow/tensorflow/lite/kernels/internal/ |
| log_quantized_test.cc | 110 void RightShiftVector(const std::vector<int32>& shifts,
113 ASSERT_EQ(n, shifts.size());
115 vec->at(i) = std::max(1, vec->at(i) >> shifts[i]);
264 std::vector<int> shifts = generator->RandomIntVector(test_size, 0, 29); local
265 RightShiftVector(shifts, &test_data);
|
| /external/mesa3d/src/gallium/auxiliary/gallivm/ |
| lp_bld_swizzle.c | 189 * Bit mask and shifts
246 * Bit mask and recursive shifts
264 * shifts[] gives little-endian shift amounts; we need to negate for big-endian.
267 const int shifts[4][2] = { local
293 int shift = shifts[channel][i];
450 * Bit mask and shifts.
497 * same shift as possible. The shift amount is positive for shifts left
498 * and negative for shifts right.
|
| lp_bld_format_aos.c | 227 LLVMValueRef shifts[4]; local
269 shifts[i] = LLVMGetUndef(LLVMInt32TypeInContext(gallivm->context));
282 shifts[i] = lp_build_const_int32(gallivm, shift);
303 * several vector shifts and shuffle/blend results together.
328 shifted = LLVMBuildLShr(builder, packed, LLVMConstVector(shifts, 4), "");
373 LLVMValueRef shifts[4]; local
406 shifts[i] = LLVMGetUndef(LLVMInt32TypeInContext(gallivm->context));
415 shifts[i] = lp_build_const_int32(gallivm, shift);
433 shifted = LLVMBuildShl(builder, casted, LLVMConstVector(shifts, 4), "");
|
| /external/webrtc/webrtc/modules/audio_processing/utility/ |
| delay_estimator.c | 17 // Number of right shifts for scaling is linearly depending on number of bits in
19 static const int kShiftsAtZero = 13; // Right shifts at zero binary spectrum.
81 // with possible delay shifts.
555 // Make number of right shifts piecewise linear w.r.t. |far_bit_counts|.
556 int shifts = kShiftsAtZero; local
557 shifts -= (kShiftsLinearSlope * self->farend->far_bit_counts[i]) >> 4;
558 WebRtc_MeanEstimatorFix(bit_count, shifts, &(self->mean_bit_counts[i]));
|
| /external/apache-commons-compress/src/main/java/org/apache/commons/compress/compressors/bzip2/ |
| BlockSort.java | 1063 int shifts = 0; local
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
| Tnaf.java | 548 int shifts = getShiftsForCofactor(curve.getCofactor()); local
557 BigInteger dividend0 = ECConstants.ONE.add(ui[1]).shiftRight(shifts);
558 BigInteger dividend1 = ECConstants.ONE.add(ui[0]).shiftRight(shifts).negate();
566 int shifts = getShiftsForCofactor(cofactor); local
575 BigInteger dividend0 = ECConstants.ONE.add(ui[1]).shiftRight(shifts);
576 BigInteger dividend1 = ECConstants.ONE.add(ui[0]).shiftRight(shifts).negate();
|
| LongArray.java | 1221 int shifts = top < 64 ? positions : positions - 1; local
[all...] |
| /external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/math/ec/ |
| Tnaf.java | 549 int shifts = getShiftsForCofactor(curve.getCofactor()); local
558 BigInteger dividend0 = ECConstants.ONE.add(ui[1]).shiftRight(shifts);
559 BigInteger dividend1 = ECConstants.ONE.add(ui[0]).shiftRight(shifts).negate();
567 int shifts = getShiftsForCofactor(cofactor); local
576 BigInteger dividend0 = ECConstants.ONE.add(ui[1]).shiftRight(shifts);
577 BigInteger dividend1 = ECConstants.ONE.add(ui[0]).shiftRight(shifts).negate();
|
| LongArray.java | 1222 int shifts = top < 64 ? positions : positions - 1; local
[all...] |
| /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/u-boot/lib/bzip2/ |
| bzlib_blocksort.c | 1032 Int32 shifts = 0; local
1034 while ((bbSize >> shifts) > 65534) shifts++;
1038 UInt16 qVal = (UInt16)(j >> shifts);
1043 AssertH ( ((bbSize-1) >> shifts) <= 65535, 1002 );
|
| /external/v8/src/ |
| bignum.cc | 400 int shifts = 0; local
406 shifts++;
460 // And finally add the saved shifts.
461 ShiftLeft(shifts * power_exponent);
|
| /external/icu/icu4j/tools/build/src/com/ibm/icu/dev/tool/docs/ |
| APIInfo.java | 48 public int[] shifts = { 0, 3, 5, 6, 7, 8, 9 }; field in class:APIInfo
152 if (typ >= shifts.length) {
155 return (info >>> shifts[typ]) & masks[typ];
177 int val = (info >>> shifts[typ]) & masks[typ];
189 info &= ~(masks[typ] << shifts[typ]);
190 info |= (val&masks[typ]) << shifts[typ];
229 info &= ~(masks[typ] << shifts[typ]);
230 info |= i << shifts[typ];
|
| /external/u-boot/fs/yaffs2/ |
| yaffs_guts.c | 73 /* Function to return the number of shifts for a power of 2 greater than or
82 int shifts; local
84 shifts = extra_bits = 0;
90 shifts++;
94 shifts++;
96 return shifts;
99 /* Function to return the number of shifts to get a 1 in bit 0
104 u32 shifts; local
106 shifts = 0;
113 shifts++
[all...] |
| /external/guice/extensions/struts2/lib/ |
| ant-1.6.5.jar | |
| /external/jarjar/lib/ |
| apache-ant-1.9.4.jar | |
| /external/owasp/sanitizer/tools/findbugs/lib/ |
| ant.jar | |
