crypto/bn/bn_mod.c:194: error: INTEGER_OVERFLOW_L2
  ([0, 3+max(0, `ctx->stack.depth`)] - 1):unsigned32 by call to `BN_nnmod`.
Showing all 17 steps of the trace


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:191:10: Call
189.   	if ((t = BN_CTX_get(ctx)) == NULL) goto err;
190.   	if (a == b)
191.   		{ if (!BN_sqr(t,a,ctx)) goto err; }
                ^
192.   	else
193.   		{ if (!BN_mul(t,a,b,ctx)) goto err; }

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_mod.c:194:7: Call
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);
196.   	ret=1;

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/bn/bn_div.c:207:2: Call
    205.   		}
    206.   
    207.   	BN_CTX_start(ctx);
            ^
    208.   	tmp=BN_CTX_get(ctx);
    209.   	snum=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_div.c:392:2: Call
    390.   		bn_check_top(rm);
    391.   		}
    392.   	BN_CTX_end(ctx);
            ^
    393.   	return(1);
    394.   err:

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, 3+max(0, ctx->stack.depth)] - 1):unsigned32 by call to `BN_nnmod` 
        351.   static unsigned int BN_STACK_pop(BN_STACK *st)
        352.   	{
        353.   	return st->indexes[--(st->depth)];
                       ^
        354.   	}
        355.   
