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


crypto/ec/ecp_smpl.c:595:8: Call
593.   	else
594.   		{
595.   		if (!BN_mod_inverse(Z_1, Z_, &group->field, ctx))
              ^
596.   			{
597.   			ECerr(EC_F_EC_GFP_SIMPLE_POINT_GET_AFFINE_COORDINATES, ERR_R_BN_LIB);

crypto/bn/bn_gcd.c:209:1: Parameter `ctx->stack.depth`
  207.           const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx);
  208.   
  209. > BIGNUM *BN_mod_inverse(BIGNUM *in,
  210.   	const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
  211.   	{

crypto/bn/bn_gcd.c:224:2: Call
  222.   	bn_check_top(n);
  223.   
  224.   	BN_CTX_start(ctx);
          ^
  225.   	A = BN_CTX_get(ctx);
  226.   	B = 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/bn/bn_gcd.c:498:2: Call
  496.   err:
  497.   	if ((ret == NULL) && (in == NULL)) BN_free(R);
  498.   	BN_CTX_end(ctx);
          ^
  499.   	bn_check_top(ret);
  500.   	return(ret);

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/ec/ecp_smpl.c:608:9: Call
606.   		else
607.   			{
608.   			if (!BN_mod_sqr(Z_2, Z_1, &group->field, ctx)) goto err;
               ^
609.   			}
610.   	

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/bn/bn_sqr.c:83:2: Call
    81.   		}
    82.   
    83.   	BN_CTX_start(ctx);
           ^
    84.   	rr=(a != r) ? r : BN_CTX_get(ctx);
    85.   	tmp=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/bn/bn_sqr.c:153:2: Call
    151.   	bn_check_top(rr);
    152.   	bn_check_top(tmp);
    153.   	BN_CTX_end(ctx);
            ^
    154.   	return(ret);
    155.   	}

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_sqr` 
        351.   static unsigned int BN_STACK_pop(BN_STACK *st)
        352.   	{
        353.   	return st->indexes[--(st->depth)];
                       ^
        354.   	}
        355.   
