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:divisorLen
(Results
1 - 1
of
1
) sorted by relevance
/arkcompiler/ets_runtime/ecmascript/
H
A
D
js_bigint.cpp
1380
uint32_t
divisorLen
= divisor->GetLength();
in DivideAndRemainderWithBigintDivisor()
local
1382
uint32_t quotientLen = dividend->GetLength() -
divisorLen
;
in DivideAndRemainderWithBigintDivisor()
1390
ASSERT(
divisorLen
> 0);
in DivideAndRemainderWithBigintDivisor()
1391
uint32_t leadingZeros = base::CountLeadingZeros(divisor->GetDigit(
divisorLen
- 1));
in DivideAndRemainderWithBigintDivisor()
1395
JSHandle<BigInt> qv = CreateBigint(thread,
divisorLen
+ 1);
in DivideAndRemainderWithBigintDivisor()
1397
uint32_t vHighest = v->GetDigit(
divisorLen
- 1);
in DivideAndRemainderWithBigintDivisor()
1399
uint32_t currentUHighest = u->GetDigit(i +
divisorLen
);
in DivideAndRemainderWithBigintDivisor()
1401
uint32_t q = DivideAndRemainder(currentUHighest, u->GetDigit(i +
divisorLen
- 1), vHighest, r);
in DivideAndRemainderWithBigintDivisor()
1407
uint32_t vHighestNext = v->GetDigit(
divisorLen
- 2); // 2 : Get the second most significant bit
in DivideAndRemainderWithBigintDivisor()
1408
uint32_t currentUHighestNext = u->GetDigit(i +
divisorLen
in DivideAndRemainderWithBigintDivisor()
[all...]
Completed in 6 milliseconds