crypto/dsa/dsa_ossl.c:299: error: BUFFER_OVERRUN_L3
  Offset: 0 Size: [0, 8388607] by call to `BN_mod_mul`.
Showing all 11 steps of the trace


crypto/dsa/dsa_ossl.c:233:1: Parameter `sig->r->d`
231.   }
232.   
233. > static int dsa_do_verify(const unsigned char *dgst, int dgst_len,
234.                            DSA_SIG *sig, DSA *dsa)
235.   {

crypto/dsa/dsa_ossl.c:299:10: Call
297.   
298.       /* u2 = r * w mod q */
299.       if (!BN_mod_mul(u2, r, u2, dsa->q, ctx))
                ^
300.           goto err;
301.   

crypto/bn/bn_mod.c:73:1: Parameter `*a->d`
  71.   
  72.   /* slow but works */
  73. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  74.                  BN_CTX *ctx)
  75.   {

crypto/bn/bn_mod.c:90:14: Call
  88.               goto err;
  89.       } else {
  90.           if (!BN_mul(t, a, b, ctx))
                     ^
  91.               goto err;
  92.       }

crypto/bn/bn_mul.c:497:1: Parameter `*a->d`
    495.   #endif                          /* BN_RECURSION */
    496.   
    497. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
    498.   {
    499.       int ret = 0;

crypto/bn/bn_mul.c:577:17: Call
    575.                   if (bn_wexpand(rr, k * 4) == NULL)
    576.                       goto err;
    577.                   bn_mul_part_recursive(rr->d, a->d, b->d,
                           ^
    578.                                         j, al - j, bl - j, t->d);
    579.               } else {            /* al <= j || bl <= j */

crypto/bn/bn_mul.c:322:1: Parameter `*a`
      320.    */
      321.   /* tnX may not be negative but less than n */
      322. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
      323.                              int tna, int tnb, BN_ULONG *t)
      324.   {

crypto/bn/bn_mul.c:330:9: Call
      328.   
      329.       if (n < 8) {
      330.           bn_mul_normal(r, a, n + tna, b, n + tnb);
                     ^
      331.           return;
      332.       }

crypto/bn/bn_mul.c:612:1: <Length trace>
610.   }
611.   
612. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
613.   {
614.       BN_ULONG *rr;

crypto/bn/bn_mul.c:612:1: Parameter `*b`
        610.   }
        611.   
        612. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
        613.   {
        614.       BN_ULONG *rr;

crypto/bn/bn_mul.c:633:40: Array access: Offset: 0 Size: [0, 8388607] by call to `BN_mod_mul` 
        631.           return;
        632.       } else
        633.           rr[0] = bn_mul_words(r, a, na, b[0]);
                                                      ^
        634.   
        635.       for (;;) {
