/external/zxing/core/ |
H A D | core.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/zxing/ com/google/zxing/aztec/ ... |
/external/webrtc/src/common_audio/signal_processing/ |
H A D | complex_fft.c | 289 int i, j, l, k, istep, n, m, scale, shift; local 310 shift = 0; 316 shift++; 322 shift++; 356 frfi[2 * j] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(qr32 - tr32, shift); 357 frfi[2 * j + 1] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(qi32 - ti32, shift); 358 frfi[2 * i] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(qr32 + tr32, shift); 359 frfi[2 * i + 1] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(qi32 + ti32, shift); 410 shift+CIFFTSFT); 412 (qi32 - ti32 + round2), shift [all...] |
/external/webrtc/src/system_wrappers/source/spreadsortlib/ |
H A D | spreadsort.hpp | 86 //Gets a non-negative right bit shift to operate as a logarithmic divisor
204 inline void inner_swap_loop(RandomAccessIter * bins, const RandomAccessIter & nextbinstart, unsigned ii, right_shift &shift
209 for(RandomAccessIter * target_bin = (bins + (shift(*current, log_divisor) - div_min)); target_bin != local_bin;
210 target_bin = bins + (shift(*current, log_divisor) - div_min)) {
213 RandomAccessIter * b_bin = bins + (shift(*b, log_divisor) - div_min);
232 inline void swap_loop(RandomAccessIter * bins, RandomAccessIter & nextbinstart, unsigned ii, right_shift &shift
236 inner_swap_loop<RandomAccessIter, div_type, data_type, right_shift>(bins, nextbinstart, ii, shift, log_divisor, div_min);
243 , std::vector<size_t> &bin_sizes, right_shift shift, compare comp)
249 unsigned log_divisor = get_log_divisor(last - first, rough_log_2_size((size_t)(shift(*max, 0)) - (shift(*mi 242 spread_sort_rec(RandomAccessIter first, RandomAccessIter last, std::vector<RandomAccessIter> &bin_cache, unsigned cache_offset , std::vector<size_t> &bin_sizes, right_shift shift, compare comp) argument 290 spread_sort_rec(RandomAccessIter first, RandomAccessIter last, std::vector<RandomAccessIter> &bin_cache, unsigned cache_offset , std::vector<size_t> &bin_sizes, right_shift shift) argument 347 spread_sort(RandomAccessIter first, RandomAccessIter last, div_type, data_type, right_shift shift, compare comp) argument 356 spread_sort(RandomAccessIter first, RandomAccessIter last, div_type, data_type, right_shift shift) argument 377 integer_sort(RandomAccessIter first, RandomAccessIter last, right_shift shift, compare comp) argument 387 integer_sort(RandomAccessIter first, RandomAccessIter last, right_shift shift) argument 419 find_extremes(RandomAccessIter current, RandomAccessIter last, div_type & max, div_type & min, right_shift shift) argument 583 negative_float_sort_rec(RandomAccessIter first, RandomAccessIter last, std::vector<RandomAccessIter> &bin_cache, unsigned cache_offset , std::vector<size_t> &bin_sizes, right_shift shift) argument 632 negative_float_sort_rec(RandomAccessIter first, RandomAccessIter last, std::vector<RandomAccessIter> &bin_cache, unsigned cache_offset , std::vector<size_t> &bin_sizes, right_shift shift, compare comp) argument 766 float_sort_rec(RandomAccessIter first, RandomAccessIter last, std::vector<RandomAccessIter> &bin_cache, unsigned cache_offset , std::vector<size_t> &bin_sizes, right_shift shift) argument 850 float_sort_rec(RandomAccessIter first, RandomAccessIter last, std::vector<RandomAccessIter> &bin_cache, unsigned cache_offset , std::vector<size_t> &bin_sizes, right_shift shift, compare comp) argument 943 float_Sort(RandomAccessIter first, RandomAccessIter last, div_type, data_type, right_shift shift) argument 952 float_Sort(RandomAccessIter first, RandomAccessIter last, div_type, data_type, right_shift shift, compare comp) argument 982 float_sort(RandomAccessIter first, RandomAccessIter last, right_shift shift) argument 991 float_sort(RandomAccessIter first, RandomAccessIter last, right_shift shift, compare comp) argument [all...] |
/external/wpa_supplicant_8/hostapd/src/tls/ |
H A D | libtommath.c | 343 * MSB. As a result a single shift is enough to get the carry 1024 /* shift right by a certain bit count (store quotient in c, optional remainder in d) */ 1032 /* if the shift count is <= 0 then we do no work */ 1059 /* shift by as many digits in the bit count */ 1064 /* shift any bit count < DIGIT_BIT */ 1067 register mp_digit *tmpc, mask, shift; local 1072 /* shift for lsb */ 1073 shift = DIGIT_BIT - D; 1084 /* shift the current word and mix in the carry bits from the previous word */ 1085 *tmpc = (*tmpc >> D) | (r << shift); 1412 register mp_digit *tmpc, shift, mask, r, rr; local [all...] |
/external/wpa_supplicant_8/src/tls/ |
H A D | libtommath.c | 343 * MSB. As a result a single shift is enough to get the carry 1024 /* shift right by a certain bit count (store quotient in c, optional remainder in d) */ 1032 /* if the shift count is <= 0 then we do no work */ 1059 /* shift by as many digits in the bit count */ 1064 /* shift any bit count < DIGIT_BIT */ 1067 register mp_digit *tmpc, mask, shift; local 1072 /* shift for lsb */ 1073 shift = DIGIT_BIT - D; 1084 /* shift the current word and mix in the carry bits from the previous word */ 1085 *tmpc = (*tmpc >> D) | (r << shift); 1412 register mp_digit *tmpc, shift, mask, r, rr; local [all...] |
/external/wpa_supplicant_8/wpa_supplicant/src/tls/ |
H A D | libtommath.c | 343 * MSB. As a result a single shift is enough to get the carry 1024 /* shift right by a certain bit count (store quotient in c, optional remainder in d) */ 1032 /* if the shift count is <= 0 then we do no work */ 1059 /* shift by as many digits in the bit count */ 1064 /* shift any bit count < DIGIT_BIT */ 1067 register mp_digit *tmpc, mask, shift; local 1072 /* shift for lsb */ 1073 shift = DIGIT_BIT - D; 1084 /* shift the current word and mix in the carry bits from the previous word */ 1085 *tmpc = (*tmpc >> D) | (r << shift); 1412 register mp_digit *tmpc, shift, mask, r, rr; local [all...] |
/external/valgrind/main/none/tests/ppc32/ |
H A D | test_dfp1.c | 394 int shift = 0; local 411 *hex_fpscr_in = (i << shift); 419 *hex_fpscr_out &= (max_rm - 1) << shift; 420 expected_val = i << shift; 422 *hex_fpscr_out &= BFP_MAX_RM | ((max_rm - 1) << shift); 423 expected_val = (i << shift) | BFP_MAX_RM; 433 shift = 32;
|
H A D | test_dfp2.c | 112 static void _test_dscri (int shift) argument 114 switch(shift) { 131 printf(" dscri, unsupported shift case %d\n", shift); 135 static void _test_dscli (int shift) argument 137 switch(shift) { 154 printf(" dscli, unsupported shift case %d\n", shift); 179 static void _test_dscriq (int shift) argument 181 switch(shift) { 199 _test_dscliq(int shift) argument [all...] |
/external/valgrind/main/none/tests/ppc64/ |
H A D | test_dfp1.c | 394 int shift = 0; local 411 *hex_fpscr_in = (i << shift); 419 *hex_fpscr_out &= (max_rm - 1) << shift; 420 expected_val = i << shift; 422 *hex_fpscr_out &= BFP_MAX_RM | ((max_rm - 1) << shift); 423 expected_val = (i << shift) | BFP_MAX_RM; 433 shift = 32;
|
H A D | test_dfp2.c | 112 static void _test_dscri (int shift) argument 114 switch(shift) { 131 printf(" dscri, unsupported shift case %d\n", shift); 135 static void _test_dscli (int shift) argument 137 switch(shift) { 154 printf(" dscli, unsupported shift case %d\n", shift); 179 static void _test_dscriq (int shift) argument 181 switch(shift) { 199 _test_dscliq(int shift) argument [all...] |
/external/valgrind/main/none/tests/s390x/ |
H A D | dfp-2.c | 10 - shift left/right 64/128 bit 215 int *shift = (int *) amount; local 219 :[in]"f"(in),[amount]"a"(shift)); 231 int *shift = (int *) amount; local 235 :[in]"f"(in),[amount]"a"(shift)); 247 int *shift = (int *) amount; local 251 :[in]"f"(in),[amount]"a"(shift)); 263 int *shift = (int *) amount; local 267 :[in]"f"(in),[amount]"a"(shift));
|
/external/valgrind/main/perf/ |
H A D | tinycc.c | 1523 #define R_ALPHA_OP_PRSHIFT 15 /* OP stack right shift */ 2556 #define VT_STRUCT_SHIFT 16 /* shift for bitfield shift values */ 2605 #define TOK_SHR 0xcd /* unsigned shift right */ 2608 #define TOK_SHL 0x01 /* shift left */ 2609 #define TOK_SAR 0x02 /* signed shift right */ 6242 /* we generate the shift in ecx */ 8855 /* bn = (bn << shift) | or_val */ 8856 void bn_lshift(unsigned int *bn, int shift, int or_val) 8862 bn[i] = (v << shift) | or_va 8854 bn_lshift(unsigned int *bn, int shift, int or_val) argument 8877 int b, t, shift, frac_bits, s, exp_val, ch; local 15102 uint8_t shift; member in struct:Operand 16072 int shift, v; local [all...] |
/external/vixl/src/a64/ |
H A D | assembler-a64.cc | 214 Operand::Operand(Register reg, Shift shift, unsigned shift_amount) 216 shift_(shift), 294 Shift shift, 297 shift_(shift), extend_(NO_EXTEND), shift_amount_(shift_amount) { 300 VIXL_ASSERT(shift == LSL); 314 shift_= offset.shift(); 1548 int shift, 1550 if (shift >= 0) { 1551 // Explicit shift specified. 1552 VIXL_ASSERT((shift 1546 MoveWide(const Register& rd, uint64_t imm, int shift, MoveWideImmediateOp mov_op) argument 1747 EmitShift(const Register& rd, const Register& rn, Shift shift, unsigned shift_amount) argument 1859 Shift shift = addr.shift(); local [all...] |
H A D | disasm-a64.cc | 735 // Print the shift separately for movk, to make it clear which half word will 737 // shift calculation. 1648 unsigned shift = instr->ImmShiftLS(); local 1659 // Extend mode UXTX is an alias for shift mode LSL here. 1660 if (!((ext == UXTX) && (shift == 0))) { 1662 if (shift != 0) {
|
H A D | macro-assembler-a64.h | 348 void Asr(const Register& rd, const Register& rn, unsigned shift) { argument 352 asr(rd, rn, shift); 772 void Lsl(const Register& rd, const Register& rn, unsigned shift) { argument 776 lsl(rd, rn, shift); 785 void Lsr(const Register& rd, const Register& rn, unsigned shift) { argument 789 lsr(rd, rn, shift); 820 void Movk(const Register& rd, uint64_t imm, int shift = -1) { 823 movk(rd, imm, shift); 886 void Ror(const Register& rd, const Register& rs, unsigned shift) { argument 890 ror(rd, rs, shift); [all...] |
H A D | simulator-a64.cc | 63 // Ensure that shift operations act as the simulator expects. 1024 int64_t shift = instr->ShiftMoveWide() * 16; local 1025 int64_t shifted_imm16 = instr->ImmMoveWide() << shift; 1041 (prev_xn_val & ~(INT64_C(0xffff) << shift)) | shifted_imm16; 1213 unsigned shift = wreg(instr->Rm()) & mask; local 1215 shift); 1223 // It assumes that a right shift on a signed integer is an arithmetic shift. 1684 // mantissa = (mantissa >> shift) + halfbit(adjusted); 1715 // Calculate the shift require 1718 int shift = highest_significant_bit - mbits; local [all...] |
/external/vixl/src/ |
H A D | utils-vixl.cc | 121 int shift = 1 << i; local 122 value = ((value >> shift) & kMasks[i]) + (value & kMasks[i]);
|
/external/vixl/test/ |
H A D | test-assembler-a64.cc | 4001 int shift[] = {1, 3, 5, 9, 17, 33}; local 4005 __ Mov(w1, shift[0]); 4006 __ Mov(w2, shift[1]); 4007 __ Mov(w3, shift[2]); 4008 __ Mov(w4, shift[3]); 4009 __ Mov(w5, shift[4]); 4010 __ Mov(w6, shift[5]); 4032 ASSERT_EQUAL_64(value << (shift[0] & 63), x16); 4033 ASSERT_EQUAL_64(value << (shift[1] & 63), x17); 4034 ASSERT_EQUAL_64(value << (shift[ 4053 int shift[] = {1, 3, 5, 9, 17, 33}; local 4107 int shift[] = {1, 3, 5, 9, 17, 33}; local 4161 int shift[] = {4, 8, 12, 16, 24, 36}; local [all...] |
/external/webp/src/dsp/ |
H A D | enc.c | 261 int size, int round, int shift) { 271 DC = (DC + round) >> shift; 275 DC = (DC + round) >> shift; 259 DCMode(uint8_t* dst, const uint8_t* left, const uint8_t* top, int size, int round, int shift) argument
|
/external/webp/src/enc/ |
H A D | picture_csp.c | 126 static WEBP_INLINE int LinearToGamma(uint32_t base_value, int shift) { argument 127 const int v = base_value << shift; // final uplifted value 140 static WEBP_INLINE int LinearToGamma(uint32_t base_value, int shift) { argument 141 return (int)(base_value << shift);
|
/external/webp/src/utils/ |
H A D | bit_reader_inl.h | 140 const int shift = kVP8Log2Range[range]; local 142 br->bits_ -= shift; 149 // simplified version of VP8GetBit() for prob=0x80 (note shift is always 1 here)
|
H A D | bit_writer.c | 116 if (bw->range_ < 127) { // emit 'shift' bits out and renormalize 117 const int shift = kNorm[bw->range_]; local 119 bw->value_ <<= shift; 120 bw->nb_bits_ += shift; 264 const int shift = VP8L_WRITER_MAX_BITS - used; local 267 n_bits -= shift; 268 bits >>= shift; local
|
H A D | utils.h | 104 const int shift = (1 << i); local 105 const uint32_t x = value >> shift; 108 log += shift;
|
/external/valgrind/main/VEX/priv/ |
H A D | guest_amd64_toIR.c | 786 r /= (UInt)PFX_VEXnV0; /* pray this turns into a shift */ 974 /* Read the %CL register :: Ity_I8, for shift/rotate operations. */ 1824 /* For shift operations, we put in the result and the undershifted 1825 result. Except if the shift amount is zero, the thunk is left 3524 /* Put value to shift/rotate in dst0. */ 3620 default: vpanic("dis_Grp2:shift"); break; 3623 /* Widen the value to be shifted to 64 bits, do the shift, and 3626 shifts give defined results for shift values all the way up 3629 bit values, and the shift amount is guaranteed to be in the 3631 all shift value 4765 IRTemp mask[4], shift[4]; local 4792 IRTemp mask[5], shift[5]; local 4820 IRTemp mask[6], shift[6]; local [all...] |
H A D | guest_arm64_toIR.c | 1860 range and hence undefined shift. */ 2245 result. After the shift, the value can optionally be NOT-ed 2645 /* and now shift */ 5161 /* Helper for decoding laneage for shift-style vector operations 5162 that involve an immediate shift amount. */ 5163 static Bool getLaneInfo_IMMH_IMMB ( /*OUT*/UInt* shift, /*OUT*/UInt* szBlg2, argument 5170 if (shift) *shift = 128 - immhb; 5175 if (shift) *shift 6828 UInt shift = 0; local 6876 UInt shift = 0; local 6954 UInt shift = 0; local [all...] |