crypto/bn/bn_exp.c:1075: error: BUFFER_OVERRUN_L3
  Offset: [2, 15] (⇐ 1 + [1, 14]) Size: [0, 8388607] by call to `BN_mod_mul_montgomery`.
Showing all 21 steps of the trace


crypto/bn/bn_exp.c:745:14: Assignment
743.           /* 2^(top*BN_BITS2) - m */
744.           tmp.d[0] = (0 - m->d[0]) & BN_MASK2;
745.           for (i = 1; i < top; i++)
                    ^
746.               tmp.d[i] = (~m->d[i]) & BN_MASK2;
747.           tmp.top = top;

crypto/bn/bn_exp.c:1062:14: Call
1060.           bits -= window0;
1061.           wvalue = bn_get_bits(p, bits) & wmask;
1062.           if (!MOD_EXP_CTIME_COPY_FROM_PREBUF(&tmp, top, powerbuf, wvalue,
                     ^
1063.                                               window))
1064.               goto err;

crypto/bn/bn_exp.c:520:1: Parameter `top`
  518.   }
  519.   
  520. > static int MOD_EXP_CTIME_COPY_FROM_PREBUF(BIGNUM *b, int top,
  521.                                             unsigned char *buf, int idx,
  522.                                             int window)

crypto/bn/bn_exp.c:577:5: Assignment
  575.       }
  576.   
  577.       b->top = top;
             ^
  578.       bn_correct_top(b);
  579.       return 1;

crypto/bn/bn_exp.c:578:5: Call
  576.   
  577.       b->top = top;
  578.       bn_correct_top(b);
             ^
  579.       return 1;
  580.   }

crypto/bn/bn_lib.c:947:1: Parameter `a->top`
    945.   }
    946.   
    947. > void bn_correct_top(BIGNUM *a)
    948.   {
    949.       BN_ULONG *ftl;

crypto/bn/bn_exp.c:1075:22: Call
1073.               /* Square the result window-size times */
1074.               for (i = 0; i < window; i++)
1075.                   if (!BN_mod_mul_montgomery(&tmp, &tmp, &tmp, mont, ctx))
                             ^
1076.                       goto err;
1077.   

crypto/bn/bn_mont.c:26:1: Parameter `b->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:56:14: Call
  54.       bn_check_top(tmp);
  55.       if (a == b) {
  56.           if (!BN_sqr(tmp, a, ctx))
                     ^
  57.               goto err;
  58.       } 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:60:13: Call
    58.           if (al < BN_SQR_RECURSIVE_SIZE_NORMAL) {
    59.               BN_ULONG t[BN_SQR_RECURSIVE_SIZE_NORMAL * 2];
    60.               bn_sqr_normal(rr->d, a->d, al, t);
                      ^
    61.           } else {
    62.               int j, k;

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: [2, 15] (⇐ 1 + [1, 14]) Size: [0, 8388607] by call to `BN_mod_mul_montgomery` 
      112.       if (--j > 0) {
      113.           ap++;
      114.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);
                     ^
      115.           rp += 2;
      116.       }
