crypto/bn/bn_exp.c:579: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned32 by call to `BN_mod_mul_montgomery`.
Showing all 17 steps of the trace


crypto/bn/bn_exp.c:503:1: Parameter `ctx->stack.depth`
501.   	}
502.   
503. > int BN_mod_exp_mont_word(BIGNUM *rr, BN_ULONG a, const BIGNUM *p,
504.                            const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
505.   	{

crypto/bn/bn_exp.c:551:2: Call
549.   		}
550.   
551.   	BN_CTX_start(ctx);
        ^
552.   	d = BN_CTX_get(ctx);
553.   	r = BN_CTX_get(ctx);

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

crypto/bn/bn_exp.c:579:10: Call
577.   			if (r_is_one)
578.   				{
579.   				if (!BN_TO_MONTGOMERY_WORD(r, w, mont)) goto err;
                ^
580.   				r_is_one = 0;
581.   				}

crypto/bn/bn_mont.c:72:1: Parameter `ctx->stack.depth`
  70.   #define MONT_WORD /* use the faster word-based algorithm */
  71.   
  72. > int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  73.   			  BN_MONT_CTX *mont, BN_CTX *ctx)
  74.   	{

crypto/bn/bn_mont.c:78:2: Call
  76.   	int ret=0;
  77.   
  78.   	BN_CTX_start(ctx);
         ^
  79.   	tmp = BN_CTX_get(ctx);
  80.   	if (tmp == NULL) goto err;

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

crypto/bn/bn_mont.c:85:8: Call
  83.   	if (a == b)
  84.   		{
  85.   		if (!BN_sqr(tmp,a,ctx)) goto err;
               ^
  86.   		}
  87.   	else

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:254:1: Parameter `ctx->stack.depth`
      252.   	}
      253.   
      254. > void BN_CTX_start(BN_CTX *ctx)
      255.   	{
      256.   	CTXDBG_ENTRY("BN_CTX_start", ctx);

crypto/bn/bn_sqr.c:153:2: Call
    151.   	if(rr) bn_check_top(rr);
    152.   	if(tmp) 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_mul_montgomery` 
        351.   static unsigned int BN_STACK_pop(BN_STACK *st)
        352.   	{
        353.   	return st->indexes[--(st->depth)];
                       ^
        354.   	}
        355.   
