| /external/valgrind/main/memcheck/tests/ppc32/ |
| power_ISA2_05.c | 46 unsigned int hi; member in struct:__anon17253
56 printf("lfiwax (%f) => FRT=(%x, %x)\n", foo, ip->hi, ip->lo);
71 double hi; member in struct:__anon17254
82 dbl_pair[i].hi = -1024.0 + i;
90 dbl_pair[0].hi, dbl_pair[0].lo, FRT1, FRT2);
99 FRT1, FRT2, dbl_pair[1].hi, dbl_pair[1].lo);
111 dbl_pair[1].hi, dbl_pair[1].lo, FRT1, FRT2);
123 FRT1, FRT2, dbl_pair[2].hi, dbl_pair[2].lo);
|
| /external/valgrind/main/memcheck/tests/ppc64/ |
| power_ISA2_05.c | 45 unsigned int hi; member in struct:__anon17255
55 printf("lfiwax (%f) => FRT=(%x, %x)\n", foo, ip->hi, ip->lo);
70 double hi; member in struct:__anon17256
81 dbl_pair[i].hi = -1024.0 + i;
89 dbl_pair[0].hi, dbl_pair[0].lo, FRT1, FRT2);
98 FRT1, FRT2, dbl_pair[1].hi, dbl_pair[1].lo);
110 dbl_pair[1].hi, dbl_pair[1].lo, FRT1, FRT2);
122 FRT1, FRT2, dbl_pair[2].hi, dbl_pair[2].lo);
|
| /external/regex-re2/re2/ |
| compile.cc | 173 // Returns a fragment matching the byte range lo-hi.
174 Frag ByteRange(int lo, int hi, bool foldcase);
192 // Adds a fragment matching the rune range lo-hi.
193 void AddRuneRange(Rune lo, Rune hi, bool foldcase);
194 void AddRuneRangeLatin1(Rune lo, Rune hi, bool foldcase);
195 void AddRuneRangeUTF8(Rune lo, Rune hi, bool foldcase);
198 // New suffix that matches the byte range lo-hi, then goes to next.
199 int RuneByteSuffix(uint8 lo, uint8 hi, bool foldcase, int next);
200 int UncachedRuneByteSuffix(uint8 lo, uint8 hi, bool foldcase, int next);
391 // Returns a fragment for the byte range lo-hi
570 int hi; member in struct:re2::ByteRangeProg
[all...] |
| /bionic/libc/kernel/arch-mips/asm/ |
| ptrace.h | 40 unsigned long hi; member in struct:pt_regs
|
| /development/ndk/platforms/android-9/arch-mips/include/asm/ |
| ptrace.h | 40 unsigned long hi; member in struct:pt_regs
|
| /external/compiler-rt/lib/ppc/ |
| fixtfdi.c | 15 const doublebits hibits = { .d = x.s.hi };
26 int64_t result = hibits.x & INT64_C(0x000fffffffffffff); /* mantissa(hi) */
27 result |= INT64_C(0x0010000000000000); /* matissa(hi) with implicit bit */
28 result <<= 10; /* mantissa(hi) with one zero preceeding bit. */
68 if (1.0 > crt_fabs(x.s.hi))
72 if (x.s.hi == -0x1.0p63) {
100 if (x.s.hi > 0.0)
|
| /frameworks/av/media/libstagefright/codecs/amrnb/common/src/ |
| lsp_az.cpp | 199 Word16 i, j, hi, lo;
215 L_Extract (f[-1], &hi, &lo);
216 t0 = Mpy_32_16 (hi, lo, *lsp); // t0 = f[-1] * lsp
260 Word16 hi; local
276 hi = (Word16)(*(f - 1) >> 16);
278 lo = (Word16)((*(f - 1) >> 1) - ((Word32) hi << 15));
280 t0 = ((Word32)hi * *lsp);
|
| /prebuilts/ndk/8/platforms/android-14/arch-mips/usr/include/asm/ |
| ptrace.h | 40 unsigned long hi; member in struct:pt_regs
|
| /prebuilts/ndk/8/platforms/android-9/arch-mips/usr/include/asm/ |
| ptrace.h | 40 unsigned long hi; member in struct:pt_regs
|
| /frameworks/av/media/libstagefright/codecs/aacenc/basic_op/ |
| oper_32b.h | 35 void L_Extract (Word32 L_32, Word16 *hi, Word16 *lo);
36 Word32 L_Comp (Word16 hi, Word16 lo);
38 Word32 Mpy_32_16 (Word16 hi, Word16 lo, Word16 n);
|
| /external/openssl/crypto/bn/asm/ |
| x86-gf2m.pl | 122 ($lo,$hi)=("eax","edx");
150 &mov ($hi,$lo);
153 &shr ($hi,1);
165 &xor ($hi,@T[0]);
179 &xor ($hi,@T[0]);
191 &xor ($hi,@T[0]);
194 &xor ($hi,@i[0]);
271 &mov (&DWP(12,"esp"),$hi);
277 &mov (&DWP(4,"esp"),$hi);
292 &xor ($lo,$hi);
[all...] |
| x86_64-gf2m.pl | 36 ($lo,$hi)=("%rax","%rdx"); $a=$lo;
62 mov $a,$hi # $a is $lo
65 shr \$1,$hi
73 xor $t1,$hi
76 xor $t0,$hi
135 xor $t0,$hi
149 xor $t0,$hi
152 xor $i1,$hi
229 mov $hi,24(%rsp)
235 mov $hi,8(%rsp
[all...] |
| /external/openssl/crypto/modes/ |
| modes_lcl.h | 49 # define BSWAP8(x) ({ u32 lo=(u64)(x)>>32,hi=(x); \
51 : "+r"(hi),"+r"(lo)); \
52 (u64)hi<<32|lo; })
57 # define BSWAP8(x) ({ u32 lo=(u64)(x)>>32,hi=(x); \
59 : "+r"(hi),"+r"(lo)); \
60 (u64)hi<<32|lo; })
91 typedef struct { u64 hi,lo; } u128; member in struct:__anon12652
|
| gcm128.c | 75 V.lo = (V.hi<<63)|(V.lo>>1); \
76 V.hi = (V.hi>>1 )^T; \
80 V.lo = (V.hi<<63)|(V.lo>>1); \
81 V.hi = (V.hi>>1 )^((u64)T<<32); \
126 Htable[0].hi = 0;
128 V.hi = H[0];
137 u128 *Hi = Htable+i, H0 = *Hi;
[all...] |
| /frameworks/base/core/java/android/text/ |
| AndroidBidi.java | 164 for (int low = i, hi = e - 2; low < hi; low += 2, hi -= 2) {
165 int x = ld[low]; ld[low] = ld[hi]; ld[hi] = x;
166 x = ld[low+1]; ld[low+1] = ld[hi+1]; ld[hi+1] = x;
|
| /external/openssl/crypto/modes/asm/ |
| ghash-ia64.pl | 58 { .mfi; (p18) ld8 Hlo=[Hi[1]],-8
62 { .mfi; (p18) ld8 Hhi=[Hi[1]]
65 (p18) and Hi[1]=mask0xf0,xi[2] };;
70 (p18) add Hi[1]=Htbl,Hi[1] };;
72 { .mfi; (p18) ld8 Hlo=[Hi[1]],-8
74 { .mfi; (p17) shladd Hi[0]=xi[1],4,r0
76 { .mfi; (p18) ld8 Hhi=[Hi[1]]
79 (p17) and Hi[0]=mask0xf0,Hi[0] };
[all...] |
| /external/bzip2/ |
| blocksort.c | 35 Int32 hi )
40 if (lo == hi) return;
42 if (hi - lo > 3) {
43 for ( i = hi-4; i >= lo; i-- ) {
46 for ( j = i+4; j <= hi && ec_tmp > eclass[fmap[j]]; j += 4 )
52 for ( i = hi-1; i >= lo; i-- ) {
55 for ( j = i+1; j <= hi && ec_tmp > eclass[fmap[j]]; j++ )
99 Int32 sp, lo, hi; local
113 fpop ( lo, hi );
114 if (hi - lo < FALLBACK_QSORT_SMALL_THRESH)
631 Int32 sp, lo, hi, d; local
891 Int32 hi = (ftab[sb+1] & CLEARMASK) - 1; local
[all...] |
| /external/elfutils/tests/ |
| dwflmodtest.c | 83 Dwarf_Addr lo = -1, hi = -1, entry = -1; local
88 if (dwarf_highpc (instance, &hi) == 0)
89 hi += info->dwbias;
103 if (lo != (Dwarf_Addr) -1 || hi != (Dwarf_Addr) -1)
104 printf (" %#" PRIx64 "..%#" PRIx64, lo, hi);
140 Dwarf_Addr lo = -1, hi = -1, entry = -1; local
145 if (dwarf_highpc (func, &hi) == 0)
146 hi += info->dwbias;
154 if (lo != (Dwarf_Addr) -1 || hi != (Dwarf_Addr) -1
157 lo, hi, entry)
[all...] |
| /external/regex-re2/re2/testing/ |
| charclass_test.cc | 15 Rune hi; member in struct:re2::CCTest::__anon14713
20 Rune hi; member in struct:re2::CCTest::__anon14714
93 printf(" %d-%d", t->add[k].lo, t->add[k].hi);
99 printf(" %d-%d", t->final[k].lo, t->final[k].hi);
105 printf(" %d-%d", it->lo, it->hi);
111 if (t->final[j].lo <= x && x <= t->final[j].hi)
143 it->hi != t->final[j].hi) {
147 size += it->hi - it->lo + 1;
201 ccb.AddRange(t->add[j].lo, t->add[j].hi);
[all...] |
| /frameworks/av/media/libstagefright/codecs/amrwb/src/ |
| isf_extrapolation.cpp | 123 int16 exp, exp2, hi, lo; local
164 int32_to_dpf(L_tmp, &hi, &lo);
165 L_tmp = mpy_dpf_32(hi, lo, hi, lo);
174 int32_to_dpf(L_tmp, &hi, &lo);
175 L_tmp = mpy_dpf_32(hi, lo, hi, lo);
184 int32_to_dpf(L_tmp, &hi, &lo);
185 L_tmp = mpy_dpf_32(hi, lo, hi, lo)
[all...] |
| /dalvik/vm/mterp/mips/ |
| OP_CMP_LONG.S | 3 %verify "hi equal, lo <=>"
4 %verify "lo equal, hi <=>"
12 * slt t0, x.hi, y.hi; # (x.hi < y.hi) ? 1:0
13 * sgt t1, x.hi, y.hi; # (y.hi > x.hi) ? 1:
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/util/ |
| Pack.java | 42 int hi = bigEndianToInt(bs, off); local
44 return ((long)(hi & 0xffffffffL) << 32) | (long)(lo & 0xffffffffL);
91 int hi = littleEndianToInt(bs, off + 4); local
92 return ((long)(hi & 0xffffffffL) << 32) | (long)(lo & 0xffffffffL);
|
| /frameworks/av/media/libeffects/testlibs/ |
| AudioCoefInterpolator.h | 91 // hi The second data point.
93 static audio_coef_t interp(audio_coef_t lo, audio_coef_t hi, uint32_t frac);
|
| /external/v8/src/arm/ |
| constants-arm.h | 130 hi = 8 << 28, // C set, Z clear Unsigned higher. enumerator in enum:v8::internal::Condition
157 return hi;
158 case hi:
544 inline int Bits(int hi, int lo) const {
545 return (InstructionBits() >> lo) & ((2 << (hi - lo)) - 1);
549 inline int BitField(int hi, int lo) const {
550 return InstructionBits() & (((2 << (hi - lo)) - 1) << lo);
561 static inline int Bits(Instr instr, int hi, int lo) {
562 return (instr >> lo) & ((2 << (hi - lo)) - 1);
567 static inline int BitField(Instr instr, int hi, int lo)
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| TimSort.java | 172 static <T> void sort(T[] a, int lo, int hi, Comparator<? super T> c) {
174 Arrays.sort(a, lo, hi);
178 Arrays.checkStartAndEnd(a.length, lo, hi);
179 int nRemaining = hi - lo;
185 int initRunLen = countRunAndMakeAscending(a, lo, hi, c);
186 binarySort(a, lo, hi, lo + initRunLen, c);
199 int runLen = countRunAndMakeAscending(a, lo, hi, c);
218 if (DEBUG) assert lo == hi; local
236 * @param hi the index after the last element in the range to be sorted
238 * not already known to be sorted (@code lo <= start <= hi}
[all...] |
