crypto/bn/bn_exp2.c:111: 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: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:111:10: Call
109.           goto err;
110.       }
111.       if (!BN_to_montgomery(val2[0], a_mod_m, mont, ctx))
                ^
112.           goto err;
113.       if (window2 > 1) {

crypto/bn/bn_lib.c:871:1: Parameter `a->top`
  869.   }
  870.   
  871. > int BN_to_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
  872.                        BN_CTX *ctx)
  873.   {

crypto/bn/bn_lib.c:874:12: Call
  872.                        BN_CTX *ctx)
  873.   {
  874.       return BN_mod_mul_montgomery(r, a, &(mont->RR), mont, ctx);
                    ^
  875.   }
  876.   

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