crypto/bn/bn_exp.c:364: error: BUFFER_OVERRUN_L3
  Offset: [31, +oo] Size: [0, 8388607] by call to `bn_to_mont_fixed_top`.
Showing all 18 steps of the trace


crypto/bn/bn_exp.c:349:14: Call
347.           if ((mont = BN_MONT_CTX_new()) == NULL)
348.               goto err;
349.           if (!BN_MONT_CTX_set(mont, m, ctx))
                    ^
350.               goto err;
351.       }

crypto/bn/bn_mont.c:341:14: Call
  339.           else if ((BN_mod_inverse(Ri, R, &tmod, ctx)) == NULL)
  340.               goto err;
  341.           if (!BN_lshift(Ri, Ri, BN_BITS2))
                      ^
  342.               goto err;           /* R*Ri */
  343.           if (!BN_is_zero(Ri)) {

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/bn/bn_exp.c:364:10: Call
362.           goto err;
363.       }
364.       if (!bn_to_mont_fixed_top(val[0], aa, mont, ctx))
                ^
365.           goto err;               /* 1 */
366.   

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:105:5: Assignment
        103.       BN_ULONG *rp;
        104.   
        105.       max = n * 2;
                   ^
        106.       ap = a;
        107.       rp = r;

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:108:13: Array access: Offset: [31, +oo] Size: [0, 8388607] by call to `bn_to_mont_fixed_top` 
        106.       ap = a;
        107.       rp = r;
        108.       rp[0] = rp[max - 1] = 0;
                           ^
        109.       rp++;
        110.       j = n;
