Home
Sort by
last modified time
|
relevance
|
path
Repository(s)
applications
arkcompiler
base
build
commonlibrary
developtools
device
docs
domains
drivers
foundation
ide
interface
kernel
napi_generator
productdefine
test
third_party
vendor
select all
invert selection
clear
Full Search
Search through all text tokens(words,strings,identifiers,numbers) in index.
Definition
Only finds symbol definitions(where e.g a variable(function,...) is defined).
Symbol
Only finds symbol(e.g. methods classes,function,variables).
File Path
Path of the source file(use "/").If you want just exact path,enclose it in "".Source files end with: .jar/.bz2/.a/.h/.java...
History
History log comments.
Type
Any
Bzip(2)
C
Clojure
C#
C++
ELF
Erlang
Image file
Fortran
Golang
GZIP
Haskell
Jar
Java
Java class
JavaScript
Lisp
Lua
Pascal
Perl
PHP
Plain Text
PL/SQL
Python
Rust
Scala
Shell script
SQL
Tar
Tcl
Troff
UUEncoded
Visual Basic
XML
Zip
Type of analyzer used to filter file types include with selected(e.g. just C sources).
Help
Searched
refs:msd
(Results
1 - 12
of
12
) sorted by relevance
/third_party/node/deps/v8/src/bigint/
H
A
D
bitwise.cc
184
const bool rounding_can_overflow = digit_ismax(X.
msd
());
in RightShift_ResultLength()
233
digit_t
msd
= X[last];
in TruncateToNBits()
local
236
msd
= (
msd
<< drop) >> drop;
in TruncateToNBits()
238
Z[last] =
msd
;
in TruncateToNBits()
255
digit_t
msd
= last < X.len() ? X[last] : 0;
in TruncateAndSubFromPowerOfTwo()
local
257
Z[last] = digit_sub2(0,
msd
, borrow, &borrow);
in TruncateAndSubFromPowerOfTwo()
260
msd
= (
msd
<< drop) >> drop;
in TruncateAndSubFromPowerOfTwo()
262
digit_t result_msd = digit_sub2(minuend_msd,
msd
, borro
in TruncateAndSubFromPowerOfTwo()
[all...]
H
A
D
vector-arithmetic.h
47
inline bool IsDigitNormalized(Digits X) { return X.len() == 0 || X.
msd
() != 0; }
in IsDigitNormalized()
49
return (X.
msd
() >> (kDigitBits - 1)) == 1;
in IsBitNormalized()
57
return X.len() * kDigitBits - CountLeadingZeros(X.
msd
());
in BitLength()
H
A
D
tostring.cc
263
digit_t
msd
= digits_.
msd
();
264
int current = (digit | (
msd
<< available_bits)) & char_mask;
266
digit =
msd
>> (bits_per_char - available_bits);
344
leading_zero_shift_ = CountLeadingZeros(divisor_.
msd
());
H
A
D
div-barrett.cc
28
digit_t integer_part = X.
msd
();
in DcheckIntegerPartRange()
165
digit_t integer_part = W.
msd
() - U.
msd
() - borrow;
in InvertNewton()
H
A
D
div-helpers.h
41
int leading_zeros = CountLeadingZeros(original.
msd
());
in ShiftedDigits()
H
A
D
bigint.h
84
digit_t
msd
() {
in msd()
function in v8::bigint::Digits
95
while (len_ > 0 &&
msd
() == 0) len_--;
in Normalize()
99
BIGINT_H_DCHECK(len_ > 0 &&
msd
() == 0);
in TrimOne()
/third_party/icu/icu4c/source/i18n/
H
A
D
decNumberLocal.h
285
uByte *
msd
; /* -> most significant digit */
member
324
extern const uInt DECCOMBFROM[48]; /* exp+
msd
-> Combination */
/third_party/node/deps/icu-small/source/i18n/
H
A
D
decNumberLocal.h
285
uByte *
msd
; /* -> most significant digit */
member
324
extern const uInt DECCOMBFROM[48]; /* exp+
msd
-> Combination */
/third_party/skia/third_party/externals/icu/source/i18n/
H
A
D
decNumberLocal.h
285
uByte *
msd
; /* -> most significant digit */
member
324
extern const uInt DECCOMBFROM[48]; /* exp+
msd
-> Combination */
/third_party/python/Objects/
H
A
D
longobject.c
797
digit
msd
= v->ob_digit[ndigits - 1];
in _PyLong_NumBits()
local
801
msd_bits = bit_length_digit(
msd
);
in _PyLong_NumBits()
5694
digit
msd
;
in int_bit_length_impl()
local
5703
msd
= ((PyLongObject *)self)->ob_digit[ndigits-1];
in int_bit_length_impl()
5704
msd_bits = bit_length_digit(
msd
);
in int_bit_length_impl()
/third_party/node/deps/v8/src/objects/
H
A
D
bigint.cc
420
digit_t
msd
= static_cast<digit_t>(1) << (n % kDigitBits);
in Exponentiate()
local
421
result->set_digit(needed_digits - 1,
msd
);
in Exponentiate()
873
// 0-indexed position of {x}'s most significant bit within the {
msd
}.
in CompareToDouble()
/third_party/node/deps/v8/src/codegen/s390/
H
A
D
constants-s390.h
303
V(
msd
, MSD, 0xED3F) /* type = RXF MULTIPLY AND SUBTRACT (long HFP) */ \
Completed in 24 milliseconds