| /external/tremolo/Tremolo/ |
| floor1.c | 176 int hi=1; local
187 hi=k;
192 info->hineighbor[j]=hi;
|
| /libcore/luni/src/main/java/java/util/ |
| ComparableTimSort.java | 145 static void sort(Object[] a, int lo, int hi) {
146 rangeCheck(a.length, lo, hi);
147 int nRemaining = hi - lo;
153 int initRunLen = countRunAndMakeAscending(a, lo, hi);
154 binarySort(a, lo, hi, lo + initRunLen);
167 int runLen = countRunAndMakeAscending(a, lo, hi);
186 if (DEBUG) assert lo == hi; local
204 * @param hi the index after the last element in the range to be sorted
206 * not already known to be sorted (@code lo <= start <= hi}
209 private static void binarySort(Object[] a, int lo, int hi, int start)
[all...] |
| TimSort.java | 172 static <T> void sort(T[] a, int lo, int hi, Comparator<? super T> c) {
174 Arrays.sort(a, lo, hi);
178 rangeCheck(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...] |
| Arrays.java | 205 int hi = endIndex - 1; local
207 while (lo <= hi) {
208 int mid = (lo + hi) >>> 1;
214 hi = mid - 1;
255 int hi = endIndex - 1; local
257 while (lo <= hi) {
258 int mid = (lo + hi) >>> 1;
264 hi = mid - 1;
305 int hi = endIndex - 1; local
307 while (lo <= hi) {
366 int hi = endIndex - 1; local
427 int hi = endIndex - 1; local
477 int hi = endIndex - 1; local
533 int hi = endIndex - 1; local
599 int hi = endIndex - 1; local
649 int hi = endIndex - 1; local
[all...] |
| /libcore/luni/src/main/java/org/apache/xml/utils/ |
| NodeVector.java | 644 int hi = hi0; local
646 // pause(lo, hi);
647 if (lo >= hi)
651 else if (lo == hi - 1)
657 if (a[lo] > a[hi])
661 a[lo] = a[hi];
662 a[hi] = T;
671 int pivot = a[(lo + hi) / 2];
673 a[(lo + hi) / 2] = a[hi];
[all...] |
| /sdk/emulator/mksdcard/ |
| mksdcard.c | 65 unsigned short lo, hi, mid; local
70 hi = (unsigned short)(tm.tm_min + (tm.tm_hour << 8) + (tm.tm_year + 1900));
72 return lo + (hi << 16);
|
| /system/core/include/private/pixelflinger/ |
| ggl_fixed.h | 114 asm("smull %[lo], %[hi], %[x], %[y] \n"
116 "adc %[lo], %[lo], %[hi], lsl %[lshift] \n"
117 : [lo]"=r"(result), [hi]"=r"(t), [x]"=r"(x)
122 asm("smull %[lo], %[hi], %[x], %[y] \n"
124 "adc %[lo], %[lo], %[hi], lsl %[lshift] \n"
125 : [lo]"=&r"(result), [hi]"=&r"(t), [x]"=&r"(x)
137 asm("smull %[lo], %[hi], %[x], %[y] \n"
139 "add %[lo], %[lo], %[hi], lsl %[lshift] \n"
140 : [lo]"=&r"(result), [hi]"=&r"(t), [x]"=&r"(x)
144 asm("smull %[lo], %[hi], %[x], %[y] \n
182 int32_t hi; member in struct:__anon15913::__anon15914
[all...] |
| /system/core/liblog/ |
| event_tag_map.c | 128 int hi, lo, mid; local
131 hi = map->numTags-1;
133 while (lo <= hi) {
136 mid = (lo+hi)/2;
143 hi = mid - 1;
|
| /external/chromium/base/third_party/nspr/ |
| prtypes.h | 423 PRUint32 lo, hi; member in struct:__anon2446
425 PRUint32 hi, lo;
|
| /external/chromium/base/third_party/nss/ |
| sha512.cc | 438 PRUint32 hi, lo; local
443 hi = (ctx->sizeHi << 3) | (ctx->sizeLo >> 29);
449 W[14] = SHA_HTONL(hi);
452 W[14] = hi;
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 ## UL
[all...] |
| /external/chromium/third_party/icu/source/common/ |
| uset.cpp | 424 int32_t hi = set->bmpLength-1; local
426 hi = 0;
427 } else if (c < array[hi]) {
429 int32_t i = (lo + hi) >> 1;
433 hi = i;
439 hi += 1;
441 return (UBool)(hi&1);
447 int32_t hi = set->length - 2 - base; local
449 hi = 0;
450 } else if (high < array[base+hi] || (high==array[base+hi] && low<array[base+hi+1]))
[all...] |
| /external/chromium/third_party/icu/source/i18n/ |
| nfrs.cpp | 422 int32_t hi = rules.size(); local
423 if (hi > 0) {
426 while (lo < hi) {
427 int32_t mid = (lo + hi) / 2;
432 hi = mid;
438 if (hi == 0) { // bad rule set, minimum base > 0
442 NFRule *result = rules[hi - 1];
450 if (hi == 1) { // bad rule set, no prior rule to rollback to from this base
453 result = rules[hi - 2];
|
| /external/icu4c/common/ |
| uset.cpp | 424 int32_t hi = set->bmpLength-1; local
426 hi = 0;
427 } else if (c < array[hi]) {
429 int32_t i = (lo + hi) >> 1;
433 hi = i;
439 hi += 1;
441 return (UBool)(hi&1);
447 int32_t hi = set->length - 2 - base; local
449 hi = 0;
450 } else if (high < array[base+hi] || (high==array[base+hi] && low<array[base+hi+1]))
[all...] |
| /external/icu4c/i18n/ |
| nfrs.cpp | 422 int32_t hi = rules.size(); local
423 if (hi > 0) {
426 while (lo < hi) {
427 int32_t mid = (lo + hi) / 2;
432 hi = mid;
438 if (hi == 0) { // bad rule set, minimum base > 0
442 NFRule *result = rules[hi - 1];
450 if (hi == 1) { // bad rule set, no prior rule to rollback to from this base
453 result = rules[hi - 2];
|
| /external/libpng/ |
| png.c | 849 * arithmetic, to produce a 64 bit result in the HI/LO words.
867 long lo, hi, x, y; local
879 hi = (y >> 16) & 0xffff;
881 hi += a * c; /* AC */
883 *hi_product = (unsigned long)hi;
|
| /external/qemu/distrib/sdl-1.2.12/include/ |
| SDL_stdinc.h | 100 Uint32 hi; member in struct:__anon5997
|
| /external/qemu/distrib/sdl-1.2.12/src/video/Xext/extensions/ |
| xf86vmode.h | 131 float hi; member in struct:__anon6164
|
| /external/qemu/hw/ |
| bt-sdp.c | 86 int *lo, hi, val; local
99 hi = record->uuids;
100 while (hi >>= 1)
101 if (lo[hi] <= val)
102 lo += hi;
|
| /external/skia/src/core/ |
| SkBitmapProcState_matrix_repeat.h | 136 /* this is ok -- we want all hi(lout)s then all hi(hout)s */
349 int16x8_t hi, hi2; local
393 /* (hi-x, hi-y)4 (hi-x2; hi-y2)4 */
397 hi = vreinterpretq_s16_s32(y);
398 vst1q_s16(mydst, hi);
|
| SkGlyphCache.cpp | 256 int hi = 0; local
263 hi = count - 1;
264 while (lo < hi) {
265 int mid = (hi + lo) >> 1;
269 hi = mid;
272 glyph = gptr[hi];
280 // check if we need to bump hi before falling though to the allocator
282 hi += 1;
286 // not found, but hi tells us where to inser the new glyph
294 *fGlyphArray.insert(hi) = glyph
[all...] |
| /external/stlport/src/ |
| num_get_float.cpp | 42 uint32_t hi; member in struct:_ll::__anon7688
46 uint32_t hi;
302 int hi, lo; /* offsets in power of ten table */ local
304 hi = (min) (exp_hi, num_hi); /* only a few large powers of 10 */
305 exp_hi -= hi; /* could iterate in extreme case */
306 hi += thi-1;
307 _Stl_mult64(p, _Stl_tenpow[hi], prodhi, prodlo);
309 bexp += _Stl_twoexp[hi] - norm;
392 if (bexp <= -1022) { /* HI denorm or underflow */
579 v.ieee.mantissa0 = vv.i32.hi;
[all...] |
| /external/webkit/JavaScriptCore/wrec/ |
| WRECGenerator.cpp | 343 char hi = ranges[which].end; local
371 while ((*matchIndex < matchCount) && (matches[*matchIndex] <= hi))
374 matchDest.append(branch32(LessThanOrEqual, character, Imm32((unsigned short)hi)));
375 // fall through to here, the value is above hi.
400 UChar hi = charClass.rangesUnicode[i].end; local
403 matchDest.append(branch32(LessThanOrEqual, character, Imm32(hi)));
|
| /external/webkit/JavaScriptCore/yarr/ |
| RegexInterpreter.h | 78 UChar hi; member in struct:JSC::Yarr::ByteTerm::__anon8126::__anon8127::__anon8128::__anon8129
120 ByteTerm(UChar lo, UChar hi, int inputPos, unsigned frameLocation, unsigned quantityCount, QuantifierType quantityType)
136 atom.casedCharacter.hi = hi;
|
| /frameworks/base/media/libstagefright/rtsp/ |
| ARTPWriter.cpp | 423 uint64_t hi = nowUs / 1000000ll; local
426 return (hi << 32) | lo;
|
| /libcore/luni/src/main/native/ |
| NativeBN.cpp | 103 unsigned int hi = dw >> 32; // This shifts without sign extension. local
110 a->d[1] = hi;
|
