crypto/ec/ecp_oct.c:156: 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:117:14: Call
115.           if (!BN_mod_sqr(tmp2, x_, group->field, ctx))
116.               goto err;
117.           if (!BN_mod_mul(tmp1, tmp2, x_, group->field, ctx))
                    ^
118.               goto err;
119.       }

crypto/bn/bn_mod.c:179:1: Parameter `r->top`
  177.   
  178.   /* slow but works */
  179. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  180.                  BN_CTX *ctx)
  181.   {

crypto/ec/ecp_oct.c:156:10: Call
154.       }
155.   
156.       if (!BN_mod_sqrt(y, tmp1, group->field, ctx)) {
                ^
157.           unsigned long err = ERR_peek_last_error();
158.   

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

crypto/bn/bn_sqrt.c:95:9: Call
  93.       }
  94.   
  95.       if (BN_is_zero(a) || BN_is_one(a)) {
                ^
  96.           if (ret == NULL)
  97.               ret = BN_new();

crypto/bn/bn_lib.c:899:1: Parameter `a->top`
    897.   }
    898.   
    899. > int BN_is_zero(const BIGNUM *a)
    900.   {
    901.       return a->top == 0;

crypto/bn/bn_sqrt.c:95:26: Call
  93.       }
  94.   
  95.       if (BN_is_zero(a) || BN_is_one(a)) {
                                 ^
  96.           if (ret == NULL)
  97.               ret = BN_new();

crypto/bn/bn_lib.c:904:1: Parameter `a->top`
    902.   }
    903.   
    904. > int BN_is_one(const BIGNUM *a)
    905.   {
    906.       return BN_abs_is_word(a, 1) && !a->neg;

crypto/bn/bn_lib.c:906:12: Call
    904.   int BN_is_one(const BIGNUM *a)
    905.   {
    906.       return BN_abs_is_word(a, 1) && !a->neg;
                      ^
    907.   }
    908.   

crypto/bn/bn_lib.c:894:1: Parameter `a->top`
      892.   }
      893.   
      894. > int BN_abs_is_word(const BIGNUM *a, const BN_ULONG w)
      895.   {
      896.       return ((a->top == 1) && (a->d[0] == w)) || ((w == 0) && (a->top == 0));

crypto/bn/bn_sqrt.c:125:10: Call
  123.   
  124.       /* A = a mod p */
  125.       if (!BN_nnmod(A, a, p, ctx))
                  ^
  126.           goto end;
  127.   

crypto/bn/bn_mod.c:119:1: Parameter `m->top`
    117.   #include "bn_lcl.h"
    118.   
    119. > int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx)
    120.   {
    121.       /*

crypto/bn/bn_mod.c:126:11: Call
    124.        */
    125.   
    126.       if (!(BN_mod(r, m, d, ctx)))
                     ^
    127.           return 0;
    128.       if (!r->neg)

crypto/bn/bn_div.c:189:1: Parameter `num->top`
      187.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
      188.    */
      189. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
      190.              BN_CTX *ctx)
      191.   {

crypto/bn/bn_div.c:259:11: Call
      257.       sdiv->neg = 0;
      258.       norm_shift += BN_BITS2;
      259.       if (!(BN_lshift(snum, num, norm_shift)))
                       ^
      260.           goto err;
      261.       snum->neg = 0;

crypto/bn/bn_shift.c:130:1: <Offset trace>
128.   }
129.   
130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
131.   {
132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:130:1: Parameter `n`
        128.   }
        129.   
        130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
        131.   {
        132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:145:5: Assignment
        143.   
        144.       r->neg = a->neg;
        145.       nw = n / BN_BITS2;
                   ^
        146.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
        147.           return (0);

crypto/bn/bn_shift.c:130:1: <Length trace>
128.   }
129.   
130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
131.   {
132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:130:1: Parameter `*r->d`
        128.   }
        129.   
        130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
        131.   {
        132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:146:9: Call
        144.       r->neg = a->neg;
        145.       nw = n / BN_BITS2;
        146.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                       ^
        147.           return (0);
        148.       lb = n % BN_BITS2;

crypto/bn/bn_lib.c:995:1: Parameter `*a->d`
          993.   }
          994.   
          995. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
          996.   {
          997.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_shift.c:151:5: Assignment
        149.       rb = BN_BITS2 - lb;
        150.       f = a->d;
        151.       t = r->d;
                   ^
        152.       t[a->top + nw] = 0;
        153.       if (lb == 0)

crypto/bn/bn_shift.c:159:13: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_mod_sqrt` 
        157.           for (i = a->top - 1; i >= 0; i--) {
        158.               l = f[i];
        159.               t[nw + i + 1] |= (l >> rb) & BN_MASK2;
                           ^
        160.               t[nw + i] = (l << lb) & BN_MASK2;
        161.           }
