crypto/dh/dh_check.c:136: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_div`.
Showing all 21 steps of the trace


crypto/dh/dh_check.c:101:1: Parameter `dh->q->top`
99.   }
100.   
101. > int DH_check(const DH *dh, int *ret)
102.   {
103.       int ok = 0, r;

crypto/dh/dh_check.c:130:13: Call
128.                   *ret |= DH_NOT_SUITABLE_GENERATOR;
129.           }
130.           r = BN_is_prime_ex(dh->q, BN_prime_checks, ctx, NULL);
                   ^
131.           if (r < 0)
132.               goto err;

crypto/bn/bn_prime.c:145:1: Parameter `a->top`
  143.   }
  144.   
  145. > int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
  146.                      BN_GENCB *cb)
  147.   {

crypto/bn/bn_prime.c:148:12: Call
  146.                      BN_GENCB *cb)
  147.   {
  148.       return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                    ^
  149.   }
  150.   

crypto/bn/bn_prime.c:151:1: Parameter `a->top`
    149.   }
    150.   
    151. > int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
    152.                               int do_trial_division, BN_GENCB *cb)
    153.   {

crypto/bn/bn_prime.c:160:9: Call
    158.       BN_MONT_CTX *mont = NULL;
    159.   
    160.       if (BN_cmp(a, BN_value_one()) <= 0)
                   ^
    161.           return 0;
    162.   

crypto/bn/bn_lib.c:542:1: Parameter `a->top`
      540.   }
      541.   
      542. > int BN_cmp(const BIGNUM *a, const BIGNUM *b)
      543.   {
      544.       int i;

crypto/dh/dh_check.c:136:14: Call
134.               *ret |= DH_CHECK_Q_NOT_PRIME;
135.           /* Check p == 1 mod q  i.e. q divides p - 1 */
136.           if (!BN_div(t1, t2, dh->p, dh->q, ctx))
                    ^
137.               goto err;
138.           if (!BN_is_one(t2))

crypto/bn/bn_div.c:199:31: Call
  197.   
  198.       /* First we normalise the numbers */
  199.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
                                       ^
  200.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
  201.           goto err;

crypto/bn/bn_lib.c:140:9: Assignment
    138.   
    139.       if (BN_is_zero(a))
    140.           return 0;
                   ^
    141.       return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));
    142.   }

crypto/bn/bn_div.c:199:5: Assignment
  197.   
  198.       /* First we normalise the numbers */
  199.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
             ^
  200.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
  201.           goto err;

crypto/bn/bn_div.c:200:11: Call
  198.       /* First we normalise the numbers */
  199.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
  200.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
                   ^
  201.           goto err;
  202.       sdiv->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:941:1: Parameter `*a->d`
      939.   }
      940.   
      941. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
      942.   {
      943.       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 `BN_div` 
    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.           }
