Searched defs:lo (Results 126 - 150 of 308) sorted by relevance

1234567891011>>

/external/regex-re2/re2/
H A Donepass.cc465 for (int c = ip->lo(); c <= ip->hi(); c++) {
483 Rune lo = max<Rune>(ip->lo(), 'a') + 'A' - 'a'; local
485 for (int c = lo; c <= hi; c++) {
565 int lo = i; local
568 StringAppendF(&dump, "\t%d: %#x-%#x\n", b, lo, i - 1);
/external/skia/src/core/
H A DSkFilterProc.cpp54 #define COMBINE(lo, hi) (((lo) & ~0xFF00) | (((hi) & ~0xFF00) << 8))
62 uint32_t lo = (3 * LO_PAIR(c00) + LO_PAIR(c01)) >> 2; local
64 return COMBINE(lo, hi);
67 uint32_t lo = (LO_PAIR(c00) + LO_PAIR(c01)) >> 1; local
69 return COMBINE(lo, hi);
72 uint32_t lo = (LO_PAIR(c00) + 3 * LO_PAIR(c01)) >> 2; local
74 return COMBINE(lo, hi);
78 uint32_t lo = (3 * LO_PAIR(c00) + LO_PAIR(c10)) >> 2; local
80 return COMBINE(lo, h
83 uint32_t lo = (9 * LO_PAIR(c00) + 3 * (LO_PAIR(c01) + LO_PAIR(c10)) + LO_PAIR(c11)) >> 4; local
88 uint32_t lo = (3 * (LO_PAIR(c00) + LO_PAIR(c01)) + LO_PAIR(c10) + LO_PAIR(c11)) >> 3; local
93 uint32_t lo = (9 * LO_PAIR(c01) + 3 * (LO_PAIR(c00) + LO_PAIR(c11)) + LO_PAIR(c10)) >> 4; local
99 uint32_t lo = (LO_PAIR(c00) + LO_PAIR(c10)) >> 1; local
104 uint32_t lo = (3 * (LO_PAIR(c00) + LO_PAIR(c10)) + LO_PAIR(c01) + LO_PAIR(c11)) >> 3; local
109 uint32_t lo = (LO_PAIR(c00) + LO_PAIR(c01) + LO_PAIR(c10) + LO_PAIR(c11)) >> 2; local
114 uint32_t lo = (3 * (LO_PAIR(c01) + LO_PAIR(c11)) + LO_PAIR(c00) + LO_PAIR(c10)) >> 3; local
120 uint32_t lo = (LO_PAIR(c00) + 3 * LO_PAIR(c10)) >> 2; local
125 uint32_t lo = (9 * LO_PAIR(c10) + 3 * (LO_PAIR(c00) + LO_PAIR(c11)) + LO_PAIR(c01)) >> 4; local
130 uint32_t lo = (3 * (LO_PAIR(c10) + LO_PAIR(c11)) + LO_PAIR(c00) + LO_PAIR(c01)) >> 3; local
135 uint32_t lo = (9 * LO_PAIR(c11) + 3 * (LO_PAIR(c01) + LO_PAIR(c10)) + LO_PAIR(c00)) >> 4; local
160 uint32_t lo = (3 * LO_PAIR(c00) + LO_PAIR(c01)) >> 2; local
167 uint32_t lo = (LO_PAIR(c00) + LO_PAIR(c01)) >> 1; local
174 uint32_t lo = (LO_PAIR(c00) + 3 * LO_PAIR(c01)) >> 2; local
182 uint32_t lo = (3 * LO_PAIR(c00) + LO_PAIR(c10)) >> 2; local
191 uint32_t lo = (9 * LO_PAIR(c00) + 3 * (LO_PAIR(c01) + LO_PAIR(c10)) + LO_PAIR(c11)) >> 4; local
200 uint32_t lo = (3 * (LO_PAIR(c00) + LO_PAIR(c01)) + LO_PAIR(c10) + LO_PAIR(c11)) >> 3; local
209 uint32_t lo = (9 * LO_PAIR(c01) + 3 * (LO_PAIR(c00) + LO_PAIR(c11)) + LO_PAIR(c10)) >> 4; local
217 uint32_t lo = (LO_PAIR(c00) + LO_PAIR(c10)) >> 1; local
226 uint32_t lo = (3 * (LO_PAIR(c00) + LO_PAIR(c10)) + LO_PAIR(c01) + LO_PAIR(c11)) >> 3; local
235 uint32_t lo = (LO_PAIR(c00) + LO_PAIR(c01) + LO_PAIR(c10) + LO_PAIR(c11)) >> 2; local
244 uint32_t lo = (3 * (LO_PAIR(c01) + LO_PAIR(c11)) + LO_PAIR(c00) + LO_PAIR(c10)) >> 3; local
252 uint32_t lo = (LO_PAIR(c00) + 3 * LO_PAIR(c10)) >> 2; local
261 uint32_t lo = (9 * LO_PAIR(c10) + 3 * (LO_PAIR(c00) + LO_PAIR(c11)) + LO_PAIR(c01)) >> 4; local
270 uint32_t lo = (3 * (LO_PAIR(c10) + LO_PAIR(c11)) + LO_PAIR(c00) + LO_PAIR(c01)) >> 3; local
279 uint32_t lo = (9 * LO_PAIR(c11) + 3 * (LO_PAIR(c01) + LO_PAIR(c10)) + LO_PAIR(c00)) >> 4; local
[all...]
/external/tremolo/Tremolo/
H A Dfloor1.c175 int lo=0; local
183 lo=k;
191 info->loneighbor[j]=lo;
/external/bzip2/
H A Dblocksort.c34 Int32 lo,
40 if (lo == hi) return;
42 if (hi - lo > 3) {
43 for ( i = hi-4; i >= lo; i-- ) {
52 for ( i = hi-1; i >= lo; i-- ) {
99 Int32 sp, lo, hi; local
113 fpop ( lo, hi );
114 if (hi - lo < FALLBACK_QSORT_SMALL_THRESH) {
115 fallbackSimpleSort ( fmap, eclass, lo, hi );
128 if (r3 == 0) med = eclass[fmap[lo]]; els
32 fallbackSimpleSort( UInt32* fmap, UInt32* eclass, Int32 lo, Int32 hi ) argument
485 mainSimpleSort( UInt32* ptr, UChar* block, UInt16* quadrant, Int32 nblock, Int32 lo, Int32 hi, Int32 d, Int32* budget ) argument
631 Int32 sp, lo, hi, d; local
890 Int32 lo = ftab[sb] & CLEARMASK; local
[all...]
/external/chromium_org/third_party/boringssl/src/crypto/poly1305/
H A Dpoly1305_vec.c58 static uint64_t INLINE shr128_pair(uint64_t hi, uint64_t lo, const int shift) { argument
59 return (uint64_t)((((uint128_t)hi << 64) | lo) >> shift);
/external/chromium_org/third_party/icu/source/common/
H A Duset.cpp418 int32_t lo = 0; local
424 int32_t i = (lo + hi) >> 1;
425 if (i == lo) {
430 lo = i;
441 int32_t lo = 0; local
447 int32_t i = ((lo + hi) >> 1) & ~1; // Guarantee even result
449 if (i == lo) {
454 lo = i;
/external/chromium_org/third_party/icu/source/i18n/
H A Dnfrs.cpp449 int32_t lo = 0; local
451 while (lo < hi) {
452 int32_t mid = (lo + hi) / 2;
460 lo = mid + 1;
/external/chromium_org/third_party/icu/source/tools/tzcode/
H A Dicuzdump.cpp103 void setLowYear(int32_t lo) { argument
104 loyear = lo;
189 void getCutOverTimes(UDate& lo, UDate& hi) { argument
194 lo = gcal->getTime(status);
/external/chromium_org/third_party/libpng/
H A Dpng.c867 long lo, hi, x, y; local
874 lo = b * d; /* BD */
876 y = ((lo >> 16) & 0xffff) + x;
878 lo = (lo & 0xffff) | ((y & 0xffff) << 16);
884 *lo_product = (unsigned long)lo;
/external/chromium_org/third_party/libxml/src/
H A Duri.c1066 int hi = val / 0x10, lo = val % 0x10; local
1069 ret[len++] = lo + (lo > 9? 'A'-10 : '0');
1110 int hi = val / 0x10, lo = val % 0x10; local
1113 ret[len++] = lo + (lo > 9? 'A'-10 : '0');
1197 int hi = val / 0x10, lo = val % 0x10; local
1200 ret[len++] = lo + (lo > 9? 'A'-10 : '0');
1265 int hi = val / 0x10, lo local
1334 int hi = val / 0x10, lo = val % 0x10; local
1374 int hi = val / 0x10, lo = val % 0x10; local
[all...]
/external/chromium_org/third_party/opus/src/celt/
H A Drate.c254 int lo, hi; local
269 lo = 0;
273 int mid = (lo+hi)>>1;
292 lo = mid;
295 /*printf ("interp bisection gave %d\n", lo);*/
299 int tmp = bits1[j] + (lo*bits2[j]>>ALLOC_STEPS);
529 int lo, hi, len, j; local
578 lo = 1;
584 int mid = (lo+hi) >> 1;
606 lo
[all...]
/external/chromium_org/third_party/re2/re2/
H A Dprog.h90 void InitByteRange(int lo, int hi, int foldcase, uint32 out);
103 int lo() { DCHECK_EQ(opcode(), kInstByteRange); return lo_; } function in class:re2::Prog::Inst
224 // lo-hi (inclusive) are treated as different from bytes outside the range.
227 void MarkByteRange(int lo, int hi);
H A Dregexp.cc699 // Add lo-hi to the class; return whether class got bigger.
700 bool CharClassBuilder::AddRange(Rune lo, Rune hi) { argument
701 if (hi < lo)
704 if (lo <= 'z' && hi >= 'A') {
707 Rune lo1 = max<Rune>(lo, 'A');
712 lo1 = max<Rune>(lo, 'a');
718 { // Check whether lo, hi is already in the class.
719 iterator it = ranges_.find(RuneRange(lo, lo));
720 if (it != end() && it->lo <
[all...]
/external/chromium_org/third_party/skia/src/core/
H A DSkGlyphCache.cpp292 int lo = 0; local
295 while (lo < hi) {
296 int mid = (hi + lo) >> 1;
298 lo = mid + 1;
/external/chromium_org/v8/src/
H A Ddateparser.h36 static inline bool Between(int x, int lo, int hi) { argument
37 return static_cast<unsigned>(x - lo) <= static_cast<unsigned>(hi - lo);
/external/compiler-rt/lib/builtins/
H A Dfp_lib.h54 static inline void wideMultiply(rep_t a, rep_t b, rep_t *hi, rep_t *lo) { argument
57 *lo = product;
86 static inline void wideMultiply(rep_t a, rep_t b, rep_t *hi, rep_t *lo) { argument
92 // Sum terms that contribute to lo in a way that allows us to get the carry
95 *lo = r0 + (r1 << 32);
96 // Sum terms contributing to hi with the carry from lo
151 static inline void wideMultiply(rep_t a, rep_t b, rep_t *hi, rep_t *lo) { argument
194 *lo = r0 + (r1 << 64);
247 static inline void wideLeftShift(rep_t *hi, rep_t *lo, int count) { argument
248 *hi = *hi << count | *lo >> (typeWidt
252 wideRightShiftWithSticky(rep_t *hi, rep_t *lo, unsigned int count) argument
[all...]
/external/dnsmasq/src/
H A Dnetwork.c157 struct iname *lo; local
158 for (lo = daemon->if_names; lo; lo = lo->next)
159 if (lo->name && strcmp(lo->name, ifr.ifr_name) == 0)
161 lo->isloop = 1;
165 if (!lo &&
166 (lo
[all...]
/external/eigen/Eigen/src/Core/arch/NEON/
H A DPacketMath.h193 float32x2_t lo, hi; local
194 lo = vld1_dup_f32(from);
196 return vcombine_f32(lo, hi);
200 int32x2_t lo, hi; local
201 lo = vld1_dup_s32(from);
203 return vcombine_s32(lo, hi);
/external/eigen/demos/opengl/
H A Dquaternion_demo.cpp274 TimeLine::const_iterator lo = hi; local
275 --lo;
282 currentFrame = lo->second;
292 float s = (m_alpha - lo->first)/(hi->first - lo->first);
294 currentFrame = ::lerpFrame<EulerAngles<float> >(s, lo->second, hi->second);
296 currentFrame = ::lerpFrame<Eigen::Quaternionf>(s, lo->second, hi->second);
/external/flac/libFLAC/
H A Dbitreader.c527 FLAC__uint32 hi, lo; local
532 if(!FLAC__bitreader_read_raw_uint32(br, &lo, 32))
536 *val |= lo;
539 if(!FLAC__bitreader_read_raw_uint32(br, &lo, bits))
541 *val = lo;
/external/icu/icu4c/source/common/
H A Duset.cpp418 int32_t lo = 0; local
424 int32_t i = (lo + hi) >> 1;
425 if (i == lo) {
430 lo = i;
441 int32_t lo = 0; local
447 int32_t i = ((lo + hi) >> 1) & ~1; // Guarantee even result
449 if (i == lo) {
454 lo = i;
/external/icu/icu4c/source/i18n/
H A Dnfrs.cpp449 int32_t lo = 0; local
451 while (lo < hi) {
452 int32_t mid = (lo + hi) / 2;
460 lo = mid + 1;
/external/icu/icu4c/source/tools/tzcode/
H A Dicuzdump.cpp103 void setLowYear(int32_t lo) { argument
104 loyear = lo;
189 void getCutOverTimes(UDate& lo, UDate& hi) { argument
194 lo = gcal->getTime(status);
/external/libopus/celt/
H A Drate.c254 int lo, hi; local
269 lo = 0;
273 int mid = (lo+hi)>>1;
292 lo = mid;
295 /*printf ("interp bisection gave %d\n", lo);*/
299 int tmp = bits1[j] + (lo*bits2[j]>>ALLOC_STEPS);
529 int lo, hi, len, j; local
578 lo = 1;
584 int mid = (lo+hi) >> 1;
606 lo
[all...]
/external/libunwind/src/dwarf/
H A DGfind_proc_info-lsb.c760 unsigned long lo, hi, mid; local
763 for (lo = 0, hi = table_len; lo < hi;)
765 mid = (lo + hi) / 2;
771 lo = mid + 1;
793 unsigned long lo, hi, mid; local
799 for (lo = 0, hi = table_len; lo < hi;)
801 mid = (lo + hi) / 2;
809 lo
[all...]

Completed in 1789 milliseconds

1234567891011>>