| /external/skia/include/core/ |
| D | SkTSearch.h | 32 int hi = count - 1; in SkTSearch() local
34 while (lo < hi) in SkTSearch()
36 int mid = (hi + lo) >> 1; in SkTSearch()
42 hi = mid; in SkTSearch()
45 const T* elem = (const T*)((const char*)base + hi * elemSize); in SkTSearch()
49 hi += 1; in SkTSearch()
50 hi = ~hi; in SkTSearch()
52 return hi; in SkTSearch()
67 int hi = count - 1; in SkTSearch() local
69 while (lo < hi) { in SkTSearch()
[all …]
|
| D | Sk64.h | 54 int32_t hi = fHi; in getFixed() local
56 hi += 1; in getFixed()
58 return (hi << 16) | (sum >> 16); in getFixed()
105 void set(int32_t hi, uint32_t lo) { fHi = hi; fLo = lo; } in set()
139 int32_t hi = lo >> 31; // 0 or -1 in add() local
142 fHi = fHi + hi + (sum < fLo); in add()
147 void add(int32_t hi, uint32_t lo) { in add()
150 fHi = fHi + hi + (sum < fLo); in add()
185 SkFixed addGetFixed(int32_t hi, uint32_t lo) const { in addGetFixed()
188 tmp.add(hi, lo); in addGetFixed()
[all …]
|
| /external/skia/src/core/ |
| D | Sk64.cpp | 20 #define shift_left(hi, lo) \ argument
21 hi = (hi << 1) | (lo >> 31); \
24 #define shift_left_bits(hi, lo, bits) \ argument
26 hi = (hi << (bits)) | (lo >> (32 - (bits))); \
33 int32_t hi = fHi; in getClzAbs() local
37 if (hi < 0) in getClzAbs()
39 hi = -hi - Sk32ToBool(lo); in getClzAbs()
42 return hi ? SkCLZ(hi) : SkCLZ(lo) + 32; in getClzAbs()
115 int32_t hi = fHi; in shiftToMake32() local
118 if (hi < 0) // make it positive in shiftToMake32()
[all …]
|
| D | SkFilterProc.cpp | 62 #define COMBINE(lo, hi) (((lo) & ~0xFF00) | (((hi) & ~0xFF00) << 8)) argument
71 uint32_t hi = (3 * HI_PAIR(c00) + HI_PAIR(c01)) >> 2; in bilerp4_01() local
72 return COMBINE(lo, hi); in bilerp4_01()
76 uint32_t hi = (HI_PAIR(c00) + HI_PAIR(c01)) >> 1; in bilerp4_02() local
77 return COMBINE(lo, hi); in bilerp4_02()
81 uint32_t hi = (HI_PAIR(c00) + 3 * HI_PAIR(c01)) >> 2; in bilerp4_03() local
82 return COMBINE(lo, hi); in bilerp4_03()
87 uint32_t hi = (3 * HI_PAIR(c00) + HI_PAIR(c10)) >> 2; in bilerp4_10() local
88 return COMBINE(lo, hi); in bilerp4_10()
92 uint32_t hi = (9 * HI_PAIR(c00) + 3 * (HI_PAIR(c01) + HI_PAIR(c10)) + HI_PAIR(c11)) >> 4; in bilerp4_11() local
[all …]
|
| D | SkBitmapProcState_filter.h | 118 uint32_t hi = ((a00 >> 8) & mask) * scale; in Filter_32_opaque_portable() local
122 hi += ((a01 >> 8) & mask) * scale; in Filter_32_opaque_portable()
126 hi += ((a10 >> 8) & mask) * scale; in Filter_32_opaque_portable()
129 hi += ((a11 >> 8) & mask) * xy; in Filter_32_opaque_portable()
131 *dstColor = ((lo >> 8) & mask) | (hi & ~mask); in Filter_32_opaque_portable()
148 uint32_t hi = ((a00 >> 8) & mask) * scale; in Filter_32_alpha_portable() local
152 hi += ((a01 >> 8) & mask) * scale; in Filter_32_alpha_portable()
156 hi += ((a10 >> 8) & mask) * scale; in Filter_32_alpha_portable()
159 hi += ((a11 >> 8) & mask) * xy; in Filter_32_alpha_portable()
162 hi = ((hi >> 8) & mask) * alphaScale; in Filter_32_alpha_portable()
[all …]
|
| D | SkTSearch.cpp | 36 int hi = count - 1; in SkStrSearch() local
38 while (lo < hi) in SkStrSearch()
40 int mid = (hi + lo) >> 1; in SkStrSearch()
47 hi = mid; in SkStrSearch()
52 const char* elem = index_into_base(base, hi, elemSize); in SkStrSearch()
57 hi += 1; in SkStrSearch()
58 hi = ~hi; in SkStrSearch()
60 return hi; in SkStrSearch()
|
| /external/bluetooth/glib/glib/ |
| D | gqsort.c | 66 char *hi; member
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)]; in g_qsort_with_data() local
155 char *mid = lo + size * ((hi - lo) / size >> 1); in g_qsort_with_data()
159 if ((*compare_func) ((void *) hi, (void *) mid, user_data) < 0) in g_qsort_with_data()
160 SWAP (mid, hi, size); in g_qsort_with_data()
168 right_ptr = hi - size; in g_qsort_with_data()
207 if ((size_t) (hi - left_ptr) <= max_thresh) in g_qsort_with_data()
209 POP (lo, hi); in g_qsort_with_data()
[all …]
|
| /external/openssl/crypto/sha/asm/ |
| D | sha512-armv4.s | 105 ldr r12,[sp,#56+4] @ h.hi
107 @ LO lo>>14^hi<<18 ^ lo>>18^hi<<14 ^ hi>>9^lo<<23
108 @ HI hi>>14^lo<<18 ^ hi>>18^lo<<14 ^ lo>>9^hi<<23
124 ldr r10,[sp,#40+4] @ f.hi
128 ldr r12,[sp,#48+4] @ g.hi
141 ldr r12,[r14,#0] @ K[i].hi
146 ldr r8,[sp,#24+4] @ d.hi
159 @ LO lo>>28^hi<<4 ^ hi>>2^lo<<30 ^ hi>>7^lo<<25
160 @ HI hi>>28^lo<<4 ^ lo>>2^hi<<30 ^ lo>>7^hi<<25
178 ldr r10,[sp,#8+4] @ b.hi
[all …]
|
| D | sha512-armv4.pl | 27 $hi=0;
211 ldr $Ehi,[$ctx,#$Eoff+$hi]
213 ldr $t1, [$ctx,#$Goff+$hi]
215 ldr $t3, [$ctx,#$Hoff+$hi]
222 ldr $Ahi,[$ctx,#$Aoff+$hi]
224 ldr $Thi,[$ctx,#$Boff+$hi]
226 ldr $t1, [$ctx,#$Coff+$hi]
228 ldr $t3, [$ctx,#$Doff+$hi]
236 ldr $Thi,[$ctx,#$Foff+$hi]
323 ldr $t1, [$ctx,#$Aoff+$hi]
[all …]
|
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| D | NodeVector.java | 644 int hi = hi0; in sort() local
647 if (lo >= hi) in sort()
651 else if (lo == hi - 1) in sort()
657 if (a[lo] > a[hi]) in sort()
661 a[lo] = a[hi]; in sort()
662 a[hi] = T; in sort()
671 int pivot = a[(lo + hi) / 2]; in sort()
673 a[(lo + hi) / 2] = a[hi]; in sort()
674 a[hi] = pivot; in sort()
676 while (lo < hi) in sort()
[all …]
|
| /external/skia/src/animator/ |
| D | SkGetCondensedInfo.cpp | 32 int hi = count - 1; in _searchByName() local
33 while (lo < hi) { in _searchByName()
34 int mid = (hi + lo) >> 1; in _searchByName()
38 hi = mid; in _searchByName()
40 if (strcmp(&strings[lengths[hi << 2]], target) != 0) in _searchByName()
42 return hi; in _searchByName()
48 int hi = kTypeIDs - 1; in _searchByType() local
49 while (lo < hi) { in _searchByType()
50 int mid = (hi + lo) >> 1; in _searchByType()
54 hi = mid; in _searchByType()
[all …]
|
| /external/freetype/src/base/ |
| D | ftcalc.c | 56 FT_UInt32 hi; member
261 FT_UInt32 lo1, hi1, lo2, hi2, lo, hi, i1, i2; in ft_multo64() local
270 hi = hi1 * hi2; in ft_multo64()
274 hi += (FT_UInt32)( i1 < i2 ) << 16; in ft_multo64()
276 hi += i1 >> 16; in ft_multo64()
281 hi += ( lo < i1 ); in ft_multo64()
284 z->hi = hi; in ft_multo64()
289 ft_div64by32( FT_UInt32 hi, in ft_div64by32() argument
298 r = hi; in ft_div64by32()
327 register FT_UInt32 lo, hi; in FT_Add64() local
[all …]
|
| /external/srec/srec/cfront/ |
| D | himul32.h | 104 asr_int32_t hi;
112 return result.pieces.hi;
127 asr_uint32_t hi, lo, mid;
154 hi = xhi * yhi;
175 hi += carry + (mid >> 16);
184 hi = ~hi;
185 hi += lo == 0;
188 return (asr_int32_t)hi;
|
| /external/bzip2/ |
| D | blocksort.c | 35 Int32 hi ) in fallbackSimpleSort() argument
40 if (lo == hi) return; in fallbackSimpleSort()
42 if (hi - lo > 3) { in fallbackSimpleSort()
43 for ( i = hi-4; i >= lo; i-- ) { in fallbackSimpleSort()
46 for ( j = i+4; j <= hi && ec_tmp > eclass[fmap[j]]; j += 4 ) in fallbackSimpleSort()
52 for ( i = hi-1; i >= lo; i-- ) { in fallbackSimpleSort()
55 for ( j = i+1; j <= hi && ec_tmp > eclass[fmap[j]]; j++ ) in fallbackSimpleSort()
99 Int32 sp, lo, hi; in fallbackQSort3() local
113 fpop ( lo, hi ); in fallbackQSort3()
114 if (hi - lo < FALLBACK_QSORT_SMALL_THRESH) { in fallbackQSort3()
[all …]
|
| /external/chromium/crypto/third_party/nss/ |
| D | sha512.cc | 438 PRUint32 hi, lo; in SHA256_End() local
443 hi = (ctx->sizeHi << 3) | (ctx->sizeLo >> 29); in SHA256_End()
449 W[14] = SHA_HTONL(hi); in SHA256_End()
452 W[14] = hi; in SHA256_End()
541 #define ULLC(hi,lo) 0x ## hi ## lo ## UL
543 #define ULLC(hi,lo) 0x ## hi ## lo ## ui64
545 #define ULLC(hi,lo) 0x ## hi ## lo ## ULL
559 #define ULLC(hi,lo) { 0x ## lo ## U, 0x ## hi ## U }
561 #define ULLC(hi,lo) { 0x ## hi ## U, 0x ## lo ## U }
564 #define SHA_HTONLL(x) ( BYTESWAP4(x.lo), BYTESWAP4(x.hi), \
[all …]
|
| /external/valgrind/main/memcheck/tests/ppc64/ |
| D | power_ISA2_05.c | 46 unsigned int hi; in test_lfiwax() member
57 printf("lfiwax (%f) => FRT=(%x, %x)\n", foo, ip->hi, ip->lo); in test_lfiwax()
72 double hi; in test_double_pair_instrs() member
91 dbl_pair[i].hi = -1024.0 + i; in test_double_pair_instrs()
99 dbl_pair[0].hi, dbl_pair[0].lo, FRT1, FRT2); in test_double_pair_instrs()
108 FRT1, FRT2, dbl_pair[1].hi, dbl_pair[1].lo); in test_double_pair_instrs()
120 dbl_pair[1].hi, dbl_pair[1].lo, FRT1, FRT2); in test_double_pair_instrs()
132 FRT1, FRT2, dbl_pair[2].hi, dbl_pair[2].lo); in test_double_pair_instrs()
|
| /external/valgrind/main/memcheck/tests/ppc32/ |
| D | power_ISA2_05.c | 46 unsigned int hi; in test_lfiwax() member
57 printf("lfiwax (%f) => FRT=(%x, %x)\n", foo, ip->hi, ip->lo); in test_lfiwax()
72 double hi; in test_double_pair_instrs() member
91 dbl_pair[i].hi = -1024.0 + i; in test_double_pair_instrs()
99 dbl_pair[0].hi, dbl_pair[0].lo, FRT1, FRT2); in test_double_pair_instrs()
108 FRT1, FRT2, dbl_pair[1].hi, dbl_pair[1].lo); in test_double_pair_instrs()
120 dbl_pair[1].hi, dbl_pair[1].lo, FRT1, FRT2); in test_double_pair_instrs()
132 FRT1, FRT2, dbl_pair[2].hi, dbl_pair[2].lo); in test_double_pair_instrs()
|
| /external/v8/src/ |
| D | v8.cc | 112 uint32_t hi; member
123 if (state->hi == 0) state->hi = random_seed(); in random_base()
127 state->hi = 36969 * (state->hi & 0xFFFF) + (state->hi >> 16); in random_base()
129 return (state->hi << 16) + (state->lo & 0xFFFF); in random_base()
|
| /external/bluetooth/hcidump/parser/ |
| D | obex.c | 141 static char *hi2str(uint8_t hi) in hi2str() argument
143 switch (hi & 0x3f) { in hi2str()
191 uint8_t hi, hv8; in parse_headers() local
196 hi = get_u8(frm); in parse_headers()
200 printf("%s (0x%02x)", hi2str(hi), hi); in parse_headers()
201 switch (hi & 0xc0) { in parse_headers()
|
| /external/elfutils/libelf/ |
| D | dl-hash.h | 45 unsigned int hi; in _dl_elf_hash() local
47 hi = hash & 0xf0000000; in _dl_elf_hash()
60 hash ^= hi; in _dl_elf_hash()
61 hash ^= hi >> 24; in _dl_elf_hash()
|
| /external/fdlibm/ |
| D | s_expm1.c | 136 double y,hi,lo,c,t,e,hxs,hfx,r1; local
165 {hi = x - ln2_hi; lo = ln2_lo; k = 1;}
167 {hi = x + ln2_hi; lo = -ln2_lo; k = -1;}
171 hi = x - t*ln2_hi; /* t*ln2_hi is exact here */
174 x = hi - lo;
175 c = (hi-x)-lo;
|
| D | e_exp.c | 108 double y,hi,lo,c,t; local
130 hi = x-ln2HI[xsb]; lo=ln2LO[xsb]; k = 1-xsb-xsb;
134 hi = x - t*ln2HI[0]; /* t*ln2HI is exact here */
137 x = hi - lo;
148 else y = one-((lo-(x*c)/(2.0-c))-hi);
|
| /external/tremolo/Tremolo/ |
| D | asm_arm.h | 44 int lo,hi; in MULT32() local
46 : "=&r"(lo),"=&r"(hi) in MULT32()
49 return(hi); in MULT32()
57 int lo,hi; in MULT31_SHIFT15() local
61 : "=&r"(lo),"=&r"(hi) in MULT31_SHIFT15()
64 return(hi); in MULT31_SHIFT15()
|
| /external/v8/src/arm/ |
| D | constants-arm.h | 131 hi = 8 << 28, // C set, Z clear Unsigned higher. enumerator
158 return hi; in ReverseCondition()
159 case hi: in ReverseCondition()
545 inline int Bits(int hi, int lo) const { in Bits() argument
546 return (InstructionBits() >> lo) & ((2 << (hi - lo)) - 1); in Bits()
550 inline int BitField(int hi, int lo) const { in BitField() argument
551 return InstructionBits() & (((2 << (hi - lo)) - 1) << lo); in BitField()
562 static inline int Bits(Instr instr, int hi, int lo) { in Bits() argument
563 return (instr >> lo) & ((2 << (hi - lo)) - 1); in Bits()
568 static inline int BitField(Instr instr, int hi, int lo) { in BitField() argument
[all …]
|
| /external/icu4c/common/ |
| D | uset.cpp | 424 int32_t hi = set->bmpLength-1; in uset_serializedContains() local
426 hi = 0; in uset_serializedContains()
427 } else if (c < array[hi]) { in uset_serializedContains()
429 int32_t i = (lo + hi) >> 1; in uset_serializedContains()
433 hi = i; in uset_serializedContains()
439 hi += 1; in uset_serializedContains()
441 return (UBool)(hi&1); in uset_serializedContains()
447 int32_t hi = set->length - 2 - base; in uset_serializedContains() local
449 hi = 0; in uset_serializedContains()
450 } else if (high < array[base+hi] || (high==array[base+hi] && low<array[base+hi+1])) { in uset_serializedContains()
[all …]
|