crypto/ec/ecp_oct.c:60: error: BUFFER_OVERRUN_S2
  Offset: [max(16, `x_->top`), `x_->top`] (⇐ 1 + [-1+max(16, `x_->top`), `x_->top` - 1]) Size: [0, 8388607] by call to `BN_mod_sqr`.
Showing all 22 steps of the trace


crypto/ec/ecp_oct.c:37:12: Call
35.   
36.       BN_CTX_start(ctx);
37.       tmp1 = BN_CTX_get(ctx);
                 ^
38.       tmp2 = BN_CTX_get(ctx);
39.       x = BN_CTX_get(ctx);

crypto/bn/bn_ctx.c:229:5: Call
  227.       }
  228.       /* OK, make sure the returned bignum is "zero" */
  229.       BN_zero(ret);
             ^
  230.       ctx->used++;
  231.       CTXDBG_RET(ctx, ret);

crypto/bn/bn_lib.c:359:1: Parameter `*a->d`
    357.   }
    358.   
    359. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    360.   {
    361.       bn_check_top(a);

crypto/bn/bn_lib.c:362:9: Call
    360.   {
    361.       bn_check_top(a);
    362.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    363.           return 0;
    364.       a->neg = 0;

crypto/bn/bn_lcl.h:660:1: Parameter `*a->d`
      658.                            const BIGNUM *add, const BIGNUM *rem, BN_CTX *ctx);
      659.   
      660. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
      661.   {
      662.       if (bits > (INT_MAX - BN_BITS2 + 1))

crypto/ec/ecp_oct.c:60:14: Call
58.               goto err;
59.       } else {
60.           if (!BN_mod_sqr(tmp2, x_, group->field, ctx))
                   ^
61.               goto err;
62.           if (!BN_mod_mul(tmp1, tmp2, x_, group->field, ctx))

crypto/bn/bn_mod.c:222:1: Parameter `*r->d`
  220.   }
  221.   
  222. > int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx)
  223.   {
  224.       if (!BN_sqr(r, a, ctx))

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

crypto/bn/bn_sqr.c:17:1: Parameter `*r->d`
    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 ret = bn_sqr_fixed_top(r, a, ctx);

crypto/bn/bn_sqr.c:19:15: Call
    17.   int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
    18.   {
    19.       int ret = bn_sqr_fixed_top(r, a, ctx);
                        ^
    20.   
    21.       bn_correct_top(r);

crypto/bn/bn_sqr.c:27:1: Parameter `a->top`
      25.   }
      26.   
      27. > int bn_sqr_fixed_top(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
      28.   {
      29.       int max, al;

crypto/bn/bn_sqr.c:35:5: Assignment
      33.       bn_check_top(a);
      34.   
      35.       al = a->top;
                ^
      36.       if (al <= 0) {
      37.           r->top = 0;

crypto/bn/bn_sqr.c:84:17: Call
      82.                   if (bn_wexpand(tmp, max) == NULL)
      83.                       goto err;
      84.                   bn_sqr_normal(rr->d, a->d, al, tmp->d);
                            ^
      85.               }
      86.           }

crypto/bn/bn_sqr.c:109:1: <Offset trace>
107.   
108.   /* tmp must have 2*n words */
109. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
110.   {
111.       int i, j, max;

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

crypto/bn/bn_sqr.c:120:5: Assignment
        118.       rp[0] = rp[max - 1] = 0;
        119.       rp++;
        120.       j = n;
                   ^
        121.   
        122.       if (--j > 0) {

crypto/bn/bn_sqr.c:122:9: Assignment
        120.       j = n;
        121.   
        122.       if (--j > 0) {
                       ^
        123.           ap++;
        124.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);

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

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

crypto/bn/bn_sqr.c:117:5: Assignment
        115.       max = n * 2;
        116.       ap = a;
        117.       rp = r;
                   ^
        118.       rp[0] = rp[max - 1] = 0;
        119.       rp++;

crypto/bn/bn_sqr.c:119:5: Assignment
        117.       rp = r;
        118.       rp[0] = rp[max - 1] = 0;
        119.       rp++;
                   ^
        120.       j = n;
        121.   

crypto/bn/bn_sqr.c:124:9: Array access: Offset: [max(16, x_->top), x_->top] (⇐ 1 + [-1+max(16, x_->top), x_->top - 1]) Size: [0, 8388607] by call to `BN_mod_sqr` 
        122.       if (--j > 0) {
        123.           ap++;
        124.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);
                       ^
        125.           rp += 2;
        126.       }
