crypto/ec/ecp_oct.c:106: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_mod_sqrt`.
Showing all 24 steps of the trace


crypto/ec/ecp_oct.c:67:14: Call
65.           if (!BN_mod_sqr(tmp2, x_, group->field, ctx))
66.               goto err;
67.           if (!BN_mod_mul(tmp1, tmp2, x_, group->field, ctx))
                   ^
68.               goto err;
69.       }

crypto/bn/bn_mod.c:73:1: Parameter `r->top`
  71.   
  72.   /* slow but works */
  73. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  74.                  BN_CTX *ctx)
  75.   {

crypto/ec/ecp_oct.c:106:10: Call
104.       }
105.   
106.       if (!BN_mod_sqrt(y, tmp1, group->field, ctx)) {
                ^
107.           unsigned long err = ERR_peek_last_error();
108.   

crypto/bn/bn_sqrt.c:13:1: Parameter `a->top`
  11.   #include "bn_lcl.h"
  12.   
  13. > BIGNUM *BN_mod_sqrt(BIGNUM *in, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx)
  14.   /*
  15.    * Returns 'ret' such that ret^2 == a (mod p), using the Tonelli/Shanks

crypto/bn/bn_sqrt.c:45:9: Call
  43.       }
  44.   
  45.       if (BN_is_zero(a) || BN_is_one(a)) {
                ^
  46.           if (ret == NULL)
  47.               ret = BN_new();

crypto/bn/bn_lib.c:920:1: Parameter `a->top`
    918.   }
    919.   
    920. > int BN_is_zero(const BIGNUM *a)
    921.   {
    922.       return a->top == 0;

crypto/bn/bn_sqrt.c:45:26: Call
  43.       }
  44.   
  45.       if (BN_is_zero(a) || BN_is_one(a)) {
                                 ^
  46.           if (ret == NULL)
  47.               ret = BN_new();

crypto/bn/bn_lib.c:925:1: Parameter `a->top`
    923.   }
    924.   
    925. > int BN_is_one(const BIGNUM *a)
    926.   {
    927.       return BN_abs_is_word(a, 1) && !a->neg;

crypto/bn/bn_lib.c:927:12: Call
    925.   int BN_is_one(const BIGNUM *a)
    926.   {
    927.       return BN_abs_is_word(a, 1) && !a->neg;
                      ^
    928.   }
    929.   

crypto/bn/bn_lib.c:915:1: Parameter `a->top`
      913.   }
      914.   
      915. > int BN_abs_is_word(const BIGNUM *a, const BN_ULONG w)
      916.   {
      917.       return ((a->top == 1) && (a->d[0] == w)) || ((w == 0) && (a->top == 0));

crypto/bn/bn_sqrt.c:75:10: Call
  73.   
  74.       /* A = a mod p */
  75.       if (!BN_nnmod(A, a, p, ctx))
                 ^
  76.           goto end;
  77.   

crypto/bn/bn_mod.c:13:1: Parameter `m->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:140:1: Parameter `num->top`
      138.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
      139.    */
      140. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
      141.              BN_CTX *ctx)
      142.   {

crypto/bn/bn_div.c:210:11: Call
      208.       sdiv->neg = 0;
      209.       norm_shift += BN_BITS2;
      210.       if (!(BN_lshift(snum, num, norm_shift)))
                       ^
      211.           goto err;
      212.       snum->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_mod_sqrt` 
        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.           }
