HomeSort by relevance Sort by last modified time
    Searched refs:hi (Results 1 - 25 of 481) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/compiler-rt/test/Unit/ppc/
DD.h 9 double hi; member in struct:__anon5950::__anon5951
floatditf_test.c 16 expected.hi = tests[i].hi;
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 16 expected.hi = tests[i].hi;
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 9 double hi; member in struct:__anon17110::__anon17111
floatditf_test.c 16 expected.hi = tests[i].hi;
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 16 expected.hi = tests[i].hi;
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/include/core/
SkTSearch.h 25 int hi = count - 1; local
27 while (lo < hi)
29 int mid = (hi + lo) >> 1;
35 hi = mid;
38 const T* elem = (const T*)((const char*)base + hi * elemSize);
42 hi += 1;
43 hi = ~hi;
45 return hi;
60 int hi = count - 1 local
93 int hi = count - 1; local
    [all...]
  /external/compiler-rt/lib/ppc/
multc3.c 9 (x).s.hi = crt_copysign(crt_isinf((x).s.hi) ? 1.0 : 0.0, (x).s.hi); \
14 if (crt_isnan((x).s.hi)) { \
15 (x).s.hi = crt_copysign(0.0, (x).s.hi); \
35 if (crt_isnan(real.s.hi) && crt_isnan(imag.s.hi))
44 if (crt_isinf(aDD.s.hi) || crt_isinf(bDD.s.hi))
    [all...]
divtc3.c 13 (x).s.hi = crt_copysign(crt_isinf((x).s.hi) ? 1.0 : 0.0, (x).s.hi); \
29 const double logbw = crt_logb(crt_fmax(crt_fabs(cDD.s.hi), crt_fabs(dDD.s.hi) ));
35 cDD.s.hi = crt_scalbn(cDD.s.hi, -ilogbw);
37 dDD.s.hi = crt_scalbn(dDD.s.hi, -ilogbw);
48 real.s.hi = crt_scalbn(real.s.hi, -ilogbw)
    [all...]
  /frameworks/compile/libbcc/runtime/lib/ppc/
multc3.c 13 (x).s.hi = __builtin_copysign(isinf((x).s.hi) ? 1.0 : 0.0, (x).s.hi); \
18 if (isnan((x).s.hi)) { \
19 (x).s.hi = __builtin_copysign(0.0, (x).s.hi); \
39 if (isnan(real.s.hi) && isnan(imag.s.hi))
48 if (isinf(aDD.s.hi) || isinf(bDD.s.hi))
    [all...]
divtc3.c 13 (x).s.hi = __builtin_copysign(isinf((x).s.hi) ? 1.0 : 0.0, (x).s.hi); \
29 const double logbw = logb(__builtin_fmax( __builtin_fabs(cDD.s.hi), __builtin_fabs(dDD.s.hi) ));
35 cDD.s.hi = scalbn(cDD.s.hi, -ilogbw);
37 dDD.s.hi = scalbn(dDD.s.hi, -ilogbw);
48 real.s.hi = scalbn(real.s.hi, -ilogbw)
    [all...]
  /external/elfutils/libelf/
dl-hash.h 77 unsigned int hi; local
79 hi = hash & 0xf0000000;
84 if (hi != 0)
85 hash ^= hi >> 24;
87 hash &= ~hi;
92 hash ^= hi;
93 hash ^= hi >> 24;
  /frameworks/base/libs/androidfw/
AssetDir.cpp 42 int lo, hi, cur;
45 hi = pVector->size() -1;
46 while (lo <= hi) {
49 cur = (hi + lo) / 2;
59 hi = cur -1;
  /frameworks/av/media/libstagefright/codecs/amrnb/common/src/
div_32.cpp 94 the range : 0x4000 < hi < 0x7fff
175 Word16 hi; local
191 hi = (Word16)(result >> 16);
192 lo = (result >> 1) - (hi << 15);
194 result = Mpy_32_16(hi, lo, approx, pOverflow);
198 hi = (Word16)(result >> 16);
199 lo = (result >> 1) - (hi << 15);
204 result = Mpy_32(n_hi, n_lo, hi, lo, pOverflow);
  /external/skia/src/core/
Sk64.cpp 13 #define shift_left(hi, lo) \
14 hi = (hi << 1) | (lo >> 31); \
17 #define shift_left_bits(hi, lo, bits) \
19 hi = (hi << (bits)) | (lo >> (32 - (bits))); \
26 int32_t hi = fHi; local
30 if (hi < 0)
32 hi = -hi - Sk32ToBool(lo)
108 int32_t hi = fHi; local
205 int32_t hi = fHi; local
288 uint32_t hi = fHi; local
    [all...]
  /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);
  /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. *
52 * hi : b16 to b31 of L_32 *
53 * lo : (L_32 - hi<<16)>>1 *
57 __inline void VO_L_Extract (Word32 L_32, Word16 *hi, Word16 *lo)
59 *hi = (Word16)(L_32 >> 16);
70 * L_32 = hi<<16 + lo<<1 *
74 * hi msb *
85 Word32 L_Comp (Word16 hi, Word16 lo)
89 L_32 = L_deposit_h (hi);
197 Word16 approx, hi, lo, n_hi, n_lo; local
    [all...]
  /external/regex-re2/re2/
unicode_groups.h 28 uint16 hi; member in struct:re2::URange16
34 uint32 hi; member in struct:re2::URange32
  /frameworks/av/media/libstagefright/codecs/amrnb/enc/src/
l_comp.cpp 34 hi = 16 bit signed integer (Word16) whose value falls in
35 the range : 0x8000 <= hi <= 0x7fff.
41 L_out = 32-bit result of (hi<<16 + lo<<1).
56 format (DPF) numbers hi and lo by the following operation:
57 1. Deposit hi into the 16 MS bits of the 32 bit output L_out.
142 Word32 L_Comp(Word16 hi, Word16 lo, Flag *pOverflow)
154 L_32 = L_deposit_h(hi);
161 return (temp32); /* = hi<<16 + lo<<1 */
  /external/bluetooth/glib/glib/
gqsort.c 66 char *hi; 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)))
138 char *hi = &lo[size * (total_elems - 1)]; local
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);
159 if ((*compare_func) ((void *) hi, (void *) mid, user_data) < 0)
160 SWAP (mid, hi, size);
168 right_ptr = hi - size
275 char *hi, *lo; local
    [all...]
  /external/regex-re2/util/
benchmark.h 14 int hi; 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))
random.cc 16 uint32 hi = A * (int32)((uint32)seed_ >> 16); local
17 lo += (hi & 0x7FFF) << 16;
22 lo += hi >> 15;
  /external/srec/srec/cfront/
himul32.h 104 asr_int32_t hi;
112 return result.pieces.hi;
127 asr_uint32_t hi, lo, mid;
154 hi = xhi * yhi;
158 // high part of mid to the low part of hi:
161 // xxxxxxxx xxxxxxxx hi
164 // xxxxxxxx xxxxxxxx hi
175 hi += carry + (mid >> 16);
184 hi = ~hi;
    [all...]
  /external/skia/src/animator/
SkGetCondensedInfo.cpp 24 int hi = count - 1; local
25 while (lo < hi) {
26 int mid = (hi + lo) >> 1;
30 hi = mid;
32 if (strcmp(&strings[lengths[hi << 2]], target) != 0)
34 return hi;
40 int hi = kTypeIDs - 1; local
41 while (lo < hi) {
42 int mid = (hi + lo) >> 1;
46 hi = mid
    [all...]

Completed in 888 milliseconds

1 2 3 4 5 6 7 8 91011>>