crypto/sm2/sm2_sign.c:334: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_mod_add`.
Showing all 26 steps of the trace


crypto/sm2/sm2_sign.c:326:9: Call
324.       ECDSA_SIG_get0(sig, &r, &s);
325.   
326.       if (BN_cmp(r, BN_value_one()) < 0
               ^
327.               || BN_cmp(s, BN_value_one()) < 0
328.               || BN_cmp(order, r) <= 0

crypto/bn/bn_lib.c:561:1: Parameter `a->top`
  559.   }
  560.   
  561. > int BN_cmp(const BIGNUM *a, const BIGNUM *b)
  562.   {
  563.       int i;

crypto/sm2/sm2_sign.c:327:16: Call
325.   
326.       if (BN_cmp(r, BN_value_one()) < 0
327.               || BN_cmp(s, BN_value_one()) < 0
                      ^
328.               || BN_cmp(order, r) <= 0
329.               || BN_cmp(order, s) <= 0) {

crypto/bn/bn_lib.c:561:1: Parameter `a->top`
  559.   }
  560.   
  561. > int BN_cmp(const BIGNUM *a, const BIGNUM *b)
  562.   {
  563.       int i;

crypto/sm2/sm2_sign.c:328:16: Call
326.       if (BN_cmp(r, BN_value_one()) < 0
327.               || BN_cmp(s, BN_value_one()) < 0
328.               || BN_cmp(order, r) <= 0
                      ^
329.               || BN_cmp(order, s) <= 0) {
330.           SM2err(SM2_F_SM2_SIG_VERIFY, SM2_R_BAD_SIGNATURE);

crypto/bn/bn_lib.c:561:1: Parameter `a->top`
  559.   }
  560.   
  561. > int BN_cmp(const BIGNUM *a, const BIGNUM *b)
  562.   {
  563.       int i;

crypto/sm2/sm2_sign.c:329:16: Call
327.               || BN_cmp(s, BN_value_one()) < 0
328.               || BN_cmp(order, r) <= 0
329.               || BN_cmp(order, s) <= 0) {
                      ^
330.           SM2err(SM2_F_SM2_SIG_VERIFY, SM2_R_BAD_SIGNATURE);
331.           goto done;

crypto/bn/bn_lib.c:561:1: Parameter `a->top`
  559.   }
  560.   
  561. > int BN_cmp(const BIGNUM *a, const BIGNUM *b)
  562.   {
  563.       int i;

crypto/sm2/sm2_sign.c:334:10: Call
332.       }
333.   
334.       if (!BN_mod_add(t, r, s, order, ctx)) {
                ^
335.           SM2err(SM2_F_SM2_SIG_VERIFY, ERR_R_BN_LIB);
336.           goto done;

crypto/bn/bn_mod.c:28:1: Parameter `m->top`
  26.   }
  27.   
  28. > int BN_mod_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  29.                  BN_CTX *ctx)
  30.   {

crypto/bn/bn_mod.c:33:12: Call
  31.       if (!BN_add(r, a, b))
  32.           return 0;
  33.       return BN_nnmod(r, r, m, ctx);
                   ^
  34.   }
  35.   

crypto/bn/bn_mod.c:13:1: Parameter `d->top`
    11.   #include "bn_lcl.h"
    12.   
    13. > int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx)
    14.   {
    15.       /*

crypto/bn/bn_mod.c:20:11: Call
    18.        */
    19.   
    20.       if (!(BN_mod(r, m, d, ctx)))
                    ^
    21.           return 0;
    22.       if (!r->neg)

crypto/bn/bn_div.c:250:31: Call
      248.   
      249.       /* First we normalise the numbers */
      250.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
                                           ^
      251.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
      252.           goto err;

crypto/bn/bn_lib.c:141:9: Assignment
        139.   
        140.       if (BN_is_zero(a))
        141.           return 0;
                       ^
        142.       return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));
        143.   }

crypto/bn/bn_div.c:250:5: Assignment
      248.   
      249.       /* First we normalise the numbers */
      250.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
                 ^
      251.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
      252.           goto err;

crypto/bn/bn_div.c:251:11: Call
      249.       /* First we normalise the numbers */
      250.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
      251.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
                       ^
      252.           goto err;
      253.       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:939:1: Parameter `*a->d`
          937.   }
          938.   
          939. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
          940.   {
          941.       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_add` 
        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.           }
