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:biL
(Results
1 - 6
of
6
) sorted by relevance
/third_party/mbedtls/library/
H
A
D
bignum_core.c
39
mbedtls_mpi_uint mask = (mbedtls_mpi_uint) 1 << (
biL
- 1);
in mbedtls_mpi_core_clz()
41
for (j = 0; j <
biL
; j++) {
in mbedtls_mpi_core_clz()
60
j =
biL
- mbedtls_mpi_core_clz(A[i]);
in mbedtls_mpi_core_bitlen()
61
return (i *
biL
) + j;
in mbedtls_mpi_core_bitlen()
336
v0 = count /
biL
;
in mbedtls_mpi_core_shift_r()
337
v1 = count & (
biL
- 1);
in mbedtls_mpi_core_shift_r()
362
r1 = X[i - 1] << (
biL
- v1);
in mbedtls_mpi_core_shift_r()
376
v0 = count / (
biL
);
in mbedtls_mpi_core_shift_l()
377
v1 = count & (
biL
- 1);
in mbedtls_mpi_core_shift_l()
397
r1 = X[i] >> (
biL
in mbedtls_mpi_core_shift_l()
[all...]
H
A
D
bignum.c
362
/* Take care to handle the most negative value (-2^(
biL
-1)) correctly.
in mpi_sint_abs()
371
#define TO_SIGN(x) ((mbedtls_mpi_sint) (((mbedtls_mpi_uint) x) >> (
biL
- 1)) * -2 + 1)
396
if (X->n *
biL
<= pos) {
in mbedtls_mpi_get_bit()
400
return (X->p[pos /
biL
] >> (pos %
biL
)) & 0x01;
in mbedtls_mpi_get_bit()
409
size_t off = pos /
biL
;
in mbedtls_mpi_set_bit()
410
size_t idx = pos %
biL
;
in mbedtls_mpi_set_bit()
416
if (X->n *
biL
<= pos) {
in mbedtls_mpi_set_bit()
452
return i *
biL
+ mbedtls_mpi_uint_ctz(X->p[i]);
in mbedtls_mpi_lsb()
458
for (size_t j = 0; j <
biL
;
in mbedtls_mpi_lsb()
[all...]
H
A
D
bignum_core.h
10
* bound that's of the form 2^n-1 where n is a multiple of #
biL
.
11
* These can be thought of integers written in base 2^#
biL
with a fixed
80
#define
biL
(ciL << 3) /** bits in limb */
macro
87
#define BITS_TO_LIMBS(i) ((i) /
biL
+ ((i) %
biL
!= 0))
317
* This function operates modulo `2^(
biL
*limbs)` and returns the carry
327
* \return 1 if `A + B >= 2^(
biL
*limbs)`, 0 otherwise.
346
* This function operates modulo `2^(
biL
*limbs)`.
362
* \return 1 if `X + cond * A >= 2^(
biL
*limbs)`, 0 otherwise.
373
* This function operates modulo `2^(
biL
*limb
[all...]
H
A
D
bn_mul.h
1038
r1 = (mbedtls_mpi_uint)( r >>
biL
); \
H
A
D
ecp_curves_new.c
5347
/* Split X as X0 + 2^P521_WIDTH X1 and compute X0 + 2^(
biL
- 9) X1.
in mbedtls_ecp_mod_p521_raw()
5348
* (We are using that 2^P521_WIDTH = 2^(512 +
biL
) and that
in mbedtls_ecp_mod_p521_raw()
5349
* 2^(512 +
biL
) X1 = 2^(
biL
- 9) X1 mod P521.)
in mbedtls_ecp_mod_p521_raw()
5355
* X0 < 2^P521_WIDTH = 2^(512 +
biL
) and X1 < 2^(P521_WIDTH-
biL
) = 2^512
in mbedtls_ecp_mod_p521_raw()
5357
* X0 + 2^(
biL
- 9) X1 < 2^(512 +
biL
) + 2^(512 +
biL
- 9)
in mbedtls_ecp_mod_p521_raw()
5358
* which in turn is less than 2 * 2^(512 +
biL
)
in mbedtls_ecp_mod_p521_raw()
[all...]
H
A
D
ecp_curves.c
4960
MBEDTLS_MPI_CHK(mbedtls_mpi_grow(N, (b) * 2 /
biL
+ 1)); \
Completed in 26 milliseconds