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


crypto/bn/bn_exp2.c:72:14: Call
70.        */
71.       if (a1->neg || BN_ucmp(a1, m) >= 0) {
72.           if (!BN_mod(val1[0], a1, m, ctx))
                   ^
73.               goto err;
74.           a_mod_m = val1[0];

crypto/bn/bn_div.c:137:1: Parameter `rm->top`
  135.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
  136.    */
  137. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
  138.              BN_CTX *ctx)
  139.   {

crypto/bn/bn_exp2.c:83:10: Call
81.       }
82.   
83.       if (!BN_to_montgomery(val1[0], a_mod_m, mont, ctx))
               ^
84.           goto err;
85.       if (window1 > 1) {

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

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

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:29:15: Call
    27.                             BN_MONT_CTX *mont, BN_CTX *ctx)
    28.   {
    29.       int ret = bn_mul_mont_fixed_top(r, a, b, mont, ctx);
                        ^
    30.   
    31.       bn_correct_top(r);

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_montgomery` 
          106.       ap = a;
          107.       rp = r;
          108.       rp[0] = rp[max - 1] = 0;
                             ^
          109.       rp++;
          110.       j = n;
