crypto/bn/bn_mod.c:207: 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 16 steps of the trace


crypto/bn/bn_mod.c:193:1: Parameter `a->top`
191.   
192.   /* slow but works */
193. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
194.                  BN_CTX *ctx)
195.   {

crypto/bn/bn_mod.c:207:14: Call
205.           goto err;
206.       if (a == b) {
207.           if (!BN_sqr(t, a, ctx))
                    ^
208.               goto err;
209.       } else {

crypto/bn/bn_sqr.c:17:1: Parameter `*r->d`
  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 ret = bn_sqr_fixed_top(r, a, ctx);

crypto/bn/bn_sqr.c:19:15: Call
  17.   int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
  18.   {
  19.       int ret = bn_sqr_fixed_top(r, a, ctx);
                      ^
  20.   
  21.       bn_correct_top(r);

crypto/bn/bn_sqr.c:27:1: Parameter `a->top`
    25.   }
    26.   
    27. > int bn_sqr_fixed_top(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
    28.   {
    29.       int max, al;

crypto/bn/bn_sqr.c:35:5: Assignment
    33.       bn_check_top(a);
    34.   
    35.       al = a->top;
              ^
    36.       if (al <= 0) {
    37.           r->top = 0;

crypto/bn/bn_sqr.c:84:17: Call
    82.                   if (bn_wexpand(tmp, max) == NULL)
    83.                       goto err;
    84.                   bn_sqr_normal(rr->d, a->d, al, tmp->d);
                          ^
    85.               }
    86.           }

crypto/bn/bn_sqr.c:109:1: <Offset trace>
107.   
108.   /* tmp must have 2*n words */
109. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
110.   {
111.       int i, j, max;

crypto/bn/bn_sqr.c:109:1: Parameter `n`
      107.   
      108.   /* tmp must have 2*n words */
      109. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
      110.   {
      111.       int i, j, max;

crypto/bn/bn_sqr.c:120:5: Assignment
      118.       rp[0] = rp[max - 1] = 0;
      119.       rp++;
      120.       j = n;
                 ^
      121.   
      122.       if (--j > 0) {

crypto/bn/bn_sqr.c:122:9: Assignment
      120.       j = n;
      121.   
      122.       if (--j > 0) {
                     ^
      123.           ap++;
      124.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);

crypto/bn/bn_sqr.c:109:1: <Length trace>
107.   
108.   /* tmp must have 2*n words */
109. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
110.   {
111.       int i, j, max;

crypto/bn/bn_sqr.c:109:1: Parameter `*r`
      107.   
      108.   /* tmp must have 2*n words */
      109. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
      110.   {
      111.       int i, j, max;

crypto/bn/bn_sqr.c:117:5: Assignment
      115.       max = n * 2;
      116.       ap = a;
      117.       rp = r;
                 ^
      118.       rp[0] = rp[max - 1] = 0;
      119.       rp++;

crypto/bn/bn_sqr.c:119:5: Assignment
      117.       rp = r;
      118.       rp[0] = rp[max - 1] = 0;
      119.       rp++;
                 ^
      120.       j = n;
      121.   

crypto/bn/bn_sqr.c:124: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` 
      122.       if (--j > 0) {
      123.           ap++;
      124.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);
                     ^
      125.           rp += 2;
      126.       }
