Searched refs:lo (Results 51 - 75 of 630) sorted by relevance

1234567891011>>

/external/oprofile/libpp/
H A Dsymbol.cpp35 bool has_sample_counts(count_array_t const & counts, size_t lo, size_t hi) argument
37 for (size_t i = lo; i <= hi; ++i)
/external/skia/src/animator/
H A DSkGetCondensedInfo.cpp23 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/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/base/
H A Dftcalc.c49 FT_UInt32 lo; member in struct:FT_Int64_
279 FT_UInt32 lo1, hi1, lo2, hi2, lo, hi, i1, i2; local
285 lo = lo1 * lo2;
297 /* Check carry overflow of i1 + lo */
298 lo += i1;
299 hi += ( lo < i1 );
301 z->lo = lo;
308 FT_UInt32 lo,
326 r |= lo >> 3
307 ft_div64by32( FT_UInt32 hi, FT_UInt32 lo, FT_UInt32 y ) argument
345 register FT_UInt32 lo, hi; local
[all...]
H A Dmd5.h35 MD5_u32plus lo, hi; member in struct:__anon28786
/external/apache-xml/src/main/java/org/apache/xml/utils/
H A DNodeVector.java643 int lo = lo0;
646 // pause(lo, hi);
647 if (lo >= hi)
651 else if (lo == hi - 1)
657 if (a[lo] > a[hi])
659 int T = a[lo];
661 a[lo] = a[hi];
671 int pivot = a[(lo + hi) / 2];
673 a[(lo + hi) / 2] = a[hi];
676 while (lo < h
[all...]
/external/chromium_org/third_party/freetype/src/base/
H A Dmd5.h35 MD5_u32plus lo, hi; member in struct:__anon11803
/external/chromium_org/third_party/icu/source/common/
H A Dbmpset.h81 * lo=findCodePoint(start) and
83 * with 0<=lo<=hi<len.
84 * findCodePoint(c) defaults to lo=0 and hi=len-1.
87 * @param lo The lowest index to be returned.
89 * @return the smallest integer i in the range lo..hi,
92 int32_t findCodePoint(UChar32 c, int32_t lo, int32_t hi) const;
94 inline UBool containsSlow(UChar32 c, int32_t lo, int32_t hi) const;
155 inline UBool BMPSet::containsSlow(UChar32 c, int32_t lo, int32_t hi) const { argument
156 return (UBool)(findCodePoint(c, lo, hi) & 1);
/external/chromium_org/third_party/re2/re2/
H A Dunicode_casefold.h54 uint32 lo; member in struct:re2::CaseFold
/external/freetype/src/base/
H A Dmd5.h35 MD5_u32plus lo, hi; member in struct:__anon21538
/external/icu/icu4c/source/common/
H A Dbmpset.h81 * lo=findCodePoint(start) and
83 * with 0<=lo<=hi<len.
84 * findCodePoint(c) defaults to lo=0 and hi=len-1.
87 * @param lo The lowest index to be returned.
89 * @return the smallest integer i in the range lo..hi,
92 int32_t findCodePoint(UChar32 c, int32_t lo, int32_t hi) const;
94 inline UBool containsSlow(UChar32 c, int32_t lo, int32_t hi) const;
155 inline UBool BMPSet::containsSlow(UChar32 c, int32_t lo, int32_t hi) const { argument
156 return (UBool)(findCodePoint(c, lo, hi) & 1);
/external/regex-re2/re2/
H A Dunicode_casefold.h54 uint32 lo; member in struct:re2::CaseFold
/external/chromium_org/third_party/boringssl/src/crypto/modes/
H A Dgcm.c77 uint64_t T = OPENSSL_U64(0xe100000000000000) & (0 - (V.lo & 1)); \
78 V.lo = (V.hi << 63) | (V.lo >> 1); \
81 uint32_t T = 0xe1000000U & (0 - (uint32_t)(V.lo & 1)); \
82 V.lo = (V.hi << 63) | (V.lo >> 1); \
92 Htable[0].lo = 0;
94 V.lo = H[1];
103 Htable[3].hi = V.hi ^ Htable[2].hi, Htable[3].lo = V.lo
[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;
135 lo = t*ln2LO[0];
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;}
172 lo = t*ln2_lo;
174 x = hi - lo;
175 c = (hi-x)-lo;
/external/llvm/test/MC/Mips/
H A Delf-relsym.s45 addiu $2, $2, %lo(_gp_disp)
48 addiu $2, $2, %lo($.str)
52 addiu $2, $2, %lo($.str1)
56 ldc1 $f0, %lo($CPI0_0)($2)
60 ldc1 $f4, %lo($CPI0_1)($3)
/external/chromium_org/third_party/re2/re2/testing/
H A Dcharclass_test.cc14 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/compiler-rt/lib/builtins/ppc/
H A Ddivtc3.c14 (x).s.lo = 0.0; \
36 cDD.s.lo = crt_scalbn(cDD.s.lo, -ilogbw);
38 dDD.s.lo = crt_scalbn(dDD.s.lo, -ilogbw);
49 real.s.lo = crt_scalbn(real.s.lo, -ilogbw);
51 imag.s.lo = crt_scalbn(imag.s.lo, -ilogbw);
63 real.s.lo
[all...]
/external/regex-re2/re2/testing/
H A Dcharclass_test.cc14 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/openssl/crypto/bn/asm/
H A Dx86-gf2m.pl122 ($lo,$hi)=("eax","edx");
131 &lea (@i[1],&DWP(0,$lo,$lo));
132 &sar ($lo,31); # broadcast 31st bit
146 &and ($lo,$b);
150 &mov ($hi,$lo);
151 &shl ($lo,31);
159 &xor ($lo,@i[1]);
166 &xor ($lo,&DWP(0,"esp",@i[0],4));
177 &xor ($lo,
[all...]
/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/openssl/crypto/modes/asm/
H A Dghash-ia64.pl111 { .mii; $ADDP Htbl=8,in1 // &Htbl[0].lo
131 { .mii; add Hi[1]=Htbl,Hi[1] // &Htbl[nlo].lo
166 ld8 r`16+2*$i`=[r9],16 } // Htable[$i].lo
168 ldf8 f`32+2*$i`=[r11],16 // Htable[`8+$i`].lo
215 { .mmi; st8 [r8]=$rlo,16 // Htable[$i].lo
218 { .mmi; stf8 [r10]=f`32+2*$i`,16 // Htable[`8+$i`].lo
221 { .mmi; st8 [r14]=$rlo,16 // Htable[$i].lo>>4
226 { .mmi; ld8 r16=[r8],16 // Htable[8].lo
228 { .mmi; ld8 r18=[r8],16 // Htable[9].lo
235 { .mmi; ld8 r`20+2*$i`=[r8],16 // Htable[`10+$i`].lo
[all...]
/external/elfutils/0.153/config/
H A Dknown-dwarf.awk34 lo = hi = "";
39 if (elt ~ /(lo|low)_user$/) {
40 lo = elt;
/external/compiler-rt/lib/builtins/arm/
H A Dswitch16.S38 ite lo
H A Dswitch32.S38 ite lo
H A Dswitch8.S36 ite lo

Completed in 649 milliseconds

1234567891011>>