crypto/bn/bn_mont.c:351: error: BUFFER_OVERRUN_L3
  Offset added: [8, +oo] Size: [0, +oo] by call to `BN_mod_inverse`.
Showing all 29 steps of the trace


crypto/bn/bn_mont.c:272:15: Call
270.   
271.       BN_CTX_start(ctx);
272.       if ((Ri = BN_CTX_get(ctx)) == NULL)
                     ^
273.           goto err;
274.       R = &(mont->RR);            /* grab RR as a temp */

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/bn/bn_mont.c:351:19: Call
349.           if (BN_is_one(&tmod))
350.               BN_zero(Ri);
351.           else if ((BN_mod_inverse(Ri, R, &tmod, ctx)) == NULL)
                         ^
352.               goto err;
353.           if (!BN_lshift(Ri, Ri, BN_BITS2))

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_gcd.c:155:16: Call
    153.       if ((BN_get_flags(a, BN_FLG_CONSTTIME) != 0)
    154.           || (BN_get_flags(n, BN_FLG_CONSTTIME) != 0)) {
    155.           return BN_mod_inverse_no_branch(in, a, n, ctx);
                          ^
    156.       }
    157.   

crypto/bn/bn_gcd.c:458:1: Parameter `*in->d`
      456.    * not contain branches that may leak sensitive information.
      457.    */
      458. > static BIGNUM *BN_mod_inverse_no_branch(BIGNUM *in,
      459.                                           const BIGNUM *a, const BIGNUM *n,
      460.                                           BN_CTX *ctx)

crypto/bn/bn_gcd.c:609:18: Call
      607.                   goto err;
      608.           } else {
      609.               if (!BN_nnmod(R, Y, n, ctx))
                              ^
      610.                   goto err;
      611.           }

crypto/bn/bn_mod.c:13:1: Parameter `*r->d`
        11.   #include "bn_lcl.h"
        12.   
        13. > int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx)
        14.   {
        15.       /*

crypto/bn/bn_mod.c:20:11: Call
        18.        */
        19.   
        20.       if (!(BN_mod(r, m, d, ctx)))
                        ^
        21.           return 0;
        22.       if (!r->neg)

crypto/bn/bn_div.c:209:1: Parameter `*rm->d`
          207.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
          208.    */
          209. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
          210.              BN_CTX *ctx)
          211.   {

crypto/bn/bn_div.c:229:11: Call
          227.       }
          228.   
          229.       ret = bn_div_fixed_top(dv, rm, num, divisor, ctx);
                           ^
          230.   
          231.       if (ret) {

crypto/bn/bn_div.c:264:1: Parameter `*rm->d`
            262.    *       divisor's length is considered public;
            263.    */
            264. > int bn_div_fixed_top(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num,
            265.                        const BIGNUM *divisor, BN_CTX *ctx)
            266.   {

crypto/bn/bn_div.c:449:9: Call
            447.       snum->flags |= BN_FLG_FIXED_TOP;
            448.       if (rm != NULL)
            449.           bn_rshift_fixed_top(rm, snum, norm_shift);
                           ^
            450.       BN_CTX_end(ctx);
            451.       return 1;

crypto/bn/bn_shift.c:214:1: Parameter `*r->d`
              212.    * |n < BN_BITS2| or |n / BN_BITS2| being non-secret.
              213.    */
              214. > int bn_rshift_fixed_top(BIGNUM *r, const BIGNUM *a, int n)
              215.   {
              216.       int i, top, nw;

crypto/bn/bn_shift.c:239:19: Call
              237.       mask |= mask >> 8;
              238.       top = a->top - nw;
              239.       if (r != a && bn_wexpand(r, top) == NULL)
                                       ^
              240.           return 0;
              241.   

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/bn/bn_lib.c:941:37: Call
                939.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
                940.   {
                941.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                                           ^
                942.   }
                943.   

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_mod_inverse` 
                    230.       assert(b->top <= words);
                    231.       if (b->top > 0)
                    232.           memcpy(a, b->d, sizeof(*a) * b->top);
                                   ^
                    233.   
                    234.       return a;
