crypto/rsa/rsa_gen.c:83: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_generate_prime_ex`.
Showing all 20 steps of the trace


crypto/rsa/rsa_gen.c:78:9: Call
76.           goto err;
77.   
78.       if (BN_copy(rsa->e, e_value) == NULL)
              ^
79.           goto err;
80.   

crypto/bn/bn_lib.c:362:1: Parameter `a->top`
  360.   }
  361.   
  362. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
  363.   {
  364.       int i;

crypto/rsa/rsa_gen.c:83:14: Call
81.       /* generate p and q */
82.       for (;;) {
83.           if (!BN_generate_prime_ex(rsa->p, bitsp, 0, NULL, NULL, cb))
                   ^
84.               goto err;
85.           if (!BN_sub(r2, rsa->p, BN_value_one()))

crypto/bn/bn_prime.c:101:1: Parameter `add->top`
  99.   }
  100.   
  101. > int BN_generate_prime_ex(BIGNUM *ret, int bits, int safe,
  102.                            const BIGNUM *add, const BIGNUM *rem, BN_GENCB *cb)
  103.   {

crypto/bn/bn_prime.c:142:18: Call
  140.                   goto err;
  141.           } else {
  142.               if (!bn_probable_prime_dh(ret, bits, add, rem, ctx))
                          ^
  143.                   goto err;
  144.           }

crypto/bn/bn_prime.c:494:1: Parameter `add->top`
    492.   }
    493.   
    494. > int bn_probable_prime_dh(BIGNUM *rnd, int bits,
    495.                            const BIGNUM *add, const BIGNUM *rem, BN_CTX *ctx)
    496.   {

crypto/bn/bn_prime.c:509:10: Call
    507.       /* we need ((rnd-rem) % add) == 0 */
    508.   
    509.       if (!BN_mod(t1, rnd, add, ctx))
                    ^
    510.           goto err;
    511.       if (!BN_sub(rnd, rnd, t1))

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: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:95:5: Assignment
        93.       }
        94.   
        95.       nw = n / BN_BITS2;
                  ^
        96.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
        97.           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:96:9: Call
        94.   
        95.       nw = n / BN_BITS2;
        96.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                      ^
        97.           return (0);
        98.       r->neg = a->neg;

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 `BN_generate_prime_ex` 
        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.           }
