apps/gendsa.c:120: error: BUFFER_OVERRUN_L3
  Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `DSA_generate_key`.
Showing all 35 steps of the trace


apps/gendsa.c:119:58: Call
117.   
118.       DSA_get0_pqg(dsa, &p, NULL, NULL);
119.       BIO_printf(bio_err, "Generating DSA key, %d bits\n", BN_num_bits(p));
                                                                ^
120.       if (!DSA_generate_key(dsa))
121.           goto end;

crypto/bn/bn_lib.c:166:9: Call
  164.       bn_check_top(a);
  165.   
  166.       if (BN_is_zero(a))
                 ^
  167.           return 0;
  168.       return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));

crypto/bn/bn_lib.c:855:1: Parameter `a->top`
    853.   }
    854.   
    855. > int BN_is_zero(const BIGNUM *a)
    856.   {
    857.       return a->top == 0;

apps/gendsa.c:120:10: Call
118.       DSA_get0_pqg(dsa, &p, NULL, NULL);
119.       BIO_printf(bio_err, "Generating DSA key, %d bits\n", BN_num_bits(p));
120.       if (!DSA_generate_key(dsa))
                ^
121.           goto end;
122.   

crypto/dsa/dsa_key.c:18:1: Parameter `dsa->p->top`
  16.   static int dsa_builtin_keygen(DSA *dsa);
  17.   
  18. > int DSA_generate_key(DSA *dsa)
  19.   {
  20.       if (dsa->meth->dsa_keygen)

crypto/dsa/dsa_key.c:22:12: Call
  20.       if (dsa->meth->dsa_keygen)
  21.           return dsa->meth->dsa_keygen(dsa);
  22.       return dsa_builtin_keygen(dsa);
                   ^
  23.   }
  24.   

crypto/dsa/dsa_key.c:25:1: Parameter `dsa->p->top`
    23.   }
    24.   
    25. > static int dsa_builtin_keygen(DSA *dsa)
    26.   {
    27.       int ok = 0;

crypto/dsa/dsa_key.c:58:14: Call
    56.           BN_with_flags(prk, priv_key, BN_FLG_CONSTTIME);
    57.   
    58.           if (!BN_mod_exp(pub_key, dsa->g, prk, dsa->p, ctx)) {
                       ^
    59.               BN_free(prk);
    60.               goto err;

crypto/bn/bn_exp.c:89:1: Parameter `m->top`
      87.   }
      88.   
      89. > int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m,
      90.                  BN_CTX *ctx)
      91.   {

crypto/bn/bn_exp.c:134:9: Call
      132.   
      133.   #ifdef MONT_MUL_MOD
      134.       if (BN_is_odd(m)) {
                     ^
      135.   # ifdef MONT_EXP_WORD
      136.           if (a->top == 1 && !a->neg

crypto/bn/bn_lib.c:870:1: Parameter `a->top`
        868.   }
        869.   
        870. > int BN_is_odd(const BIGNUM *a)
        871.   {
        872.       return (a->top > 0) && (a->d[0] & 1);

crypto/bn/bn_exp.c:144:19: Call
      142.           } else
      143.   # endif
      144.               ret = BN_mod_exp_mont(r, a, p, m, ctx, NULL);
                               ^
      145.       } else
      146.   #endif

crypto/bn/bn_exp.c:296:1: Parameter `m->top`
        294.   }
        295.   
        296. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
        297.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
        298.   {

crypto/bn/bn_exp.c:310:16: Call
        308.               || BN_get_flags(a, BN_FLG_CONSTTIME) != 0
        309.               || BN_get_flags(m, BN_FLG_CONSTTIME) != 0) {
        310.           return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
                              ^
        311.       }
        312.   

crypto/bn/bn_exp.c:741:14: Assignment
          739.           /* 2^(top*BN_BITS2) - m */
          740.           tmp.d[0] = (0 - m->d[0]) & BN_MASK2;
          741.           for (i = 1; i < top; i++)
                              ^
          742.               tmp.d[i] = (~m->d[i]) & BN_MASK2;
          743.           tmp.top = top;

crypto/bn/bn_exp.c:1040:14: Call
          1038.           for (wvalue = 0, i = bits % window; i >= 0; i--, bits--)
          1039.               wvalue = (wvalue << 1) + BN_is_bit_set(p, bits);
          1040.           if (!MOD_EXP_CTIME_COPY_FROM_PREBUF(&tmp, top, powerbuf, wvalue,
                               ^
          1041.                                               window))
          1042.               goto err;

crypto/bn/bn_exp.c:522:1: Parameter `top`
            520.   }
            521.   
            522. > static int MOD_EXP_CTIME_COPY_FROM_PREBUF(BIGNUM *b, int top,
            523.                                             unsigned char *buf, int idx,
            524.                                             int window)

crypto/bn/bn_exp.c:579:5: Assignment
            577.       }
            578.   
            579.       b->top = top;
                       ^
            580.       bn_correct_top(b);
            581.       return 1;

crypto/bn/bn_exp.c:580:5: Call
            578.   
            579.       b->top = top;
            580.       bn_correct_top(b);
                       ^
            581.       return 1;
            582.   }

crypto/bn/bn_lib.c:956:1: Parameter `a->top`
              954.   }
              955.   
              956. > void bn_correct_top(BIGNUM *a)
              957.   {
              958.       BN_ULONG *ftl;

crypto/bn/bn_exp.c:1053:22: Call
          1051.               /* Scan the window, squaring the result as we go */
          1052.               for (i = 0; i < window; i++, bits--) {
          1053.                   if (!BN_mod_mul_montgomery(&tmp, &tmp, &tmp, mont, ctx))
                                       ^
          1054.                       goto err;
          1055.                   wvalue = (wvalue << 1) + BN_is_bit_set(p, bits);

crypto/bn/bn_mont.c:26:1: Parameter `a->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:53:14: Call
            51.       bn_check_top(tmp);
            52.       if (a == b) {
            53.           if (!BN_sqr(tmp, a, ctx))
                               ^
            54.               goto err;
            55.       } 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:105:1: <Offset trace>
103.   
104.   /* tmp must have 2*n words */
105. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
106.   {
107.       int i, j, max;

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

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

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

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

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

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

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

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