mbedtls_mpi::n - syntax, references, description

References

Code

Location

Referrer

size_t n; /*!< total # of limbs */

bignum.h:188

X->n = 0;

bignum.c:94

mbedtls_mpi_init()

mbedtls_mpi_zeroize( X->p, X->n );

X->n = 0;

if( X->n < nblimbs )

memcpy( p, X->p, X->n * ciL );

bignum.c:135

mbedtls_mpi_grow()

mbedtls_mpi_zeroize( X->p, X->n );

X->n = nblimbs;

if( X->n <= nblimbs )

bignum.c:161

mbedtls_mpi_shrink()

for( i = X->n - 1; i > 0; i-- )

bignum.c:164

mbedtls_mpi_shrink()

mbedtls_mpi_zeroize( X->p, X->n );

X->n = i;

for( i = Y->n - 1; i > 0; i-- )

if( X->n < i )

memset( X->p + i, 0, ( X->n - i ) * ciL );

bignum.c:220

mbedtls_mpi_copy()

MBEDTLS_MPI_CHK( mbedtls_mpi_grow( X, Y->n ) );

bignum.c:259

mbedtls_mpi_safe_cond_assign()

for( i = 0; i < Y->n; i++ )

bignum.c:263

mbedtls_mpi_safe_cond_assign()

for( ; i < X->n; i++ )

bignum.c:266

mbedtls_mpi_safe_cond_assign()

MBEDTLS_MPI_CHK( mbedtls_mpi_grow( X, Y->n ) );

bignum.c:293

mbedtls_mpi_safe_cond_swap()

MBEDTLS_MPI_CHK( mbedtls_mpi_grow( Y, X->n ) );

bignum.c:294

mbedtls_mpi_safe_cond_swap()

for( i = 0; i < X->n; i++ )

bignum.c:301

mbedtls_mpi_safe_cond_swap()

memset( X->p, 0, X->n * ciL );

bignum.c:321

mbedtls_mpi_lset()

if( X->n * biL <= pos )

bignum.c:338

mbedtls_mpi_get_bit()

if( X->n * biL <= pos )

bignum.c:361

mbedtls_mpi_set_bit()

for( i = 0; i < X->n; i++ )

if( X->n == 0 )

for( i = X->n - 1; i > 0; i-- )

bignum.c:421

mbedtls_mpi_bitlen()

for( i = X->n, k = 0; i > 0; i-- )

bignum.c:620

mbedtls_mpi_write_string()

if( X->n != limbs )

bignum.c:838

mbedtls_mpi_read_binary()

stored_bytes = X->n * ciL;

bignum.c:875

mbedtls_mpi_write_binary()

if( X->n * biL < i )

bignum.c:922

mbedtls_mpi_shift_l()

for( i = X->n; i > v0; i-- )

bignum.c:932

mbedtls_mpi_shift_l()

for( i = v0; i < X->n; i++ )

bignum.c:944

mbedtls_mpi_shift_l()

if( v0 > X->n || ( v0 == X->n && v1 > 0 ) )

bignum.c:970

mbedtls_mpi_shift_r()

for( i = 0; i < X->n - v0; i++ )

bignum.c:978

mbedtls_mpi_shift_r()

for( ; i < X->n; i++ )

bignum.c:981

mbedtls_mpi_shift_r()

for( i = X->n; i > 0; i-- )

bignum.c:990

mbedtls_mpi_shift_r()

for( i = X->n; i > 0; i-- )

bignum.c:1011

mbedtls_mpi_cmp_abs()

for( j = Y->n; j > 0; j-- )

bignum.c:1015

mbedtls_mpi_cmp_abs()

for( i = X->n; i > 0; i-- )

bignum.c:1043

mbedtls_mpi_cmp_mpi()

for( j = Y->n; j > 0; j-- )

bignum.c:1047

mbedtls_mpi_cmp_mpi()

Y.n = 1;

bignum.c:1080

mbedtls_mpi_cmp_int()

for( j = B->n; j > 0; j-- )

bignum.c:1111

mbedtls_mpi_add_abs()

if( i >= X->n )

bignum.c:1131

mbedtls_mpi_add_abs()

for( n = B->n; n > 0; n-- )

bignum.c:1199

mbedtls_mpi_sub_abs()

_B.n = 1;

bignum.c:1294

mbedtls_mpi_add_int()

_B.n = 1;

bignum.c:1312

mbedtls_mpi_sub_int()

for( i = A->n; i > 0; i-- )

bignum.c:1407

mbedtls_mpi_mul_mpi()

for( j = B->n; j > 0; j-- )

bignum.c:1411

mbedtls_mpi_mul_mpi()

_B.n = 1;

bignum.c:1441

mbedtls_mpi_mul_int()

MBEDTLS_MPI_CHK( mbedtls_mpi_grow( &Z, A->n + 2 ) );

bignum.c:1573

mbedtls_mpi_div_mpi()

n = X.n - 1;

bignum.c:1587

mbedtls_mpi_div_mpi()

t = Y.n - 1;

bignum.c:1588

mbedtls_mpi_div_mpi()

_B.n = 1;

bignum.c:1675

mbedtls_mpi_div_int()

for( i = A->n, y = 0; i > 0; i-- )

bignum.c:1741

mbedtls_mpi_mod_int()

if( T->n < N->n + 1 || T->p == NULL )

bignum.c:1792

mpi_montmul()

memset( T->p, 0, T->n * ciL );

n = N->n;

m = ( B->n < n ) ? B->n : n;

U.n = U.s = (int) z;

j = N->n + 1;

mbedtls_mpi_exp_mod()

MBEDTLS_MPI_CHK( mbedtls_mpi_shift_l( &RR, N->n * 2 * biL ) );

bignum.c:1907

mbedtls_mpi_exp_mod()

MBEDTLS_MPI_CHK( mbedtls_mpi_grow( &W[j], N->n + 1 ) );

bignum.c:1939

mbedtls_mpi_exp_mod()

MBEDTLS_MPI_CHK( mbedtls_mpi_grow( &W[i], N->n + 1 ) );

bignum.c:1950

mbedtls_mpi_exp_mod()

nblimbs = E->n;

bignum.c:1957

mbedtls_mpi_exp_mod()

if( neg && E->n != 0 && ( E->p[0] & 1 ) != 0 )

bignum.c:2039

mbedtls_mpi_exp_mod()

if( X->n != limbs )

bignum.c:2134

mbedtls_mpi_fill_random()

MBEDTLS_MPI_CHK( mbedtls_mpi_shrink( &T[i]->X, grp->P.n ) );

ecp.c:1204

ecp_normalize_jac_many()

MBEDTLS_MPI_CHK( mbedtls_mpi_shrink( &T[i]->Y, grp->P.n ) );

ecp.c:1205

ecp_normalize_jac_many()

X->n = len / sizeof( mbedtls_mpi_uint );

X->n = 1;

C->p[ C->n - 1 ] = (mbedtls_mpi_uint) -c;

INIT( 256 );

SUB( 10 ); SUB( 11 ); SUB( 12 ); SUB( 13 ); LAST; // A7

INIT( 384 );

SUB( 22 ); LAST; // A11

ecp_curves.c:1151

ecp_mod_p384()

Call Tree

All items filtered out

Data Use

mbedtls_mpi::n is written by 14 functions and is read by 30 functions:

mbedtls_mpi_cmp_int()

mbedtls_mpi_add_int()

mbedtls_mpi_sub_int()

mbedtls_mpi_mul_int()

mbedtls_mpi_div_int()

mbedtls_mpi::n

Class Tree

All items filtered out

Override Tree

All items filtered out

Implementations

All items filtered out

Instances

Lifecycle

All items filtered out

mbedtls_mpi::n field

Syntax

Examples

References

Call Tree

Data Use

Class Tree

Override Tree

Implementations

Instances

Lifecycle