/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...] |
/external/mockito/cglib-and-asm/src/org/mockito/cglib/util/ |
H A D | SorterTemplate.java | 27 protected void quickSort(int lo, int hi) { argument 28 quickSortHelper(lo, hi); 29 insertionSort(lo, hi); 32 private void quickSortHelper(int lo, int hi) { argument 34 int diff = hi - lo; 38 int i = (hi + lo) / 2; 39 if (compare(lo, i) > 0) { 40 swap(lo, i); 42 if (compare(lo, hi) > 0) { 43 swap(lo, h 75 insertionSort(int lo, int hi) argument 87 mergeSort(int lo, int hi) argument 99 merge(int lo, int pivot, int hi, int len1, int len2) argument 128 rotate(int lo, int mid, int hi) argument 144 lower(int lo, int hi, int val) argument 159 upper(int lo, int hi, int val) argument [all...] |
/external/compiler-rt/test/builtins/Unit/ppc/ |
H A D | DD.h | 10 double lo; member in struct:__anon19657::__anon19658
|
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/libcxx/test/containers/sequences/vector.bool/ |
H A D | move.pass.cpp | 24 std::vector<bool, test_allocator<bool> > lo(test_allocator<bool>(5)); 28 lo.push_back(i); 31 assert(l2 == lo); 33 assert(l2.get_allocator() == lo.get_allocator()); 37 std::vector<bool, other_allocator<bool> > lo(other_allocator<bool>(5)); 41 lo.push_back(i); 44 assert(l2 == lo); 46 assert(l2.get_allocator() == lo.get_allocator()); 51 std::vector<bool, min_allocator<bool> > lo(min_allocator<bool>{}); 55 lo [all...] |
H A D | assign_move.pass.cpp | 24 std::vector<bool, test_allocator<bool> > lo(test_allocator<bool>(5)); 28 lo.push_back(i); 32 assert(l2 == lo); 34 assert(l2.get_allocator() == lo.get_allocator()); 38 std::vector<bool, test_allocator<bool> > lo(test_allocator<bool>(5)); 42 lo.push_back(i); 46 assert(l2 == lo); 52 std::vector<bool, other_allocator<bool> > lo(other_allocator<bool>(5)); 56 lo.push_back(i); 60 assert(l2 == lo); [all...] |
H A D | move_alloc.pass.cpp | 24 std::vector<bool, test_allocator<bool> > lo(test_allocator<bool>(5)); 28 lo.push_back(i); 31 assert(l2 == lo); 37 std::vector<bool, test_allocator<bool> > lo(test_allocator<bool>(5)); 41 lo.push_back(i); 44 assert(l2 == lo); 50 std::vector<bool, other_allocator<bool> > lo(other_allocator<bool>(5)); 54 lo.push_back(i); 57 assert(l2 == lo); 64 std::vector<bool, min_allocator<bool> > lo(min_allocato [all...] |
/external/qemu/include/qemu/ |
H A D | int128.h | 11 uint64_t lo; member in struct:Int128 23 return a.lo; 43 return (Int128) { a.lo & b.lo, a.hi & b.hi }; 56 return (Int128) { (a.lo >> n) | (a.hi << (64 - n)), h }; 62 uint64_t lo = a.lo + b.lo; local 64 /* a.lo <= a.lo 75 uint64_t lo = -a.lo; local [all...] |
/external/fio/lib/ |
H A D | getopt_long.c | 75 const struct option *lo; local 86 for (lo = longopts; lo->name; lo++) { 87 if ((opt_end = option_matches(carg+2, lo->name))) 94 *longindex = lo-longopts; 97 if (lo->has_arg) 101 } else if (lo->has_arg == 1) { 107 if (lo->flag) { 108 *lo [all...] |
/external/libcxx/test/containers/sequences/list/list.cons/ |
H A D | move.pass.cpp | 25 std::list<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::list<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()); 52 std::list<MoveOnly, min_allocator<MoveOnly> > lo(min_allocator<MoveOnly>{}); 56 lo [all...] |
H A D | assign_move.pass.cpp | 25 std::list<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); 29 lo.push_back(i); 33 assert(l2 == lo); 35 assert(l2.get_allocator() == lo.get_allocator()); 39 std::list<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); 43 lo.push_back(i); 47 assert(l2 == lo); 53 std::list<MoveOnly, other_allocator<MoveOnly> > lo(other_allocator<MoveOnly>(5)); 57 lo.push_back(i); 61 assert(l2 == lo); [all...] |
/external/compiler-rt/lib/builtins/arm/ |
H A D | sync_fetch_and_umin_4.S | 17 #define umin_4(rD, rN, rM) MINMAX_4(rD, rN, rM, lo)
|
/external/libcxx/test/containers/sequences/vector/vector.cons/ |
H A D | assign_move.pass.cpp | 25 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); 29 lo.push_back(i); 33 assert(l2 == lo); 35 assert(l2.get_allocator() == lo.get_allocator()); 39 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); 43 lo.push_back(i); 47 assert(l2 == lo); 53 std::vector<MoveOnly, other_allocator<MoveOnly> > lo(other_allocator<MoveOnly>(5)); 57 lo.push_back(i); 61 assert(l2 == lo); [all...] |
/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/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/chromium_org/third_party/skia/src/core/ |
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...] |
/external/chromium_org/v8/test/mjsunit/ |
H A D | double-intrinsics.js | 7 function assertDoubleBits(hi, lo, x) { 9 lo = lo | 0; 10 assertEquals(x, %_ConstructDouble(hi, lo)); 12 assertEquals(lo, %_DoubleLo(x));
|
/external/fonttools/Lib/fontTools/misc/ |
H A D | fixedTools.py | 33 lo = fmt % (value - eps) 36 length = min(len(lo), len(hi)) 38 if lo[i] != hi[i]: 40 out.append(lo[i]) 43 out.append(max(lo[outlen], hi[outlen]))
|
/external/fonttools/Tools/fontTools/misc/ |
H A D | fixedTools.py | 33 lo = fmt % (value - eps) 36 length = min(len(lo), len(hi)) 38 if lo[i] != hi[i]: 40 out.append(lo[i]) 43 out.append(max(lo[outlen], hi[outlen]))
|
/external/skia/src/core/ |
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...] |
/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;
|