Home
last modified time | relevance | path

Searched refs:hi (Results 1 - 25 of 808) sorted by relevance

12345678910>>...33

/third_party/musl/porting/liteos_a/kernel/src/math/
H A Dsqrtl.c17 uint64_t hi; member
26 u.i2.hi = x.hi; in mkldbl()
28 u.i2.hi &= 0x0000ffffffffffff; in mkldbl()
29 u.i2.hi |= top << 48; in mkldbl()
46 r.hi = u.i2.hi; in asu128()
51 r.hi = u.i.m>>15; in asu128()
52 r.hi &= 0x0000ffffffffffff; in asu128()
53 r.hi | in asu128()
162 u128 hi = mul64_128(a.hi, b.hi); mul128() local
[all...]
H A Dfmal.c47 * of a long double. We maintain the invariant that "hi" stores the high-order
51 long double hi; member
65 ret.hi = a + b; in dd_add()
66 s = ret.hi - a; in dd_add()
67 ret.lo = (a - (ret.hi - s)) + (b - s); in dd_add()
89 u.f = sum.hi; in add_adjusted()
91 sum.hi = nextafterl(sum.hi, INFINITY * sum.lo); in add_adjusted()
93 return (sum.hi); in add_adjusted()
112 * lowest bit of sum.hi t in add_and_denormalize()
[all...]
/third_party/musl/src/math/
H A Dsqrtl.c17 uint64_t hi; member
26 u.i2.hi = x.hi; in mkldbl()
28 u.i2.hi &= 0x0000ffffffffffff; in mkldbl()
29 u.i2.hi |= top << 48; in mkldbl()
46 r.hi = u.i2.hi; in asu128()
51 r.hi = u.i.m>>15; in asu128()
52 r.hi &= 0x0000ffffffffffff; in asu128()
53 r.hi | in asu128()
162 u128 hi = mul64_128(a.hi, b.hi); mul128() local
[all...]
H A Dfmal.c47 * of a long double. We maintain the invariant that "hi" stores the high-order
51 long double hi; member
65 ret.hi = a + b; in dd_add()
66 s = ret.hi - a; in dd_add()
67 ret.lo = (a - (ret.hi - s)) + (b - s); in dd_add()
89 u.f = sum.hi; in add_adjusted()
91 sum.hi = nextafterl(sum.hi, INFINITY * sum.lo); in add_adjusted()
93 return (sum.hi); in add_adjusted()
112 * lowest bit of sum.hi t in add_and_denormalize()
[all...]
/third_party/protobuf/js/binary/
H A Darith.js50 * @param {number} hi The high 32 bits.
53 jspb.arith.UInt64 = function(lo, hi) {
63 this.hi = hi;
74 if (this.hi < other.hi || (this.hi == other.hi && this.lo < other.lo)) {
76 } else if (this.hi == other.hi
[all...]
/third_party/python/Modules/_decimal/libmpdec/literature/
H A Dumodarith.lisp253 (defun dw-reduce (hi lo m base)
254 (let* ((r1 (mod hi 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))))
294 (< hi base) (< lo base)
296 (natp hi) (natp lo)
297 (equal r1 (mod hi m)))
301 ("Subgoal 1''" :cases ((< (+ lo (* base (mod hi
[all...]
/third_party/python/Lib/
H A Dbisect.py4 def insort_right(a, x, lo=0, hi=None, *, key=None):
9 Optional args lo (default 0) and hi (default len(a)) bound the
13 lo = bisect_right(a, x, lo, hi)
15 lo = bisect_right(a, key(x), lo, hi, key=key)
19 def bisect_right(a, x, lo=0, hi=None, *, key=None):
26 Optional args lo (default 0) and hi (default len(a)) bound the
32 if hi is None:
33 hi = len(a)
37 while lo < hi:
38 mid = (lo + hi) //
[all...]
/third_party/python/Modules/_decimal/libmpdec/
H A Dumodarith.h103 dw_reduce(mpd_uint_t hi, mpd_uint_t lo, mpd_uint_t m) in dw_reduce() argument
107 _mpd_div_word(&w, &r1, hi, 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()
142 * a) hi, lo <- a * b # Calculate a * b.
144 * b) hi, lo <- R(hi, lo) # Reduce modulo p.
146 * c) Repeat step b) until 0 <= hi * 2**64 + lo < 2*p.
154 mpd_uint_t hi, lo, x, y; in x64_mulmod() local
157 _mpd_mul_words(&hi, in x64_mulmod()
328 mpd_uint_t hi, lo, q, r; std_mulmod() local
[all...]
H A Dbasearith.h92 * n2 := hi
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
108 /* (h, l) = if lo >= 2**63 then m'*(hi+1) else m'*hi */ in _mpd_div_words_r()
109 _mpd_mul_words(&h, &l, mprime_rdx, hi-n1_neg); in _mpd_div_words_r()
112 t = h + hi; in _mpd_div_words_r()
114 * 1) 0 <= 2**64*hi + lo - qest*MPD_RADIX < 2*MPD_RADIX in _mpd_div_words_r()
124 h += hi; in _mpd_div_words_r()
126 /* (h, l) = 2**64*hi + lo - (qest+1)*MPD_RADIX (mod 2**128) in _mpd_div_words_r()
142 _mpd_div_words_r(mpd_uint_t *q, mpd_uint_t *r, mpd_uint_t hi, mpd_uint_ argument
153 mpd_uint_t hi, lo; _mpd_singlemul() local
163 mpd_uint_t hi, lo; _mpd_mul_2_le2() local
[all...]
/third_party/typescript/tests/baselines/reference/
H A DcheckJsxChildrenProperty2.js15 let k = <Comp a={10} b="hi" />;
18 <Comp a={10} b="hi" children="Random" >
19 hi hi hi!
26 <Comp a={10} b="hi" {...o} >
27 hi hi hi!
32 <Comp a={10} b="hi">
[all...]
H A DcheckJsxChildrenProperty1.js15 let k = <Comp a={10} b="hi" children ="lol" />;
17 <Comp a={10} b="hi">
18 hi hi hi!
21 <Comp a={10} b="hi">
22 <div>hi hi hi!</div>
33 var k = <Comp a={10} b="hi" childre
[all...]
/third_party/python/Modules/
H A D_bisectmodule.c29 internal_bisect_right(PyObject *list, PyObject *item, Py_ssize_t lo, Py_ssize_t hi, in internal_bisect_right() argument
40 if (hi == -1) { in internal_bisect_right()
41 hi = PySequence_Size(list); in internal_bisect_right()
42 if (hi < 0) in internal_bisect_right()
45 while (lo < hi) { in internal_bisect_right()
49 mid = ((size_t)lo + hi) / 2; in internal_bisect_right()
66 hi = mid; in internal_bisect_right()
79 hi: Py_ssize_t(c_default='-1', accept={int, NoneType}) = None
89 Optional args lo (default 0) and hi (default len(a)) bound the
95 Py_ssize_t lo, Py_ssize_t hi, PyObjec in _bisect_bisect_right_impl()
94 _bisect_bisect_right_impl(PyObject *module, PyObject *a, PyObject *x, Py_ssize_t lo, Py_ssize_t hi, PyObject *key) _bisect_bisect_right_impl() argument
120 _bisect_insort_right_impl(PyObject *module, PyObject *a, PyObject *x, Py_ssize_t lo, Py_ssize_t hi, PyObject *key) _bisect_insort_right_impl() argument
155 internal_bisect_left(PyObject *list, PyObject *item, Py_ssize_t lo, Py_ssize_t hi, PyObject *key) internal_bisect_left() argument
221 _bisect_bisect_left_impl(PyObject *module, PyObject *a, PyObject *x, Py_ssize_t lo, Py_ssize_t hi, PyObject *key) _bisect_bisect_left_impl() argument
248 _bisect_insort_left_impl(PyObject *module, PyObject *a, PyObject *x, Py_ssize_t lo, Py_ssize_t hi, PyObject *key) _bisect_insort_left_impl() argument
[all...]
/third_party/vixl/test/aarch32/
H A Dtest-assembler-cond-rdlow-operand-imm8-in-it-block-t32.cc107 {{hi, r3, 187}, true, hi, "hi r3 187", "hi_r3_187"},
133 {{hi, r4, 176}, true, hi, "hi r4 176", "hi_r4_176"},
136 {{hi, r0, 145}, true, hi, "hi r0 145", "hi_r0_145"},
138 {{hi, r
[all...]
H A Dtest-assembler-cond-rd-operand-rn-low-registers-in-it-block-t32.cc607 {{hi, r0, r0}, true, hi, "hi r0 r0", "hi_r0_r0"},
608 {{hi, r0, r1}, true, hi, "hi r0 r1", "hi_r0_r1"},
609 {{hi, r0, r2}, true, hi, "hi r0 r2", "hi_r0_r2"},
610 {{hi, r
[all...]
H A Dtest-assembler-cond-rdlow-rnlow-operand-immediate-zero-in-it-block-t32.cc607 {{hi, r0, r0, 0}, true, hi, "hi r0 r0 0", "hi_r0_r0_0"},
608 {{hi, r0, r1, 0}, true, hi, "hi r0 r1 0", "hi_r0_r1_0"},
609 {{hi, r0, r2, 0}, true, hi, "hi r0 r2 0", "hi_r0_r2_0"},
610 {{hi, r
[all...]
H A Dtest-assembler-cond-rdlow-rnlow-operand-immediate-imm3-in-it-block-t32.cc117 {{hi, r3, r1, 0}, true, hi, "hi r3 r1 0", "hi_r3_r1_0"},
129 {{hi, r4, r7, 6}, true, hi, "hi r4 r7 6", "hi_r4_r7_6"},
130 {{hi, r1, r2, 5}, true, hi, "hi r1 r2 5", "hi_r1_r2_5"},
140 {{hi, r
[all...]
H A Dtest-assembler-cond-rd-operand-rn-in-it-block-t32.cc1896 {{hi, r0, r0}, true, hi, "hi r0 r0", "hi_r0_r0"},
1897 {{hi, r0, r1}, true, hi, "hi r0 r1", "hi_r0_r1"},
1898 {{hi, r0, r2}, true, hi, "hi r0 r2", "hi_r0_r2"},
1899 {{hi, r
[all...]
/third_party/benchmark/src/
H A Dbenchmark_register.h13 // Append the powers of 'mult' in the closed interval [lo, hi].
16 typename std::vector<T>::iterator AddPowers(std::vector<T>* dst, T lo, T hi, in AddPowers() argument
19 BM_CHECK_GE(hi, lo); in AddPowers()
27 for (T i = static_cast<T>(1); i <= hi; i *= static_cast<T>(mult)) { in AddPowers()
40 void AddNegatedPowers(std::vector<T>* dst, T lo, T hi, int mult) { in AddNegatedPowers() argument
41 // We negate lo and hi so we require that they cannot be equal to 'min'. in AddNegatedPowers()
43 BM_CHECK_GT(hi, std::numeric_limits<T>::min()); in AddNegatedPowers()
44 BM_CHECK_GE(hi, lo); in AddNegatedPowers()
45 BM_CHECK_LE(hi, 0); in AddNegatedPowers()
51 const auto hi_complement = static_cast<T>(-hi); in AddNegatedPowers()
60 AddRange(std::vector<T>* dst, T lo, T hi, int mult) AddRange() argument
[all...]
/third_party/node/deps/v8/tools/torque/vim-torque/syntax/
H A Dtorque.vim54 hi def link torqueAssert Statement
55 hi def link torqueAtom Constant
56 hi def link torqueBoolean Boolean
57 hi def link torqueBranch Conditional
58 hi def link torqueComment Comment
59 hi def link torqueConditional Conditional
60 hi def link torqueConstant Constant
61 hi def link torqueFunction Function
62 hi def link torqueKeyword Keyword
63 hi de
[all...]
/third_party/musl/src/math/x32/
H A Dexpl.s1 # exp(x) = 2^hi + 2^hi (2^lo - 1)
2 # where hi+lo = log2e*x with 128bit precision
33 # hi = log2e_hi*x
34 # 2^hi = exp2l(hi)
41 # if 2^hi == inf return 2^hi
48 # fpu stack: 2^hi x hi
[all...]
/third_party/musl/src/math/i386/
H A Dexpl.s1 # exp(x) = 2^hi + 2^hi (2^lo - 1)
2 # where hi+lo = log2e*x with 128bit precision
33 # hi = log2e_hi*x
34 # 2^hi = exp2l(hi)
42 # if 2^hi == inf return 2^hi
49 # fpu stack: 2^hi x hi
[all...]
/third_party/musl/src/math/x86_64/
H A Dexpl.s1 # exp(x) = 2^hi + 2^hi (2^lo - 1)
2 # where hi+lo = log2e*x with 128bit precision
33 # hi = log2e_hi*x
34 # 2^hi = exp2l(hi)
41 # if 2^hi == inf return 2^hi
48 # fpu stack: 2^hi x hi
[all...]
/third_party/node/deps/openssl/openssl/crypto/bn/asm/
H A Darmv4-gf2m.pl78 ($hi,$lo,$t0,$t1, $i0,$i1 )=map("r$_",(4..9),12);
111 mov $hi,$t1,lsr#29
116 eor $hi,$hi,$t0,lsr#26
121 eor $hi,$hi,$t1,lsr#23
126 eor $hi,$hi,$t0,lsr#20
131 eor $hi,$hi,
[all...]
/third_party/openssl/crypto/bn/asm/
H A Darmv4-gf2m.pl78 ($hi,$lo,$t0,$t1, $i0,$i1 )=map("r$_",(4..9),12);
111 mov $hi,$t1,lsr#29
116 eor $hi,$hi,$t0,lsr#26
121 eor $hi,$hi,$t1,lsr#23
126 eor $hi,$hi,$t0,lsr#20
131 eor $hi,$hi,
[all...]
/third_party/optimized-routines/math/test/
H A Dmathbench.c221 double hi; member
234 #define D(func, lo, hi) {#func, 'd', 0, lo, hi, {.d = func}},
235 #define F(func, lo, hi) {#func, 'f', 0, lo, hi, {.f = func}},
236 #define VD(func, lo, hi) {#func, 'd', 'v', lo, hi, {.vd = func}},
237 #define VF(func, lo, hi) {#func, 'f', 'v', lo, hi, {.vf = func}},
238 #define VND(func, lo, hi) {#fun
350 gen_linear(double lo, double hi) gen_linear() argument
357 genf_linear(double lo, double hi) genf_linear() argument
377 frand(double lo, double hi) frand() argument
384 gen_rand(double lo, double hi) gen_rand() argument
391 genf_rand(double lo, double hi) genf_rand() argument
535 bench1(const struct fun *f, int type, double lo, double hi) bench1() argument
592 bench(const struct fun *f, double lo, double hi, int type, int gen) bench() argument
687 double lo = 0, hi = 0; main() local
[all...]

Completed in 12 milliseconds

12345678910>>...33