ESP-IDF
DIGIT_BIT
is only used within ESP-IDF.
Symbol previews are coming soon...
Symbols
loading...
Files
loading...
Summary
Syntax
Examples
References
Call Tree
Data Use
Class Tree
Override Tree
Implementations
Instances
Lifecycle
SourceVu
ESP-IDF Framework and Examples
ESP-IDF
DIGIT_BIT
DIGIT_BIT macro
Syntax
Show:
Summary
Declaration
from
libtommath.h:74
#define
DIGIT_BIT
28
Examples
References
from
examples
Code
Location
#define
DIGIT_BIT
28
libtommath.h:74
#define
MP_MASK
(
(
(
(
mp_digit
)
1
)
<
<
(
(
mp_digit
)
DIGIT_BIT
)
)
-
(
(
mp_digit
)
1
)
)
libtommath.h:83
#define
MP_WARRAY
(
1
<
<
(
sizeof
(
mp_word
)
*
CHAR_BIT
-
2
*
DIGIT_BIT
+
1
)
)
libtommath.h:114
u
=
*
tmpc
>
>
(
(
mp_digit
)
DIGIT_BIT
)
;
libtommath.h:262
u
=
*
tmpc
>
>
(
(
mp_digit
)
DIGIT_BIT
)
;
libtommath.h:277
if
(
b
>=
(
int
)
DIGIT_BIT
)
{
libtommath.h:1065
mp_rshd
(
c
,
b
/
DIGIT_BIT
)
;
libtommath.h:1066
D
=
(
mp_digit
)
(
b
%
DIGIT_BIT
)
;
libtommath.h:1070
shift
=
DIGIT_BIT
-
D
;
libtommath.h:1078
if
(
c
->
alloc
<
(
int
)
(
c
->
used
+
b
/
DIGIT_BIT
+
1
)
)
{
libtommath.h:1412
if
(
(
res
=
mp_grow
(
c
,
c
->
used
+
b
/
DIGIT_BIT
+
1
)
)
!=
MP_OKAY
)
{
libtommath.h:1413
if
(
b
>=
(
int
)
DIGIT_BIT
)
{
libtommath.h:1419
if
(
(
res
=
mp_lshd
(
c
,
b
/
DIGIT_BIT
)
)
!=
MP_OKAY
)
{
libtommath.h:1420
d
=
(
mp_digit
)
(
b
%
DIGIT_BIT
)
;
libtommath.h:1426
shift
=
DIGIT_BIT
-
d
;
libtommath.h:1435
r
=
(
a
->
used
-
1
)
*
DIGIT_BIT
;
libtommath.h:1581
if
(
b
>=
(
int
)
(
a
->
used
*
DIGIT_BIT
)
)
{
libtommath.h:1606
for
(
x
=
(
b
/
DIGIT_BIT
)
+
(
(
b
%
DIGIT_BIT
)
==
0
?
0
:
1
)
;
x
<
c
->
used
;
x
++
)
{
libtommath.h:1617
c
->
dp
[
b
/
DIGIT_BIT
]
&=
libtommath.h:1621
(
mp_digit
)
(
(
(
(
mp_digit
)
1
)
<
<
(
(
(
mp_digit
)
b
)
%
DIGIT_BIT
)
)
-
(
(
mp_digit
)
1
)
)
;
libtommath.h:1622
bitcnt
=
(
int
)
DIGIT_BIT
;
libtommath.h:2040
y
=
(
buf
>
>
(
mp_digit
)
(
DIGIT_BIT
-
1
)
)
&
1
;
libtommath.h:2044
if
(
(
res
=
mp_grow
(
a
,
b
/
DIGIT_BIT
+
1
)
)
!=
MP_OKAY
)
{
libtommath.h:2255
a
->
used
=
b
/
DIGIT_BIT
+
1
;
libtommath.h:2260
a
->
dp
[
b
/
DIGIT_BIT
]
=
(
(
mp_digit
)
1
)
<
<
(
b
%
DIGIT_BIT
)
;
libtommath.h:2263
if
(
(
res
=
mp_2expt
(
a
,
b
->
used
*
2
*
DIGIT_BIT
)
)
!=
MP_OKAY
)
{
libtommath.h:2277
if
(
(
(
unsigned
long
)
um
)
>
(
(
(
mp_digit
)
1
)
<
<
(
DIGIT_BIT
-
1
)
)
)
{
libtommath.h:2303
if
(
(
res
=
mp_mod_2d
(
x
,
DIGIT_BIT
*
(
um
+
1
)
,
x
)
)
!=
MP_OKAY
)
{
libtommath.h:2329
(
1
<
<
(
(
CHAR_BIT
*
sizeof
(
mp_word
)
)
-
(
2
*
DIGIT_BIT
)
)
)
)
{
libtommath.h:2384
u
=
(
mp_digit
)
(
r
>
>
(
(
mp_word
)
DIGIT_BIT
)
)
;
libtommath.h:2423
_W
=
_W
>
>
(
(
mp_word
)
DIGIT_BIT
)
;
libtommath.h:2502
u
=
(
mp_digit
)
(
r
>
>
(
(
mp_word
)
DIGIT_BIT
)
)
;
libtommath.h:2583
u
=
(
mp_digit
)
(
r
>
>
(
(
mp_word
)
DIGIT_BIT
)
)
;
libtommath.h:2604
u
=
(
mp_digit
)
(
r
>
>
(
(
mp_word
)
DIGIT_BIT
)
)
;
libtommath.h:2610
u
=
(
mp_digit
)
(
r
>
>
(
(
mp_word
)
DIGIT_BIT
)
)
;
libtommath.h:2671
Call Tree
from
examples
All items filtered out
All items filtered out
Data Use
from
examples
All items filtered out
All items filtered out
Class Tree
from
examples
All items filtered out
All items filtered out
Override Tree
from
examples
All items filtered out
All items filtered out
Implementations
from
examples
All items filtered out
All items filtered out
Instances
from
examples
Lifecycle
from
examples
All items filtered out
All items filtered out