crypto/srp/srp_lib.c:189: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned32 by call to `BN_mod_mul`.
Showing all 18 steps of the trace


crypto/srp/srp_lib.c:187:7: Call
185.   	/* B = g**b + k*v */
186.   
187.   	if (!BN_mod_exp(gb,g,b,N,bn_ctx) ||
             ^
188.   	   !(k = srp_Calc_k(N,g)) ||
189.   	   !BN_mod_mul(kv,v,k,N,bn_ctx) || 

crypto/bn/bn_exp.c:165:1: Parameter `ctx->stack.depth`
  163.   
  164.   
  165. > int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m,
  166.   	       BN_CTX *ctx)
  167.   	{

crypto/bn/bn_exp.c:221:8: Call
  219.   			{
  220.   			BN_ULONG A = a->d[0];
  221.   			ret=BN_mod_exp_mont_word(r,A,p,m,ctx,NULL);
                ^
  222.   			}
  223.   		else

crypto/bn/bn_exp.c:726:1: Parameter `ctx->stack.depth`
    724.   	}
    725.   
    726. > int BN_mod_exp_mont_word(BIGNUM *rr, BN_ULONG a, const BIGNUM *p,
    727.                            const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
    728.   	{

crypto/srp/srp_lib.c:189:6: Call
187.   	if (!BN_mod_exp(gb,g,b,N,bn_ctx) ||
188.   	   !(k = srp_Calc_k(N,g)) ||
189.   	   !BN_mod_mul(kv,v,k,N,bn_ctx) || 
            ^
190.   	   !BN_mod_add(B,gb,kv,N,bn_ctx))
191.   		{

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

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

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

crypto/bn/bn_mod.c:193:10: Call
  191.   	if ((t = BN_CTX_get(ctx)) == NULL) goto err;
  192.   	if (a == b)
  193.   		{ if (!BN_sqr(t,a,ctx)) goto err; }
                  ^
  194.   	else
  195.   		{ 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_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:257:1: Parameter `ctx->stack.depth`
      255.   	}
      256.   
      257. > void BN_CTX_start(BN_CTX *ctx)
      258.   	{
      259.   	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:272:1: Parameter `ctx->stack.depth`
      270.   	}
      271.   
      272. > void BN_CTX_end(BN_CTX *ctx)
      273.   	{
      274.   	CTXDBG_ENTRY("BN_CTX_end", ctx);

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

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

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

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