mirror of
https://github.com/wolfSSL/wolfssl.git
synced 2026-08-13 17:31:23 +02:00
tests: add sp_int.c (sp-math module) MC/DC DecisionCoverage + white-box
tests/api/test_wolfmath.c gains six DecisionCoverage test functions covering sp_int.c's mp_*/sp_* API: the allocation family (sp_init_size, sp_grow, sp_copy, sp_exch), the shift family (sp_set_bit, sp_2expt, sp_lshd, sp_rshb), the single-digit and multi-precision arithmetic families (sp_add_d/sp_sub_d/sp_mul_d/sp_div_d/sp_mod_d/sp_div_2/ sp_div_2_mod_ct/sp_add/sp_sub/sp_addmod_ct/sp_submod_ct/sp_div, including their WOLFSSL_SP_INT_NEGATIVE sign-path counterparts), the conversion family (sp_div_2d/sp_mod_2d/sp_mul_2d/sp_sqrmod/ sp_mont_red_ex/sp_to_unsigned_bin_len(_ct)/sp_tohex/sp_read_radix), and the sp_invmod/sp_exptmod_ex/sp_gcd/sp_prime_is_prime(_ex) top-level argument and degenerate-input checks. Each exercises an internal size/capacity guard or argument check via a deliberately undersized destination (sp_init_size with a small size) or an out-of-range argument - legitimate, public ways to reach decisions valid-sized RSA/ ECC/DH usage never trips. tests/unit-mcdc/test_sp_int_whitebox.c is a new white-box supplement (compiles sp_int.c in directly) closing the sp_count_bits/sp_cnt_lsb non-normalized-digit trim loops: no public caller can produce that state since every public mutator normalizes via sp_clamp before returning. Part of the ISO 26262 per-module MC/DC campaign's sp-math module (wolfcrypt/src/sp_int.c, Phase 1): 412/547 (75.32%) MC/DC across 6 build-variant axes (WOLFSSL_SP_MATH_ALL vs bare WOLFSSL_SP_MATH, WOLFSSL_SP_SMALL, WOLFSSL_SP_INT_NEGATIVE, WOLFSSL_SP_DIV_WORD_HALF, WOLFSSL_SMALL_STACK) + the white-box, up from a 318/547 baseline. The remaining gaps are deep invmod/exptmod/prime/gcd internal state-machine internals, the SP-accelerated-backend-entangled RSA/DH key-size dispatch, and other structural residuals; campaign-side files (config, module registry, baseline) live in the separate testing repo.
This commit is contained in:
Daniele Lacamera
@@ -207,3 +207,779 @@ int test_wc_export_int(void)
|
||||
return EXPECT_RESULT();
|
||||
} /* End test_wc_export_int */
|
||||
|
||||
/*
|
||||
* MC/DC coverage for the sp_int.c multi-precision engine (the sp-math
|
||||
* module, iso26262/mcdc-per-module). These call the sp_* primitives
|
||||
* directly (not just their mp_* macro aliases in sp_int.h) since that is
|
||||
* the actual API under test; sp_* IS mp_* here whenever WOLFSSL_SP_MATH or
|
||||
* WOLFSSL_SP_MATH_ALL is the selected math backend. Each test below drives
|
||||
* an internal size/capacity guard or argument check that valid-sized inputs
|
||||
* never trip, using a deliberately undersized destination sp_int
|
||||
* (sp_init_size with a small size) or an out-of-range argument - both
|
||||
* legitimate, public ways to reach these decisions (as opposed to the
|
||||
* non-normalized-digit internal states that need the white-box supplement,
|
||||
* tests/unit-mcdc/test_sp_int_whitebox.c).
|
||||
*/
|
||||
|
||||
/*
|
||||
* Testing sp_init_size / sp_grow / sp_copy / sp_exch: allocation and
|
||||
* capacity-guard decision branches.
|
||||
*/
|
||||
int test_wc_SpIntSizeDecisionCoverage(void)
|
||||
{
|
||||
EXPECT_DECLS;
|
||||
#if (defined(WOLFSSL_SP_MATH_ALL) || defined(WOLFSSL_SP_MATH)) && \
|
||||
defined(WOLFSSL_PUBLIC_MP)
|
||||
mp_int a;
|
||||
mp_int b;
|
||||
mp_int r;
|
||||
|
||||
XMEMSET(&a, 0, sizeof(a));
|
||||
XMEMSET(&b, 0, sizeof(b));
|
||||
XMEMSET(&r, 0, sizeof(r));
|
||||
|
||||
/* sp_init_size: NULL, size==0, size > SP_INT_DIGITS, normal. */
|
||||
ExpectIntEQ(sp_init_size(NULL, 4), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init_size(&a, 0), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init_size(&a, (unsigned int)SP_INT_DIGITS + 1),
|
||||
WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init_size(&a, 4), 0);
|
||||
|
||||
/* sp_grow: NULL, negative, too big for a->size, normal. */
|
||||
ExpectIntEQ(sp_grow(NULL, 1), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_grow(&a, -1), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_grow(&a, 100), WC_NO_ERR_TRACE(MP_MEM));
|
||||
ExpectIntEQ(sp_grow(&a, 2), 0);
|
||||
|
||||
/* sp_copy: NULL args; a->used > r->size (undersized dest); a==r skips
|
||||
* the size check; normal. Build a multi-digit 'a' via sp_2expt (bit
|
||||
* index well beyond one word on any SP_WORD_SIZE) so the size check has
|
||||
* something to reject. */
|
||||
ExpectIntEQ(sp_init(&a), 0);
|
||||
ExpectIntEQ(sp_2expt(&a, 200), 0);
|
||||
ExpectIntEQ(sp_init_size(&r, 1), 0);
|
||||
ExpectIntEQ(sp_copy(&a, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_copy(NULL, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_copy(&a, NULL), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_copy(&a, &a), 0); /* same pointer: size check skipped */
|
||||
ExpectIntEQ(sp_init(&r), 0);
|
||||
ExpectIntEQ(sp_copy(&a, &r), 0);
|
||||
|
||||
/* sp_exch: NULL args; capacity mismatch in either direction; normal. */
|
||||
ExpectIntEQ(sp_exch(NULL, &b), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_exch(&a, NULL), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init_size(&b, 1), 0);
|
||||
/* b.size(1) < a.used: b too small to receive a (isolates the second
|
||||
* OR operand, a's size check on the first argument stays false since
|
||||
* b->used is 0 here). */
|
||||
ExpectIntEQ(sp_exch(&a, &b), WC_NO_ERR_TRACE(MP_VAL));
|
||||
/* a.size < b->used: the mirror image, isolating the first OR operand
|
||||
* with a small first argument and a bigger-used second argument. */
|
||||
{
|
||||
mp_int small;
|
||||
XMEMSET(&small, 0, sizeof(small));
|
||||
ExpectIntEQ(sp_init_size(&small, 1), 0);
|
||||
ExpectIntEQ(sp_init(&b), 0);
|
||||
ExpectIntEQ(sp_2expt(&b, 200), 0);
|
||||
ExpectIntEQ(sp_exch(&small, &b), WC_NO_ERR_TRACE(MP_VAL));
|
||||
mp_clear(&small);
|
||||
}
|
||||
ExpectIntEQ(sp_init(&b), 0);
|
||||
ExpectIntEQ(sp_set(&b, 7), 0);
|
||||
/* a.size(SP_INT_DIGITS) < b.used never happens here; a<-b<->b<-a swap
|
||||
* with both large enough succeeds and exercises the false side. */
|
||||
ExpectIntEQ(sp_exch(&a, &b), 0);
|
||||
|
||||
mp_clear(&a);
|
||||
mp_clear(&b);
|
||||
mp_clear(&r);
|
||||
#endif
|
||||
return EXPECT_RESULT();
|
||||
} /* End test_wc_SpIntSizeDecisionCoverage */
|
||||
|
||||
/*
|
||||
* Testing sp_set_bit / sp_2expt / sp_lshd / sp_rshb: bit/digit shift
|
||||
* argument and capacity-guard decision branches.
|
||||
*/
|
||||
int test_wc_SpIntShiftDecisionCoverage(void)
|
||||
{
|
||||
EXPECT_DECLS;
|
||||
#if (defined(WOLFSSL_SP_MATH_ALL) || defined(WOLFSSL_SP_MATH)) && \
|
||||
defined(WOLFSSL_PUBLIC_MP)
|
||||
mp_int a;
|
||||
mp_int r;
|
||||
|
||||
XMEMSET(&a, 0, sizeof(a));
|
||||
XMEMSET(&r, 0, sizeof(r));
|
||||
|
||||
/* sp_set_bit: negative index (NULL/too-large-index sides covered
|
||||
* elsewhere already). */
|
||||
ExpectIntEQ(sp_init(&a), 0);
|
||||
ExpectIntEQ(sp_set_bit(&a, -1), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_set_bit(&a, 3), 0);
|
||||
|
||||
/* sp_2expt: NULL, negative exponent, normal. */
|
||||
ExpectIntEQ(sp_2expt(NULL, 5), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_2expt(&a, -1), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_2expt(&a, 5), 0);
|
||||
|
||||
/* sp_lshd: NULL, negative shift, overflow (used+s > size), normal. */
|
||||
ExpectIntEQ(sp_lshd(NULL, 1), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init_size(&a, 2), 0);
|
||||
ExpectIntEQ(sp_set(&a, 1), 0);
|
||||
ExpectIntEQ(sp_lshd(&a, -1), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_lshd(&a, 5), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_lshd(&a, 1), 0);
|
||||
|
||||
/* sp_rshb: NULL, negative n, undersized dest, normal (dest != src and
|
||||
* dest == src both exercised). */
|
||||
ExpectIntEQ(sp_init(&a), 0);
|
||||
ExpectIntEQ(sp_2expt(&a, 200), 0);
|
||||
ExpectIntEQ(sp_rshb(NULL, 1, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_rshb(&a, -1, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init_size(&r, 1), 0);
|
||||
ExpectIntEQ(sp_rshb(&a, 1, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init(&r), 0);
|
||||
ExpectIntEQ(sp_rshb(&a, 1, &r), 0);
|
||||
ExpectIntEQ(sp_rshb(&a, 1, &a), 0); /* in place: dest == src */
|
||||
/* Shift out every digit: hits the "ni >= a->used" short-circuit. */
|
||||
ExpectIntEQ(sp_rshb(&a, 4096, &r), 0);
|
||||
|
||||
mp_clear(&a);
|
||||
mp_clear(&r);
|
||||
#endif
|
||||
return EXPECT_RESULT();
|
||||
} /* End test_wc_SpIntShiftDecisionCoverage */
|
||||
|
||||
/*
|
||||
* Testing sp_add_d / sp_sub_d / sp_mul_d / sp_div_d / sp_mod_d / sp_div_2 /
|
||||
* sp_div_2_mod_ct: single-digit arithmetic capacity-guard decision
|
||||
* branches, and their WOLFSSL_SP_INT_NEGATIVE sign-path counterparts.
|
||||
*/
|
||||
int test_wc_SpIntDigitArithDecisionCoverage(void)
|
||||
{
|
||||
EXPECT_DECLS;
|
||||
#if (defined(WOLFSSL_SP_MATH_ALL) || defined(WOLFSSL_SP_MATH)) && \
|
||||
defined(WOLFSSL_PUBLIC_MP)
|
||||
mp_int a;
|
||||
mp_int r;
|
||||
sp_int_digit rem;
|
||||
|
||||
XMEMSET(&a, 0, sizeof(a));
|
||||
XMEMSET(&r, 0, sizeof(r));
|
||||
|
||||
/* sp_add_d: NULL args; undersized dest (a->used+1 > r->size); normal;
|
||||
* in-place (r == a, so _sp_add_d's "r != a" copy-tail is skipped). */
|
||||
ExpectIntEQ(sp_add_d(NULL, 1, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init(&a), 0);
|
||||
ExpectIntEQ(sp_add_d(&a, 1, NULL), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_set(&a, SP_DIGIT_MAX), 0); /* forces a carry on add */
|
||||
ExpectIntEQ(sp_init_size(&r, 1), 0);
|
||||
ExpectIntEQ(sp_add_d(&a, 1, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init(&r), 0);
|
||||
ExpectIntEQ(sp_add_d(&a, 1, &r), 0);
|
||||
ExpectIntEQ(sp_add_d(&a, 1, &a), 0); /* in place */
|
||||
|
||||
/* sp_sub_d: NULL args; undersized dest; normal. */
|
||||
ExpectIntEQ(sp_sub_d(NULL, 1, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init(&a), 0);
|
||||
ExpectIntEQ(sp_sub_d(&a, 1, NULL), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_2expt(&a, 200), 0);
|
||||
ExpectIntEQ(sp_init_size(&r, 1), 0);
|
||||
ExpectIntEQ(sp_sub_d(&a, 1, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init(&r), 0);
|
||||
ExpectIntEQ(sp_sub_d(&a, 1, &r), 0);
|
||||
|
||||
/* sp_mul_d: NULL args; undersized dest; normal. */
|
||||
ExpectIntEQ(sp_mul_d(NULL, 2, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_mul_d(&a, 2, NULL), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init_size(&r, 1), 0);
|
||||
ExpectIntEQ(sp_mul_d(&a, 2, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init(&r), 0);
|
||||
ExpectIntEQ(sp_mul_d(&a, 2, &r), 0);
|
||||
ExpectIntEQ(sp_mul_d(&a, 0, &r), 0); /* zero digit: used-clearing path */
|
||||
|
||||
/* sp_div_d: NULL a, d==0; undersized dest (r may be NULL: rem-only
|
||||
* mode); normal, with a large/small divisor to hit both internal
|
||||
* divide strategies. */
|
||||
ExpectIntEQ(sp_div_d(NULL, 2, &r, &rem), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_div_d(&a, 0, &r, &rem), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init_size(&r, 1), 0);
|
||||
ExpectIntEQ(sp_div_d(&a, 2, &r, &rem), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init(&r), 0);
|
||||
ExpectIntEQ(sp_div_d(&a, 2, &r, &rem), 0);
|
||||
ExpectIntEQ(sp_div_d(&a, 2, NULL, &rem), 0); /* rem-only, r==NULL */
|
||||
ExpectIntEQ(sp_div_d(&a, SP_DIGIT_MAX, &r, &rem), 0); /* big divisor */
|
||||
|
||||
/* sp_mod_d: NULL args, d==0; normal (power-of-2 and non-power-of-2
|
||||
* divisors take different internal paths). */
|
||||
ExpectIntEQ(sp_mod_d(NULL, 2, &rem), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_mod_d(&a, 2, NULL), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_mod_d(&a, 0, &rem), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_mod_d(&a, 4, &rem), 0); /* power of 2 */
|
||||
ExpectIntEQ(sp_mod_d(&a, 3, &rem), 0); /* small, non power of 2 */
|
||||
ExpectIntEQ(sp_mod_d(&a, SP_DIGIT_MAX, &rem), 0); /* large divisor */
|
||||
|
||||
#if defined(WOLFSSL_SP_MATH_ALL) && defined(HAVE_ECC)
|
||||
/* sp_div_2: NULL args; undersized dest; normal. */
|
||||
ExpectIntEQ(sp_div_2(NULL, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_div_2(&a, NULL), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init_size(&r, 1), 0);
|
||||
ExpectIntEQ(sp_div_2(&a, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init(&r), 0);
|
||||
ExpectIntEQ(sp_div_2(&a, &r), 0);
|
||||
|
||||
/* sp_div_2_mod_ct: NULL args; undersized dest (m->used+1 > r->size);
|
||||
* normal. */
|
||||
{
|
||||
mp_int m;
|
||||
XMEMSET(&m, 0, sizeof(m));
|
||||
ExpectIntEQ(sp_init(&m), 0);
|
||||
ExpectIntEQ(sp_2expt(&m, 200), 0);
|
||||
ExpectIntEQ(sp_div_2_mod_ct(NULL, &m, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_div_2_mod_ct(&a, NULL, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_div_2_mod_ct(&a, &m, NULL), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init_size(&r, 1), 0);
|
||||
ExpectIntEQ(sp_div_2_mod_ct(&a, &m, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init(&r), 0);
|
||||
ExpectIntEQ(sp_div_2_mod_ct(&a, &m, &r), 0);
|
||||
mp_clear(&m);
|
||||
}
|
||||
#endif /* WOLFSSL_SP_MATH_ALL && HAVE_ECC */
|
||||
|
||||
#ifdef WOLFSSL_SP_INT_NEGATIVE
|
||||
/* Negative-sign counterparts: sp_add_d/sp_sub_d select a different
|
||||
* capacity guard and internal path (add-magnitude vs subtract-magnitude)
|
||||
* when a->sign == MP_NEG. sp_mod_d's negative-remainder-normalize path
|
||||
* needs a negative dividend with a non-exact (nonzero remainder)
|
||||
* divisor. */
|
||||
ExpectIntEQ(sp_init(&a), 0);
|
||||
ExpectIntEQ(sp_2expt(&a, 200), 0);
|
||||
sp_setneg(&a);
|
||||
ExpectIntEQ(sp_init_size(&r, 1), 0);
|
||||
/* a->used > r->size, a negative: sp_add_d's MP_NEG capacity guard. */
|
||||
ExpectIntEQ(sp_add_d(&a, 1, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init(&r), 0);
|
||||
ExpectIntEQ(sp_add_d(&a, 1, &r), 0); /* a negative, bigger than digit */
|
||||
ExpectIntEQ(sp_init(&a), 0);
|
||||
ExpectIntEQ(sp_set(&a, 1), 0);
|
||||
sp_setneg(&a);
|
||||
ExpectIntEQ(sp_add_d(&a, 5, &r), 0); /* a negative, <= digit: r = d-a */
|
||||
|
||||
ExpectIntEQ(sp_init(&a), 0);
|
||||
ExpectIntEQ(sp_2expt(&a, 200), 0);
|
||||
sp_setneg(&a);
|
||||
ExpectIntEQ(sp_init_size(&r, 1), 0);
|
||||
/* a->used+1 > r->size, a negative: sp_sub_d's MP_NEG capacity guard. */
|
||||
ExpectIntEQ(sp_sub_d(&a, 1, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init(&r), 0);
|
||||
ExpectIntEQ(sp_sub_d(&a, 1, &r), 0);
|
||||
|
||||
ExpectIntEQ(sp_init(&a), 0);
|
||||
ExpectIntEQ(sp_set(&a, 10), 0);
|
||||
sp_setneg(&a);
|
||||
/* Negative dividend, remainder nonzero: sign-normalize path taken. */
|
||||
ExpectIntEQ(sp_mod_d(&a, 3, &rem), 0);
|
||||
ExpectIntEQ(rem, 2); /* -10 mod 3 == 2 in sign-magnitude normalization */
|
||||
ExpectIntEQ(sp_init(&a), 0);
|
||||
ExpectIntEQ(sp_set(&a, 9), 0);
|
||||
sp_setneg(&a);
|
||||
/* Negative dividend, EXACT divisor: remainder zero, normalize skipped
|
||||
* (*r != 0 false side of the sign-normalize guard). */
|
||||
ExpectIntEQ(sp_mod_d(&a, 3, &rem), 0);
|
||||
ExpectIntEQ(rem, 0);
|
||||
#endif /* WOLFSSL_SP_INT_NEGATIVE */
|
||||
|
||||
mp_clear(&a);
|
||||
mp_clear(&r);
|
||||
#endif
|
||||
return EXPECT_RESULT();
|
||||
} /* End test_wc_SpIntDigitArithDecisionCoverage */
|
||||
|
||||
/*
|
||||
* Testing sp_add / sp_sub / sp_addmod_ct / sp_submod_ct / sp_div:
|
||||
* multi-precision arithmetic capacity-guard decision branches.
|
||||
*/
|
||||
int test_wc_SpIntArithDecisionCoverage(void)
|
||||
{
|
||||
EXPECT_DECLS;
|
||||
#if (defined(WOLFSSL_SP_MATH_ALL) || defined(WOLFSSL_SP_MATH)) && \
|
||||
defined(WOLFSSL_PUBLIC_MP)
|
||||
mp_int a;
|
||||
mp_int b;
|
||||
mp_int m;
|
||||
mp_int r;
|
||||
|
||||
XMEMSET(&a, 0, sizeof(a));
|
||||
XMEMSET(&b, 0, sizeof(b));
|
||||
XMEMSET(&m, 0, sizeof(m));
|
||||
XMEMSET(&r, 0, sizeof(r));
|
||||
|
||||
ExpectIntEQ(sp_init(&a), 0);
|
||||
ExpectIntEQ(sp_2expt(&a, 200), 0);
|
||||
ExpectIntEQ(sp_init(&b), 0);
|
||||
ExpectIntEQ(sp_2expt(&b, 64), 0);
|
||||
|
||||
/* sp_add: NULL args; undersized dest (a/b->used >= r->size); normal. */
|
||||
ExpectIntEQ(sp_add(NULL, &b, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_add(&a, NULL, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_add(&a, &b, NULL), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init_size(&r, 1), 0);
|
||||
ExpectIntEQ(sp_add(&a, &b, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init(&r), 0);
|
||||
ExpectIntEQ(sp_add(&a, &b, &r), 0);
|
||||
ExpectIntEQ(sp_add(&b, &a, &r), 0); /* commute: b->used branch too */
|
||||
/* r sized strictly between b->used and a->used: isolates the b->used
|
||||
* term (idx1 false, idx2 true) from the a->used term. */
|
||||
ExpectIntEQ(sp_init_size(&r, 3), 0);
|
||||
ExpectIntEQ(sp_add(&b, &a, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
|
||||
/* sp_sub: NULL args; undersized dest; normal (a > b throughout, since
|
||||
* without WOLFSSL_SP_INT_NEGATIVE a must be >= b). */
|
||||
ExpectIntEQ(sp_sub(NULL, &b, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_sub(&a, NULL, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_sub(&a, &b, NULL), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init_size(&r, 1), 0);
|
||||
ExpectIntEQ(sp_sub(&a, &b, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init(&r), 0);
|
||||
ExpectIntEQ(sp_sub(&a, &b, &r), 0);
|
||||
/* r sized strictly between the two used counts, with the smaller-used
|
||||
* operand first: isolates the second (b->used) term of the size check
|
||||
* from the first (a->used) term, mirroring the sp_add case above. The
|
||||
* size check itself runs before the sign-aware subtract, so passing
|
||||
* the bigger value as the second argument here is fine. */
|
||||
ExpectIntEQ(sp_init_size(&r, 3), 0);
|
||||
ExpectIntEQ(sp_sub(&b, &a, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
|
||||
#if defined(WOLFSSL_SP_MATH_ALL) && defined(HAVE_ECC)
|
||||
/* sp_addmod_ct / sp_submod_ct: undersized dest (m->used > r->size);
|
||||
* r == m aliasing rejected; normal. */
|
||||
ExpectIntEQ(sp_init(&m), 0);
|
||||
ExpectIntEQ(sp_2expt(&m, 96), 0);
|
||||
ExpectIntEQ(sp_init_size(&r, 1), 0);
|
||||
ExpectIntEQ(sp_addmod_ct(&a, &b, &m, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_addmod_ct(&a, &b, &m, &m), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init(&r), 0);
|
||||
ExpectIntEQ(sp_addmod_ct(&a, &b, &m, &r), 0);
|
||||
ExpectIntEQ(sp_init_size(&r, 1), 0);
|
||||
ExpectIntEQ(sp_submod_ct(&a, &b, &m, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_submod_ct(&a, &b, &m, &m), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init(&r), 0);
|
||||
ExpectIntEQ(sp_submod_ct(&a, &b, &m, &r), 0);
|
||||
#endif /* WOLFSSL_SP_MATH_ALL && HAVE_ECC */
|
||||
|
||||
/* sp_div: NULL args; d == 0; undersized quotient/remainder dest;
|
||||
* r-only, rem-only, and both together; a<d, a==d, a and d with the
|
||||
* same bit length (a>d, subtract shortcut) and a>>d (real long
|
||||
* division) to reach the internal fast-path and general-case
|
||||
* decisions. */
|
||||
ExpectIntEQ(sp_div(NULL, &b, &r, NULL), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_div(&a, NULL, &r, NULL), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_div(&a, &b, NULL, NULL), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init(&m), 0); /* zero */
|
||||
ExpectIntEQ(sp_div(&a, &m, &r, NULL), WC_NO_ERR_TRACE(MP_VAL));
|
||||
|
||||
ExpectIntEQ(sp_init_size(&r, 1), 0);
|
||||
ExpectIntEQ(sp_div(&a, &b, &r, NULL), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init(&r), 0);
|
||||
{
|
||||
mp_int rem;
|
||||
XMEMSET(&rem, 0, sizeof(rem));
|
||||
ExpectIntEQ(sp_init_size(&rem, 1), 0);
|
||||
ExpectIntEQ(sp_div(&a, &b, &r, &rem), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init(&rem), 0);
|
||||
|
||||
/* a < d */
|
||||
ExpectIntEQ(sp_div(&b, &a, &r, &rem), 0);
|
||||
/* a == d */
|
||||
ExpectIntEQ(sp_div(&a, &a, &r, &rem), 0);
|
||||
/* a, d same bit length, a > d (subtract shortcut) */
|
||||
{
|
||||
mp_int d2;
|
||||
XMEMSET(&d2, 0, sizeof(d2));
|
||||
ExpectIntEQ(sp_init(&d2), 0);
|
||||
ExpectIntEQ(sp_2expt(&d2, 200), 0);
|
||||
ExpectIntEQ(sp_set_bit(&d2, 5), 0); /* a > d2, same bit length */
|
||||
ExpectIntEQ(sp_div(&a, &d2, &r, &rem), 0);
|
||||
mp_clear(&d2);
|
||||
}
|
||||
/* a >> d: general long-division path, r-only and rem-only too. */
|
||||
ExpectIntEQ(sp_div(&a, &b, &r, &rem), 0);
|
||||
ExpectIntEQ(sp_div(&a, &b, &r, NULL), 0);
|
||||
ExpectIntEQ(sp_div(&a, &b, NULL, &rem), 0);
|
||||
mp_clear(&rem);
|
||||
}
|
||||
|
||||
mp_clear(&a);
|
||||
mp_clear(&b);
|
||||
mp_clear(&m);
|
||||
mp_clear(&r);
|
||||
#endif
|
||||
return EXPECT_RESULT();
|
||||
} /* End test_wc_SpIntArithDecisionCoverage */
|
||||
|
||||
/*
|
||||
* Testing sp_div_2d / sp_mod_2d / sp_mul_2d / sp_sqrmod / sp_mont_red_ex /
|
||||
* sp_to_unsigned_bin_len(_ct) / sp_tohex / sp_read_radix (hex,
|
||||
* whitespace-tolerant tail): argument, capacity-guard, and parser decision
|
||||
* branches.
|
||||
*/
|
||||
int test_wc_SpIntConvDecisionCoverage(void)
|
||||
{
|
||||
EXPECT_DECLS;
|
||||
#if (defined(WOLFSSL_SP_MATH_ALL) || defined(WOLFSSL_SP_MATH)) && \
|
||||
defined(WOLFSSL_PUBLIC_MP)
|
||||
mp_int a;
|
||||
mp_int r;
|
||||
char buf[2048];
|
||||
byte bin[512];
|
||||
|
||||
XMEMSET(&a, 0, sizeof(a));
|
||||
XMEMSET(&r, 0, sizeof(r));
|
||||
ExpectIntEQ(sp_init(&a), 0);
|
||||
ExpectIntEQ(sp_2expt(&a, 200), 0);
|
||||
|
||||
#if defined(WOLFSSL_SP_MATH_ALL) || defined(OPENSSL_ALL)
|
||||
/* sp_div_2d: NULL args, negative e; undersized dest handled via
|
||||
* sp_rshb (covered above); zero-and-shift-out-everything path
|
||||
* (remBits <= 0); normal with and without a remainder out-param. */
|
||||
ExpectIntEQ(sp_div_2d(NULL, 5, &r, NULL), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_div_2d(&a, 5, NULL, NULL), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_div_2d(&a, -1, &r, NULL), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init(&r), 0);
|
||||
ExpectIntEQ(sp_div_2d(&a, 4096, &r, NULL), 0); /* shift out everything */
|
||||
{
|
||||
mp_int rem;
|
||||
XMEMSET(&rem, 0, sizeof(rem));
|
||||
ExpectIntEQ(sp_init(&rem), 0);
|
||||
ExpectIntEQ(sp_div_2d(&a, 4096, &r, &rem), 0);
|
||||
ExpectIntEQ(sp_div_2d(&a, 5, &r, &rem), 0); /* normal remBits > 0 */
|
||||
mp_clear(&rem);
|
||||
}
|
||||
ExpectIntEQ(sp_mul_2d(NULL, 5, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_mul_2d(&a, 5, NULL), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_mul_2d(&a, -1, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init_size(&r, 1), 0);
|
||||
ExpectIntEQ(sp_mul_2d(&a, 5, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init(&r), 0);
|
||||
ExpectIntEQ(sp_mul_2d(&a, 5, &r), 0);
|
||||
/* sp_lshb's internal partial-word-shift capacity guard
|
||||
* ((n != 0) && (r->used + s >= r->size)): a single-digit source with a
|
||||
* partial-word shift that exactly fills a single-digit destination
|
||||
* passes sp_mul_2d's own (bit-granularity) capacity pre-check but
|
||||
* still trips sp_lshb's (digit-granularity) one, since 1 digit's worth
|
||||
* of headroom is consumed exactly. Also toggle the "n != 0" side off
|
||||
* (whole-word shift) to complete that condition's pair. */
|
||||
{
|
||||
mp_int one;
|
||||
XMEMSET(&one, 0, sizeof(one));
|
||||
ExpectIntEQ(sp_init(&one), 0);
|
||||
ExpectIntEQ(sp_set(&one, 1), 0);
|
||||
ExpectIntEQ(sp_init_size(&r, 1), 0);
|
||||
ExpectIntEQ(sp_mul_2d(&one, 63, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init(&r), 0);
|
||||
ExpectIntEQ(sp_mul_2d(&one, 64, &r), 0); /* whole-word shift: n==0 */
|
||||
mp_clear(&one);
|
||||
}
|
||||
#endif /* WOLFSSL_SP_MATH_ALL || OPENSSL_ALL */
|
||||
|
||||
#if defined(WOLFSSL_SP_MATH_ALL) || defined(HAVE_ECC) || defined(OPENSSL_ALL)
|
||||
/* sp_mod_2d: NULL args, negative e; undersized dest; normal both with
|
||||
* digits <= a->used (mask off top digit) and digits > a->used
|
||||
* (identity copy). */
|
||||
ExpectIntEQ(sp_mod_2d(NULL, 5, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_mod_2d(&a, 5, NULL), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_mod_2d(&a, -1, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init_size(&r, 1), 0);
|
||||
ExpectIntEQ(sp_mod_2d(&a, 4096, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init(&r), 0);
|
||||
ExpectIntEQ(sp_mod_2d(&a, 5, &r), 0); /* digits <= a->used */
|
||||
ExpectIntEQ(sp_mod_2d(&a, 4096, &r), 0); /* digits > a->used */
|
||||
#endif
|
||||
|
||||
/* sp_sqrmod: NULL args; undersized dest (r != m path); a too big for
|
||||
* SP_INT_DIGITS when r == m (skipped: needs an operand at the compile
|
||||
* limit, documented residual); normal r != m and r == m. */
|
||||
{
|
||||
mp_int m;
|
||||
XMEMSET(&m, 0, sizeof(m));
|
||||
ExpectIntEQ(sp_init(&m), 0);
|
||||
ExpectIntEQ(sp_2expt(&m, 300), 0);
|
||||
ExpectIntEQ(sp_sqrmod(NULL, &m, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_sqrmod(&a, NULL, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_sqrmod(&a, &m, NULL), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init_size(&r, 1), 0);
|
||||
ExpectIntEQ(sp_sqrmod(&a, &m, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init(&r), 0);
|
||||
ExpectIntEQ(sp_sqrmod(&a, &m, &r), 0); /* r != m */
|
||||
ExpectIntEQ(sp_sqrmod(&m, &m, &m), 0); /* r == m */
|
||||
mp_clear(&m);
|
||||
}
|
||||
|
||||
/* sp_mont_red_ex: NULL args, m == 0; a too small for the reduction
|
||||
* work area (a->size < m->used*2+1); normal. */
|
||||
{
|
||||
mp_int m;
|
||||
sp_int_digit mp;
|
||||
XMEMSET(&m, 0, sizeof(m));
|
||||
ExpectIntEQ(sp_init(&m), 0);
|
||||
ExpectIntEQ(sp_set(&m, 0xF1), 0);
|
||||
ExpectIntEQ(sp_mont_setup(&m, &mp), 0);
|
||||
ExpectIntEQ(sp_mont_red_ex(NULL, &m, mp, 0),
|
||||
WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_mont_red_ex(&a, NULL, mp, 0),
|
||||
WC_NO_ERR_TRACE(MP_VAL));
|
||||
sp_zero(&m); /* zero modulus */
|
||||
ExpectIntEQ(sp_mont_red_ex(&a, &m, mp, 0), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init(&m), 0);
|
||||
ExpectIntEQ(sp_set(&m, 0xF1), 0);
|
||||
ExpectIntEQ(sp_init_size(&a, 1), 0);
|
||||
ExpectIntEQ(sp_set(&a, 3), 0);
|
||||
ExpectIntEQ(sp_mont_red_ex(&a, &m, mp, 0), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init(&a), 0);
|
||||
ExpectIntEQ(sp_set(&a, 3), 0);
|
||||
ExpectIntEQ(sp_mont_red_ex(&a, &m, mp, 0), 0);
|
||||
ExpectIntEQ(sp_init(&a), 0);
|
||||
ExpectIntEQ(sp_set(&a, 3), 0);
|
||||
ExpectIntEQ(sp_mont_red_ex(&a, &m, mp, 1), 0); /* constant-time */
|
||||
#ifdef WOLFSSL_SP_INT_NEGATIVE
|
||||
ExpectIntEQ(sp_init(&a), 0);
|
||||
ExpectIntEQ(sp_set(&a, 3), 0);
|
||||
sp_setneg(&a);
|
||||
ExpectIntEQ(sp_mont_red_ex(&a, &m, mp, 0),
|
||||
WC_NO_ERR_TRACE(MP_VAL)); /* a negative */
|
||||
ExpectIntEQ(sp_init(&a), 0);
|
||||
ExpectIntEQ(sp_set(&a, 3), 0);
|
||||
sp_setneg(&m);
|
||||
ExpectIntEQ(sp_mont_red_ex(&a, &m, mp, 0),
|
||||
WC_NO_ERR_TRACE(MP_VAL)); /* m negative */
|
||||
#endif
|
||||
mp_clear(&m);
|
||||
}
|
||||
|
||||
/* sp_to_unsigned_bin_len(_ct): NULL args, negative outSz; buffer too
|
||||
* small for the value (mid-digit truncation); normal. */
|
||||
ExpectIntEQ(sp_init(&a), 0);
|
||||
ExpectIntEQ(sp_2expt(&a, 200), 0);
|
||||
ExpectIntEQ(sp_to_unsigned_bin_len(NULL, bin, (int)sizeof(bin)),
|
||||
WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_to_unsigned_bin_len(&a, NULL, (int)sizeof(bin)),
|
||||
WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_to_unsigned_bin_len(&a, bin, -1), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_to_unsigned_bin_len(&a, bin, 1), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_to_unsigned_bin_len(&a, bin, (int)sizeof(bin)), 0);
|
||||
ExpectIntEQ(sp_to_unsigned_bin_len_ct(NULL, bin, (int)sizeof(bin)),
|
||||
WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_to_unsigned_bin_len_ct(&a, NULL, (int)sizeof(bin)),
|
||||
WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_to_unsigned_bin_len_ct(&a, bin, -1),
|
||||
WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_to_unsigned_bin_len_ct(&a, bin, (int)sizeof(bin)), 0);
|
||||
|
||||
/* sp_tohex: nowhere else in this file drives it. NULL args + normal
|
||||
* (drives the leading-zero-byte skip loop over the top digit). */
|
||||
ExpectIntEQ(sp_tohex(NULL, buf), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_tohex(&a, NULL), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_tohex(&a, buf), 0);
|
||||
|
||||
/* sp_read_radix (hex): trailing whitespace-only tail is skipped
|
||||
* (before any digit has been seen -> !eol_done true); embedded
|
||||
* whitespace after digits have started is rejected (eol_done already
|
||||
* true -> !eol_done false). The string is parsed from its last
|
||||
* character backwards, so a "trailing" separator here is encountered
|
||||
* first. */
|
||||
ExpectIntEQ(sp_read_radix(&a, "12 \t\n", 16), 0);
|
||||
ExpectIntEQ(sp_read_radix(&a, "12 34", 16), WC_NO_ERR_TRACE(MP_VAL));
|
||||
|
||||
mp_clear(&a);
|
||||
mp_clear(&r);
|
||||
#endif
|
||||
return EXPECT_RESULT();
|
||||
} /* End test_wc_SpIntConvDecisionCoverage */
|
||||
|
||||
/*
|
||||
* Testing sp_invmod / sp_exptmod_ex / sp_gcd / sp_prime_is_prime(_ex):
|
||||
* top-level argument-check and degenerate-input decision branches (the
|
||||
* inverse-mod / mod-exponent / gcd / primality state machines' internal
|
||||
* loops need the exact numeric properties documented as a residual class
|
||||
* in reports/sp-math/RESIDUALS.md).
|
||||
*/
|
||||
int test_wc_SpIntExptGcdDecisionCoverage(void)
|
||||
{
|
||||
EXPECT_DECLS;
|
||||
#if (defined(WOLFSSL_SP_MATH_ALL) || defined(WOLFSSL_SP_MATH)) && \
|
||||
defined(WOLFSSL_PUBLIC_MP)
|
||||
mp_int a;
|
||||
mp_int b;
|
||||
mp_int m;
|
||||
mp_int r;
|
||||
|
||||
XMEMSET(&a, 0, sizeof(a));
|
||||
XMEMSET(&b, 0, sizeof(b));
|
||||
XMEMSET(&m, 0, sizeof(m));
|
||||
XMEMSET(&r, 0, sizeof(r));
|
||||
|
||||
ExpectIntEQ(sp_init(&a), 0);
|
||||
ExpectIntEQ(sp_set(&a, 7), 0);
|
||||
ExpectIntEQ(sp_init(&m), 0);
|
||||
ExpectIntEQ(sp_set(&m, 15), 0);
|
||||
|
||||
/* sp_invmod: NULL args, r == m aliasing; undersized dest
|
||||
* (m->used*2 > r->size); a == 0 or m == 0; a and m both even
|
||||
* (gcd != 1); a == 1 shortcut; normal. */
|
||||
ExpectIntEQ(sp_invmod(NULL, &m, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_invmod(&a, NULL, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_invmod(&a, &m, NULL), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_invmod(&a, &m, &m), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init_size(&r, 1), 0);
|
||||
ExpectIntEQ(sp_invmod(&a, &m, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init(&r), 0);
|
||||
ExpectIntEQ(sp_invmod(&a, &m, &r), 0);
|
||||
sp_zero(&a);
|
||||
ExpectIntEQ(sp_invmod(&a, &m, &r), WC_NO_ERR_TRACE(MP_VAL)); /* a == 0 */
|
||||
sp_zero(&m);
|
||||
ExpectIntEQ(sp_set(&a, 3), 0);
|
||||
ExpectIntEQ(sp_invmod(&a, &m, &r), WC_NO_ERR_TRACE(MP_VAL)); /* m == 0 */
|
||||
ExpectIntEQ(sp_set(&a, 4), 0);
|
||||
ExpectIntEQ(sp_set(&m, 6), 0);
|
||||
ExpectIntEQ(sp_invmod(&a, &m, &r), WC_NO_ERR_TRACE(MP_VAL)); /* both even */
|
||||
ExpectIntEQ(sp_set(&a, 1), 0);
|
||||
ExpectIntEQ(sp_set(&m, 5), 0);
|
||||
ExpectIntEQ(sp_invmod(&a, &m, &r), 0); /* a == 1 shortcut */
|
||||
|
||||
/* sp_exptmod_ex: NULL args, negative digits; m == 0; m == 1
|
||||
* (degenerate: result forced to 0); r aliasing e or m when base isn't
|
||||
* already reduced. */
|
||||
ExpectIntEQ(sp_init(&a), 0);
|
||||
ExpectIntEQ(sp_set(&a, 4), 0);
|
||||
ExpectIntEQ(sp_init(&b), 0);
|
||||
ExpectIntEQ(sp_set(&b, 3), 0);
|
||||
ExpectIntEQ(sp_init(&m), 0);
|
||||
ExpectIntEQ(sp_set(&m, 15), 0);
|
||||
ExpectIntEQ(sp_init(&r), 0);
|
||||
ExpectIntEQ(sp_exptmod_ex(NULL, &b, 0, &m, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_exptmod_ex(&a, NULL, 0, &m, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_exptmod_ex(&a, &b, 0, NULL, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_exptmod_ex(&a, &b, 0, &m, NULL), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_exptmod_ex(&a, &b, -1, &m, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
sp_zero(&m);
|
||||
ExpectIntEQ(sp_exptmod_ex(&a, &b, 0, &m, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_set(&m, 1), 0);
|
||||
ExpectIntEQ(sp_exptmod_ex(&a, &b, 0, &m, &r), 0); /* m == 1: r = 0 */
|
||||
ExpectIntEQ(sp_set(&m, 15), 0);
|
||||
/* Base already less than modulus: ordinary path. */
|
||||
ExpectIntEQ(sp_exptmod_ex(&a, &b, 0, &m, &r), 0);
|
||||
/* r aliases m, base not reduced (a >= m): rejected. */
|
||||
ExpectIntEQ(sp_set(&a, 20), 0);
|
||||
ExpectIntEQ(sp_exptmod_ex(&a, &b, 0, &m, &m), WC_NO_ERR_TRACE(MP_VAL));
|
||||
|
||||
/* sp_gcd: NULL args; a or b too big (>= SP_INT_DIGITS, skipped: needs
|
||||
* an operand at the compile limit, documented residual); undersized
|
||||
* dest; both zero (undefined); a zero, b nonzero (gcd = b); normal;
|
||||
* negative operand rejected under WOLFSSL_SP_INT_NEGATIVE. */
|
||||
ExpectIntEQ(sp_init(&a), 0);
|
||||
ExpectIntEQ(sp_set(&a, 12), 0);
|
||||
ExpectIntEQ(sp_init(&b), 0);
|
||||
ExpectIntEQ(sp_set(&b, 18), 0);
|
||||
ExpectIntEQ(sp_gcd(NULL, &b, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_gcd(&a, NULL, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_gcd(&a, &b, NULL), WC_NO_ERR_TRACE(MP_VAL));
|
||||
/* Undersized dest, a->used(2) <= b->used(3): the size check's FIRST
|
||||
* ('a not bigger') clause fires; r sized 1 is below both. */
|
||||
ExpectIntEQ(sp_init(&a), 0);
|
||||
ExpectIntEQ(sp_2expt(&a, 70), 0);
|
||||
ExpectIntEQ(sp_init(&b), 0);
|
||||
ExpectIntEQ(sp_2expt(&b, 140), 0);
|
||||
ExpectIntEQ(sp_init_size(&r, 1), 0);
|
||||
ExpectIntEQ(sp_gcd(&a, &b, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_init(&r), 0);
|
||||
ExpectIntEQ(sp_gcd(&a, &b, &r), 0);
|
||||
/* Undersized dest, a->used(3) > b->used(2): the size check's SECOND
|
||||
* ('a bigger') clause fires; r sized 1 is below both. */
|
||||
ExpectIntEQ(sp_init(&a), 0);
|
||||
ExpectIntEQ(sp_2expt(&a, 140), 0);
|
||||
ExpectIntEQ(sp_init(&b), 0);
|
||||
ExpectIntEQ(sp_2expt(&b, 70), 0);
|
||||
ExpectIntEQ(sp_init_size(&r, 1), 0);
|
||||
ExpectIntEQ(sp_gcd(&a, &b, &r), WC_NO_ERR_TRACE(MP_VAL));
|
||||
/* Same a > b shape, but r sized to cover b->used exactly: the second
|
||||
* clause's r->size < b->used half now goes false while a->used <
|
||||
* b->used stays true, isolating that operand's independence pair. */
|
||||
ExpectIntEQ(sp_init_size(&r, 2), 0);
|
||||
ExpectIntEQ(sp_gcd(&a, &b, &r), 0);
|
||||
ExpectIntEQ(sp_init(&r), 0);
|
||||
ExpectIntEQ(sp_gcd(&a, &b, &r), 0);
|
||||
ExpectIntEQ(sp_init(&a), 0);
|
||||
ExpectIntEQ(sp_set(&a, 12), 0);
|
||||
ExpectIntEQ(sp_init(&b), 0);
|
||||
ExpectIntEQ(sp_set(&b, 18), 0);
|
||||
ExpectIntEQ(sp_gcd(&a, &b, &r), 0);
|
||||
sp_zero(&a);
|
||||
sp_zero(&b);
|
||||
ExpectIntEQ(sp_gcd(&a, &b, &r), WC_NO_ERR_TRACE(MP_VAL)); /* 0, 0 */
|
||||
ExpectIntEQ(sp_set(&b, 9), 0);
|
||||
ExpectIntEQ(sp_gcd(&a, &b, &r), 0); /* a == 0, b != 0 */
|
||||
#ifdef WOLFSSL_SP_INT_NEGATIVE
|
||||
ExpectIntEQ(sp_init(&a), 0);
|
||||
ExpectIntEQ(sp_set(&a, 12), 0);
|
||||
sp_setneg(&a);
|
||||
ExpectIntEQ(sp_gcd(&a, &b, &r), WC_NO_ERR_TRACE(MP_VAL)); /* a negative */
|
||||
ExpectIntEQ(sp_init(&a), 0);
|
||||
ExpectIntEQ(sp_set(&a, 12), 0);
|
||||
ExpectIntEQ(sp_init(&b), 0);
|
||||
ExpectIntEQ(sp_set(&b, 18), 0);
|
||||
sp_setneg(&b);
|
||||
ExpectIntEQ(sp_gcd(&a, &b, &r), WC_NO_ERR_TRACE(MP_VAL)); /* b negative */
|
||||
#endif
|
||||
|
||||
/* sp_prime_is_prime / sp_prime_is_prime_ex: trials out of range;
|
||||
* a == 1 shortcut; a even (composite, single-digit fast path). */
|
||||
{
|
||||
int result = 0;
|
||||
ExpectIntEQ(sp_init(&a), 0);
|
||||
ExpectIntEQ(sp_set(&a, 17), 0);
|
||||
ExpectIntEQ(sp_prime_is_prime(NULL, 8, &result),
|
||||
WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_prime_is_prime(&a, 8, NULL), WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_prime_is_prime(&a, 0, &result),
|
||||
WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_prime_is_prime(&a, 1000000, &result),
|
||||
WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_set(&a, 1), 0);
|
||||
ExpectIntEQ(sp_prime_is_prime(&a, 8, &result), 0);
|
||||
ExpectIntEQ(result, MP_NO);
|
||||
ExpectIntEQ(sp_set(&a, 4), 0);
|
||||
ExpectIntEQ(sp_prime_is_prime(&a, 8, &result), 0);
|
||||
ExpectIntEQ(result, MP_NO);
|
||||
|
||||
#if !defined(WC_NO_RNG)
|
||||
{
|
||||
WC_RNG rng;
|
||||
XMEMSET(&rng, 0, sizeof(rng));
|
||||
ExpectIntEQ(wc_InitRng(&rng), 0);
|
||||
ExpectIntEQ(sp_prime_is_prime_ex(NULL, 8, &result, &rng),
|
||||
WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_prime_is_prime_ex(&a, 8, NULL, &rng),
|
||||
WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_prime_is_prime_ex(&a, 8, &result, NULL),
|
||||
WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_prime_is_prime_ex(&a, 0, &result, &rng),
|
||||
WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_prime_is_prime_ex(&a, 1000000, &result, &rng),
|
||||
WC_NO_ERR_TRACE(MP_VAL));
|
||||
ExpectIntEQ(sp_set(&a, 1), 0);
|
||||
ExpectIntEQ(sp_prime_is_prime_ex(&a, 8, &result, &rng), 0);
|
||||
ExpectIntEQ(result, MP_NO);
|
||||
DoExpectIntEQ(wc_FreeRng(&rng), 0);
|
||||
}
|
||||
#endif /* !WC_NO_RNG */
|
||||
}
|
||||
|
||||
mp_clear(&a);
|
||||
mp_clear(&b);
|
||||
mp_clear(&m);
|
||||
mp_clear(&r);
|
||||
#endif
|
||||
return EXPECT_RESULT();
|
||||
} /* End test_wc_SpIntExptGcdDecisionCoverage */
|
||||
|
||||
|
||||
@@ -30,6 +30,12 @@ int test_mp_get_rand_digit(void);
|
||||
int test_mp_cond_copy(void);
|
||||
int test_mp_rand(void);
|
||||
int test_wc_export_int(void);
|
||||
int test_wc_SpIntSizeDecisionCoverage(void);
|
||||
int test_wc_SpIntShiftDecisionCoverage(void);
|
||||
int test_wc_SpIntDigitArithDecisionCoverage(void);
|
||||
int test_wc_SpIntArithDecisionCoverage(void);
|
||||
int test_wc_SpIntConvDecisionCoverage(void);
|
||||
int test_wc_SpIntExptGcdDecisionCoverage(void);
|
||||
|
||||
#define TEST_WOLFMATH_DECLS \
|
||||
TEST_DECL_GROUP("wolfmath", test_mp_get_digit_count), \
|
||||
@@ -37,6 +43,12 @@ int test_wc_export_int(void);
|
||||
TEST_DECL_GROUP("wolfmath", test_mp_get_rand_digit), \
|
||||
TEST_DECL_GROUP("wolfmath", test_mp_cond_copy), \
|
||||
TEST_DECL_GROUP("wolfmath", test_mp_rand), \
|
||||
TEST_DECL_GROUP("wolfmath", test_wc_export_int)
|
||||
TEST_DECL_GROUP("wolfmath", test_wc_export_int), \
|
||||
TEST_DECL_GROUP("wolfmath", test_wc_SpIntSizeDecisionCoverage), \
|
||||
TEST_DECL_GROUP("wolfmath", test_wc_SpIntShiftDecisionCoverage), \
|
||||
TEST_DECL_GROUP("wolfmath", test_wc_SpIntDigitArithDecisionCoverage),\
|
||||
TEST_DECL_GROUP("wolfmath", test_wc_SpIntArithDecisionCoverage), \
|
||||
TEST_DECL_GROUP("wolfmath", test_wc_SpIntConvDecisionCoverage), \
|
||||
TEST_DECL_GROUP("wolfmath", test_wc_SpIntExptGcdDecisionCoverage)
|
||||
|
||||
#endif /* WOLFCRYPT_TEST_WOLFMATH_H */
|
||||
|
||||
@@ -0,0 +1,150 @@
|
||||
/* test_sp_int_whitebox.c
|
||||
*
|
||||
* White-box MC/DC supplement for wolfcrypt/src/sp_int.c (the sp-math
|
||||
* module, iso26262/mcdc-per-module).
|
||||
*
|
||||
* The tests/api wolfmath suite (test_wolfmath.c) drives sp_int.c through its
|
||||
* *public* mp_ / sp_ API, including deliberately undersized destinations and
|
||||
* out-of-range arguments to reach internal size/capacity guards. A small
|
||||
* number of decisions instead depend on the sp_int *not* being normalized
|
||||
* (a leading or trailing zero digit while sp_int::used still counts it) -
|
||||
* a state every public entry point's own sp_clamp()-on-exit invariant
|
||||
* prevents a caller from ever producing. This translation unit reaches them
|
||||
* by compiling sp_int.c directly (#include) and constructing that state via
|
||||
* direct sp_int::dp/used field writes (the struct is a plain, non-opaque
|
||||
* type; only the ability to leave it non-normalized is "impossible" from
|
||||
* the public API).
|
||||
*
|
||||
* Coverage from this binary is unioned with the tests/api variant coverage
|
||||
* by source line:col in the per-module campaign: llvm-cov computes MC/DC
|
||||
* independence PER BINARY, and the campaign's aggregate.sh ORs the
|
||||
* "independence shown" bit across binaries by key. That is why every pair
|
||||
* below is completed *within this file* rather than relying on the API
|
||||
* tests to supply the other half.
|
||||
*
|
||||
* Build: compiled by run-mcdc-par.sh's white-box step with the SAME MC/DC
|
||||
* CFLAGS and -I<workspace> as the instrumented library, then linked against
|
||||
* that variant's libwolfssl.a with its sp_int.o removed (this TU supplies
|
||||
* the instrumented sp_int.c). NOT part of the wolfSSL build; not registered
|
||||
* in tests/api. See tests/unit-mcdc/README.md.
|
||||
*
|
||||
* Targeted residuals (sp_int.c), by class:
|
||||
* Class 1 sp_count_bits() leading-zero-digit trim loop ........ 2 conditions
|
||||
* Class 2 sp_cnt_lsb() least-significant-zero-digit loop ....... 1 condition
|
||||
* See reports/sp-math/RESIDUALS.md for the remaining union residuals
|
||||
* (structural dead guards, deep invmod/exptmod/prime/gcd state-machine
|
||||
* internals, the SP-accelerated-backend-entangled mBits dispatch, the
|
||||
* SMALL_STACK allocation-ceiling macros, and the 32-bit SP_WORD_SIZE axis).
|
||||
*/
|
||||
|
||||
/* Pull sp_int.c in verbatim so its file-static helpers and the sp_int
|
||||
* struct's fields are in scope and instrumented in THIS binary. sp_int.c
|
||||
* includes settings.h (which picks up user_settings.h via
|
||||
* -DWOLFSSL_USER_SETTINGS) and sp_int.h itself. */
|
||||
#include <wolfcrypt/src/sp_int.c>
|
||||
|
||||
#include <stdio.h>
|
||||
|
||||
static int wb_fail = 0;
|
||||
#define WB_NOTE(msg) do { printf(" [wb] %s\n", (msg)); } while (0)
|
||||
|
||||
#if defined(WOLFSSL_SP_MATH_ALL) || defined(WOLFSSL_SP_MATH)
|
||||
|
||||
/* ------------------------------------------------------------------------- *
|
||||
* Class 1: sp_count_bits() leading-zero-digit trim loop.
|
||||
*
|
||||
* n = a->used - 1;
|
||||
* while ((n >= 0) && (a->dp[n] == 0)) { n--; }
|
||||
*
|
||||
* Every public mutator normalizes (sp_clamp) before returning, so a caller
|
||||
* can never hand sp_count_bits() an sp_int whose top digit(s) are zero while
|
||||
* ->used still counts them - reach it by writing ->used/->dp directly.
|
||||
* ------------------------------------------------------------------------- */
|
||||
static void wb_count_bits_leading_zero(void)
|
||||
{
|
||||
sp_int a;
|
||||
|
||||
XMEMSET(&a, 0, sizeof(a));
|
||||
(void)sp_init(&a);
|
||||
|
||||
/* Non-normalized: used=3 but the top two digits are zero. Both halves
|
||||
* of "a->dp[n] == 0" (true while trimming, false once n reaches the
|
||||
* nonzero digit) are exercised in this one call; "n >= 0" true/false
|
||||
* are both exercised too (loop continues, then also runs out at n<0
|
||||
* in the second call below). */
|
||||
a.used = 3;
|
||||
a.dp[0] = 1;
|
||||
a.dp[1] = 0;
|
||||
a.dp[2] = 0;
|
||||
(void)sp_count_bits(&a);
|
||||
|
||||
/* All digits zero (still ->used > 0, non-normalized): the loop runs
|
||||
* n all the way down to -1, exercising the "n >= 0" false side from
|
||||
* the loop's own decrement rather than an immediate zero-used skip. */
|
||||
a.used = 2;
|
||||
a.dp[0] = 0;
|
||||
a.dp[1] = 0;
|
||||
(void)sp_count_bits(&a);
|
||||
|
||||
/* Normalized single nonzero digit: dp[n] == 0 false on the very first
|
||||
* check (n == 0, top digit nonzero) - the ordinary, API-reachable case,
|
||||
* repeated here so both conditions' pairs are complete within this one
|
||||
* binary. */
|
||||
a.used = 1;
|
||||
a.dp[0] = 5;
|
||||
(void)sp_count_bits(&a);
|
||||
|
||||
WB_NOTE("sp_count_bits leading-zero-digit trim loop exercised");
|
||||
}
|
||||
|
||||
/* ------------------------------------------------------------------------- *
|
||||
* Class 2: sp_cnt_lsb() least-significant-zero-digit loop.
|
||||
*
|
||||
* for (i = 0; (i < a->used) && (a->dp[i] == 0); i++, bc += SP_WORD_SIZE) {}
|
||||
*
|
||||
* Same reasoning as Class 1: a normalized sp_int's lowest used digit need
|
||||
* not be nonzero (unlike the top digit, sp_clamp does not trim low zero
|
||||
* digits), so "a->dp[i] == 0" true IS reachable from the API (e.g. any
|
||||
* value that is a multiple of 2^SP_WORD_SIZE) - what is not reachable is
|
||||
* "i < a->used" false arising from the loop running past every digit
|
||||
* because ->used over-counts an all-zero-digit number (the sp_iszero()
|
||||
* guard ahead of the loop rejects a true all-zero value first). Construct
|
||||
* that directly.
|
||||
* ------------------------------------------------------------------------- */
|
||||
static void wb_cnt_lsb_all_zero_digits(void)
|
||||
{
|
||||
sp_int a;
|
||||
|
||||
XMEMSET(&a, 0, sizeof(a));
|
||||
(void)sp_init(&a);
|
||||
|
||||
/* Non-normalized all-zero-digit value with ->used > 0: sp_iszero()
|
||||
* checks ->used == 0, so this slips past it and the for-loop runs to
|
||||
* i == a->used (loop condition false via "i < a->used", not via
|
||||
* dp[i] == 0 going false). */
|
||||
a.used = 2;
|
||||
a.dp[0] = 0;
|
||||
a.dp[1] = 0;
|
||||
(void)sp_cnt_lsb(&a);
|
||||
|
||||
WB_NOTE("sp_cnt_lsb least-significant-zero-digit loop exercised");
|
||||
}
|
||||
|
||||
#endif /* WOLFSSL_SP_MATH_ALL || WOLFSSL_SP_MATH */
|
||||
|
||||
int main(void)
|
||||
{
|
||||
printf("sp_int.c white-box MC/DC supplement\n");
|
||||
#if !defined(WOLFSSL_SP_MATH_ALL) && !defined(WOLFSSL_SP_MATH)
|
||||
printf(" neither WOLFSSL_SP_MATH_ALL nor WOLFSSL_SP_MATH defined;"
|
||||
" nothing to exercise\n");
|
||||
return 0;
|
||||
#else
|
||||
wb_count_bits_leading_zero();
|
||||
wb_cnt_lsb_all_zero_digits();
|
||||
printf("done (%s)\n", wb_fail ? "with skips" : "ok");
|
||||
/* Setup failures are surfaced as skips, not test failures: the campaign
|
||||
* treats a nonzero exit as a failed variant and discards its coverage. */
|
||||
return 0;
|
||||
#endif
|
||||
}
|
||||
Reference in New Issue
Block a user