| /external/chromium_org/third_party/skia/src/animator/ |
| 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/clang/test/Sema/ |
| ext_vector_components.c | 44 float2 lo(float3 x) { return x.lo; } function
|
| /external/libsepol/tests/ |
| 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/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/skia/include/core/ |
| SkTSearch.h | 48 int lo = 0; local
51 while (lo < hi) {
52 int mid = (hi + lo) >> 1;
56 lo = mid + 1;
|
| /external/skia/src/animator/ |
| 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;
|
| /frameworks/support/v4/java/android/support/v4/util/ |
| ContainerHelpers.java | 46 int lo = 0; local
49 while (lo <= hi) {
50 int mid = (lo + hi) >>> 1;
54 lo = mid + 1;
61 return ~lo; // value not present
65 int lo = 0; local
68 while (lo <= hi) {
69 final int mid = (lo + hi) >>> 1;
73 lo = mid + 1;
80 return ~lo; // value not presen
[all...] |
| /bionic/libm/upstream-freebsd/lib/msun/src/ |
| e_exp.c | 26 * Here r will be represented as r = hi-lo for better
107 double y,hi=0.0,lo=0.0,c,t,twopk; local
131 hi = x-ln2HI[xsb]; lo=ln2LO[xsb]; k = 1-xsb-xsb;
136 lo = t*ln2LO[0];
138 STRICT_ASSIGN(double, x, hi - lo);
153 else y = one-((lo-(x*c)/(2.0-c))-hi);
|
| e_expf.c | 48 float y,hi=0.0,lo=0.0,c,t,twopk; local
69 hi = x-ln2HI[xsb]; lo=ln2LO[xsb]; k = 1-xsb-xsb;
74 lo = t*ln2LO[0];
76 STRICT_ASSIGN(float, x, hi - lo);
91 else y = one-((lo-(x*c)/((float)2.0-c))-hi);
|
| e_log10.c | 44 double f,hfsq,hi,lo,r,val_hi,val_lo,w,y,y2; local
74 lo = (f - hi) - hfsq + r;
77 val_lo = y*log10_2lo + (lo+hi)*ivln10lo + lo*ivln10hi;
|
| s_expm1.c | 135 double y,hi,lo,c,t,e,hxs,hfx,r1,twopk; 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 STRICT_ASSIGN(double, x, hi - lo);
175 c = (hi-x)-lo;
|
| s_expm1f.c | 44 float y,hi,lo,c,t,e,hxs,hfx,r1,twopk; local
71 {hi = x - ln2_hi; lo = ln2_lo; k = 1;}
73 {hi = x + ln2_hi; lo = -ln2_lo; k = -1;}
78 lo = t*ln2_lo;
80 STRICT_ASSIGN(float, x, hi - lo);
81 c = (hi-x)-lo;
|
| /dalvik/vm/ |
| PointerSet.cpp | 207 int hi, lo, mid; local
209 lo = mid = 0;
213 while (lo <= hi) {
214 mid = (lo + hi) / 2;
218 lo = mid + 1;
|
| /external/chromium_org/net/quic/ |
| quic_data_reader.cc | 26 uint32 lo; local
27 if (!ReadUInt32(&lo)) {
38 *result += lo;
|
| quic_data_writer.cc | 51 uint32 lo = value & GG_UINT64_C(0x00000000FFFFFFFF); local
52 return WriteUInt32(lo) && WriteUInt16(hi);
|
| /external/chromium_org/third_party/cld/encodings/compact_lang_det/ |
| 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/re2/re2/testing/ |
| charclass_test.cc | 14 Rune lo; member in struct:re2::CCTest::__anon15868
19 Rune lo; member in struct:re2::CCTest::__anon15869
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 >= 0; j++, ++it)
[all...] |
| /external/chromium_org/v8/test/cctest/ |
| test-strtod.cc | 432 static uint32_t lo = 0; local
437 if (lo == 0) lo = 0x64d1c3c9;
441 lo = 18273 * (lo & 0xFFFF) + (lo >> 16);
442 return (hi << 16) + (lo & 0xFFFF);
|
| /external/fdlibm/ |
| 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);
|
| 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/qemu/distrib/sdl-1.2.15/include/ |
| 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/ |
| charclass_test.cc | 14 Rune lo; member in struct:re2::CCTest::__anon27559
19 Rune lo; member in struct:re2::CCTest::__anon27560
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 >= 0; j++, ++it)
[all...] |
| /external/tremolo/Tremolo/ |
| asm_arm.h | 44 int lo,hi; local
46 : "=&r"(lo),"=&r"(hi)
57 int lo,hi; local
61 : "=&r"(lo),"=&r"(hi)
|
| misc.h | 75 ogg_int32_t lo; member in struct:magic::__anon28751
86 ogg_int32_t lo; member in struct:magic::__anon28752
105 return ((ogg_uint32_t)(magic.halves.lo)>>15) | ((magic.halves.hi)<<17);
|
| /external/v8/test/cctest/ |
| test-spaces.cc | 240 LargeObjectSpace* lo = HEAP->lo_space(); local
241 CHECK(lo != NULL);
245 Object* obj = lo->AllocateRaw(lo_size, NOT_EXECUTABLE)->ToObjectUnchecked();
250 CHECK(lo->Contains(HeapObject::cast(obj)));
252 CHECK(lo->FindObject(ho->address()) == obj);
254 CHECK(lo->Contains(ho));
257 intptr_t available = lo->Available();
258 { MaybeObject* maybe_obj = lo->AllocateRaw(lo_size, NOT_EXECUTABLE);
261 CHECK(lo->Available() < available);
264 CHECK(!lo->IsEmpty())
[all...] |
