/external/libopus/celt/ |
H A D | rate.h | 56 int lo, hi; local 62 lo = 0; 67 int mid = (lo+hi+1)>>1; 72 lo = mid; 74 if (bits- (lo == 0 ? -1 : (int)cache[lo]) <= (int)cache[hi]-bits) 75 return lo;
|
/external/regex-re2/util/ |
H A D | benchmark.h | 13 int lo; 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; } argument 37 #define BENCHMARK_RANGE(f, lo, hi) \ 39 (new ::testing::Benchmark(#f, f, lo, hi))
|
/external/chromium_org/v8/test/mjsunit/es6/ |
H A D | string-iterator.js | 32 var lo = "\uD834"; 34 var pair = lo + hi; 35 var string = "abc" + pair + "def" + lo + pair + hi + lo; 44 assertIteratorResult(lo, false, iterator.next()); 47 assertIteratorResult(lo, false, iterator.next()); 67 var lo = "\uD834"; 69 var pair = lo + hi; 70 var string = "abc" + pair + "def" + lo + pair + hi + lo; [all...] |
/external/libcxx/test/containers/sequences/list/list.cons/ |
H A D | move_alloc.pass.cpp | 25 std::list<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); 29 lo.push_back(i); 32 assert(l2 == lo); 38 std::list<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); 42 lo.push_back(i); 45 assert(l2 == lo); 51 std::list<MoveOnly, other_allocator<MoveOnly> > lo(other_allocator<MoveOnly>(5)); 55 lo.push_back(i); 58 assert(l2 == lo); 65 std::list<MoveOnly, min_allocator<MoveOnly> > lo(min_allocato [all...] |
/external/libcxx/test/containers/sequences/vector/vector.cons/ |
H A D | move.pass.cpp | 25 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); 29 lo.push_back(i); 32 assert(l2 == lo); 34 assert(l2.get_allocator() == lo.get_allocator()); 38 std::vector<MoveOnly, other_allocator<MoveOnly> > lo(other_allocator<MoveOnly>(5)); 42 lo.push_back(i); 45 assert(l2 == lo); 47 assert(l2.get_allocator() == lo.get_allocator()); 60 std::vector<MoveOnly, min_allocator<MoveOnly> > lo(min_allocator<MoveOnly>{}); 64 lo [all...] |
H A D | move_alloc.pass.cpp | 25 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); 29 lo.push_back(i); 32 assert(l2 == lo); 38 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); 42 lo.push_back(i); 45 assert(l2 == lo); 51 std::vector<MoveOnly, other_allocator<MoveOnly> > lo(other_allocator<MoveOnly>(5)); 55 lo.push_back(i); 58 assert(l2 == lo); 65 std::vector<MoveOnly, min_allocator<MoveOnly> > lo(min_allocato [all...] |
/external/chromium_org/third_party/npapi/npspy/extern/java/ |
H A D | jri_md.h | 282 juint lo, hi; member in struct:__anon14654 284 juint hi, lo; 291 #define jlong_IS_ZERO(a) (((a).hi == 0) && ((a).lo == 0)) 292 #define jlong_EQ(a, b) (((a).hi == (b).hi) && ((a).lo == (b).lo)) 293 #define jlong_NE(a, b) (((a).hi != (b).hi) || ((a).lo != (b).lo)) 300 (((a).hi == (b).hi) && ((a).lo op (b).lo))) 302 (((a).hi == (b).hi) && ((a).lo o [all...] |
/external/compiler-rt/lib/builtins/arm/ |
H A D | sync_fetch_and_umin_8.S | 17 #define umin_8(rD_LO, rD_HI, rN_LO, rN_HI, rM_LO, rM_HI) MINMAX_8(rD_LO, rD_HI, rN_LO, rN_HI, rM_LO, rM_HI, lo)
|
/external/chromium-trace/trace-viewer/src/base/ |
H A D | sorted_array_utils_test.js | 18 function(x) { return x.lo; }, 19 function(x) { return x.hi - x.lo; }, 26 {lo: 10, hi: 15}, 27 {lo: 20, hi: 30}
|
/external/llvm/test/MC/Mips/ |
H A D | expr1.s | 6 # CHECK: lw $4, %lo(foo)($4) # encoding: [A,A,0x84,0x8c] 9 # CHECK: lw $4, %lo(foo+8)($4) # encoding: [0x08'A',A,0x84,0x8c] 11 # CHECK: lw $4, %lo(foo+8)($4) # encoding: [0x08'A',A,0x84,0x8c] 13 # CHECK: lw $4, %lo(foo+8)($4) # encoding: [0x08'A',A,0x84,0x8c] 20 lw $4,%lo(foo)($4) 22 lw $4,%lo (2 * 4) + foo($4) 23 lw $4,%lo((2 * 4) + foo)($4) 24 lw $4,(((%lo ((2 * 4) + foo))))($4)
|
H A D | micromips-expressions.s | 7 # CHECK: lw $4, %lo(foo)($4) # encoding: [0x84'A',0xfc'A',0x00,0x00] 12 # CHECK: lw $4, %lo(foo+8)($4) # encoding: [0x84'A',0xfc'A',0x08,0x00] 16 # CHECK: lw $4, %lo(foo+8)($4) # encoding: [0x84'A',0xfc'A',0x08,0x00] 20 # CHECK: lw $4, %lo(foo+8)($4) # encoding: [0x84'A',0xfc'A',0x08,0x00] 29 lw $4,%lo(foo)($4) 31 lw $4,%lo (2 * 4) + foo($4) 32 lw $4,%lo((2 * 4) + foo)($4) 33 lw $4,(((%lo ((2 * 4) + foo))))($4)
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkFilterProc.cpp | 54 #define COMBINE(lo, hi) (((lo) & ~0xFF00) | (((hi) & ~0xFF00) << 8)) 62 uint32_t lo = (3 * LO_PAIR(c00) + LO_PAIR(c01)) >> 2; local 64 return COMBINE(lo, hi); 67 uint32_t lo = (LO_PAIR(c00) + LO_PAIR(c01)) >> 1; local 69 return COMBINE(lo, hi); 72 uint32_t lo = (LO_PAIR(c00) + 3 * LO_PAIR(c01)) >> 2; local 74 return COMBINE(lo, hi); 78 uint32_t lo = (3 * LO_PAIR(c00) + LO_PAIR(c10)) >> 2; local 80 return COMBINE(lo, h 83 uint32_t lo = (9 * LO_PAIR(c00) + 3 * (LO_PAIR(c01) + LO_PAIR(c10)) + LO_PAIR(c11)) >> 4; local 88 uint32_t lo = (3 * (LO_PAIR(c00) + LO_PAIR(c01)) + LO_PAIR(c10) + LO_PAIR(c11)) >> 3; local 93 uint32_t lo = (9 * LO_PAIR(c01) + 3 * (LO_PAIR(c00) + LO_PAIR(c11)) + LO_PAIR(c10)) >> 4; local 99 uint32_t lo = (LO_PAIR(c00) + LO_PAIR(c10)) >> 1; local 104 uint32_t lo = (3 * (LO_PAIR(c00) + LO_PAIR(c10)) + LO_PAIR(c01) + LO_PAIR(c11)) >> 3; local 109 uint32_t lo = (LO_PAIR(c00) + LO_PAIR(c01) + LO_PAIR(c10) + LO_PAIR(c11)) >> 2; local 114 uint32_t lo = (3 * (LO_PAIR(c01) + LO_PAIR(c11)) + LO_PAIR(c00) + LO_PAIR(c10)) >> 3; local 120 uint32_t lo = (LO_PAIR(c00) + 3 * LO_PAIR(c10)) >> 2; local 125 uint32_t lo = (9 * LO_PAIR(c10) + 3 * (LO_PAIR(c00) + LO_PAIR(c11)) + LO_PAIR(c01)) >> 4; local 130 uint32_t lo = (3 * (LO_PAIR(c10) + LO_PAIR(c11)) + LO_PAIR(c00) + LO_PAIR(c01)) >> 3; local 135 uint32_t lo = (9 * LO_PAIR(c11) + 3 * (LO_PAIR(c01) + LO_PAIR(c10)) + LO_PAIR(c00)) >> 4; local 160 uint32_t lo = (3 * LO_PAIR(c00) + LO_PAIR(c01)) >> 2; local 167 uint32_t lo = (LO_PAIR(c00) + LO_PAIR(c01)) >> 1; local 174 uint32_t lo = (LO_PAIR(c00) + 3 * LO_PAIR(c01)) >> 2; local 182 uint32_t lo = (3 * LO_PAIR(c00) + LO_PAIR(c10)) >> 2; local 191 uint32_t lo = (9 * LO_PAIR(c00) + 3 * (LO_PAIR(c01) + LO_PAIR(c10)) + LO_PAIR(c11)) >> 4; local 200 uint32_t lo = (3 * (LO_PAIR(c00) + LO_PAIR(c01)) + LO_PAIR(c10) + LO_PAIR(c11)) >> 3; local 209 uint32_t lo = (9 * LO_PAIR(c01) + 3 * (LO_PAIR(c00) + LO_PAIR(c11)) + LO_PAIR(c10)) >> 4; local 217 uint32_t lo = (LO_PAIR(c00) + LO_PAIR(c10)) >> 1; local 226 uint32_t lo = (3 * (LO_PAIR(c00) + LO_PAIR(c10)) + LO_PAIR(c01) + LO_PAIR(c11)) >> 3; local 235 uint32_t lo = (LO_PAIR(c00) + LO_PAIR(c01) + LO_PAIR(c10) + LO_PAIR(c11)) >> 2; local 244 uint32_t lo = (3 * (LO_PAIR(c01) + LO_PAIR(c11)) + LO_PAIR(c00) + LO_PAIR(c10)) >> 3; local 252 uint32_t lo = (LO_PAIR(c00) + 3 * LO_PAIR(c10)) >> 2; local 261 uint32_t lo = (9 * LO_PAIR(c10) + 3 * (LO_PAIR(c00) + LO_PAIR(c11)) + LO_PAIR(c01)) >> 4; local 270 uint32_t lo = (3 * (LO_PAIR(c10) + LO_PAIR(c11)) + LO_PAIR(c00) + LO_PAIR(c01)) >> 3; local 279 uint32_t lo = (9 * LO_PAIR(c11) + 3 * (LO_PAIR(c01) + LO_PAIR(c10)) + LO_PAIR(c00)) >> 4; local [all...] |
/external/skia/src/core/ |
H A D | SkFilterProc.cpp | 54 #define COMBINE(lo, hi) (((lo) & ~0xFF00) | (((hi) & ~0xFF00) << 8)) 62 uint32_t lo = (3 * LO_PAIR(c00) + LO_PAIR(c01)) >> 2; local 64 return COMBINE(lo, hi); 67 uint32_t lo = (LO_PAIR(c00) + LO_PAIR(c01)) >> 1; local 69 return COMBINE(lo, hi); 72 uint32_t lo = (LO_PAIR(c00) + 3 * LO_PAIR(c01)) >> 2; local 74 return COMBINE(lo, hi); 78 uint32_t lo = (3 * LO_PAIR(c00) + LO_PAIR(c10)) >> 2; local 80 return COMBINE(lo, h 83 uint32_t lo = (9 * LO_PAIR(c00) + 3 * (LO_PAIR(c01) + LO_PAIR(c10)) + LO_PAIR(c11)) >> 4; local 88 uint32_t lo = (3 * (LO_PAIR(c00) + LO_PAIR(c01)) + LO_PAIR(c10) + LO_PAIR(c11)) >> 3; local 93 uint32_t lo = (9 * LO_PAIR(c01) + 3 * (LO_PAIR(c00) + LO_PAIR(c11)) + LO_PAIR(c10)) >> 4; local 99 uint32_t lo = (LO_PAIR(c00) + LO_PAIR(c10)) >> 1; local 104 uint32_t lo = (3 * (LO_PAIR(c00) + LO_PAIR(c10)) + LO_PAIR(c01) + LO_PAIR(c11)) >> 3; local 109 uint32_t lo = (LO_PAIR(c00) + LO_PAIR(c01) + LO_PAIR(c10) + LO_PAIR(c11)) >> 2; local 114 uint32_t lo = (3 * (LO_PAIR(c01) + LO_PAIR(c11)) + LO_PAIR(c00) + LO_PAIR(c10)) >> 3; local 120 uint32_t lo = (LO_PAIR(c00) + 3 * LO_PAIR(c10)) >> 2; local 125 uint32_t lo = (9 * LO_PAIR(c10) + 3 * (LO_PAIR(c00) + LO_PAIR(c11)) + LO_PAIR(c01)) >> 4; local 130 uint32_t lo = (3 * (LO_PAIR(c10) + LO_PAIR(c11)) + LO_PAIR(c00) + LO_PAIR(c01)) >> 3; local 135 uint32_t lo = (9 * LO_PAIR(c11) + 3 * (LO_PAIR(c01) + LO_PAIR(c10)) + LO_PAIR(c00)) >> 4; local 160 uint32_t lo = (3 * LO_PAIR(c00) + LO_PAIR(c01)) >> 2; local 167 uint32_t lo = (LO_PAIR(c00) + LO_PAIR(c01)) >> 1; local 174 uint32_t lo = (LO_PAIR(c00) + 3 * LO_PAIR(c01)) >> 2; local 182 uint32_t lo = (3 * LO_PAIR(c00) + LO_PAIR(c10)) >> 2; local 191 uint32_t lo = (9 * LO_PAIR(c00) + 3 * (LO_PAIR(c01) + LO_PAIR(c10)) + LO_PAIR(c11)) >> 4; local 200 uint32_t lo = (3 * (LO_PAIR(c00) + LO_PAIR(c01)) + LO_PAIR(c10) + LO_PAIR(c11)) >> 3; local 209 uint32_t lo = (9 * LO_PAIR(c01) + 3 * (LO_PAIR(c00) + LO_PAIR(c11)) + LO_PAIR(c10)) >> 4; local 217 uint32_t lo = (LO_PAIR(c00) + LO_PAIR(c10)) >> 1; local 226 uint32_t lo = (3 * (LO_PAIR(c00) + LO_PAIR(c10)) + LO_PAIR(c01) + LO_PAIR(c11)) >> 3; local 235 uint32_t lo = (LO_PAIR(c00) + LO_PAIR(c01) + LO_PAIR(c10) + LO_PAIR(c11)) >> 2; local 244 uint32_t lo = (3 * (LO_PAIR(c01) + LO_PAIR(c11)) + LO_PAIR(c00) + LO_PAIR(c10)) >> 3; local 252 uint32_t lo = (LO_PAIR(c00) + 3 * LO_PAIR(c10)) >> 2; local 261 uint32_t lo = (9 * LO_PAIR(c10) + 3 * (LO_PAIR(c00) + LO_PAIR(c11)) + LO_PAIR(c01)) >> 4; local 270 uint32_t lo = (3 * (LO_PAIR(c10) + LO_PAIR(c11)) + LO_PAIR(c00) + LO_PAIR(c01)) >> 3; local 279 uint32_t lo = (9 * LO_PAIR(c11) + 3 * (LO_PAIR(c01) + LO_PAIR(c10)) + LO_PAIR(c00)) >> 4; local [all...] |
/external/chromium_org/third_party/sqlite/src/ |
H A D | Makefile.in | 164 LIBOBJS0 = alter.lo analyze.lo attach.lo auth.lo \ 165 backup.lo bitvec.lo btmutex.lo btree.lo build.lo \ 166 callback.lo complet [all...] |
/external/openssl/crypto/bn/asm/ |
H A D | s390x-gf2m.pl | 56 ($lo,$hi,$b)=map("%r$_",(3..5)); $a=$lo; $mask=$a8; 69 srag $lo,$a1,63 # broadcast 63rd bit 75 ngr $lo,$b 109 srlg $hi,$lo,1 111 sllg $lo,$lo,63 125 xgr $lo,$a1 127 xgr $lo,$a2 129 xg $lo, [all...] |
H A D | armv4-gf2m.pl | 55 ($hi,$lo,$t0,$t1, $i0,$i1 )=map("r$_",(4..9),12); 82 ldr $lo,[sp,$i0] @ tab[b & 0x7] 87 eor $lo,$lo,$t1,lsl#3 @ stall 92 eor $lo,$lo,$t0,lsl#6 97 eor $lo,$lo,$t1,lsl#9 102 eor $lo,$lo, [all...] |
/external/srec/srec/cfront/ |
H A D | himul32.h | 103 asr_int32_t lo; 127 asr_uint32_t hi, lo, mid; 146 lo = xlo * ylo; 157 // Now add the low part of mid to the high part of lo, and the 159 // xxxxxxxx xxxxxxxx lo 163 // xxxxxxxx xxxxxxxx lo 165 // Note that folding mid into lo can cause a carry. An old trick 171 oldlo = lo; 172 lo += mid << 16; 173 carry = lo < oldl [all...] |
/external/compiler-rt/lib/builtins/ppc/ |
H A D | gcc_qdiv.c | 17 register double x = dst.s.hi, x1 = dst.s.lo, 18 y = src.s.hi, y1 = src.s.lo; 28 dst.s.lo = 0.0; 35 dst.s.lo = 0.0; 51 dst.s.lo = (q - x) + tmp;
|
H A D | gcc_qmul.c | 17 register double A = dst.s.hi, a = dst.s.lo, 18 B = src.s.hi, b = src.s.lo; 28 dst.s.lo = 0.0; 35 dst.s.lo = 0.0; 49 dst.s.lo = (ab - tau) + tmp;
|
H A D | gcc_qadd.c | 18 register double A = dst.s.hi, a = dst.s.lo, 19 B = src.s.hi, b = src.s.lo; 24 dst.s.lo = 0.0; 34 dst.s.lo = 0.0; 44 dst.s.lo = 0.0; 73 dst.s.lo = (W - Y) + w;
|
H A D | gcc_qsub.c | 18 register double A = dst.s.hi, a = dst.s.lo, 19 B = -src.s.hi, b = -src.s.lo; 24 dst.s.lo = 0.0; 34 dst.s.lo = 0.0; 44 dst.s.lo = 0.0; 73 dst.s.lo = (W - Y) + w;
|
/external/chromium_org/third_party/sqlite/src/src/ |
H A D | hwtime.h | 31 unsigned int lo, hi; local 32 __asm__ __volatile__ ("rdtsc" : "=a" (lo), "=d" (hi)); 33 return (sqlite_uint64)hi << 32 | lo;
|
/external/fio/arch/ |
H A D | arch-x86_64.h | 53 unsigned int lo, hi; local 55 __asm__ __volatile__("rdtsc" : "=a" (lo), "=d" (hi)); 56 return ((unsigned long long) hi << 32ULL) | lo;
|
/external/chromium_org/third_party/skia/src/animator/ |
H A D | SkGetCondensedInfo.cpp | 23 int lo = 0; local 25 while (lo < hi) { 26 int mid = (hi + lo) >> 1; 28 lo = mid + 1; 39 int lo = 0; local 41 while (lo < hi) { 42 int mid = (hi + lo) >> 1; 44 lo = mid + 1;
|
/external/libsepol/tests/ |
H A D | test-downgrade.c | 35 #define POLICY_BIN_LO "policies/test-downgrade/policy.lo" 130 int hi, lo, version; local 151 for (lo = hi - 1; lo >= POLICYDB_VERSION_MIN; lo--) { 154 policydb.policyvers = lo; 162 if (mls && lo < POLICYDB_VERSION_MLS) 165 fprintf(stderr, "error writing %spolicy binary, version %d (downgraded from %d)\n", mls ? "mls " : "", lo, hi); 177 fprintf(stderr, "error reading %spolicy binary, version %d (downgraded from %d)\n", mls ? "mls " : "", lo, hi);
|