crypto/ec/ecp_smpl.c:678: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned32 by call to `BN_mod_mul`.
Showing all 25 steps of the trace


crypto/ec/ecp_smpl.c:636:1: Parameter `ctx->stack.depth`
634.   
635.   
636. > int ec_GFp_simple_set_compressed_coordinates(const EC_GROUP *group, EC_POINT *point,
637.   	const BIGNUM *x_, int y_bit, BN_CTX *ctx)
638.   	{

crypto/ec/ecp_smpl.c:655:2: Call
653.   	y_bit = (y_bit != 0);
654.   
655.   	BN_CTX_start(ctx);
        ^
656.   	tmp1 = BN_CTX_get(ctx);
657.   	tmp2 = BN_CTX_get(ctx);

crypto/bn/bn_ctx.c:255:1: Parameter `ctx->stack.depth`
  253.   	}
  254.   
  255. > void BN_CTX_start(BN_CTX *ctx)
  256.   	{
  257.   	CTXDBG_ENTRY("BN_CTX_start", ctx);

crypto/ec/ecp_smpl.c:668:7: Call
666.   
667.   	/* tmp1 := x^3 */
668.   	if (!BN_nnmod(x, x_, &group->field,ctx)) goto err;
             ^
669.   	if (group->meth->field_decode == 0)
670.   		{

crypto/bn/bn_mod.c:127:1: Parameter `ctx->stack.depth`
  125.   
  126.   
  127. > int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx)
  128.   	{
  129.   	/* like BN_mod, but returns non-negative remainder

crypto/bn/bn_mod.c:132:8: Call
  130.   	 * (i.e.,  0 <= r < |d|  always holds) */
  131.   
  132.   	if (!(BN_mod(r,m,d,ctx)))
                ^
  133.   		return 0;
  134.   	if (!r->neg)

crypto/bn/bn_div.c:179:1: Parameter `ctx->stack.depth`
    177.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
    178.    */
    179. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
    180.   	   BN_CTX *ctx)
    181.   	{

crypto/ec/ecp_smpl.c:677:8: Call
675.   	else
676.   		{
677.   		if (!BN_mod_sqr(tmp2, x_, &group->field, ctx)) goto err;
              ^
678.   		if (!BN_mod_mul(tmp1, tmp2, x_, &group->field, ctx)) goto err;
679.   		}

crypto/bn/bn_mod.c:203:1: Parameter `ctx->stack.depth`
  201.   
  202.   
  203. > int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx)
  204.   	{
  205.   	if (!BN_sqr(r, a, ctx)) return 0;

crypto/bn/bn_mod.c:205:7: Call
  203.   int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx)
  204.   	{
  205.   	if (!BN_sqr(r, a, ctx)) return 0;
               ^
  206.   	/* r->neg == 0,  thus we don't need BN_nnmod */
  207.   	return BN_mod(r, r, m, ctx);

crypto/bn/bn_sqr.c:65:1: Parameter `ctx->stack.depth`
    63.   /* r must not be a */
    64.   /* I've just gone over this and it is now %20 faster on x86 - eay - 27 Jun 96 */
    65. > int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
    66.   	{
    67.   	int max,al;

crypto/ec/ecp_smpl.c:678:8: Call
676.   		{
677.   		if (!BN_mod_sqr(tmp2, x_, &group->field, ctx)) goto err;
678.   		if (!BN_mod_mul(tmp1, tmp2, x_, &group->field, ctx)) goto err;
              ^
679.   		}
680.   	

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

crypto/bn/bn_mod.c:188:2: Call
  186.   	bn_check_top(m);
  187.   
  188.   	BN_CTX_start(ctx);
          ^
  189.   	if ((t = BN_CTX_get(ctx)) == NULL) goto err;
  190.   	if (a == b)

crypto/bn/bn_ctx.c:255:1: Parameter `ctx->stack.depth`
    253.   	}
    254.   
    255. > void BN_CTX_start(BN_CTX *ctx)
    256.   	{
    257.   	CTXDBG_ENTRY("BN_CTX_start", ctx);

crypto/bn/bn_mod.c:193:10: Call
  191.   		{ if (!BN_sqr(t,a,ctx)) goto err; }
  192.   	else
  193.   		{ if (!BN_mul(t,a,b,ctx)) goto err; }
                  ^
  194.   	if (!BN_nnmod(r,t,m,ctx)) goto err;
  195.   	bn_check_top(r);

crypto/bn/bn_mul.c:941:1: Parameter `ctx->stack.depth`
    939.   #endif /* BN_RECURSION */
    940.   
    941. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
    942.   	{
    943.   	int ret=0;

crypto/bn/bn_mul.c:972:2: Call
    970.   	top=al+bl;
    971.   
    972.   	BN_CTX_start(ctx);
            ^
    973.   	if ((r == a) || (r == b))
    974.   		{

crypto/bn/bn_ctx.c:255:1: Parameter `ctx->stack.depth`
      253.   	}
      254.   
      255. > void BN_CTX_start(BN_CTX *ctx)
      256.   	{
      257.   	CTXDBG_ENTRY("BN_CTX_start", ctx);

crypto/bn/bn_mul.c:1098:2: Call
    1096.   err:
    1097.   	bn_check_top(r);
    1098.   	BN_CTX_end(ctx);
             ^
    1099.   	return(ret);
    1100.   	}

crypto/bn/bn_ctx.c:270:1: Parameter `ctx->stack.depth`
      268.   	}
      269.   
      270. > void BN_CTX_end(BN_CTX *ctx)
      271.   	{
      272.   	CTXDBG_ENTRY("BN_CTX_end", ctx);

crypto/bn/bn_ctx.c:277:21: Call
      275.   	else
      276.   		{
      277.   		unsigned int fp = BN_STACK_pop(&ctx->stack);
                                 ^
      278.   		/* Does this stack frame have anything to release? */
      279.   		if(fp < ctx->used)

crypto/bn/bn_ctx.c:351:1: <LHS trace>
349.   	}
350.   
351. > static unsigned int BN_STACK_pop(BN_STACK *st)
352.   	{
353.   	return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:351:1: Parameter `st->depth`
        349.   	}
        350.   
        351. > static unsigned int BN_STACK_pop(BN_STACK *st)
        352.   	{
        353.   	return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:353:9: Binary operation: ([0, +oo] - 1):unsigned32 by call to `BN_mod_mul` 
        351.   static unsigned int BN_STACK_pop(BN_STACK *st)
        352.   	{
        353.   	return st->indexes[--(st->depth)];
                       ^
        354.   	}
        355.   
