crypto/dsa/dsa_gen.c:381: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_lshift`.
Showing all 16 steps of the trace


crypto/dsa/dsa_gen.c:360:10: Call
358.   
359.       BN_CTX_start(ctx);
360.       r0 = BN_CTX_get(ctx);
                ^
361.       g = BN_CTX_get(ctx);
362.       W = BN_CTX_get(ctx);

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:463:1: Parameter `*a->d`
    461.   }
    462.   
    463. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    464.   {
    465.       bn_check_top(a);

crypto/bn/bn_lib.c:466:9: Call
    464.   {
    465.       bn_check_top(a);
    466.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    467.           return (0);
    468.       a->neg = 0;

crypto/bn/bn_lcl.h:674:1: Parameter `*a->d`
      672.   int bn_probable_prime_dh_coprime(BIGNUM *rnd, int bits, BN_CTX *ctx);
      673.   
      674. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
      675.   {
      676.       if (bits > (INT_MAX - BN_BITS2 + 1))

crypto/dsa/dsa_gen.c:381:10: Call
379.       }
380.   
381.       if (!BN_lshift(test, BN_value_one(), L - 1))
                ^
382.           goto err;
383.       for (;;) {

crypto/bn/bn_shift.c:83:1: Parameter `*r->d`
  81.   }
  82.   
  83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
  84.   {
  85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:98:9: Call
  96.   
  97.       nw = n / BN_BITS2;
  98.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                 ^
  99.           return (0);
  100.       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_lib.c:1018:37: Call
    1016.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
    1017.   {
    1018.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                                ^
    1019.   }
    1020.   

crypto/bn/bn_lib.c:323:1: Parameter `*b->d`
      321.    */
      322.   
      323. > BIGNUM *bn_expand2(BIGNUM *b, int words)
      324.   {
      325.       bn_check_top(b);

crypto/bn/bn_lib.c:328:23: Call
      326.   
      327.       if (words > b->dmax) {
      328.           BN_ULONG *a = bn_expand_internal(b, words);
                                   ^
      329.           if (!a)
      330.               return NULL;

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

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

crypto/bn/bn_lib.c:272:5: Assignment
        270.   
        271.   #if 1
        272.       B = b->d;
                   ^
        273.       /* Check if the previous number needs to be copied */
        274.       if (B != NULL) {

crypto/bn/bn_lib.c:289:18: Array access: Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_lshift` 
        287.               a1 = B[1];
        288.               a2 = B[2];
        289.               a3 = B[3];
                                ^
        290.               A[0] = a0;
        291.               A[1] = a1;
