crypto/bn/bn_exp.c:1055: 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:743:14: Assignment
741.           /* 2^(top*BN_BITS2) - m */
742.           tmp.d[0] = (0 - m->d[0]) & BN_MASK2;
743.           for (i = 1; i < top; i++)
                    ^
744.               tmp.d[i] = (~m->d[i]) & BN_MASK2;
745.           tmp.top = top;

crypto/bn/bn_exp.c:1042:14: Call
1040.           for (wvalue = 0, i = bits % window; i >= 0; i--, bits--)
1041.               wvalue = (wvalue << 1) + BN_is_bit_set(p, bits);
1042.           if (!MOD_EXP_CTIME_COPY_FROM_PREBUF(&tmp, top, powerbuf, wvalue,
                     ^
1043.                                               window))
1044.               goto err;

crypto/bn/bn_exp.c:524:1: Parameter `top`
  522.   }
  523.   
  524. > static int MOD_EXP_CTIME_COPY_FROM_PREBUF(BIGNUM *b, int top,
  525.                                             unsigned char *buf, int idx,
  526.                                             int window)

crypto/bn/bn_exp.c:581:5: Assignment
  579.       }
  580.   
  581.       b->top = top;
             ^
  582.       bn_correct_top(b);
  583.       return 1;

crypto/bn/bn_exp.c:582:5: Call
  580.   
  581.       b->top = top;
  582.       bn_correct_top(b);
             ^
  583.       return 1;
  584.   }

crypto/bn/bn_lib.c:1021:1: Parameter `a->top`
    1019.   }
    1020.   
    1021. > void bn_correct_top(BIGNUM *a)
    1022.   {
    1023.       BN_ULONG *ftl;

crypto/bn/bn_exp.c:1055:22: Call
1053.               /* Scan the window, squaring the result as we go */
1054.               for (i = 0; i < window; i++, bits--) {
1055.                   if (!BN_mod_mul_montgomery(&tmp, &tmp, &tmp, mont, ctx))
                             ^
1056.                       goto err;
1057.                   wvalue = (wvalue << 1) + BN_is_bit_set(p, bits);

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: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:104:1: <Offset trace>
102.   
103.   /* tmp must have 2*n words */
104. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
105.   {
106.       int i, j, max;

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

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

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

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

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

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

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

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