Searched defs:hi (Results 26 - 50 of 326) sorted by relevance

1234567891011>>

/external/bison/lib/
H A Dfloat.in.h98 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 Dbenchmark.h14 int hi; 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 DSkBitmapProcState_filter.h33 uint32_t hi = ((a00 >> 8) & mask) * scale; local
37 hi += ((a01 >> 8) & mask) * scale;
41 hi += ((a10 >> 8) & mask) * scale;
44 hi += ((a11 >> 8) & mask) * xy;
46 *dstColor = ((lo >> 8) & mask) | (hi & ~mask);
63 uint32_t hi = ((a00 >> 8) & mask) * scale; local
67 hi += ((a01 >> 8) & mask) * scale;
71 hi += ((a10 >> 8) & mask) * scale;
74 hi += ((a11 >> 8) & mask) * xy;
77 hi
93 uint32_t hi = ((color0 >> 8) & mask) * scale; local
115 uint32_t hi = ((color0 >> 8) & mask) * scale; local
[all...]
H A DSkTSearch.cpp28 int hi = count - 1; local
30 while (lo < hi)
32 int mid = (hi + lo) >> 1;
39 hi = mid;
44 const char* elem = index_into_base(base, hi, elemSize);
49 hi += 1;
50 hi = ~hi;
52 return hi;
/external/clang/test/Sema/
H A Dext_vector_components.c45 float2 hi(float3 x) { return x.hi; } function
/external/compiler-rt/lib/builtins/ppc/
H A DDD.h9 double hi; member in struct:__anon19609::__anon19610
/external/regex-re2/util/
H A Dbenchmark.h14 int hi; 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 DSkBitmapProcState_filter.h33 uint32_t hi = ((a00 >> 8) & mask) * scale; local
37 hi += ((a01 >> 8) & mask) * scale;
41 hi += ((a10 >> 8) & mask) * scale;
44 hi += ((a11 >> 8) & mask) * xy;
46 *dstColor = ((lo >> 8) & mask) | (hi & ~mask);
63 uint32_t hi = ((a00 >> 8) & mask) * scale; local
67 hi += ((a01 >> 8) & mask) * scale;
71 hi += ((a10 >> 8) & mask) * scale;
74 hi += ((a11 >> 8) & mask) * xy;
77 hi
93 uint32_t hi = ((color0 >> 8) & mask) * scale; local
115 uint32_t hi = ((color0 >> 8) & mask) * scale; local
[all...]
H A DSkTSearch.cpp28 int hi = count - 1; local
30 while (lo < hi)
32 int mid = (hi + lo) >> 1;
39 hi = mid;
44 const char* elem = index_into_base(base, hi, elemSize);
49 hi += 1;
50 hi = ~hi;
52 return hi;
/external/chromium_org/net/quic/crypto/
H A Dnull_decrypter.cc77 uint32 hi; local
79 !reader->ReadUInt32(&hi)) {
82 *hash = hi;
/external/chromium_org/third_party/angle/src/libGLESv2/renderer/
H A DloadimageSSE2.cpp44 __m128i hi = _mm_unpackhi_epi16(zeroWide, sourceData); local
47 _mm_store_si128(reinterpret_cast<__m128i*>(&dest[x + 4]), hi); local
/external/chromium_org/third_party/cld/encodings/compact_lang_det/
H A Dext_lang_enc.cc519 int hi = ULScript_NUM_SCRIPTS; local
520 while (lo < hi) {
521 int mid = (lo + hi) >> 1;
523 hi = mid;
/external/chromium_org/third_party/opus/src/celt/
H A Drate.h56 int lo, hi; local
63 hi = cache[0];
67 int mid = (lo+hi+1)>>1;
70 hi = mid;
74 if (bits- (lo == 0 ? -1 : (int)cache[lo]) <= (int)cache[hi]-bits)
77 return hi;
/external/chromium_org/third_party/re2/re2/testing/
H A Dcharclass_test.cc15 Rune hi; member in struct:re2::CCTest::__anon14903
20 Rune hi; member in struct:re2::CCTest::__anon14904
93 printf(" %d-%d", t->add[k].lo, t->add[k].hi);
99 printf(" %d-%d", t->final[k].lo, t->final[k].hi);
105 printf(" %d-%d", it->lo, it->hi);
111 if (t->final[j].lo <= x && x <= t->final[j].hi)
143 it->hi != t->final[j].hi) {
147 size += it->hi - it->lo + 1;
201 ccb.AddRange(t->add[j].lo, t->add[j].hi);
[all...]
/external/chromium_org/third_party/skia/src/animator/
H A DSkGetCondensedInfo.cpp24 int hi = count - 1; local
25 while (lo < hi) {
26 int mid = (hi + lo) >> 1;
30 hi = mid;
32 if (strcmp(&strings[lengths[hi << 2]], target) != 0)
34 return hi;
40 int hi = kTypeIDs - 1; local
41 while (lo < hi) {
42 int mid = (hi + lo) >> 1;
46 hi
[all...]
/external/fdlibm/
H A De_exp.c23 * 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;
134 hi = x - t*ln2HI[0]; /* t*ln2HI is exact here */
137 x = hi - lo;
148 else y = one-((lo-(x*c)/(2.0-c))-hi);
H A Ds_expm1.c136 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;}
171 hi = x - t*ln2_hi; /* t*ln2_hi is exact here */
174 x = hi - lo;
175 c = (hi-x)-lo;
/external/libopus/celt/
H A Drate.h56 int lo, hi; local
63 hi = cache[0];
67 int mid = (lo+hi+1)>>1;
70 hi = mid;
74 if (bits- (lo == 0 ? -1 : (int)cache[lo]) <= (int)cache[hi]-bits)
77 return hi;
/external/libsepol/tests/
H A Dtest-downgrade.c34 #define POLICY_BIN_HI "policies/test-downgrade/policy.hi"
130 int hi, lo, version; local
136 /* Read in the hi policy from file */
146 for (hi = policydb.policyvers; hi >= POLICYDB_VERSION_MIN; hi--) {
151 for (lo = hi - 1; lo >= POLICYDB_VERSION_MIN; lo--) {
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.c290 uint64_t hi; member in struct:__anon24716
/external/mockito/cglib-and-asm/src/org/mockito/cglib/util/
H A DSorterTemplate.java27 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;
42 if (compare(lo, hi) > 0) {
43 swap(lo, hi);
45 if (compare(i, hi) > 0) {
46 swap(i, hi);
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/qemu/distrib/sdl-1.2.15/include/
H A DSDL_endian.h165 Uint32 hi, lo; local
170 hi = SDL_static_cast(Uint32, x & 0xFFFFFFFF);
173 x |= SDL_Swap32(hi);
/external/regex-re2/re2/testing/
H A Dcharclass_test.cc15 Rune hi; member in struct:re2::CCTest::__anon30313
20 Rune hi; member in struct:re2::CCTest::__anon30314
93 printf(" %d-%d", t->add[k].lo, t->add[k].hi);
99 printf(" %d-%d", t->final[k].lo, t->final[k].hi);
105 printf(" %d-%d", it->lo, it->hi);
111 if (t->final[j].lo <= x && x <= t->final[j].hi)
143 it->hi != t->final[j].hi) {
147 size += it->hi - it->lo + 1;
201 ccb.AddRange(t->add[j].lo, t->add[j].hi);
[all...]
/external/skia/src/animator/
H A DSkGetCondensedInfo.cpp24 int hi = count - 1; local
25 while (lo < hi) {
26 int mid = (hi + lo) >> 1;
30 hi = mid;
32 if (strcmp(&strings[lengths[hi << 2]], target) != 0)
34 return hi;
40 int hi = kTypeIDs - 1; local
41 while (lo < hi) {
42 int mid = (hi + lo) >> 1;
46 hi
[all...]
/external/tremolo/Tremolo/
H A Dmisc.h76 ogg_int32_t hi; member in struct:magic::__anon31579
85 ogg_int32_t hi; member in struct:magic::__anon31580
95 return magic.halves.hi;
105 return ((ogg_uint32_t)(magic.halves.lo)>>15) | ((magic.halves.hi)<<17);

Completed in 2324 milliseconds

1234567891011>>