| /external/regex-re2/util/ |
| random.cc | 15 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...] |
| benchmark.h | 13 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; }
37 #define BENCHMARK_RANGE(f, lo, hi) \
39 (new ::testing::Benchmark(#f, f, lo, hi))
|
| /external/compiler-rt/test/Unit/ppc/ |
| DD.h | 10 double lo; member in struct:__anon5950::__anon5951
|
| floatditf_test.c | 17 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);
|
| floatunditf_test.c | 17 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);
|
| /frameworks/compile/libbcc/runtime/test/Unit/ppc/ |
| DD.h | 10 double lo; member in struct:__anon17110::__anon17111
|
| floatditf_test.c | 17 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);
|
| floatunditf_test.c | 17 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/ |
| tessmono.c | 81 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->Lnext->Dst ) <= 0 ))
[all...] |
| /frameworks/base/libs/androidfw/ |
| AssetDir.cpp | 42 int lo, hi, cur;
44 lo = 0;
46 while (lo <= hi) {
49 cur = (hi + lo) / 2;
56 lo = cur + 1;
|
| /frameworks/av/media/libstagefright/codecs/amrwbenc/inc/ |
| oper_32b.h | 24 void VO_L_Extract (Word32 L_32, Word16 *hi, Word16 *lo);
25 Word32 L_Comp (Word16 hi, Word16 lo);
27 Word32 Mpy_32_16 (Word16 hi, Word16 lo, Word16 n);
|
| /frameworks/av/media/libstagefright/codecs/amrnb/common/include/ |
| l_comp.h | 104 Word32 L_Comp(Word16 hi, Word16 lo, Flag *pOverflow);
|
| /external/bluetooth/glib/glib/ |
| gqsort.c | 65 char *lo; member in struct:__anon2487
75 #define PUSH(low, high) ((void) ((top->lo = (low)), (top->hi = (high)), ++top))
76 #define POP(low, high) ((void) (--top, (low = top->lo), (high = top->hi)))
137 char *lo = base_ptr; local
138 char *hi = &lo[size * (total_elems - 1)];
149 /* Select median value from among LO, MID, and HI. Rearrange
150 LO and HI so the three values are sorted. This lowers the
155 char *mid = lo + size * ((hi - lo) / size >> 1);
157 if ((*compare_func) ((void *) mid, (void *) lo, user_data) < 0
275 char *hi, *lo; local
[all...] |
| /frameworks/av/media/libstagefright/codecs/amrwbenc/src/ |
| oper_32b.c | 26 * L_32 = hi<<16 + lo<<1 *
29 * hi and lo are 16 bit signed integers. *
53 * lo : (L_32 - hi<<16)>>1 *
57 __inline void VO_L_Extract (Word32 L_32, Word16 *hi, Word16 *lo)
60 *lo = (Word16)((L_32 & 0xffff) >> 1);
70 * L_32 = hi<<16 + lo<<1 *
75 * lo lsf (with sign) *
85 Word32 L_Comp (Word16 hi, Word16 lo)
91 return (L_mac (L_32, lo, 1)); /* = hi<<16 + lo<<1 *
197 Word16 approx, hi, lo, n_hi, n_lo; local
[all...] |
| /external/regex-re2/re2/ |
| unicode_groups.h | 27 uint16 lo; member in struct:re2::URange16
33 uint32 lo; member in struct:re2::URange32
|
| /external/skia/src/core/ |
| Sk64.cpp | 13 #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
206 uint32_t lo = fLo; local
289 uint32_t lo = fLo; local
[all...] |
| SkBitmapProcState_filter.h | 104 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 = ((lo >> 8) & mask) * alphaScale
[all...] |
| SkFilterProc.cpp | 54 #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, hi)
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...] |
| /frameworks/av/media/libstagefright/codecs/amrnb/enc/src/ |
| l_comp.cpp | 36 lo = 16 bit signed integer (Word16) whose value falls in
37 the range : 0x8000 <= lo <= 0x7fff.
41 L_out = 32-bit result of (hi<<16 + lo<<1).
56 format (DPF) numbers hi and lo by the following operation:
58 2. Shift lo left by 1.
142 Word32 L_Comp(Word16 hi, Word16 lo, Flag *pOverflow)
156 temp32 = L_mac(L_32, lo, 1, pOverflow);
161 return (temp32); /* = hi<<16 + lo<<1 */
|
| /frameworks/av/media/libstagefright/codecs/amrnb/common/src/ |
| div_32.cpp | 96 0 < lo < 0x7fff
176 Word16 lo; local
192 lo = (result >> 1) - (hi << 15);
194 result = Mpy_32_16(hi, lo, approx, pOverflow);
199 lo = (result >> 1) - (hi << 15);
204 result = Mpy_32(n_hi, n_lo, hi, lo, pOverflow);
|
| /external/skia/include/core/ |
| SkTSearch.h | 24 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 < hi
[all...] |
| /external/compiler-rt/lib/ |
| fp_lib.h | 42 static inline void wideMultiply(rep_t a, rep_t b, rep_t *hi, rep_t *lo) {
45 *lo = product;
73 static inline void wideMultiply(rep_t a, rep_t b, rep_t *hi, rep_t *lo) {
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) {
123 *hi = *hi << count | *lo >> (typeWidth - count);
124 *lo = *lo << count
[all...] |
| /external/openssl/crypto/bn/asm/ |
| s390x-gf2m.pl | 56 ($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,$stdframe(@i[0],$sp
[all...] |
| armv4-gf2m.pl | 73 ($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,$t0,lsl#1
[all...] |
| /external/srec/srec/cfront/ |
| himul32.h | 103 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 < oldlo
[all...] |
