crypto/ec/ecp_smpl.c:566: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_mod_sqr`.
Showing all 19 steps of the trace


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: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 `n->top`
    133.   }
    134.   
    135. > BIGNUM *int_bn_mod_inverse(BIGNUM *in,
    136.                              const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx,
    137.                              int *pnoinv)

crypto/ec/ecp_smpl.c:566:18: Call
564.                   goto err;
565.           } else {
566.               if (!BN_mod_sqr(Z_2, Z_1, group->field, ctx))
                        ^
567.                   goto err;
568.           }

crypto/bn/bn_mod.c:102:1: Parameter `m->top`
  100.   }
  101.   
  102. > int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx)
  103.   {
  104.       if (!BN_sqr(r, a, ctx))

crypto/bn/bn_mod.c:107:12: Call
  105.           return 0;
  106.       /* r->neg == 0,  thus we don't need BN_nnmod */
  107.       return BN_mod(r, r, m, ctx);
                    ^
  108.   }
  109.   

crypto/bn/bn_div.c:205:31: Call
    203.   
    204.       /* First we normalise the numbers */
    205.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
                                         ^
    206.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
    207.           goto err;

crypto/bn/bn_lib.c:167:9: Assignment
      165.   
      166.       if (BN_is_zero(a))
      167.           return 0;
                     ^
      168.       return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));
      169.   }

crypto/bn/bn_div.c:205:5: Assignment
    203.   
    204.       /* First we normalise the numbers */
    205.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
               ^
    206.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
    207.           goto err;

crypto/bn/bn_div.c:206:11: Call
    204.       /* First we normalise the numbers */
    205.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
    206.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
                     ^
    207.           goto err;
    208.       sdiv->neg = 0;

crypto/bn/bn_shift.c:83:1: <Offset trace>
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:83:1: Parameter `n`
      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:97:5: Assignment
      95.       }
      96.   
      97.       nw = n / BN_BITS2;
                 ^
      98.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
      99.           return (0);

crypto/bn/bn_shift.c:83:1: <Length trace>
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: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_shift.c:104:5: Assignment
      102.       rb = BN_BITS2 - lb;
      103.       f = a->d;
      104.       t = r->d;
                 ^
      105.       t[a->top + nw] = 0;
      106.       if (lb == 0)

crypto/bn/bn_shift.c:112:13: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_mod_sqr` 
      110.           for (i = a->top - 1; i >= 0; i--) {
      111.               l = f[i];
      112.               t[nw + i + 1] |= (l >> rb) & BN_MASK2;
                         ^
      113.               t[nw + i] = (l << lb) & BN_MASK2;
      114.           }
