crypto/ec/ecp_smpl.c:555: error: BUFFER_OVERRUN_L3
  Offset added: [8, +oo] Size: [0, +oo] by call to `BN_mod_inverse`.
Showing all 23 steps of the trace


crypto/ec/ecp_smpl.c:517:9: Call
515.   
516.       BN_CTX_start(ctx);
517.       Z = BN_CTX_get(ctx);
               ^
518.       Z_1 = BN_CTX_get(ctx);
519.       Z_2 = 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:395:1: Parameter `*a->d`
    393.   }
    394.   
    395. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    396.   {
    397.       bn_check_top(a);

crypto/bn/bn_lib.c:398:9: Call
    396.   {
    397.       bn_check_top(a);
    398.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    399.           return (0);
    400.       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/ec/ecp_smpl.c:555:14: Call
553.           }
554.       } else {
555.           if (!BN_mod_inverse(Z_1, Z_, group->field, ctx)) {
                    ^
556.               ECerr(EC_F_EC_GFP_SIMPLE_POINT_GET_AFFINE_COORDINATES,
557.                     ERR_R_BN_LIB);

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:148:16: Call
    146.       if ((BN_get_flags(a, BN_FLG_CONSTTIME) != 0)
    147.           || (BN_get_flags(n, BN_FLG_CONSTTIME) != 0)) {
    148.           return BN_mod_inverse_no_branch(in, a, n, ctx);
                          ^
    149.       }
    150.   

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

crypto/bn/bn_gcd.c:603:18: Call
      601.           /* Y*a == 1  (mod |n|) */
      602.           if (!Y->neg && BN_ucmp(Y, n) < 0) {
      603.               if (!BN_copy(R, Y))
                              ^
      604.                   goto err;
      605.           } else {

crypto/bn/bn_lib.c:323:1: Parameter `*a->d`
        321.   }
        322.   
        323. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
        324.   {
        325.       bn_check_top(b);

crypto/bn/bn_lib.c:329:9: Call
        327.       if (a == b)
        328.           return a;
        329.       if (bn_wexpand(a, b->top) == NULL)
                       ^
        330.           return NULL;
        331.   

crypto/bn/bn_lib.c:948:1: Parameter `*a->d`
          946.   }
          947.   
          948. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
          949.   {
          950.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:950:37: Call
          948.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
          949.   {
          950.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                                     ^
          951.   }
          952.   

crypto/bn/bn_lib.c:284:1: Parameter `*b->d`
            282.    */
            283.   
            284. > BIGNUM *bn_expand2(BIGNUM *b, int words)
            285.   {
            286.       bn_check_top(b);

crypto/bn/bn_lib.c:289:23: Call
            287.   
            288.       if (words > b->dmax) {
            289.           BN_ULONG *a = bn_expand_internal(b, words);
                                         ^
            290.           if (!a)
            291.               return NULL;

crypto/bn/bn_lib.c:246:1: <Offset 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 = NULL;

crypto/bn/bn_lib.c:246:1: Parameter `b->top`
              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 = 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 = 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 = NULL;

crypto/bn/bn_lib.c:271:9: Array access: Offset added: [8, +oo] Size: [0, +oo] by call to `BN_mod_inverse` 
              269.       assert(b->top <= words);
              270.       if (b->top > 0)
              271.           memcpy(a, b->d, sizeof(*a) * b->top);
                             ^
              272.   
              273.       return a;
