crypto/dsa/dsa_ossl.c:285: error: BUFFER_OVERRUN_L3
  Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `BN_mod_mul`.
Showing all 17 steps of the trace


crypto/dsa/dsa_ossl.c:281:10: Call
279.   
280.       /* u1 = M * w mod q */
281.       if (!BN_mod_mul(u1, u1, u2, dsa->q, ctx))
                ^
282.           goto err;
283.   

crypto/bn/bn_mod.c:73:1: Parameter `r->top`
  71.   
  72.   /* slow but works */
  73. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  74.                  BN_CTX *ctx)
  75.   {

crypto/dsa/dsa_ossl.c:285:10: Call
283.   
284.       /* u2 = r * w mod q */
285.       if (!BN_mod_mul(u2, r, u2, dsa->q, ctx))
                ^
286.           goto err;
287.   

crypto/bn/bn_mod.c:73:1: Parameter `a->top`
  71.   
  72.   /* slow but works */
  73. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  74.                  BN_CTX *ctx)
  75.   {

crypto/bn/bn_mod.c:87:14: Call
  85.           goto err;
  86.       if (a == b) {
  87.           if (!BN_sqr(t, a, ctx))
                     ^
  88.               goto err;
  89.       } 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:104:1: <Offset trace>
102.   
103.   /* tmp must have 2*n words */
104. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
105.   {
106.       int i, j, max;

crypto/bn/bn_sqr.c:104:1: Parameter `n`
      102.   
      103.   /* tmp must have 2*n words */
      104. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
      105.   {
      106.       int i, j, max;

crypto/bn/bn_sqr.c:115:5: Assignment
      113.       rp[0] = rp[max - 1] = 0;
      114.       rp++;
      115.       j = n;
                 ^
      116.   
      117.       if (--j > 0) {

crypto/bn/bn_sqr.c:117:9: Assignment
      115.       j = n;
      116.   
      117.       if (--j > 0) {
                     ^
      118.           ap++;
      119.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);

crypto/bn/bn_sqr.c:104:1: <Length trace>
102.   
103.   /* tmp must have 2*n words */
104. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
105.   {
106.       int i, j, max;

crypto/bn/bn_sqr.c:104:1: Parameter `*r`
      102.   
      103.   /* tmp must have 2*n words */
      104. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
      105.   {
      106.       int i, j, max;

crypto/bn/bn_sqr.c:112:5: Assignment
      110.       max = n * 2;
      111.       ap = a;
      112.       rp = r;
                 ^
      113.       rp[0] = rp[max - 1] = 0;
      114.       rp++;

crypto/bn/bn_sqr.c:114:5: Assignment
      112.       rp = r;
      113.       rp[0] = rp[max - 1] = 0;
      114.       rp++;
                 ^
      115.       j = n;
      116.   

crypto/bn/bn_sqr.c:119:9: Array access: Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `BN_mod_mul` 
      117.       if (--j > 0) {
      118.           ap++;
      119.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);
                     ^
      120.           rp += 2;
      121.       }
