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


test/dhtest.c:56:17: Call
54.       BN_GENCB_set(_cb, &cb, NULL);
55.       if (!TEST_ptr(a = DH_new())
56.               || !TEST_true(DH_generate_parameters_ex(a, 64,
                      ^
57.                                                       DH_GENERATOR_5, _cb)))
58.           goto 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.   {

test/dhtest.c:60:10: Call
58.           goto err;
59.   
60.       if (!DH_check(a, &i))
               ^
61.           goto err;
62.       if (!TEST_false(i & DH_CHECK_P_NOT_PRIME)

crypto/dh/dh_check.c:65:1: Parameter `dh->p->top`
  63.    */
  64.   
  65. > int DH_check(const DH *dh, int *ret)
  66.   {
  67.       int ok = 0, r;

crypto/dh/dh_check.c:102:14: Call
  100.               *ret |= DH_CHECK_Q_NOT_PRIME;
  101.           /* Check p == 1 mod q  i.e. q divides p - 1 */
  102.           if (!BN_div(t1, t2, dh->p, dh->q, ctx))
                      ^
  103.               goto err;
  104.           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:83:1: <Offset trace>
81.   }
82.   
83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
84.   {
85.       int i, nw, lb, rb;

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

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

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

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

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

crypto/bn/bn_lib.c:948:1: Parameter `*a->d`
        946.   }
        947.   
        948. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
        949.   {
        950.       return (words <= a->dmax) ? a : bn_expand2(a, words);

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

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