crypto/dsa/dsa_ossl.c:391: 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:387:9: Call
385.            */
386.           dgst_len = (i >> 3);
387.       if (BN_bin2bn(dgst, dgst_len, u1) == NULL)
               ^
388.           goto err;
389.   

crypto/bn/bn_lib.c:542:1: Parameter `ret->top`
  540.   }
  541.   
  542. > BIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret)
  543.   {
  544.       unsigned int i, m;

crypto/dsa/dsa_ossl.c:391:10: Call
389.   
390.       /* u1 = M * w mod q */
391.       if (!BN_mod_mul(u1, u1, u2, dsa->q, ctx))
                ^
392.           goto err;
393.   

crypto/bn/bn_mod.c:179:1: Parameter `a->top`
  177.   
  178.   /* slow but works */
  179. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  180.                  BN_CTX *ctx)
  181.   {

crypto/bn/bn_mod.c:193:14: Call
  191.           goto err;
  192.       if (a == b) {
  193.           if (!BN_sqr(t, a, ctx))
                      ^
  194.               goto err;
  195.       } 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: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `BN_mod_mul` 
      166.       if (--j > 0) {
      167.           ap++;
      168.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);
                     ^
      169.           rp += 2;
      170.       }
