apps/prime.c:125: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_generate_prime_ex`.
Showing all 18 steps of the trace


apps/prime.c:125:9: Call
123.           }
124.           bn = BN_new();
125.           BN_generate_prime_ex(bn, bits, safe, NULL, NULL, NULL);
               ^
126.           s = hex ? BN_bn2hex(bn) : BN_bn2dec(bn);
127.           BIO_printf(bio_out, "%s\n", s);

crypto/bn/bn_prime.c:208:1: Parameter `add->top`
  206.   }
  207.   
  208. > int BN_generate_prime_ex(BIGNUM *ret, int bits, int safe,
  209.                            const BIGNUM *add, const BIGNUM *rem, BN_GENCB *cb)
  210.   {

crypto/bn/bn_prime.c:248:18: Call
  246.                   goto err;
  247.           } else {
  248.               if (!bn_probable_prime_dh(ret, bits, add, rem, ctx))
                          ^
  249.                   goto err;
  250.           }

crypto/bn/bn_prime.c:583:1: Parameter `add->top`
    581.   }
    582.   
    583. > int bn_probable_prime_dh(BIGNUM *rnd, int bits,
    584.                            const BIGNUM *add, const BIGNUM *rem, BN_CTX *ctx)
    585.   {

crypto/bn/bn_prime.c:598:10: Call
    596.       /* we need ((rnd-rem) % add) == 0 */
    597.   
    598.       if (!BN_mod(t1, rnd, add, ctx))
                    ^
    599.           goto err;
    600.       if (!BN_sub(rnd, rnd, t1))

crypto/bn/bn_div.c:254:31: Call
      252.   
      253.       /* First we normalise the numbers */
      254.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
                                           ^
      255.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
      256.           goto err;

crypto/bn/bn_lib.c:221:9: Assignment
        219.   
        220.       if (BN_is_zero(a))
        221.           return 0;
                       ^
        222.       return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));
        223.   }

crypto/bn/bn_div.c:254:5: Assignment
      252.   
      253.       /* First we normalise the numbers */
      254.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
                 ^
      255.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
      256.           goto err;

crypto/bn/bn_div.c:255:11: Call
      253.       /* First we normalise the numbers */
      254.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
      255.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
                       ^
      256.           goto err;
      257.       sdiv->neg = 0;

crypto/bn/bn_shift.c:130:1: <Offset trace>
128.   }
129.   
130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
131.   {
132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:130:1: Parameter `n`
        128.   }
        129.   
        130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
        131.   {
        132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:145:5: Assignment
        143.   
        144.       r->neg = a->neg;
        145.       nw = n / BN_BITS2;
                   ^
        146.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
        147.           return (0);

crypto/bn/bn_shift.c:130:1: <Length trace>
128.   }
129.   
130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
131.   {
132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:130:1: Parameter `*r->d`
        128.   }
        129.   
        130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
        131.   {
        132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:146:9: Call
        144.       r->neg = a->neg;
        145.       nw = n / BN_BITS2;
        146.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                       ^
        147.           return (0);
        148.       lb = n % BN_BITS2;

crypto/bn/bn_lib.c:995:1: Parameter `*a->d`
          993.   }
          994.   
          995. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
          996.   {
          997.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_shift.c:151:5: Assignment
        149.       rb = BN_BITS2 - lb;
        150.       f = a->d;
        151.       t = r->d;
                   ^
        152.       t[a->top + nw] = 0;
        153.       if (lb == 0)

crypto/bn/bn_shift.c:159:13: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_generate_prime_ex` 
        157.           for (i = a->top - 1; i >= 0; i--) {
        158.               l = f[i];
        159.               t[nw + i + 1] |= (l >> rb) & BN_MASK2;
                           ^
        160.               t[nw + i] = (l << lb) & BN_MASK2;
        161.           }
