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


crypto/sm2/sm2_sign.c:137:14: Call
135.               continue;
136.   
137.           if (!BN_add(s, dA, BN_value_one())
                    ^
138.                   || !ec_group_do_inverse_ord(group, s, s, ctx)
139.                   || !BN_mod_mul(tmp, dA, r, order, ctx)

crypto/bn/bn_add.c:28:19: Call
  26.           if (cmp_res > 0) {
  27.               r_neg = a->neg;
  28.               ret = BN_usub(r, a, b);
                          ^
  29.           } else if (cmp_res < 0) {
  30.               r_neg = b->neg;

crypto/bn/bn_add.c:125:1: Parameter `r->top`
    123.   
    124.   /* unsigned subtraction of b from a, a must be larger than b. */
    125. > int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
    126.   {
    127.       int max, min, dif;

crypto/sm2/sm2_sign.c:138:21: Call
136.   
137.           if (!BN_add(s, dA, BN_value_one())
138.                   || !ec_group_do_inverse_ord(group, s, s, ctx)
                           ^
139.                   || !BN_mod_mul(tmp, dA, r, order, ctx)
140.                   || !BN_sub(tmp, k, tmp)

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:597:1: Parameter `a->top`
        595.    * http://www.daemonology.net/hyperthreading-considered-harmful/)
        596.    */
        597. > int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
        598.                                 const BIGNUM *m, BN_CTX *ctx,
        599.                                 BN_MONT_CTX *in_mont)

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

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:110:5: Assignment
                108.       rp[0] = rp[max - 1] = 0;
                109.       rp++;
                110.       j = n;
                           ^
                111.   
                112.       if (--j > 0) {

crypto/bn/bn_sqr.c:112:9: Assignment
                110.       j = n;
                111.   
                112.       if (--j > 0) {
                               ^
                113.           ap++;
                114.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);

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:109:5: Assignment
                107.       rp = r;
                108.       rp[0] = rp[max - 1] = 0;
                109.       rp++;
                           ^
                110.       j = n;
                111.   

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