crypto/ec/ec_ameth.c:636: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `o2i_ECPublicKey`.
Showing all 30 steps of the trace


crypto/ec/ec_ameth.c:624:14: Call
622.           if (ecpeer == NULL)
623.               goto err;
624.           if (!EC_KEY_set_group(ecpeer, grp))
                    ^
625.               goto err;
626.       } else {

crypto/ec/ec_key.c:435:18: Call
  433.           return 0;
  434.       EC_GROUP_free(key->group);
  435.       key->group = EC_GROUP_dup(group);
                          ^
  436.       return (key->group == NULL) ? 0 : 1;
  437.   }

crypto/ec/ec_lib.c:279:10: Call
    277.       if ((t = EC_GROUP_new(a->meth)) == NULL)
    278.           return (NULL);
    279.       if (!EC_GROUP_copy(t, a))
                    ^
    280.           goto err;
    281.   

crypto/ec/ec_lib.c:175:1: Parameter `dest->order->top`
      173.   }
      174.   
      175. > int EC_GROUP_copy(EC_GROUP *dest, const EC_GROUP *src)
      176.   {
      177.       if (dest->meth->group_copy == 0) {

crypto/ec/ec_ameth.c:636:10: Call
634.       if (!p || !plen)
635.           goto err;
636.       if (!o2i_ECPublicKey(&ecpeer, &p, plen))
                ^
637.           goto err;
638.       pkpeer = EVP_PKEY_new();

crypto/ec/ec_asn1.c:1186:1: Parameter `(*a)->group->field->top`
  1184.   }
  1185.   
  1186. > EC_KEY *o2i_ECPublicKey(EC_KEY **a, const unsigned char **in, long len)
  1187.   {
  1188.       EC_KEY *ret = NULL;

crypto/ec/ec_asn1.c:1203:10: Call
  1201.           return 0;
  1202.       }
  1203.       if (!EC_POINT_oct2point(ret->group, ret->pub_key, *in, len, NULL)) {
                   ^
  1204.           ECerr(EC_F_O2I_ECPUBLICKEY, ERR_R_EC_LIB);
  1205.           return 0;

crypto/ec/ec_oct.c:165:1: Parameter `group->field->top`
    163.   }
    164.   
    165. > int EC_POINT_oct2point(const EC_GROUP *group, EC_POINT *point,
    166.                          const unsigned char *buf, size_t len, BN_CTX *ctx)
    167.   {

crypto/ec/ec_oct.c:187:20: Call
    185.           }
    186.   #else
    187.               return ec_GF2m_simple_oct2point(group, point, buf, len, ctx);
                              ^
    188.   #endif
    189.       }

crypto/ec/ec2_oct.c:293:1: Parameter `group->field->top`
      291.    * simple implementation only uses affine coordinates.
      292.    */
      293. > int ec_GF2m_simple_oct2point(const EC_GROUP *group, EC_POINT *point,
      294.                                const unsigned char *buf, size_t len,
      295.                                BN_CTX *ctx)

crypto/ec/ec2_oct.c:362:14: Call
      360.   
      361.       if (form == POINT_CONVERSION_COMPRESSED) {
      362.           if (!EC_POINT_set_compressed_coordinates_GF2m
                          ^
      363.               (group, point, x, y_bit, ctx))
      364.               goto err;

crypto/ec/ec_oct.c:106:1: Parameter `group->field->top`
        104.   
        105.   #ifndef OPENSSL_NO_EC2M
        106. > int EC_POINT_set_compressed_coordinates_GF2m(const EC_GROUP *group,
        107.                                                EC_POINT *point, const BIGNUM *x,
        108.                                                int y_bit, BN_CTX *ctx)

crypto/ec/ec_oct.c:123:20: Call
        121.       if (group->meth->flags & EC_FLAGS_DEFAULT_OCT) {
        122.           if (group->meth->field_type == NID_X9_62_prime_field)
        123.               return ec_GFp_simple_set_compressed_coordinates(group, point, x,
                                  ^
        124.                                                               y_bit, ctx);
        125.           else

crypto/ec/ecp_oct.c:70:1: Parameter `group->field->top`
          68.   #include "ec_lcl.h"
          69.   
          70. > int ec_GFp_simple_set_compressed_coordinates(const EC_GROUP *group,
          71.                                                EC_POINT *point,
          72.                                                const BIGNUM *x_, int y_bit,

crypto/ec/ecp_oct.c:105:10: Call
          103.   
          104.       /* tmp1 := x^3 */
          105.       if (!BN_nnmod(x, x_, group->field, ctx))
                          ^
          106.           goto err;
          107.       if (group->meth->field_decode == 0) {

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

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

crypto/bn/bn_div.c:253:31: Call
              251.   
              252.       /* First we normalise the numbers */
              253.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
                                                   ^
              254.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
              255.           goto err;

crypto/bn/bn_lib.c:220:9: Assignment
                218.   
                219.       if (BN_is_zero(a))
                220.           return 0;
                               ^
                221.       return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));
                222.   }

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

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

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

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

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

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

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

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

crypto/bn/bn_lib.c:1071:1: Parameter `*a->d`
                  1069.   }
                  1070.   
                  1071. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
                  1072.   {
                  1073.       return (words <= a->dmax) ? a : bn_expand2(a, words);

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

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