crypto/ec/ecdsa_ossl.c:243: error: BUFFER_OVERRUN_L3
  Offset: [31, +oo] Size: [0, 8388607] by call to `bn_to_mont_fixed_top`.
Showing all 17 steps of the trace


crypto/ec/ecdsa_ossl.c:212:10: Call
210.       if (8 * dgst_len > i)
211.           dgst_len = (i + 7) / 8;
212.       if (!BN_bin2bn(dgst, dgst_len, m)) {
                ^
213.           ECerr(EC_F_OSSL_ECDSA_SIGN_SIG, ERR_R_BN_LIB);
214.           goto err;

crypto/bn/bn_lib.c:372:1: Parameter `ret->top`
  370.   }
  371.   
  372. > BIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret)
  373.   {
  374.       unsigned int i, m;

crypto/ec/ecdsa_ossl.c:243:14: Call
241.            * below, returns user-visible value with removed zero padding.
242.            */
243.           if (!bn_to_mont_fixed_top(s, ret->r, group->mont_data, ctx)
                    ^
244.               || !bn_mul_mont_fixed_top(s, s, priv_key, group->mont_data, ctx)) {
245.               ECerr(EC_F_OSSL_ECDSA_SIGN_SIG, ERR_R_BN_LIB);

crypto/bn/bn_mont.c:210:1: Parameter `a->top`
  208.   }
  209.   
  210. > int bn_to_mont_fixed_top(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
  211.                            BN_CTX *ctx)
  212.   {

crypto/bn/bn_mont.c:213:12: Call
  211.                            BN_CTX *ctx)
  212.   {
  213.       return bn_mul_mont_fixed_top(r, a, &(mont->RR), mont, ctx);
                    ^
  214.   }
  215.   

crypto/bn/bn_mont.c:37:1: Parameter `b->top`
    35.   }
    36.   
    37. > int bn_mul_mont_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
    38.                             BN_MONT_CTX *mont, BN_CTX *ctx)
    39.   {

crypto/bn/bn_mont.c:67:14: Call
    65.       bn_check_top(tmp);
    66.       if (a == b) {
    67.           if (!BN_sqr(tmp, a, ctx))
                       ^
    68.               goto err;
    69.       } else {

crypto/bn/bn_sqr.c:17:1: Parameter `a->top`
      15.    * I've just gone over this and it is now %20 faster on x86 - eay - 27 Jun 96
      16.    */
      17. > int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
      18.   {
      19.       int max, al;

crypto/bn/bn_sqr.c:25:5: Assignment
      23.       bn_check_top(a);
      24.   
      25.       al = a->top;
                ^
      26.       if (al <= 0) {
      27.           r->top = 0;

crypto/bn/bn_sqr.c:74:17: Call
      72.                   if (bn_wexpand(tmp, max) == NULL)
      73.                       goto err;
      74.                   bn_sqr_normal(rr->d, a->d, al, tmp->d);
                            ^
      75.               }
      76.           }

crypto/bn/bn_sqr.c:99:1: <Offset trace>
97.   
98.   /* tmp must have 2*n words */
99. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
100.   {
101.       int i, j, max;

crypto/bn/bn_sqr.c:99:1: Parameter `n`
        97.   
        98.   /* tmp must have 2*n words */
        99. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
        100.   {
        101.       int i, j, max;

crypto/bn/bn_sqr.c:105:5: Assignment
        103.       BN_ULONG *rp;
        104.   
        105.       max = n * 2;
                   ^
        106.       ap = a;
        107.       rp = r;

crypto/bn/bn_sqr.c:99:1: <Length trace>
97.   
98.   /* tmp must have 2*n words */
99. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
100.   {
101.       int i, j, max;

crypto/bn/bn_sqr.c:99:1: Parameter `*r`
        97.   
        98.   /* tmp must have 2*n words */
        99. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
        100.   {
        101.       int i, j, max;

crypto/bn/bn_sqr.c:107:5: Assignment
        105.       max = n * 2;
        106.       ap = a;
        107.       rp = r;
                   ^
        108.       rp[0] = rp[max - 1] = 0;
        109.       rp++;

crypto/bn/bn_sqr.c:108:13: Array access: Offset: [31, +oo] Size: [0, 8388607] by call to `bn_to_mont_fixed_top` 
        106.       ap = a;
        107.       rp = r;
        108.       rp[0] = rp[max - 1] = 0;
                           ^
        109.       rp++;
        110.       j = n;
