crypto/ec/ec_asn1.c:758: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `EC_POINT_oct2point`.
Showing all 28 steps of the trace


crypto/ec/ec_asn1.c:594:9: Call
592.           goto err;
593.       }
594.       a = BN_bin2bn(params->curve->a->data, params->curve->a->length, NULL);
               ^
595.       if (a == NULL) {
596.           ECerr(EC_F_EC_GROUP_NEW_FROM_ECPARAMETERS, ERR_R_BN_LIB);

crypto/bn/bn_lib.c:389:9: Assignment
  387.       n = len;
  388.       if (n == 0) {
  389.           ret->top = 0;
                 ^
  390.           return ret;
  391.       }

crypto/ec/ec_asn1.c:654:18: Call
652.               if (!BN_set_bit(p, (int)tmp_long))
653.                   goto err;
654.               if (!BN_set_bit(p, 0))
                        ^
655.                   goto err;
656.           } else if (tmp == NID_X9_62_ppBasis) {

crypto/bn/bn_lib.c:608:1: Parameter `a->top`
  606.   }
  607.   
  608. > int BN_set_bit(BIGNUM *a, int n)
  609.   {
  610.       int i, j, k;

crypto/ec/ec_asn1.c:758:10: Call
756.   
757.       /* extract the ec point */
758.       if (!EC_POINT_oct2point(ret, point, params->base->data,
                ^
759.                               params->base->length, NULL)) {
760.           ECerr(EC_F_EC_GROUP_NEW_FROM_ECPARAMETERS, ERR_R_EC_LIB);

crypto/ec/ec_oct.c:101:1: Parameter `group->field->top`
  99.   }
  100.   
  101. > int EC_POINT_oct2point(const EC_GROUP *group, EC_POINT *point,
  102.                          const unsigned char *buf, size_t len, BN_CTX *ctx)
  103.   {

crypto/ec/ec_oct.c:123:20: Call
  121.           }
  122.   #else
  123.               return ec_GF2m_simple_oct2point(group, point, buf, len, ctx);
                            ^
  124.   #endif
  125.       }

crypto/ec/ec2_oct.c:235:1: Parameter `group->field->top`
    233.    * simple implementation only uses affine coordinates.
    234.    */
    235. > int ec_GF2m_simple_oct2point(const EC_GROUP *group, EC_POINT *point,
    236.                                const unsigned char *buf, size_t len,
    237.                                BN_CTX *ctx)

crypto/ec/ec2_oct.c:304:14: Call
    302.   
    303.       if (form == POINT_CONVERSION_COMPRESSED) {
    304.           if (!EC_POINT_set_compressed_coordinates(group, point, x, y_bit, ctx))
                        ^
    305.               goto err;
    306.       } else {

crypto/ec/ec_oct.c:18:1: Parameter `group->field->top`
      16.   #include "ec_lcl.h"
      17.   
      18. > int EC_POINT_set_compressed_coordinates(const EC_GROUP *group, EC_POINT *point,
      19.                                           const BIGNUM *x, int y_bit, BN_CTX *ctx)
      20.   {

crypto/ec/ec_oct.c:34:20: Call
      32.       if (group->meth->flags & EC_FLAGS_DEFAULT_OCT) {
      33.           if (group->meth->field_type == NID_X9_62_prime_field)
      34.               return ec_GFp_simple_set_compressed_coordinates(group, point, x,
                               ^
      35.                                                               y_bit, ctx);
      36.           else

crypto/ec/ecp_oct.c:16:1: Parameter `group->field->top`
        14.   #include "ec_lcl.h"
        15.   
        16. > int ec_GFp_simple_set_compressed_coordinates(const EC_GROUP *group,
        17.                                                EC_POINT *point,
        18.                                                const BIGNUM *x_, int y_bit,

crypto/ec/ecp_oct.c:51:10: Call
        49.   
        50.       /* tmp1 := x^3 */
        51.       if (!BN_nnmod(x, x_, group->field, ctx))
                       ^
        52.           goto err;
        53.       if (group->meth->field_decode == 0) {

crypto/bn/bn_mod.c:13:1: Parameter `d->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:250:31: Call
            248.   
            249.       /* First we normalise the numbers */
            250.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
                                                 ^
            251.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
            252.           goto err;

crypto/bn/bn_lib.c:141:9: Assignment
              139.   
              140.       if (BN_is_zero(a))
              141.           return 0;
                             ^
              142.       return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));
              143.   }

crypto/bn/bn_div.c:250:5: Assignment
            248.   
            249.       /* First we normalise the numbers */
            250.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
                       ^
            251.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
            252.           goto err;

crypto/bn/bn_div.c:251:11: Call
            249.       /* First we normalise the numbers */
            250.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
            251.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
                             ^
            252.           goto err;
            253.       sdiv->neg = 0;

crypto/bn/bn_shift.c:83:1: <Offset trace>
81.   }
82.   
83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
84.   {
85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:83:1: Parameter `n`
              81.   }
              82.   
              83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
              84.   {
              85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:97:5: Assignment
              95.       }
              96.   
              97.       nw = n / BN_BITS2;
                         ^
              98.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
              99.           return 0;

crypto/bn/bn_shift.c:83:1: <Length trace>
81.   }
82.   
83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
84.   {
85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:83:1: Parameter `*r->d`
              81.   }
              82.   
              83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
              84.   {
              85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:98:9: Call
              96.   
              97.       nw = n / BN_BITS2;
              98.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                             ^
              99.           return 0;
              100.       r->neg = a->neg;

crypto/bn/bn_lib.c:939:1: Parameter `*a->d`
                937.   }
                938.   
                939. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
                940.   {
                941.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_shift.c:104:5: Assignment
              102.       rb = BN_BITS2 - lb;
              103.       f = a->d;
              104.       t = r->d;
                         ^
              105.       t[a->top + nw] = 0;
              106.       if (lb == 0)

crypto/bn/bn_shift.c:112:13: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `EC_POINT_oct2point` 
              110.           for (i = a->top - 1; i >= 0; i--) {
              111.               l = f[i];
              112.               t[nw + i + 1] |= (l >> rb) & BN_MASK2;
                                 ^
              113.               t[nw + i] = (l << lb) & BN_MASK2;
              114.           }
