/frameworks/av/media/libstagefright/codecs/amrwbenc/src/ |
oper_32b.c | 26 * L_32 = hi<<16 + lo<<1 * 29 * hi and lo are 16 bit signed integers. * 53 * lo : (L_32 - hi<<16)>>1 * 57 __inline void VO_L_Extract (Word32 L_32, Word16 *hi, Word16 *lo) 60 *lo = (Word16)((L_32 & 0xffff) >> 1); 70 * L_32 = hi<<16 + lo<<1 * 75 * lo lsf (with sign) * 85 Word32 L_Comp (Word16 hi, Word16 lo) 91 return (L_mac (L_32, lo, 1)); /* = hi<<16 + lo<<1 * 197 Word16 approx, hi, lo, n_hi, n_lo; local [all...] |
/external/dhcpcd-6.8.2/compat/ |
strtoi.h | 34 int base, intmax_t lo, intmax_t hi, int *rstatus); 36 int base, uintmax_t lo, uintmax_t hi, int *rstatus);
|
/external/regex-re2/re2/ |
unicode_groups.h | 27 uint16 lo; member in struct:re2::URange16 33 uint32 lo; member in struct:re2::URange32
|
/frameworks/av/media/libstagefright/codecs/amrnb/enc/src/ |
l_comp.cpp | 36 lo = 16 bit signed integer (Word16) whose value falls in 37 the range : 0x8000 <= lo <= 0x7fff. 41 L_out = 32-bit result of (hi<<16 + lo<<1). 56 format (DPF) numbers hi and lo by the following operation: 58 2. Shift lo left by 1. 142 Word32 L_Comp(Word16 hi, Word16 lo, Flag *pOverflow) 156 temp32 = L_mac(L_32, lo, 1, pOverflow); 161 return (temp32); /* = hi<<16 + lo<<1 */
|
/toolchain/binutils/binutils-2.25/gas/testsuite/gas/mips/ |
elf-rel8-mips16.s | 12 addiu $4,(%lo (gvar)) 13 lw $4,%lo gvar($5) 22 sb $5,%lo(lvar)($4) 25 addiu $4,%lo(lvar)
|
elf-rel8.s | 8 addiu $4,$4,(%lo (gvar)) 9 lw $4,%lo gvar($5) 26 sb $5,%lo(lvar)($4) 35 addiu $4,$4,%lo(lvar)
|
tls-ill.s | 8 addiu $4,$28,%lo(%gottprel(tlsvar))
|
/toolchain/binutils/binutils-2.25/gas/testsuite/gas/v850/ |
hilo.s | 3 movea lo(0xdeadbeef),r0,r1
|
/toolchain/binutils/binutils-2.25/include/cgen/ |
basic-modes.h | 50 #define MAKEDI(hi, lo) ((((DI) (SI) (hi)) << 32) | ((UDI) (USI) (lo)))
|
/toolchain/binutils/binutils-2.25/ld/testsuite/ld-mips-elf/ |
pic-and-nonpic-5a.s | 7 addiu $2,$2,%lo(foo) 9 addiu $2,$2,%lo(obj1)
|
/toolchain/binutils/binutils-2.25/ld/testsuite/ld-nios2/ |
hilo16.s | 1 # Test the %hi, lo and %hiadj relocations 9 addi r1, r1, %lo(long_symbol)
|
/external/fonttools/Lib/fontTools/misc/ |
fixedTools.py | 33 lo = fmt % (value - eps) 36 length = min(len(lo), len(hi)) 38 if lo[i] != hi[i]: 40 out.append(lo[i]) 43 out.append(max(lo[outlen], hi[outlen]))
|
/external/libcxx/test/std/containers/sequences/vector/vector.cons/ |
move_alloc.pass.cpp | 26 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); 28 assert(is_contiguous_container_asan_correct(lo)); 32 lo.push_back(i); 35 assert(is_contiguous_container_asan_correct(lo)); 37 assert(l2 == lo); 44 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); 46 assert(is_contiguous_container_asan_correct(lo)); 50 lo.push_back(i); 53 assert(is_contiguous_container_asan_correct(lo)); 55 assert(l2 == lo); [all...] |
move.pass.cpp | 26 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); 28 assert(is_contiguous_container_asan_correct(lo)); 32 lo.push_back(i); 35 assert(is_contiguous_container_asan_correct(lo)); 37 assert(l2 == lo); 39 assert(l2.get_allocator() == lo.get_allocator()); 44 std::vector<MoveOnly, other_allocator<MoveOnly> > lo(other_allocator<MoveOnly>(5)); 46 assert(is_contiguous_container_asan_correct(lo)); 50 lo.push_back(i); 53 assert(is_contiguous_container_asan_correct(lo)); [all...] |
/external/skia/src/core/ |
SkBitmapProcState_filter.h | 31 uint32_t lo = (a00 & mask) * scale; local 35 lo += (a01 & mask) * scale; 39 lo += (a10 & mask) * scale; 42 lo += (a11 & mask) * xy; 45 *dstColor = ((lo >> 8) & mask) | (hi & ~mask); 61 uint32_t lo = (a00 & mask) * scale; local 65 lo += (a01 & mask) * scale; 69 lo += (a10 & mask) * scale; 72 lo += (a11 & mask) * xy; 75 lo = ((lo >> 8) & mask) * alphaScale 91 uint32_t lo = (color0 & mask) * scale; local 113 uint32_t lo = (color0 & mask) * scale; local [all...] |
/frameworks/av/media/libstagefright/codecs/amrnb/common/src/ |
div_32.cpp | 96 0 < lo < 0x7fff 176 Word16 lo; local 192 lo = (result >> 1) - (hi << 15); 194 result = Mpy_32_16(hi, lo, approx, pOverflow); 199 lo = (result >> 1) - (hi << 15); 204 result = Mpy_32(n_hi, n_lo, hi, lo, pOverflow);
|
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.cons/ |
move_alloc.pass.cpp | 26 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); 28 assert(is_contiguous_container_asan_correct(lo)); 32 lo.push_back(i); 35 assert(is_contiguous_container_asan_correct(lo)); 37 assert(l2 == lo); 44 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); 46 assert(is_contiguous_container_asan_correct(lo)); 50 lo.push_back(i); 53 assert(is_contiguous_container_asan_correct(lo)); 55 assert(l2 == lo); [all...] |
move.pass.cpp | 26 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); 28 assert(is_contiguous_container_asan_correct(lo)); 32 lo.push_back(i); 35 assert(is_contiguous_container_asan_correct(lo)); 37 assert(l2 == lo); 39 assert(l2.get_allocator() == lo.get_allocator()); 44 std::vector<MoveOnly, other_allocator<MoveOnly> > lo(other_allocator<MoveOnly>(5)); 46 assert(is_contiguous_container_asan_correct(lo)); 50 lo.push_back(i); 53 assert(is_contiguous_container_asan_correct(lo)); [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/vector/vector.cons/ |
move_alloc.pass.cpp | 26 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); 28 assert(is_contiguous_container_asan_correct(lo)); 32 lo.push_back(i); 35 assert(is_contiguous_container_asan_correct(lo)); 37 assert(l2 == lo); 44 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); 46 assert(is_contiguous_container_asan_correct(lo)); 50 lo.push_back(i); 53 assert(is_contiguous_container_asan_correct(lo)); 55 assert(l2 == lo); [all...] |
move.pass.cpp | 26 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); 28 assert(is_contiguous_container_asan_correct(lo)); 32 lo.push_back(i); 35 assert(is_contiguous_container_asan_correct(lo)); 37 assert(l2 == lo); 39 assert(l2.get_allocator() == lo.get_allocator()); 44 std::vector<MoveOnly, other_allocator<MoveOnly> > lo(other_allocator<MoveOnly>(5)); 46 assert(is_contiguous_container_asan_correct(lo)); 50 lo.push_back(i); 53 assert(is_contiguous_container_asan_correct(lo)); [all...] |
/toolchain/binutils/binutils-2.25/ld/testsuite/ld-frv/ |
tls-relax-static-3.d | 11 10094: 92 fc 00 00 setlos lo\(0x0\),gr9 14 100a0: 92 fc 00 00 setlos lo\(0x0\),gr9 16 100a8: 12 fc 00 00 setlos\.p lo\(0x0\),gr9 19 100b4: 92 fc 00 00 setlos lo\(0x0\),gr9 22 100c0: 92 fc 00 00 setlos lo\(0x0\),gr9
|
/external/pdfium/third_party/libopenjpeg20/ |
mct.c | 232 __m128i lo, hi; local 238 lo = r; 240 lo = _mm_mul_epi32(lo, ry); 242 lo = _mm_add_epi64(lo, mulround); 244 lo = _mm_srli_epi64(lo, 13); 246 y = _mm_blend_epi16(lo, hi, 0xCC); 248 lo = g [all...] |
/device/google/contexthub/firmware/os/core/ |
floatRt.c | 128 uint32_t hi = v >> 32, lo = v; local 131 return(float)lo; 133 return ((float)hi) * 4294967296.0f + (float)lo; 139 uint32_t hi = ((uint64_t)v) >> 32, lo = v; local 141 if ((hi == 0x00000000 && !(lo >> 31)) || (hi == 0xffffffff && (lo >> 31))) //this complex test is a lot faster then the simpler ((v >> 33) == -1 || (v >> 33) == 0) 142 return (float)(int32_t)lo;
|
/external/libopus/celt/ |
rate.h | 56 int lo, hi; local 62 lo = 0; 67 int mid = (lo+hi+1)>>1; 72 lo = mid; 74 if (bits- (lo == 0 ? -1 : (int)cache[lo]) <= (int)cache[hi]-bits) 75 return lo;
|
/external/regex-re2/util/ |
benchmark.h | 13 int lo; member in struct:testing::Benchmark 20 Benchmark(const char* name, void (*f)(int, int), int l, int h) { Clear(name); fnr = f; lo = l; hi = h; Register(); } 21 void Clear(const char* n) { name = n; fn = 0; fnr = 0; lo = 0; hi = 0; threadlo = 0; threadhi = 0; } 22 Benchmark* ThreadRange(int lo, int hi) { threadlo = lo; threadhi = hi; return this; } 37 #define BENCHMARK_RANGE(f, lo, hi) \ 39 (new ::testing::Benchmark(#f, f, lo, hi))
|