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


crypto/ec/ecp_smpl.c:272:14: Call
270.               goto err;
271.       } else {
272.           if (!BN_copy(a, group->a))
                    ^
273.               goto err;
274.           if (!BN_copy(b, group->b))

crypto/bn/bn_lib.c:322:1: Parameter `a->top`
  320.   }
  321.   
  322. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
  323.   {
  324.       bn_check_top(b);

crypto/ec/ecp_smpl.c:287:14: Call
285.               goto err;
286.       } else if (!BN_is_zero(b)) {
287.           if (!BN_mod_sqr(tmp_1, a, p, ctx))
                    ^
288.               goto err;
289.           if (!BN_mod_mul(tmp_2, tmp_1, a, p, ctx))

crypto/bn/bn_mod.c:102:1: Parameter `*r->d`
  100.   }
  101.   
  102. > int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx)
  103.   {
  104.       if (!BN_sqr(r, a, ctx))

crypto/bn/bn_mod.c:104:10: Call
  102.   int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx)
  103.   {
  104.       if (!BN_sqr(r, a, ctx))
                  ^
  105.           return 0;
  106.       /* r->neg == 0,  thus we don't need BN_nnmod */

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 `BN_mod_sqr` 
      118.       if (--j > 0) {
      119.           ap++;
      120.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);
                     ^
      121.           rp += 2;
      122.       }
