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:BN_BITS4
(Results
1 - 6
of
6
) sorted by relevance
/third_party/node/deps/openssl/openssl/crypto/bn/
H
A
D
bn_word.c
30
if (w > ((BN_ULONG)1 <<
BN_BITS4
)) {
in BN_mod_word()
47
* We can assume here that | w <= ((BN_ULONG)1 <<
BN_BITS4
) | and so
in BN_mod_word()
48
* | ret < ((BN_ULONG)1 <<
BN_BITS4
) | and therefore the shifts here are
in BN_mod_word()
51
ret = ((ret <<
BN_BITS4
) | ((a->d[i] >>
BN_BITS4
) & BN_MASK2l)) % w;
in BN_mod_word()
52
ret = ((ret <<
BN_BITS4
) | (a->d[i] & BN_MASK2l)) % w;
in BN_mod_word()
H
A
D
bn_local.h
93
# define
BN_BITS4
32
macro
110
# define
BN_BITS4
32
macro
129
# define
BN_BITS4
16
macro
564
# define HBITS(a) (((a)>>
BN_BITS4
)&BN_MASK2l)
565
# define L2HBITS(a) (((a)<<
BN_BITS4
)&BN_MASK2)
599
h+=(m&BN_MASK2h1)>>(
BN_BITS4
-1); \
600
m =(m&BN_MASK2l)<<(
BN_BITS4
+1); \
H
A
D
bn_asm.c
227
dh = (d & BN_MASK2h) >>
BN_BITS4
;
in bn_div_words()
230
if ((h >>
BN_BITS4
) == dh)
in bn_div_words()
240
((tl) <= ((t <<
BN_BITS4
) | ((l & BN_MASK2h) >>
BN_BITS4
))))
in bn_div_words()
246
t = (tl >>
BN_BITS4
);
in bn_div_words()
247
tl = (tl <<
BN_BITS4
) & BN_MASK2h;
in bn_div_words()
262
ret = q <<
BN_BITS4
;
in bn_div_words()
263
h = ((h <<
BN_BITS4
) | (l >>
BN_BITS4
)) & BN_MASK2;
in bn_div_words()
264
l = (l & BN_MASK2l) <<
BN_BITS4
;
in bn_div_words()
[all...]
/third_party/openssl/crypto/bn/
H
A
D
bn_word.c
30
if (w > ((BN_ULONG)1 <<
BN_BITS4
)) {
in BN_mod_word()
47
* We can assume here that | w <= ((BN_ULONG)1 <<
BN_BITS4
) | and so
in BN_mod_word()
48
* | ret < ((BN_ULONG)1 <<
BN_BITS4
) | and therefore the shifts here are
in BN_mod_word()
51
ret = ((ret <<
BN_BITS4
) | ((a->d[i] >>
BN_BITS4
) & BN_MASK2l)) % w;
in BN_mod_word()
52
ret = ((ret <<
BN_BITS4
) | (a->d[i] & BN_MASK2l)) % w;
in BN_mod_word()
H
A
D
bn_local.h
93
# define
BN_BITS4
32
macro
110
# define
BN_BITS4
32
macro
129
# define
BN_BITS4
16
macro
564
# define HBITS(a) (((a)>>
BN_BITS4
)&BN_MASK2l)
565
# define L2HBITS(a) (((a)<<
BN_BITS4
)&BN_MASK2)
599
h+=(m&BN_MASK2h1)>>(
BN_BITS4
-1); \
600
m =(m&BN_MASK2l)<<(
BN_BITS4
+1); \
H
A
D
bn_asm.c
227
dh = (d & BN_MASK2h) >>
BN_BITS4
;
in bn_div_words()
230
if ((h >>
BN_BITS4
) == dh)
in bn_div_words()
240
((tl) <= ((t <<
BN_BITS4
) | ((l & BN_MASK2h) >>
BN_BITS4
))))
in bn_div_words()
246
t = (tl >>
BN_BITS4
);
in bn_div_words()
247
tl = (tl <<
BN_BITS4
) & BN_MASK2h;
in bn_div_words()
262
ret = q <<
BN_BITS4
;
in bn_div_words()
263
h = ((h <<
BN_BITS4
) | (l >>
BN_BITS4
)) & BN_MASK2;
in bn_div_words()
264
l = (l & BN_MASK2l) <<
BN_BITS4
;
in bn_div_words()
[all...]
Completed in 4 milliseconds