crypto/dsa/dsa_gen.c:256: 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:108:10: Call
106.           goto err;
107.   
108.       if (!BN_lshift(test, BN_value_one(), bits - 1))
                ^
109.           goto err;
110.   

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:256:14: Call
254.       for (;;) {
255.           /* g=test^r0%p */
256.           if (!BN_mod_exp_mont(g, test, r0, p, ctx, mont))
                    ^
257.               goto err;
258.           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:598:1: Parameter `a->top`
    596.    * http://www.daemonology.net/hyperthreading-considered-harmful/)
    597.    */
    598. > int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
    599.                                 const BIGNUM *m, BN_CTX *ctx,
    600.                                 BN_MONT_CTX *in_mont)

crypto/bn/bn_exp.c:755:17: Call
    753.           if (!BN_to_montgomery(&am, &am, mont, ctx))
    754.               goto err;
    755.       } else if (!BN_to_montgomery(&am, a, mont, ctx))
                           ^
    756.           goto err;
    757.   

crypto/bn/bn_lib.c:880:1: Parameter `a->top`
      878.   }
      879.   
      880. > int BN_to_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
      881.                        BN_CTX *ctx)
      882.   {

crypto/bn/bn_lib.c:883:12: Call
      881.                        BN_CTX *ctx)
      882.   {
      883.       return BN_mod_mul_montgomery(r, a, &(mont->RR), mont, ctx);
                        ^
      884.   }
      885.   

crypto/bn/bn_mont.c:26:1: Parameter `a->top`
        24.   #endif
        25.   
        26. > int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
        27.                             BN_MONT_CTX *mont, BN_CTX *ctx)
        28.   {

crypto/bn/bn_mont.c:53:14: Call
        51.       bn_check_top(tmp);
        52.       if (a == b) {
        53.           if (!BN_sqr(tmp, a, ctx))
                           ^
        54.               goto err;
        55.       } 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:105:1: <Offset trace>
103.   
104.   /* tmp must have 2*n words */
105. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
106.   {
107.       int i, j, max;

crypto/bn/bn_sqr.c:105:1: Parameter `n`
            103.   
            104.   /* tmp must have 2*n words */
            105. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
            106.   {
            107.       int i, j, max;

crypto/bn/bn_sqr.c:116:5: Assignment
            114.       rp[0] = rp[max - 1] = 0;
            115.       rp++;
            116.       j = n;
                       ^
            117.   
            118.       if (--j > 0) {

crypto/bn/bn_sqr.c:118:9: Assignment
            116.       j = n;
            117.   
            118.       if (--j > 0) {
                           ^
            119.           ap++;
            120.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);

crypto/bn/bn_sqr.c:105:1: <Length trace>
103.   
104.   /* tmp must have 2*n words */
105. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
106.   {
107.       int i, j, max;

crypto/bn/bn_sqr.c:105:1: Parameter `*r`
            103.   
            104.   /* tmp must have 2*n words */
            105. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
            106.   {
            107.       int i, j, max;

crypto/bn/bn_sqr.c:113:5: Assignment
            111.       max = n * 2;
            112.       ap = a;
            113.       rp = r;
                       ^
            114.       rp[0] = rp[max - 1] = 0;
            115.       rp++;

crypto/bn/bn_sqr.c:115:5: Assignment
            113.       rp = r;
            114.       rp[0] = rp[max - 1] = 0;
            115.       rp++;
                       ^
            116.       j = n;
            117.   

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