crypto/ec/ecp_oct.c:60: error: BUFFER_OVERRUN_L3
  Offset: [1, 29] Size: [0, 8388607] by call to `BN_mod_sqr`.
Showing all 18 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:387:1: Parameter `*a->d`
    385.   }
    386.   
    387. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    388.   {
    389.       bn_check_top(a);

crypto/bn/bn_lib.c:390:9: Call
    388.   {
    389.       bn_check_top(a);
    390.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    391.           return 0;
    392.       a->neg = 0;

crypto/bn/bn_lcl.h:651:1: Parameter `*a->d`
      649.                            const BIGNUM *add, const BIGNUM *rem, BN_CTX *ctx);
      650.   
      651. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
      652.   {
      653.       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: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:60:13: Call
    58.           if (al < BN_SQR_RECURSIVE_SIZE_NORMAL) {
    59.               BN_ULONG t[BN_SQR_RECURSIVE_SIZE_NORMAL * 2];
    60.               bn_sqr_normal(rr->d, a->d, al, t);
                      ^
    61.           } else {
    62.               int j, k;

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:111:5: Assignment
      109.       BN_ULONG *rp;
      110.   
      111.       max = n * 2;
                 ^
      112.       ap = a;
      113.       rp = r;

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:114:13: Array access: Offset: [1, 29] Size: [0, 8388607] by call to `BN_mod_sqr` 
      112.       ap = a;
      113.       rp = r;
      114.       rp[0] = rp[max - 1] = 0;
                         ^
      115.       rp++;
      116.       j = n;
