| Line | Source | Count |
| 1 | | - |
| 2 | int | - |
| 3 | DH_check(const DH *dh, int *ret) | - |
| 4 | { | - |
| 5 | int ok = 0; | - |
| 6 | BN_CTX *ctx = | - |
| 7 | ((void *)0) | - |
| 8 | ; | - |
| 9 | unsigned long l; | - |
| 10 | BIGNUM *q = | - |
| 11 | ((void *)0) | - |
| 12 | ; | - |
| 13 | | - |
| 14 | *ret = 0; | - |
| 15 | ctx = BN_CTX_new(); | - |
| 16 | if (ctx == | TRUE | never evaluated | | FALSE | evaluated 1 time by 1 test |
| 0-1 |
| 17 | ((void *)0)| TRUE | never evaluated | | FALSE | evaluated 1 time by 1 test |
| 0-1 |
| 18 | ) | - |
| 19 | goto never executed: goto err; err;never executed: goto err; | 0 |
| 20 | q = BN_new(); | - |
| 21 | if (q == | TRUE | never evaluated | | FALSE | evaluated 1 time by 1 test |
| 0-1 |
| 22 | ((void *)0)| TRUE | never evaluated | | FALSE | evaluated 1 time by 1 test |
| 0-1 |
| 23 | ) | - |
| 24 | goto never executed: goto err; err;never executed: goto err; | 0 |
| 25 | | - |
| 26 | if (((((((| TRUE | evaluated 1 time by 1 test | | FALSE | never evaluated |
dh->g))->top == 1)| TRUE | evaluated 1 time by 1 test | | FALSE | never evaluated |
&& (((| TRUE | never evaluated | | FALSE | evaluated 1 time by 1 test |
dh->g))->d[0] == (unsigned long)((2)))| TRUE | never evaluated | | FALSE | evaluated 1 time by 1 test |
) || ((((| TRUE | never evaluated | | FALSE | evaluated 1 time by 1 test |
2)) == 0)| TRUE | never evaluated | | FALSE | evaluated 1 time by 1 test |
&& (((| TRUE | never evaluated | | FALSE | never evaluated |
dh->g))->top == 0)| TRUE | never evaluated | | FALSE | never evaluated |
)) && (!(2) || !(dh->g)->neg| TRUE | never evaluated | | FALSE | never evaluated |
))) { | 0-1 |
| 27 | l = BN_mod_word(dh->p, 24); | - |
| 28 | if (l == (unsigned long)-1| TRUE | never evaluated | | FALSE | never evaluated |
) | 0 |
| 29 | goto never executed: goto err; err;never executed: goto err; | 0 |
| 30 | if (l != 11| TRUE | never evaluated | | FALSE | never evaluated |
) | 0 |
| 31 | * never executed: *ret |= 0x08; ret |= 0x08;never executed: *ret |= 0x08; | 0 |
| 32 | } never executed: end of block else if (((((((| TRUE | evaluated 1 time by 1 test | | FALSE | never evaluated |
dh->g))->top == 1)| TRUE | evaluated 1 time by 1 test | | FALSE | never evaluated |
&& (((| TRUE | evaluated 1 time by 1 test | | FALSE | never evaluated |
dh->g))->d[0] == (unsigned long)((5)))| TRUE | evaluated 1 time by 1 test | | FALSE | never evaluated |
) || ((((| TRUE | never evaluated | | FALSE | never evaluated |
5)) == 0)| TRUE | never evaluated | | FALSE | never evaluated |
&& (((| TRUE | never evaluated | | FALSE | never evaluated |
dh->g))->top == 0)| TRUE | never evaluated | | FALSE | never evaluated |
)) && (!(5) || !(dh->g)->neg| TRUE | evaluated 1 time by 1 test | | FALSE | never evaluated |
))) { | 0-1 |
| 33 | l = BN_mod_word(dh->p, 10); | - |
| 34 | if (l == (unsigned long)-1| TRUE | never evaluated | | FALSE | evaluated 1 time by 1 test |
) | 0-1 |
| 35 | goto never executed: goto err; err;never executed: goto err; | 0 |
| 36 | if (l != 3| TRUE | never evaluated | | FALSE | evaluated 1 time by 1 test |
&& l != 7| TRUE | never evaluated | | FALSE | never evaluated |
) | 0-1 |
| 37 | * never executed: *ret |= 0x08; ret |= 0x08;never executed: *ret |= 0x08; | 0 |
| 38 | }executed 1 time by 1 test: end of block else | 1 |
| 39 | * never executed: *ret |= 0x04; ret |= 0x04;never executed: *ret |= 0x04; | 0 |
| 40 | | - |
| 41 | if (!BN_is_prime_ex(dh->p, 0, ctx, | TRUE | never evaluated | | FALSE | evaluated 1 time by 1 test |
| 0-1 |
| 42 | ((void *)0)| TRUE | never evaluated | | FALSE | evaluated 1 time by 1 test |
| 0-1 |
| 43 | )| TRUE | never evaluated | | FALSE | evaluated 1 time by 1 test |
) | 0-1 |
| 44 | * never executed: *ret |= 0x01; ret |= 0x01;never executed: *ret |= 0x01; | 0 |
| 45 | else { | - |
| 46 | if (!BN_rshift1(q, dh->p)| TRUE | never evaluated | | FALSE | evaluated 1 time by 1 test |
) | 0-1 |
| 47 | goto never executed: goto err; err;never executed: goto err; | 0 |
| 48 | if (!BN_is_prime_ex(q, 0, ctx, | TRUE | never evaluated | | FALSE | evaluated 1 time by 1 test |
| 0-1 |
| 49 | ((void *)0)| TRUE | never evaluated | | FALSE | evaluated 1 time by 1 test |
| 0-1 |
| 50 | )| TRUE | never evaluated | | FALSE | evaluated 1 time by 1 test |
) | 0-1 |
| 51 | * never executed: *ret |= 0x02; ret |= 0x02;never executed: *ret |= 0x02; | 0 |
| 52 | }executed 1 time by 1 test: end of block | 1 |
| 53 | ok = 1; | - |
| 54 | err:code before this statement executed 1 time by 1 test: err: | 1 |
| 55 | BN_CTX_free(ctx); | - |
| 56 | BN_free(q); | - |
| 57 | returnexecuted 1 time by 1 test: return ok; ok;executed 1 time by 1 test: return ok; | 1 |
| 58 | } | - |
| 59 | | - |
| 60 | int | - |
| 61 | DH_check_pub_key(const DH *dh, const BIGNUM *pub_key, int *ret) | - |
| 62 | { | - |
| 63 | BIGNUM *q = | - |
| 64 | ((void *)0) | - |
| 65 | ; | - |
| 66 | | - |
| 67 | *ret = 0; | - |
| 68 | q = BN_new(); | - |
| 69 | if (q == | TRUE | never evaluated | | FALSE | evaluated 60 times by 3 tests |
| 0-60 |
| 70 | ((void *)0)| TRUE | never evaluated | | FALSE | evaluated 60 times by 3 tests |
| 0-60 |
| 71 | ) | - |
| 72 | return never executed: return 0; 0;never executed: return 0; | 0 |
| 73 | BN_set_word(q, 1); | - |
| 74 | if (BN_cmp(pub_key, q) <= 0| TRUE | never evaluated | | FALSE | evaluated 60 times by 3 tests |
) | 0-60 |
| 75 | * never executed: *ret |= 0x01; ret |= 0x01;never executed: *ret |= 0x01; | 0 |
| 76 | BN_copy(q, dh->p); | - |
| 77 | BN_sub_word(q, 1); | - |
| 78 | if (BN_cmp(pub_key, q) >= 0| TRUE | never evaluated | | FALSE | evaluated 60 times by 3 tests |
) | 0-60 |
| 79 | * never executed: *ret |= 0x02; ret |= 0x02;never executed: *ret |= 0x02; | 0 |
| 80 | | - |
| 81 | BN_free(q); | - |
| 82 | returnexecuted 60 times by 3 tests: return 1; 1;executed 60 times by 3 tests: return 1; | 60 |
| 83 | } | - |
| | |