crypto/dh/dh_check.c:102: 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:65:1: Parameter `dh->q->top`
63.    */
64.   
65. > int DH_check(const DH *dh, int *ret)
66.   {
67.       int ok = 0, r;

crypto/dh/dh_check.c:96:13: Call
94.                   *ret |= DH_NOT_SUITABLE_GENERATOR;
95.           }
96.           r = BN_is_prime_ex(dh->q, BN_prime_checks, ctx, NULL);
                  ^
97.           if (r < 0)
98.               goto err;

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

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

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

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

crypto/bn/bn_lib.c:577:1: Parameter `a->top`
      575.   }
      576.   
      577. > int BN_cmp(const BIGNUM *a, const BIGNUM *b)
      578.   {
      579.       int i;

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:205:31: Call
  203.   
  204.       /* First we normalise the numbers */
  205.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
                                       ^
  206.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
  207.           goto err;

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

crypto/bn/bn_div.c:205:5: Assignment
  203.   
  204.       /* First we normalise the numbers */
  205.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
             ^
  206.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
  207.           goto err;

crypto/bn/bn_div.c:206:11: Call
  204.       /* First we normalise the numbers */
  205.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
  206.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
                   ^
  207.           goto err;
  208.       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: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 `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.           }
