/external/bison/lib/ |
H A D | float.in.h | 98 struct { unsigned int lo; unsigned int hi; unsigned int exponent; } xd; member in struct:gl_long_double_union::__anon318 151 struct { double hi; double lo; } dd; member in struct:gl_long_double_union::__anon319
|
/external/chromium_org/third_party/re2/util/ |
H A D | 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; } argument 37 #define BENCHMARK_RANGE(f, lo, hi) \ 39 (new ::testing::Benchmark(#f, f, lo, hi))
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkBitmapProcState_filter.h | 32 uint32_t lo = (a00 & mask) * scale; local 36 lo += (a01 & mask) * scale; 40 lo += (a10 & mask) * scale; 43 lo += (a11 & mask) * xy; 46 *dstColor = ((lo >> 8) & mask) | (hi & ~mask); 62 uint32_t lo = (a00 & mask) * scale; local 66 lo += (a01 & mask) * scale; 70 lo += (a10 & mask) * scale; 73 lo += (a11 & mask) * xy; 76 lo 92 uint32_t lo = (color0 & mask) * scale; local 114 uint32_t lo = (color0 & mask) * scale; local [all...] |
H A D | SkTSearch.cpp | 27 int lo = 0; local 30 while (lo < hi) 32 int mid = (hi + lo) >> 1; 37 lo = mid + 1;
|
/external/clang/test/Sema/ |
H A D | ext_vector_components.c | 44 float2 lo(float3 x) { return x.lo; } function
|
/external/compiler-rt/lib/builtins/ppc/ |
H A D | DD.h | 10 double lo; member in struct:__anon19609::__anon19610
|
/external/regex-re2/util/ |
H A D | 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; } argument 37 #define BENCHMARK_RANGE(f, lo, hi) \ 39 (new ::testing::Benchmark(#f, f, lo, hi))
|
/external/skia/src/core/ |
H A D | SkBitmapProcState_filter.h | 32 uint32_t lo = (a00 & mask) * scale; local 36 lo += (a01 & mask) * scale; 40 lo += (a10 & mask) * scale; 43 lo += (a11 & mask) * xy; 46 *dstColor = ((lo >> 8) & mask) | (hi & ~mask); 62 uint32_t lo = (a00 & mask) * scale; local 66 lo += (a01 & mask) * scale; 70 lo += (a10 & mask) * scale; 73 lo += (a11 & mask) * xy; 76 lo 92 uint32_t lo = (color0 & mask) * scale; local 114 uint32_t lo = (color0 & mask) * scale; local [all...] |
/external/chromium_org/net/quic/crypto/ |
H A D | null_decrypter.cc | 76 uint64 lo; local 78 if (!reader->ReadUInt64(&lo) || 84 *hash += lo;
|
/external/chromium_org/third_party/angle/src/libGLESv2/renderer/ |
H A D | loadimageSSE2.cpp | 43 __m128i lo = _mm_unpacklo_epi16(zeroWide, sourceData); local 46 _mm_store_si128(reinterpret_cast<__m128i*>(&dest[x]), lo); local
|
/external/chromium_org/third_party/cld/encodings/compact_lang_det/ |
H A D | ext_lang_enc.cc | 518 int lo = 0; local 520 while (lo < hi) { 521 int mid = (lo + hi) >> 1; 525 lo = mid + 1;
|
/external/chromium_org/third_party/opus/src/celt/ |
H A D | 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/ |
H A D | charclass_test.cc | 14 Rune lo; member in struct:re2::CCTest::__anon14903 19 Rune lo; member in struct:re2::CCTest::__anon14904 92 for (int k = 0; t->add[k].lo >= 0; k++) 93 printf(" %d-%d", t->add[k].lo, t->add[k].hi); 98 for (int k = 0; t->final[k].lo >= 0; k++) 99 printf(" %d-%d", t->final[k].lo, t->final[k].hi); 105 printf(" %d-%d", it->lo, it->hi); 110 for (int j = 0; t->final[j].lo >= 0; j++) 111 if (t->final[j].lo <= x && x <= t->final[j].hi) 140 for (int j = 0; t->final[j].lo > [all...] |
/external/chromium_org/third_party/skia/src/animator/ |
H A D | SkGetCondensedInfo.cpp | 23 int lo = 0; local 25 while (lo < hi) { 26 int mid = (hi + lo) >> 1; 28 lo = mid + 1; 39 int lo = 0; local 41 while (lo < hi) { 42 int mid = (hi + lo) >> 1; 44 lo = mid + 1;
|
/external/fdlibm/ |
H A D | e_exp.c | 23 * Here r will be represented as r = hi-lo for better 108 double y,hi,lo,c,t; local 130 hi = x-ln2HI[xsb]; lo=ln2LO[xsb]; k = 1-xsb-xsb; 135 lo = t*ln2LO[0]; 137 x = hi - lo; 148 else y = one-((lo-(x*c)/(2.0-c))-hi);
|
H A D | s_expm1.c | 136 double y,hi,lo,c,t,e,hxs,hfx,r1; local 165 {hi = x - ln2_hi; lo = ln2_lo; k = 1;} 167 {hi = x + ln2_hi; lo = -ln2_lo; k = -1;} 172 lo = t*ln2_lo; 174 x = hi - lo; 175 c = (hi-x)-lo;
|
/external/fio/lib/ |
H A D | getopt_long.c | 75 const struct option *lo; local 86 for (lo = longopts; lo->name; lo++) { 87 if ((opt_end = option_matches(carg+2, lo->name))) 94 *longindex = lo-longopts; 97 if (lo->has_arg) 101 } else if (lo->has_arg == 1) { 107 if (lo->flag) { 108 *lo [all...] |
/external/libopus/celt/ |
H A D | 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/libsepol/tests/ |
H A D | test-downgrade.c | 35 #define POLICY_BIN_LO "policies/test-downgrade/policy.lo" 130 int hi, lo, version; local 151 for (lo = hi - 1; lo >= POLICYDB_VERSION_MIN; lo--) { 154 policydb.policyvers = lo; 162 if (mls && lo < POLICYDB_VERSION_MLS) 165 fprintf(stderr, "error writing %spolicy binary, version %d (downgraded from %d)\n", mls ? "mls " : "", lo, hi); 177 fprintf(stderr, "error reading %spolicy binary, version %d (downgraded from %d)\n", mls ? "mls " : "", lo, hi);
|
/external/libunwind/src/ptrace/ |
H A D | _UPT_access_reg.c | 289 uint64_t lo; member in struct:__anon24716
|
/external/mockito/cglib-and-asm/src/org/mockito/cglib/util/ |
H A D | SorterTemplate.java | 27 protected void quickSort(int lo, int hi) { argument 28 quickSortHelper(lo, hi); 29 insertionSort(lo, hi); 32 private void quickSortHelper(int lo, int hi) { argument 34 int diff = hi - lo; 38 int i = (hi + lo) / 2; 39 if (compare(lo, i) > 0) { 40 swap(lo, i); 42 if (compare(lo, hi) > 0) { 43 swap(lo, h 75 insertionSort(int lo, int hi) argument 87 mergeSort(int lo, int hi) argument 99 merge(int lo, int pivot, int hi, int len1, int len2) argument 128 rotate(int lo, int mid, int hi) argument 144 lower(int lo, int hi, int val) argument 159 upper(int lo, int hi, int val) argument [all...] |
/external/openssl/crypto/bn/ |
H A D | bn_sqr.c | 211 BN_ULONG ln,lo,*p; local 278 lo= *p; 279 ln=(lo+c1)&BN_MASK2; 288 lo= *p; 289 ln=(lo+1)&BN_MASK2;
|
/external/qemu/distrib/sdl-1.2.15/include/ |
H A D | SDL_endian.h | 165 Uint32 hi, lo; local 168 lo = SDL_static_cast(Uint32, x & 0xFFFFFFFF); 171 x = SDL_Swap32(lo);
|
/external/regex-re2/re2/testing/ |
H A D | charclass_test.cc | 14 Rune lo; member in struct:re2::CCTest::__anon30313 19 Rune lo; member in struct:re2::CCTest::__anon30314 92 for (int k = 0; t->add[k].lo >= 0; k++) 93 printf(" %d-%d", t->add[k].lo, t->add[k].hi); 98 for (int k = 0; t->final[k].lo >= 0; k++) 99 printf(" %d-%d", t->final[k].lo, t->final[k].hi); 105 printf(" %d-%d", it->lo, it->hi); 110 for (int j = 0; t->final[j].lo >= 0; j++) 111 if (t->final[j].lo <= x && x <= t->final[j].hi) 140 for (int j = 0; t->final[j].lo > [all...] |
/external/skia/src/animator/ |
H A D | SkGetCondensedInfo.cpp | 23 int lo = 0; local 25 while (lo < hi) { 26 int mid = (hi + lo) >> 1; 28 lo = mid + 1; 39 int lo = 0; local 41 while (lo < hi) { 42 int mid = (hi + lo) >> 1; 44 lo = mid + 1;
|