crypto/bn/bn_mont.c:175: error: BUFFER_OVERRUN_S2
  Offset: [max(1, `mont->N.top`), +oo] (⇐ [0, +oo] + [max(1, `mont->N.top`), `mont->N.top`]) Size: [0, 8388607] by call to `BN_from_montgomery_word`.
Showing all 10 steps of the trace


crypto/bn/bn_mont.c:166:1: Parameter `mont->N.top`
164.   #endif                          /* MONT_WORD */
165.   
166. > int BN_from_montgomery(BIGNUM *ret, const BIGNUM *a, BN_MONT_CTX *mont,
167.                          BN_CTX *ctx)
168.   {

crypto/bn/bn_mont.c:175:16: Call
173.       BN_CTX_start(ctx);
174.       if ((t = BN_CTX_get(ctx)) && BN_copy(t, a))
175.           retn = BN_from_montgomery_word(ret, t, mont);
                      ^
176.       BN_CTX_end(ctx);
177.   #else                           /* !MONT_WORD */

crypto/bn/bn_mont.c:104:21: <Offset trace>
102.       n0 = mont->n0[0];
103.   
104.       for (carry = 0, i = 0; i < nl; i++, rp++) {
                           ^
105.           v = bn_mul_add_words(rp, np, nl, (rp[0] * n0) & BN_MASK2);
106.           v = (v + carry + rp[nl]) & BN_MASK2;

crypto/bn/bn_mont.c:104:21: Assignment
  102.       n0 = mont->n0[0];
  103.   
  104.       for (carry = 0, i = 0; i < nl; i++, rp++) {
                             ^
  105.           v = bn_mul_add_words(rp, np, nl, (rp[0] * n0) & BN_MASK2);
  106.           v = (v + carry + rp[nl]) & BN_MASK2;

crypto/bn/bn_mont.c:75:1: <Length trace>
73.   
74.   #ifdef MONT_WORD
75. > static int BN_from_montgomery_word(BIGNUM *ret, BIGNUM *r, BN_MONT_CTX *mont)
76.   {
77.       BIGNUM *n;

crypto/bn/bn_mont.c:75:1: Parameter `*r->d`
  73.   
  74.   #ifdef MONT_WORD
  75. > static int BN_from_montgomery_word(BIGNUM *ret, BIGNUM *r, BN_MONT_CTX *mont)
  76.   {
  77.       BIGNUM *n;

crypto/bn/bn_mont.c:89:9: Call
  87.   
  88.       max = (2 * nl);             /* carry is stored separately */
  89.       if (bn_wexpand(r, max) == NULL)
                ^
  90.           return 0;
  91.   

crypto/bn/bn_lib.c:940:1: Parameter `*a->d`
    938.   }
    939.   
    940. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
    941.   {
    942.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_mont.c:94:5: Assignment
  92.       r->neg ^= n->neg;
  93.       np = n->d;
  94.       rp = r->d;
            ^
  95.   
  96.       /* clear the top words of T */

crypto/bn/bn_mont.c:106:26: Array access: Offset: [max(1, mont->N.top), +oo] (⇐ [0, +oo] + [max(1, mont->N.top), mont->N.top]) Size: [0, 8388607] by call to `BN_from_montgomery_word` 
  104.       for (carry = 0, i = 0; i < nl; i++, rp++) {
  105.           v = bn_mul_add_words(rp, np, nl, (rp[0] * n0) & BN_MASK2);
  106.           v = (v + carry + rp[nl]) & BN_MASK2;
                                  ^
  107.           carry |= (v != rp[nl]);
  108.           carry &= (v <= rp[nl]);
