crypto/ec/ecdsa_ossl.c:140: error: BUFFER_OVERRUN_L3
  Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `ec_group_do_inverse_ord`.
Showing all 27 steps of the trace


crypto/ec/ecdsa_ossl.c:83:10: Call
81.       /* Preallocate space */
82.       order_bits = BN_num_bits(order);
83.       if (!BN_set_bit(k, order_bits)
               ^
84.           || !BN_set_bit(r, order_bits)
85.           || !BN_set_bit(X, order_bits))

crypto/bn/bn_lib.c:589:1: Parameter `a->top`
  587.   }
  588.   
  589. > int BN_set_bit(BIGNUM *a, int n)
  590.   {
  591.       int i, j, k;

crypto/ec/ecdsa_ossl.c:140:10: Call
138.   
139.       /* compute the inverse of k */
140.       if (!ec_group_do_inverse_ord(group, k, k, ctx)) {
                ^
141.           ECerr(EC_F_ECDSA_SIGN_SETUP, ERR_R_BN_LIB);
142.           goto err;

crypto/ec/ec_lib.c:1074:1: Parameter `x->top`
  1072.    * other functionality.
  1073.    */
  1074. > int ec_group_do_inverse_ord(const EC_GROUP *group, BIGNUM *res,
  1075.                               const BIGNUM *x, BN_CTX *ctx)
  1076.   {

crypto/ec/ec_lib.c:1080:16: Call
  1078.           return group->meth->field_inverse_mod_ord(group, res, x, ctx);
  1079.       else
  1080.           return ec_field_inverse_mod_ord(group, res, x, ctx);
                         ^
  1081.   }
  1082.   

crypto/ec/ec_lib.c:1020:1: Parameter `x->top`
    1018.   }
    1019.   
    1020. > static int ec_field_inverse_mod_ord(const EC_GROUP *group, BIGNUM *r,
    1021.                                       const BIGNUM *x, BN_CTX *ctx)
    1022.   {

crypto/ec/ec_lib.c:1049:10: Call
    1047.        * No need for scatter-gather or BN_FLG_CONSTTIME.
    1048.        */
    1049.       if (!BN_mod_exp_mont(r, x, e, group->order, ctx, group->mont_data))
                     ^
    1050.           goto err;
    1051.   

crypto/bn/bn_exp.c:296:1: Parameter `a->top`
      294.   }
      295.   
      296. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
      297.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
      298.   {

crypto/bn/bn_exp.c:310:16: Call
      308.               || BN_get_flags(a, BN_FLG_CONSTTIME) != 0
      309.               || BN_get_flags(m, BN_FLG_CONSTTIME) != 0) {
      310.           return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
                            ^
      311.       }
      312.   

crypto/bn/bn_exp.c:596:1: Parameter `a->top`
        594.    * http://www.daemonology.net/hyperthreading-considered-harmful/)
        595.    */
        596. > int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
        597.                                 const BIGNUM *m, BN_CTX *ctx,
        598.                                 BN_MONT_CTX *in_mont)

crypto/bn/bn_exp.c:759:17: Call
        757.           if (!BN_to_montgomery(&am, &am, mont, ctx))
        758.               goto err;
        759.       } else if (!BN_to_montgomery(&am, a, mont, ctx))
                               ^
        760.           goto err;
        761.   

crypto/bn/bn_lib.c:870:1: Parameter `a->top`
          868.   }
          869.   
          870. > int BN_to_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
          871.                        BN_CTX *ctx)
          872.   {

crypto/bn/bn_lib.c:873:12: Call
          871.                        BN_CTX *ctx)
          872.   {
          873.       return BN_mod_mul_montgomery(r, a, &(mont->RR), mont, ctx);
                            ^
          874.   }
          875.   

crypto/bn/bn_mont.c:26:1: Parameter `a->top`
            24.   #endif
            25.   
            26. > int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
            27.                             BN_MONT_CTX *mont, BN_CTX *ctx)
            28.   {

crypto/bn/bn_mont.c:53:14: Call
            51.       bn_check_top(tmp);
            52.       if (a == b) {
            53.           if (!BN_sqr(tmp, a, ctx))
                               ^
            54.               goto err;
            55.       } 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:105:1: <Offset trace>
103.   
104.   /* tmp must have 2*n words */
105. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
106.   {
107.       int i, j, max;

crypto/bn/bn_sqr.c:105:1: Parameter `n`
                103.   
                104.   /* tmp must have 2*n words */
                105. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
                106.   {
                107.       int i, j, max;

crypto/bn/bn_sqr.c:116:5: Assignment
                114.       rp[0] = rp[max - 1] = 0;
                115.       rp++;
                116.       j = n;
                           ^
                117.   
                118.       if (--j > 0) {

crypto/bn/bn_sqr.c:118:9: Assignment
                116.       j = n;
                117.   
                118.       if (--j > 0) {
                               ^
                119.           ap++;
                120.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);

crypto/bn/bn_sqr.c:105:1: <Length trace>
103.   
104.   /* tmp must have 2*n words */
105. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
106.   {
107.       int i, j, max;

crypto/bn/bn_sqr.c:105:1: Parameter `*r`
                103.   
                104.   /* tmp must have 2*n words */
                105. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
                106.   {
                107.       int i, j, max;

crypto/bn/bn_sqr.c:113:5: Assignment
                111.       max = n * 2;
                112.       ap = a;
                113.       rp = r;
                           ^
                114.       rp[0] = rp[max - 1] = 0;
                115.       rp++;

crypto/bn/bn_sqr.c:115:5: Assignment
                113.       rp = r;
                114.       rp[0] = rp[max - 1] = 0;
                115.       rp++;
                           ^
                116.       j = n;
                117.   

crypto/bn/bn_sqr.c:120:9: Array access: Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `ec_group_do_inverse_ord` 
                118.       if (--j > 0) {
                119.           ap++;
                120.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);
                               ^
                121.           rp += 2;
                122.       }
