/external/regex-re2/re2/ |
regexp.cc | 699 // Add lo-hi to the class; return whether class got bigger. 700 bool CharClassBuilder::AddRange(Rune lo, Rune hi) { 701 if (hi < lo) 704 if (lo <= 'z' && hi >= 'A') { 708 Rune hi1 = min<Rune>(hi, 'Z'); 713 hi1 = min<Rune>(hi, 'z'); 718 { // Check whether lo, hi is already in the class. 720 if (it != end() && it->lo <= lo && hi <= it->hi) 730 if (it->hi > hi [all...] |
/frameworks/av/media/libstagefright/codecs/amrnb/enc/src/ |
levinson.cpp | 476 Word16 hi, lo; 477 Word16 Kh, Kl; // reflexion coefficient; hi and lo 478 Word16 alp_h, alp_l, alp_exp; // Prediction gain; hi lo and exponent 503 L_Extract (t0, &hi, &lo); // DPF format 504 t0 = Mpy_32 (Rh[0], Rl[0], hi, lo); // Alpha in 579 L_Extract (t0, &hi, &lo); // DPF format 580 t0 = Mpy_32 (alp_h, alp_l, hi, lo); 643 Word16 hi; local 645 Word16 Kh; /* reflexion coefficient; hi and lo */ 647 Word16 alp_h; /* Prediction gain; hi lo and exponent* [all...] |
/dalvik/vm/ |
PointerSet.cpp | 207 int hi, lo, mid; local 210 hi = pSet->count-1; 213 while (lo <= hi) { 214 mid = (lo + hi) / 2; 220 hi = mid - 1;
|
/frameworks/av/media/libstagefright/codecs/amrwbenc/src/ |
levinson.c | 116 Word16 hi, lo; local 117 Word16 Kh, Kl; /* reflection coefficient; hi and lo */ 118 Word16 alp_h, alp_l, alp_exp; /* Prediction gain; hi lo and exponent */ 149 hi = t0 >> 16; 152 t0 = Mpy_32(Rh[0], Rl[0], hi, lo); /* Alpha in Q31 */ 218 hi = t0 >> 16; 220 t0 = Mpy_32(alp_h, alp_l, hi, lo); /* Alpha in Q31 */
|
/libcore/luni/src/main/java/java/util/ |
ComparableTimSort.java | 145 static void sort(Object[] a, int lo, int hi) { 146 Arrays.checkStartAndEnd(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...] |
Arrays.java | 191 int hi = endIndex - 1; local 193 while (lo <= hi) { 194 int mid = (lo + hi) >>> 1; 200 hi = mid - 1; 241 int hi = endIndex - 1; local 243 while (lo <= hi) { 244 int mid = (lo + hi) >>> 1; 250 hi = mid - 1; 291 int hi = endIndex - 1; local 293 while (lo <= hi) { 352 int hi = endIndex - 1; local 413 int hi = endIndex - 1; local 463 int hi = endIndex - 1; local 519 int hi = endIndex - 1; local 585 int hi = endIndex - 1; local 635 int hi = endIndex - 1; local [all...] |
/bionic/libm/upstream-freebsd/lib/msun/src/ |
math_private.h | 563 #define DOPRINT_END2(hi, lo) \ 565 (long double)(hi), (long double)(lo)) 579 #define DOPRINT_END2(hi, lo) \ 581 (long double)(hi), (long double)(lo)) 595 #define DOPRINT_END2(hi, lo) \ 597 (long double)(hi), (long double)(lo)) 617 #define DOPRINT_END2(hi, lo) \ 619 (long double)(hi), (long double)(lo)) 626 #define DOPRINT_END2(hi, lo) 648 RETURNP((rp)->hi); \ [all...] |
/external/chromium_org/third_party/tcmalloc/chromium/src/base/ |
elfcore.h | 103 unsigned long hi; /* Used for multiplication and division. */ member in struct:mips_regs 275 unsigned long hi, lo; \ 309 __asm__ volatile ("mfhi %0" : "=r"(hi)); \ 312 f.mips_regs.hi = hi; \ 323 (r).hi = (f).mips_regs.hi; \
|
/external/chromium_org/third_party/tcmalloc/vendor/src/base/ |
elfcore.h | 103 unsigned long hi; /* Used for multiplication and division. */ member in struct:mips_regs 275 unsigned long hi, lo; \ 309 __asm__ volatile ("mfhi %0" : "=r"(hi)); \ 312 f.mips_regs.hi = hi; \ 323 (r).hi = (f).mips_regs.hi; \
|
/external/pixman/pixman/ |
pixman-matrix.c | 58 * hi, lo - high and low 64-bit parts of the dividend 67 rounded_udiv_128_by_48 (uint64_t hi, 75 remainder = hi % div; 76 *result_hi = hi / div; 103 rounded_sdiv_128_by_49 (int64_t hi, 115 if (hi < 0) 118 hi++; 119 hi = -hi; 123 result_lo = rounded_udiv_128_by_48 (hi, lo, div, &result_hi) 275 int64_t hi, rhi, lo, rlo; local 289 int64_t hi, rhi, lo, rlo, div; local [all...] |
/external/srec/srec/clib/ |
voc_read.c | 216 const char* hi; local 217 for (hi = high; *hi != '\n'; hi++) ; 218 hi++; 219 if (kompare(label, hi)) break; 220 high = hi;
|
/frameworks/av/media/libstagefright/codecs/aacenc/basic_op/ |
oper_32b.c | 37 * hi : b16 to b31 of L_32 * 38 * lo : (L_32 - hi<<16)>>1 * 42 void L_Extract (Word32 L_32, Word16 *hi, Word16 *lo) 44 *hi = extract_h (L_32); 45 *lo = extract_l (L_msu (L_shr (L_32, 1), *hi, 16384)); 55 * L_32 = hi<<16 + lo<<1 * 59 * hi msb * 70 Word32 L_Comp (Word16 hi, Word16 lo) 74 L_32 = L_deposit_h (hi); 75 return (L_mac (L_32, lo, 1)); /* = hi<<16 + lo<<1 * [all...] |
/external/chromium_org/net/quic/ |
quic_data_reader.cc | 34 uint16 hi; local 35 if (!ReadUInt16(&hi)) { 39 *result = hi;
|
/external/chromium/crypto/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_org/crypto/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_org/third_party/openssl/openssl/crypto/sha/asm/ |
sha512-armv4.pl | 37 $hi="HI"; 76 @ LO lo>>14^hi<<18 ^ lo>>18^hi<<14 ^ hi>>9^lo<<23 77 @ HI hi>>14^lo<<18 ^ hi>>18^lo<<14 ^ lo>>9^hi<<23 85 ldr $t3,[sp,#$Hoff+4] @ h.hi [all...] |
/external/openssl/crypto/sha/asm/ |
sha512-armv4.pl | 37 $hi="HI"; 76 @ LO lo>>14^hi<<18 ^ lo>>18^hi<<14 ^ hi>>9^lo<<23 77 @ HI hi>>14^lo<<18 ^ hi>>18^lo<<14 ^ lo>>9^hi<<23 85 ldr $t3,[sp,#$Hoff+4] @ h.hi [all...] |
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/util/ |
Pack.java | 56 int hi = bigEndianToInt(bs, off); local 58 return ((long)(hi & 0xffffffffL) << 32) | (long)(lo & 0xffffffffL); 151 int hi = littleEndianToInt(bs, off + 4); local 152 return ((long)(hi & 0xffffffffL) << 32) | (long)(lo & 0xffffffffL);
|
/external/chromium_org/crypto/ |
ghash.h | 56 uint64 low, hi; member in struct:crypto::GaloisHash::FieldElement
|
/external/chromium_org/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_org/third_party/re2/util/ |
benchmark.cc | 22 if(hi < lo) 23 hi = lo; 123 if(b->fnr || b->lo != b->hi) { 149 for(int k = max(b->lo, 1); k <= max(b->hi, 1); k<<=1)
|
/external/compiler-rt/lib/ppc/ |
DD.h | 9 double hi; member in struct:__anon20040::__anon20041
|
/external/icu4c/common/ |
uset.cpp | 419 int32_t hi = set->bmpLength-1; local 421 hi = 0; 422 } else if (c < array[hi]) { 424 int32_t i = (lo + hi) >> 1; 428 hi = i; 434 hi += 1; 436 return (UBool)(hi&1); 442 int32_t hi = set->length - 2 - base; local 444 hi = 0; 445 } else if (high < array[base+hi] || (high==array[base+hi] && low<array[base+hi+1])) [all...] |
/external/regex-re2/util/ |
benchmark.cc | 22 if(hi < lo) 23 hi = lo; 123 if(b->fnr || b->lo != b->hi) { 149 for(int k = max(b->lo, 1); k <= max(b->hi, 1); k<<=1)
|
/external/tremolo/Tremolo/ |
misc.h | 76 ogg_int32_t hi; member in struct:magic::__anon29636 85 ogg_int32_t hi; member in struct:magic::__anon29637 95 return magic.halves.hi; 105 return ((ogg_uint32_t)(magic.halves.lo)>>15) | ((magic.halves.hi)<<17);
|