crypto/rsa/rsa_x931g.c:169: error: BUFFER_OVERRUN_L3
  Offset: [4, +oo] (⇐ [0, +oo] + 4) Size: [0, 8388607] by call to `BN_X931_generate_prime_ex`.
Showing all 31 steps of the trace


crypto/rsa/rsa_x931g.c:155:10: Call
153.   
154.       BN_CTX_start(ctx);
155.       Xp = BN_CTX_get(ctx);
                ^
156.       Xq = BN_CTX_get(ctx);
157.       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.       ctx->used++;
  231.       CTXDBG_RET(ctx, ret);

crypto/bn/bn_lib.c:387:1: Parameter `*a->d`
    385.   }
    386.   
    387. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    388.   {
    389.       bn_check_top(a);

crypto/bn/bn_lib.c:390:9: Call
    388.   {
    389.       bn_check_top(a);
    390.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    391.           return 0;
    392.       a->neg = 0;

crypto/bn/bn_lcl.h:651:1: Parameter `*a->d`
      649.                            const BIGNUM *add, const BIGNUM *rem, BN_CTX *ctx);
      650.   
      651. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
      652.   {
      653.       if (bits > (INT_MAX - BN_BITS2 + 1))

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

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:399:1: Parameter `*ret->d`
        397.   }
        398.   
        399. > BIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret)
        400.   {
        401.       unsigned int i, m;

crypto/bn/bn_lib.c:421:9: Call
        419.       i = ((n - 1) / BN_BYTES) + 1;
        420.       m = ((n - 1) % (BN_BYTES));
        421.       if (bn_wexpand(ret, (int)i) == NULL) {
                       ^
        422.           BN_free(bn);
        423.           return NULL;

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

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

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

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

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 `*a->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 = 0;

crypto/bn/bn_mul.c:577:17: Call
      575.                   if (bn_wexpand(rr, k * 4) == NULL)
      576.                       goto err;
      577.                   bn_mul_part_recursive(rr->d, a->d, b->d,
                             ^
      578.                                         j, al - j, bl - j, t->d);
      579.               } else {            /* al <= j || bl <= j */

crypto/bn/bn_mul.c:322:1: Parameter `*a`
        320.    */
        321.   /* tnX may not be negative but less than n */
        322. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
        323.                              int tna, int tnb, BN_ULONG *t)
        324.   {

crypto/bn/bn_mul.c:330:9: Call
        328.   
        329.       if (n < 8) {
        330.           bn_mul_normal(r, a, n + tna, b, n + tnb);
                       ^
        331.           return;
        332.       }

crypto/bn/bn_mul.c:612:1: <Length trace>
610.   }
611.   
612. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
613.   {
614.       BN_ULONG *rr;

crypto/bn/bn_mul.c:612:1: Parameter `*b`
          610.   }
          611.   
          612. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
          613.   {
          614.       BN_ULONG *rr;

crypto/bn/bn_mul.c:647:50: Array access: Offset: [4, +oo] (⇐ [0, +oo] + 4) Size: [0, 8388607] by call to `BN_X931_generate_prime_ex` 
          645.           if (--nb <= 0)
          646.               return;
          647.           rr[4] = bn_mul_add_words(&(r[4]), a, na, b[4]);
                                                                  ^
          648.           rr += 4;
          649.           r += 4;
