apps/dhparam.c:268: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `DH_check`.
Showing all 16 steps of the trace


apps/dhparam.c:205:32: Call
203.                          num, g);
204.               BIO_printf(bio_err, "This is going to take a long time\n");
205.               if (dh == NULL || !DH_generate_parameters_ex(dh, num, g, cb)) {
                                      ^
206.                   BN_GENCB_free(cb);
207.                   ERR_print_errors(bio_err);

crypto/dh/dh_gen.c:23:1: Parameter `ret->p->top`
  21.                                   BN_GENCB *cb);
  22.   
  23. > int DH_generate_parameters_ex(DH *ret, int prime_len, int generator,
  24.                                 BN_GENCB *cb)
  25.   {

apps/dhparam.c:268:14: Call
266.   
267.       if (check) {
268.           if (!DH_check(dh, &i)) {
                    ^
269.               ERR_print_errors(bio_err);
270.               goto end;

crypto/dh/dh_check.c:25:1: Parameter `dh->p->top`
  23.    */
  24.   
  25. > int DH_check(const DH *dh, int *ret)
  26.   {
  27.       int ok = 0, r;

crypto/dh/dh_check.c:62:14: Call
  60.               *ret |= DH_CHECK_Q_NOT_PRIME;
  61.           /* Check p == 1 mod q  i.e. q divides p - 1 */
  62.           if (!BN_div(t1, t2, dh->p, dh->q, ctx))
                     ^
  63.               goto err;
  64.           if (!BN_is_one(t2))

crypto/bn/bn_div.c:140:1: Parameter `num->top`
    138.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
    139.    */
    140. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
    141.              BN_CTX *ctx)
    142.   {

crypto/bn/bn_div.c:210:11: Call
    208.       sdiv->neg = 0;
    209.       norm_shift += BN_BITS2;
    210.       if (!(BN_lshift(snum, num, norm_shift)))
                     ^
    211.           goto err;
    212.       snum->neg = 0;

crypto/bn/bn_shift.c:81:1: <Offset trace>
79.   }
80.   
81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
82.   {
83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:81:1: Parameter `n`
      79.   }
      80.   
      81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
      82.   {
      83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:96:5: Assignment
      94.   
      95.       r->neg = a->neg;
      96.       nw = n / BN_BITS2;
                ^
      97.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
      98.           return (0);

crypto/bn/bn_shift.c:81:1: <Length trace>
79.   }
80.   
81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
82.   {
83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:81:1: Parameter `*r->d`
      79.   }
      80.   
      81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
      82.   {
      83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:97:9: Call
      95.       r->neg = a->neg;
      96.       nw = n / BN_BITS2;
      97.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                     ^
      98.           return (0);
      99.       lb = n % BN_BITS2;

crypto/bn/bn_lib.c:1016:1: Parameter `*a->d`
        1014.   }
        1015.   
        1016. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
        1017.   {
        1018.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_shift.c:102:5: Assignment
      100.       rb = BN_BITS2 - lb;
      101.       f = a->d;
      102.       t = r->d;
                 ^
      103.       t[a->top + nw] = 0;
      104.       if (lb == 0)

crypto/bn/bn_shift.c:110:13: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `DH_check` 
      108.           for (i = a->top - 1; i >= 0; i--) {
      109.               l = f[i];
      110.               t[nw + i + 1] |= (l >> rb) & BN_MASK2;
                         ^
      111.               t[nw + i] = (l << lb) & BN_MASK2;
      112.           }
