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


crypto/bn/bn_recp.c:103:1: Parameter `x->top`
101.   }
102.   
103. > int BN_mod_mul_reciprocal(BIGNUM *r, const BIGNUM *x, const BIGNUM *y,
104.                             BN_RECP_CTX *recp, BN_CTX *ctx)
105.   {

crypto/bn/bn_recp.c:115:18: Call
113.       if (y != NULL) {
114.           if (x == y) {
115.               if (!BN_sqr(a, x, ctx))
                        ^
116.                   goto err;
117.           } else {

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

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

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

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

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

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

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

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

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

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

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

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