| /external/chromium_org/third_party/opus/src/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/chromium_org/third_party/re2/re2/testing/ |
| compile_test.cc | 139 int lo; member in struct:re2::UTF8ByteRange
165 for (int j = utf8ranges[i].lo; j <= utf8ranges[i].hi; j++)
|
| /external/chromium_org/third_party/re2/re2/ |
| unicode_groups.h | 27 uint16 lo; member in struct:re2::URange16
33 uint32 lo; member in struct:re2::URange32
|
| /external/chromium_org/third_party/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))
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkTSearch.cpp | 27 int lo = 0; local
30 while (lo < hi)
32 int mid = (hi + lo) >> 1;
37 lo = mid + 1;
|
| /external/compiler-rt/lib/ppc/ |
| DD.h | 10 double lo; member in struct:__anon19127::__anon19128
|
| /external/freetype/src/base/ |
| md5.h | 35 MD5_u32plus lo, hi; member in struct:__anon20161
|
| /external/llvm/include/llvm/Support/ |
| MD5.h | 43 MD5_u32plus hi, lo; member in class:llvm::MD5
|
| /external/regex-re2/re2/testing/ |
| compile_test.cc | 139 int lo; member in struct:re2::UTF8ByteRange
165 for (int j = utf8ranges[i].lo; j <= utf8ranges[i].hi; j++)
|
| /external/regex-re2/re2/ |
| unicode_groups.h | 27 uint16 lo; member in struct:re2::URange16
33 uint32 lo; member in struct:re2::URange32
|
| /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))
|
| /external/skia/src/core/ |
| SkTSearch.cpp | 27 int lo = 0; local
30 while (lo < hi)
32 int mid = (hi + lo) >> 1;
37 lo = mid + 1;
|
| /frameworks/av/media/libstagefright/codecs/amrnb/common/src/ |
| lsp_az.cpp | 199 Word16 i, j, hi, lo;
215 L_Extract (f[-1], &hi, &lo);
216 t0 = Mpy_32_16 (hi, lo, *lsp); // t0 = f[-1] * lsp
261 Word16 lo; local
278 lo = (Word16)((*(f - 1) >> 1) - ((Word32) hi << 15));
281 t0 += ((Word32)lo * *lsp) >> 15;
|
| /frameworks/av/media/libstagefright/codecs/amrwb/src/ |
| isf_extrapolation.cpp | 123 int16 exp, exp2, hi, lo; local
164 int32_to_dpf(L_tmp, &hi, &lo);
165 L_tmp = mpy_dpf_32(hi, lo, hi, lo);
174 int32_to_dpf(L_tmp, &hi, &lo);
175 L_tmp = mpy_dpf_32(hi, lo, hi, lo);
184 int32_to_dpf(L_tmp, &hi, &lo);
185 L_tmp = mpy_dpf_32(hi, lo, hi, lo);
[all...] |
| /frameworks/av/media/libstagefright/codecs/amrwbenc/src/ |
| isp_az.c | 46 Word16 hi, lo; local
92 lo = (f1[i] & 0xffff)>>1;
94 t0 = Mpy_32_16(hi, lo, isp[m - 1]);
100 lo = (f2[i] & 0xffff)>>1;
101 t0 = Mpy_32_16(hi, lo, isp[m - 1]);
156 lo = (f1[nc] & 0xffff)>>1;
157 t0 = Mpy_32_16(hi, lo, isp[m - 1]);
188 Word16 hi, lo; local
203 lo = (f[-1] & 0xffff)>>1;
205 t0 = Mpy_32_16(hi, lo, *isp); /* t0 = f[-1] * isp *
219 Word16 hi, lo; local
[all...] |
| 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...] |
| /frameworks/base/core/java/android/util/ |
| ContainerHelpers.java | 27 int lo = 0; local
30 while (lo <= hi) {
31 final int mid = (lo + hi) >>> 1;
35 lo = mid + 1;
42 return ~lo; // value not present
46 int lo = 0; local
49 while (lo <= hi) {
50 final int mid = (lo + hi) >>> 1;
54 lo = mid + 1;
61 return ~lo; // value not presen
[all...] |
| /libcore/crypto/src/main/java/org/conscrypt/ |
| SSLInputStream.java | 82 long lo = readUint32(); local
83 return (hi << 32) | lo;
|
| /ndk/sources/host-tools/sed-4.2.1/testsuite/ |
| runtests.c | 128 int lo;
132 lo = 0;
137 lo = atoi (argv[1]);
138 hi = lo + 1;
144 for (x = lo; x < hi; ++x)
124 int lo; local
|
| /libcore/luni/src/test/java/libcore/java/net/ |
| NetworkInterfaceTest.java | 29 NetworkInterface lo = NetworkInterface.getByName("lo"); local
30 Set<InetAddress> actual = new HashSet<InetAddress>(Collections.list(lo.getInetAddresses()));
40 // We know lo shouldn't have a hardware address or an IPv4 broadcast address.
41 NetworkInterface lo = NetworkInterface.getByName("lo"); local
42 assertNull(lo.getHardwareAddress());
43 for (InterfaceAddress ia : lo.getInterfaceAddresses()) {
|
| /bionic/libm/upstream-freebsd/lib/msun/src/ |
| e_log10f.c | 36 float f,hfsq,hi,lo,r,y; local
69 lo = (f - hi) - hfsq + r;
70 return y*log10_2lo + (lo+hi)*ivln10lo + lo*ivln10hi + hi*ivln10hi +
|
| e_log2.c | 44 double f,hfsq,hi,lo,r,val_hi,val_lo,w,y; local
76 * keeps R small (though not as small as a true `lo' term would be),
80 * theorem for spitting f-hfsq as hi+lo, unless double_t was used
103 lo = (f - hi) - hfsq + r;
105 val_lo = (lo+hi)*ivln2lo + lo*ivln2hi;
|
| /external/bison/lib/ |
| float.in.h | 98 struct { unsigned int lo; unsigned int hi; unsigned int exponent; } xd; member in struct:gl_long_double_union::__anon2721
151 struct { double hi; double lo; } dd; member in struct:gl_long_double_union::__anon2722
|
| /external/chromium_org/third_party/openssl/openssl/crypto/bn/ |
| bn_sqr.c | 210 BN_ULONG ln,lo,*p; local
277 lo= *p;
278 ln=(lo+c1)&BN_MASK2;
287 lo= *p;
288 ln=(lo+1)&BN_MASK2;
|
| /external/chromium_org/third_party/skia/include/core/ |
| SkTSearch.h | 48 int lo = 0; local
51 while (lo < hi) {
52 int mid = (hi + lo) >> 1;
56 lo = mid + 1;
|
