crypto/bn/bn_exp2.c:212: error: BUFFER_OVERRUN_L3
  Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `BN_to_montgomery`.
Showing all 19 steps of the trace


crypto/bn/bn_exp2.c:173:14: Call
171.        */
172.       if (a1->neg || BN_ucmp(a1, m) >= 0) {
173.           if (!BN_mod(val1[0], a1, m, ctx))
                    ^
174.               goto err;
175.           a_mod_m = val1[0];

crypto/bn/bn_div.c:188:1: Parameter `rm->top`
  186.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
  187.    */
  188. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
  189.              BN_CTX *ctx)
  190.   {

crypto/bn/bn_exp2.c:212:10: Call
210.           goto err;
211.       }
212.       if (!BN_to_montgomery(val2[0], a_mod_m, mont, ctx))
                ^
213.           goto err;
214.       if (window2 > 1) {

crypto/bn/bn_lib.c:996:1: Parameter `a->top`
  994.   }
  995.   
  996. > int BN_to_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
  997.                        BN_CTX *ctx)
  998.   {

crypto/bn/bn_lib.c:999:12: Call
  997.                        BN_CTX *ctx)
  998.   {
  999.       return BN_mod_mul_montgomery(r, a, &(mont->RR), mont, ctx);
                     ^
  1000.   }
  1001.   

crypto/bn/bn_mont.c:127:1: Parameter `a->top`
    125.   #endif
    126.   
    127. > int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
    128.                             BN_MONT_CTX *mont, BN_CTX *ctx)
    129.   {

crypto/bn/bn_mont.c:154:14: Call
    152.       bn_check_top(tmp);
    153.       if (a == b) {
    154.           if (!BN_sqr(tmp, a, ctx))
                        ^
    155.               goto err;
    156.       } else {

crypto/bn/bn_sqr.c:65:1: Parameter `a->top`
      63.    * I've just gone over this and it is now %20 faster on x86 - eay - 27 Jun 96
      64.    */
      65. > int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
      66.   {
      67.       int max, al;

crypto/bn/bn_sqr.c:73:5: Assignment
      71.       bn_check_top(a);
      72.   
      73.       al = a->top;
                ^
      74.       if (al <= 0) {
      75.           r->top = 0;

crypto/bn/bn_sqr.c:122:17: Call
      120.                   if (bn_wexpand(tmp, max) == NULL)
      121.                       goto err;
      122.                   bn_sqr_normal(rr->d, a->d, al, tmp->d);
                             ^
      123.               }
      124.           }

crypto/bn/bn_sqr.c:152:1: <Offset trace>
150.   
151.   /* tmp must have 2*n words */
152. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
153.   {
154.       int i, j, max;

crypto/bn/bn_sqr.c:152:1: Parameter `n`
        150.   
        151.   /* tmp must have 2*n words */
        152. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
        153.   {
        154.       int i, j, max;

crypto/bn/bn_sqr.c:163:5: Assignment
        161.       rp[0] = rp[max - 1] = 0;
        162.       rp++;
        163.       j = n;
                   ^
        164.   
        165.       if (--j > 0) {

crypto/bn/bn_sqr.c:165:9: Assignment
        163.       j = n;
        164.   
        165.       if (--j > 0) {
                       ^
        166.           ap++;
        167.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);

crypto/bn/bn_sqr.c:152:1: <Length trace>
150.   
151.   /* tmp must have 2*n words */
152. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
153.   {
154.       int i, j, max;

crypto/bn/bn_sqr.c:152:1: Parameter `*r`
        150.   
        151.   /* tmp must have 2*n words */
        152. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
        153.   {
        154.       int i, j, max;

crypto/bn/bn_sqr.c:160:5: Assignment
        158.       max = n * 2;
        159.       ap = a;
        160.       rp = r;
                   ^
        161.       rp[0] = rp[max - 1] = 0;
        162.       rp++;

crypto/bn/bn_sqr.c:162:5: Assignment
        160.       rp = r;
        161.       rp[0] = rp[max - 1] = 0;
        162.       rp++;
                   ^
        163.       j = n;
        164.   

crypto/bn/bn_sqr.c:167:9: Array access: Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `BN_to_montgomery` 
        165.       if (--j > 0) {
        166.           ap++;
        167.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);
                       ^
        168.           rp += 2;
        169.       }
