crypto/bn/bn_nist.c:667: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_nnmod`.
Showing all 16 steps of the trace


crypto/bn/bn_nist.c:667:16: Call
665.   
666.       if (BN_is_negative(a) || BN_ucmp(a, &_bignum_nist_p_256_sqr) >= 0)
667.           return BN_nnmod(r, a, field, ctx);
                      ^
668.   
669.       i = BN_ucmp(field, a);

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: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:81:1: <Offset trace>
79.   }
80.   
81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
82.   {
83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:81:1: Parameter `n`
      79.   }
      80.   
      81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
      82.   {
      83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:95:5: Assignment
      93.       }
      94.   
      95.       nw = n / BN_BITS2;
                ^
      96.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
      97.           return (0);

crypto/bn/bn_shift.c:81:1: <Length trace>
79.   }
80.   
81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
82.   {
83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:81:1: Parameter `*r->d`
      79.   }
      80.   
      81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
      82.   {
      83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:96:9: Call
      94.   
      95.       nw = n / BN_BITS2;
      96.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                    ^
      97.           return (0);
      98.       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:102:5: Assignment
      100.       rb = BN_BITS2 - lb;
      101.       f = a->d;
      102.       t = r->d;
                 ^
      103.       t[a->top + nw] = 0;
      104.       if (lb == 0)

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