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:bits_shift
(Results
1 - 3
of
3
) sorted by relevance
/third_party/node/deps/v8/src/bigint/
H
A
D
mul-fft.cc
95
int
bits_shift
, int K) {
in ShiftModFn_Large()
113
if (
bits_shift
== 0) {
in ShiftModFn_Large()
126
input[K - digit_shift - 1] >> (kDigitBits -
bits_shift
);
in ShiftModFn_Large()
129
digit_t summand = (d <<
bits_shift
) | input_carry;
in ShiftModFn_Large()
131
input_carry = d >> (kDigitBits -
bits_shift
);
in ShiftModFn_Large()
136
digit_t iK_part = (d <<
bits_shift
) | input_carry;
in ShiftModFn_Large()
137
digit_t iK_carry = d >> (kDigitBits -
bits_shift
);
in ShiftModFn_Large()
143
digit_t i0_part = d <<
bits_shift
;
in ShiftModFn_Large()
145
input_carry = d >> (kDigitBits -
bits_shift
);
in ShiftModFn_Large()
148
digit_t subtrahend = (d <<
bits_shift
) | input_carr
in ShiftModFn_Large()
94
ShiftModFn_Large(digit_t* result, const digit_t* input, int digit_shift, int
bits_shift
, int K)
ShiftModFn_Large()
argument
190
int
bits_shift
= power_of_two % kDigitBits;
ShiftModFn()
local
[all...]
H
A
D
bitwise.cc
138
int
bits_shift
= static_cast<int>(shift % kDigitBits);
in LeftShift()
local
142
if (
bits_shift
== 0) {
in LeftShift()
149
Z[i] = (d <<
bits_shift
) | carry;
in LeftShift()
150
carry = d >> (kDigitBits -
bits_shift
);
in LeftShift()
160
int
bits_shift
= static_cast<int>(shift % kDigitBits);
in RightShift_ResultLength()
local
169
const digit_t mask = (static_cast<digit_t>(1) <<
bits_shift
) - 1;
in RightShift_ResultLength()
181
// If
bits_shift
is non-zero, it frees up bits, preventing overflow.
in RightShift_ResultLength()
182
if (must_round_down &&
bits_shift
== 0) {
in RightShift_ResultLength()
198
int
bits_shift
= static_cast<int>(shift % kDigitBits);
in RightShift()
local
201
if (
bits_shift
in RightShift()
[all...]
H
A
D
bigint.h
371
int
bits_shift
= static_cast<int>(shift % kDigitBits);
in LeftShift_ResultLength()
local
372
bool grow =
bits_shift
!= 0 &&
in LeftShift_ResultLength()
373
(x_most_significant_digit >> (kDigitBits -
bits_shift
)) != 0;
in LeftShift_ResultLength()
Completed in 3 milliseconds