crypto/bn/bn_mont.c:56: error: BUFFER_OVERRUN_S2
  Offset: [max(16, `a->top`), `a->top`] (⇐ 1 + [-1+max(16, `a->top`), `a->top` - 1]) Size: [0, 8388607] by call to `BN_sqr`.
Showing all 14 steps of the trace


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