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


crypto/bn/bn_exp.c:345:14: Call
343.           if ((mont = BN_MONT_CTX_new()) == NULL)
344.               goto err;
345.           if (!BN_MONT_CTX_set(mont, m, ctx))
                    ^
346.               goto err;
347.       }

crypto/bn/bn_mont.c:328:14: Call
  326.           if ((BN_mod_inverse(Ri, R, &tmod, ctx)) == NULL)
  327.               goto err;
  328.           if (!BN_lshift(Ri, Ri, BN_BITS2))
                      ^
  329.               goto err;           /* R*Ri */
  330.           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:360:10: Call
358.           goto err;
359.       }
360.       if (!BN_to_montgomery(val[0], aa, mont, ctx))
                ^
361.           goto err;               /* 1 */
362.   

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

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

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:111:5: Assignment
        109.       BN_ULONG *rp;
        110.   
        111.       max = n * 2;
                   ^
        112.       ap = a;
        113.       rp = r;

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:114:13: Array access: Offset: [31, +oo] Size: [0, 8388607] by call to `BN_to_montgomery` 
        112.       ap = a;
        113.       rp = r;
        114.       rp[0] = rp[max - 1] = 0;
                           ^
        115.       rp++;
        116.       j = n;
