crypto/bn/bn_gf2m.c:1088: error: BUFFER_OVERRUN_L3
  Offset: 0 Size: [0, 8388607] by call to `BN_GF2m_mod_sqr_arr`.
Showing all 12 steps of the trace


crypto/bn/bn_gf2m.c:1044:9: Call
1042.   
1043.       BN_CTX_start(ctx);
1044.       a = BN_CTX_get(ctx);
                ^
1045.       z = BN_CTX_get(ctx);
1046.       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: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/bn/bn_gf2m.c:1088:22: Call
1086.                   goto err;
1087.               for (j = 1; j <= p[0] - 1; j++) {
1088.                   if (!BN_GF2m_mod_sqr_arr(z, z, p, ctx))
                             ^
1089.                       goto err;
1090.                   if (!BN_GF2m_mod_sqr_arr(w2, w, p, ctx))

crypto/bn/bn_gf2m.c:487:1: Parameter `*r->d`
  485.   
  486.   /* Square a, reduce the result mod p, and store it in a.  r could be a. */
  487. > int BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const int p[],
  488.                           BN_CTX *ctx)
  489.   {

crypto/bn/bn_gf2m.c:507:10: Call
  505.       s->top = 2 * a->top;
  506.       bn_correct_top(s);
  507.       if (!BN_GF2m_mod_arr(r, s, p))
                  ^
  508.           goto err;
  509.       bn_check_top(r);

crypto/bn/bn_gf2m.c:290:1: <Length trace>
288.   
289.   /* Performs modular reduction of a and store result in r.  r could be a. */
290. > int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const int p[])
291.   {
292.       int j, k;

crypto/bn/bn_gf2m.c:290:1: Parameter `*r->d`
    288.   
    289.   /* Performs modular reduction of a and store result in r.  r could be a. */
    290. > int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const int p[])
    291.   {
    292.       int j, k;

crypto/bn/bn_gf2m.c:316:5: Assignment
    314.           r->top = a->top;
    315.       }
    316.       z = r->d;
               ^
    317.   
    318.       /* start reduction */

crypto/bn/bn_gf2m.c:362:9: Array access: Offset: 0 Size: [0, 8388607] by call to `BN_GF2m_mod_sqr_arr` 
    360.           else
    361.               z[dN] = 0;
    362.           z[0] ^= zz;             /* reduction t^0 component */
                   ^
    363.   
    364.           for (k = 1; p[k] != 0; k++) {
