crypto/rsa/rsa_x931g.c:170: error: BUFFER_OVERRUN_L3
  Offset added: [8, +oo] Size: [0, +oo] by call to `BN_X931_generate_prime_ex`.
Showing all 33 steps of the trace


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

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

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

crypto/bn/bn_lib.c:364:9: Call
    362.   {
    363.       bn_check_top(a);
    364.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    365.           return 0;
    366.       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:160:10: Call
158.       if (Xq == NULL)
159.           goto error;
160.       if (!BN_X931_generate_Xpq(Xp, Xq, bits, ctx))
                ^
161.           goto error;
162.   

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:121:1: Parameter `*rnd->d`
    119.   }
    120.   
    121. > int BN_priv_rand(BIGNUM *rnd, int bits, int top, int bottom)
    122.   {
    123.       return bnrand(PRIVATE, rnd, bits, top, bottom, NULL);

crypto/bn/bn_rand.c:123:12: Call
    121.   int BN_priv_rand(BIGNUM *rnd, int bits, int top, int bottom)
    122.   {
    123.       return bnrand(PRIVATE, rnd, bits, top, bottom, NULL);
                      ^
    124.   }
    125.   

crypto/bn/bn_rand.c:23:1: Parameter `*rnd->d`
      21.   } BNRAND_FLAG;
      22.   
      23. > static int bnrand(BNRAND_FLAG flag, BIGNUM *rnd, int bits, int top, int bottom,
      24.                     BN_CTX *ctx)
      25.   {

crypto/bn/bn_rand.c:89:10: Call
      87.       if (bottom)                 /* set bottom bit if requested */
      88.           buf[bytes - 1] |= 1;
      89.       if (!BN_bin2bn(buf, bytes, rnd))
                     ^
      90.           goto err;
      91.       ret = 1;

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

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

crypto/bn/bn_lib.c:962:1: Parameter `*a->d`
          960.   }
          961.   
          962. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
          963.   {
          964.       return (words <= a->dmax) ? a : bn_expand2(a, words);

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

crypto/bn/bn_x931p.c:215:1: Parameter `*Xp1->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:230:10: Call
  228.           goto error;
  229.   
  230.       if (!BN_priv_rand(Xp1, 101, BN_RAND_TOP_ONE, BN_RAND_BOTTOM_ANY))
                  ^
  231.           goto error;
  232.       if (!BN_priv_rand(Xp2, 101, BN_RAND_TOP_ONE, BN_RAND_BOTTOM_ANY))

crypto/bn/bn_rand.c:121:1: Parameter `*rnd->d`
    119.   }
    120.   
    121. > int BN_priv_rand(BIGNUM *rnd, int bits, int top, int bottom)
    122.   {
    123.       return bnrand(PRIVATE, rnd, bits, top, bottom, NULL);

crypto/bn/bn_rand.c:123:12: Call
    121.   int BN_priv_rand(BIGNUM *rnd, int bits, int top, int bottom)
    122.   {
    123.       return bnrand(PRIVATE, rnd, bits, top, bottom, NULL);
                      ^
    124.   }
    125.   

crypto/bn/bn_rand.c:23:1: Parameter `*rnd->d`
      21.   } BNRAND_FLAG;
      22.   
      23. > static int bnrand(BNRAND_FLAG flag, BIGNUM *rnd, int bits, int top, int bottom,
      24.                     BN_CTX *ctx)
      25.   {

crypto/bn/bn_rand.c:33:9: Call
      31.           if (top != BN_RAND_TOP_ANY || bottom != BN_RAND_BOTTOM_ANY)
      32.               goto toosmall;
      33.           BN_zero(rnd);
                    ^
      34.           return 1;
      35.       }

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

crypto/bn/bn_lib.c:364:9: Call
        362.   {
        363.       bn_check_top(a);
        364.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                       ^
        365.           return 0;
        366.       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/bn/bn_lcl.h:668:12: Call
          666.           return a;
          667.   
          668.       return bn_expand2((a),(bits+BN_BITS2-1)/BN_BITS2);
                            ^
          669.   }
          670.   

crypto/bn/bn_lib.c:245:1: Parameter `*b->d`
            243.    */
            244.   
            245. > BIGNUM *bn_expand2(BIGNUM *b, int words)
            246.   {
            247.       if (words > b->dmax) {

crypto/bn/bn_lib.c:248:23: Call
            246.   {
            247.       if (words > b->dmax) {
            248.           BN_ULONG *a = bn_expand_internal(b, words);
                                         ^
            249.           if (!a)
            250.               return NULL;

crypto/bn/bn_lib.c:209:1: <Offset trace>
207.   /* This is used by bn_expand2() */
208.   /* The caller MUST check that words > b->dmax before calling this */
209. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
210.   {
211.       BN_ULONG *a = NULL;

crypto/bn/bn_lib.c:209:1: Parameter `b->top`
              207.   /* This is used by bn_expand2() */
              208.   /* The caller MUST check that words > b->dmax before calling this */
              209. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
              210.   {
              211.       BN_ULONG *a = NULL;

crypto/bn/bn_lib.c:209:1: <Length trace>
207.   /* This is used by bn_expand2() */
208.   /* The caller MUST check that words > b->dmax before calling this */
209. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
210.   {
211.       BN_ULONG *a = NULL;

crypto/bn/bn_lib.c:209:1: Parameter `*b->d`
              207.   /* This is used by bn_expand2() */
              208.   /* The caller MUST check that words > b->dmax before calling this */
              209. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
              210.   {
              211.       BN_ULONG *a = NULL;

crypto/bn/bn_lib.c:232:9: Array access: Offset added: [8, +oo] Size: [0, +oo] by call to `BN_X931_generate_prime_ex` 
              230.       assert(b->top <= words);
              231.       if (b->top > 0)
              232.           memcpy(a, b->d, sizeof(*a) * b->top);
                             ^
              233.   
              234.       return a;
