crypto/rsa/rsa_x931g.c:171: error: BUFFER_OVERRUN_L3
  Offset: [32, +oo] Size: [0, 8388607] by call to `BN_X931_generate_prime_ex`.
Showing all 34 steps of the trace


crypto/rsa/rsa_x931g.c:157:10: Call
155.   
156.       BN_CTX_start(ctx);
157.       Xp = BN_CTX_get(ctx);
                ^
158.       Xq = BN_CTX_get(ctx);
159.       if (Xq == NULL)

crypto/bn/bn_ctx.c:229:5: Call
  227.       }
  228.       /* OK, make sure the returned bignum is "zero" */
  229.       BN_zero(ret);
             ^
  230.       /* clear BN_FLG_CONSTTIME if leaked from previous frames */
  231.       ret->flags &= (~BN_FLG_CONSTTIME);

crypto/bn/bn_lib.c:359:1: Parameter `*a->d`
    357.   }
    358.   
    359. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    360.   {
    361.       bn_check_top(a);

crypto/bn/bn_lib.c:362:9: Call
    360.   {
    361.       bn_check_top(a);
    362.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    363.           return 0;
    364.       a->neg = 0;

crypto/bn/bn_lcl.h:660:1: Parameter `*a->d`
      658.                            const BIGNUM *add, const BIGNUM *rem, BN_CTX *ctx);
      659.   
      660. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
      661.   {
      662.       if (bits > (INT_MAX - BN_BITS2 + 1))

crypto/rsa/rsa_x931g.c:161:10: Call
159.       if (Xq == NULL)
160.           goto error;
161.       if (!BN_X931_generate_Xpq(Xp, Xq, bits, ctx))
                ^
162.           goto error;
163.   

crypto/bn/bn_x931p.c:160:1: Parameter `*Xp->d`
  158.    */
  159.   
  160. > int BN_X931_generate_Xpq(BIGNUM *Xp, BIGNUM *Xq, int nbits, BN_CTX *ctx)
  161.   {
  162.       BIGNUM *t;

crypto/bn/bn_x931p.c:176:10: Call
  174.        * exceeded.
  175.        */
  176.       if (!BN_priv_rand(Xp, nbits, BN_RAND_TOP_TWO, BN_RAND_BOTTOM_ANY))
                  ^
  177.           goto err;
  178.   

crypto/bn/bn_rand.c:107:1: Parameter `*rnd->d`
    105.   }
    106.   
    107. > int BN_priv_rand(BIGNUM *rnd, int bits, int top, int bottom)
    108.   {
    109.       return bnrand(PRIVATE, rnd, bits, top, bottom);

crypto/bn/bn_rand.c:109:12: Call
    107.   int BN_priv_rand(BIGNUM *rnd, int bits, int top, int bottom)
    108.   {
    109.       return bnrand(PRIVATE, rnd, bits, top, bottom);
                      ^
    110.   }
    111.   

crypto/bn/bn_rand.c:21:1: Parameter `*rnd->d`
      19.   } BNRAND_FLAG;
      20.   
      21. > static int bnrand(BNRAND_FLAG flag, BIGNUM *rnd, int bits, int top, int bottom)
      22.   {
      23.       unsigned char *buf = NULL;

crypto/bn/bn_rand.c:84:10: Call
      82.       if (bottom)                 /* set bottom bit if requested */
      83.           buf[bytes - 1] |= 1;
      84.       if (!BN_bin2bn(buf, bytes, rnd))
                     ^
      85.           goto err;
      86.       ret = 1;

crypto/bn/bn_lib.c:372:1: Parameter `*ret->d`
        370.   }
        371.   
        372. > BIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret)
        373.   {
        374.       unsigned int i, m;

crypto/bn/bn_lib.c:394:9: Call
        392.       i = ((n - 1) / BN_BYTES) + 1;
        393.       m = ((n - 1) % (BN_BYTES));
        394.       if (bn_wexpand(ret, (int)i) == NULL) {
                       ^
        395.           BN_free(bn);
        396.           return NULL;

crypto/bn/bn_lib.c:939:1: Parameter `*a->d`
          937.   }
          938.   
          939. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
          940.   {
          941.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/rsa/rsa_x931g.c:171:10: Call
169.       /* Generate two primes from Xp, Xq */
170.   
171.       if (!BN_X931_generate_prime_ex(rsa->p, NULL, NULL, NULL, NULL, Xp,
                ^
172.                                      e, ctx, cb))
173.           goto error;

crypto/bn/bn_x931p.c:215:1: Parameter `*p->d`
  213.    */
  214.   
  215. > int BN_X931_generate_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2,
  216.                                 BIGNUM *Xp1, BIGNUM *Xp2,
  217.                                 const BIGNUM *Xp,

crypto/bn/bn_x931p.c:234:10: Call
  232.       if (!BN_priv_rand(Xp2, 101, BN_RAND_TOP_ONE, BN_RAND_BOTTOM_ANY))
  233.           goto error;
  234.       if (!BN_X931_derive_prime_ex(p, p1, p2, Xp, Xp1, Xp2, e, ctx, cb))
                  ^
  235.           goto error;
  236.   

crypto/bn/bn_x931p.c:51:1: Parameter `*p->d`
    49.    */
    50.   
    51. > int BN_X931_derive_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2,
    52.                               const BIGNUM *Xp, const BIGNUM *Xp1,
    53.                               const BIGNUM *Xp2, const BIGNUM *e, BN_CTX *ctx,

crypto/bn/bn_x931p.c:91:10: Call
    89.       /* First set p to value of Rp */
    90.   
    91.       if (!BN_mod_inverse(p, p2, p1, ctx))
                   ^
    92.           goto err;
    93.   

crypto/bn/bn_gcd.c:124:1: Parameter `*in->d`
      122.                                           BN_CTX *ctx);
      123.   
      124. > BIGNUM *BN_mod_inverse(BIGNUM *in,
      125.                          const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
      126.   {

crypto/bn/bn_gcd.c:129:10: Call
      127.       BIGNUM *rv;
      128.       int noinv;
      129.       rv = int_bn_mod_inverse(in, a, n, ctx, &noinv);
                      ^
      130.       if (noinv)
      131.           BNerr(BN_F_BN_MOD_INVERSE, BN_R_NO_INVERSE);

crypto/bn/bn_gcd.c:135:1: Parameter `*in->d`
        133.   }
        134.   
        135. > BIGNUM *int_bn_mod_inverse(BIGNUM *in,
        136.                              const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx,
        137.                              int *pnoinv)

crypto/bn/bn_x931p.c:94:10: Call
    92.           goto err;
    93.   
    94.       if (!BN_mul(p, p, p2, ctx))
                   ^
    95.           goto err;
    96.   

crypto/bn/bn_mul.c:497:1: Parameter `*r->d`
      495.   #endif                          /* BN_RECURSION */
      496.   
      497. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
      498.   {
      499.       int ret = bn_mul_fixed_top(r, a, b, ctx);

crypto/bn/bn_mul.c:499:15: Call
      497.   int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
      498.   {
      499.       int ret = bn_mul_fixed_top(r, a, b, ctx);
                           ^
      500.   
      501.       bn_correct_top(r);

crypto/bn/bn_mul.c:507:1: Parameter `a->top`
        505.   }
        506.   
        507. > int bn_mul_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
        508.   {
        509.       int ret = 0;

crypto/bn/bn_mul.c:524:5: Assignment
        522.       bn_check_top(r);
        523.   
        524.       al = a->top;
                   ^
        525.       bl = b->top;
        526.   

crypto/bn/bn_mul.c:595:17: Call
        593.                   if (bn_wexpand(rr, k * 2) == NULL)
        594.                       goto err;
        595.                   bn_mul_recursive(rr->d, a->d, b->d, j, al - j, bl - j, t->d);
                               ^
        596.               }
        597.               rr->top = top;

crypto/bn/bn_mul.c:175:1: <Offset trace>
173.    */
174.   /* dnX may not be positive, but n2/2+dnX has to be */
175. > void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
176.                         int dna, int dnb, BN_ULONG *t)
177.   {

crypto/bn/bn_mul.c:175:1: Parameter `n2`
          173.    */
          174.   /* dnX may not be positive, but n2/2+dnX has to be */
          175. > void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
          176.                         int dna, int dnb, BN_ULONG *t)
          177.   {

crypto/bn/bn_mul.c:175:1: <Length trace>
173.    */
174.   /* dnX may not be positive, but n2/2+dnX has to be */
175. > void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
176.                         int dna, int dnb, BN_ULONG *t)
177.   {

crypto/bn/bn_mul.c:175:1: Parameter `*t`
          173.    */
          174.   /* dnX may not be positive, but n2/2+dnX has to be */
          175. > void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
          176.                         int dna, int dnb, BN_ULONG *t)
          177.   {

crypto/bn/bn_mul.c:266:9: Array access: Offset: [32, +oo] Size: [0, 8388607] by call to `BN_X931_generate_prime_ex` 
          264.   # endif                         /* BN_MUL_COMBA */
          265.       {
          266.           p = &(t[n2 * 2]);
                         ^
          267.           if (!zero)
          268.               bn_mul_recursive(&(t[n2]), t, &(t[n]), n, 0, 0, p);
