/external/syzkaller/vendor/golang.org/x/net/idna/ |
D | tables.go | 2377 {value: 0x0000, lo: 0x07}, 2378 {value: 0xe105, lo: 0x80, hi: 0x96}, 2379 {value: 0x0018, lo: 0x97, hi: 0x97}, 2380 {value: 0xe105, lo: 0x98, hi: 0x9e}, 2381 {value: 0x001f, lo: 0x9f, hi: 0x9f}, 2382 {value: 0x0008, lo: 0xa0, hi: 0xb6}, 2383 {value: 0x0018, lo: 0xb7, hi: 0xb7}, 2384 {value: 0x0008, lo: 0xb8, hi: 0xbf}, 2386 {value: 0x0000, lo: 0x10}, 2387 {value: 0x0008, lo: 0x80, hi: 0x80}, [all …]
|
/external/syzkaller/vendor/golang.org/x/text/unicode/norm/ |
D | tables9.0.0.go | 3521 {value: 0x0000, lo: 0x04}, 3522 {value: 0xa100, lo: 0xa8, hi: 0xa8}, 3523 {value: 0x8100, lo: 0xaf, hi: 0xaf}, 3524 {value: 0x8100, lo: 0xb4, hi: 0xb4}, 3525 {value: 0x8100, lo: 0xb8, hi: 0xb8}, 3527 {value: 0x0091, lo: 0x03}, 3528 {value: 0x46e2, lo: 0xa0, hi: 0xa1}, 3529 {value: 0x4714, lo: 0xaf, hi: 0xb0}, 3530 {value: 0xa000, lo: 0xb7, hi: 0xb7}, 3532 {value: 0x0000, lo: 0x01}, [all …]
|
D | tables10.0.0.go | 3534 {value: 0x0000, lo: 0x04}, 3535 {value: 0xa100, lo: 0xa8, hi: 0xa8}, 3536 {value: 0x8100, lo: 0xaf, hi: 0xaf}, 3537 {value: 0x8100, lo: 0xb4, hi: 0xb4}, 3538 {value: 0x8100, lo: 0xb8, hi: 0xb8}, 3540 {value: 0x0091, lo: 0x03}, 3541 {value: 0x46e2, lo: 0xa0, hi: 0xa1}, 3542 {value: 0x4714, lo: 0xaf, hi: 0xb0}, 3543 {value: 0xa000, lo: 0xb7, hi: 0xb7}, 3545 {value: 0x0000, lo: 0x01}, [all …]
|
/external/python/cpython3/Modules/_decimal/libmpdec/literature/ |
D | mulmod-64.txt | 21 (1) hi * 2**64 + lo = a * b 29 (3) R(hi, lo) = hi * z - hi + lo 35 a) Set (hi, lo) to the result of a * b. 37 b) Set (hi', lo') to the result of R(hi, lo). 39 c) Repeat step b) until 0 <= hi' * 2**64 + lo' < 2*p. 41 d) If the result is less than p, return lo'. Otherwise return lo' - p. 47 hi * 2**64 + lo == hi * z - hi + lo (mod p) 52 hi * 2**64 + lo = (2**64 - z + 1) * hi + z * hi - hi + lo 54 = p * hi + z * hi - hi + lo 56 == z * hi - hi + lo (mod p) [all …]
|
D | umodarith.lisp | 253 (defun dw-reduce (hi lo m base) 255 (r2 (mod (+ (* r1 base) lo) m))) 260 (< hi base) (< lo base) 262 (natp hi) (natp lo)) 263 (equal (dw-reduce hi lo m base) 264 (mod (+ (* hi base) lo) m)))) 275 (< lo base) (natp lo) 277 (< (+ lo (* base x)) (* base m))) 294 (< hi base) (< lo base) 296 (natp hi) (natp lo) [all …]
|
/external/e2fsprogs/intl/ |
D | Makefile.in | 145 bindtextdom.$lo \ 146 dcgettext.$lo \ 147 dgettext.$lo \ 148 gettext.$lo \ 149 finddomain.$lo \ 150 loadmsgcat.$lo \ 151 localealias.$lo \ 152 textdomain.$lo \ 153 l10nflist.$lo \ 154 explodename.$lo \ [all …]
|
/external/protobuf/js/binary/ |
D | arith.js | 53 jspb.arith.UInt64 = function(lo, hi) { argument 58 this.lo = lo; 74 if (this.hi < other.hi || (this.hi == other.hi && this.lo < other.lo)) { 76 } else if (this.hi == other.hi && this.lo == other.lo) { 90 var lo = (this.lo >>> 1) | ((this.hi & 1) << 31); 91 return new jspb.arith.UInt64(lo >>> 0, hi >>> 0); 100 var lo = this.lo << 1; 101 var hi = (this.hi << 1) | (this.lo >>> 31); 102 return new jspb.arith.UInt64(lo >>> 0, hi >>> 0); 120 return !!(this.lo & 1); [all …]
|
D | arith_test.js | 53 b.lo -= 1; 56 b.lo += 2; 59 b.lo = a.lo; 68 a.lo = 0; 73 a.lo = 0x00000001; 83 assertEquals(a.lo, 1); 87 assertEquals(orig.lo, 1); // original unmodified. 89 assertEquals(a.lo, 2); 92 assertEquals(a.lo, 4); 97 assertEquals(a.lo, 0x80000000); [all …]
|
/external/u-boot/arch/x86/cpu/ivybridge/ |
D | model_206ax.c | 43 if (msr.lo & (1 << 0)) { in enable_vmx() 55 msr.lo = 0; in enable_vmx() 76 msr.lo |= (1 << 2); in enable_vmx() 78 msr.lo |= (1 << 1); in enable_vmx() 172 if (!(msr.lo & PLATFORM_INFO_SET_TDP)) in set_power_limits() 177 power_unit = 2 << ((msr.lo & 0xf) - 1); in set_power_limits() 181 tdp = msr.lo & 0x7fff; in set_power_limits() 182 min_power = (msr.lo >> 16) & 0x7fff; in set_power_limits() 200 limit.lo = 0; in set_power_limits() 201 limit.lo |= tdp & PKG_POWER_LIMIT_MASK; in set_power_limits() [all …]
|
/external/python/cpython3/Lib/ |
D | bisect.py | 3 def insort_right(a, x, lo=0, hi=None): argument 12 if lo < 0: 16 while lo < hi: 17 mid = (lo+hi)//2 19 else: lo = mid+1 20 a.insert(lo, x) 22 def bisect_right(a, x, lo=0, hi=None): argument 33 if lo < 0: 37 while lo < hi: 38 mid = (lo+hi)//2 [all …]
|
/external/python/cpython2/Lib/ |
D | bisect.py | 3 def insort_right(a, x, lo=0, hi=None): argument 12 if lo < 0: 16 while lo < hi: 17 mid = (lo+hi)//2 19 else: lo = mid+1 20 a.insert(lo, x) 24 def bisect_right(a, x, lo=0, hi=None): argument 35 if lo < 0: 39 while lo < hi: 40 mid = (lo+hi)//2 [all …]
|
/external/u-boot/arch/x86/cpu/broadwell/ |
D | cpu.c | 112 perf_ctl.lo = (msr.lo & 0xff) << 8; in set_max_freq() 116 perf_ctl.lo = msr.lo & 0xff00; in set_max_freq() 123 ((perf_ctl.lo >> 8) & 0xff) * CPU_BCLK); in set_max_freq() 278 msr.lo &= ~0xff000000; in initialize_vr_config() 281 msr.lo |= (min_vid & 0xff) << 24; in initialize_vr_config() 286 msr.lo &= ~0xffff; in initialize_vr_config() 292 msr.lo |= 0x006a; /* 1.56V */ in initialize_vr_config() 294 msr.lo |= 0x006f; /* 1.60V */ in initialize_vr_config() 416 perf_ctl.lo = (msr.lo & 0xff) << 8; in set_max_ratio() 420 perf_ctl.lo = (msr.lo & 0xff) << 8; in set_max_ratio() [all …]
|
/external/pdfium/third_party/libopenjpeg20/ |
D | mct.c | 238 __m128i lo, hi; in opj_mct_encode_real() local 244 lo = r; in opj_mct_encode_real() 246 lo = _mm_mul_epi32(lo, ry); in opj_mct_encode_real() 248 lo = _mm_add_epi64(lo, mulround); in opj_mct_encode_real() 250 lo = _mm_srli_epi64(lo, 13); in opj_mct_encode_real() 252 y = _mm_blend_epi16(lo, hi, 0xCC); in opj_mct_encode_real() 254 lo = g; in opj_mct_encode_real() 256 lo = _mm_mul_epi32(lo, gy); in opj_mct_encode_real() 258 lo = _mm_add_epi64(lo, mulround); in opj_mct_encode_real() 260 lo = _mm_srli_epi64(lo, 13); in opj_mct_encode_real() [all …]
|
/external/python/cpython3/Modules/_decimal/libmpdec/ |
D | basearith.h | 99 _mpd_div_words_r(mpd_uint_t *q, mpd_uint_t *r, mpd_uint_t hi, mpd_uint_t lo) in _mpd_div_words_r() argument 105 n1_neg = (lo & (1ULL<<63)) ? MPD_UINT_MAX : 0; in _mpd_div_words_r() 107 n_adj = lo + (n1_neg & MPD_RADIX); in _mpd_div_words_r() 123 l = l + lo; in _mpd_div_words_r() 124 if (l < lo) h++; in _mpd_div_words_r() 143 _mpd_div_words_r(mpd_uint_t *q, mpd_uint_t *r, mpd_uint_t hi, mpd_uint_t lo) in _mpd_div_words_r() argument 145 _mpd_div_words(q, r, hi, lo, MPD_RADIX); in _mpd_div_words_r() 154 mpd_uint_t hi, lo; in _mpd_singlemul() local 156 _mpd_mul_words(&hi, &lo, u, v); in _mpd_singlemul() 157 _mpd_div_words_r(&w[1], &w[0], hi, lo); in _mpd_singlemul() [all …]
|
D | umodarith.h | 102 dw_reduce(mpd_uint_t hi, mpd_uint_t lo, mpd_uint_t m) in dw_reduce() argument 107 _mpd_div_words(&w, &r2, r1, lo, m); in dw_reduce() 118 dw_submod(mpd_uint_t a, mpd_uint_t hi, mpd_uint_t lo, mpd_uint_t m) in dw_submod() argument 122 r = dw_reduce(hi, lo, m); in dw_submod() 153 mpd_uint_t hi, lo, x, y; in x64_mulmod() local 156 _mpd_mul_words(&hi, &lo, a, b); in x64_mulmod() 164 x = lo - x; in x64_mulmod() 165 if (x > lo) hi--; in x64_mulmod() 168 lo = y + x; in x64_mulmod() 169 if (lo < y) hi++; in x64_mulmod() [all …]
|
D | basearith.c | 219 mpd_uint_t hi, lo; in _mpd_shortmul() local 227 _mpd_mul_words(&hi, &lo, u[i], v); in _mpd_shortmul() 228 lo = carry + lo; in _mpd_shortmul() 229 if (lo < carry) hi++; in _mpd_shortmul() 231 _mpd_div_words_r(&carry, &w[i], hi, lo); in _mpd_shortmul() 245 mpd_uint_t hi, lo; in _mpd_basemul() local 255 _mpd_mul_words(&hi, &lo, u[i], v[j]); in _mpd_basemul() 256 lo = w[i+j] + lo; in _mpd_basemul() 257 if (lo < w[i+j]) hi++; in _mpd_basemul() 258 lo = carry + lo; in _mpd_basemul() [all …]
|
/external/swiftshader/third_party/llvm-7.0/llvm/test/MC/Mips/ |
D | expr1.s | 10 # 32R2-EL: lw $4, %lo(foo)($4) # encoding: [A,A,0x84,0x8c] 11 # 32R2-EL: # fixup A - offset: 0, value: %lo(foo), kind: fixup_Mips_L… 13 # 32R2-EL: lui $1, %hi(foo+(%lo(8))) # encoding: [A,A,0x01,0x3c] 14 # 32R2-EL: # fixup A - offset: 0, value: %hi(foo+(%lo(8))), kind: … 16 # 32R2-EL: lw $4, %lo(foo+(%lo(8)))($1) # encoding: [A,A,0x24,0x8c] 17 # 32R2-EL: # fixup A - offset: 0, value: %lo(foo+(%lo(8))), kind: … 18 # 32R2-EL: lw $4, %lo(12+foo)($4) # encoding: [A,A,0x84,0x8c] 19 # 32R2-EL: # fixup A - offset: 0, value: %lo(12+foo), kind: fixup_Mip… 20 # 32R2-EL: lw $4, %lo(16+foo)($4) # encoding: [A,A,0x84,0x8c] 21 # 32R2-EL: # fixup A - offset: 0, value: %lo(16+foo), kind: fixup_Mip… [all …]
|
/external/arm-neon-tests/ |
D | ref_dsp.c | 51 int32_t lo, hi; in exec_dsp() local 320 lo = 0x9ABCDEF0; in exec_dsp() 321 fprintf(ref_file, "smlalbb(&%#x, &%#x, %#x, %#x) = ", lo, hi, svar1, svar2); in exec_dsp() 322 smlalbb(&lo, &hi, svar1, svar2); in exec_dsp() 323 fprintf(ref_file, "%#x%#x\n", hi, lo); in exec_dsp() 325 lo = 0x9ABCDEF0; in exec_dsp() 326 fprintf(ref_file, "smlalbt(&%#x, &%#x, %#x, %#x) = ", lo, hi, svar1, svar2); in exec_dsp() 327 smlalbt(&lo, &hi, svar1, svar2); in exec_dsp() 328 fprintf(ref_file, "%#x%#x\n", hi, lo); in exec_dsp() 330 lo = 0x9ABCDEF0; in exec_dsp() [all …]
|
/external/libcxx/test/std/containers/sequences/vector/vector.cons/ |
D | assign_move.pass.cpp | 27 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); in main() local 31 lo.push_back(i); in main() 34 assert(is_contiguous_container_asan_correct(lo)); in main() 37 assert(l2 == lo); in main() 39 assert(l2.get_allocator() == lo.get_allocator()); in main() 44 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); in main() local 46 assert(is_contiguous_container_asan_correct(lo)); in main() 50 lo.push_back(i); in main() 53 assert(is_contiguous_container_asan_correct(lo)); in main() 56 assert(l2 == lo); in main() [all …]
|
D | move_alloc.pass.cpp | 27 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); in main() local 29 assert(is_contiguous_container_asan_correct(lo)); in main() 33 lo.push_back(i); in main() 36 assert(is_contiguous_container_asan_correct(lo)); in main() 38 assert(l2 == lo); in main() 45 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); in main() local 47 assert(is_contiguous_container_asan_correct(lo)); in main() 51 lo.push_back(i); in main() 54 assert(is_contiguous_container_asan_correct(lo)); in main() 56 assert(l2 == lo); in main() [all …]
|
/external/llvm/test/MC/Mips/ |
D | expr1.s | 10 # 32R2-EL: lw $4, %lo(foo)($4) # encoding: [A,A,0x84,0x8c] 11 # 32R2-EL: # fixup A - offset: 0, value: %lo(foo), kind: fixup_Mips_L… 13 # 32R2-EL: lw $4, %lo(8+foo)($4) # encoding: [A,A,0x84,0x8c] 14 # 32R2-EL: # fixup A - offset: 0, value: %lo(8+foo), kind: fixup_Mips… 15 # 32R2-EL: lw $4, %lo(8+foo)($4) # encoding: [A,A,0x84,0x8c] 16 # 32R2-EL: # fixup A - offset: 0, value: %lo(8+foo), kind: fixup_Mips… 17 # 32R2-EL: lw $4, %lo(8+foo)($4) # encoding: [A,A,0x84,0x8c] 18 # 32R2-EL: # fixup A - offset: 0, value: %lo(8+foo), kind: fixup_Mips… 23 # 32R2-EL: lw $4, %lo(65542)($4) # encoding: [0x06,0x00,0x84,0x8c] 29 # MM-32R2-EL: lw $4, %lo(foo)($4) # encoding: [0x84'A',0xfc'A',0x00,0x00] [all …]
|
/external/python/cpython3/Modules/ |
D | _bisectmodule.c | 12 internal_bisect_right(PyObject *list, PyObject *item, Py_ssize_t lo, Py_ssize_t hi) in internal_bisect_right() argument 18 if (lo < 0) { in internal_bisect_right() 27 while (lo < hi) { in internal_bisect_right() 31 mid = ((size_t)lo + hi) / 2; in internal_bisect_right() 42 lo = mid + 1; in internal_bisect_right() 44 return lo; in internal_bisect_right() 51 Py_ssize_t lo = 0; in bisect_right() local 57 keywords, &list, &item, &lo, &hi)) in bisect_right() 59 index = internal_bisect_right(list, item, lo, hi); in bisect_right() 81 Py_ssize_t lo = 0; in insort_right() local [all …]
|
/external/python/cpython2/Modules/ |
D | _bisectmodule.c | 9 internal_bisect_right(PyObject *list, PyObject *item, Py_ssize_t lo, Py_ssize_t hi) in internal_bisect_right() argument 14 if (lo < 0) { in internal_bisect_right() 23 while (lo < hi) { in internal_bisect_right() 27 mid = ((size_t)lo + hi) / 2; in internal_bisect_right() 38 lo = mid + 1; in internal_bisect_right() 40 return lo; in internal_bisect_right() 47 Py_ssize_t lo = 0; in bisect_right() local 53 keywords, &list, &item, &lo, &hi)) in bisect_right() 55 index = internal_bisect_right(list, item, lo, hi); in bisect_right() 78 Py_ssize_t lo = 0; in insort_right() local [all …]
|
/external/arm-optimized-routines/test/ |
D | mathbench.c | 92 double lo; member 100 #define D(func, lo, hi) {#func, 'd', lo, hi, {.d = func}}, argument 101 #define F(func, lo, hi) {#func, 'f', lo, hi, {.f = func}}, argument 146 gen_linear (double lo, double hi) in gen_linear() argument 149 A[i] = (lo * (N - i) + hi * i) / N; in gen_linear() 153 genf_linear (double lo, double hi) in genf_linear() argument 156 Af[i] = (float)(lo * (N - i) + hi * i) / N; in genf_linear() 173 frand (double lo, double hi) in frand() argument 176 return lo + (hi - lo) * (asdouble (seed >> 12 | 0x3ffULL << 52) - 1.0); in frand() 180 gen_rand (double lo, double hi) in gen_rand() argument [all …]
|
/external/libcxx/test/std/containers/sequences/vector.bool/ |
D | assign_move.pass.cpp | 25 std::vector<bool, test_allocator<bool> > lo(test_allocator<bool>(5)); in main() 29 lo.push_back(i); in main() 33 assert(l2 == lo); in main() 35 assert(l2.get_allocator() == lo.get_allocator()); in main() 39 std::vector<bool, test_allocator<bool> > lo(test_allocator<bool>(5)); in main() 43 lo.push_back(i); in main() 47 assert(l2 == lo); in main() 53 std::vector<bool, other_allocator<bool> > lo(other_allocator<bool>(5)); in main() 57 lo.push_back(i); in main() 61 assert(l2 == lo); in main() [all …]
|