crypto/bn/bn_gf2m.c:892: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned32 by call to `BN_GF2m_mod_sqr_arr`.
Showing all 13 steps of the trace


crypto/bn/bn_gf2m.c:856:1: Parameter `ctx->stack.depth`
854.    * Uses algorithms A.4.7 and A.4.6 from IEEE P1363.
855.    */
856. > int BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a_, const int p[], BN_CTX *ctx)
857.   	{
858.   	int ret = 0, count = 0;

crypto/bn/bn_gf2m.c:871:2: Call
869.   		}
870.   
871.   	BN_CTX_start(ctx);
        ^
872.   	a = BN_CTX_get(ctx);
873.   	z = 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_gf2m.c:892:9: Call
890.   		for (j = 1; j <= (p[0] - 1) / 2; j++)
891.   			{
892.   			if (!BN_GF2m_mod_sqr_arr(z, z, p, ctx)) goto err;
               ^
893.   			if (!BN_GF2m_mod_sqr_arr(z, z, p, ctx)) goto err;
894.   			if (!BN_GF2m_add(z, z, a)) goto err;

crypto/bn/bn_gf2m.c:457:1: Parameter `ctx->stack.depth`
  455.   
  456.   /* Square a, reduce the result mod p, and store it in a.  r could be a. */
  457. > int	BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const int p[], BN_CTX *ctx)
  458.   	{
  459.   	int i, ret = 0;

crypto/bn/bn_gf2m.c:463:2: Call
  461.   
  462.   	bn_check_top(a);
  463.   	BN_CTX_start(ctx);
          ^
  464.   	if ((s = BN_CTX_get(ctx)) == NULL) return 0;
  465.   	if (!bn_wexpand(s, 2 * a->top)) goto err;

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_gf2m.c:479:2: Call
  477.   	ret = 1;
  478.   err:
  479.   	BN_CTX_end(ctx);
          ^
  480.   	return ret;
  481.   	}

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