Searched refs:lo (Results 1 - 25 of 323) sorted by relevance

1234567891011>>

/external/regex-re2/util/
H A Drandom.cc15 uint32 lo = A * (int32)(seed_ & 0xFFFF); local
17 lo += (hi & 0x7FFF) << 16;
18 if (lo > M) {
19 lo &= M;
20 ++lo;
22 lo += hi >> 15;
23 if (lo > M) {
24 lo &= M;
25 ++lo;
27 return (seed_ = (int32) lo);
[all...]
H A Dbenchmark.h13 int lo; 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/compiler-rt/test/Unit/ppc/
H A DDD.h10 double lo; member in struct:__anon4929::__anon4930
H A Dfloatditf_test.c17 expected.lo = tests[i].lo;
20 if ((computed.hi != expected.hi) || (computed.lo != expected.lo))
23 printf("\tExpected %La = ( %a , %a )\n", expected.ld, expected.hi, expected.lo);
24 printf("\tComputed %La = ( %a , %a )\n", computed.ld, computed.hi, computed.lo);
H A Dfloatunditf_test.c17 expected.lo = tests[i].lo;
20 if ((computed.hi != expected.hi) || (computed.lo != expected.lo))
23 printf("\tExpected %La = ( %a , %a )\n", expected.ld, expected.hi, expected.lo);
24 printf("\tComputed %La = ( %a , %a )\n", computed.ld, computed.hi, computed.lo);
/external/skia/third_party/glu/libtess/
H A Dtessmono.c81 GLUhalfEdge *up, *lo; local
95 lo = up->Lprev;
97 while( up->Lnext != lo ) {
98 if( VertLeq( up->Dst, lo->Org )) {
99 /* up->Dst is on the left. It is safe to form triangles from lo->Org.
103 while( lo->Lnext != up && (EdgeGoesLeft( lo->Lnext )
104 || EdgeSign( lo->Org, lo->Dst, lo
[all...]
/external/regex-re2/re2/
H A Dunicode_groups.h27 uint16 lo; member in struct:re2::URange16
33 uint32 lo; member in struct:re2::URange32
/external/skia/src/core/
H A DSk64.cpp13 #define shift_left(hi, lo) \
14 hi = (hi << 1) | (lo >> 31); \
15 lo <<= 1
17 #define shift_left_bits(hi, lo, bits) \
19 hi = (hi << (bits)) | (lo >> (32 - (bits))); \
20 lo <<= (bits)
27 uint32_t lo = fLo; local
32 hi = -hi - Sk32ToBool(lo);
33 lo = 0 - lo;
109 uint32_t lo = fLo; local
140 round_right_16(int32_t hi, uint32_t lo) argument
206 uint32_t lo = fLo; local
289 uint32_t lo = fLo; local
[all...]
H A DSkBitmapProcState_filter.h104 uint32_t lo = (a00 & mask) * scale; local
108 lo += (a01 & mask) * scale;
112 lo += (a10 & mask) * scale;
115 lo += (a11 & mask) * xy;
118 *dstColor = ((lo >> 8) & mask) | (hi & ~mask);
134 uint32_t lo = (a00 & mask) * scale; local
138 lo += (a01 & mask) * scale;
142 lo += (a10 & mask) * scale;
145 lo += (a11 & mask) * xy;
148 lo
[all...]
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/skia/include/core/
H A DSkTSearch.h24 int lo = 0; local
27 while (lo < hi)
29 int mid = (hi + lo) >> 1;
33 lo = mid + 1;
59 int lo = 0; local
62 while (lo < hi) {
63 int mid = (hi + lo) >> 1;
67 lo = mid + 1;
92 int lo = 0; local
95 while (lo < h
[all...]
H A DSk64.h97 void set(int32_t hi, uint32_t lo) { fHi = hi; fLo = lo; } argument
130 void add(int32_t lo) { argument
131 int32_t hi = lo >> 31; // 0 or -1
132 uint32_t sum = fLo + (uint32_t)lo;
139 void add(int32_t hi, uint32_t lo) { argument
140 uint32_t sum = fLo + lo;
176 /** return (this + Sk64(hi, lo) >> 16) as a 32bit result */
177 SkFixed addGetFixed(int32_t hi, uint32_t lo) const {
180 tmp.add(hi, lo);
[all...]
/external/compiler-rt/lib/
H A Dfp_lib.h42 static inline void wideMultiply(rep_t a, rep_t b, rep_t *hi, rep_t *lo) { argument
45 *lo = product;
73 static inline void wideMultiply(rep_t a, rep_t b, rep_t *hi, rep_t *lo) { argument
79 // Sum terms that contribute to lo in a way that allows us to get the carry
82 *lo = r0 + (r1 << 32);
83 // Sum terms contributing to hi with the carry from lo
122 static inline void wideLeftShift(rep_t *hi, rep_t *lo, int count) { argument
123 *hi = *hi << count | *lo >> (typeWidth - count);
124 *lo = *lo << coun
127 wideRightShiftWithSticky(rep_t *hi, rep_t *lo, unsigned int count) argument
[all...]
/external/openssl/crypto/bn/asm/
H A Ds390x-gf2m.pl56 ($lo,$hi,$b)=map("%r$_",(3..5)); $a=$lo; $mask=$a8;
69 srag $lo,$a1,63 # broadcast 63rd bit
75 ngr $lo,$b
109 srlg $hi,$lo,1
111 sllg $lo,$lo,63
125 xgr $lo,$a1
127 xgr $lo,$a2
129 xg $lo,
[all...]
H A Darmv4-gf2m.pl73 ($hi,$lo,$t0,$t1, $i0,$i1 )=map("r$_",(4..9),12);
100 ldr $lo,[sp,$i0] @ tab[b & 0x7]
105 eor $lo,$lo,$t1,lsl#3 @ stall
110 eor $lo,$lo,$t0,lsl#6
115 eor $lo,$lo,$t1,lsl#9
120 eor $lo,$lo,
[all...]
/external/srec/srec/cfront/
H A Dhimul32.h103 asr_int32_t lo;
127 asr_uint32_t hi, lo, mid;
146 lo = xlo * ylo;
157 // Now add the low part of mid to the high part of lo, and the
159 // xxxxxxxx xxxxxxxx lo
163 // xxxxxxxx xxxxxxxx lo
165 // Note that folding mid into lo can cause a carry. An old trick
171 oldlo = lo;
172 lo += mid << 16;
173 carry = lo < oldl
[all...]
/external/compiler-rt/lib/ppc/
H A Dgcc_qdiv.c17 register double x = dst.s.hi, x1 = dst.s.lo,
18 y = src.s.hi, y1 = src.s.lo;
28 dst.s.lo = 0.0;
35 dst.s.lo = 0.0;
51 dst.s.lo = (q - x) + tmp;
H A Dgcc_qmul.c17 register double A = dst.s.hi, a = dst.s.lo,
18 B = src.s.hi, b = src.s.lo;
28 dst.s.lo = 0.0;
35 dst.s.lo = 0.0;
49 dst.s.lo = (ab - tau) + tmp;
H A Dgcc_qadd.c18 register double A = dst.s.hi, a = dst.s.lo,
19 B = src.s.hi, b = src.s.lo;
24 dst.s.lo = 0.0;
34 dst.s.lo = 0.0;
44 dst.s.lo = 0.0;
73 dst.s.lo = (W - Y) + w;
H A Dgcc_qsub.c18 register double A = dst.s.hi, a = dst.s.lo,
19 B = -src.s.hi, b = -src.s.lo;
24 dst.s.lo = 0.0;
34 dst.s.lo = 0.0;
44 dst.s.lo = 0.0;
73 dst.s.lo = (W - Y) + w;
/external/libsepol/tests/
H A Dtest-downgrade.c35 #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/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/freetype/src/base/
H A Dftcalc.c55 FT_UInt32 lo; member in struct:FT_Int64_
261 FT_UInt32 lo1, hi1, lo2, hi2, lo, hi, i1, i2; local
267 lo = lo1 * lo2;
279 /* Check carry overflow of i1 + lo */
280 lo += i1;
281 hi += ( lo < i1 );
283 z->lo = lo;
290 FT_UInt32 lo,
308 r |= lo >> 3
289 ft_div64by32( FT_UInt32 hi, FT_UInt32 lo, FT_UInt32 y ) argument
327 register FT_UInt32 lo, hi; local
[all...]
/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...]

Completed in 452 milliseconds

1234567891011>>