bn_lcl.h

Jenkins

bn_lcl.h

Absolute File Name:

/home/opencoverage/opencoverage/guest-scripts/openssl/src/crypto/bn/bn_lcl.h

Line

Source

Count

unsigned long bn_mul_add_words(unsigned long *rp, const unsigned long *ap, int num,

unsigned long w);

unsigned long bn_mul_words(unsigned long *rp, const unsigned long *ap, int num, unsigned long w);

void bn_sqr_words(unsigned long *rp, const unsigned long *ap, int num);

unsigned long bn_div_words(unsigned long h, unsigned long l, unsigned long d);

unsigned long bn_add_words(unsigned long *rp, const unsigned long *ap, const unsigned long *bp,

int num);

unsigned long bn_sub_words(unsigned long *rp, const unsigned long *ap, const unsigned long *bp,

int num);

struct bignum_st {

unsigned long *d;

int top;

int dmax;

int neg;

int flags;

};

struct bn_mont_ctx_st {

int ri;

BIGNUM RR;

BIGNUM N;

BIGNUM Ni;

unsigned long n0[2];

int flags;

};

struct bn_recp_ctx_st {

BIGNUM N;

BIGNUM Nr;

int num_bits;

int shift;

int flags;

};

struct bn_gencb_st {

unsigned int ver;

void *arg;

union {

void (*cb_1) (int, int, void *);

int (*cb_2) (int, int, BN_GENCB *);

} cb;

};

void BN_RECP_CTX_init(BN_RECP_CTX *recp);

void BN_MONT_CTX_init(BN_MONT_CTX *ctx);

void bn_init(BIGNUM *a);

void bn_mul_normal(unsigned long *r, unsigned long *a, int na, unsigned long *b, int nb);

void bn_mul_comba8(unsigned long *r, unsigned long *a, unsigned long *b);

void bn_mul_comba4(unsigned long *r, unsigned long *a, unsigned long *b);

void bn_sqr_normal(unsigned long *r, const unsigned long *a, int n, unsigned long *tmp);

void bn_sqr_comba8(unsigned long *r, const unsigned long *a);

void bn_sqr_comba4(unsigned long *r, const unsigned long *a);

int bn_cmp_words(const unsigned long *a, const unsigned long *b, int n);

int bn_cmp_part_words(const unsigned long *a, const unsigned long *b, int cl, int dl);

void bn_mul_recursive(unsigned long *r, unsigned long *a, unsigned long *b, int n2,

int dna, int dnb, unsigned long *t);

void bn_mul_part_recursive(unsigned long *r, unsigned long *a, unsigned long *b,

int n, int tna, int tnb, unsigned long *t);

void bn_sqr_recursive(unsigned long *r, const unsigned long *a, int n2, unsigned long *t);

void bn_mul_low_normal(unsigned long *r, unsigned long *a, unsigned long *b, int n);

void bn_mul_low_recursive(unsigned long *r, unsigned long *a, unsigned long *b, int n2,

unsigned long *t);

unsigned long bn_sub_part_words(unsigned long *r, const unsigned long *a, const unsigned long *b,

int cl, int dl);

int bn_mul_mont(unsigned long *rp, const unsigned long *ap, const unsigned long *bp,

const unsigned long *np, const unsigned long *n0, int num);

BIGNUM *int_bn_mod_inverse(BIGNUM *in,

const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx,

int *noinv);

int bn_probable_prime_dh(BIGNUM *rnd, int bits,

const BIGNUM *add, const BIGNUM *rem, BN_CTX *ctx);

static inline BIGNUM *bn_expand(BIGNUM *a, int bits)

{

if (bits > (0x7fffffff - (8 * 8) + 1)

bits > (0x7fff...- (8 * 8) + 1)	Description
TRUE	never evaluated
FALSE	evaluated 97690369 times by 2 tests Evaluated by: libcrypto.so.1.1 sm2_internal_test

)

0-97690369

return

never executed: return ((void *)0) ;

((void *)0)

never executed: return ((void *)0) ;

;

never executed: return ((void *)0) ;

100

101

if (((

((bits+(8 * 8)...) <= (a)->dmax	Description
TRUE	evaluated 96286538 times by 2 tests Evaluated by: libcrypto.so.1.1 sm2_internal_test
FALSE	evaluated 1403831 times by 2 tests Evaluated by: libcrypto.so.1.1 sm2_internal_test

bits+(8 * 8)-1)/(8 * 8)) <= (a)->dmax

((bits+(8 * 8)...) <= (a)->dmax	Description
TRUE	evaluated 96286538 times by 2 tests Evaluated by: libcrypto.so.1.1 sm2_internal_test
FALSE	evaluated 1403831 times by 2 tests Evaluated by: libcrypto.so.1.1 sm2_internal_test

)

1403831-96286538

102

return

executed 96286538 times by 2 tests: return a;

Executed by: