/third_party/python/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 …]
|
/third_party/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 | 52 b.lo -= 1; 55 b.lo += 2; 58 b.lo = a.lo; 67 a.lo = 0; 72 a.lo = 0x00000001; 82 expect(a.lo).toEqual(1); 86 expect(orig.lo).toEqual(1); // original unmodified. 88 expect(a.lo).toEqual(2); 91 expect(a.lo).toEqual(4); 96 expect(a.lo).toEqual(0x80000000); [all …]
|
/third_party/python/Lib/ |
D | bisect.py | 4 def insort_right(a, x, lo=0, hi=None, *, key=None): argument 13 lo = bisect_right(a, x, lo, hi) 15 lo = bisect_right(a, key(x), lo, hi, key=key) 16 a.insert(lo, x) 19 def bisect_right(a, x, lo=0, hi=None, *, key=None): argument 30 if lo < 0: 37 while lo < hi: 38 mid = (lo + hi) // 2 42 lo = mid + 1 44 while lo < hi: [all …]
|
/third_party/musl/libc-test/src/functionalext/locale/ |
D | langinfo.c | 33 char *lo = setlocale(LC_TIME, ""); in langinfo_0100() local 34 if (!lo) { in langinfo_0100() 35 EXPECT_PTRNE("nl_langinfo_0100", lo, NULL); in langinfo_0100() 38 lo = setlocale(LC_TIME, "zh_CN.UTF-8"); in langinfo_0100() 39 if (!lo) { in langinfo_0100() 40 EXPECT_PTRNE("nl_langinfo_0100", lo, NULL); in langinfo_0100() 55 char *lo = setlocale(LC_TIME, ""); in nl_langinfo_0200() local 56 if (!lo) { in nl_langinfo_0200() 57 EXPECT_PTRNE("nl_langinfo_0200", lo, NULL); in nl_langinfo_0200() 74 char *lo = setlocale(LC_TIME, ""); in nl_langinfo_0300() local [all …]
|
/third_party/musl/libc-test/src/functionalext/supplement/locale/ |
D | langinfo_sup.c | 33 char *lo = setlocale(LC_TIME, ""); in langinfo_0100() local 34 if (!lo) { in langinfo_0100() 35 EXPECT_PTRNE("nl_langinfo_0100", lo, NULL); in langinfo_0100() 38 lo = setlocale(LC_TIME, "zh_CN.UTF-8"); in langinfo_0100() 39 if (!lo) { in langinfo_0100() 40 EXPECT_PTRNE("nl_langinfo_0100", lo, NULL); in langinfo_0100() 55 char *lo = setlocale(LC_TIME, ""); in nl_langinfo_0200() local 56 if (!lo) { in nl_langinfo_0200() 57 EXPECT_PTRNE("nl_langinfo_0200", lo, NULL); in nl_langinfo_0200() 74 char *lo = setlocale(LC_TIME, ""); in nl_langinfo_0300() local [all …]
|
/third_party/openssl/crypto/bn/asm/ |
D | armv4-gf2m.pl | 75 ($hi,$lo,$t0,$t1, $i0,$i1 )=map("r$_",(4..9),12); 102 ldr $lo,[sp,$i0] @ tab[b & 0x7] 107 eor $lo,$lo,$t1,lsl#3 @ stall 112 eor $lo,$lo,$t0,lsl#6 117 eor $lo,$lo,$t1,lsl#9 122 eor $lo,$lo,$t0,lsl#12 127 eor $lo,$lo,$t1,lsl#15 132 eor $lo,$lo,$t0,lsl#18 137 eor $lo,$lo,$t1,lsl#21 143 eor $lo,$lo,$t0,lsl#24 [all …]
|
D | sparcv9-gf2m.pl | 39 ($lo,$hi,$b)=("%g1",$a8,"%o7"); $a=$lo; 99 srax $a1,63,$lo ! broadcast 63rd bit 103 and $b,$lo,$lo 134 srlx $lo,1,$hi 136 sllx $lo,63,$lo 150 xor $a1,$lo,$lo 154 xor @i[0],$lo,$lo 156 xor $a2,$lo,$lo 164 xor @T[0],$lo,$lo 175 xor @T[0],$lo,$lo [all …]
|
D | s390x-gf2m.pl | 63 ($lo,$hi,$b)=map("%r$_",(3..5)); $a=$lo; $mask=$a8; 76 srag $lo,$a1,63 # broadcast 63rd bit 82 ngr $lo,$b 116 srlg $hi,$lo,1 118 sllg $lo,$lo,63 132 xgr $lo,$a1 134 xgr $lo,$a2 136 xg $lo,$stdframe(@i[0],$sp) 147 xgr $lo,@T[0] 156 xgr $lo,@T[0] [all …]
|
/third_party/python/Modules/_decimal/libmpdec/ |
D | basearith.h | 98 _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 104 n1_neg = (lo & (1ULL<<63)) ? MPD_UINT_MAX : 0; in _mpd_div_words_r() 106 n_adj = lo + (n1_neg & MPD_RADIX); in _mpd_div_words_r() 122 l = l + lo; in _mpd_div_words_r() 123 if (l < lo) h++; in _mpd_div_words_r() 142 _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 144 _mpd_div_words(q, r, hi, lo, MPD_RADIX); in _mpd_div_words_r() 153 mpd_uint_t hi, lo; in _mpd_singlemul() local 155 _mpd_mul_words(&hi, &lo, u, v); in _mpd_singlemul() 156 _mpd_div_words_r(&w[1], &w[0], hi, lo); in _mpd_singlemul() [all …]
|
D | umodarith.h | 103 dw_reduce(mpd_uint_t hi, mpd_uint_t lo, mpd_uint_t m) in dw_reduce() argument 108 _mpd_div_words(&w, &r2, r1, lo, m); in dw_reduce() 119 dw_submod(mpd_uint_t a, mpd_uint_t hi, mpd_uint_t lo, mpd_uint_t m) in dw_submod() argument 123 r = dw_reduce(hi, lo, m); in dw_submod() 154 mpd_uint_t hi, lo, x, y; in x64_mulmod() local 157 _mpd_mul_words(&hi, &lo, a, b); in x64_mulmod() 165 x = lo - x; in x64_mulmod() 166 if (x > lo) hi--; in x64_mulmod() 169 lo = y + x; in x64_mulmod() 170 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 …]
|
D | crt.c | 47 mpd_uint_t hi1, hi2, lo; in _crt_mulP1P2_3() local 49 _mpd_mul_words(&hi1, &lo, LH_P1P2, v); in _crt_mulP1P2_3() 50 w[0] = lo; in _crt_mulP1P2_3() 52 _mpd_mul_words(&hi2, &lo, UH_P1P2, v); in _crt_mulP1P2_3() 53 lo = hi1 + lo; in _crt_mulP1P2_3() 54 if (lo < hi1) hi2++; in _crt_mulP1P2_3() 56 w[1] = lo; in _crt_mulP1P2_3() 147 mpd_uint_t hi, lo; in crt3() local 160 _mpd_mul_words(&hi, &lo, s, p1); in crt3() 161 lo = lo + a1; in crt3() [all …]
|
/third_party/protobuf/js/compatibility_tests/v3.1.0/binary/ |
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 …]
|
/third_party/protobuf/js/compatibility_tests/v3.0.0/binary/ |
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 …]
|
/third_party/boost/libs/icl/test/ |
D | test_interval_laws.hpp | 31 domain_type lo = icl::lower(itv); in check_border_containedness() local 41 BOOST_CHECK_EQUAL(icl::contains(itv, lo), true); in check_border_containedness() 43 BOOST_CHECK_EQUAL(icl::contains(itv, icl::interval<domain_type>:: closed(lo,up)), true); in check_border_containedness() 44 BOOST_CHECK_EQUAL(icl::contains(itv, icl::interval<domain_type>::right_open(lo,up)), true); in check_border_containedness() 45 BOOST_CHECK_EQUAL(icl::contains(itv, icl::interval<domain_type>:: left_open(lo,up)), true); in check_border_containedness() 46 BOOST_CHECK_EQUAL(icl::contains(itv, icl::interval<domain_type>:: open(lo,up)), true); in check_border_containedness() 50 BOOST_CHECK_EQUAL(icl::contains(itv, lo), true); in check_border_containedness() 52 BOOST_CHECK_EQUAL(icl::contains(itv, icl::interval<domain_type>:: closed(lo,up)), false); in check_border_containedness() 53 BOOST_CHECK_EQUAL(icl::contains(itv, icl::interval<domain_type>::right_open(lo,up)), true); in check_border_containedness() 54 BOOST_CHECK_EQUAL(icl::contains(itv, icl::interval<domain_type>:: left_open(lo,up)), false); in check_border_containedness() [all …]
|
/third_party/python/Modules/ |
D | _bisectmodule.c | 19 internal_bisect_right(PyObject *list, PyObject *item, Py_ssize_t lo, Py_ssize_t hi, in internal_bisect_right() argument 26 if (lo < 0) { in internal_bisect_right() 35 while (lo < hi) { in internal_bisect_right() 39 mid = ((size_t)lo + hi) / 2; in internal_bisect_right() 58 lo = mid + 1; in internal_bisect_right() 60 return lo; in internal_bisect_right() 85 Py_ssize_t lo, Py_ssize_t hi, PyObject *key) in _bisect_bisect_right_impl() argument 88 return internal_bisect_right(a, x, lo, hi, key); in _bisect_bisect_right_impl() 111 Py_ssize_t lo, Py_ssize_t hi, PyObject *key) in _bisect_insort_right_impl() argument 118 index = internal_bisect_right(a, x, lo, hi, key); in _bisect_insort_right_impl() [all …]
|
/third_party/gettext/gettext-runtime/intl/ |
D | Makefile.am | 339 bindtextdom.lo: $(srcdir)/bindtextdom.c 341 dcgettext.lo: $(srcdir)/dcgettext.c 343 dgettext.lo: $(srcdir)/dgettext.c 345 gettext.lo: $(srcdir)/gettext.c 347 finddomain.lo: $(srcdir)/finddomain.c 349 hash-string.lo: $(srcdir)/hash-string.c 351 loadmsgcat.lo: $(srcdir)/loadmsgcat.c 353 localealias.lo: $(srcdir)/localealias.c 355 textdomain.lo: $(srcdir)/textdomain.c 357 l10nflist.lo: $(srcdir)/l10nflist.c [all …]
|
/third_party/benchmark/src/ |
D | benchmark_register.h | 15 typename std::vector<T>::iterator AddPowers(std::vector<T>* dst, T lo, T hi, in AddPowers() argument 17 BM_CHECK_GE(lo, 0); in AddPowers() 18 BM_CHECK_GE(hi, lo); in AddPowers() 27 if (i >= lo) { in AddPowers() 39 void AddNegatedPowers(std::vector<T>* dst, T lo, T hi, int mult) { in AddNegatedPowers() argument 41 BM_CHECK_GT(lo, std::numeric_limits<T>::min()); in AddNegatedPowers() 43 BM_CHECK_GE(hi, lo); in AddNegatedPowers() 49 const auto lo_complement = static_cast<T>(-lo); in AddNegatedPowers() 59 void AddRange(std::vector<T>* dst, T lo, T hi, int mult) { in AddRange() argument 63 BM_CHECK_GE(hi, lo); in AddRange() [all …]
|
/third_party/node/deps/cares/src/lib/ |
D | Makefile.in | 163 am__objects_1 = libcares_la-ares__addrinfo2hostent.lo \ 164 libcares_la-ares__addrinfo_localhost.lo \ 165 libcares_la-ares__close_sockets.lo \ 166 libcares_la-ares__get_hostent.lo \ 167 libcares_la-ares__parse_into_addrinfo.lo \ 168 libcares_la-ares__readaddrinfo.lo \ 169 libcares_la-ares__sortaddrinfo.lo \ 170 libcares_la-ares__read_line.lo libcares_la-ares__timeval.lo \ 171 libcares_la-ares_android.lo libcares_la-ares_cancel.lo \ 172 libcares_la-ares_data.lo libcares_la-ares_destroy.lo \ [all …]
|
/third_party/ltp/testcases/kernel/syscalls/fork/ |
D | fork05.c | 142 int lo; in main() local 161 asm volatile ("movl %%fs:0, %0":"=r" (lo)); in main() 162 tst_resm(TINFO, "a = %d", lo); in main() 164 asm volatile ("pushl %%fs; popl %0":"=q" (lo)); in main() 165 tst_resm(TINFO, "%%fs = %#06hx", lo); in main() 172 asm volatile ("pushl %%fs; popl %0":"=q" (lo)); in main() 173 tst_resm(TINFO, "%%fs = %#06hx", lo); in main() 175 asm volatile ("movl %%fs:0, %0":"=r" (lo)); in main() 176 tst_resm(TINFO, "a = %d", lo); in main() 178 if (lo != 99) in main() [all …]
|
/third_party/boost/boost/math/special_functions/ |
D | erf.hpp | 303 T hi, lo; in erf_imp() local 307 lo = z - hi; in erf_imp() 309 T err_sqr = ((hi * hi - sq) + 2 * hi * lo) + lo * lo; in erf_imp() 336 T hi, lo; in erf_imp() local 340 lo = z - hi; in erf_imp() 342 T err_sqr = ((hi * hi - sq) + 2 * hi * lo) + lo * lo; in erf_imp() 371 T hi, lo; in erf_imp() local 375 lo = z - hi; in erf_imp() 377 T err_sqr = ((hi * hi - sq) + 2 * hi * lo) + lo * lo; in erf_imp() 496 T hi, lo; in erf_imp() local [all …]
|
/third_party/optimized-routines/math/test/ |
D | mathbench.c | 220 double lo; member 234 #define D(func, lo, hi) {#func, 'd', 0, lo, hi, {.d = func}}, argument 235 #define F(func, lo, hi) {#func, 'f', 0, lo, hi, {.f = func}}, argument 236 #define VD(func, lo, hi) {#func, 'd', 'v', lo, hi, {.vd = func}}, argument 237 #define VF(func, lo, hi) {#func, 'f', 'v', lo, hi, {.vf = func}}, argument 238 #define VND(func, lo, hi) {#func, 'd', 'n', lo, hi, {.vnd = func}}, argument 239 #define VNF(func, lo, hi) {#func, 'f', 'n', lo, hi, {.vnf = func}}, argument 350 gen_linear (double lo, double hi) in gen_linear() argument 353 A[i] = (lo * (N - i) + hi * i) / N; in gen_linear() 357 genf_linear (double lo, double hi) in genf_linear() argument [all …]
|
/third_party/openssl/crypto/modes/ |
D | gcm128.c | 31 u64 T = U64(0xe100000000000000) & (0-(V.lo&1)); \ 32 V.lo = (V.hi<<63)|(V.lo>>1); \ 36 u32 T = 0xe1000000U & (0-(u32)(V.lo&1)); \ 37 V.lo = (V.hi<<63)|(V.lo>>1); \ 84 Htable[0].lo = 0; in gcm_init_8bit() 86 V.lo = H[1]; in gcm_init_8bit() 97 Hi[j].lo = H0.lo ^ Htable[j].lo; in gcm_init_8bit() 180 Z.lo ^= Htable[n].lo; in gcm_gmult_8bit() 187 rem = (size_t)Z.lo & 0xff; in gcm_gmult_8bit() 188 Z.lo = (Z.hi << 56) | (Z.lo >> 8); in gcm_gmult_8bit() [all …]
|