/external/chromium_org/third_party/re2/util/ |
H A D | random.cc | 15 uint32 lo = A * (int32)(seed_ & 0xFFFF); local 17 lo += (hi & 0x7FFF) << 16; 18 if (lo > M) { 19 lo &= M; 20 ++lo; 22 lo += hi >> 15; 23 if (lo > M) { 24 lo &= M; 25 ++lo; 27 return (seed_ = (int32) lo); [all...] |
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/regex-re2/util/ |
H A D | random.cc | 15 uint32 lo = A * (int32)(seed_ & 0xFFFF); local 17 lo += (hi & 0x7FFF) << 16; 18 if (lo > M) { 19 lo &= M; 20 ++lo; 22 lo += hi >> 15; 23 if (lo > M) { 24 lo &= M; 25 ++lo; 27 return (seed_ = (int32) lo); [all...] |
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/compiler-rt/test/Unit/ppc/ |
H A D | DD.h | 10 double lo; member in struct:__anon16759::__anon16760
|
H A D | floatditf_test.c | 17 expected.lo = tests[i].lo; 20 if ((computed.hi != expected.hi) || (computed.lo != expected.lo)) 23 printf("\tExpected %La = ( %a , %a )\n", expected.ld, expected.hi, expected.lo); 24 printf("\tComputed %La = ( %a , %a )\n", computed.ld, computed.hi, computed.lo);
|
H A D | floatunditf_test.c | 17 expected.lo = tests[i].lo; 20 if ((computed.hi != expected.hi) || (computed.lo != expected.lo)) 23 printf("\tExpected %La = ( %a , %a )\n", expected.ld, expected.hi, expected.lo); 24 printf("\tComputed %La = ( %a , %a )\n", computed.ld, computed.hi, computed.lo);
|
/external/chromium_org/third_party/re2/re2/ |
H A D | unicode_groups.h | 27 uint16 lo; member in struct:re2::URange16 33 uint32 lo; member in struct:re2::URange32
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | Sk64.cpp | 11 #define shift_left(hi, lo) \ 12 hi = (hi << 1) | (lo >> 31); \ 13 lo <<= 1 15 #define shift_left_bits(hi, lo, bits) \ 17 hi = (hi << (bits)) | (lo >> (32 - (bits))); \ 18 lo <<= (bits) 25 uint32_t lo = fLo; local 30 hi = -hi - Sk32ToBool(lo); 31 lo = 0 - lo; 107 uint32_t lo = fLo; local 138 round_right_16(int32_t hi, uint32_t lo) argument 204 uint32_t lo = fLo; local 281 uint32_t lo = fLo; local [all...] |
H A D | SkBitmapProcState_filter.h | 32 uint32_t lo = (a00 & mask) * scale; local 36 lo += (a01 & mask) * scale; 40 lo += (a10 & mask) * scale; 43 lo += (a11 & mask) * xy; 46 *dstColor = ((lo >> 8) & mask) | (hi & ~mask); 62 uint32_t lo = (a00 & mask) * scale; local 66 lo += (a01 & mask) * scale; 70 lo += (a10 & mask) * scale; 73 lo += (a11 & mask) * xy; 76 lo 92 uint32_t lo = (color0 & mask) * scale; local 114 uint32_t lo = (color0 & mask) * scale; local [all...] |
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/regex-re2/re2/ |
H A D | unicode_groups.h | 27 uint16 lo; member in struct:re2::URange16 33 uint32 lo; member in struct:re2::URange32
|
/external/skia/src/core/ |
H A D | Sk64.cpp | 11 #define shift_left(hi, lo) \ 12 hi = (hi << 1) | (lo >> 31); \ 13 lo <<= 1 15 #define shift_left_bits(hi, lo, bits) \ 17 hi = (hi << (bits)) | (lo >> (32 - (bits))); \ 18 lo <<= (bits) 25 uint32_t lo = fLo; local 30 hi = -hi - Sk32ToBool(lo); 31 lo = 0 - lo; 107 uint32_t lo = fLo; local 138 round_right_16(int32_t hi, uint32_t lo) argument 204 uint32_t lo = fLo; local 281 uint32_t lo = fLo; local [all...] |
H A D | SkBitmapProcState_filter.h | 32 uint32_t lo = (a00 & mask) * scale; local 36 lo += (a01 & mask) * scale; 40 lo += (a10 & mask) * scale; 43 lo += (a11 & mask) * xy; 46 *dstColor = ((lo >> 8) & mask) | (hi & ~mask); 62 uint32_t lo = (a00 & mask) * scale; local 66 lo += (a01 & mask) * scale; 70 lo += (a10 & mask) * scale; 73 lo += (a11 & mask) * xy; 76 lo 92 uint32_t lo = (color0 & mask) * scale; local 114 uint32_t lo = (color0 & mask) * scale; local [all...] |
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/npapi/npspy/extern/nspr/ |
H A D | prlong.h | 83 #define LL_INIT(hi, lo) ((hi ## L << 32) + lo ## L) 85 #define LL_INIT(hi, lo) ((hi ## i64 << 32) + lo ## i64) 87 #define LL_INIT(hi, lo) ((hi ## LL << 32) + lo ## LL) 202 #define LL_INIT(hi, lo) {PR_INT32(lo), PR_INT32(hi)} 204 #define LL_INIT(hi, lo) {PR_INT32(hi), PR_INT32(lo)} [all...] |
/external/chromium_org/third_party/opus/src/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/chromium_org/third_party/npapi/npspy/extern/java/ |
H A D | jri_md.h | 282 juint lo, hi; member in struct:__anon12980 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/ |
H A D | fp_lib.h | 42 static inline void wideMultiply(rep_t a, rep_t b, rep_t *hi, rep_t *lo) { argument 45 *lo = product; 73 static inline void wideMultiply(rep_t a, rep_t b, rep_t *hi, rep_t *lo) { argument 79 // Sum terms that contribute to lo in a way that allows us to get the carry 82 *lo = r0 + (r1 << 32); 83 // Sum terms contributing to hi with the carry from lo 122 static inline void wideLeftShift(rep_t *hi, rep_t *lo, int count) { argument 123 *hi = *hi << count | *lo >> (typeWidth - count); 124 *lo = *lo << coun 127 wideRightShiftWithSticky(rep_t *hi, rep_t *lo, unsigned int count) argument [all...] |
/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)
|
/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/chromium_org/third_party/openssl/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...] |
/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...] |
/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...] |