| /frameworks/base/libs/utils/ |
| AssetDir.cpp | 42 int lo, hi, cur;
44 lo = 0;
46 while (lo <= hi) {
49 cur = (hi + lo) / 2;
56 lo = cur + 1;
|
| /external/opencore/codecs_v2/audio/gsm_amr/amr_nb/common/include/ |
| l_comp.h | 104 Word32 L_Comp(Word16 hi, Word16 lo, Flag *pOverflow);
|
| /frameworks/base/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:__anon1325
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...] |
| /external/opencore/codecs_v2/audio/gsm_amr/amr_nb/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 */
|
| /external/skia/src/core/ |
| Sk64.cpp | 20 #define shift_left(hi, lo) \
21 hi = (hi << 1) | (lo >> 31); \
22 lo <<= 1
24 #define shift_left_bits(hi, lo, bits) \
26 hi = (hi << (bits)) | (lo >> (32 - (bits))); \
27 lo <<= (bits)
34 uint32_t lo = fLo; local
39 hi = -hi - Sk32ToBool(lo);
40 lo = 0 - lo;
116 uint32_t lo = fLo; local
213 uint32_t lo = fLo; local
296 uint32_t lo = fLo; local
[all...] |
| SkFilterProc.cpp | 62 #define COMBINE(lo, hi) (((lo) & ~0xFF00) | (((hi) & ~0xFF00) << 8))
70 uint32_t lo = (3 * LO_PAIR(c00) + LO_PAIR(c01)) >> 2; local
72 return COMBINE(lo, hi);
75 uint32_t lo = (LO_PAIR(c00) + LO_PAIR(c01)) >> 1; local
77 return COMBINE(lo, hi);
80 uint32_t lo = (LO_PAIR(c00) + 3 * LO_PAIR(c01)) >> 2; local
82 return COMBINE(lo, hi);
86 uint32_t lo = (3 * LO_PAIR(c00) + LO_PAIR(c10)) >> 2; local
88 return COMBINE(lo, hi)
91 uint32_t lo = (9 * LO_PAIR(c00) + 3 * (LO_PAIR(c01) + LO_PAIR(c10)) + LO_PAIR(c11)) >> 4; local
96 uint32_t lo = (3 * (LO_PAIR(c00) + LO_PAIR(c01)) + LO_PAIR(c10) + LO_PAIR(c11)) >> 3; local
101 uint32_t lo = (9 * LO_PAIR(c01) + 3 * (LO_PAIR(c00) + LO_PAIR(c11)) + LO_PAIR(c10)) >> 4; local
107 uint32_t lo = (LO_PAIR(c00) + LO_PAIR(c10)) >> 1; local
112 uint32_t lo = (3 * (LO_PAIR(c00) + LO_PAIR(c10)) + LO_PAIR(c01) + LO_PAIR(c11)) >> 3; local
117 uint32_t lo = (LO_PAIR(c00) + LO_PAIR(c01) + LO_PAIR(c10) + LO_PAIR(c11)) >> 2; local
122 uint32_t lo = (3 * (LO_PAIR(c01) + LO_PAIR(c11)) + LO_PAIR(c00) + LO_PAIR(c10)) >> 3; local
128 uint32_t lo = (LO_PAIR(c00) + 3 * LO_PAIR(c10)) >> 2; local
133 uint32_t lo = (9 * LO_PAIR(c10) + 3 * (LO_PAIR(c00) + LO_PAIR(c11)) + LO_PAIR(c01)) >> 4; local
138 uint32_t lo = (3 * (LO_PAIR(c10) + LO_PAIR(c11)) + LO_PAIR(c00) + LO_PAIR(c01)) >> 3; local
143 uint32_t lo = (9 * LO_PAIR(c11) + 3 * (LO_PAIR(c01) + LO_PAIR(c10)) + LO_PAIR(c00)) >> 4; local
168 uint32_t lo = (3 * LO_PAIR(c00) + LO_PAIR(c01)) >> 2; local
175 uint32_t lo = (LO_PAIR(c00) + LO_PAIR(c01)) >> 1; local
182 uint32_t lo = (LO_PAIR(c00) + 3 * LO_PAIR(c01)) >> 2; local
190 uint32_t lo = (3 * LO_PAIR(c00) + LO_PAIR(c10)) >> 2; local
199 uint32_t lo = (9 * LO_PAIR(c00) + 3 * (LO_PAIR(c01) + LO_PAIR(c10)) + LO_PAIR(c11)) >> 4; local
208 uint32_t lo = (3 * (LO_PAIR(c00) + LO_PAIR(c01)) + LO_PAIR(c10) + LO_PAIR(c11)) >> 3; local
217 uint32_t lo = (9 * LO_PAIR(c01) + 3 * (LO_PAIR(c00) + LO_PAIR(c11)) + LO_PAIR(c10)) >> 4; local
225 uint32_t lo = (LO_PAIR(c00) + LO_PAIR(c10)) >> 1; local
234 uint32_t lo = (3 * (LO_PAIR(c00) + LO_PAIR(c10)) + LO_PAIR(c01) + LO_PAIR(c11)) >> 3; local
243 uint32_t lo = (LO_PAIR(c00) + LO_PAIR(c01) + LO_PAIR(c10) + LO_PAIR(c11)) >> 2; local
252 uint32_t lo = (3 * (LO_PAIR(c01) + LO_PAIR(c11)) + LO_PAIR(c00) + LO_PAIR(c10)) >> 3; local
260 uint32_t lo = (LO_PAIR(c00) + 3 * LO_PAIR(c10)) >> 2; local
269 uint32_t lo = (9 * LO_PAIR(c10) + 3 * (LO_PAIR(c00) + LO_PAIR(c11)) + LO_PAIR(c01)) >> 4; local
278 uint32_t lo = (3 * (LO_PAIR(c10) + LO_PAIR(c11)) + LO_PAIR(c00) + LO_PAIR(c01)) >> 3; local
287 uint32_t lo = (9 * LO_PAIR(c11) + 3 * (LO_PAIR(c01) + LO_PAIR(c10)) + LO_PAIR(c00)) >> 4; local
[all...] |
| SkBitmapProcState_filter.h | 117 uint32_t lo = (a00 & mask) * scale; local
121 lo += (a01 & mask) * scale;
125 lo += (a10 & mask) * scale;
128 lo += (a11 & mask) * xy;
131 *dstColor = ((lo >> 8) & mask) | (hi & ~mask);
147 uint32_t lo = (a00 & mask) * scale; local
151 lo += (a01 & mask) * scale;
155 lo += (a10 & mask) * scale;
158 lo += (a11 & mask) * xy;
161 lo = ((lo >> 8) & mask) * alphaScale
[all...] |
| /frameworks/base/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 */
|
| /external/opencore/codecs_v2/audio/gsm_amr/amr_nb/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);
|
| /frameworks/base/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 | 31 int lo = 0; local
34 while (lo < hi)
36 int mid = (hi + lo) >> 1;
40 lo = mid + 1;
66 int lo = 0; local
69 while (lo < hi) {
70 int mid = (hi + lo) >> 1;
74 lo = mid + 1;
99 int lo = 0; local
102 while (lo < hi
[all...] |
| Sk64.h | 105 void set(int32_t hi, uint32_t lo) { fHi = hi; fLo = lo; }
138 void add(int32_t lo) {
139 int32_t hi = lo >> 31; // 0 or -1
140 uint32_t sum = fLo + (uint32_t)lo;
147 void add(int32_t hi, uint32_t lo) {
148 uint32_t sum = fLo + lo;
184 /** return (this + Sk64(hi, lo) >> 16) as a 32bit result */
185 SkFixed addGetFixed(int32_t hi, uint32_t lo) const {
188 tmp.add(hi, lo);
[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...] |
| /external/opencore/codecs_v2/audio/gsm_amr/amr_wb/dec/src/ |
| deemphasis_32.cpp | 131 int16 lo, hi; local
142 lo = x_lo[1];
147 L_tmp += ((int32)lo) << 4;
152 lo = x_lo[i+1];
156 L_tmp += ((int32)lo) << 4;
|
| /frameworks/base/media/libstagefright/codecs/amrwb/src/ |
| deemphasis_32.cpp | 131 int16 lo, hi; local
142 lo = x_lo[1];
147 L_tmp += ((int32)lo) << 4;
152 lo = x_lo[i+1];
156 L_tmp += ((int32)lo) << 4;
|
| /bionic/libm/bsdsrc/ |
| b_exp.c | 94 double z,hi,lo,c;
107 /* express x-k*ln2 as hi-lo and let x=hi-lo rounded */
110 x=hi-(lo=k*ln2lo);
115 return scalb(1.0+(hi-(lo-(x*c)/(2.0-c))),k);
140 double z,hi,lo; local
152 /* express (x+c)-k*ln2 as hi-lo and let x=hi-lo rounded */
155 x= hi - (lo = k*ln2lo-c);
161 return scalb(1.+(hi-(lo - c)), k)
[all...] |
| /external/skia/src/animator/ |
| SkGetCondensedInfo.cpp | 31 int lo = 0; local
33 while (lo < hi) {
34 int mid = (hi + lo) >> 1;
36 lo = mid + 1;
47 int lo = 0; local
49 while (lo < hi) {
50 int mid = (hi + lo) >> 1;
52 lo = mid + 1;
|
| /external/freetype/src/base/ |
| ftcalc.c | 55 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 >> 31
327 register FT_UInt32 lo, hi; local
[all...] |
| /dalvik/libcore/xml/src/main/java/org/apache/xml/utils/ |
| NodeVector.java | 643 int lo = lo0; local
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 < hi
[all...] |
| /external/icu4c/common/ |
| bmpset.h | 81 * 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 {
156 return (UBool)(findCodePoint(c, lo, hi) & 1);
|
| /external/v8/src/ |
| v8.cc | 161 static uint32_t lo = 0; local
165 // avoid getting stuck with zero bits in hi or lo by re-initializing
168 if (lo == 0) lo = random();
172 lo = 18273 * (lo & 0xFFFF) + (lo >> 16);
173 return (hi << 16) + (lo & 0xFFFF);
|
| /bionic/libm/src/ |
| e_exp.c | 27 * Here r will be represented as r = hi-lo for better
105 double y,hi=0.0,lo=0.0,c,t; local
129 hi = x-ln2HI[xsb]; lo=ln2LO[xsb]; k = 1-xsb-xsb;
134 lo = t*ln2LO[0];
136 x = hi - lo;
147 else y = one-((lo-(x*c)/(2.0-c))-hi);
|
| e_expf.c | 44 float y,hi=0.0,lo=0.0,c,t; local
65 hi = x-ln2HI[xsb]; lo=ln2LO[xsb]; k = 1-xsb-xsb;
70 lo = t*ln2LO[0];
72 x = hi - lo;
83 else y = one-((lo-(x*c)/((float)2.0-c))-hi);
|
| /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;
135 lo = t*ln2LO[0];
137 x = hi - lo;
148 else y = one-((lo-(x*c)/(2.0-c))-hi);
|
