crypto/dsa/dsa_gen.c:565: error: BUFFER_OVERRUN_L3
  Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `BN_mod_exp_mont`.
Showing all 23 steps of the trace


crypto/dsa/dsa_gen.c:390:10: Call
388.       }
389.   
390.       if (!BN_lshift(test, BN_value_one(), L - 1))
                ^
391.           goto err;
392.       for (;;) {

crypto/bn/bn_shift.c:83:1: Parameter `r->top`
  81.   }
  82.   
  83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
  84.   {
  85.       int i, nw, lb, rb;

crypto/dsa/dsa_gen.c:565:14: Call
563.           }
564.           /* g=test^r0%p */
565.           if (!BN_mod_exp_mont(g, test, r0, p, ctx, mont))
                    ^
566.               goto err;
567.           if (!BN_is_one(g))

crypto/bn/bn_exp.c:296:1: Parameter `a->top`
  294.   }
  295.   
  296. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
  297.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
  298.   {

crypto/bn/bn_exp.c:310:16: Call
  308.               || BN_get_flags(a, BN_FLG_CONSTTIME) != 0
  309.               || BN_get_flags(m, BN_FLG_CONSTTIME) != 0) {
  310.           return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
                        ^
  311.       }
  312.   

crypto/bn/bn_exp.c:597:1: Parameter `a->top`
    595.    * http://www.daemonology.net/hyperthreading-considered-harmful/)
    596.    */
    597. > int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
    598.                                 const BIGNUM *m, BN_CTX *ctx,
    599.                                 BN_MONT_CTX *in_mont)

crypto/bn/bn_exp.c:760:17: Call
    758.           if (!bn_to_mont_fixed_top(&am, &am, mont, ctx))
    759.               goto err;
    760.       } else if (!bn_to_mont_fixed_top(&am, a, mont, ctx))
                           ^
    761.           goto err;
    762.   

crypto/bn/bn_mont.c:210:1: Parameter `a->top`
      208.   }
      209.   
      210. > int bn_to_mont_fixed_top(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
      211.                            BN_CTX *ctx)
      212.   {

crypto/bn/bn_mont.c:213:12: Call
      211.                            BN_CTX *ctx)
      212.   {
      213.       return bn_mul_mont_fixed_top(r, a, &(mont->RR), mont, ctx);
                        ^
      214.   }
      215.   

crypto/bn/bn_mont.c:37:1: Parameter `b->top`
        35.   }
        36.   
        37. > int bn_mul_mont_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
        38.                             BN_MONT_CTX *mont, BN_CTX *ctx)
        39.   {

crypto/bn/bn_mont.c:67:14: Call
        65.       bn_check_top(tmp);
        66.       if (a == b) {
        67.           if (!BN_sqr(tmp, a, ctx))
                           ^
        68.               goto err;
        69.       } else {

crypto/bn/bn_sqr.c:17:1: Parameter `a->top`
          15.    * I've just gone over this and it is now %20 faster on x86 - eay - 27 Jun 96
          16.    */
          17. > int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
          18.   {
          19.       int max, al;

crypto/bn/bn_sqr.c:25:5: Assignment
          23.       bn_check_top(a);
          24.   
          25.       al = a->top;
                    ^
          26.       if (al <= 0) {
          27.           r->top = 0;

crypto/bn/bn_sqr.c:74:17: Call
          72.                   if (bn_wexpand(tmp, max) == NULL)
          73.                       goto err;
          74.                   bn_sqr_normal(rr->d, a->d, al, tmp->d);
                                ^
          75.               }
          76.           }

crypto/bn/bn_sqr.c:99:1: <Offset trace>
97.   
98.   /* tmp must have 2*n words */
99. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
100.   {
101.       int i, j, max;

crypto/bn/bn_sqr.c:99:1: Parameter `n`
            97.   
            98.   /* tmp must have 2*n words */
            99. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
            100.   {
            101.       int i, j, max;

crypto/bn/bn_sqr.c:110:5: Assignment
            108.       rp[0] = rp[max - 1] = 0;
            109.       rp++;
            110.       j = n;
                       ^
            111.   
            112.       if (--j > 0) {

crypto/bn/bn_sqr.c:112:9: Assignment
            110.       j = n;
            111.   
            112.       if (--j > 0) {
                           ^
            113.           ap++;
            114.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);

crypto/bn/bn_sqr.c:99:1: <Length trace>
97.   
98.   /* tmp must have 2*n words */
99. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
100.   {
101.       int i, j, max;

crypto/bn/bn_sqr.c:99:1: Parameter `*r`
            97.   
            98.   /* tmp must have 2*n words */
            99. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
            100.   {
            101.       int i, j, max;

crypto/bn/bn_sqr.c:107:5: Assignment
            105.       max = n * 2;
            106.       ap = a;
            107.       rp = r;
                       ^
            108.       rp[0] = rp[max - 1] = 0;
            109.       rp++;

crypto/bn/bn_sqr.c:109:5: Assignment
            107.       rp = r;
            108.       rp[0] = rp[max - 1] = 0;
            109.       rp++;
                       ^
            110.       j = n;
            111.   

crypto/bn/bn_sqr.c:114:9: Array access: Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `BN_mod_exp_mont` 
            112.       if (--j > 0) {
            113.           ap++;
            114.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);
                           ^
            115.           rp += 2;
            116.       }
