| /external/openssl/crypto/bn/asm/ |
| armv4-gf2m.pl | 73 ($hi,$lo,$t0,$t1, $i0,$i1 )=map("r$_",(4..9),12);
106 mov $hi,$t1,lsr#29
111 eor $hi,$hi,$t0,lsr#26
116 eor $hi,$hi,$t1,lsr#23
121 eor $hi,$hi,$t0,lsr#20
126 eor $hi,$hi,$t1,lsr#1
[all...] |
| s390x-gf2m.pl | 56 ($lo,$hi,$b)=map("%r$_",(3..5)); $a=$lo; $mask=$a8;
109 srlg $hi,$lo,1
123 xgr $hi,@T[0]
126 xgr $hi,@T[1]
141 xgr $hi,@T[1]
150 xgr $hi,@T[1]
156 xgr $hi,@T[0]
176 stmg $lo,$hi,16($rp)
181 stmg $lo,$hi,0($rp)
190 xgr $lo,$hi
[all...] |
| /libcore/luni/src/main/java/java/io/ |
| StreamTokenizer.java | 499 * Specifies that the characters in the range from {@code low} to {@code hi}
506 * @param hi
509 public void ordinaryChars(int low, int hi) {
513 if (hi > tokenTypes.length) {
514 hi = tokenTypes.length - 1;
516 for (int i = low; i <= hi; i++) {
634 * Specifies that the characters in the range from {@code low} to {@code hi}
639 * @param hi
642 public void whitespaceChars(int low, int hi) {
646 if (hi > tokenTypes.length)
[all...] |
| /external/compiler-rt/lib/ppc/ |
| gcc_qadd.c | 18 register double A = dst.s.hi, a = dst.s.lo,
19 B = src.s.hi, b = src.s.lo;
23 dst.s.hi = A + B;
33 dst.s.hi = A + B;
43 dst.s.hi = testForOverflow;
72 dst.s.hi = Y = W + w;
|
| gcc_qsub.c | 18 register double A = dst.s.hi, a = dst.s.lo,
19 B = -src.s.hi, b = -src.s.lo;
23 dst.s.hi = A + B;
33 dst.s.hi = A + B;
43 dst.s.hi = testForOverflow;
72 dst.s.hi = Y = W + w;
|
| floatditf.c | 31 result.s.hi = high_addend + low.d;
32 result.s.lo = (high_addend - result.s.hi) + low.d;
|
| floatunditf.c | 36 result.s.hi = high_addend + low.d;
37 result.s.lo = (high_addend - result.s.hi) + low.d;
|
| fixunstfdi.c | 13 const doublebits hibits = { .d = x.s.hi };
22 uint64_t result = hibits.x & UINT64_C(0x000fffffffffffff); /* mantissa(hi) */
23 result |= UINT64_C(0x0010000000000000); /* matissa(hi) with implicit bit */
24 result <<= 11; /* mantissa(hi) left aligned in the int64 field. */
55 if (1.0 > x.s.hi)
|
| /external/oprofile/libpp/ |
| symbol.cpp | 35 bool has_sample_counts(count_array_t const & counts, size_t lo, size_t hi)
37 for (size_t i = lo; i <= hi; ++i)
|
| /external/clang/test/CXX/dcl.dcl/ |
| p4-0x.cpp | 21 static_assert(false, L"\x14hi" "!" R"x(")x"); // expected-error {{static_assert failed L"\024hi!\""}}
|
| /external/icu4c/common/ |
| bmpset.h | 82 * hi=findCodePoint(end)
83 * with 0<=lo<=hi<len.
84 * findCodePoint(c) defaults to lo=0 and hi=len-1.
88 * @param hi The highest 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 {
156 return (UBool)(findCodePoint(c, lo, hi) & 1);
|
| /external/regex-re2/re2/ |
| unicode_casefold.h | 55 uint32 hi; member in struct:re2::CaseFold
|
| /external/libsepol/tests/ |
| test-downgrade.c | 34 #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);
|
| /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;
135 hi = x - t*ln2HI[0]; /* t*ln2HI is exact here */
138 STRICT_ASSIGN(double, x, hi - lo);
153 else y = one-((lo-(x*c)/(2.0-c))-hi);
|
| e_expf.c | 47 float y,hi=0.0,lo=0.0,c,t,twopk; local
68 hi = x-ln2HI[xsb]; lo=ln2LO[xsb]; k = 1-xsb-xsb;
72 hi = x - t*ln2HI[0]; /* t*ln2HI is exact here */
75 STRICT_ASSIGN(float, x, hi - lo);
90 else y = one-((lo-(x*c)/((float)2.0-c))-hi);
|
| s_expm1.c | 134 double y,hi,lo,c,t,e,hxs,hfx,r1,twopk; local
164 {hi = x - ln2_hi; lo = ln2_lo; k = 1;}
166 {hi = x + ln2_hi; lo = -ln2_lo; k = -1;}
170 hi = x - t*ln2_hi; /* t*ln2_hi is exact here */
173 STRICT_ASSIGN(double, x, hi - lo);
174 c = (hi-x)-lo;
|
| s_expm1f.c | 43 float y,hi,lo,c,t,e,hxs,hfx,r1,twopk; local
70 {hi = x - ln2_hi; lo = ln2_lo; k = 1;}
72 {hi = x + ln2_hi; lo = -ln2_lo; k = -1;}
76 hi = x - t*ln2_hi; /* t*ln2_hi is exact here */
79 STRICT_ASSIGN(float, x, hi - lo);
80 c = (hi-x)-lo;
|
| /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;
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);
|
| 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;}
171 hi = x - t*ln2_hi; /* t*ln2_hi is exact here */
174 x = hi - lo;
175 c = (hi-x)-lo;
|
| /ndk/sources/host-tools/sed-4.2.1/testsuite/ |
| runtests.c | 129 int hi;
133 hi = (sizeof (the_tests) / sizeof (the_tests[0])) - 1;
138 hi = lo + 1;
141 hi = atoi (argv[2]);
144 for (x = lo; x < hi; ++x)
125 int hi; local
|
| /external/freetype/src/base/ |
| ftcalc.c | 56 FT_UInt32 hi; member in struct:FT_Int64_
261 FT_UInt32 lo1, hi1, lo2, hi2, lo, hi, i1, i2; local
270 hi = hi1 * hi2;
274 hi += (FT_UInt32)( i1 < i2 ) << 16;
276 hi += i1 >> 16;
281 hi += ( lo < i1 );
284 z->hi = hi;
289 ft_div64by32( FT_UInt32 hi,
298 r = hi;
327 register FT_UInt32 lo, hi; local
[all...] |
| /external/skia/legacy/src/core/ |
| SkTSearch.cpp | 28 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/jmonkeyengine/engine/src/core/com/jme3/util/ |
| SortUtil.java | 208 int lo = lo0 - 1, hi = hi0 + 1; local
218 while (comp.compare(mid, a[--hi]) < 0);
221 if (hi > lo) {
223 a[lo] = a[hi];
224 a[hi] = t;
238 if (hi + 1 < hi0) {
239 qsort(a, hi + 1, hi0, comp);
265 int lo = lo0 - 1, hi = hi0 + 1; local
275 while (comp.compare(mid, a[--hi]) < 0);
278 if (hi > lo)
[all...] |
| /external/tremolo/Tremolo/ |
| asm_arm.h | 44 int lo,hi; local
46 : "=&r"(lo),"=&r"(hi)
49 return(hi);
57 int lo,hi; local
61 : "=&r"(lo),"=&r"(hi)
64 return(hi);
|
| /frameworks/av/media/libstagefright/codecs/amrwbenc/src/ |
| isp_az.c | 46 Word16 hi, lo; local
91 hi = f1[i] >> 16;
94 t0 = Mpy_32_16(hi, lo, isp[m - 1]);
99 hi = f2[i] >> 16;
101 t0 = Mpy_32_16(hi, lo, isp[m - 1]);
155 hi = f1[nc] >> 16;
157 t0 = Mpy_32_16(hi, lo, isp[m - 1]);
188 Word16 hi, lo; local
202 hi = f[-1]>>16;
205 t0 = Mpy_32_16(hi, lo, *isp); /* t0 = f[-1] * isp *
219 Word16 hi, lo; local
[all...] |
